úÎc÷[år      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq Trustworthy-7;<=FSTV5w+rThe r, class provides generic implementations of s\. This class is separate due to its implementation varying for different kinds of metadata.dTrieKey operations on Generic representations used to provide the default implementations of tries. =Mapping of generic representation of keys to trie structures.  The default implementation of a  is   wrapped in a t. 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. Tries indexed by  $ will be represented as an ordinary u- and the keys will be compared based on the v instance for k.A map from keys of type k, to values of type a.'Types that may be used as the key of a .For dataA declarations, the instance can be automatically derived from a w instance.1Type of the representation of tries for this key.Construct an empty trieTest for an empty trieLookup element from trieInsert element into trieDelete element from trie'Construct a trie holding a single value/Apply a function to all values stored in a trie$Traverse the values stored in a trie!Show the representation of a trie$Apply a function to the values of a 5 and keep the elements of the trie that result in a x value.2Fold a trie with a function of both key and value.6Traverse a trie with a function of both key and value.!Generic implementation of y%. This is the default implementation."Generic implementation of %. This is the default implementation.#Generic implementation of  singleton%. This is the default implementation.$Generic implementation of empty%. This is the default implementation.%Generic implementation of insert%. This is the default implementation.&Generic implementation of delete%. This is the default implementation.'Generic implementation of %. This is the default implementation.(Generic implementation of %. This is the default implementation.)Generic implementation of %. This is the default implementation.*Generic implementation of mapMaybe%. This is the default implementation.+Generic implementation of  foldWithKey%. This is the default implementation.,Generic implementation of traverseWithKey%. This is the default implementation.zGeneric implementation of  mergeWithKey%. This is the default implementation.->Tries of types without constructors are represented by a unit..GTries of constructors without fields are represented by a single value./:Generic sums are represented by up to a pair of sub-tries.03Generic products are represented by tries of tries.1BGeneric metadata is skipped in trie representation and operations.?:Generic fields are represented by tries of the field type.I  tries are implemented with uX, this is intended for cases where it is better for some reason to force the use of a u0 than to use the generically derived structure.J{ tries are implemented with |.K} tries are implemented with u.L~ tries are implemented with |.4 €‚ƒ„…  !"#$%&'()*+,:   "'()%!&*#$+,  †‡rˆ  ‰Š   ‹…Œƒ€‚Ž„SafeZ· R/Construct a trie from a list of key-value pairsSpConstruct a trie from a list of key-value pairs. The given function is used to combine values at the same key.T Version of S: which is strict in the result of the combining function.UConstruct an empty trieVTest for an empty trieWLookup an element from a trieX!Lens for the value at a given keyYInsert an element into a trieZDelete an element from a trie['Construct a trie holding a single value\]Apply a function to the values of a trie and keep the elements of the trie that result in a x value.]5Filter the values of a trie with the given predicate.^ Version of ]' where the predicate also gets the key._(Fold a trie with a function of the value`1Fold a trie with a function of both key and valuea5Traverse a trie with a function of both key and valueb¶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.c¬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.d Version of c9 that is strict in the result of combining two elements.eReturns ‘ when the % has a value stored at the given key.fReturns ’ when the % has a value stored at the given key.g(Transform a trie to an association list.hLeft-biased union of two triesiCUnion of two tries with function used to merge overlapping elementsjRUnion of two tries with function used to merge overlapping elements along with keyk%Left-biased intersection of two trieslbIntersection of two tries parameterized by a combining function of the values at overlapping keysmnIntersection of two tries parameterized by a combining function of the key and the values at overlapping keysn4Remove the keys of the right trie from the left trieoParameterized n( using a custom merge function. Return x. to change the value stored in left trie, or  to remove from the left trie.po* where function also has access to the keyqIMap a function over a trie filtering out elements where function returns % RSTUVWXYZ[\]^_`abcdefghijklmnopq%U[RSTbYcdZXefVW`_gaq\]^hijklmnop “      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwuxyz{|}~u€ux‚uƒY„}…†z‡ˆ‰Š‹}…ŒŽ‘’“””•–—˜™š›œux}…ž}…Ÿ )generic-trie-0.3.1-AewXrqqzI8V1m3pZKK0elTData.GenericTrie.InternalData.GenericTrieGTrieKey gtrieLookup gtrieInsertgtrieSingleton gtrieDeletegtrieMap gtrieTraversegmapMaybeWithKey gfoldWithKeygtraverseWithKey gmergeWithKeyGTrieTrieRepDefaultOrdKey getOrdKeyTrieMkTrieTrieKeyTrieRep trieEmptytrieNull trieLookup trieInsert trieDelete trieSingletontrieMap trieTraverse trieShowsPrectrieMapMaybeWithKeytrieFoldWithKeytrieTraverseWithKeytrieMergeWithKey genericLookupgenericTrieNullgenericSingleton genericEmpty genericInsert genericDeletegenericTrieMapgenericTrieTraversegenericTrieShowsPrecgenericMapMaybeWithKeygenericFoldWithKeygenericTraverseWithKey $fGTrieKeyV1 $fGTrieKeyU1 $fGTrieKey:+: $fGTrieKey:*: $fGTrieKeyM1$fFunctorGTrie $fShowGTrie$fGTrieKeyShowV1$fGTrieKeyShowU1$fGTrieKeyShow:+:$fGTrieKeyShow:*:$fGTrieKeyShowM1$fGTrieKeyShowM10$fTraversableTrie$fFoldableTrie $fFunctorTrie $fShowTrie$fGTrieKeyShowK1 $fGTrieKeyK1 $fTrieKey[]$fTrieKey(,,,,)$fTrieKey(,,,) $fTrieKey(,,) $fTrieKey(,)$fTrieKeyEither$fTrieKeyMaybe $fTrieKeyBool $fTrieKey()$fTrieKeyOrdKey $fTrieKeyChar$fTrieKeyInteger $fTrieKeyInt$fGTrieKeyShowM11 $fReadOrdKey $fShowOrdKey $fEqOrdKey $fOrdOrdKeyfromList fromListWith fromListWith'emptynulllookupatinsertdelete singletonmapMaybeWithKeyfilter filterWithKeyfold foldWithKeytraverseWithKeyalter insertWith insertWith'member notMembertoListunion unionWith unionWithKey intersectionintersectionWithintersectionWithKey differencedifferenceWithdifferenceWithKeymapMaybe GTrieKeyShowbaseGHC.Show showsPrecGHC.BaseMaybecontainers-0.5.10.2Data.Map.InternalMapghc-prim GHC.ClassesOrd GHC.GenericsGenericJustGHC.ListgenericMergeWithKey GHC.TypesCharData.IntMap.InternalIntMap integer-gmpGHC.Integer.TypeIntegerIntMTrieSTrieLSTrieRSTrieBPTrieKTrieUTrieMProxygtrieShowsPrec EmptyTrie NonEmptyTrie D:R:GTrieU1a0D:R:GTrie:*:a0D:R:GTrie:+:a0 D:R:GTrieM1a0 D:R:GTrieK1a0NothingTrueFalse