Re: [Haskell-cafe] O(n) algorithm for determining subset

It's simpler: "x&~y == 0" 2009/11/15 Michael Mossey <mpm@alumni.caltech.edu>:

Can someone tell me if this is correct. I'm guessing that if I represent two sets of integers by Word32 (where ith bit set means i is in the set), then an algorithm to determine if x is a subset of y would go something like

 (y - x) == (y `exclusiveOr` x)

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

-- Eugene Kirpichov Web IR developer, market.yandex.ru