'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'.
copied from cf-staging / r-triebeard| Label | Latest Version |
|---|---|
| main | 0.4.1 |
| cf201901 | 0.3.0 |
| cf202003 | 0.3.0 |
| gcc7 | 0.3.0 |
