Radix trees in Rcpp and R
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
R
inst/include
man
paper/data_structures
src
tests
vignettes
.Rbuildignore
.gitignore
.travis.yml
CONDUCT.md
DESCRIPTION
LICENSE
NAMESPACE
NEWS
README.md
triebeard.Rproj

README.md

##triebeard

Fast key-value matching in R and Rcpp

Author: Oliver Keyes, Drew Schmidt, Yuuki Takano
License: MIT
Status: Stable

Travis-CI Build Status downloads

###Description

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.

###Installation

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

install.packages("triebeard")

The latest version can be obtained via:

devtools::install_github("ironholds/triebeard")

###Dependencies