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

Version: 0.3.0
Imports: Rcpp
LinkingTo: Rcpp
Suggests: knitr, rmarkdown, testthat
Published: 2016-08-04
Author: Oliver Keyes [aut, cre], Drew Schmidt [aut], Yuuki Takano [cph]
Maintainer: Oliver Keyes <ironholds at>
License: MIT + file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: triebeard results


Reference manual: triebeard.pdf
Vignettes: Radix trees in R
Radix trees in Rcpp
Package source: triebeard_0.3.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X binaries: r-release: triebeard_0.3.0.tgz, r-oldrel: triebeard_0.3.0.tgz
Old sources: triebeard archive

Reverse dependencies:

Reverse imports: iptools, urltools


Please use the canonical form to link to this page.