triebeard
'Radix' Trees in 'Rcpp'
'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'.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.4.1 |
rolling linux/jammy R-4.5 | triebeard_0.4.1.tar.gz |
190.1 KiB |
0.4.1 |
rolling linux/noble R-4.5 | triebeard_0.4.1.tar.gz |
195.4 KiB |
0.4.1 |
rolling source/ R- | triebeard_0.4.1.tar.gz |
30.4 KiB |
0.4.1 |
latest linux/jammy R-4.5 | triebeard_0.4.1.tar.gz |
190.1 KiB |
0.4.1 |
latest linux/noble R-4.5 | triebeard_0.4.1.tar.gz |
195.4 KiB |
0.4.1 |
latest source/ R- | triebeard_0.4.1.tar.gz |
30.4 KiB |
0.4.1 |
2026-04-26 source/ R- | triebeard_0.4.1.tar.gz |
30.4 KiB |
0.4.1 |
2026-04-23 source/ R- | triebeard_0.4.1.tar.gz |
30.4 KiB |
0.4.1 |
2026-04-09 windows/windows R-4.5 | triebeard_0.4.1.zip |
506.1 KiB |
0.4.1 |
2025-04-20 source/ R- | triebeard_0.4.1.tar.gz |
30.4 KiB |