(q      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None>?A <Embeds an empty ByteString passed around for type inference.PClass representing tries with single-threaded insertion, deletion, and lookup. ;forall ts ps a. isJust $ lookupPath ps (insertPath ps a ts) :forall ts ps. isNothing $ lookupPath ps (deletePath ps ts)    None13456;<=>?FKNT!Returns a list of all the nodes along the path to the furthest point in the query, in order of the path walked from the root to the furthest point. ! %$#" '& None 13456;=>?K=>?=>?A@=>?None13456;=>?FKT]JKLJKLNMJKLNone13456;<=>?FKNQTVIhReturns a list of all the nodes along the path to the furthest point in the query, in order of the path walked from the root to the furthest point.mDNo insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.WXYZ[\]^`_abcdefgh]^_`kjiZ[\onmalbcWXYqpdefghWXYZ[\]^_`Safe345;=V(Tagged rose tree with explicit emptyness1Provides a form of deletion by setting a path to Nothing, but doesn't cleanup like prune4Overwrite the LHS point-wise with the RHS's contents%Simple test on the heads of two triesThe meet of two  PseudoTries:Needless intermediary elements are turned into shortcuts, Nil!'s in subtrees are also removed.Overwriting instanceSafeJ       !"#$%&'()*+,-./0123456789:;<=>?@@ABCDEFGHIJKLLMNOPQRSTUVWXXYZZ[\\]^  !_`abcdefghijklmnopqrstuvwxyz{|}~ "tries-0.0.5-1HYW2Lcc3WgCWo63kw4nPCData.Trie.ClassData.Trie.HashMapData.Trie.KnuthData.Trie.List Data.Trie.MapData.Trie.Pseudo Paths_triesBSTrieunBSTrieTrielookupinsertdeletemember notMember fromFoldable makeBSTrie getBSTrie$fTrieIdentityByteStringBSTrie HashMapTrie unHashMapTrie HashMapStep unHashMapStepHashMapChildren hashMapNodehashMapChildrenempty singletonkeyselemssubtriematchmatches$fMonoidHashMapChildren$fArbitraryHashMapChildren$fNFDataHashMapChildren$fMonoidHashMapStep$fTrieNonEmptypHashMapStep$fArbitraryHashMapStep$fNFDataHashMapStep$fLookupHashMapTrie$fTrieNonEmptypHashMapTrie$fShowHashMapChildren$fEqHashMapChildren$fFunctorHashMapChildren$fFoldableHashMapChildren$fTraversableHashMapChildren$fGenericHashMapChildren$fDataHashMapChildren$fShowHashMapStep$fEqHashMapStep$fFunctorHashMapStep$fFoldableHashMapStep$fTraversableHashMapStep$fGenericHashMapStep$fDataHashMapStep$fShowHashMapTrie$fEqHashMapTrie$fFunctorHashMapTrie$fFoldableHashMapTrie$fTraversableHashMapTrie$fMonoidHashMapTrie$fArbitraryHashMapTrie KnuthTrie unKnuthTrie$fTrieNonEmptysKnuthTrie$fNFDataKnuthTrie$fShowKnuthTrie $fEqKnuthTrie$fFunctorKnuthTrie$fFoldableKnuthTrie$fTraversableKnuthTrie$fArbitraryKnuthTrie$fGenericKnuthTrie$fDataKnuthTrieListTrie unListTrie$fTrieNonEmptysListTrie$fNFDataListTrie$fShowListTrie $fEqListTrie$fFunctorListTrie$fFoldableListTrie$fTraversableListTrie$fArbitraryListTrie$fGenericListTrie$fDataListTrieMapTrie unMapTrieMapStep unMapStep MapChildrenmapNode mapChildren$fMonoidMapChildren$fArbitraryMapChildren$fNFDataMapChildren$fMonoidMapStep$fTrieNonEmptypMapStep$fArbitraryMapStep$fNFDataMapStep$fLookupMapTrie$fTrieNonEmptysMapTrie$fShowMapChildren$fEqMapChildren$fOrdMapChildren$fFunctorMapChildren$fFoldableMapChildren$fTraversableMapChildren$fGenericMapChildren$fDataMapChildren $fShowMapStep $fEqMapStep $fOrdMapStep$fFunctorMapStep$fFoldableMapStep$fTraversableMapStep$fGenericMapStep $fDataMapStep $fShowMapTrie $fEqMapTrie $fOrdMapTrie$fFunctorMapTrie$fFoldableMapTrie$fTraversableMapTrie$fMonoidMapTrie$fArbitraryMapTrie PseudoTrieMoreRestNil beginsWithassignmergeaddtoAssocs fromAssocs areDisjointintersectionWithprune$fMonoidPseudoTrie$fShowPseudoTrie$fEqPseudoTrie$fFunctorPseudoTrie$fFoldablePseudoTrie$fTraversablePseudoTrieversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName