Îõ³h$@ð      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno None >?ÀÉÎ×÷    :(c) Daan Leijen 2002 (c) Edward Kmett 2011 BSD-stylelibraries@haskell.org provisional&non-portable (TypeFamilies, MagicHash)None >ÀÇÉ×€'internA set of integers.internO(n+m). See $.intern6A unique integer ID associated with each interned set.internO(1). Is the set empty?internO(1). Cardinality of the set.intern O(min(n,W))#. Is the value a member of the set?intern O(min(n,W)) . Is the element not in the set?internO(1). The empty set.internO(1). A set of one element. intern O(min(n,W))ï. 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.!intern O(min(n,W))Ö. Delete a value in the set. Returns the original set when the value was not present."internThe union of a list of sets.#internO(n+m). The union of two sets.$internO(n+m). Difference between two sets.%internO(n+m). The intersection of two sets.&internO(n+m)8. Is this a proper subset? (ie. a subset but not equal).'internO(n+m). Is this a subset? (s1 ' s2) tells whether s1 is a subset of s2.(internO(n)2. Filter all elements that satisfy some predicate.)internO(n)0. partition the set according to some predicate.*intern 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])+intern O(min(n,W)) . Performs a *Ë but also returns whether the pivot element was found in the original set.,intern O(min(n,W))Ò. Retrieves the maximal key of the set, and the set stripped of that element, or p if passed an empty set.-intern O(min(n,W))Ò. Retrieves the minimal key of the set, and the set stripped of that element, or p if passed an empty set..intern O(min(n,W))&. Delete and find the minimal element. 0deleteFindMin set = (findMin set, deleteMin set)/intern O(min(n,W))&. Delete and find the maximal element. 0deleteFindMax set = (findMax set, deleteMax set)0intern O(min(n,W))!. The minimal element of the set.1intern O(min(n,W)). The maximal element of a set.2intern O(min(n,W)). Delete the minimal element.3intern O(min(n,W)). Delete the maximal element.4intern O(n*min(n,W)). 4 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 y5internO(n):. Fold over the elements of a set in an unspecified order. 8sum set == fold (+) 0 set elems set == fold (:) [] set6internO(n)Á. The elements of a set. (For sets, this is equivalent to toList)7internO(n)(. Convert the set to a list of elements.8internO(n)3. Convert the set to an ascending list of elements.9intern O(n*min(n,W))'. Create a set from a list of integers.:internO(n)3. Build a set from an ascending list of elements. :The precondition (input list is ascending) is not checked.;internO(n)<. Build a set from an ascending list of distinct elements. ÃThe precondition (input list is strictly ascending) is not checked.<internO(n)Ü. Show the tree that implements the set. The tree is shown in a compressed, hanging format.=internO(n). The expression (= hang wide map.) shows the tree that implements the set. If hang is q, a hanging6 tree is shown otherwise a rotated tree is shown. If wide is q!, an extra wide version is shown.' !"#$%&'()*+,-./0123456789:;<=''& !#"$%()*+0123./,-456798:;<=9 Noneñ    None>ÀÉÎ×9IJKLIJKLNone^IKIKNone>ÀÉ׈VWXYVWXYNone>ÀÉ×¶cdefcdefNoneÛVXVX Noneüceceò     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQQRSTUVWXYZPM[\]^M_`abcdePffghMijklmnoPpqrstuö#intern-0.9.4-Io3vA06b1lSBPHlC75wu7fData.Interned.InternalData.Interned.IntSet!Data.Interned.Internal.ByteStringData.Interned.Internal.StringData.Interned.Internal.Text Data.InternedData.Interned.ByteStringData.Interned.StringData.Interned.Text UninternableuninternInterned Description Uninterneddescribeidentify seedIdentity cacheWidth modifyAdvicecacheIdCachegetCache CacheStatefreshcontent cacheSizemkCacheinternrecoverIntSet\\identitynullsizemember notMemberempty singletoninsertdeleteunionsunion difference intersectionisProperSubsetOf isSubsetOffilter partitionsplit splitMembermaxViewminView deleteFindMin deleteFindMaxfindMinfindMax deleteMin deleteMaxmapfoldelemstoList toAscListfromList fromAscListfromDistinctAscListshowTree showTreeWith $fReadIntSet$fHashableIntSet $fShowIntSet $fOrdIntSet $fEqIntSet$fMonoidIntSet$fSemigroupIntSet$fHashableDescription$fUninternableIntSet$fInternedIntSet$fEqDescriptionInternedByteStringinternedByteStringIduninternByteString $fUninternableInternedByteString$fInternedInternedByteString$fHashableInternedByteString$fShowInternedByteString$fOrdInternedByteString$fEqInternedByteString$fIsStringInternedByteStringInternedStringISinternedStringIduninternString$fUninternableInternedString$fInternedInternedString$fHashableInternedString$fShowInternedString$fOrdInternedString$fEqInternedString$fIsStringInternedString InternedTextinternedTextIduninternedText$fUninternableInternedText$fInternedInternedText$fHashableInternedText$fShowInternedText$fOrdInternedText$fEqInternedText$fIsStringInternedTextbase GHC.MaybeNothingghc-prim GHC.TypesTrue