5 g      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|} ~                                                                                                                                                                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f SafegCSame as regular Haskell pairs, but (x :*: _|_) = (_|_ :*: y) = _|_ghighighiSafejklmnopjklmnojklmnopSafeqSame as regular }, but marked INLINE so that it is always inlined. This allows further optimization of the call to f, which can be optimized specialisedinlined.qqqNoneBrChecks if two pointers are equal. Yes means yes; no means maybe. The values should be forced to at least WHNF before comparison to get moderately reliable results.sChecks if two pointers are equal, without requiring them to have the same type. The values should be forced to at least WHNF before comparison to get moderately reliable results.rsrsrsr4s4:(c) Clark Gaebel 2012 (c) Johan Tibel 2012 BSD-stylelibraries@haskell.org provisionalportable TrustworthyBt0Return a word where only the highest bit is set.tuvwtuvwtuvw(c) David Feuer 2016 BSD-stylelibraries@haskell.org provisionalportableSafexoCreate an empty bit queue builder. This is represented as a single guard bit in the most significant position.ysEnqueue a bit. This works by shifting the queue right one bit, then setting the most significant bit as requested.zConvert a bit queue builder to a bit queue. This shifts in a new guard bit on the left, and shifts right until the old guard bit falls off.{3Dequeue an element, or discover the queue is empty.|lConvert a bit queue to a list of bits by unconsing. This is used to test that the queue functions properly. }~xyz{|}xyz{| }~xyz{|(c) Daan Leijen 2002 BSD-stylelibraries@haskell.org provisionalportable Trustworthy /0DER>A set of values a.O(m*log(n/m+1)), m <= n. See .O(1). Is this the empty set?O(1)$. The number of elements in the set.O(log n). Is the element in the set?O(log n) . Is the element not in the set?O(log n)2. Find largest element smaller than the given one. NlookupLT 3 (fromList [3, 5]) == Nothing lookupLT 5 (fromList [3, 5]) == Just 3O(log n)3. Find smallest element greater than the given one. NlookupGT 4 (fromList [3, 5]) == Just 5 lookupGT 5 (fromList [3, 5]) == NothingO(log n)9. Find largest element smaller or equal to the given one. ulookupLE 2 (fromList [3, 5]) == Nothing lookupLE 4 (fromList [3, 5]) == Just 3 lookupLE 5 (fromList [3, 5]) == Just 5 O(log n):. Find smallest element greater or equal to the given one. ulookupGE 3 (fromList [3, 5]) == Just 3 lookupGE 4 (fromList [3, 5]) == Just 5 lookupGE 6 (fromList [3, 5]) == Nothing O(1). The empty set. O(1). Create a singleton set. O(log n). Insert an element in a set. If the set already contains an element equal to the given value, it is replaced with the new value. O(log n). Delete an element from a set.O(n+m)8. Is this a proper subset? (ie. a subset but not equal).O(n+m). Is this a subset? (s1  s2) tells whether s1 is a subset of s2.O(log n). The minimal element of a set.O(log n). The maximal element of a set.O(log n)G. Delete the minimal element. Returns an empty set if the set is empty.O(log n)G. Delete the maximal element. Returns an empty set if the set is empty.The union of a list of sets: ( ==    ). O(m*log(ngm + 1)), m <= n/. The union of two sets, preferring the first set when equal elements are encountered. O(m*log(n)m + 1)), m <= n/. Difference of two sets. O(m*log(nom + 1)), m <= n/. The intersection of two sets. Elements of the result come from the first set, so for example import qualified Data.Set as S data AB = A | B deriving Show instance Ord AB where compare _ _ = EQ instance Eq AB where _ == _ = True main = print (S.singleton A `S.intersection` S.singleton B, S.singleton B `S.intersection` S.singleton A)prints (fromList [A],fromList [B]).O(n)1. Filter all elements that satisfy the predicate.O(n). Partition the set into two sets, one with all elements that satisfy the predicate and one with all elements that don't satisfy the predicate. See also *. O(n*log n).  f s! is the set obtained by applying f to each element of s.KIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f yO(n). The f s ==  f s, but works only when f is strictly increasing.  The precondition is not checked. Semi-formally, we have: xand [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList sO(n)u. Fold the elements in the set using the given right-associative binary operator. This function is an equivalent of ( and is present for compatibility only.CPlease note that fold will be deprecated in the future and removed.O(n)]. Fold the elements in the set using the given right-associative binary operator, such that  f z ==  f z . #. For example,  toAscList set = foldr (:) [] setO(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)\. Fold the elements in the set using the given left-associative binary operator, such that  f z ==  f z . #. For example, (toDescList set = foldl (flip (:)) [] set O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.!O(n). An alias of #D. The elements of a set in ascending order. Subject to list fusion."O(n)@. Convert the set to a list of elements. Subject to list fusion.#O(n)K. Convert the set to an ascending list of elements. Subject to list fusion.$O(n)L. Convert the set to a descending list of elements. Subject to list fusion.% O(n*log n)'. Create a set from a list of elements.bIf the elements are ordered, a linear-time implementation is used, with the performance equal to (.&O(n)6. Build a set from an ascending list in linear time. :The precondition (input list is ascending) is not checked.'O(n)6. Build a set from a descending list in linear time. ;The precondition (input list is descending) is not checked.(O(n)K. Build a set from an ascending list of distinct elements in linear time. CThe precondition (input list is strictly ascending) is not checked.)O(n)K. Build a set from a descending list of distinct elements in linear time. DThe precondition (input list is strictly descending) is not checked.*O(log n). 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.+O(log n) . Performs a *K but also returns whether the pivot element was found in the original set.,O(log n) . Return the indexn of an element, which is its zero-based index in the sorted sequence of elements. The index is a number from 0 up to, but not including, the  of the set. Calls  when the element is not a  of the set. findIndex 2 (fromList [5,3]) Error: element is not in the set findIndex 3 (fromList [5,3]) == 0 findIndex 5 (fromList [5,3]) == 1 findIndex 6 (fromList [5,3]) Error: element is not in the set-O(log n) . Lookup the indexn of an element, which is its zero-based index in the sorted sequence of elements. The index is a number from 0 up to, but not including, the  of the set. isJust (lookupIndex 2 (fromList [5,3])) == False fromJust (lookupIndex 3 (fromList [5,3])) == 0 fromJust (lookupIndex 5 (fromList [5,3])) == 1 isJust (lookupIndex 6 (fromList [5,3])) == False.O(log n). Retrieve an element by its indexK, i.e. by its zero-based index in the sorted sequence of elements. If the index7 is out of range (less than zero, greater or equal to  of the set),  is called. telemAt 0 (fromList [5,3]) == 3 elemAt 1 (fromList [5,3]) == 5 elemAt 2 (fromList [5,3]) Error: index out of range/O(log n). Delete the element at indexK, i.e. by its zero-based index in the sorted sequence of elements. If the index7 is out of range (less than zero, greater or equal to  of the set),  is called. deleteAt 0 (fromList [5,3]) == singleton 5 deleteAt 1 (fromList [5,3]) == singleton 3 deleteAt 2 (fromList [5,3]) Error: index out of range deleteAt (-1) (fromList [5,3]) Error: index out of range0LTake a given number of elements in order, beginning with the smallest ones.  take n = ( .  n . # 1LDrop a given number of elements in order, beginning with the smallest ones.  drop n = ( .  n . # 2O(log n)$. Split a set at a particular index. splitAt !n !xs = (0 n xs, 1 n xs) 3O(log n)l. Take while a predicate on the elements holds. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. See note at 5. takeWhileAntitone p = ( .  p . " takeWhileAntitone p =  p 4O(log n)l. Drop while a predicate on the elements holds. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. See note at 5. dropWhileAntitone p = ( .  p . " dropWhileAntitone p =  (not . p) 5O(log n). Divide a set at the point where a predicate on the elements stops holding. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. spanAntitone p xs = (3 p xs, 4* p xs) spanAntitone p xs = partition p xs  Note: if p is not actually antitone, then  spanAntitone will split the set at some  unspecified point where the predicate switches from holding to not holding (where the predicate is seen to hold before the first element and to fail after the last element).6O(log n)&. Delete and find the minimal element. 0deleteFindMin set = (findMin set, deleteMin set)7O(log n)&. Delete and find the maximal element. 0deleteFindMax set = (findMax set, deleteMax set)8O(log n)R. Retrieves the minimal key of the set, and the set stripped of that element, or  if passed an empty set.9O(log n)R. Retrieves the maximal key of the set, and the set stripped of that element, or  if passed an empty set.:O(1). Decompose a set into pieces based on the structure of the underlying tree. This function is useful for consuming a set in parallel.No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first subset less than all elements in the second, and so on). Examples: OsplitRoot (fromList [1..6]) == [fromList [1,2,3],fromList [4],fromList [5,6]] splitRoot empty == []Note that the current implementation does not return more than three subsets, but you should not depend on this behaviour because it can change in the future without notice.;O(n)\. Show the tree that implements the set. The tree is shown in a compressed, hanging format.<O(n). The expression (showTreeWith hang wide map.) shows the tree that implements the set. If hang is True, a hanging6 tree is shown otherwise a rotated tree is shown. If wide is !, an extra wide version is shown. ?Set> putStrLn $ showTreeWith True False $ fromDistinctAscList [1..5] 4 +--2 | +--1 | +--3 +--5 Set> putStrLn $ showTreeWith True True $ fromDistinctAscList [1..5] 4 | +--2 | | | +--1 | | | +--3 | +--5 Set> putStrLn $ showTreeWith False True $ fromDistinctAscList [1..5] +--5 | 4 | | +--3 | | +--2 | +--1=O(n).. Test if the internal set structure is valid.g   !"#$%&'()*+,-./0123456789:;<=D  !"#$%&'()*+,-./0123456789:;<=e   !"#$%&'()*+,-./0123456789:;<=9 (c) Daan Leijen 2002 BSD-stylelibraries@haskell.org provisionalportableSafe>  !"#$%&'()*+,-./0123456789:;<=>  345*+:-,./012 6798!"%#$&'();<=(c) Ross Paterson 2005 (c) Louis Wasserman 2009 (c) Bertram Felgenhauer, David Feuer, Ross Paterson, and Milan Straka 2014 BSD-stylelibraries@haskell.org experimentalportable Trustworthy$/059;DRTbiA  is a simple pairing heap.>$View of the right end of a sequence.?empty sequence@Dthe sequence minus the rightmost element, and the rightmost elementA#View of the left end of a sequence.Bempty sequenceC-leftmost element and the rest of the sequence:This is essentially a clone of Control.Monad.State.Strict.VSometimes, we want to emphasize that we are viewing a node as a top-level digit of a  tree.0A finger tree whose digits are all ones and twos'A finger tree whose top level has only Two and/or Three digits, and whose other levels have only One and Two digits. A Rigid tree is precisely what one gets by unzipping/inverting a 2-3 tree, so it is precisely what we need to turn a finger tree into in order to transform it into a 2-3 tree.D!General-purpose finite sequences.<A pattern synonym viewing the rear of a non-empty sequence.=A pattern synonym viewing the front of a non-empty sequence.-A pattern synonym matching an empty sequence.) does most of the hard work of computing fs *xs`. It produces the center part of a finger tree, with a prefix corresponding to the prefix of xs- and a suffix corresponding to the suffix of xs omitted; the missing suffix and prefix are added by the caller. For the recursive call, it squashes the prefix and the suffix into the center tree. Once it gets to the bottom, it turns the tree into a 2-3 tree, applies > to produce the main body, and glues all the pieces together.map23 itself is a bit horrifying because of the nested types involved. Its job is to map over the *elements* of a 2-3 tree, rather than the subtrees. If we used a higher-order nested type with MPTC, we could probably use a class, but as it is we have to build up map23# explicitly through the recursion.O(m*n) (incremental) Takes an O(m)% function and a finger tree of size n> and maps the function over the tree leaves. Unlike the usual 2, the function is applied to the "leaves" of the  (i.e., given a FingerTree (Elem a)., it applies the function to elements of type Elem aJ), replacing the leaves with subtrees of at least the same height, e.g., Node(Node(Elem y))L. The multiplier argument serves to make the annotations match up properly.O(log n)4 (incremental) Takes the extra flexibility out of a 6 to make it a genuine 2-3 finger tree. The result of  will have only two and three digits at the top level and only one and two digits elsewhere. If the tree has fewer than four elements, 6 will simply extract them, and will not build a tree.O(log n)V (incremental) Takes a tree whose left side has been rigidified and finishes the job.O(log n)K (incremental) Rejigger a finger tree so the digits are all ones and twos.E:Intersperse an element between the elements of a sequence. intersperse a empty = empty intersperse a (singleton x) = singleton x intersperse a (fromList [x,y]) = fromList [x,a,y] intersperse a (fromList [x,y,z]) = fromList [x,a,y,a,z] YGiven the size of a digit and the digit itself, efficiently converts it to a FingerTree. takes an Applicative-wrapped construction of a piece of a FingerTree, assumed to always have the same size (which is put in the second argument), and replicates it as many times as specified. This is a generalization of IB, which itself is a generalization of many Data.Sequence methods.FO(1). The empty sequence.GO(1). A singleton sequence.HO(log n).  replicate n x is a sequence consisting of n copies of x.II is an  version of H , and makes O(log n) calls to  and . *replicateA n x = sequenceA (replicate n x)JJ is a sequence counterpart of  . )replicateM n x = sequence (replicate n x)K O(log(k)). K k xs forms a sequence of length k by repeatedly concatenating xs with itself. xs may only be empty if k is 0.2cycleTaking k = fromList . take k . cycle . toList O(log(kn)).  k xs concatenates k copies of xsX. This operation uses time and additional space logarithmic in the size of its result.LO(1)p. Add an element to the left end of a sequence. Mnemonic: a triangle with the single element at the pointy end.MO(1)q. Add an element to the right end of a sequence. Mnemonic: a triangle with the single element at the pointy end.NO(log(min(n1,n2))). Concatenate two sequences.O_Builds a sequence from a seed value. Takes time linear in the number of generated elements. WARNING:R If the number of generated elements is infinite, this method will not terminate.PP f x is equivalent to  (O ( swap . f) x).QO(n)P. Constructs a sequence by repeated application of a function to a seed value. @iterateN n f x = fromList (Prelude.take n (Prelude.iterate f x))RO(1). Is this the empty sequence?SO(1)). The number of elements in the sequence.TO(1)%. Analyse the left end of a sequence.UO(1)&. Analyse the right end of a sequence.VV is similar to :, but returns a sequence of reduced values from the left: Sscanl f z (fromList [x1, x2, ...]) = fromList [z, z `f` x1, (z `f` x1) `f` x2, ...]WW is a variant of V% that has no starting value argument: Ascanl1 f (fromList [x1, x2, ...]) = fromList [x1, x1 `f` x2, ...]XX is the right-to-left dual of V.YY is a variant of X% that has no starting value argument.ZO(log(min(i,n-i))). The element at the specified position, counting from 0. The argument should thus be a non-negative integer less than the size of the sequence. If the position is out of range, Z fails with an error.xs `index` i = toList xs !! i Caution: Z necessarily delays retrieving the requested element until the result is forced. It can therefore lead to a space leak if the result is stored, unforced, in another structure. To retrieve an element immediately without forcing it, use [ or '(!?)'.[O(log(min(i,n-i))). The element at the specified position, counting from 0. If the specified position is negative or at least the length of the sequence, [ returns .;0 <= i < length xs ==> lookup i xs == Just (toList xs !! i)1i < 0 || i >= length xs ==> lookup i xs = NothingUnlike Zw, this can be used to retrieve an element without forcing it. For example, to insert the fifth element of a sequence xs into a ! m at key k, you could use /case lookup 5 xs of Nothing -> m Just x -> " k x m \O(log(min(i,n-i))). A flipped, infix version of [.]O(log(min(i,n-i)))u. Replace the element at the specified position. If the position is out of range, the original sequence is returned.^O(log(min(i,n-i)))w. Update the element at the specified position. If the position is out of range, the original sequence is returned. ^ can lead to poor performance and even memory leaks, because it does not force the new value before installing it in the sequence. _ should usually be preferred._O(log(min(i,n-i))). Update the element at the specified position. If the position is out of range, the original sequence is returned. The new value is forced before it is installed in the sequence. madjust' f i xs = case xs !? i of Nothing -> xs Just x -> let !x' = f x in update i x' xs `O(log(min(i,n-i))). ` i x xs inserts x into xs at the index i), shifting the rest of the sequence over. insertAt 2 x (fromList [a,b,c,d]) = fromList [a,b,x,c,d] insertAt 4 x (fromList [a,b,c,d]) = insertAt 10 x (fromList [a,b,c,d]) = fromList [a,b,c,d,x] 7insertAt i x xs = take i xs >< singleton x >< drop i xsaO(log(min(i,n-i)))p. Delete the element of a sequence at a given index. Return the original sequence if the index is out of range. ZdeleteAt 2 [a,b,c,d] = [a,b,d] deleteAt 4 [a,b,c,d] = deleteAt (-1) [a,b,c,d] = [a,b,c,d] bO(n). A generalization of , bv takes a mapping function that also depends on the element's index, and applies it to every element in the sequence.cO(n). A generalization of , cv takes a folding function that also depends on the element's index, and applies it to every element in the sequence.dd is a version of 7 that also offers access to the index of each element.eO(n)]. Convert a given sequence length and a function representing that sequence into a sequence.fO(n)5. Create a sequence consisting of the elements of an . Note that the resulting sequence elements may be evaluated lazily (as on GHC), so you must force the entire structure to be sure that the original array can be garbage-collected.gO(log(min(i,n-i))) . The first i elements of a sequence. If i is negative, g i sA yields the empty sequence. If the sequence contains fewer than i+ elements, the whole sequence is returned.hO(log(min(i,n-i)))). Elements of a sequence after the first i. If i is negative, h i sA yields the whole sequence. If the sequence contains fewer than i+ elements, the empty sequence is returned.iO(log(min(i,n-i)))). Split a sequence at a given position. i i s = (g i s, h i s).!/O(log(min(i,n-i))) A version of i that does not attempt to enhance sharing when the split point is less than or equal to 0, and that gives completely wrong answers when the split point is at least the length of the sequence, unless the sequence is a singleton. This is used to implement zipWith and chunksOf, which are extremely sensitive to the cost of splitting very short sequences. There is just enough of a speed increase to make this worth the trouble.jO(n).  chunksOf n xs splits xs into chunks of size n>0. If n does not divide the length of xs< evenly, then the last element of the result will be short.kO(n)U. Returns a sequence of all suffixes of this sequence, longest first. For example, \tails (fromList "abc") = fromList [fromList "abc", fromList "bc", fromList "c", fromList ""]Evaluating the ith suffix takes O(log(min(i, n-i)))5, but evaluating every suffix in the sequence takes O(n) due to sharing.lO(n)V. Returns a sequence of all prefixes of this sequence, shortest first. For example, \inits (fromList "abc") = fromList [fromList "", fromList "a", fromList "ab", fromList "abc"]Evaluating the ith prefix takes O(log(min(i, n-i)))5, but evaluating every prefix in the sequence takes O(n) due to sharing.iGiven a function to apply to tails of a tree, applies that function to every tail of the specified tree.iGiven a function to apply to inits of a tree, applies that function to every init of the specified tree.mm is a version of 9 that also provides access to the index of each element.nn is a version of 9 that also provides access to the index of each element.oO(i) where i is the prefix length. o, applied to a predicate p and a sequence xs2, returns the longest prefix (possibly empty) of xs of elements that satisfy p.pO(i) where i is the suffix length. p, applied to a predicate p and a sequence xs2, returns the longest suffix (possibly empty) of xs of elements that satisfy p.p p xs is equivalent to  (o p ( xs)).qO(i) where i is the prefix length. q p xs% returns the suffix remaining after o p xs.rO(i) where i is the suffix length. r p xs% returns the prefix remaining after p p xs.r p xs is equivalent to  (q p ( xs)).sO(i) where i is the prefix length. s, applied to a predicate p and a sequence xsP, returns a pair whose first element is the longest prefix (possibly empty) of xs of elements that satisfy p9 and the second element is the remainder of the sequence.tO(i) where i is the suffix length. t, applied to a predicate p and a sequence xs, returns a pair whose first element is the longest suffix (possibly empty) of xs of elements that satisfy p9 and the second element is the remainder of the sequence.uO(i) where i is the breakpoint index. u, applied to a predicate p and a sequence xsP, returns a pair whose first element is the longest prefix (possibly empty) of xs of elements that do not satisfy p: and the second element is the remainder of the sequence.u p is equivalent to s (not . p).vv p is equivalent to t (not . p).wO(n). The w function takes a predicate p and a sequence xsT and returns sequences of those elements which do and do not satisfy the predicate.xO(n). The x function takes a predicate p and a sequence xsG and returns a sequence of those elements which satisfy the predicate.yyU finds the leftmost index of the specified element, if it is present, and otherwise .zzV finds the rightmost index of the specified element, if it is present, and otherwise .{{[ finds the indices of the specified element, from left to right (i.e. in ascending order).||\ finds the indices of the specified element, from right to left (i.e. in descending order).}} p xs9 finds the index of the leftmost element that satisfies p, if any exist.~~ p xs: finds the index of the rightmost element that satisfies p, if any exist. p, finds all indices of elements that satisfy p, in ascending order. p, finds all indices of elements that satisfy p, in descending order.O(n)I. Create a sequence from a finite list of elements. There is a function 5 in the opposite direction for all instances of the  class, including D.O(n). The reverse of a sequence.O(n)j. Reverse a sequence while mapping over it. This is not currently exported, but is used in rewrite rules.O(n). Constructs a new sequence with the same structure as an existing sequence using a user-supplied mapping function along with a splittable value and a way to split it. The value is split up lazily according to the structure of the sequence, so one piece of the value is distributed to each element of the sequence. The caller should provide a splitter function that takes a number, n5, and a splittable value, breaks off a chunk of size n from the value, and returns that chunk and the remainder as a pair. The following examples will hopefully make the usage clear: zipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c zipWith f s1 s2 = splitMap splitAt (\b a -> f a (b `index` 0)) s2' s1' where minLen = min (length s1) (length s2) s1' = take minLen s1 s2' = take minLen s2 bmapWithIndex :: (Int -> a -> b) -> Seq a -> Seq b mapWithIndex f = splitMap (\n i -> (i, n+i)) f 0 O(min(n1,n2)).  takes two sequences and returns a sequence of corresponding pairs. If one input is short, excess elements are discarded from the right end of the longer sequence. O(min(n1,n2)).  generalizes i by zipping with the function given as the first argument, instead of a tupling function. For example,  zipWith (+)I is applied to two sequences to take the sequence of corresponding sums.EA version of zipWith that assumes the sequences have the same length.O(min(n1,n2,n3)). H takes three sequences and returns a sequence of triples, analogous to .O(min(n1,n2,n3)).  takes a function which combines three elements, as well as three sequences and returns a sequence of their point-wise combinations, analogous to .O(min(n1,n2,n3,n4)). J takes four sequences and returns a sequence of quadruples, analogous to .O(min(n1,n2,n3,n4)).  takes a function which combines four elements, as well as four sequences and returns a sequence of their point-wise combinations, analogous to . O(n log n).  sorts the specified D_ by the natural ordering of its elements. The sort is stable. If stability is not required, A can be considerably faster, and in particular uses less memory. O(n log n).  sorts the specified D] according to the specified comparator. The sort is stable. If stability is not required, A can be considerably faster, and in particular uses less memory. O(n log n).  sorts the specified D by the natural ordering of its elements, but the sort is not stable. This algorithm is frequently faster and uses less memory than >, and performs extremely well -- frequently twice as fast as 0 -- when the sequence is already nearly sorted. O(n log n). A generalization of ,  takes an arbitrary comparator and sorts the specified sequence. The sort is not stable. This algorithm is frequently faster and uses less memory than >, and performs extremely well -- frequently twice as fast as 0 -- when the sequence is already nearly sorted.fromList2, given a list and its length, constructs a completely balanced Seq whose elements are that list using the replicateA generalization.), given a comparator function, unrolls a  into a sorted list.S, given an ordering function and a mechanism for queueifying elements, converts a  to a . merges two s.K>?@ABC     D !"#$%&'(E)*+,-./0123456FGHIJK7L89:;M<=N>?@ABCDEFGOPQRSTHUIVWXYZ[\JKL]MNO^_PQR`STUVaWXYZ[\]^_`abbcdefgcdefghijhklmnopqristuvwxyzjkl{|}~mnopqrstuvwxyz{|}~e>@?ACBDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~>?@ABC     D !"#$%&'(E)*+,-./0123456FGHIJK7L89:;M<=N>?@ABCDEFGOPQRSTHUIVWXYZ[\JKL]MNO^_PQR`STUVaWXYZ[\]^_`abbcdefgcdefghijhklmnopqristuvwxyzjkl{|}~mnopqrstuvwxyz{|}~ 8@5C55560L585M5<5N5>5(c) Ross Paterson 2005 (c) Louis Wasserman 2009 (c) Bertram Felgenhauer, David Feuer, Ross Paterson, and Milan Straka 2014 BSD-stylelibraries@haskell.org experimentalportableSafeO>@?ACBDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ODFGLMNefHIJKQOPRSABCT>?@UVWXYkljopqrstuvwx[\Z^_]gh`aiy{z|}~cmnbdE"(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy/05Multi-way trees, also known as  rose trees. label valuezero or more child trees%Neat 2-dimensional drawing of a tree.'Neat 2-dimensional drawing of a forest.$The elements of a tree in pre-order.)Lists of nodes at each level of the tree.Catamorphism on trees.Build a tree from a seed value)Build a forest from a list of seed values*Monadic tree builder, in depth-first order,Monadic forest builder, in depth-first orderPMonadic tree builder, in breadth-first order, using an algorithm adapted from JBreadth-First Numbering: Lessons from a Small Exercise in Algorithm Design, by Chris Okasaki, ICFP'00.RMonadic forest builder, in breadth-first order, using an algorithm adapted from JBreadth-First Numbering: Lessons from a Small Exercise in Algorithm Design, by Chris Okasaki, ICFP'00.#@(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportable Trustworthy /0BDER7A tactic for dealing with keys present in both maps in .A tactic of type  SimpleWhenMatched k x y z 6 is an abstract representation of a function of type  k -> x -> y -> Maybe z .8A tactic for dealing with keys present in both maps in  or .A tactic of type  WhenMatched f k x y z 6 is an abstract representation of a function of type  k -> x -> y -> f (Maybe z) .HA tactic for dealing with keys present in one map but not the other in .A tactic of type  SimpleWhenMissing k x z 6 is an abstract representation of a function of type  k -> x -> Maybe z .HA tactic for dealing with keys present in one map but not the other in  or .A tactic of type  WhenMissing f k x z 6 is an abstract representation of a function of type  k -> x -> f (Maybe z) .A Map from keys k to values a.O(log n)". Find the value at a key. Calls # when the element can not be found. gfromList [(5,'a'), (3,'b')] ! 1 Error: element not in the map fromList [(5,'a'), (3,'b')] ! 5 == 'a'Same as .O(1). Is the map empty? PData.Map.null (empty) == True Data.Map.null (singleton 1 'a') == FalseO(1)$. The number of elements in the map. size empty == 0 size (singleton 1 'a') == 1 size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3O(log n)'. Lookup the value at a key in the map.4The function will return the corresponding value as ( value), or  if the key isn't in the map.An example of using lookup: 7import Prelude hiding (lookup) import Data.Map employeeDept = fromList([("John","Sales"), ("Bob","IT")]) deptCountry = fromList([("IT","USA"), ("Sales","France")]) countryCurrency = fromList([("USA", "Dollar"), ("France", "Euro")]) employeeCurrency :: String -> Maybe String employeeCurrency name = do dept <- lookup name employeeDept country <- lookup dept deptCountry lookup country countryCurrency main = do putStrLn $ "John's currency: " ++ (show (employeeCurrency "John")) putStrLn $ "Pete's currency: " ++ (show (employeeCurrency "Pete"))The output of this program: 9 John's currency: Just "Euro" Pete's currency: NothingO(log n)+. Is the key a member of the map? See also . ^member 5 (fromList [(5,'a'), (3,'b')]) == True member 1 (fromList [(5,'a'), (3,'b')]) == FalseO(log n)/. Is the key not a member of the map? See also . dnotMember 5 (fromList [(5,'a'), (3,'b')]) == False notMember 1 (fromList [(5,'a'), (3,'b')]) == TrueO(log n)". Find the value at a key. Calls # when the element can not be found.O(log n). The expression ( def k map) returns the value at key k or returns default value def! when the key is not in the map. ufindWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x' findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'O(log n)^. Find largest key smaller than the given one and return the corresponding (key, value) pair. mlookupLT 3 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLT 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')O(log n)_. Find smallest key greater than the given one and return the corresponding (key, value) pair. mlookupGT 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGT 5 (fromList [(3,'a'), (5,'b')]) == NothingO(log n)e. Find largest key smaller or equal to the given one and return the corresponding (key, value) pair. lookupLE 2 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLE 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupLE 5 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')O(log n)f. Find smallest key greater or equal to the given one and return the corresponding (key, value) pair. lookupGE 3 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupGE 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGE 6 (fromList [(3,'a'), (5,'b')]) == NothingO(1). The empty map. )empty == fromList [] size empty == 0O(1). A map with a single element. Isingleton 1 'a' == fromList [(1, 'a')] size (singleton 1 'a') == 1O(log n). Insert a new key and value in the map. If the key is already present in the map, the associated value is replaced with the supplied value.  is equivalent to  . insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')] insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')] insert 5 'x' empty == singleton 5 'x'O(log n)>. Insert with a function, combining new value and old value.  f key value mp) will insert the pair (key, value) into mp^ if key does not exist in the map. If the key does exist, the function will insert the pair (key, f new_value old_value). insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")] insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWith (++) 5 "xxx" empty == singleton 5 "xxx"A helper function for . When the key is already in the map, the key is left alone, not replaced. The combining function is flipped--it is applied to the old value and then the new value.O(log n)C. Insert with a function, combining key, new value and old value.  f key value mp) will insert the pair (key, value) into mp^ if key does not exist in the map. If the key does exist, the function will insert the pair (key,f key new_value old_value);. Note that the key passed to f is the same key passed to . ]let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")] insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWithKey f 5 "xxx" empty == singleton 5 "xxx"A helper function for . When the key is already in the map, the key is left alone, not replaced. The combining function is flipped--it is applied to the old value and then the new value.O(log n)G. Combines insert operation with old value retrieval. The expression ( f k x map2) is a pair where the first element is equal to ( k map$) and the second element equal to ( f k x map). let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")]) insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "xxx")]) insertLookupWithKey f 5 "xxx" empty == (Nothing, singleton 5 "xxx")This is how to define  insertLookup using insertLookupWithKey: let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")]) insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "x")])O(log n)r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned. delete 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" delete 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] delete 5 empty == emptyO(log n). Update a value at a specific key with the result of the provided function. When the key is not a member of the map, the original map is returned. adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjust ("new " ++) 7 empty == emptyO(log n)k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned.  let f key x = (show key) ++ ":new " ++ x adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjustWithKey f 7 empty == emptyO(log n). The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. let f x = if x == "a" then Just "new a" else Nothing update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(log n). The expression ( f k map) updates the value x at k (if it is in the map). If (f k x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. 0let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(log n). Lookup and update. See also u. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted. llet f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "5:new a", fromList [(3, "b"), (5, "5:new a")]) updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a")]) updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")O(log n). The expression ( f k map) alters the value x at k, or absence thereof. 7 can be used to insert, delete, or update a value in a . In short :  k ( f k m) = f ( k m). Elet f _ = Nothing alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] alter f 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" let f _ = Just "c" alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "c")] alter f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "c")]O(log n). The expression ( f k map) alters the value x at k, or absence thereof. A can be used to inspect, insert, delete, or update a value in a  . In short:  k <$>  f k m = f ( k m).Example: interactiveAlter :: Int -> Map Int String -> IO (Map Int String) interactiveAlter k m = alterF f k m where f Nothing -> do putStrLn $ show k ++ " was not found in the map. Would you like to add it?" getUserResponse1 :: IO (Maybe String) f (Just old) -> do putStrLn "The key is currently bound to " ++ show old ++ ". Would you like to change or delete it?" getUserresponse2 :: IO (Maybe String)  is the most general operation for working with an individual key that may or may not be in a given map. When used with trivial functors like  and F, it is often slightly slower than more specialized combinators like  and q. However, when the functor is non-trivial and key comparison is not particularly cheap, it is the fastest way.Note on rewrite rules:3This module includes GHC rewrite rules to optimize  for the  and ` functors. In general, these rules improve performance. The sole exception is that when using , deleting a key that is already absent takes longer than it would without the rules. If you expect this to occur a very large fraction of the time, you might consider using a private copy of the  type.Note:  is a flipped version of the at combinator from $%.O(log n) . Return the indexe of a key, which is its zero-based index in the sequence sorted by keys. The index is a number from 0 up to, but not including, the  of the map. Calls  when the key is not a  of the map. findIndex 2 (fromList [(5,"a"), (3,"b")]) Error: element is not in the map findIndex 3 (fromList [(5,"a"), (3,"b")]) == 0 findIndex 5 (fromList [(5,"a"), (3,"b")]) == 1 findIndex 6 (fromList [(5,"a"), (3,"b")]) Error: element is not in the mapO(log n) . Lookup the indexe of a key, which is its zero-based index in the sequence sorted by keys. The index is a number from 0 up to, but not including, the  of the map. isJust (lookupIndex 2 (fromList [(5,"a"), (3,"b")])) == False fromJust (lookupIndex 3 (fromList [(5,"a"), (3,"b")])) == 0 fromJust (lookupIndex 5 (fromList [(5,"a"), (3,"b")])) == 1 isJust (lookupIndex 6 (fromList [(5,"a"), (3,"b")])) == FalseO(log n). Retrieve an element by its indexG, i.e. by its zero-based index in the sequence sorted by keys. If the index7 is out of range (less than zero, greater or equal to  of the map),  is called. elemAt 0 (fromList [(5,"a"), (3,"b")]) == (3,"b") elemAt 1 (fromList [(5,"a"), (3,"b")]) == (5, "a") elemAt 2 (fromList [(5,"a"), (3,"b")]) Error: index out of rangeOTake a given number of entries in key order, beginning with the smallest keys.  take n = 2 .  n . * ODrop a given number of entries in key order, beginning with the smallest keys.  drop n = 2 .  n . * O(log n)$. Split a map at a particular index. splitAt !n !xs = ( n xs,  n xs) O(log n). Update the element at indexG, i.e. by its zero-based index in the sequence sorted by keys. If the index7 is out of range (less than zero, greater or equal to  of the map),  is called. updateAt (\ _ _ -> Just "x") 0 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "x"), (5, "a")] updateAt (\ _ _ -> Just "x") 1 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "x")] updateAt (\ _ _ -> Just "x") 2 (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\ _ _ -> Just "x") (-1) (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\_ _ -> Nothing) 0 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" updateAt (\_ _ -> Nothing) 1 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" updateAt (\_ _ -> Nothing) 2 (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\_ _ -> Nothing) (-1) (fromList [(5,"a"), (3,"b")]) Error: index out of rangeO(log n). Delete the element at indexG, i.e. by its zero-based index in the sequence sorted by keys. If the index7 is out of range (less than zero, greater or equal to  of the map),  is called. deleteAt 0 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" deleteAt 1 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" deleteAt 2 (fromList [(5,"a"), (3,"b")]) Error: index out of range deleteAt (-1) (fromList [(5,"a"), (3,"b")]) Error: index out of rangeO(log n)$. The minimal key of the map. Calls  if the map is empty. findMin (fromList [(5,"a"), (3,"b")]) == (3,"b") findMin empty Error: empty map has no minimal elementO(log n)$. The maximal key of the map. Calls  if the map is empty. findMax (fromList [(5,"a"), (3,"b")]) == (5,"a") findMax empty Error: empty map has no maximal elementO(log n)C. Delete the minimal key. Returns an empty map if the map is empty. hdeleteMin (fromList [(5,"a"), (3,"b"), (7,"c")]) == fromList [(5,"a"), (7,"c")] deleteMin empty == emptyO(log n)C. Delete the maximal key. Returns an empty map if the map is empty. hdeleteMax (fromList [(5,"a"), (3,"b"), (7,"c")]) == fromList [(3,"b"), (5,"a")] deleteMax empty == emptyO(log n)&. Update the value at the minimal key. updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")] updateMin (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(log n)&. Update the value at the maximal key. updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")] updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"O(log n)&. Update the value at the minimal key. updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")] updateMinWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(log n)&. Update the value at the maximal key. updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")] updateMaxWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"O(log n)_. Retrieves the minimal (key,value) pair of the map, and the map stripped of that element, or  if passed an empty map. ominViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((3,"b"), singleton 5 "a") minViewWithKey empty == NothingO(log n)_. Retrieves the maximal (key,value) pair of the map, and the map stripped of that element, or  if passed an empty map. omaxViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((5,"a"), singleton 3 "b") maxViewWithKey empty == NothingO(log n)h. Retrieves the value associated with minimal key of the map, and the map stripped of that element, or  if passed an empty map. ]minView (fromList [(5,"a"), (3,"b")]) == Just ("b", singleton 5 "a") minView empty == NothingO(log n)h. Retrieves the value associated with maximal key of the map, and the map stripped of that element, or  if passed an empty map. ]maxView (fromList [(5,"a"), (3,"b")]) == Just ("a", singleton 3 "b") maxView empty == Nothing!The union of a list of maps: ( ==   ). 9unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "b"), (5, "a"), (7, "C")] unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])] == fromList [(3, "B3"), (5, "A3"), (7, "C")]=The union of a list of maps, with a combining operation: ( f ==  ( f) ). unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]O(m*log(n/m + 1)), m <= n. The expression ( t1 t2!) takes the left-biased union of t1 and t2. It prefers t1- when duplicate keys are encountered, i.e. ( ==  ). punion (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "a"), (7, "C")]O(m*log(n/m + 1)), m <= n". Union with a combining function. zunionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]O(m*log(n/m + 1)), m <= n#. Union with a combining function. let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]O(m*log(n/m + 1)), m <= n[. Difference of two maps. Return elements of the first map not existing in the second map. ]difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b" O(m*log(n'm + 1)), m <= n/. Remove all keys in a  from a . m  s =  (k _ -> k `&' s) m O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the values of these keys. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")]) == singleton 3 "b:B"O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")]) == singleton 3 "3:b|B"O(m*log(n/m + 1)), m <= n`. Intersection of two maps. Return data in the first map for the keys existing in both maps. ( m1 m2 ==   m1 m2). _intersection (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "a" O(m*log(nm + 1)), m <= n/. Restrict a  to only those keys found in a . m  s =  (k _ -> k `&( s) m O(m*log(n/m + 1)), m <= n). Intersection with a combining function. iintersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"O(m*log(n/m + 1)), m <= n). Intersection with a combining function. let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"Map covariantly over a  f k x.Map covariantly over a  f k x', using only a 'Functor f' constraint.Map covariantly over a  f k x', using only a 'Functor f' constraint.Map contravariantly over a  f k _ x.Map contravariantly over a  f k _ y z.Map contravariantly over a  f k x _ z.DAlong with zipWithMaybeAMatched, witnesses the isomorphism between WhenMatched f k x y z and k -> x -> y -> f (Maybe z).DAlong with traverseMaybeMissing, witnesses the isomorphism between WhenMissing f k x y and k -> x -> f (Maybe y).Map covariantly over a  f k x y.oWhen a key is found in both maps, apply a function to the key and values and use the result in the merged map. QzipWithMatched :: (k -> x -> y -> z) -> SimpleWhenMatched k x y z When a key is found in both maps, apply a function to the key and values to produce an action and use its result in the merged map.uWhen a key is found in both maps, apply a function to the key and values and maybe use the result in the merged map. azipWithMaybeMatched :: (k -> x -> y -> Maybe z) -> SimpleWhenMatched k x y z When a key is found in both maps, apply a function to the key and values, perform the resulting action, and maybe use the result in the merged map.This is the fundamental  tactic.@Drop all the entries whose keys are missing from the other map. 'dropMissing :: SimpleWhenMissing k x y /dropMissing = mapMaybeMissing (\_ _ -> Nothing)but  dropMissing is much faster.LPreserve, unchanged, the entries whose keys are missing from the other map. +preserveMissing :: SimpleWhenMissing k x x =preserveMissing = Lazy.Merge.mapMaybeMissing (\_ x -> Just x)but preserveMissing is much faster.?Map over the entries whose keys are missing from the other map. 7mapMissing :: (k -> x -> y) -> SimpleWhenMissing k x y 5mapMissing f = mapMaybeMissing (\k x -> Just $ f k x)but  mapMissing is somewhat faster.uMap over the entries whose keys are missing from the other map, optionally removing some. This is the most powerful 0 tactic, but others are usually more efficient. BmapMaybeMissing :: (k -> x -> Maybe y) -> SimpleWhenMissing k x y ?mapMaybeMissing f = traverseMaybeMissing (\k x -> pure (f k x))but mapMaybeMissing uses fewer unnecessary  operations.=Filter the entries whose keys are missing from the other map. =filterMissing :: (k -> x -> Bool) -> SimpleWhenMissing k x x NfilterMissing f = Lazy.Merge.mapMaybeMissing $ \k x -> guard (f k x) *> Just x#but this should be a little faster.IFilter the entries whose keys are missing from the other map using some  action. WfilterAMissing f = Lazy.Merge.traverseMaybeMissing $ k x -> (b -> guard b *> Just x)  $ f k x #but this should be a little faster.:This wasn't in Data.Bool until 4.7.0, so we define it hereDTraverse over the entries whose keys are missing from the other map.Traverse over the entries whose keys are missing from the other map, optionally producing values to put in the result. This is the most powerful 0 tactic, but others are usually more efficient.Merge two maps.merge takes two  tactics, a } tactic and two maps. It uses the tactics to merge the maps. Its behavior is best understood via its fundamental tactics,  and .Consider umerge (mapMaybeMissing g1) (mapMaybeMissing g2) (zipWithMaybeMatched f) m1 m2 Take, for example,  m1 = [(0, a), (1, b), (3,c), (4, d/)] m2 = [(1, "one"), (2, "two"), (4, "three")] merge will first 'align' these maps by key:  m1 = [(0, a), (1, b), (3,c), (4, dB)] m2 = [(1, "one"), (2, "two"), (4, "three")] BIt will then pass the individual entries and pairs of entries to g1, g2, or f as appropriate: maybes = [g1 0 a, f 1 b "one", g2 2 "two", g1 3 c, f 4 d "three"] This produces a  for each key: ukeys = 0 1 2 3 4 results = [Nothing, Just True, Just False, Nothing, Just True]  Finally, the Just" results are collected into a map: 2return value = [(1, True), (2, False), (4, True)] AThe other tactics below are optimizations or simplifications of % for special cases. Most importantly, drops all the keys. leaves all the entries alone.When t is given three arguments, it is inlined at the call site. To prevent excessive inlining, you should typically use , to define your custom combining functions. Examples:IunionWithKey f = merge preserveMissing preserveMissing (zipWithMatched f)HintersectionWithKey f = merge dropMissing dropMissing (zipWithMatched f)0differenceWith f = merge diffPreserve diffDrop fJsymmetricDifference = merge diffPreserve diffPreserve (\ _ _ _ -> Nothing)@mapEachPiece f g h = merge (diffMapWithKey f) (diffMapWithKey g)An applicative version of .mergeA takes two  tactics, a } tactic and two maps. It uses the tactics to merge the maps. Its behavior is best understood via its fundamental tactics,  and .Consider mergeA (traverseMaybeMissing g1) (traverseMaybeMissing g2) (zipWithMaybeAMatched f) m1 m2 Take, for example,  m1 = [(0, a), (1, b), (3,c), (4, d/)] m2 = [(1, "one"), (2, "two"), (4, "three")] mergeA will first 'align' these maps by key:  m1 = [(0, a), (1, b), (3,c), (4, dB)] m2 = [(1, "one"), (2, "two"), (4, "three")] BIt will then pass the individual entries and pairs of entries to g1, g2, or f as appropriate: actions = [g1 0 a, f 1 b "one", g2 2 "two", g1 3 c, f 4 d "three"] )Next, it will perform the actions in the actions# list in order from left to right. ukeys = 0 1 2 3 4 results = [Nothing, Just True, Just False, Nothing, Just True]  Finally, the Just" results are collected into a map: 2return value = [(1, True), (2, False), (4, True)] AThe other tactics below are optimizations or simplifications of % for special cases. Most importantly, drops all the keys. leaves all the entries alone. does not use the  context.When z is given three arguments, it is inlined at the call site. To prevent excessive inlining, you should generally only use & to define custom combining functions.O(n+m)'. An unsafe general combining function.WARNING: This function can produce corrupt maps and its results may depend on the internal structures of its inputs. Users should prefer  or .When U is given three arguments, it is inlined to the call site. You should therefore use K only to define custom combining functions. For example, you could define ,  and  as myUnionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) id id m1 m2 myDifferenceWithKey f m1 m2 = mergeWithKey f id (const empty) m1 m2 myIntersectionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) (const empty) (const empty) m1 m2 When calling  combine only1 only2, a function combining two s is created, such thatXif a key is present in both maps, it is passed with both corresponding values to the combinet function. Depending on the result, the key is either present in the result with specified value, or is left out;>a nonempty subtree present only in the first map is passed to only1* and the output is added to the result;?a nonempty subtree present only in the second map is passed to only2* and the output is added to the result.The only1 and only2 methods Mmust return a map with a subset (possibly empty) of the keys of the given mapC. The values can be modified arbitrarily. Most common variants of only1 and only2 are  and  , but for example  f,  f, or   f could be used for any f. O(m*log(n0m + 1)), m <= n/. This function is defined as ( =  (==)). O(m*log(n#m + 1)), m <= n/. The expression ( f t1 t2 ) returns  if all keys in t1 are in tree t2 , and when f returns [ when applied to their respective values. For example, the following expressions are all : isSubmapOfBy (==) (fromList [('a',1)]) (fromList [('a',1),('b',2)]) isSubmapOfBy (<=) (fromList [('a',1)]) (fromList [('a',1),('b',2)]) isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1),('b',2)])But the following are all : isSubmapOfBy (==) (fromList [('a',2)]) (fromList [('a',1),('b',2)]) isSubmapOfBy (<) (fromList [('a',1)]) (fromList [('a',1),('b',2)]) isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1)]) O(m*log(nVm + 1)), m <= n/. Is this a proper submap? (ie. a submap but not equal). Defined as ( =  (==)). O(m*log(nZm + 1)), m <= n/. Is this a proper submap? (ie. a submap but not equal). The expression ( f m1 m2 ) returns  when m1 and m2 are not equal, all keys in m1 are in m2 , and when f returns [ when applied to their respective values. For example, the following expressions are all : isProperSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)]) isProperSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])But the following are all : isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)]) isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)]) isProperSubmapOfBy (<) (fromList [(1,1)]) (fromList [(1,1),(2,2)])O(n)/. Filter all values that satisfy the predicate. filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty filter (< "a") (fromList [(5,"a"), (3,"b")]) == emptyO(n)4. Filter all keys/values that satisfy the predicate. NfilterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(n)". Filter keys and values using an  predicate.O(log n)d. Take while a predicate on the keys holds. The user is responsible for ensuring that for all keys j and k in the map, j < k ==> p j >= p k. See note at . takeWhileAntitone p = 2 .  (p . fst) . ) takeWhileAntitone p =  (k _ -> p k) O(log n)d. Drop while a predicate on the keys holds. The user is responsible for ensuring that for all keys j and k in the map, j < k ==> p j >= p k. See note at . dropWhileAntitone p = 2 .  (p . fst) . ) dropWhileAntitone p =  (k -> not (p k)) O(log n). Divide a map at the point where a predicate on the keys stops holding. The user is responsible for ensuring that for all keys j and k in the map, j < k ==> p j >= p k. spanAntitone p xs = ( p xs, * p xs) spanAntitone p xs = partition p xs  Note: if p is not actually antitone, then  spanAntitone will split the map at some  unspecified point where the predicate switches from holding to not holding (where the predicate is seen to hold before the first key and to fail after the last key).O(n). Partition the map according to a predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also 4.  partition (> "a") (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a") partition (< "x") (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty) partition (> "x") (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")]) O(n). Partition the map according to a predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also 4. 9partitionWithKey (\ k _ -> k > 3) (fromList [(5,"a"), (3,"b")]) == (singleton 5 "a", singleton 3 "b") partitionWithKey (\ k _ -> k < 7) (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty) partitionWithKey (\ k _ -> k > 7) (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")]) O(n). Map values and collect the  results. tlet f x = if x == "a" then Just "new a" else Nothing mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a" O(n)". Map keys/values and collect the  results. let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3" O(n)'. Traverse keys/values and collect the  results. O(n). Map values and separate the  and  results. 5let f a = if a < "c" then Left a else Right a mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")]) mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])O(n)#. Map keys/values and separate the  and  results. Olet f k a = if k < 5 then Left (k * 2) else Right (a ++ a) mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")]) mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")])O(n),. Map a function over all values in the map. Mmap (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]O(n),. Map a function over all values in the map. tlet f key x = (show key) ++ ":" ++ x mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]O(n).  f m == &  $  ((k, v) -> (,) k  $ f k v) () m)* That is, behaves exactly like a regular Y except that the traversing function also has access to the key associated with a value. traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(1, 'a'), (5, 'e')]) == Just (fromList [(1, 'b'), (5, 'f')]) traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(2, 'c')]) == NothingO(n). The function N threads an accumulating argument through the map in ascending order of keys. let f a b = (a ++ b, b ++ "X") mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])O(n). The function N threads an accumulating argument through the map in ascending order of keys. let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X") mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])O(n). The function N threads an accumulating argument through the map in ascending order of keys.O(n). The function  mapAccumRO threads an accumulating argument through the map in descending order of keys. O(n*log n).  f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the greatest of the original keys is retained. mapKeys (+ 1) (fromList [(5,"a"), (3,"b")]) == fromList [(4, "b"), (6, "a")] mapKeys (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "c" mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "c" O(n*log n).  c f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if fr maps two or more distinct keys to the same new key. In this case the associated values will be combined using c. mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab" mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"O(n).  f s ==  f s, but works only when f2 is strictly monotonic. That is, for any values x and y, if x < y then f x < f y.  The precondition is not checked. Semi-formally, we have: ~and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapKeysMonotonic f s == mapKeys f s where ls = keys sThis means that fd maps distinct original keys to distinct resulting keys. This function has better performance than . mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")]) == fromList [(6, "b"), (10, "a")] valid (mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")])) == True valid (mapKeysMonotonic (\ _ -> 1) (fromList [(5,"a"), (3,"b")])) == FalseO(n)[. Fold the values in the map using the given right-associative binary operator, such that  f z ==  f z . !. For example, elems map = foldr (:) [] map Mlet f a len = len + (length a) foldr f 0 (fromList [(5,"a"), (3,"bbb")]) == 4O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)Z. Fold the values in the map using the given left-associative binary operator, such that  f z ==  f z . !. For example, %elems = reverse . foldl (flip (:)) [] Mlet f len a = len + (length a) foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)e. Fold the keys and values in the map using the given right-associative binary operator, such that  f z ==  ( f) z . *. For example, 0keys map = foldrWithKey (\k x ks -> k:ks) [] map let f k a result = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")" foldrWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (5:a)(3:b)"O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)d. Fold the keys and values in the map using the given left-associative binary operator, such that  f z ==  (\z' (kx, x) -> f z' kx x) z . *. For example, 2keys = reverse . foldlWithKey (\ks k x -> k:ks) [] let f result k a = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")" foldlWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (3:b)(5:a)"O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value. O(n)G. Fold the keys and values in the map using the given monoid, such that   f = ) .  f*This can be an asymptotically faster than  or  for some monoids.!O(n)`. Return all elements of the map in the ascending order of their keys. Subject to list fusion. Belems (fromList [(5,"a"), (3,"b")]) == ["b","a"] elems empty == []"O(n)I. Return all keys of the map in ascending order. Subject to list fusion. <keys (fromList [(5,"a"), (3,"b")]) == [3,5] keys empty == []#O(n). An alias for *X. Return all key/value pairs in the map in ascending key order. Subject to list fusion. Massocs (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] assocs empty == []$O(n)!. The set of all keys of the map. `keysSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [3,5] keysSet empty == Data.Set.empty%O(n)W. Build a map from a set of keys and a function which for each key computes its value. fromSet (\k -> replicate k 'a') (Data.Set.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")] fromSet undefined Data.Set.empty == empty& O(n*log n)7. Build a map from a list of key/value pairs. See also ,f. If the list contains more than one value for the same key, the last value for the key is retained.hIf the keys of the list are ordered, linear-time implementation is used, with the performance equal to 2. fromList [] == empty fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")] fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]' O(n*log n)Q. Build a map from a list of key/value pairs with a combining function. See also .. fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")] fromListWith (++) [] == empty( O(n*log n)Q. Build a map from a list of key/value pairs with a combining function. See also 0. let f k a1 a2 = (show k) ++ a1 ++ a2 fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "3ab"), (5, "5a5ba")] fromListWithKey f [] == empty)O(n)G. Convert the map to a list of key/value pairs. Subject to list fusion. MtoList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] toList empty == []*O(n)n. Convert the map to a list of key/value pairs where the keys are in ascending order. Subject to list fusion. =toAscList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]+O(n)o. Convert the map to a list of key/value pairs where the keys are in descending order. Subject to list fusion. >toDescList (fromList [(5,"a"), (3,"b")]) == [(5,"a"), (3,"b")],O(n)6. Build a map from an ascending list in linear time. :The precondition (input list is ascending) is not checked. fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")] valid (fromAscList [(3,"b"), (5,"a"), (5,"b")]) == True valid (fromAscList [(5,"a"), (3,"b"), (5,"b")]) == False-O(n)6. Build a map from a descending list in linear time. ;The precondition (input list is descending) is not checked. fromDescList [(5,"a"), (3,"b")] == fromList [(3, "b"), (5, "a")] fromDescList [(5,"a"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "b")] valid (fromDescList [(5,"a"), (5,"b"), (3,"b")]) == True valid (fromDescList [(5,"a"), (3,"b"), (5,"b")]) == False.O(n)_. Build a map from an ascending list in linear time with a combining function for equal keys. :The precondition (input list is ascending) is not checked. fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")] valid (fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")]) == True valid (fromAscListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == False/O(n)_. Build a map from a descending list in linear time with a combining function for equal keys. ;The precondition (input list is descending) is not checked. fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "ba")] valid (fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")]) == True valid (fromDescListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == False0O(n)`. Build a map from an ascending list in linear time with a combining function for equal keys. :The precondition (input list is ascending) is not checked. !let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2 fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")] == fromList [(3, "b"), (5, "5:b5:ba")] valid (fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")]) == True valid (fromAscListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False1O(n)`. Build a map from a descending list in linear time with a combining function for equal keys. ;The precondition (input list is descending) is not checked. $let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2 fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "5:b5:ba")] valid (fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")]) == True valid (fromDescListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False2O(n)K. Build a map from an ascending list of distinct elements in linear time.  The precondition is not checked. fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] valid (fromDistinctAscList [(3,"b"), (5,"a")]) == True valid (fromDistinctAscList [(3,"b"), (5,"a"), (5,"b")]) == False3O(n)K. Build a map from a descending list of distinct elements in linear time.  The precondition is not checked. fromDistinctDescList [(5,"a"), (3,"b")] == fromList [(3, "b"), (5, "a")] valid (fromDistinctDescList [(5,"a"), (3,"b")]) == True valid (fromDistinctDescList [(5,"a"), (5,"b"), (3,"b")]) == False4O(log n). The expression (4 k map ) is a pair  (map1,map2) where the keys in map1 are smaller than k and the keys in map2 larger than k. Any key equal to k is found in neither map1 nor map2. ksplit 2 (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3,"b"), (5,"a")]) split 3 (fromList [(5,"a"), (3,"b")]) == (empty, singleton 5 "a") split 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a") split 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", empty) split 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], empty)5O(log n). The expression (5 k map) splits a map just like 4 but also returns  k map. splitLookup 2 (fromList [(5,"a"), (3,"b")]) == (empty, Nothing, fromList [(3,"b"), (5,"a")]) splitLookup 3 (fromList [(5,"a"), (3,"b")]) == (empty, Just "b", singleton 5 "a") splitLookup 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Nothing, singleton 5 "a") splitLookup 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Just "a", empty) splitLookup 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], Nothing, empty) A variant of 5o that indicates only whether the key was present, rather than producing its value. This is used to implement ! to avoid allocating unnecessary  constructors.6O(log n)&. Delete and find the minimal element. deleteFindMin (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((3,"b"), fromList[(5,"a"), (10,"c")]) deleteFindMin Error: can not return the minimal element of an empty map7O(log n)&. Delete and find the maximal element. deleteFindMax (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((10,"c"), fromList [(3,"b"), (5,"a")]) deleteFindMax empty Error: can not return the maximal element of an empty map8O(n)a. Show the tree that implements the map. The tree is shown in a compressed, hanging format. See 9.9O(n). The expression (9 showelem hang wide mapH) shows the tree that implements the map. Elements are shown using the showElem function. If hang is , a hanging6 tree is shown otherwise a rotated tree is shown. If wide is !, an extra wide version is shown.  Map> let t = fromDistinctAscList [(x,()) | x <- [1..5]] Map> putStrLn $ showTreeWith (\k x -> show (k,x)) True False t (4,()) +--(2,()) | +--(1,()) | +--(3,()) +--(5,()) Map> putStrLn $ showTreeWith (\k x -> show (k,x)) True True t (4,()) | +--(2,()) | | | +--(1,()) | | | +--(3,()) | +--(5,()) Map> putStrLn $ showTreeWith (\k x -> show (k,x)) False True t +--(5,()) | (4,()) | | +--(3,()) | | +--(2,()) | +--(1,()):O(n).. Test if the internal map structure is valid. ^valid (fromAscList [(3,"b"), (5,"a")]) == True valid (fromAscList [(5,"a"), (3,"b")]) == FalseExported only for Debug.QuickCheck;O(1). Decompose a map into pieces based on the structure of the underlying tree. This function is useful for consuming a map in parallel.No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first submap less than all elements in the second, and so on). Examples: splitRoot (fromList (zip [1..6] ['a'..])) == [fromList [(1,'a'),(2,'b'),(3,'c')],fromList [(4,'d')],fromList [(5,'e'),(6,'f')]] splitRoot empty == []Note that the current implementation does not return more than three submaps, but you should not depend on this behaviour because it can change in the future without notice.Equivalent to . ReaderT k (ReaderT x (ReaderT y (MaybeT f))) Equivalent to . ReaderT k (ReaderT x (ReaderT y (MaybeT f))) Equivalent to " ReaderT k (ReaderT x (MaybeT f)) .Equivalent to " ReaderT k (ReaderT x (MaybeT f)) .What to do with keys in m1 but not m2What to do with keys in m2 but not m1What to do with keys in both m1 and m2Map m1Map m2What to do with keys in m1 but not m2What to do with keys in m2 but not m1What to do with keys in both m1 and m2Map m1Map m2      !"#$%&'()*+,-./0123456789:;     jkl      !"#$%&'()*+,-./0123456789:;      !"#$%&'()*+,-./0123456789:;     9 9 @(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportableSafez      !"#$%&'()*+,-./0123456789:;z  !"#$%)&'(*+,.02-/13    45;6789:(c) David Feuer 2016 BSD-stylelibraries@haskell.org provisionalportableSafe /0BDER*@(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportable Trustworthy=<O(log n). The expression (< def k map) returns the value at key k or returns default value def! when the key is not in the map. ufindWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x' findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'=O(1). A map with a single element. Isingleton 1 'a' == fromList [(1, 'a')] size (singleton 1 'a') == 1>O(log n). Insert a new key and value in the map. If the key is already present in the map, the associated value is replaced with the supplied value. > is equivalent to ? . insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')] insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')] insert 5 'x' empty == singleton 5 'x'?O(log n)>. Insert with a function, combining new value and old value. ? f key value mp) will insert the pair (key, value) into mp^ if key does not exist in the map. If the key does exist, the function will insert the pair (key, f new_value old_value). insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")] insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWith (++) 5 "xxx" empty == singleton 5 "xxx"@O(log n)C. Insert with a function, combining key, new value and old value. @ f key value mp) will insert the pair (key, value) into mp^ if key does not exist in the map. If the key does exist, the function will insert the pair (key,f key new_value old_value);. Note that the key passed to f is the same key passed to @. ]let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")] insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWithKey f 5 "xxx" empty == singleton 5 "xxx"AO(log n)G. Combines insert operation with old value retrieval. The expression (A f k x map2) is a pair where the first element is equal to ( k map$) and the second element equal to (@ f k x map). let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")]) insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "xxx")]) insertLookupWithKey f 5 "xxx" empty == (Nothing, singleton 5 "xxx")This is how to define  insertLookup using insertLookupWithKey: let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")]) insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "x")])BO(log n). Update a value at a specific key with the result of the provided function. When the key is not a member of the map, the original map is returned. adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjust ("new " ++) 7 empty == emptyCO(log n)k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned.  let f key x = (show key) ++ ":new " ++ x adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjustWithKey f 7 empty == emptyDO(log n). The expression (D f k map) updates the value x at k (if it is in the map). If (f x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. let f x = if x == "a" then Just "new a" else Nothing update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"EO(log n). The expression (E f k map) updates the value x at k (if it is in the map). If (f k x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. 0let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"FO(log n). Lookup and update. See also Eu. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted. llet f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "5:new a", fromList [(3, "b"), (5, "5:new a")]) updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a")]) updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")GO(log n). The expression (G f k map) alters the value x at k, or absence thereof. G7 can be used to insert, delete, or update a value in a . In short :  k (G f k m) = f ( k m). Elet f _ = Nothing alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] alter f 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" let f _ = Just "c" alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "c")] alter f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "c")]HO(log n). The expression (H f k map) alters the value x at k, or absence thereof. H@ can be used to inspect, insert, delete, or update a value in a  . In short:  k <$> H f k m = f ( k m).Example: interactiveAlter :: Int -> Map Int String -> IO (Map Int String) interactiveAlter k m = alterF f k m where f Nothing -> do putStrLn $ show k ++ " was not found in the map. Would you like to add it?" getUserResponse1 :: IO (Maybe String) f (Just old) -> do putStrLn "The key is currently bound to " ++ show old ++ ". Would you like to change or delete it?" getUserresponse2 :: IO (Maybe String) H is the most general operation for working with an individual key that may or may not be in a given map. When used with trivial functors like  and F, it is often slightly slower than more specialized combinators like  and >q. However, when the functor is non-trivial and key comparison is not particularly cheap, it is the fastest way.Note on rewrite rules:3This module includes GHC rewrite rules to optimize H for the  and ` functors. In general, these rules improve performance. The sole exception is that when using , deleting a key that is already absent takes longer than it would without the rules. If you expect this to occur a very large fraction of the time, you might consider using a private copy of the  type.Note: H is a flipped version of the at combinator from $%.IO(log n). Update the element at index. Calls  when an invalid index is used. updateAt (\ _ _ -> Just "x") 0 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "x"), (5, "a")] updateAt (\ _ _ -> Just "x") 1 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "x")] updateAt (\ _ _ -> Just "x") 2 (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\ _ _ -> Just "x") (-1) (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\_ _ -> Nothing) 0 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" updateAt (\_ _ -> Nothing) 1 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" updateAt (\_ _ -> Nothing) 2 (fromList [(5,"a"), (3,"b")]) Error: index out of range updateAt (\_ _ -> Nothing) (-1) (fromList [(5,"a"), (3,"b")]) Error: index out of rangeJO(log n)&. Update the value at the minimal key. updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")] updateMin (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"KO(log n)&. Update the value at the maximal key. updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")] updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"LO(log n)&. Update the value at the minimal key. updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")] updateMinWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"MO(log n)&. Update the value at the maximal key. updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")] updateMaxWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"N=The union of a list of maps, with a combining operation: (N f ==  (O f) ). unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]OO(m*log(n/m + 1)), m <= n". Union with a combining function. zunionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]PO(m*log(n/m + 1)), m <= n#. Union with a combining function. let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]QO(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the values of these keys. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")]) == singleton 3 "b:B"RO(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")]) == singleton 3 "3:b|B"SO(m*log(n/m + 1)), m <= n). Intersection with a combining function. iintersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"TO(m*log(n/m + 1)), m <= n). Intersection with a combining function. let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"UMap covariantly over a  f k x.VMap covariantly over a  f k x y.WuWhen a key is found in both maps, apply a function to the key and values and maybe use the result in the merged map. azipWithMaybeMatched :: (k -> x -> y -> Maybe z) -> SimpleWhenMatched k x y z XWhen a key is found in both maps, apply a function to the key and values, perform the resulting action, and maybe use the result in the merged map.This is the fundamental  tactic.YWhen a key is found in both maps, apply a function to the key and values to produce an action and use its result in the merged map.ZoWhen a key is found in both maps, apply a function to the key and values and use the result in the merged map. QzipWithMatched :: (k -> x -> y -> z) -> SimpleWhenMatched k x y z [uMap over the entries whose keys are missing from the other map, optionally removing some. This is the most powerful 0 tactic, but others are usually more efficient. BmapMaybeMissing :: (k -> x -> Maybe y) -> SimpleWhenMissing k x y ?mapMaybeMissing f = traverseMaybeMissing (\k x -> pure (f k x))but mapMaybeMissing uses fewer unnecessary  operations.\?Map over the entries whose keys are missing from the other map. 7mapMissing :: (k -> x -> y) -> SimpleWhenMissing k x y 5mapMissing f = mapMaybeMissing (\k x -> Just $ f k x)but  mapMissing is somewhat faster.]Traverse over the entries whose keys are missing from the other map, optionally producing values to put in the result. This is the most powerful 0 tactic, but others are usually more efficient.^DTraverse over the entries whose keys are missing from the other map._O(n+m)). An unsafe universal combining function.WARNING: This function can produce corrupt maps and its results may depend on the internal structures of its inputs. Users should prefer + or ,.When _U is given three arguments, it is inlined to the call site. You should therefore use _K only to define custom combining functions. For example, you could define P, R and T as myUnionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) id id m1 m2 myDifferenceWithKey f m1 m2 = mergeWithKey f id (const empty) m1 m2 myIntersectionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) (const empty) (const empty) m1 m2 When calling _ combine only1 only2, a function combining two s is created, such thatXif a key is present in both maps, it is passed with both corresponding values to the combinet function. Depending on the result, the key is either present in the result with specified value, or is left out;>a nonempty subtree present only in the first map is passed to only1* and the output is added to the result;?a nonempty subtree present only in the second map is passed to only2* and the output is added to the result.The only1 and only2 methods Mmust return a map with a subset (possibly empty) of the keys of the given mapC. The values can be modified arbitrarily. Most common variants of only1 and only2 are  and  , but for example e f or  f could be used for any f.`O(n). Map values and collect the  results. tlet f x = if x == "a" then Just "new a" else Nothing mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"aO(n)". Map keys/values and collect the  results. let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"bO(n)'. Traverse keys/values and collect the  results.cO(n). Map values and separate the  and  results. 5let f a = if a < "c" then Left a else Right a mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")]) mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])dO(n)#. Map keys/values and separate the  and  results. Olet f k a = if k < 5 then Left (k * 2) else Right (a ++ a) mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")]) mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")])eO(n),. Map a function over all values in the map. Mmap (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]fO(n),. Map a function over all values in the map. tlet f key x = (show key) ++ ":" ++ x mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]gO(n). g f m == m  $  ((k, v) -> (v' -> v'  (k,v'))  $ f k v) () m)* That is, it behaves much like a regular  except that the traversing function also has access to the key associated with a value and the values are forced before they are installed in the result map. traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(1, 'a'), (5, 'e')]) == Just (fromList [(1, 'b'), (5, 'f')]) traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(2, 'c')]) == NothinghO(n). The function hN threads an accumulating argument through the map in ascending order of keys. let f a b = (a ++ b, b ++ "X") mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])iO(n). The function iN threads an accumulating argument through the map in ascending order of keys. let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X") mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])O(n). The function N threads an accumulating argument through the map in ascending order of keys.jO(n). The function  mapAccumRO threads an accumulating argument through the map in descending order of keys.k O(n*log n). k c f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if fr maps two or more distinct keys to the same new key. In this case the associated values will be combined using c. mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab" mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"lO(n)W. Build a map from a set of keys and a function which for each key computes its value. fromSet (\k -> replicate k 'a') (Data.Set.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")] fromSet undefined Data.Set.empty == emptym O(n*log n)7. Build a map from a list of key/value pairs. See also pf. If the list contains more than one value for the same key, the last value for the key is retained.hIf the keys of the list are ordered, linear-time implementation is used, with the performance equal to v. fromList [] == empty fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")] fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]n O(n*log n)Q. Build a map from a list of key/value pairs with a combining function. See also r. fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")] fromListWith (++) [] == emptyo O(n*log n)Q. Build a map from a list of key/value pairs with a combining function. See also t. let f k a1 a2 = (show k) ++ a1 ++ a2 fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "3ab"), (5, "5a5ba")] fromListWithKey f [] == emptypO(n)6. Build a map from an ascending list in linear time. :The precondition (input list is ascending) is not checked. fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")] valid (fromAscList [(3,"b"), (5,"a"), (5,"b")]) == True valid (fromAscList [(5,"a"), (3,"b"), (5,"b")]) == FalseqO(n)6. Build a map from a descending list in linear time. ;The precondition (input list is descending) is not checked. fromDescList [(5,"a"), (3,"b")] == fromList [(3, "b"), (5, "a")] fromDescList [(5,"a"), (5,"b"), (3,"a")] == fromList [(3, "b"), (5, "b")] valid (fromDescList [(5,"a"), (5,"b"), (3,"b")]) == True valid (fromDescList [(5,"a"), (3,"b"), (5,"b")]) == FalserO(n)_. Build a map from an ascending list in linear time with a combining function for equal keys. :The precondition (input list is ascending) is not checked. fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")] valid (fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")]) == True valid (fromAscListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == FalsesO(n)_. Build a map from a descending list in linear time with a combining function for equal keys. ;The precondition (input list is descending) is not checked. fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "ba")] valid (fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")]) == True valid (fromDescListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == FalsetO(n)`. Build a map from an ascending list in linear time with a combining function for equal keys. :The precondition (input list is ascending) is not checked. !let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2 fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")] == fromList [(3, "b"), (5, "5:b5:ba")] valid (fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")]) == True valid (fromAscListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == FalseuO(n)`. Build a map from a descending list in linear time with a combining function for equal keys. ;The precondition (input list is descending) is not checked. $let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2 fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "5:b5:ba")] valid (fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")]) == True valid (fromDescListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == FalsevO(n)K. Build a map from an ascending list of distinct elements in linear time.  The precondition is not checked. fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] valid (fromDistinctAscList [(3,"b"), (5,"a")]) == True valid (fromDistinctAscList [(3,"b"), (5,"a"), (5,"b")]) == FalsewO(n)K. Build a map from a descending list of distinct elements in linear time.  The precondition is not checked. fromDistinctDescList [(5,"a"), (3,"b")] == fromList [(3, "b"), (5, "a")] valid (fromDistinctDescList [(5,"a"), (3,"b")]) == True valid (fromDistinctDescList [(5,"a"), (3,"b"), (3,"a")]) == FalseA<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ _`abcdefghijklmnopqrstuvw  !"#$)*+456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwA<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^ _`abcdefghijklmnopqrstuvw@(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportableSafez  !"#$)*+456789:;<=>?@ABCDEFGHIJKLMNOPQRST_`abcdefghijklmnopqrstuvwz<=>?@ABCDEFGHOPNQRST_efgbhijk !"#$l)mno*+prtvqsuw `acd45;I67JKLM89:(c) David Feuer 2016 BSD-stylelibraries@haskell.org provisionalportableSafe /0BDERUVWXYZ[\]^WZ[\XY]^UV@(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportableSafexO(log n) . Same as K, but the value being inserted to the map is evaluated to WHNF beforehand.!For example, to update a counter: insertWith' (+) k 1 myO(log n) . Same as K, but the value being inserted to the map is evaluated to WHNF beforehand.zO(log n) . Same as K, but the value being inserted to the map is evaluated to WHNF beforehand.{O(n)s. Fold the values in the map using the given right-associative binary operator. This function is an equivalent of ( and is present for compatibility only.|O(n)|. Fold the keys and values in the map using the given right-associative binary operator. This function is an equivalent of ( and is present for compatibility only.xyz{|      !"#$%&'()*+,-./0123456789:;xyz{|xyz{|xyz{|->(c) Daan Leijen 2002 (c) Joachim Breitner 2011 BSD-stylelibraries@haskell.org provisionalportable Trustworthy /0BDR0~A set of integers.O(n+m). See .O(1). Is the set empty?O(n). 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?O(log n)2. Find largest element smaller than the given one. NlookupLT 3 (fromList [3, 5]) == Nothing lookupLT 5 (fromList [3, 5]) == Just 3O(log n)3. Find smallest element greater than the given one. NlookupGT 4 (fromList [3, 5]) == Just 5 lookupGT 5 (fromList [3, 5]) == NothingO(log n)9. Find largest element smaller or equal to the given one. ulookupLE 2 (fromList [3, 5]) == Nothing lookupLE 4 (fromList [3, 5]) == Just 3 lookupLE 5 (fromList [3, 5]) == Just 5O(log n):. Find smallest element greater or equal to the given one. ulookupGE 3 (fromList [3, 5]) == Just 3 lookupGE 4 (fromList [3, 5]) == Just 5 lookupGE 6 (fromList [3, 5]) == NothingO(1). The empty set.O(1). A set of one element. O(min(n,W))G. Add a value to the set. There is no left- or right bias for IntSets. O(min(n,W))V. 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)8. Is this a proper subset? (ie. a subset but not equal).O(n+m). Is this a subset? (s1  s2) tells whether s1 is a subset of s2.O(n)2. Filter all elements that satisfy some predicate.O(n)0. 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 K but also returns whether the pivot element was found in the original set. O(min(n,W))R. Retrieves the maximal key of the set, and the set stripped of that element, or  if passed an empty set. O(min(n,W))R. Retrieves the minimal key of the set, and the set stripped of that element, or  if passed an empty set. O(min(n,W))&. Delete and find the minimal element. 0deleteFindMin set = (findMin set, deleteMin set) O(min(n,W))&. Delete and find the maximal element. 0deleteFindMax set = (findMax set, deleteMax set) O(min(n,W))!. The minimal element of the set. O(min(n,W)). The maximal element of a set. O(min(n,W))G. Delete the minimal element. Returns an empty set if the set is empty.=Note that this is a change of behaviour for consistency with &0  versions prior to 0.5 threw an error if the ~ was already empty. O(min(n,W))G. Delete the maximal element. Returns an empty set if the set is empty.=Note that this is a change of behaviour for consistency with &0  versions prior to 0.5 threw an error if the ~ was already empty. O(n*min(n,W)).  f s! is the set obtained by applying f to each element of s.KIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f yO(n)u. Fold the elements in the set using the given right-associative binary operator. This function is an equivalent of ( and is present for compatibility only.CPlease note that fold will be deprecated in the future and removed.O(n)]. Fold the elements in the set using the given right-associative binary operator, such that  f z ==  f z . . For example,  toAscList set = foldr (:) [] setO(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)\. Fold the elements in the set using the given left-associative binary operator, such that  f z ==  f z . . For example, (toDescList set = foldl (flip (:)) [] setO(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n). An alias of D. The elements of a set in ascending order. Subject to list fusion.O(n)@. Convert the set to a list of elements. Subject to list fusion.O(n)L. Convert the set to an ascending list of elements. Subject to list fusion.O(n)L. Convert the set to a descending list of elements. Subject to list fusion. O(n*min(n,W))'. Create a set from a list of integers.O(n)3. 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 hanging6 tree is shown otherwise a rotated tree is shown. If wide is !, an extra wide version is shown.O(1). Decompose a set into pieces based on the structure of the underlying tree. This function is useful for consuming a set in parallel.No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first submap less than all elements in the second, and so on). Examples: \splitRoot (fromList [1..120]) == [fromList [1..63],fromList [64..120]] splitRoot empty == []-Note that the current implementation does not return more than two subsets, but you should not depend on this behaviour because it can change in the future without notice. Also, the current version does not continue splitting all the way to individual singleton sets -- it stops at some point.u!"#}$%&~'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd8}~'()EFJMp!"#}$%&~'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd9 >(c) Daan Leijen 2002 (c) Joachim Breitner 2011 BSD-stylelibraries@haskell.org provisionalportableSafe1}~1~}.@(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportable Trustworthy /0BDRTjA map of integers to values a. O(min(n,W))". Find the value at a key. Calls # when the element can not be found. gfromList [(5,'a'), (3,'b')] ! 1 Error: element not in the map fromList [(5,'a'), (3,'b')] ! 5 == 'a'Same as .O(1). Is the map empty? VData.IntMap.null (empty) == True Data.IntMap.null (singleton 1 'a') == FalseO(n) . Number of elements in the map. size empty == 0 size (singleton 1 'a') == 1 size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3 O(min(n,W))!. Is the key a member of the map? ^member 5 (fromList [(5,'a'), (3,'b')]) == True member 1 (fromList [(5,'a'), (3,'b')]) == False O(min(n,W))%. Is the key not a member of the map? dnotMember 5 (fromList [(5,'a'), (3,'b')]) == False notMember 1 (fromList [(5,'a'), (3,'b')]) == True O(min(n,W))1. Lookup the value at a key in the map. See also /. O(min(n,W)). The expression ( def k map) returns the value at key k or returns def, when the key is not an element of the map. ufindWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x' findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'O(log n)^. Find largest key smaller than the given one and return the corresponding (key, value) pair. mlookupLT 3 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLT 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')O(log n)_. Find smallest key greater than the given one and return the corresponding (key, value) pair. mlookupGT 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGT 5 (fromList [(3,'a'), (5,'b')]) == NothingO(log n)e. Find largest key smaller or equal to the given one and return the corresponding (key, value) pair. lookupLE 2 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLE 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupLE 5 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')O(log n)f. Find smallest key greater or equal to the given one and return the corresponding (key, value) pair. lookupGE 3 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupGE 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGE 6 (fromList [(3,'a'), (5,'b')]) == NothingO(1). The empty map. )empty == fromList [] size empty == 0O(1). A map of one element. Isingleton 1 'a' == fromList [(1, 'a')] size (singleton 1 'a') == 1 O(min(n,W)). Insert a new key/value pair in the map. If the key is already present in the map, the associated value is replaced with the supplied value, i.e.  is equivalent to  . insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')] insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')] insert 5 'x' empty == singleton 5 'x' O(min(n,W))%. Insert with a combining function.  f key value mp) will insert the pair (key, value) into mpU if key does not exist in the map. If the key does exist, the function will insert f new_value old_value. insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")] insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWith (++) 5 "xxx" empty == singleton 5 "xxx" O(min(n,W))%. Insert with a combining function.  f key value mp) will insert the pair (key, value) into mpU if key does not exist in the map. If the key does exist, the function will insert f key new_value old_value. ]let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")] insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWithKey f 5 "xxx" empty == singleton 5 "xxx" O(min(n,W)). The expression ( f k x map2) is a pair where the first element is equal to ( k map$) and the second element equal to ( f k x map). let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")]) insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "xxx")]) insertLookupWithKey f 5 "xxx" empty == (Nothing, singleton 5 "xxx")This is how to define  insertLookup using insertLookupWithKey: let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")]) insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "x")]) O(min(n,W))r. Delete a key and its value from the map. When the key is not a member of the map, the original map is returned. delete 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" delete 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] delete 5 empty == empty O(min(n,W))k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned. adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjust ("new " ++) 7 empty == empty O(min(n,W))k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned.  let f key x = (show key) ++ ":new " ++ x adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjustWithKey f 7 empty == empty O(min(n,W)). The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. let f x = if x == "a" then Just "new a" else Nothing update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" O(min(n,W)). The expression ( f k map) updates the value x at k (if it is in the map). If (f k x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. 0let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" O(min(n,W))n. Lookup and update. The function returns original value, if it is updated. This is different behavior than 0>. Returns the original key value if the map entry is deleted. flet f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:new a")]) updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a")]) updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a") O(min(n,W)). The expression ( f k map) alters the value x at k, or absence thereof. 8 can be used to insert, delete, or update a value in an . In short :  k ( f k m) = f ( k m).O(log n). The expression ( f k map) alters the value x at k, or absence thereof. B can be used to inspect, insert, delete, or update a value in an . In short :  k  $  f k m = f ( k m).Example: interactiveAlter :: Int -> IntMap String -> IO (IntMap String) interactiveAlter k m = alterF f k m where f Nothing -> do putStrLn $ show k ++ " was not found in the map. Would you like to add it?" getUserResponse1 :: IO (Maybe String) f (Just old) -> do putStrLn "The key is currently bound to " ++ show old ++ ". Would you like to change or delete it?" getUserresponse2 :: IO (Maybe String) i is the most general operation for working with an individual key that may or may not be in a given map.Note:  is a flipped version of the at combinator from $%.The union of a list of maps. 9unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "b"), (5, "a"), (7, "C")] unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])] == fromList [(3, "B3"), (5, "A3"), (7, "C")]8The union of a list of maps, with a combining operation. unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]O(n+m)m. The (left-biased) union of two maps. It prefers the first map when duplicate keys are encountered, i.e. ( ==  ). punion (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "a"), (7, "C")]O(n+m)&. The union with a combining function. zunionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]O(n+m)&. The union with a combining function. let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]O(n+m).. Difference between two maps (based on keys). ]difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"O(n+m)'. Difference with a combining function. let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")]) == singleton 3 "b:B"O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")]) == singleton 3 "3:b|B".Remove all the keys in a given set from a map. m  s =  (k _ -> k `1' s) m O(n+m)=. The (left-biased) intersection of two maps (based on keys). _intersection (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "a"O(n+m)0. The restriction of a map to the keys in a set. m  s =  (k _ -> k `1( s) m O(n+m)-. The intersection with a combining function. iintersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"O(n+m)-. The intersection with a combining function. let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"O(n+m):. A high-performance universal combining function. Using \, all combining functions can be defined without any loss of efficiency (with exception of ,  and ,, where sharing of some nodes is lost with ).6Please make sure you know what is going on when using f, otherwise you can be surprised by unexpected code growth or even corruption of the data structure.When U is given three arguments, it is inlined to the call site. You should therefore use P only to define your custom combining functions. For example, you could define ,  and  as myUnionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) id id m1 m2 myDifferenceWithKey f m1 m2 = mergeWithKey f id (const empty) m1 m2 myIntersectionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) (const empty) (const empty) m1 m2 When calling  combine only1 only2, a function combining two s is created, such thatXif a key is present in both maps, it is passed with both corresponding values to the combinet function. Depending on the result, the key is either present in the result with specified value, or is left out;>a nonempty subtree present only in the first map is passed to only1* and the output is added to the result;?a nonempty subtree present only in the second map is passed to only2* and the output is added to the result.The only1 and only2 methods Mmust return a map with a subset (possibly empty) of the keys of the given mapC. The values can be modified arbitrarily. Most common variants of only1 and only2 are  and  , but for example  f or  f could be used for any f. O(min(n,W))&. Update the value at the minimal key. updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")] updateMinWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" O(min(n,W))&. Update the value at the maximal key. updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")] updateMaxWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" O(min(n,W))_. Retrieves the maximal (key,value) pair of the map, and the map stripped of that element, or  if passed an empty map. omaxViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((5,"a"), singleton 3 "b") maxViewWithKey empty == Nothing O(min(n,W))_. Retrieves the minimal (key,value) pair of the map, and the map stripped of that element, or  if passed an empty map. ominViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((3,"b"), singleton 5 "a") minViewWithKey empty == Nothing O(min(n,W))&. Update the value at the maximal key. updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")] updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" O(min(n,W))&. Update the value at the minimal key. updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")] updateMin (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a" O(min(n,W))R. Retrieves the maximal key of the map, and the map stripped of that element, or  if passed an empty map. O(min(n,W))R. Retrieves the minimal key of the map, and the map stripped of that element, or  if passed an empty map. O(min(n,W))&. Delete and find the maximal element. O(min(n,W))&. Delete and find the minimal element. O(min(n,W)). The minimal key of the map. O(min(n,W)). The maximal key of the map. O(min(n,W))C. Delete the minimal key. Returns an empty map if the map is empty.=Note that this is a change of behaviour for consistency with !0  versions prior to 0.5 threw an error if the  was already empty. O(min(n,W))C. Delete the maximal key. Returns an empty map if the map is empty.=Note that this is a change of behaviour for consistency with !0  versions prior to 0.5 threw an error if the  was already empty.O(n+m)F. Is this a proper submap? (ie. a submap but not equal). Defined as ( =  (==)).O(n+m)J. Is this a proper submap? (ie. a submap but not equal). The expression ( f m1 m2 ) returns  when m1 and m2 are not equal, all keys in m1 are in m2 , and when f returns [ when applied to their respective values. For example, the following expressions are all : isProperSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)]) isProperSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])But the following are all : isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)]) isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)]) isProperSubmapOfBy (<) (fromList [(1,1)]) (fromList [(1,1),(2,2)])O(n+m)!. Is this a submap? Defined as ( =  (==)).O(n+m). The expression ( f m1 m2 ) returns  if all keys in m1 are in m2 , and when f returns [ when applied to their respective values. For example, the following expressions are all : isSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)]) isSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)]) isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])But the following are all : isSubmapOfBy (==) (fromList [(1,2)]) (fromList [(1,1),(2,2)]) isSubmapOfBy (<) (fromList [(1,1)]) (fromList [(1,1),(2,2)]) isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])O(n),. Map a function over all values in the map. Mmap (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]O(n),. Map a function over all values in the map. tlet f key x = (show key) ++ ":" ++ x mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]O(n).  f s ==    $  ((k, v) -> (,) k  $ f k v) (  m)* That is, behaves exactly like a regular Y except that the traversing function also has access to the key associated with a value. traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(1, 'a'), (5, 'e')]) == Just (fromList [(1, 'b'), (5, 'f')]) traverseWithKey (\k v -> if odd k then Just (succ v) else Nothing) (fromList [(2, 'c')]) == NothingO(n). The function N threads an accumulating argument through the map in ascending order of keys. let f a b = (a ++ b, b ++ "X") mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])O(n). The function N threads an accumulating argument through the map in ascending order of keys. let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X") mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])eO(n). The function eN threads an accumulating argument through the map in ascending order of keys.O(n). The function  mapAccumRO threads an accumulating argument through the map in descending order of keys. O(n*min(n,W)).  f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the greatest of the original keys is retained. mapKeys (+ 1) (fromList [(5,"a"), (3,"b")]) == fromList [(4, "b"), (6, "a")] mapKeys (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "c" mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "c" O(n*min(n,W)).  c f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if fr maps two or more distinct keys to the same new key. In this case the associated values will be combined using c. mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab" mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab" O(n*min(n,W)).  f s ==  f s, but works only when f2 is strictly monotonic. That is, for any values x and y, if x < y then f x < f y.  The precondition is not checked. Semi-formally, we have: ~and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapKeysMonotonic f s == mapKeys f s where ls = keys sThis means that fm maps distinct original keys to distinct resulting keys. This function has slightly better performance than . _mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")]) == fromList [(6, "b"), (10, "a")]O(n)0. Filter all values that satisfy some predicate. filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b" filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty filter (< "a") (fromList [(5,"a"), (3,"b")]) == emptyO(n)5. Filter all keys/values that satisfy some predicate. NfilterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"O(n). Partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also .  partition (> "a") (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a") partition (< "x") (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty) partition (> "x") (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])O(n). Partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also . 9partitionWithKey (\ k _ -> k > 3) (fromList [(5,"a"), (3,"b")]) == (singleton 5 "a", singleton 3 "b") partitionWithKey (\ k _ -> k < 7) (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty) partitionWithKey (\ k _ -> k > 7) (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])O(n). Map values and collect the  results. tlet f x = if x == "a" then Just "new a" else Nothing mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"O(n)". Map keys/values and collect the  results. let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"O(n). Map values and separate the  and  results. 5let f a = if a < "c" then Left a else Right a mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")]) mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])O(n)#. Map keys/values and separate the  and  results. Olet f k a = if k < 5 then Left (k * 2) else Right (a ++ a) mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")]) mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")]) O(min(n,W)). The expression ( k map ) is a pair  (map1,map2) where all keys in map1 are lower than k and all keys in map2 larger than k. Any key equal to k is found in neither map1 nor map2. ksplit 2 (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3,"b"), (5,"a")]) split 3 (fromList [(5,"a"), (3,"b")]) == (empty, singleton 5 "a") split 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a") split 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", empty) split 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], empty) O(min(n,W)) . Performs a G but also returns whether the pivot key was found in the original map. splitLookup 2 (fromList [(5,"a"), (3,"b")]) == (empty, Nothing, fromList [(3,"b"), (5,"a")]) splitLookup 3 (fromList [(5,"a"), (3,"b")]) == (empty, Just "b", singleton 5 "a") splitLookup 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Nothing, singleton 5 "a") splitLookup 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Just "a", empty) splitLookup 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], Nothing, empty)O(n)[. Fold the values in the map using the given right-associative binary operator, such that  f z ==  f z . . For example, elems map = foldr (:) [] map Mlet f a len = len + (length a) foldr f 0 (fromList [(5,"a"), (3,"bbb")]) == 4O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)Z. Fold the values in the map using the given left-associative binary operator, such that  f z ==  f z . . For example, %elems = reverse . foldl (flip (:)) [] Mlet f len a = len + (length a) foldl f 0 (fromList [(5,"a"), (3,"bbb")]) == 4O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)e. Fold the keys and values in the map using the given right-associative binary operator, such that  f z ==  ( f) z .  . For example, 0keys map = foldrWithKey (\k x ks -> k:ks) [] map let f k a result = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")" foldrWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (5:a)(3:b)"O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)d. Fold the keys and values in the map using the given left-associative binary operator, such that  f z ==  (\z' (kx, x) -> f z' kx x) z .  . For example, 2keys = reverse . foldlWithKey (\ks k x -> k:ks) [] let f result k a = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")" foldlWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (3:b)(5:a)"O(n). A strict version of . Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.O(n)G. Fold the keys and values in the map using the given monoid, such that  f = ) .  f*This can be an asymptotically faster than  or  for some monoids.O(n)`. Return all elements of the map in the ascending order of their keys. Subject to list fusion. Belems (fromList [(5,"a"), (3,"b")]) == ["b","a"] elems empty == []O(n)I. Return all keys of the map in ascending order. Subject to list fusion. <keys (fromList [(5,"a"), (3,"b")]) == [3,5] keys empty == []O(n). An alias for  Y. Returns all key/value pairs in the map in ascending key order. Subject to list fusion. Massocs (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] assocs empty == [] O(n*min(n,W))!. The set of all keys of the map. fkeysSet (fromList [(5,"a"), (3,"b")]) == Data.IntSet.fromList [3,5] keysSet empty == Data.IntSet.empty O(n)W. Build a map from a set of keys and a function which for each key computes its value. fromSet (\k -> replicate k 'a') (Data.IntSet.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")] fromSet undefined Data.IntSet.empty == empty O(n)H. Convert the map to a list of key/value pairs. Subject to list fusion. MtoList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] toList empty == [] O(n)n. Convert the map to a list of key/value pairs where the keys are in ascending order. Subject to list fusion. =toAscList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")] O(n)o. Convert the map to a list of key/value pairs where the keys are in descending order. Subject to list fusion. >toDescList (fromList [(5,"a"), (3,"b")]) == [(5,"a"), (3,"b")]  O(n*min(n,W)).. Create a map from a list of key/value pairs. fromList [] == empty fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")] fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")] O(n*min(n,W))R. Create a map from a list of key/value pairs with a combining function. See also . fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "ab"), (5, "cba")] fromListWith (++) [] == empty O(n*min(n,W))e. Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'. let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "3:a|b"), (5, "5:c|5:b|a")] fromListWithKey f [] == emptyO(n)T. Build a map from a list of key/value pairs where the keys are in ascending order. fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]O(n). Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. :The precondition (input list is ascending) is not checked. RfromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]O(n). Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. :The precondition (input list is ascending) is not checked. let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "5:b|a")]O(n)g. Build a map from a list of key/value pairs where the keys are in ascending order and all distinct. CThe precondition (input list is strictly ascending) is not checked. GfromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]O(1). Decompose a map into pieces based on the structure of the underlying tree. This function is useful for consuming a map in parallel.No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first submap less than all elements in the second, and so on). Examples: {splitRoot (fromList (zip [1..6::Int] ['a'..])) == [fromList [(1,'a'),(2,'b'),(3,'c')],fromList [(4,'d'),(5,'e'),(6,'f')]] splitRoot empty == []Note that the current implementation does not return more than two submaps, but you should not depend on this behaviour because it can change in the future without notice.O(n)\. Show the tree that implements the map. The tree is shown in a compressed, hanging format.O(n). The expression ( hang wide map.) shows the tree that implements the map. If hang is , a hanging6 tree is shown otherwise a rotated tree is shown. If wide is !, an extra wide version is shown.fghijklmnopqrstuvwxe    yz {|}~t}ijklmnopv     }~fghijklmnopqrstuvwxe    yz {|}~9 @(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportableSafej}     j}      @(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportable Trustworthy, O(min(n,W)). The expression ( def k map) returns the value at key k or returns def, when the key is not an element of the map. ufindWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x' findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'O(1). A map of one element. Isingleton 1 'a' == fromList [(1, 'a')] size (singleton 1 'a') == 1 O(min(n,W)). Insert a new key/value pair in the map. If the key is already present in the map, the associated value is replaced with the supplied value, i.e.  is equivalent to  . insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')] insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')] insert 5 'x' empty == singleton 5 'x' O(min(n,W))%. Insert with a combining function.  f key value mp) will insert the pair (key, value) into mpU if key does not exist in the map. If the key does exist, the function will insert f new_value old_value. insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")] insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWith (++) 5 "xxx" empty == singleton 5 "xxx" O(min(n,W))%. Insert with a combining function.  f key value mp) will insert the pair (key, value) into mpU if key does not exist in the map. If the key does exist, the function will insert f key new_value old_value. ]let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")] insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")] insertWithKey f 5 "xxx" empty == singleton 5 "xxx"7If the key exists in the map, this function is lazy in x but strict in the result of f. O(min(n,W)). The expression ( f k x map2) is a pair where the first element is equal to ( k map$) and the second element equal to ( f k x map). let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")]) insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "xxx")]) insertLookupWithKey f 5 "xxx" empty == (Nothing, singleton 5 "xxx")This is how to define  insertLookup using insertLookupWithKey: let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")]) insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "x")]) O(min(n,W))k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned. adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjust ("new " ++) 7 empty == empty O(min(n,W))k. Adjust a value at a specific key. When the key is not a member of the map, the original map is returned.  let f key x = (show key) ++ ":new " ++ x adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] adjustWithKey f 7 empty == empty O(min(n,W)). The expression ( f k map) updates the value x at k (if it is in the map). If (f x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. let f x = if x == "a" then Just "new a" else Nothing update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")] update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"  O(min(n,W)). The expression ( f k map) updates the value x at k (if it is in the map). If (f k x) is %, the element is deleted. If it is ( y ), the key k is bound to the new value y. 0let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")] updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")] updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"! O(min(n,W))n. Lookup and update. The function returns original value, if it is updated. This is different behavior than 0>. Returns the original key value if the map entry is deleted. flet f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:new a")]) updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a")]) updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")" O(min(n,W)). The expression (" f k map) alters the value x at k, or absence thereof. "8 can be used to insert, delete, or update a value in an . In short :  k (" f k m) = f ( k m).#O(log n). The expression (# f k map) alters the value x at k, or absence thereof. #B can be used to inspect, insert, delete, or update a value in an . In short :  k  $ # f k m = f ( k m).Example: interactiveAlter :: Int -> IntMap String -> IO (IntMap String) interactiveAlter k m = alterF f k m where f Nothing -> do putStrLn $ show k ++ " was not found in the map. Would you like to add it?" getUserResponse1 :: IO (Maybe String) f (Just old) -> do putStrLn "The key is currently bound to " ++ show old ++ ". Would you like to change or delete it?" getUserresponse2 :: IO (Maybe String) #i is the most general operation for working with an individual key that may or may not be in a given map.$8The union of a list of maps, with a combining operation. unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])] == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]%O(n+m)&. The union with a combining function. zunionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]&O(n+m)&. The union with a combining function. let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]'O(n+m)'. Difference with a combining function. let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")]) == singleton 3 "b:B"(O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns D, the element is discarded (proper set difference). If it returns ( y+), the element is updated with a new value y. let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")]) == singleton 3 "3:b|B")O(n+m)-. The intersection with a combining function. iintersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"*O(n+m)-. The intersection with a combining function. let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"+O(n+m):. A high-performance universal combining function. Using +\, all combining functions can be defined without any loss of efficiency (with exception of ,  and ,, where sharing of some nodes is lost with +).6Please make sure you know what is going on when using +f, otherwise you can be surprised by unexpected code growth or even corruption of the data structure.When +U is given three arguments, it is inlined to the call site. You should therefore use +P only to define your custom combining functions. For example, you could define &, ( and * as myUnionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) id id m1 m2 myDifferenceWithKey f m1 m2 = mergeWithKey f id (const empty) m1 m2 myIntersectionWithKey f m1 m2 = mergeWithKey (\k x1 x2 -> Just (f k x1 x2)) (const empty) (const empty) m1 m2 When calling + combine only1 only2, a function combining two s is created, such thatXif a key is present in both maps, it is passed with both corresponding values to the combinet function. Depending on the result, the key is either present in the result with specified value, or is left out;>a nonempty subtree present only in the first map is passed to only1* and the output is added to the result;?a nonempty subtree present only in the second map is passed to only2* and the output is added to the result.The only1 and only2 methods Mmust return a map with a subset (possibly empty) of the keys of the given mapD. The values can be modified arbitrarily. Most common variants of only1 and only2 are  and  , but for example 0 f or  f could be used for any f.,O(log n)&. Update the value at the minimal key. updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")] updateMinWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"-O(log n)&. Update the value at the maximal key. updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")] updateMaxWithKey (\ _ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b".O(log n)&. Update the value at the maximal key. updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")] updateMax (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"/O(log n)&. Update the value at the minimal key. updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")] updateMin (\ _ -> Nothing) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"0O(n),. Map a function over all values in the map. Mmap (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]1O(n),. Map a function over all values in the map. tlet f key x = (show key) ++ ":" ++ x mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]2O(n). The function 2N threads an accumulating argument through the map in ascending order of keys. let f a b = (a ++ b, b ++ "X") mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])3O(n). The function 3N threads an accumulating argument through the map in ascending order of keys. let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X") mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])O(n). The function  threads an accumulating argument through the map in ascending order of keys. Strict in the accumulating argument and the both elements of the result of the function.4O(n). The function  mapAccumRO threads an accumulating argument through the map in descending order of keys.5 O(n*log n). 5 c f s! is the map obtained by applying f to each key of s.)The size of the result may be smaller if fr maps two or more distinct keys to the same new key. In this case the associated values will be combined using c. mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab" mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"6O(n). Map values and collect the  results. tlet f x = if x == "a" then Just "new a" else Nothing mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"7O(n)". Map keys/values and collect the  results. let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"8O(n). Map values and separate the  and  results. 5let f a = if a < "c" then Left a else Right a mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")]) mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])9O(n)#. Map keys/values and separate the  and  results. Olet f k a = if k < 5 then Left (k * 2) else Right (a ++ a) mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")]) mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")]) == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")]):O(n)W. Build a map from a set of keys and a function which for each key computes its value. fromSet (\k -> replicate k 'a') (Data.IntSet.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")] fromSet undefined Data.IntSet.empty == empty; O(n*min(n,W)).. Create a map from a list of key/value pairs. fromList [] == empty fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")] fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]< O(n*min(n,W))R. Create a map from a list of key/value pairs with a combining function. See also ?. fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")] fromListWith (++) [] == empty= O(n*min(n,W))e. Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'. fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")] fromListWith (++) [] == empty>O(n)T. Build a map from a list of key/value pairs where the keys are in ascending order. fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")] fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]?O(n). Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. :The precondition (input list is ascending) is not checked. RfromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]@O(n). Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. :The precondition (input list is ascending) is not checked. RfromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]AO(n)g. Build a map from a list of key/value pairs where the keys are in ascending order and all distinct. CThe precondition (input list is strictly ascending) is not checked. GfromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]/ !"#$%&'()*+,-./0123456789:;<=>?@Aj}    !"#$%&'()*+,-./0123456789:;<=>?@Aj} !"#%&$'()*+012345: ;<=  >?@A6789/.,-- !"#$%&'()*+,-./0123456789:;<=>?@A @(c) Daan Leijen 2002 (c) Andriy Palamarchuk 2008 BSD-stylelibraries@haskell.org provisionalportableSafeB Deprecated.! As of version 0.5, replaced by  2.O(log n) . Same as \, but the result of the combining function is evaluated to WHNF before inserted to the map.C Deprecated.! As of version 0.5, replaced by  3.O(log n) . Same as \, but the result of the combining function is evaluated to WHNF before inserted to the map.D Deprecated. As of version 0.5, replaced by .O(n)t. Fold the values in the map using the given right-associative binary operator. This function is an equivalent of ' and is present for compatibility only.E Deprecated. As of version 0.5, replaced by .O(n)}. Fold the keys and values in the map using the given right-associative binary operator. This function is an equivalent of ' and is present for compatibility only.BCDEn}     BCDEBCDEBCDE "(c) The University of Glasgow 2002/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable TrustworthyOTF,An edge from the first vertex to the second.GThe bounds of a I.HYAdjacency list representation of a graph, mapping each vertex to its list of successors.I.Table indexed by a contiguous set of vertices.J$Abstract representation of vertices.KStrongly connected component.L*A single vertex that is not in any cycle.M.A maximal set of mutually reachable vertices.N8The vertices of a list of strongly connected components.O/The vertices of a strongly connected component.PMThe strongly connected components of a directed graph, topologically sorted.QkThe strongly connected components of a directed graph, topologically sorted. The function is the same as Pn, except that all the information about each node retained. This interface is used when you expect to apply K to (some of) the result of K8, so you don't want to lose the dependency information.RAll vertices of a graph.SAll edges of a graph.T#Build a graph from a list of edges.U*The graph obtained by reversing all edges.V-A table of the count of edges from each node.W-A table of the count of edges into each node.X Identical to Ym, except that the return value does not include the function which maps keys to vertices. This version of Y is for backwards compatibility.YBuild a graph from a list of nodes uniquely identified by keys, with a list of keys of nodes this node should have edges to. The out-list may contain keys that don't correspond to nodes of the graph; they are ignored.ZA spanning forest of the graph, obtained from a depth-first search of the graph starting from each vertex in an unspecified order.[A spanning forest of the part of the graph reachable from the listed vertices, obtained from a depth-first search of the graph starting at each of the listed vertices in order.\bA topological sort of the graph. The order is partially specified by the condition that a vertex i precedes j whenever j is reachable from i but not vice versa.]The connected components of a graph. Two vertices are connected if there is a path between them, traversing edges in either direction.^-The strongly connected components of a graph._1A list of vertices reachable from a given vertex.`.Is the second vertex reachable from the first?a~The biconnected components of a graph. An undirected graph is biconnected if the deletion of any vertex leaves it connected.8FGHIJKLMNOPThe graph: a list of nodes uniquely identified by keys, with a list of keys of nodes this node has edges to. The out-list may contain keys that don't correspond to nodes of the graph; such edges are ignored.QThe graph: a list of nodes uniquely identified by keys, with a list of keys of nodes this node has edges to. The out-list may contain keys that don't correspond to nodes of the graph; such edges are ignored.Topologically sortedRSTUVWXYZ[\]^_`abcdefFGHIJKLMNOPQRSTUVWXYZ[\]^_`aPQKLMONHIGFJYXTURSVW[Z\]^a_`4FGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef&456789:;<=>"?@ABCDEFGHIJKLM)NOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq=>rs tuvwxyz5{|}~/]^KJS#####!##4#5#6#/#7#8##9#:#;#<#=#>#"#2#3##?#####0###Z#[#\###^##]#B#C#D#E#######d#e#F##G###H####I#######################+#,######J##_#`#a#K#######L####### # ##N### # # ###O#####S###P#Q#R#T#U#####V#W#X##b#c#g#h#i#f**>*"*2*3******0*******************************L****** **S***T*U*****V*W)--1-4-5-6-7-8-9-:-;-<-=->-"-?-F-G-H-I-@-A-J-K-X-Y-e-d-b-c-B-C-D-E-L-)--N---O-P-Q-R-S-T-V-g-h-f. ..4.5.6.7.8./..9.:.;.<.=.>.".2.3..?.....0...F..G...H....I...........e.d.c.b.B.C.D.E.....L....... . .J..K......X...N... . . ...O.....P.Q.R.S...T...V.f.g.h > " 2 3 0 L         S   T   V   )  ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a_bcdefghijklmnopqrst+uvwxyz{|}~_b_b_b_b______P_p6      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~_b#_b##__###_b_bde#__#_#Y#######################g#h#i#j##l###########n#o#r#s#t##u#v#w##x#y#z#{#|#}#~#####################__d*****-------h-i-----j-------n-o---{-|--}-~------r-z--------------------------------- .......h.i.....j. .... .. .n.o...r.z. .........{.|..}.~...............            ! " # $ % & ' ( ) * + , - . / 01)containers-0.5.8.2-EOATkdwBZp4JPFKPrC5nJ7Data.Set Data.Sequence Data.TreeData.Map.Lazy.Merge Data.Map.LazyData.Map.StrictData.Map.Strict.MergeData.Map Data.IntSetData.IntMap.LazyData.IntMap.Strict Data.IntMap Data.GraphData.Utils.StrictPairData.Utils.StrictMaybeData.Utils.StrictFold Data.Listfoldl'Data.Utils.PtrEqualityData.Utils.BitUtilData.Utils.BitQueue Data.Set.BasePreludefoldrfoldltakedrop takeWhile dropWhileData.Sequence.Base Control.Monad replicateMMapinsert Data.Map.Base Control.LensAtSet notMember'member'foldData.Map.Strict.InternalmergemergeAData.IntSet.BaseData.IntMap.BaselookupupdateLookupWithKeyIntSet insertWith insertWithKey\\nullsizemember notMemberlookupLTlookupGTlookupLElookupGEempty singletondeleteisProperSubsetOf isSubsetOffindMinfindMax deleteMin deleteMaxunionsunion difference intersectionfilter partitionmap mapMonotonicfoldr'elemstoList toAscList toDescListfromList fromAscList fromDescListfromDistinctAscListfromDistinctDescListsplit splitMember findIndex lookupIndexelemAtdeleteAtsplitAttakeWhileAntitonedropWhileAntitone spanAntitone deleteFindMin deleteFindMaxminViewmaxView splitRootshowTree showTreeWithvalidViewREmptyR:>ViewLEmptyL:<Seq intersperse replicate replicateA cycleTaking<||>><unfoldrunfoldliterateNlengthviewlviewrscanlscanl1scanrscanr1index!?updateadjustadjust'insertAt mapWithIndexfoldMapWithIndextraverseWithIndex fromFunction fromArraychunksOftailsinitsfoldlWithIndexfoldrWithIndex takeWhileL takeWhileR dropWhileL dropWhileRspanlspanrbreaklbreakr elemIndexL elemIndexR elemIndicesL elemIndicesR findIndexL findIndexR findIndicesL findIndicesRreversezipzipWithzip3zipWith3zip4zipWith4sortsortBy unstableSortunstableSortByForestTreeNode rootLabel subForestdrawTree drawForestflattenlevelsfoldTree unfoldTree unfoldForest unfoldTreeM unfoldForestMunfoldTreeM_BFunfoldForestM_BF $fNFDataTree$fFoldableTree$fTraversableTree $fMonadTree$fApplicativeTree $fFunctorTree$fEqTree $fReadTree $fShowTree $fDataTree $fGenericTree$fGeneric1TreeSimpleWhenMatched WhenMatchedSimpleWhenMissing WhenMissing!findWithDefaultinsertLookupWithKey adjustWithKey updateWithKeyalteralterFupdateAt updateMin updateMaxupdateMinWithKeyupdateMaxWithKeyminViewWithKeymaxViewWithKey unionsWith unionWith unionWithKey withoutKeysdifferenceWithdifferenceWithKey restrictKeysintersectionWithintersectionWithKeymapWhenMissinglmapWhenMissingcontramapFirstWhenMatchedcontramapSecondWhenMatchedrunWhenMatchedrunWhenMissingmapWhenMatchedzipWithMatchedzipWithAMatchedzipWithMaybeMatchedzipWithMaybeAMatched dropMissingpreserveMissing mapMissingmapMaybeMissing filterMissingfilterAMissingtraverseMissingtraverseMaybeMissing mergeWithKey isSubmapOf isSubmapOfByisProperSubmapOfisProperSubmapOfBy filterWithKeypartitionWithKeymapMaybemapMaybeWithKeytraverseMaybeWithKey mapEithermapEitherWithKey mapWithKeytraverseWithKeymapAccummapAccumWithKeymapAccumRWithKeymapKeys mapKeysWithmapKeysMonotonic foldrWithKey foldrWithKey' foldlWithKey foldlWithKey'foldMapWithKeykeysassocskeysSetfromSet fromListWithfromListWithKeyfromAscListWithfromDescListWithfromAscListWithKeyfromDescListWithKey splitLookup insertWith'insertWithKey'insertLookupWithKey' foldWithKeyKeyIntMapEdgeBoundsGraphTableVertexSCC AcyclicSCC CyclicSCC flattenSCCs flattenSCCstronglyConnCompstronglyConnCompRverticesedgesbuildG transposeG outdegreeindegreegraphFromEdges'graphFromEdgesdffdfstopSort componentsscc reachablepathbcc$fApplicativeSetM $fFunctorSetM $fMonadSetM $fFunctorSCC $fNFDataSCC StrictPair:*:toPairMaybeSNothingSJustSmaybeStoMaybetoMaybeS$fFoldableMaybeS foldlStrictptrEqhetPtrEqhighestBitMaskshiftRLshiftLLwordSizeemptyQBsnocQBbuildQunconsQtoListQBitQueueBQ BitQueueBBQB shiftQBR1nullQ$fShowBitQueueBbaseGHC.ErrerrorGHC.BaseNothingghc-prim GHC.TypesTrueSizeBinTipfromListConstr setDataTypeinsertR isSubsetOfXfoldrFBfoldlFB combineEqsplitSlink insertMax insertMingluedeltaratiobalanceLbalanceRbin showsTree showsTreeHangshowWide showsBarsnodewithBar withEmptyorderedbalanced validsize $fNFDataSet $fReadSet $fShowSet$fOrdSet$fEqSet $fIsListSet $fDataSet $fFoldableSet$fSemigroupSet $fMonoidSetPQueueStateDigit23RigidThin:|>:<|Empty aptyMiddlemapMulFTfmap FingerTreerigidify rigidifyRightthin digitToTree'applicativeTree Applicative<*>pure cycleNTimes Data.FoldablefoldMapData.TraversabletraverseGHC.ArrArrayuncheckedSplitAt tailsTree initsTreeFoldable fmapReversesplitMapzipWith' fromList2unrollPQtoPQmergePQPQLNil:& ListFinalLFinalLConsSplitDelDigFullDig DefectDigDelFullDefectDelTreeFullTree DefectTree InsNodeDig InsRightDig InsDigNode InsLeftDigInsInsOneInsTwoPlace ViewRTree SnocRTree EmptyRTree ViewLTree ConsLTree EmptyLTreerunStateElemgetElemNode2Node3DigitOneTwoThreeFourEmptyTSingleDeepDigit12One12Two12EmptyThSingleThDeepTh Rigidified RigidEmptyRigidOneRigidTwo RigidThree RigidFullForceBox MaybeForce maybeRwhnfSized<>mseq$!?fmapSeq traverseFTEap2FTap3FTdigit12ToDigitsquashLsquashR mapMulNodethin12 emptyConstr consConstr seqDataTypedeeppullLpullR digitToTreenode2'node3'deep'node2node3 nodeToDigit execState cycleNMiddleconsTreecons'snoc' consTree'snocTree snocTree' appendTree0 addDigits0 appendTree1 addDigits1 appendTree2 addDigits2 appendTree3 addDigits3 appendTree4 addDigits4 viewLTree viewRTree lookupTree lookupNode lookupDigit updateTree updateNode updateDigit adjustTree adjustNode adjustDigitinsTreeinsNode insLeftDigit insRightDigitdelTreeEdelNodeE delLeftDigitEdelRightDigitEdelTreedelNodedelRebuildRightDigitdelRebuildLeftDigitdelRebuildLeftSidedelRebuildRightSidedelRebuildMiddledelDigit takeTreeE takeTreeN takeMiddleN takeMiddleE takePrefixE takePrefixN takeSuffixE takeSuffixN takeTreeER takeTreeNR takeMiddleNR takeMiddleER takeSuffixER takeSuffixNR takePrefixER takePrefixNR splitTreeE splitTreeN splitMiddleN splitMiddleE splitPrefixE splitPrefixN splitSuffixE splitSuffixN tailsDigit initsDigit tailsNode initsNode listToMaybe'fmapReverseTree reverseDigit reverseNode getSingleton zipWith3' $fIsStringSeq $fIsListSeq$fTraversableViewR$fFoldableViewR$fFunctorViewR$fTraversableViewL$fFoldableViewL$fFunctorViewL$fApplicativeState $fMonadState$fFunctorState $fNFDataElem$fTraversableElem$fFoldableElem $fFunctorElem $fSizedElem $fSizedNode $fNFDataNode$fTraversableNode $fFunctorNode$fFoldableNode $fSizedDigit $fNFDataDigit$fTraversableDigit$fFunctorDigit$fFoldableDigit$fNFDataFingerTree$fTraversableFingerTree$fFunctorFingerTree$fFoldableFingerTree$fSizedFingerTree $fDataSeq$fSemigroupSeq $fMonoidSeq $fReadSeq $fShowSeq$fOrdSeq$fEqSeq$fAlternativeSeq$fMonadPlusSeq$fApplicativeSeq $fMonadSeq $fNFDataSeq$fTraversableSeq $fFoldableSeq $fFunctorSeq$fSizedForceBox$fMaybeForceForceBox$fMaybeForceNode$fMaybeForceElemfmapTreedraw unfoldForestQJustfindconst insertWithRinsertWithKeyRData.Functor.IdentityIdentityData.Functor.ConstConstmapGentlyWhenMissingmapGentlyWhenMatchedboolMaybeidFalsefilterWithKeyA Data.EitherLeftRight mapAccumL Data.Tupleuncurry$fMonadWhenMatched$fApplicativeWhenMatched$fMonadWhenMissing$fApplicativeWhenMissing StrictTriple matchedKeymissingSubtree missingKeyAltered AltSmaller AltBiggerAltAdjAltSame TraceResult AreWeStrictStrictLazy mapDataType atKeyImpl lookupTrace insertAlong deleteAlongbogus replaceAlong atKeyIdentity atKeyPlainfirstsubmap'link2balance $fShowMap $fReadMap $fNFDataMap $fFoldableMap$fTraversableMap $fFunctorMap$fOrdMap$fEqMap $fIsListMap$fCategoryTYPEWhenMatched$fFunctorWhenMatched$fCategoryTYPEWhenMissing$fFunctorWhenMissing $fDataMap$fSemigroupMap $fMonoidMap runIdentityGHC.Primseq forceMaybeStackPushNadaBitMapMaskPrefixNat natFromInt intFromNatintSetDataType unsafeFindMin unsafeFindMaxinsertBMdeleteBM subsetCmpequalnequalshowBin showsBitMap showBitMaptip suffixBitMask prefixBitMaskprefixOfsuffixOfbitmapOfSuffixbitmapOfzeronomatchmatchmaskmaskWshorter branchMaskindexOfTheOnlyBit lowestBitMaskrevNat lowestBitSet highestBitSet foldlBits foldl'Bits foldrBits foldr'Bitsbitcount$fNFDataIntSet $fReadIntSet $fShowIntSet $fOrdIntSet $fEqIntSet$fIsListIntSet $fDataIntSet$fSemigroupIntSet$fMonoidIntSetintMapDataType mergeWithKey' submapCmp binCheckLeft binCheckRight $fReadIntMap $fShowIntMap$fFunctorIntMap $fOrdIntMap $fEqIntMap$fIsListIntMap $fDataIntMap$fNFDataIntMap$fTraversableIntMap$fFoldableIntMap$fSemigroupIntMap$fMonoidIntMapSetMrunSetMmapTreverseEgenerateprunechopruncontainsinclude preorder' preorderF' preorderFtabulatepreArr postorder postorderFpostOrd undirecteddo_labelbicompscollect