'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'.
[email protected] is safe to use (health: 55/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/conda/r-triebeardFirst published · 2020-07-29 16:48:23.821000+00:00
Last updated · 2025-09-10 05:51:56.845000+00:00