triebeard v0.3.0


Monthly downloads



'Radix' Trees in 'Rcpp'

'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
License: MIT
Status: Stable

Travis-CI Build Status downloads


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. 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:

  1. The vignette on Rcpp usage;
  2. 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.


The stable, CRAN-ready version can be retrieved with:


The latest version can be obtained via:



Functions in triebeard

Name Description
alter Add or remove trie entries
trie Create a Trie
getters Trie Getters
greedy_match Greedily match against a tree
prefix_match Find the prefix matches in a trie
triebeard Radix trees in Rcpp
longest_match Find the longest match in a trie
No Results!

Vignettes of triebeard

No Results!

Last month downloads


Type Package
License MIT + file LICENSE
LazyData TRUE
LinkingTo Rcpp
RoxygenNote 5.0.1
VignetteBuilder knitr
Date 2016-08-03
NeedsCompilation yes
Packaged 2016-08-03 21:32:42 UTC; ironholds
Repository CRAN
Date/Publication 2016-08-04 00:57:37

Include our badge in your README