##triebeard
Fast key-value matching in R and Rcpp
Author: Oliver Keyes, Drew Schmidt, Yuuki Takano
License: MIT
Status: Stable
###Description
Tries, or radix trees, are key-value data structures optimised for matching. Or to put it another way, if you have a pile of labels that match to particular values, and you want to take label-based data and extract the equivalent value(s) for each entry, you can handle three million entries in a second.
This is pretty useful in data cleaning and value extraction, and tries let you do it really efficiently. triebeard contains
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:
- The vignette on Rcpp usage;
- The vignette on R usage.
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.
###Installation
The latest version can be obtained via:
devtools::install_github("ironholds/triebeard")
###Dependencies
- R.
- Rcpp