'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.4.1 Imports: Rcpp LinkingTo: Rcpp Suggests: knitr, rmarkdown, testthat Published: 2023-03-04 DOI: 10.32614/CRAN.package.triebeard Author: Os Keyes [aut, cre], Drew Schmidt [aut], Yuuki Takano [cph] Maintainer: Os Keyes <ironholds at gmail.com> BugReports: https://github.com/Ironholds/triebeard/issues License: MIT + file LICENSE URL: https://github.com/Ironholds/triebeard/ NeedsCompilation: yes Materials: README NEWS CRAN checks: triebeard results Documentation: Reference manual: triebeard.pdf Vignettes: Radix trees in RPlease use the canonical form https://CRAN.R-project.org/package=triebeard to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4