Safe Haskell | None |
---|

Bit sets represent sets of integers by setting bit i to 1 iff i is in the set. This means they can effeciently support many operations, like union (bitwise or), intersection (bitwise and) etc. However, they obviously can only represent sets of relatively small integers, as they require O(max(S)) bits.