'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'.
|Author||Oliver Keyes [aut, cre], Drew Schmidt [aut], Yuuki Takano [cph]|
|Date of publication||2016-08-04 00:57:37|
|Maintainer||Oliver Keyes <firstname.lastname@example.org>|
|License||MIT + file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.