'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
https://anaconda.org/conda-forge/r-triebeard/badges/version.svg
https://anaconda.org/conda-forge/r-triebeard/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-triebeard/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-triebeard/badges/platforms.svg
https://anaconda.org/conda-forge/r-triebeard/badges/license.svg
https://anaconda.org/conda-forge/r-triebeard/badges/downloads.svg