JV7ߍ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~              Given a type with an associated : instance, generates a representation that will cause its TMap 0 implementation to be essentially equivalent to Data.Map. KGiven the name of a type constructor, automatically generates an efficient  instance.  Warning$: Generalized tries do not work for infinitely complicated types, for example, a ] type-system construction of the natural numbers. In these cases, a context reduction stack 6 overflow will occur at compile time when you use the TKey instance for that type.       444   '    !"#$%&'()*+,-./01)23456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\[\[\]^_`abcde  RThe empty map. A map with a single element. Is the map empty? &Lookup the value at a key in the map. 4The function will return the corresponding value as (f value), or g if the key isn't in the map. The expression ( def k map) returns the value at key k or returns default value def ! when the key is not in the map. Find the value at a key. Calls h$ when the element can not be found. 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). ijWProjects information out of, and modifies or deletes, an individual association pair, / alternating over all associations in the map. If $assocs m == [(k1, a1), ..., (kn, an)], then  H extract f m = let upd k (x, maybeA) = (x, alter (const maybeA) k m) in 9 (upd k1 <$> f kn an) <|> ... <|> (upd kn <$> f kn an) 9This generalizes a large number of operations, including  J minViewWithKey == getFirst (extract (\ k a -> return ((k, a), Nothing))) Y updateMaxWithKey f m == maybe m snd (getLast (extract (\ k a -> return ((), f k a)) m))  In addition,  S getFirst (extract (\ k a -> if p k a then return ((k, a), Nothing) else mzero) m) Kfinds and removes the first association pair satisfying the predicate |p|.  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefR !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefR<cde !"#$%012345;=>6789:+,-./*&'()MNfO\^`]_abVWTURSPQXYZ[ABCDIJEFGH?@KLP !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef&ghijklmnopqrstuvwxyz{|}~'ghijklmnopqrstuvwxyz{|}~'gjhiklnmopqrstuwvxyz{|}~&ghijklmnopqrstuvwxyz{|}~k  !" # $%&&''()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwx)03*BGMHhfjy=z8{|STUV[\QR_}~not+uvwN "       B                   , /  u+,*/<{|dbkBDJPm   ,/*<:;dbk ot  [\u ! "#$B%&'()*+,+-./01 TrieMap-1.0.0Data.TrieMap.RepresentationData.TrieMap.ModifiersData.TrieMap.Representation.THData.TrieMap.Class Data.TrieMap Data.TrieSetData.TrieMap.SizedData.TrieMap.RepData.TrieMap.Rep.THData.TrieMap.Rep.InstancesData.TrieMap.ApplicativeData.TrieMap.TrieKeyData.TrieMap.RadixTrieData.TrieMap.IntMapData.TrieMap.OrdMapData.TrieMap.ReverseMapData.TrieMap.ProdMapData.TrieMap.UnionMapData.TrieMap.UnitMapData.TrieMap.KeyData.TrieMap.Class.InstancesReprReptoRepfromRepunOrdOrdOrderedgetRevRevgetKeyKey genOrdReprgenReprTrieKeyTrieMapTKeyTSetTMapgetTMapempty singletonnulllookupfindWithDefault!alterinsert insertWith insertWithKeydeleteadjust adjustWithKeyupdate updateWithKeyfold foldWithKey foldrWithKey foldlWithKeytraverseWithKeymap mapWithKeymapKeys mapKeysWithmapKeysMonotonicunion unionWith unionWithKeyunionMaybeWithunionMaybeWithKeysymmetricDifference intersectionintersectionWithintersectionWithKeyintersectionMaybeWithintersectionMaybeWithKey difference\\differenceWithdifferenceWithKeyminViewmaxViewfindMinfindMax deleteMin deleteMax updateMin updateMaxupdateMinWithKeyupdateMaxWithKey deleteFindMin deleteFindMaxminViewWithKeymaxViewWithKeyelemskeysassocs mapEithermapEitherWithKeymapMaybemapMaybeWithKey partitionpartitionWithKeyfilter filterWithKeysplit splitLookup isSubmapOf isSubmapOfByfromList fromAscList fromListWithfromAscListWithfromListWithKeyfromAscListWithKeyfromDistinctAscListsizemember notMemberkeysSet splitMember mapMonotonicfoldrfoldltoList toAscList isSubsetOfisProperSubsetOfElemgetElemSizedelemSizeReprTRepTtoRepTfromRepT toRepTMap fromRepTMap genTupleReprPairSumWordsWWords'toSigned fromSignedtoList64toBlockReprMRepresentationFromRepToRep FromRepCase ToRepCasebase GHC.ClassesordRepr tyVarBndrType decsForRepr decomposeconReprtypeRepr recursiveReprunitprodconifyDualrunDualIdunId.:<.><.:>emptyM singletonMnullMsizeMlookupMalterM alterLookupMtraverseWithKeyM foldWithKeyM foldlWithKeyM mapMaybeM mapEitherM splitLookupMunionMisectMdiffMextractM isSubmapM fromListM fromAscListMfromDistAscListMIndexPosAssocAscLEq ExtractFuncDiffFunc IsectFunc UnionFuncSplitMap EitherMaponIndexAonKeyAonValAonValueA onUnboxed guardNullMsidesboth mapWithKeyMmapMassocsMinsertMinsertWithKeyM fromListM' unionMaybe isectMaybe diffMaybesubMaybeaboutMEdgeEdge'MEdge'edgeSizecatconsedge singleMaybecompact alterLookupE traverseEextractEfoldEfoldlE mapMaybeE mapEitherEunionEisectEdiffE isSubmapE splitLookupENatPrefixMaskSize complement32 natFromInt intFromNatshiftRLsingletonMaybe alterLookupextractmaskzeronomatchmatchzeroNmaskWshorter branchMaskhighestBitMaskjoinbinOrdMapisSubmaphedgeUnionWithKeyfilterGtfilterLttrim trimLookupLoisecthedgeDiffWithKey joinMaybe insertMax insertMinmergegluedeltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRreverse unreversebreakFst singletonL singletonRonPair partEithersUnitgetUnit Data.MaybeJustNothingGHC.ErrerrorextractA