úÎ@Ÿ:™A      !"#$%&'()*+,-./0123456789:;<=>?@              ABC &non-portable (TypeFamilies, MagicHash) provisionallibraries@haskell.orgVDEFGHIJKLA set of integers. MNOPQRSO(n+m). See '. TUVO(1). Is the set empty? O(1). Cardinality of the set.  O(min(n,W))$. Is the value a member of the set?  O(min(n,W))!. Is the element not in the set? WX!O(1). The empty set. "O(1). A set of one element. # O(min(n,W))4. Add a value to the set. When the value is already ; an element of the set, it is replaced by the new one, ie. #  is left-biased. Y$ O(min(n,W))). Delete a value in the set. Returns the . original set when the value was not present. %The union of a list of sets. &O(n+m). The union of two sets. 'O(n+m) . Difference between two sets. (O(n+m)!. The intersection of two sets. )O(n+m)9. Is this a proper subset? (ie. a subset but not equal). Z*O(n+m). Is this a subset?  (s1 * s2) tells whether s1 is a subset of s2. +O(n)3. Filter all elements that satisfy some predicate. ,O(n)1. partition the set according to some predicate. - O(min(n,W)). The expression (- x set ) is a pair  (set1,set2)  where set1 comprises the elements of set less than x and set2  comprises the elements of set greater than x. ? split 3 (fromList [1..5]) == (fromList [1,2], fromList [4,5]) [. O(min(n,W)) . Performs a -$ but also returns whether the pivot ( element was found in the original set. \/ O(min(n,W))4. Retrieves the maximal key of the set, and the set  stripped of that element, or ] if passed an empty set. ^0 O(min(n,W))4. Retrieves the minimal key of the set, and the set  stripped of that element, or ] if passed an empty set. _1 O(min(n,W))'. Delete and find the minimal element. 2 deleteFindMin set = (findMin set, deleteMin set) 2 O(min(n,W))'. Delete and find the maximal element. 2 deleteFindMax set = (findMax set, deleteMax set) 3 O(min(n,W))". The minimal element of the set. 4 O(min(n,W)) . The maximal element of a set. 5 O(min(n,W)). Delete the minimal element. 6 O(min(n,W)). Delete the maximal element. 7 O(n*min(n,W)).  7 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 8O(n);. Fold over the elements of a set in an unspecified order.  sum set == fold (+) 0 set  elems set == fold (:) [] set `9O(n)B. The elements of a set. (For sets, this is equivalent to toList) :O(n)). Convert the set to a list of elements. ;O(n)4. Convert the set to an ascending list of elements. < O(n*min(n,W))(. Create a set from a list of integers. =O(n)2. Build a set from an ascending list of elements.  :The precondition (input list is ascending) is not checked. >O(n);. Build a set from an ascending list of distinct elements.  CThe precondition (input list is strictly ascending) is not checked. ?O(n);. Show the tree that implements the set. The tree is shown " in a compressed, hanging format. @O(n). The expression (@ hang wide map) shows & the tree that implements the set. If hang is  a, a hanging5 tree is shown otherwise a rotated tree is shown. If  wide is a", an extra wide version is shown. bcdefghijklmnopqrstu& !"#$%&'()*+,-./0123456789:;<=>?@& *)!"#$&%'(+,-.345612/0789:<;=>?@& !"#$%&'()*+,-./0123456789:;<=>?@v      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€ intern-0.5.2Data.Interned.Internal!Data.Interned.Internal.ByteStringData.Interned.Internal.StringData.Interned.Internal.TextData.Interned.IntSet Data.InternedData.Interned.ByteStringData.Interned.StringData.Interned.Text UninternableuninternInterned Description Uninterneddescribeidentifyidentity seedIdentity modifyAdvicecacheIdCachegetCache CacheState cacheSizemkCacheinternrecoverInternedByteStringInternedStringIS InternedTextIntSet\\nullsizemember notMemberempty singletoninsertdeleteunionsunion difference intersectionisProperSubsetOf isSubsetOffilter partitionsplit splitMembermaxViewminView deleteFindMin deleteFindMaxfindMinfindMax deleteMin deleteMaxmapfoldelemstoList toAscListfromList fromAscListfromDistinctAscListshowTree showTreeWithibsCache stringCacheitCacheStackNadaPushMaskPrefixUninternedIntSetUBinUTipUNilBinTipNilNat natFromInt intFromNatshiftRLtipbin_ intSetCachelookuplookupNinsertR subsetCmpsplit' splitMember'base Data.MaybeNothingmaxViewUnsignedminViewUnsignedfoldrghc-prim GHC.TypesTrue showsTree showsTreeHangshowBinshowWide showsBarsnodewithBar withEmptyjoinbinzeronomatchmatchmaskzeroNmaskWshorter branchMaskhighestBitMask foldlStrict