úβ¸8      !"#$%&'()*+,-./01234567Safe-./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-./357C   None -./357>CL!"#$8!"#!"#$!"#$8None -./3457>CFL2”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.6DNo insertion instance - requires children nodes to be a monoid. Use Data.Trie.Map.insert instead.%&'()*+,-./012394567%&'()*+,-./012()*76+5,-%&'43./012%&'()*+,-./012394567:      !!"#$$%&''())*+,-./0123456789tries_A1xPzb7xYGPAQEs83lvbjDData.Trie.PseudoData.Trie.ClassData.Trie.KnuthData.Trie.List Data.Trie.Map PseudoTrieMoreRestNil beginsWithassignmergeaddtoAssocs fromAssocslookup areDisjointintersectionWithprune$fMonoidPseudoTrieBSTrieunBSTrieTrieinsertdeletelookupWithDefaultmember notMember fromFoldable makeBSTrie getBSTrie$fTrieIdentityByteStringBSTrie KnuthTrie unKnuthTrie$fTrieNonEmptysKnuthTrieListTrie unListTrie$fTrieNonEmptysListTrieMapTrie unMapTrieMapStep unMapStepempty singletonkeyselemssubtriematchmatches$fLookupMapTrie$fTrieNonEmptysMapTrie$fMonoidMapStep$fTrieNonEmptypMapStep$fArbitraryMapStepTFCo:R:KeyListTrieTFCo:R:KeyMapTrie