úÎ ¯}O      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNSafe-./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. !"#$%&'()*+O,-./0 !"#$%&'()* !"0/.#-$%,+&'()* !"#$%&'()*+O,-./0None +-./0357C123451231235412345None +-./0357>CL6789P:678678:96789P:None+-./03457>CFLH”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.LDNo insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.;<=>?@ABCDEFGHIQJKLMN;<=>?@ABCDEFGH>?@NMLAKBC;<=JIDEFGH;<=>?@ABCDEFGHIQJKLMNR      !""#$$%&'()*+,-./012334567789:;;<==>&'()*+,?@ABCDEFGHtries_CfwlsXD6KVJISNgn0TSqFTData.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 unHashMapStepempty singletonkeyselemssubtriematchmatches$fLookupHashMapTrie$fTrieNonEmptypHashMapTrie$fMonoidHashMapStep$fTrieNonEmptypHashMapStep$fArbitraryHashMapStep$fNFDataHashMapStep KnuthTrie unKnuthTrie$fTrieNonEmptysKnuthTrie$fNFDataKnuthTrieListTrie unListTrie$fTrieNonEmptysListTrie$fNFDataListTrieMapTrie unMapTrieMapStep unMapStep$fLookupMapTrie$fTrieNonEmptysMapTrie$fMonoidMapStep$fTrieNonEmptypMapStep$fArbitraryMapStep$fNFDataMapStepTFCo:R:KeyHashMapTrieTFCo:R:KeyListTrieTFCo:R:KeyMapTrie