úÎTVOýB      !"#$%&'()*+,-./0123456789:;<=>?@AGHC experimentalsuperbobry@gmail.comNone+A bit set with unspecified container type. B#Number of elements in the bit set. CBit 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)). 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): Reduce this bit set by applying a binary function to all D elements, using the given starting value. Each application of the B operator is evaluated before before using the result in the next > application. This function is strict in the starting value. O(d * n)6 Reduce this bit set by applying a binary function to / all elements, using the given starting value. O(d * n); Filter this bit set by retaining only elements satisfying  predicate. O(d * n)2. Convert this bit set set to a list of elements. O(d * n)*. Make a bit set from a list of elements. O(1)=. Internal function, which extracts the underlying container  from the bit set. O(1)?. Internal function, which constructs a bit set, using a given / container value. Highly unsafe, because we don't check if bits in the 3 given value correspond to valid instances of type a. "DBC EFGHIJKL    DBC EFGHIJKLGHC experimentalsuperbobry@gmail.comNoneO(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(1). Is this a subset? (s1 isSubsetOf s2) tells whether  s1 is a subset of s2. O(1)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(1). The union of two bit sets. #O(1). Difference of two bit sets. $O(1). See #. %O(1)$. 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): Reduce this bit set by applying a binary function to all D elements, using the given starting value. Each application of the B operator is evaluated before before using the result in the next > application. This function is strict in the starting value. (O(n): Reduce this bit set by applying a binary function to all + elements, using the given starting value. )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.  !"#$%&'()*+ !"#$%&'()*+$ !"#%&'()*+ !"#$%&'()*+GHC experimentalsuperbobry@gmail.comNone-A wrapper around M- which provides faster bit-level operations. .O(1). Is the bit set empty? /O(1)). The number of elements in the bit set. 0O(1)*. Ask whether the item is in the bit set. 1O(1)*. Ask whether the item is in the bit set. 2 O(max(n, m)). Is this a subset? (s1 isSubsetOf s2) tells whether  s1 is a subset of s2. 3 O(max(n, m)9. Is this a proper subset? (ie. a subset but not equal). 4The empty bit set. 5O(1). Create a singleton set. 6O(1)#. Insert an item into the bit set. 7O(1)#. Delete an item from the bit set. 8 O(max(m, n)). The union of two bit sets. 9O(1). Difference of two bit sets. :O(1). See 9. ;O(1)$. 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): Reduce this bit set by applying a binary function to all D elements, using the given starting value. Each application of the B operator is evaluated before before using the result in the next > application. This function is strict in the starting value. >O(n): Reduce this bit set by applying a binary function to all + elements, using the given starting value. ?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. AO(n)*. Make a bit set from a list of elements. ,-NO./0123456789:;<=>?@APQRST,-./0123456789:;<=>?@A-,:4567./012389;<=>?@A,-NO./0123456789:;<=>?@APQRSTGHC experimentalsuperbobry@gmail.comNone,-./0123456789:;<=>?@AU                !"#$%&'()*+,-./01 bitset-1.4.1Data.BitSet.GenericData.BitSet.WordData.BitSet.Dynamic Data.BitSetGBitSetnullsizemember notMember isSubsetOfisProperSubsetOfempty singletoninsertdeleteunion difference\\ intersectionmapfoldl'foldrfiltertoListfromListtoBitsunsafeFromBitsBitSet FasterInteger_n_bits$fFoldableGBitSet$fStorableGBitSet$fNFDataGBitSet$fMonoidGBitSet $fShowGBitSet $fReadGBitSet $fOrdGBitSet $fEqGBitSet integer-gmpGHC.Integer.TypeIntegerunFIpopCountInteger divModInt#abs#testBitInteger$fBitsFasterInteger