h$0.      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh Safe-Inferred9more-containersA lower bound for multimap values. By creating an instance of this class, you can use multimap operations with a custom type. An alternative could have been to use i< but that would have precluded common implementations like j.more-containersCreates a singleton collection.more-containersReturns the size of the collection. The default implementation folds over the entire structure and is O(n).more-containersChecks whether the collection is empty. The default implementation lazily folds over the structure.None35+more-containers"A group of values of a given size. more-containers9A strict implementation of a multiset. It is backed by a k and inherits several of its properties and operation's complexities. In particular, the number of elements in a multiset must not exceed maxBound :: Int. more-containersO(1)$ Checks whether a multiset is empty. more-containersO(1) Returns the total number of elements in the multiset. Note that this isn't the number of distinct elements, see   for that. more-containersO(1)9 Returns the number of distinct elements in the multiset. more-containersO(1) Returns an empty multiset.more-containersO(1)* Returns a multiset with a single element.more-containersO(1) Returns a multiset with the same element repeated. If n is zero or negative,  returns an empty multiset.more-containers O(m * log m); Builds a multiset from a map. Negative counts are ignored.more-containers O(n * log n) Builds a multiset from values.more-containers O(m * log m) Builds a multiset from a list of groups. Counts of duplicate groups are added together and elements with negative total count are omitted.more-containersO(log m)5 Checks whether the element is present at least once.more-containersO(log m)+ Checks whether the element is not present.more-containersO(log m) Returns the number of times the element is present in the multiset, or 0 if absent.more-containersO(log m) Infix version of .more-containersO(log m) Modifies the count of an element. If the resulting element's count is zero or negative, it will be removed.more-containersO(log m) Inserts an element.more-containersO(log m) Removes a single element. Does nothing if the element isn't present.more-containersO(log m), Removes all occurrences of a given element.more-containersFilters a multiset by value.more-containersFilters a multiset by group.more-containersMaps on the multiset's values.more-containersMaps on the multiset's counts. Groups with resulting non-positive counts will be removed from the final multiset.more-containersMaps on the multiset's groups. Groups with resulting non-positive counts will be removed from the final multiset. more-containersCombines two multisets, returning the max count of each element.!more-containersCombines two multisets, returning the minimum count of each element (or omitting it if the element is present in only one of the two multisets)."more-containersUnions two multisets with a generic function. The combining function will be called with a count of 0 when an element is only present in one set.#more-containersIntersects two multisets with a generic function. The combining function is guaranteed to be called only with positive counts.$more-containers O(m * log m) Returns the first set minus the second. Resulting negative counts are ignored.%more-containers O(m * log m) Checks whether the first subset is a subset of the second (potentially equal to it).&more-containers O(m * log m) Checks whether the first subset is a strict subset of the second.'more-containersO(1)5 Converts the multiset to a map of (positive) counts.(more-containersO(m) Returns the j* of all distinct elements in the multiset.)more-containersO(m) Converts the multiset to a list of values and associated counts. The groups are in undefined order; see * and + for sorted versions.*more-containers O(m * log m) Converts the multiset into a list of values and counts, from least common to most.+more-containers O(m * log m) Converts the multiset into a list of values and counts, from most common to least.,more-containersO(n) Returns the multiset's elements as a list where each element is repeated as many times as its number of occurrences. This is a synonym for l.-more-containersO(m)9 Returns a list of the distinct elements in the multiset..more-containersO(log m) Takes an element of maximum value from the multiset and the remaining multiset, or m# if the multiset was already empty./more-containersO(log m) Takes an element of minimum value from the multiset and the remaining multiset, or m# if the multiset was already empty.0more-containersO(m) Returns the multiset's elements grouped by count, most common first.2more-containers:more-containers)  !"#$%&'()*+,-./0)   %& !$"#()*+',-./0None35&&;more-containersA group of values.<more-containers7A map where the same key can be present multiple times.=more-containers O(n * log n) Builds a multimap from a list of key, value tuples. The values are in the same order as in the original list.>more-containersO(n)+ Inverts keys and values inside a multimap.?more-containersO(1)& Checks whether the multimap is empty.@more-containersO(m * C)" Returns the size of the multimap.Amore-containersO(1)5 Returns the number of distinct keys in the multimap.Bmore-containersO(1) Creates an empty multimap.Cmore-containersO(1)( Creates a multimap with a single entry.Dmore-containersO(m)4 Builds a multimap from already grouped collections.Emore-containers O(n * log n) Transforms a list of entries into a multimap, combining the values for each key into the chosen collection. The values are in the same order as in the original list.Fmore-containersO(m * C)1 Transforms a map of collections into a multimap.Gmore-containersO(log m)8 Returns the collection of values associated with a key.Hmore-containersO(log m) Infix version of G.nmore-containers O(log m * C) Returns the number of times a key is present in a multimap. The complexity of the operation depends on the complexity of the underlying collection's   operation.Imore-containersO(log m)= Checks whether a key is present at least once in a multimap.Jmore-containersO(log m)0 Checks whether a key is absent from a multimap.Kmore-containersModifies a key's collection using an arbitrary function. More specifically, this function lifts an operation over a collection of values into a multimap operation.(Sample use to filter even values from a  :  let ms = fromList [('a', 1), ('a', 2)] :: SetMultimap Char Int modifyMany (Set.filter even) 'a' ms == fromList [('a', 1)] Lmore-containersModifies a key's collection using an arbitrary function. This is the applicative version of K.Mmore-containers O(log m * C)( Prepends a value to a key's collection.Nmore-containers O(log m * C)7 Prepends a collection of values to a key's collection.Omore-containers O(log m * C)' Appends a value to a key's collection.Pmore-containers O(log m * C)6 Appends a collection of values to a key's collection.Qmore-containersO(log m)' Removes all entries for the given key.Rmore-containersO(n) Inverts keys and values inside a multimap, potentially changing the collection type.Smore-containersO(n)# Filters multimap entries by value.Tmore-containersO(m) Filters multimap groups. This enables filtering by key and collection.Umore-containersMaps over the multimap's groups. This method can be used to convert between specific multimaps, for example: let m1 = fromList [('a', 1), ('a', 1)] :: ListMultimap Char Int let m2 = mapGroups (fmap Set.fromList) m1 :: SetMultimap Char IntVmore-containersO(n) Converts a multimap into its list of entries. Note that this is different from  1 which returns the multimap's values (similar to Data.Map).Wmore-containersO(m)2 Converts a multimap into its list of collections.Xmore-containersO(1)/ Converts a multimap into a map of collections.Ymore-containersReturns the multimap's maximum key and value. The input function is guaranteed to be called with a non-empty collection.Zmore-containersReturns the multimap's minimum key and value. The input function is guaranteed to be called with a non-empty collection.[more-containersO(m) Returns a list of the multimap's keys. Each key will be repeated as many times as it is present in the multimap.\more-containersO(m)1 Returns a set of the multimap's (distinct) keys.]more-containersO(m * C) Returns a multiset of the map's keys with matching multiplicities.omore-containerspmore-containers&;?@ABCDEFGHnIJKLMNOPQRSTUVWXYZ[\]None*^more-containersA multimap with j values. This multimap implementation will automatically deduplicate values per key. For example: let mm = fromList [('a', 1), ('a', 1)] :: SetMultimap Char Int size mm == 1 -- TrueSee Data.Multimap.Set& for operations specific to this type._more-containers O(n * log n) Maps over the multimap's values. This function is useful since j is not a functor.`more-containersO(log m)$ Deletes an entry from the multimap.amore-containersO(log n) Checks whether an entry (key plus value) is a member of the multimap.bmore-containersO(log n) Checks whether an entry (key plus value) is a not member of the multimap.^_`ab^_`abNone+Ucmore-containersA multimap with s values.See Data.Multimap.Seq& for operations specific to this type.dmore-containersO(log m)8 Pops the first value associated with a key, if present.emore-containersO(log m)7 Pops the last value associated with a key, if present.cdecdeNone-pfmore-containersA multimap with list values. Note that lists do not support efficient appends or sizing, so several multimap operations will have higher complexity than for other collections. If performance is a concern, consider using a   instead.See Data.Multimap.List& for operations specific to this type.gmore-containersO(log m)! Prepends a value to a given key.hmore-containersO(log m) Extracts the first value associated with a given key, if possible.fghfghNone-&;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^cf&<;fc^BC=EDF?@AIJGHMNOPQKLUSTVWX[\]>RYZ Safe-Inferred.tuvwxyz{   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEF GHI!JKLMNOPQ&) 3RSTUVW 'XYZ [\]^_`abcdecfg` `hi jkElcmnopqrstuv.more-containers-0.2.2.2-9soZmO9s1zo6kdfymUVhH6Data.Multimap.Collection Data.Multiset Data.MultimapData.Multimap.SetData.Multimap.SeqData.Multimap.ListData.Multimap.GenericData.Collectionsize SetMultimap Data.FoldabletoList SeqMultimapPaths_more_containers Collection singletonfilternull$fCollectionSet$fCollectionSeq$fCollection[]GroupMultiset distinctSizeempty replicate fromCountMapfromList fromGroupListmember notMembercount!modifyinsertremove removeAll filterGroupsmap mapCounts mapGroupsmaxmin unionWithintersectionWith difference isSubsetOfisProperSubsetOf toCountMaptoSet toGroupListtoGrowingGroupListtoShrinkingGroupListelems distinctElemsmaxViewminView mostCommon$fIsListMultiset$fBinaryMultiset$fFoldableMultiset$fMonoidMultiset$fSemigroupMultiset $fEqMultiset $fOrdMultiset$fReadMultiset$fShowMultiset$fDataMultisetMultimapinverse fromListWithfromMapfind modifyMany modifyManyFprepend prependManyappend appendMany deleteMany inverseWithtoMap maxViewWith minViewWithkeyskeysSet keysMultisetdeletemember' notMember'popFirstpopLast ListMultimapconsunconsbaseGHC.Base Applicativecontainers-0.6.2.1Data.Set.InternalSetData.Map.InternalMap GHC.MaybeNothing$fBinaryMultimap$fDataMultimap_toMapData.Sequence.InternalSeqversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName