úÎ-}*,      !"#$%&'()*+portable experimentalekmett@gmail.comD,-1A conservative upper bound on the element count. A If negative, we are complemented with respect to the universe .1A conservative lower bound on the element count. A If negative, we are complemented with respect to the universe /KLazy element count used when the above two disagree. O(1) environment size 0CLow water mark. index of the least element potentially in the set. 1GHigh water mark. index of the greatest element potentially in the set. 2,the set of bits starting from the exponent. B if negative, then we are complemented with respect to universe 34567EInternal smart constructor. Forces count whenever it is pigeonholed. 8O(d) where d0 is absolute deviation in fromEnum over the set O(1) The empty set. Permits O(1) null and size. O(1) Construct a CharSet with a single element. Permits O(1) null and size O(1|d) Is the ' empty? May be faster than checking if  == 0 after union. 0 Operations that require a recount are noted. O(1|d)( The number of elements in the bit set. O(d) A / containing every member of the enumeration of a. O(d) Complements a  with respect to the bounds of a. Preserves order of  and  O(d * n) Make a  from a list of items. O(d * n) Make a ) from a distinct ascending list of items O(d)! Insert a single element of type a into the . Preserves order of  and  O(d) Delete a single item from the . Preserves order of  and  O(1) Test for membership in a  O(1) Alias for member O(1) Alias for notMember O(d)B convert to an Integer representation. Discards negative elements O(d) . May force  to take O(d)' if ranges overlap, preserves order of  9O(1)6 check to see if we are represented as a complemented . O(d) . May force  and  both to take O(d). :O(d) . May force  and  both to take O(d). ;2Unsafe internal method for computing differences  preconditions:  m >= 0, m' >= 0, a  = -1, a' = -1, b = 0, b' = 0 <O(d). Preserves order of  . May force O(d) . O(d). Preserves order of  . May force O(d) . =,Return a charset based on a character range >O(d) ?O(d)O. Computes the equivalent of (truncate . logBase 2 . abs) extended with 0 at 0 X This could be computed faster by directly appealing to GMP, but that is tricky in GHC.  !"#$%&'()*+@ABC,  !"#$%&'()*+,    !"#$%&'()*+,  !"#$%&'()*+D      !"#$%&'()*+,-./0123456789:;<=>?@ABCDE charset-0.0 Data.CharSetUnicodeCategoryCharSetempty singletonnullsizefull complementfromListfromDistinctAscListinsertdeletememberelemnotElem toIntegerunionisComplemented intersection\\toArraybuild posixAsciiunicodeCategoriescontrolspacelowerupperalphaalphaNumprintdigitoctDigitlettermarknumber punctuationsymbol separatorasciilatin1 asciiUpper asciiLowerCS _countAtLeast _countAtMost_countexponent_hwmmantissauluholohbstoListunion' intersection'diff differencerangerecounthwm charSetTyConfromListConstrcomplementConstrcharSetDataType