h$z#      !"None!03?I  radixtree 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. radixtree9A radixtree. Construct with 'fromFoldable_, and use with . radixtree3Can terminate a parser successfully, returning the # value given. radixtree#possible subtrees beyond this point radixtreeA node in a radixtree. To advance from here a parser must parse the #( (i.e., the prefix) value at this node.  radixtree Compress a  given a corpus. All values in the tree must be findable within the corpus, though the corpus does not have to necessarily be the direct source of the tree  radixtreeSlow*. Same as  , but you do not need to supply pairs of text and values; they will default to ().  radixtreeSlow*  radixtree&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). radixtreetext to return at this point radixtree#possible subtrees beyond this point radixtreevalue to return at this point     Safe-Inferred$%&'()*+,       !"#$%&'()*+,-./0'radixtree-0.6.0.0-BZzwFNioGyr3zcwrADP9rData.RadixTreePaths_radixtree RadixParsingkeysparselookupCompressedRadixTree RadixTree RadixAccept RadixSkip RadixNode compressBy fromFoldable_ fromFoldablesearchparse_lookup_$fNFDataRadixTree$fNFDataRadixNode$fNFDataCompressedRadixTree1$fNFDataCompressedRadixNode$fNFDataCompressedRadixTree!$fRadixParsingCompressedRadixTree$fRadixParsingRadixTree $fEqRadixTree$fShowRadixTree$fDataRadixTree $fEqRadixNode$fShowRadixNode$fDataRadixNode$fShowCompressedTrie$fEqCompressedTrie $fShowTrie$fEqTrie$fShowPrefixNode$fEqPrefixNode text-1.2.3.2Data.Text.InternalTextversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName