úÎ-p6      !"#$%&'()*+,-./012345Safe!"2Overwrites when similar, leaves untouched when not 6   6 Safe ,A Rooted, predicate, disjointly indexed trie 78    78Safe!" xGiven a parser and a chunk, take a trie expecting a result, and possibly return a reduced trie without the expectation.(Acts as a default tag value for the nodeKMeasure the depth of a trie, based on the relation of other adjacent depths2Overwrites when similar, leaves untouched when not'Assigns a value to literal constructors!Apply a transform fp to the final path chunk, when matching a literal cell - used for eliminating file extensions in nested-routes.#'Return all nodes passed during a lookup%3Create a singleton trie out of literal constructors&*Push a trie down with literal constructors'Oalso does a non-deterministic merge - make sure your nodes are disjoint & clean9Ignores contents:"Can only generate literal examples;< !"#$%&'=9:>?@A !"#$%&' !"#$%&';< !"#$%&'=9:>?@ASafe1Applies f to the last chunk.3"Append contents up-to lookup path.()*+B,-./012345CDEFGH()*+,-./012345()*+.,-/012345()*+B,-./012345CDEFGHI              !"#$   %%&'()*%+,-.*%/01234predt_Lt61uffnmvEBZgHJqy3qSgData.Trie.Pred.Disjoint.TailData.Trie.Pred.DisjointData.Trie.Pred.Unified.TailData.Trie.Pred.UnifiedDPTrieDMoreDPredmerge areDisjointlookup lookupWithLlookupNearestParentlitSingletonTaillitExtrudeTailsortRDPTrieRooted litSingleton litExtrudeUPTrieUMoreUPred suppliment tagUPTriemeasureDepthRelativemaxDepthminDepthshowTail assignLitelem lookupThrough firstNonEmptyRUPTrierootchildrenshowTrie firstJust$fMonoidRDPTrie $fShowUPTrie$fArbitraryUPTriePathmap$fSemigroupUPTrie $fEqUPTrie$fFoldableUPTrie$fFunctorUPTrie$fArbitraryRUPTrie $fShowRUPTrie$fMonoidRUPTrie$fFoldableRUPTrie$fFunctorRUPTrie