eA      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~5  7                           !"#$%&!"#$%&$%&!"#!"#"#$%&%&'('('(()*+)*+)**+,-,-,-- ./01234567 ./01234567 ./012/0123454567 !"#$%&'( )*+,-./01234 ./01234567 345./01276 56789:;<=>?@A 56789:;<=>?@A 5676789:9:;<=<=>?@A98BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a9bcdefghijklmnopqrstuvwx98BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`a9bcdefghijklmnopqrstuvwx98BCDEFGHIJKLMNOPQRSTUVBCDEFGHIJKLMNOPQRSTUVWXYZZ[\]^_`a9bcdefghijklmnopqrstuvwx/yz{|}~:;:;:;%  '()*+:;%;:   '(+)*1<=>?2<=>?1<=>? ,-<=>? =<?>,-     4 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHI JKL!"MN#OP$QRST%UV& WXYZ[\]^_`a'bc()de*fgfgfgf+hi,jklm-no. pqrstuvwxyz{|}~/0123@ABCDEF 789@ABCDEF DEFBCA@798@ABCCDEFEF45GKGiven the name of a type constructor, automatically generates an efficient 3 instance. Warning$: Generalized tries do not work for infinitely complicated types,A for example, a type-system construction of the natural numbers. ` In these cases, a context reduction stack overflow will occur at compile time when you use the TKey instance for that type. GGG^HIJKLMNWProjects information out of, and modifies or deletes, an individual association pair, / alternating over all associations in the map.  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|. Generalization of  for  functors. Like , but does not modify the map. Generalization of  for  functors. OPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ k aC returns the index, key, and value of the immediate predecessor of k in the map. 5 The predecessor is the element with the largest key < k. ZADHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ZADMlJKLHIOPQRSTUVNabcdekmnfghij\]^_`[WXYZ}~qrstyzuvwxop{|XHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&'B'B& 6 7 8 9 : : ; < < = = > > ? @ A B ? C C D E E F G H I J K L M N OPPQRSTUVWXYZ[\]^_`abcdefghijklmnoppqqrstuvwxyz{|}~t{~uv    ?@A>>;<<9::IJK               ! " # $ % & ' ( )*+,-../0123455677899:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxwyz{z|u}~NMwzvwvwz{yuz|        O""##$$$$%%&&&&&&&&& &!&"''))**+#+#,,,$,--.............%.&.'............(.).*.+../,/,0-0.0/000102032423536373894:444;4<4<=>?@AABBCDEFGHIJKLMNOPQRST TrieMap-0.7.2Data.TrieMap.MultiRecData.TrieMap.RegularData.TrieMap.ModifiersData.TrieMap.RepresentationData.TrieMap.ClassData.TrieMap.Representation.TH Data.TrieMap Data.TrieSetData.TrieMap.MultiRec.SizedData.TrieMap.MultiRec.BaseData.TrieMap.MultiRec.EqData.TrieMap.Regular.BaseData.TrieMap.CPairData.TrieMap.SizedData.TrieMap.Regular.SizedData.TrieMap.Regular.EqData.TrieMap.Regular.OrdData.TrieMap.MultiRec.OrdData.TrieMap.RepData.TrieMap.Rep.THData.TrieMap.Rep.InstancesData.TrieMap.Regular.RepData.TrieMap.ApplicativeData.TrieMap.TrieKeyData.TrieMap.OrdMapData.TrieMap.Regular.ClassData.TrieMap.MultiRec.ClassData.TrieMap.MultiRec.FamMapData.TrieMap.RadixTrieData.TrieMap.IntMapData.TrieMap.ProdMapData.TrieMap.UnionMapData.TrieMap.UnitMapData.TrieMap.MultiRec.ConstMapData.TrieMap.MultiRec.IMapData.TrieMap.MultiRec.ProdMapData.TrieMap.MultiRec.UnionMapData.TrieMap.MultiRec.TagMapData.TrieMap.MultiRec.UnitMapData.TrieMap.MultiRec.InstancesData.TrieMap.Regular.ConstMapData.TrieMap.Regular.IdMapData.TrieMap.Regular.UnitMapData.TrieMap.Regular.ProdMapData.TrieMap.Regular.UnionMapData.TrieMap.Regular.RadixTrieData.TrieMap.Regular.RegMapData.TrieMap.Regular.CompMapData.TrieMap.Regular.InstancesData.TrieMap.Regular.THData.TrieMap.ReverseMapData.TrieMap.KeyData.TrieMap.Class.InstancesFamilyFunFunK0K0unI0I0U0:*:LR:+:ListOunRegRegoutInFixPFtofromRegularfrom'to' partEithersRevgetRevOrderedOrdunOrdEqTeqT0OrdT compareT0 ComparatorHOrdcompareHReprTtoRepTfromRepT toRepTMap fromRepTMapReprtoRepfromRepRepTRepTrieKeyTrieMapTrieKeyTTrieMapTHTrieKey HTrieKeyTHTrieMap HTrieMapTTKeyTTKeyTSetTMapgetTMapgenReprempty singletonnulllookupfindWithDefault!alterinsert insertWith insertWithKeydeleteadjust adjustWithKeyupdate updateWithKeyfold foldWithKey foldrWithKey foldlWithKeytraverseWithKeymap mapWithKeymapKeys mapKeysWithmapKeysMonotonicunion unionWith unionWithKeyunionMaybeWithunionMaybeWithKey intersectionintersectionWithintersectionWithKeyintersectionMaybeWithintersectionMaybeWithKey difference\\differenceWithdifferenceWithKeyminViewmaxViewfindMinfindMax deleteMin deleteMax updateMin updateMaxupdateMinWithKeyupdateMaxWithKey deleteFindMin deleteFindMaxminViewWithKeymaxViewWithKeyelemskeysassocs mapEithermapEitherWithKeymapMaybemapMaybeWithKey partitionpartitionWithKeyfilter filterWithKeysplit splitLookup isSubmapOf isSubmapOfByfromList fromAscList fromListWithfromAscListWithfromListWithKeyfromAscListWithKeyfromDistinctAscListsizemember notMember predecessor lookupIndexlookupWithIndex successor neighborhood predecessorAtlookupAt successorAtneighborhoodAtkeysSetsymmetricDifference splitMember mapMonotonicfoldrfoldltoList toAscList isSubsetOfisProperSubsetOfElemgetElemHSizedsizeElem breakEither multirec-0.5Generics.MultiRec.HFixhtohfromhoutHInHFixGenerics.MultiRec.BaseindexunCunTagunIIunKKUTag:>:CproofElFameqSEqSGenerics.MultiRec.Constructor conFixityconName ConstructorPrefixInfixFixityLeftAssociativeRightAssociativeNotAssociative AssociativityGenerics.MultiRec.TEqcastRefl:=:HEq0heq0heqTCPairCP pairFromCpairToCon1ston2ndcPcpFstcpSnd cpUncurrycpCurrySizedelemSizesizeK0eqTeqT'compareTHOrd0compare0hcomparegenRepT~>mkConmkVartemplate-haskellLanguage.Haskell.TH.LibconTappTLanguage.Haskell.TH.SyntaxTypeForallTVarTConTTupleTArrowTListTAppTSigTPairSumword32ixWordsWWords'toSigned fromSignedtoList64toBlockDualrunDualWMrunWMIdunIdwrite.:<.><.:>emptyMnullMsizeMlookupM lookupIxMassocAtMalterM alterLookupMtraverseWithKeyM foldWithKeyM foldlWithKeyM mapEitherM splitLookupMunionMisectMdiffMextractM isSubmapM fromListM fromAscListMfromDistAscListMRoundIndexPosAssocAscLEq ExtractFuncDiffFunc IsectFunc UnionFuncSplitMap EitherMaponIndexAonIndexonKeyonValonKeyAonValAonValueAonValue guardNullMsides mapMaybeM mapWithKeyMmapMassocsMinsertMinsertWithKeyM singletonM fromListM' unionMaybe isectMaybe diffMaybesubMaybeaboutMTipBinOrdMaplookupIxassocAtupdateAt alterLookupisSubmaphedgeUnionWithKeyfilterGtfilterLttrim trimLookupLoisecthedgeDiffWithKey joinMaybejoin insertMax insertMinmergeglueextractdeltaratiobalancerotateLrotateRsingleLsingleRdoubleLdoubleRbinemptyTnullTsizeTlookupT lookupIxTassocAtTalterT alterLookupTtraverseWithKeyT foldWithKeyT foldlWithKeyT mapEitherT splitLookupTunionTisectTdiffTextractT isSubmapT fromListT fromAscListTfromDistAscListT guardNullTassocsT singletonT mapWithKeyTaboutTempty0null0size0lookup0 lookupIx0assocAt0alter0 alterLookup0extract0traverseWithKey0 foldWithKey0 foldlWithKey0 mapEither0 splitLookup0union0isect0diff0 isSubmap0 fromList0 fromAscList0fromDistAscList0emptyHnullHsizeHlookupH lookupIxHassocAtHalterH alterLookupHtraverseWithKeyH foldWithKeyH foldlWithKeyH mapEitherH splitLookupHunionHisectHdiffHextractH isSubmapH fromListH fromAscListHfromDistAscListH guardNullHaboutH mapWithKeyHFamMappushfrom''EdgeEdge'MEdgeMEdge'Radix RadixTrieedgeSizecatconsedge singleMaybecompact alterLookupE traverseEextractEaboutEfoldEfoldlE mapEitherEunionEisectEdiffE lookupIxE isSubmapE splitLookupEassocAtENatNilWordMapMaskKeySize natFromInt intFromNatshiftRLsingletonMaybemaxViewUnsignedminViewUnsignedupdateMinWithKeyUnsignedupdateMaxWithKeyUnsignedmaskzeronomatchmatchzeroNmaskWshorter branchMaskhighestBitMaskPMapbreakFst:&:UMapKMapIMapProdMapmaxIxUnionMapTagFTagMapunTagF combineTagmapTagsizeTag restructure restructure'retagMlastIx singletonMElookupEalterE isSubEdgefilterer fromListE fromAscListERegMapCMapCompMapunAAAppAMapAppMapderiveMRMap ReverseMapreverse unreversetrvgetKey getKeyMapKeyMapReprMRepresentationFromRepToRep FromRepCase ToRepCase tyVarBndrType decsForRepr decomposeconReprtypeRepr tyVarBndrName recursiveReprunitprodconifyextractAbaseControl.Applicative AlternativeaboutaboutA findIndex