úÎ-B*U,      !"#$%&'()*+GHC experimentalsuperbobry@gmail.com Safe-Inferred+A bit set with unspecified container type. #Number of elements in the bit set. Bit container. O(1). Is the bit set empty? O(1)). The number of elements in the bit set. O(d)*. Ask whether the item is in the bit set. O(d)*. 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)9. Is this a proper subset? (ie. a subset but not equal). The empty bit set. O(1). Create a singleton set. O(d)#. Insert an item into the bit set. O(d)#. 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(d * n)8 Transform this bit set by applying a function to every < value. Resulting bit set may be smaller then the original. O(d * n); Filter this bit set by retaining only elements satisfying  predicate. O(d * n)1. Convert the bit set set to a list of elements. O(d * n)*. Make a bit set from a list of elements.  ,-./012    ,-./012GHC experimentalsuperbobry@gmail.comNoneA wrapper around 3- which provides faster bit-level operations. O(1). Is the bit set empty? O(1)). The number of elements in the bit set. O(1)*. Ask whether the item is in the bit set. O(1)*. 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)9. Is this a proper subset? (ie. a subset but not equal). The empty bit set. O(1). Create a singleton set. !O(1)#. Insert an item into the bit set. "O(1)#. 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)? Transform this bit set by applying a function to every value. 5 Resulting bit set may be smaller then the original. )O(n)= Filter this bit set by retaining only elements satisfying a  predicate. *O(n)1. Convert the bit set set to a list of elements. +O(n)*. Make a bit set from a list of elements. 45 !"#$%&'()*+678 !"#$%&'()*+& !"#$%'()*+45 !"#$%&'()*+678GHC experimentalsuperbobry@gmail.comNone !"#$%&'()*+9           !"#$%&'()* bitset-1.3.0Data.BitSet.GenericData.BitSet.Dynamic Data.BitSetGBitSetBitSet_n_bitsnullsizemember notMember isSubsetOfisProperSubsetOfempty singletoninsertdeleteunionunions difference\\ intersectionmapfiltertoListfromList FasterInteger$fFoldableGBitSet$fNFDataGBitSet$fMonoidGBitSet $fShowGBitSet $fReadGBitSet $fOrdGBitSet $fEqGBitSet integer-gmpGHC.Integer.TypeIntegerunFIpopCountIntegertestBitInteger$fBitsFasterInteger