'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
conda install conda-forge::r-triebeardconda install conda-forge/label/cf201901::r-triebeardconda install conda-forge/label/cf202003::r-triebeardconda install conda-forge/label/gcc7::r-triebeard