aF      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None234:<=I%Ordered sets with duplicate elements.O(1)O(n)O(n)O(n)O(n) O(n*m)  O(n*(m^3)) O(1) O(1) O(n)O(n) O(min n m)O(n*m) O(min(n,m)) - Combines all elements of bothO(n)O(n)O(n)O(?)    Safe$O(n+m)%O(1)&O(1)'O(log n)(O(log n)) O(n+m+t1+t2)* O(n+m+t1+t2)+O(1)-O(1).O(log n)/O(log n)0O(n+m)1O(n+m)2O(n+m)3/O(n+t)4O(n)5O(n) - Guaranteed to be disjoint6O(n)!"#$%&'()*+,-./0123456!"#$%&'()*+,-./0123456!"#$%&'()*+,-./0123456!"#$%&'()*+,-./0123456NoneI89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop79:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno89:;p<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno69:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopSafer7      !"rrrNone2IsUnordered sets with duplicate elements. The semantics for "unordering" is based on the idea that we will not know what order the elements are in at any point, and we are free to re-order elements in any way.IMost binary functions are algorithmically heavier on the right arguments.Pronounced "Unordered Many Set"wO(1)xO(n)yO(n)zO(n){O(n)|O(n*m)} O(n*(m^3))~O(1)O(1)O(1)O(n)O(n)O(n*m) O(n*(m^4)) - Combines all elements of bothO(n)O(n)O(n)O(?)stuvwxyz{|}~stuvwxyz{|}~stuvwxyz{|}~stuvwxyz{|}~None2:<=I!Pronounced "Unordered Unique Set"O(1)O(n)O(n)O(n)O(n)O(n*m) O(n*(m^2))O(1)O(1)O(n)O(n)O(n*m)O(n*m)O(n*m)O(n)O(n) - Guaranteed to be disjointO(n)O(?)None /2349:;<=I      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh6߿hgfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"!            !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghNone9:;<=Deletes  entire set with minimum keyB6B@#       !"#$%&'())*   +,-.//0   123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVVW   XYZ[\]]^   _`abcdef ghi+jklmnopqrst,uuvwxyzz{|}}~5       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTTU   12346789:V<=>?@ABCDEFGHIJKLMNOPQRWXYZ[\]^_`abcdecdRcdQcd8cdIcdHcdGcdFcd<cd;cd9cd:cd7cd6cdPcdOcdLcdNcdMcdKcdJcd@cd>cd?cd=cdAcdfcdcdcdcdcdcdcd5cdEcdDcdCcdBcdcdcdcdcdcdcd4cd3cd2cd1cdcdcd cd cd cdgh#sets-0.0.5.1-EnkfZB19M9SE7PJoSrkAzqData.Set.Ordered.ManyData.Set.Ordered.Unique.FiniteData.Set.Ordered.Unique.WithData.Set.Ordered.UniqueData.Set.Unordered.ManyData.Set.Unordered.UniqueData.Set.ClassData.Set.Ordered.Many.WithOMSetunOMSet\\nullsizemember notMemberlookup isSubsetOfisProperSubsetOfempty singletoninsertdeleteunion difference intersectionfilter partitionmapmapMaybe$fArbitraryOMSet$fMonadBaseGenGen$fMergeableOMSet $fEqOMSet $fShowOMSet$fFunctorOMSet$fApplicativeOMSet $fMonadOMSet$fFoldableOMSet$fTraversableOMSet$fMonadFixOMSet FiniteSet unFiniteSettotal complement $fEqFiniteSet$fShowFiniteSetSetWith unSetWithlookupLTlookupGTlookupLElookupGEunionssplit splitMember splitRoot lookupIndex findIndexelemAtdeleteAtfoldrfoldlfoldr'foldl'foldfindMinfindMax deleteMin deleteMax deleteFindMin deleteFindMaxminViewmaxViewelemstoListfromList toAscList toDescList fromAscListfromDistinctAscListshowTree showTreeWith$fFoldableSetWith$fMonoidSetWithOUSetUMSetunUMSet$fArbitraryUMSet $fEqUMSet$fMergeableUMSet$fFunctorUMSet $fShowUMSetUUSetunUUSet$fArbitraryUUSet $fEqUUSet$fMergeableUUSet$fFunctorUUSet $fShowUUSetCanBeProperSubset CanBeSubsetHasSize HasTotalWith totalWithHasTotal HasEmptyWith emptyWithHasEmpty HasInsertWith insertWith HasInsert HasDeleteHasSingletonWith singletonWith HasSingleton HasComplementXUnionunXUnion HasXUnionxunion HasDifference IntersectionunIntersectionHasIntersectionUnionunUnionHasUnionunions1 intersectionsintersections1xunionsxunions1 fromFoldablefromFoldableWithKey fromFoldable1fromFoldable1WithKey$fCanBeProperSubsetFiniteSet$fCanBeSubsetFiniteSet$fHasSizeFiniteSet $fHasTotalWithFiniteSetFiniteSet$fHasEmptyWithSetFiniteSet$fHasDeleteaFiniteSet$fHasInsertaFiniteSet$fHasSingletonWithSetaFiniteSet$fHasComplementFiniteSet$fHasIntersectionFiniteSet$fHasDifferenceFiniteSet$fHasUnionFiniteSet$fCanBeProperSubsetUUSet$fCanBeSubsetUUSet$fHasSizeUUSet$fHasEmptyUUSet$fHasDeleteaUUSet$fHasInsertaUUSet$fHasSingletonaUUSet$fHasIntersectionUUSet$fHasDifferenceUUSet$fHasUnionUUSet$fCanBeProperSubsetUMSet$fCanBeSubsetUMSet$fHasSizeUMSet$fHasEmptyUMSet$fHasDeleteaUMSet$fHasInsertaUMSet$fHasSingletonaUMSet$fHasIntersectionUMSet$fHasDifferenceUMSet$fHasUnionUMSet$fCanBeProperSubsetOMSet$fCanBeSubsetOMSet$fHasSizeOMSet$fHasEmptyOMSet$fHasDeleteaOMSet$fHasInsertaOMSet$fHasSingletonaOMSet$fHasIntersectionOMSet$fHasDifferenceOMSet$fHasUnionOMSet$fHasTotalPredicate$fHasEmptyPredicate$fHasDeleteaPredicate$fHasInsertaPredicate$fHasSingletonaPredicate$fHasComplementPredicate$fHasIntersectionPredicate$fHasDifferencePredicate$fHasUnionPredicate$fCanBeProperSubsetSetWith$fCanBeSubsetSetWith$fHasSizeSetWith$fHasEmptyWith(->)SetWith$fHasDeleteaSetWith$fHasInsertaSetWith$fHasSingletonWith(->)aSetWith$fHasIntersectionSetWith$fHasDifferenceSetWith$fHasUnionSetWith$fHasSizeHashMap$fHasEmptyHashMap$fHasDeletekHashMap$fHasInsertWithkaHashMap$fHasSingletonWithkaHashMap$fHasIntersectionHashMap$fHasDifferenceHashMap$fHasUnionHashMap$fHasSizeHashSet$fHasEmptyHashSet$fHasDeleteaHashSet$fHasInsertaHashSet$fHasSingletonaHashSet$fHasIntersectionHashSet$fHasDifferenceHashSet$fHasUnionHashSet$fCanBeProperSubsetIntMap$fCanBeSubsetIntMap$fHasSizeIntMap$fHasEmptyIntMap$fHasDeleteIntIntMap$fHasInsertWithIntaIntMap$fHasSingletonWithIntaIntMap$fHasIntersectionIntMap$fHasDifferenceIntMap$fHasUnionIntMap$fCanBeProperSubsetIntSet$fCanBeSubsetIntSet$fHasSizeIntSet$fHasEmptyIntSet$fHasDeleteIntIntSet$fHasInsertIntIntSet$fHasSingletonIntIntSet$fHasIntersectionIntSet$fHasDifferenceIntSet$fHasUnionIntSet $fHasSizeSeq $fHasEmptySeq$fHasSingletonaSeq $fHasSize[] $fHasEmpty[]$fHasDeletea[]$fHasInserta[]$fHasSingletona[]$fCanBeProperSubsetMap$fCanBeSubsetMap $fHasSizeMap $fHasEmptyMap$fHasDeletekMap$fHasInsertWithkaMap$fHasSingletonWithkaMap$fHasIntersectionMap$fHasDifferenceMap $fHasUnionMap$fCanBeProperSubsetSet$fCanBeSubsetSet $fHasSizeSet $fHasEmptySet$fHasDeleteaSet$fHasInsertaSet$fHasSingletonaSet$fHasIntersectionSet$fHasDifferenceSet $fHasUnionSet$fCommutativeIdIntersection$fCommutativeIdUnion$fSemigroupXUnion$fMonoidXUnion$fCommutativeXUnion $fHasXUnions$fSemigroupIntersection$fMonoidIntersection$fCommutativeIntersection$fSemigroupUnion $fMonoidUnion$fCommutativeUnion $fShowUnion $fEqUnion $fOrdUnion$fFunctorUnion$fFoldableUnion$fTraversableUnion$fShowIntersection$fEqIntersection$fOrdIntersection$fFunctorIntersection$fFoldableIntersection$fTraversableIntersection $fShowXUnion $fEqXUnion $fOrdXUnion$fFunctorXUnion$fFoldableXUnion$fTraversableXUnion$fCanBeProperSubsetXUnion$fCanBeSubsetXUnion$fHasSizeXUnion$fHasTotalWithXUnion$fHasTotalXUnion$fHasEmptyWithXUnion$fHasEmptyXUnion$fHasDeleteXUnion$fHasInsertWithXUnion$fHasInsertXUnion$fHasSingletonWithXUnion$fHasSingletonXUnion$fHasComplementXUnion$fHasIntersectionXUnion$fHasDifferenceXUnion$fHasUnionXUnion$fCanBeProperSubsetIntersection$fCanBeSubsetIntersection$fHasSizeIntersection$fHasTotalWithIntersection$fHasTotalIntersection$fHasEmptyWithIntersection$fHasEmptyIntersection$fHasDeleteIntersection$fHasInsertWithIntersection$fHasInsertIntersection$fHasSingletonWithIntersection$fHasSingletonIntersection$fHasComplementIntersection$fHasIntersectionIntersection$fHasDifferenceIntersection$fHasUnionIntersection$fCanBeProperSubsetUnion$fCanBeSubsetUnion$fHasSizeUnion$fHasTotalWithUnion$fHasTotalUnion$fHasEmptyWithUnion$fHasEmptyUnion$fHasDeleteUnion$fHasInsertWithUnion$fHasInsertUnion$fHasSingletonWithUnion$fHasSingletonUnion$fHasComplementUnion$fHasIntersectionUnion$fHasDifferenceUnion$fHasUnionUnionSetsWith unSetsWithsetAt$fCanBeProperSubsetSetsWith$fCanBeSubsetSetsWith$fHasSizeSetsWith$fHasEmptyWith(->)SetsWith$fHasDeleteaSetsWith$fHasInsertaSetsWith$fHasSingletonWith(->)aSetsWith$fHasIntersectionSetsWith$fHasDifferenceSetsWith$fHasUnionSetsWith $fEqSetsWith$fFoldableSetsWithcontainers-0.5.7.1 Data.Set.Basevalid mapMonotonicSet