None .1<>?FQTV<  A normal  stores a new   at every node. In contrast, a  takes a single corpus   which is indexed into by nodes. This can save a lot of memory (e.g., using the radix trees from the parsing benchmarks in this package, the 0 version is 254032 bytes, whereas the ordinary / is a rotund 709904 bytes) at no runtime cost.!offset (in units of Word16)"length (in units of Word16)A radixtree. Construct with , and use with .3Can terminate a parser successfully, returning the   value given.DA node in a radixtree. To advance from here a parser must parse the  ( (i.e., the prefix) value at this node.#Compress a totally-unoptimised $" into a nice and easily-parsable %Probably dangerous magicIWhen the second argument is found to be within the first, we re-use the   array of the first. This should allow the second argument to be garbage collected. This is to improve locality and memory use. Compress a  given a corpus. All values in the tree be findable within the corpus, though the corpus does not have to necessarily be the direct source of the treeSlow*&Find all occurences of the terms in a  from this point on. This will consume the entire remaining input. Can lazily produce results (but this depends on your parser).   &'()*+,-!"./$01234      !"#$%&'())*+,--..'/012(radixtree-0.4.0.0-9iX3YTyWlIm9aJbq9TT4IWData.RadixTreeCompressedRadixTree RadixTree RadixAccept RadixSkip RadixNode compressBy fromFoldable$fNFDataRadixTree$fNFDataRadixNode$fNFDataCompressedRadixTree1$fNFDataCompressedRadixNode$fNFDataCompressedRadixTree$fShowPrefixNode$fEqPrefixNode $fShowTrie$fEqTrie$fShowCompressedTrie$fEqCompressedTrie $fEqRadixTree$fShowRadixTree$fDataRadixTree $fEqRadixNode$fShowRadixNode$fDataRadixNode$fStoreRadixNode RadixParsingparsesearch$fStoreRadixTree!$fRadixParsingCompressedRadixTree$fRadixParsingRadixTree#text-1.2.2.2-EakMpasry3jA6OIwSZhq9MData.Text.InternalText tsOffset16 tsLength16fromTrieTriemagicallySaveSpaceSometimesCompressedRadixNodeCompressedRadixTree1CompressedRadixAcceptCompressedRadixSkip TextSliceCompressedTrie PrefixNodeAcceptSkip