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

Tests Vignettes

Available Snapshots

This version of triebeard can be found in the following snapshots:


Imports/Depends/LinkingTo/Enhances (2)
  • Rcpp
  • Rcpp
  • Suggests (3)
  • knitr
  • rmarkdown
  • testthat
  • Version History