Îõ³h&.g#,–      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”• Safe-InferredÛ£–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖרÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖרÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•– Trustworthy1<ÁÂÃÌÙÚÜêø¸2— generic-trieThe —, class provides generic implementations of „Ü. This class is separate due to its implementation varying for different kinds of metadata. generic-trieäTrieKey operations on Generic representations used to provide the default implementations of tries.  generic-trie=Mapping of generic representation of keys to trie structures. generic-trie The default implementation of a  is   wrapped in a ®. This wrapping is due to the  ‹ being a non-empty trie allowing all the of the "emptiness" to be represented at the top level for any given generically implemented key. generic-trieTries indexed by $ will be represented as an ordinary ˜- and the keys will be compared based on the ß instance for k. generic-trie9Show a representation of the internal structure of a trie generic-trieA map from keys of type k, to values of type a. generic-trie'Types that may be used as the key of a .For dataÁ declarations, the instance can be automatically derived from a ™ instance. generic-trie1Type of the representation of tries for this key. generic-trieConstruct an empty trie generic-trieTest for an empty trie generic-trieLookup element from trie generic-trieInsert element into trie generic-trieDelete element from trie generic-trie.Insert, modify, or remove an element in a trie generic-trie'Construct a trie holding a single value generic-trie/Apply a function to all values stored in a trie  generic-trie$Traverse the values stored in a trie! generic-trie$Apply a function to the values of a 5 and keep the elements of the trie that result in a ° value." generic-trie2Fold a trie with a function of both key and value.# generic-trie6Traverse a trie with a function of both key and value.$ generic-trieëTraverse a trie with a function of both key and value, and keep the elements of the trie that result in a ° value.- generic-trie(Transform a trie to an association list.. generic-trieGeneric implementation of ú%. This is the default implementation./ generic-trieGeneric implementation of %. This is the default implementation.0 generic-trieGeneric implementation of  singleton%. This is the default implementation.1 generic-trieGeneric implementation of empty%. This is the default implementation.2 generic-trieGeneric implementation of insert%. This is the default implementation.3 generic-trieGeneric implementation of delete%. This is the default implementation.4 generic-trieGeneric implementation of alter%. This is the default implementation.5 generic-trieGeneric implementation of %. This is the default implementation.6 generic-trieGeneric implementation of  %. This is the default implementation.7 generic-trieGeneric implementation of %. This is the default implementation.8 generic-trieGeneric implementation of mapMaybe%. This is the default implementation.9 generic-trieGeneric implementation of  foldWithKey%. This is the default implementation.: generic-trieGeneric implementation of traverseWithKey%. This is the default implementation.; generic-trieGeneric implementation of traverseMaybeWithKey%. This is the default implementation.š generic-trieGeneric implementation of  mergeWithKey%. This is the default implementation.< generic-trieÅTries of types without constructors are represented by an empty type.= generic-trieÇTries of constructors without fields are represented by a single value.> generic-trie:Generic sums are represented by up to a pair of sub-tries.? generic-trie3Generic products are represented by tries of tries.@ generic-trieÂGeneric metadata is skipped in trie representation and operations.F generic-trie:Generic fields are represented by tries of the field type.R generic-trie tries are implemented with ˜Ø, this is intended for cases where it is better for some reason to force the use of a ˜0 than to use the generically derived structure.S generic-trie© tries are implemented with ›.T generic-trie· tries are implemented with ›.U generic-trieœ tries are implemented with ˜.V generic-trie­ tries are implemented with ˜.W generic-trie¬ tries are implemented with ›.< ,)*+('& !"#$%-./0123456789:;< !"#$%-/5672.348019:; ,)*+('&Safe"® v generic-trie/Construct a trie from a list of key-value pairsw generic-trieðConstruct a trie from a list of key-value pairs. The given function is used to combine values at the same key.x generic-trie Version of w: which is strict in the result of the combining function.y generic-trieConstruct an empty triez generic-trieTest for an empty trie{ generic-trieLookup an element from a trie| generic-trie!Lens for the value at a given key} generic-trieInsert an element into a trie~ generic-trieDelete an element from a trie generic-trie'Construct a trie holding a single value€ generic-trieÝApply a function to the values of a trie and keep the elements of the trie that result in a ° value. generic-trießPerform an action for each value in a trie and keep the elements of the trie that result in a ° value.‚ generic-trie5Filter the values of a trie with the given predicate.ƒ generic-trie Version of ‚' where the predicate also gets the key.„ generic-trie(Fold a trie with a function of the value… generic-trie1Fold a trie with a function of both key and value† generic-trie5Traverse a trie with a function of both key and value‡ generic-trie¶Alter the value at the given key location. The parameter function takes the value stored at the given key, if one exists, and should return a value to insert at that location, or ¯ to delete from that location.ˆ generic-trie¬Insert a value at the given key. The combining function is used when a value is already stored at that key. The new value is the first argument to the combining function.‰ generic-trie Version of ˆ9 that is strict in the result of combining two elements.Š generic-trieReturns § when the % has a value stored at the given key.‹ generic-trieReturns ¦ when the % has a value stored at the given key.Œ generic-trieLeft-biased union of two tries generic-trieÃUnion of two tries with function used to merge overlapping elementsŽ generic-trieÒUnion of two tries with function used to merge overlapping elements along with key generic-trie%Left-biased intersection of two tries generic-trieâIntersection of two tries parameterized by a combining function of the values at overlapping keys‘ generic-trieîIntersection of two tries parameterized by a combining function of the key and the values at overlapping keys’ generic-trie4Remove the keys of the right trie from the left trie“ generic-trieParameterized ’( using a custom merge function. Return °. to change the value stored in left trie, or ¯ to remove from the left trie.” generic-trie“* where function also has access to the key• generic-trieÉMap a function over a trie filtering out elements where function returns ¯'-vwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•'yvwx‡}ˆ‰~|Š‹z{…„-†•€‚ƒŒŽ‘’“”      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œž™Ÿ…™Ÿ ™¡¢™£¤™£¥™š¦™š§™š¨™©ª™©«™¬­™¬®™¬¯™¬°™¬±™¬²™¬³™¬´™¬µ™¬¶™¬·™¬¸œ¹ºœ¹»œ¹¼™½¾™½¿™½À™½Á™½Â™½Ã™½Ä™½Å™½Æ™½Ç™½È™½É™½Ê™½Ë™½Ì™½Í™½Î™½Ï™½Ð™©Ñ™©Ò™©Ó™©Ô™©Õ™©Ö™©×™©Ø™©Ù™©Ú™©Û™©Ü™šÝ™šÞ™šß™šà™šá™šâ™šã™äå™äæ™äç™äè™äé™äê™äë™ä윹휹ðœ¹ñœ¹òœ¹óœ¹ô™õö™õ÷™õø™©ù™©ú™½û™½ü™½ý™½þ™½ÿ™½€™½™½‚™½ƒ™½„™½…™½†™½‡™½ˆ™½‰™©Š™©‹™©Œ™©™©Ž™©™‘™’™“™”™•–™•—™š˜™š™™šš™š›™šœ™š™žŸ™ž ™ž¡™ž¢™ž}™ž£™ž¤™ž¥™ž¦™ž§™ž¨™ž©™žª™«¬™«­™«®™«¯™«°™š±™š²™š³™š´™šµ™š¶œ·¸œ·¹œ·º™š»œ·¼œ·½œ·¾œ·¿ÀÁ™ÃÄ™ÃÅ™ÃÆœ·Çœ·Èœ·Éœ·Ê™©Ëœ·Ìœ·Í™ÎÏ™ÎЙÎÑ™¡Ò™¡Ó™¡Ô™¡Õ™¡Ö™¡×™¡Ø™¡Ù™¡Ú™¡Û™¡Ü™¡Ý™Þß™àá™Þâ™Þ㙞䙞噞晞癞虞陞Ꙟ뙞ì™íî™íï™íð™íñ™òó™òô™Îõ™õö™õ÷™øù™©ú™©û™©ü™©ý™©þ™©ÿ™€™™‚™ƒ™„™Ÿ…™Ÿ†™Ÿ‡™Ÿˆ™Ÿ‰™ŸŠ™Ÿ‹™ŸŒ™Ÿ™ŸŽ™Ÿ™Ÿ™Ÿ‘™Ÿ’™Ÿ“™Ÿ”™Ÿ•™Ÿ~™Ÿ–™Ÿ—™Ÿ˜™Ÿ™™Ÿš™Ÿ›™Ÿœ™Ÿ™Ÿž™Ÿ ™¡¢™££™£¤™ä¥™š¦™š§™š¨™š©™šª™š«™š¬™š­™®¯™®°™®±œ¹²œ¹³œ¹´µ¶·¸™¹º»¶¼½À¾¿À)generic-trie-0.3.2-GrcXsblDeL5ESphade9wpsData.GenericTrie.InternalData.GenericTriePreludeGTrieKey gtrieLookup gtrieInsertgtrieSingleton gtrieDelete gtrieAltergtrieMap gtrieTraversegmapMaybeWithKey gfoldWithKeygtraverseWithKeygtraverseMaybeWithKey gmergeWithKeyGTrieTrieRepDefaultOrdKey getOrdKey ShowTrieKey trieShowsPrecTrieMkTrieTrieKeyTrieRep trieEmptytrieNull trieLookup trieInsert trieDelete trieAlter trieSingletontrieMap trieTraversetrieMapMaybeWithKeytrieFoldWithKeytrieTraverseWithKeytrieTraverseMaybeWithKeytrieMergeWithKeyUTrieKTriePTrieSTrieLSTrieRSTrieBMTrietoList genericLookupgenericTrieNullgenericSingleton genericEmpty genericInsert genericDelete genericAltergenericTrieMapgenericTrieTraversegenericTrieShowsPrecgenericMapMaybeWithKeygenericFoldWithKeygenericTraverseWithKeygenericTraverseMaybeWithKey $fGTrieKeyV1 $fGTrieKeyU1 $fGTrieKey:+: $fGTrieKey:*: $fGTrieKeyM1$fFunctorGTrie$fTraversableTrie$fFoldableTrie $fFunctorTrie $fShowTrie $fGTrieKeyK1 $fTrieKey[]$fTrieKey(,,,,)$fTrieKey(,,,) $fTrieKey(,,) $fTrieKey(,)$fTrieKeyEither$fTrieKeyMaybe$fTrieKeyOrdering $fTrieKeyBool $fTrieKey() $fTrieKeyVoid$fTrieKeyOrdKey $fTrieKeyChar $fTrieKeyWord$fTrieKeyNatural$fTrieKeyInteger $fTrieKeyInt $fShowGTrie$fGTrieKeyShowV1$fGTrieKeyShowU1$fGTrieKeyShow:+:$fGTrieKeyShow:*:$fGTrieKeyShowM1$fGTrieKeyShowM10$fGTrieKeyShowK1$fShowTrieKey[]$fShowTrieKey(,,,,)$fShowTrieKey(,,,)$fShowTrieKey(,,)$fShowTrieKey(,)$fShowTrieKeyEither$fShowTrieKeyMaybe$fShowTrieKeyOrdering$fShowTrieKeyBool$fShowTrieKey()$fShowTrieKeyVoid$fShowTrieKeyOrdKey$fShowTrieKeyChar$fShowTrieKeyWord$fShowTrieKeyNatural$fShowTrieKeyInteger$fShowTrieKeyInt$fGTrieKeyShowM11 $fReadOrdKey $fShowOrdKey $fEqOrdKey $fOrdOrdKeyfromList fromListWith fromListWith'emptynulllookupatinsertdelete singletonmapMaybeWithKeytraverseMaybeWithKeyfilter filterWithKeyfold foldWithKeytraverseWithKeyalter insertWith insertWith'member notMemberunion unionWith unionWithKey intersectionintersectionWithintersectionWithKey differencedifferenceWithdifferenceWithKeymapMaybebaseGHC.Base++ghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Real fromIntegral realToFracGHC.EnumBoundedmaxBoundminBoundEnumsuccpredenumFromThenTo enumFromTo enumFromThenenumFromfromEnumtoEnum GHC.ClassesEq==/= GHC.FloatFloatingtanhtansqrtsinhsinpilogBaselogexpcoshcosatanhatanasinhasinacosh**acos Fractionalrecip fromRational/IntegralremquotRemquotmoddivMod toIntegerdivMonad>>>>=returnFunctorfmap<$GHC.NumNumsignumabs*+negate fromInteger-Ord<<=>maxmincompare>=GHC.ReadRead readsPrecreadListReal toRational RealFloat significand scaleFloatisNegativeZeroisNaN isInfiniteisIEEEisDenormalized floatRange floatRadix floatDigitsexponent encodeFloatatan2 decodeFloatRealFractruncateroundproperFractionceilingfloorGHC.ShowShowshowListshow showsPrecControl.Monad.Fail MonadFailfail Applicative<*>pure*><*liftA2 Data.FoldableFoldablefoldMapsumproductminimummaximumfoldr1foldl1elemfoldrlengthfoldlData.Traversable TraversabletraversesequencemapM sequenceA Semigroup<>Monoidmconcatmemptymappend GHC.TypesBoolFalseTrueStringCharDoubleFloatInt ghc-bignumGHC.Num.IntegerInteger GHC.MaybeMaybeNothingJustOrderingGTLTEQRationalIOWord Data.EitherEitherRightLeft writeFilereadLnreadIOreadFileputStrLnputStrputCharinteractgetLine getContentsgetChar appendFileGHC.IO.ExceptionioErrorGHC.IOFilePathIOError userError sequence_ornotElemmapM_ concatMapconcatanyandall Data.OldListwordsunwordsunlineslines Text.Readreadsreadeither readParenlexText.ParserCombinators.ReadPReadSoddlcmgcdeven^^^ShowSshows showString showParenshowCharzipWith3zipWithzip3unzip3unzip takeWhiletaketailsplitAtspanscanr1scanrscanl1scanlreverse replicaterepeatlastiterateinithead dropWhiledropcyclebreak!! Data.Maybemaybe Data.Functor<$>uncurrycurrysubtractuntilidflipconstasTypeOf=<<.$!GHC.Err undefinederrorWithoutStackTraceerror&&not|| GTrieKeyShowcontainers-0.6.5.1Data.Map.InternalMap GHC.GenericsGenericgenericMergeWithKeyData.IntMap.InternalIntMapGHC.Num.NaturalNatural