úÎŽ»5      !"#$%&'()*+,-./01234Safe-./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    None-./>CL55None79<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 -./3457>CFL1”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.%&'()*+,-./012634 %&'()*+,-./01()*43+,%&'2-./01 %&'()*+,-./0126347      !"##$%&&'(()*+,-./0123456tries_9div1Yb3oPm1h1es0QuzF5Data.Trie.PseudoData.Trie.ListData.Trie.ClassData.Trie.Knuth Data.Trie.Map PseudoTrieMoreRestNil beginsWithassignmergeaddtoAssocs fromAssocslookup areDisjointintersectionWithprune$fMonoidPseudoTrieListTrie unListTrieBSTrieunBSTrieTrieinsertdeletelookupWithDefaultmember notMember fromFoldable makeBSTrie getBSTrie$fTrieIdentityByteStringBSTrie KnuthTrie unKnuthTrie$fTrieNonEmptysKnuthTrieMapTrie unMapTrieMapStep unMapStepempty singletonkeyselemssubtriematchmatches$fLookupMapTrie$fMonoidMapStep$fTrieNonEmptypMapStepTFCo:R:KeyListTrieTFCo:R:KeyMapTrie