'Radix trees', or 'tries', are key-value data structures optimised for efficient lookups, similar in purpose to hash tables. 'triebeard' provides an implementation of 'radix trees' for use in R programming and in developing packages with 'Rcpp'.
Fast key-value matching in R and Rcpp
Author: Oliver Keyes, Drew Schmidt, Yuuki Takano
Tries, or radix trees, are key-value data structures optimised for very, very fast matching of the keys against user-provided data (and then the return of the associated values!)
This is pretty useful in data cleaning and value extraction, and tries let you do it really efficiently.
an implementation that can be used both when writing R, and when writing Rcpp (and imported and linked against, to boot). For more information see:
Please note that this project is released with a Contributor Code of Conduct. By participating in this project you agree to abide by its terms.
The stable, CRAN-ready version can be retrieved with:
The latest version can be obtained via:
trie_remove()resulted in a 0 element trie.