)H!-      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Safe2349;T(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    None<=?<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) !   !  !None023459:;<=DILR3Returns 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."#$%&'()*+,-./0123456789:;<"#$%&'()*+,-./0123()*+<;:%&'987,6-."#$54/0123"#$%&'()*+,-./0123456789:;<None 023459;<=IRSTUVRSTRSTVURSTUVNone023459;<=DIR_`abc_`a_`acb_`abcNone023459:;<=DILR}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.DNo insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.lmnopqrstuvwxyz{|}~lmnopqrstuvwxyz{|}rstuopqvwxlmn~yz{|}lmnopqrstuvwxyz{|}~      !"#$%&''())*++,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSSTUVWXYZ[\]^__`abcdefghijkklmmnoopq./01234rstuvwxyz{|}~$tries-0.0.4.2-GoUux3xZxk2I3AGmQNFkkyData.Trie.PseudoData.Trie.ClassData.Trie.HashMapData.Trie.KnuthData.Trie.List Data.Trie.Map PseudoTrieMoreRestNil beginsWithassignmergeaddtoAssocs fromAssocslookup areDisjointintersectionWithprune$fMonoidPseudoTrie$fShowPseudoTrie$fEqPseudoTrie$fFunctorPseudoTrie$fFoldablePseudoTrie$fTraversablePseudoTrieBSTrieunBSTrieTrieinsertdeletelookupWithDefaultmember notMember fromFoldable makeBSTrie getBSTrie$fTrieIdentityByteStringBSTrie HashMapTrie unHashMapTrie HashMapStep unHashMapStepHashMapChildren hashMapNodehashMapChildrenempty singletonkeyselemssubtriematchmatches$fLookupHashMapTrie$fTrieNonEmptypHashMapTrie$fMonoidHashMapStep$fTrieNonEmptypHashMapStep$fArbitraryHashMapStep$fNFDataHashMapStep$fMonoidHashMapChildren$fArbitraryHashMapChildren$fNFDataHashMapChildren$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$fLookupMapTrie$fTrieNonEmptysMapTrie$fMonoidMapStep$fTrieNonEmptypMapStep$fArbitraryMapStep$fNFDataMapStep$fMonoidMapChildren$fArbitraryMapChildren$fNFDataMapChildren$fShowMapChildren$fEqMapChildren$fOrdMapChildren$fFunctorMapChildren$fFoldableMapChildren$fTraversableMapChildren$fGenericMapChildren$fDataMapChildren $fShowMapStep $fEqMapStep $fOrdMapStep$fFunctorMapStep$fFoldableMapStep$fTraversableMapStep$fGenericMapStep $fDataMapStep $fShowMapTrie $fEqMapTrie $fOrdMapTrie$fFunctorMapTrie$fFoldableMapTrie$fTraversableMapTrie$fMonoidMapTrie$fArbitraryMapTrie