úΈ;      Safe-InferredO(1). Is the bit set empty? O(1)). The number of elements in the bit set. O(testBit on Integer)*. Ask whether the item is in the bit set. O(testBit on Integer)*. Ask whether the item is in the bit set.  O(max(n, m)).. Is this a subset? (s1 isSubsetOf s2) tells whether  s1 is a subset of s2.  O(max(n, m):.. Is this a proper subset? (ie. a subset but not equal). The empty bit set. .O(setBit on Integer). Create a singleton set. O(setBit on Integer)#. Insert an item into the bit set. O(clearBit on Integer)#. Delete an item from the bit set.  O(max(m, n)). The union of two bit sets.  O(max(m, n))#. The union of a list of bit sets.  O(max(m, n)). Difference of two bit sets.  O(max(m, n)). See  .  O(max(m, n))$. The intersection of two bit sets. O(n * shiftR on Integer). An alias to toList. O(n * shiftR on Integer)+. Convert a bit set to a list of elements. O(n * setBit on Integer)*. Make a bit set from a list of elements. O(1)). Project a bit set to an integral type. O(n)8. Make a bit set from an integral. Unsafe because we don't D checked whether the bits set in a given value correspond to values  of type a9. This is only useful as a more efficient alternative to  fromList.           bitset-1.2 Data.BitSetBitSetnullsizemember notMember isSubsetOfisProperSubsetOfempty singletoninsertdeleteunionunions difference\\ intersectionelemstoListfromList toIntegralunsafeFromIntegral$fNFDataBitSet $fShowBitSet$fMonoidBitSet