Îõ³h& ˜*î      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm Safe-InferredÈÜï bitwise-enum*Memoize a function with a single argument. bitwise-enum&Memoize a function with two arguments. bitwise-enum(Memoize a function with three arguments. bitwise-enum'Memoize a function with four arguments. bitwise-enum'Memoize a function with five arguments. Safe-Inferred-016ÄÅÈÌÑÚÜ`. bitwise-enumA set of values a with representation word%, implemented as bitwise operations. bitwise-enumO(1). The empty set. bitwise-enumO(1). A set of one element. bitwise-enumO(n)5. Create a set from a finite foldable data structure.  bitwise-enumO(1). Add a value to the set.  bitwise-enumO(1). Delete a value in the set.  bitwise-enumO(1)#. Is the value a member of the set?  bitwise-enumO(1). Is the value not in the set?  bitwise-enumO(1). Is this the empty set? bitwise-enumO(1)$. The number of elements in the set. bitwise-enumO(1). Is this a subset? (s1 `isSubsetOf` s2) tells whether s1 is a subset of s2. bitwise-enumO(1). The union of two sets. bitwise-enumO(1). Difference between two sets. bitwise-enumO(1). See . bitwise-enumO(1)1. Elements which are in either set, but not both. bitwise-enumO(1). The intersection of two sets. bitwise-enumO(n)2. Filter all elements that satisfy some predicate. bitwise-enumO(n)£. Partition the set according to some predicate. The first set contains all elements that satisfy the predicate, the second all elements that fail the predicate. bitwise-enumO(n).  f s! is the set obtained by applying f to each element of s.ËIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y. bitwise-enumO(n). Apply Ù while converting the underlying representation of the set to some other representation. bitwise-enumO(n) . Left fold. bitwise-enumO(n)$. Left fold with strict accumulator. bitwise-enumO(n) . Right fold. bitwise-enumO(n)%. Right fold with strict accumulator. bitwise-enumO(n). Left fold on non-empty sets. bitwise-enumO(n)6. Left fold on non-empty sets with strict accumulator. bitwise-enumO(n). Right fold on non-empty sets.  bitwise-enumO(n)7. Right fold on non-empty sets with strict accumulator.! bitwise-enumO(n)Ê. Map each element of the structure to a monoid, and combine the results.# bitwise-enumO(n)/. Check if all elements satisfy some predicate.$ bitwise-enumO(n)0. Check if any element satisfies some predicate.% bitwise-enumO(1)). The minimal element of a non-empty set.& bitwise-enumO(1)). The maximal element of a non-empty set.' bitwise-enumO(1). Delete the minimal element.( bitwise-enumO(1). Delete the maximal element.) bitwise-enumO(1)ö. Retrieves the minimal element of the set, and the set stripped of that element, or Nothing if passed an empty set.* bitwise-enumO(1)ö. Retrieves the maximal element of the set, and the set stripped of that element, or Nothing if passed an empty set.+ bitwise-enumO(n)&. Convert the set to a list of values., bitwise-enumO(1)#. Convert a representation into an EnumSet'. Intended for use with foreign types.- bitwise-enumO(1) . Convert an EnumSet? into its representation. Intended for use with foreign types.n bitwise-enumLeast significant bit.o bitwise-enumMost significant bit.p bitwise-enumLeft fold over bits.q bitwise-enumÈLeft fold over bits. The accumulator is evaluated to WHNF at every step.r bitwise-enumRight fold over bits.s bitwise-enumÉRight fold over bits. The accumulator is evaluated to WHNF at every step.)  !"#$%&'()*+,-)  !"$#%&'()*+,-9  Safe-InferredÂÈÌÚÜœ&G bitwise-enumO(1). The empty set.H bitwise-enumO(1). A set of one element.I bitwise-enumO(n)5. Create a set from a finite foldable data structure.J bitwise-enumO(1). Add a value to the set.K bitwise-enumO(1). Delete a value in the set.L bitwise-enumO(1)#. Is the value a member of the set?M bitwise-enumO(1). Is the value not in the set?N bitwise-enumO(1). Is this the empty set?O bitwise-enumO(1)$. The number of elements in the set.P bitwise-enumO(1). Is this a subset? (s1 `isSubsetOf` s2) tells whether s1 is a subset of s2.Q bitwise-enumO(1). The union of two sets.R bitwise-enumO(1). Difference between two sets.S bitwise-enumO(1). See R.T bitwise-enumO(1)1. Elements which are in either set, but not both.U bitwise-enumO(1). The intersection of two sets.V bitwise-enumO(n)2. Filter all elements that satisfy some predicate.W bitwise-enumO(n)£. Partition the set according to some predicate. The first set contains all elements that satisfy the predicate, the second all elements that fail the predicate.X bitwise-enumO(n). X f s! is the set obtained by applying f to each element of s.ËIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f yY bitwise-enumO(n) . Left fold.Z bitwise-enumO(n)$. Left fold with strict accumulator.[ bitwise-enumO(n) . Right fold.\ bitwise-enumO(n)%. Right fold with strict accumulator.] bitwise-enumO(n). Left fold on non-empty sets.^ bitwise-enumO(n)6. Left fold on non-empty sets with strict accumulator._ bitwise-enumO(n). Right fold on non-empty sets.` bitwise-enumO(n)7. Right fold on non-empty sets with strict accumulator.a bitwise-enumO(n)Ê. Map each element of the structure to a monoid, and combine the results.c bitwise-enumO(n)/. Check if all elements satisfy some predicate.d bitwise-enumO(n)0. Check if any element satisfies some predicate.e bitwise-enumO(1)). The minimal element of a non-empty set.f bitwise-enumO(1)). The maximal element of a non-empty set.g bitwise-enumO(1). Delete the minimal element.h bitwise-enumO(1). Delete the maximal element.i bitwise-enumO(1)ö. Retrieves the minimal element of the set, and the set stripped of that element, or Nothing if passed an empty set.j bitwise-enumO(1)ö. Retrieves the maximal element of the set, and the set stripped of that element, or Nothing if passed an empty set.k bitwise-enumO(n)&. Convert the set to a list of values.l bitwise-enumO(1)#. Convert a representation into an EnumSet'. Intended for use with foreign types.m bitwise-enumO(1) . Convert an EnumSet? into its representation. Intended for use with foreign types.*DEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm*EFDGHIJKLMNOPQRSTUVWXYZ[\]^_`abdcefghijklmS9  Safe-Inferredtuvwxyz{ü      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH IJ    !"#$%&'()*+,-./012KLMNOPQRSTUVWXÙ+bitwise-enum-1.0.1.2-FYtTyyqWpgN2rRx5mlMWk5Data.Enum.MemoData.Enum.Set.Base Data.Enum.SetPaths_bitwise_enummemoizememoize2memoize3memoize4memoize5EnumSetempty singleton fromFoldableinsertdeletemember notMembernullsize isSubsetOfunion difference\\symmetricDifference intersectionfilter partitionmapmap'foldlfoldl'foldrfoldr'foldl1foldl1'foldr1foldr1'foldMaptraverseallanyminimummaximum deleteMin deleteMaxminViewmaxViewtoListfromRawtoRaw $fReadEnumSet $fShowEnumSet$fIsSetEnumSet$fSetContainerEnumSet$fMonoTraversableEnumSet$fGrowingAppendEnumSet$fMonoFoldableEnumSet$fMonoFunctorEnumSet$fToJSONEnumSet$fIsListEnumSet$fMonoPointedEnumSet$fMonoidEnumSet$fSemigroupEnumSet$fVectorVectorEnumSet$fMVectorMVectorEnumSet $fEqEnumSet $fOrdEnumSet $fDataEnumSet$fStorableEnumSet$fNFDataEnumSet $fPrimEnumSet$fUnboxEnumSet AsEnumSet EnumSetReplsbmsb foldlBits foldlBits' foldrBits foldrBits'versiongetDataFileName getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDir