úÎ!SNM      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLSafe.H Hordered-containersA newtype to hand a M9 instance on. The phantom first parameter tells whether N_ will prefer the indices of its first or second argument if there are shared elements in both.ordered-containers6A 0-based index, much like the indices used by lists' O= operation. All indices are with respect to insertion order.Pordered-containers An internal index used to track ordering only -- its magnitude doesn't matter. If you manage to see this documentation, the library author has made a mistake!QRSPTUVWXYSafe24=?5Á ordered-containersDWhen a key occurs in both maps, prefer the value from the first map.See asymptotics of . ordered-containersDWhen a key occurs in both maps, prefer the value from the first map.See asymptotics of  . ordered-containersTake the union. The first ¸ 's argument's indices are lower than the second. If a key appears in both maps, the first argument's index takes precedence, and the supplied function is used to combine the values. O(r*log(r)) where r is the size of the resultordered-containersTake the union. The first ¹ 's argument's indices are lower than the second. If a key appears in both maps, the second argument's index takes precedence, and the supplied function is used to combine the values. O(r*log(r)) where r is the size of the resultordered-containersm \\ n$ deletes all the keys that exist in n from m O(m*log(n)) where m$ is the size of the smaller map and n is the size of the larger map.ordered-containersÁIf a key appears multiple times, the first occurrence is used for ordering and the last occurrence is used for its value. The library author welcomes comments on whether this default is sane.ordered-containers filter f m) contains exactly the key-value pairs of m that satisfy f), without changing the order they appearordered-containersIntersection. (The /\Z is intended to look a bit like the standard mathematical notation for set intersection.)See asymptotics of .ordered-containersIntersection. (The /\Z is intended to look a bit like the standard mathematical notation for set intersection.)See asymptotics of .ordered-containers!Take the intersection. The first 0 's argument's indices are used for the result.O(m*log(n/(m+1)) + r*log(r)) where m! is the size of the smaller map, n% is the size of the larger map, and r is the size of the result.ordered-containers7Return key-value pairs in the order they were inserted. ordered-containers2Return key-value pairs in order of increasing key.!ordered-containers7Values are traversed in insertion order, not key order. O(n*log(n)) where n is the size of the map."ordered-containers›Empty maps and map union. When combining two sets that share elements, the indices of the right argument are preferred, and the values are combined with N.See the asymptotics of .#ordered-containersšEmpty maps and map union. When combining two sets that share elements, the indices of the left argument are preferred, and the values are combined with N.See the asymptotics of  .+ordered-containers6Values are produced in insertion order, not key order.!  !  55 5 5 6 6Safe2=?L¼ 2ordered-containers O(m*log(n)+n), where m$ is the size of the smaller set and n is the size of the larger set.3ordered-containers O(m*log(n)+n), where m$ is the size of the smaller set and n is the size of the larger set.4ordered-containersSet difference: r \\ s deletes all the values in s from r. The order of r is unchanged. O(m*log(n)) where m$ is the size of the smaller set and n is the size of the larger set.5ordered-containersIntersection. (/\S is meant to look a bit like the standard mathematical notation for intersection.)O(m*log(n/(m+1)) + r*log(r)), where m" is the size of the smaller set, n! the size of the larger set, and r the size of the result.6ordered-containers flip (5)See asymptotics of 5.>ordered-containersDIf a value occurs multiple times, only the first occurrence is used.Bordered-containers(Returns values in ascending order. (Use Z% to return them in insertion order.)Cordered-containersxEmpty sets and set union. When combining two sets that share elements, the indices of the right argument are preferred.See the asymptotics of (2).Dordered-containerswEmpty sets and set union. When combining two sets that share elements, the indices of the left argument are preferred.See the asymptotics of (3).Lordered-containers6Values appear in insertion order, not ascending order.-./0123456789:;<=>?@AB-7=./1023?:89<;456@A>B.5/505152636[      !"#$%&'()*+,-./0     !#%&'(12345678978:7;<=>?@ABCD7EFG/ordered-containers-0.2.1-4E6f4mJhnZrENy77WtJqSRData.Map.OrderedData.Set.Ordered Data.Map.UtilRLBiasunbiasedIndexOMap<||<>||><>||<> unionWithL unionWithR\\empty singletonfromListnullsizemember notMemberlookupfilterdelete/\||/\intersectionWith findIndexelemAtassocs toAscList$fTraversableOMap $fMonoidBias $fMonoidBias0$fSemigroupBias$fSemigroupBias0 $fDataOMap $fReadOMap $fShowOMap $fOrdOMap$fEqOMap$fFoldableOMap $fFunctorOMapOSet $fDataOSet $fReadOSet $fShowOSet $fOrdOSet$fEqOSet$fFoldableOSetbaseGHC.BaseMonoidmappendGHC.List!!TagIndexPreference nextLowerTag nextHigherTagminTagmaxTag showsPrecList readsPrecList Data.FoldabletoList