úÎ"ó ]      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\Safe-./35N(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 tries The meet of two  PseudoTries :Needless intermediary elements are turned into shortcuts, Nil!'s in subtrees are also removed.Overwriting instance    None79<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)  None+-./03457>CFL.”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. !"#$%&'()*+,-./]01234567 !"#$%&'()*+,-.#$%&765 !"432'1()0/*+,-. !"#$%&'()*+,-./]01234567None +-./0357C89:;<89:89:<;89:;<None +-./0357>CL=>?@^A=>?=>?A@=>?@^ANone+-./03457>CFLS”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.WDNo insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.BCDEFGHIJKLMNOPQRST_UVWXYZ[\BCDEFGHIJKLMNOPQRSHIJK\[ZEFGYXWLVMNBCDUTOPQRSBCDEFGHIJKLMNOPQRST_UVWXYZ[\`      !""#$$%&&'()*+,-./01234567899:;<==>?@AABCCDEEFG)*+,-./HIJKLMNOPQRSTtries_KgcfX29A3pi6GZcvzfyUPGData.Trie.PseudoData.Trie.ClassData.Trie.HashMapData.Trie.KnuthData.Trie.List Data.Trie.Map PseudoTrieMoreRestNil beginsWithassignmergeaddtoAssocs fromAssocslookup areDisjointintersectionWithprune$fMonoidPseudoTrieBSTrieunBSTrieTrieinsertdeletelookupWithDefaultmember notMember fromFoldable makeBSTrie getBSTrie$fTrieIdentityByteStringBSTrie HashMapTrie unHashMapTrie HashMapStep unHashMapStepHashMapChildren hashMapNodehashMapChildrenempty singletonkeyselemssubtriematchmatches$fLookupHashMapTrie$fTrieNonEmptypHashMapTrie$fMonoidHashMapStep$fTrieNonEmptypHashMapStep$fArbitraryHashMapStep$fNFDataHashMapStep$fMonoidHashMapChildren$fArbitraryHashMapChildren$fNFDataHashMapChildren KnuthTrie unKnuthTrie$fTrieNonEmptysKnuthTrie$fNFDataKnuthTrieListTrie unListTrie$fTrieNonEmptysListTrie$fNFDataListTrieMapTrie unMapTrieMapStep unMapStep MapChildrenmapNode mapChildren$fLookupMapTrie$fTrieNonEmptysMapTrie$fMonoidMapStep$fTrieNonEmptypMapStep$fArbitraryMapStep$fNFDataMapStep$fMonoidMapChildren$fArbitraryMapChildren$fNFDataMapChildrenTFCo:R:KeyHashMapTrieTFCo:R:KeyListTrieTFCo:R:KeyMapTrie