E><      !"#$%&'()*+,-./0123456789:;None 1234=JKM/<The <, class provides generic implementations of =[. This class is separate due to its implementation varying for diferent 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.FEffectively an associated datatype of tries indexable by keys of type kf. By using a separate newtype wrapper around the associated type synonym we're able to use the same g constructor for all of the generic implementations while still getting the injectivity of a new type. 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.-Keys that support prefix-trie map operations.3All operations can be automatically derived from a ? 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 @ 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 %. 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 %. 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 %. 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.AGeneric implementation of  %. This is the default implementation.-/Construct a trie from a list of key/value pairs.Alter the values of a trie. The function will take the value stored as the given key if one exists and should return a value to insert at that location or Nothing to delete from that location./Returns B when the % has a value stored at the given key.0Returns C when the % has a value stored at the given key.1 Transform  to an association list.D>Tries of types without constructors are represented by a unit.EGTries of constructors without fields are represented by a single value.F:Generic sums are represented by up to a pair of sub-tries.G3Generic products are represented by tries of tries.H:Generic fields are represented by tries of the field type.IBGeneric metadata is skipped in trie representation and operations.J  tries are implemented with KX, this is intended for cases where it is better for some reason to force the use of a K0 than to use the generically derived structure.L!'Char tries are implemented with M.NO tries are implemented with K.PQ tries are implemented with M.nRS<T  UVWXYZ[!"#$%&'()*+,A\-./0123456789:;]^_`abDcEdFeGfHghiIjklmnopqrstuvwJLNPC  UVWXYZ[!"#$%&'()*+,-./0123456789:;<./0-1;23456789: "'()%!&*#$+, JRS<T    !"#$%&'()*+,A\-./0123456789:;]^_`abDcEdFeGfHghiIjklUmVnWoZYXp[qrstuvwJLNPx      !"#$%&'()*+,-./0123456789:;<=>?@>AB>CD>AEFGHIGHJKLMNOPQRSTURVWXYZ[\GH]^^_`abcdefghijklmnopqrstuvwxyz{|}~generic-trie-0.2Data.GenericTrieGTrieKey gtrieLookup gtrieInsertgtrieSingleton gtrieDeletegtrieMap gtrieTraversegmapMaybeWithKey gfoldWithKeygtraverseWithKey gmergeWithKeyGTrieOrdKey getOrdKeyTrieMkTrieTrieRepDefaultTrieKeyTrieRepemptytrieNulllookupinsertdelete singletontrieMap trieTraverse trieShowsPrecmapMaybeWithKey foldWithKeytraverseWithKey mergeWithKey genericLookupgenericTrieNullgenericSingleton genericEmpty genericInsert genericDeletegenericTrieMapgenericTrieTraversegenericTrieShowsPrecgenericMapMaybeWithKeygenericFoldWithKeygenericTraverseWithKeyfromListaltermember notMembertoListunion unionWith unionWithKey intersectionintersectionWithintersectionWithKey differencedifferenceWithdifferenceWithKeymapMaybe GTrieKeyShowbaseGHC.Show showsPrec Data.MaybeMaybe GHC.GenericsGenericJustgenericMergeWithKeyghc-prim GHC.TypesTrueFalse $fGTrieKeyV1 $fGTrieKeyU1 $fGTrieKey:+: $fGTrieKey:*: $fGTrieKeyK1 $fGTrieKeyM1$fTrieKeyOrdKeycontainers-0.5.5.1 Data.Map.BaseMap $fTrieKeyCharData.IntMap.BaseIntMap$fTrieKeyInteger integer-gmpGHC.Integer.TypeInteger $fTrieKeyIntIntMProxygtrieShowsPrecUTrieKTriePTrieSTrieBSTrieRSTrieLMTrie checkNull$fTraversableTrie$fFoldableTrie $fFunctorTrie $fShowGTrie $fShowTrie$fGTrieKeyShowV1$fGTrieKeyShowU1$fGTrieKeyShow:+:$fGTrieKeyShow:*:$fGTrieKeyShowK1$fGTrieKeyShowM1$fGTrieKeyShowM10$fGTrieKeyShowM11$fFunctorGTrieTFCo:R:GTrieV1aTFCo:R:GTrieU1aTFCo:R:GTrieK1aTFCo:R:GTrie:*:aTFCo:R:GTrie:+:aTFCo:R:GTrieM1a $fTrieKey[] $fTrieKey(,,) $fTrieKey(,)$fTrieKeyEither$fTrieKeyMaybe $fTrieKeyBool $fTrieKey()