rtrie: A Simple R-Based Implementation of a Trie (A.k.a. Digital Tree/Radix Tree/Prefix Tree)

A simple R-based implementation of a Trie (a.k.a. digital tree/radix tree/prefix tree) A trie, also called digital tree and sometimes radix tree or prefix tree is a kind of search tree. This ordered tree data structure is used to store a dynamic set or associative array where the keys are usually strings.

Version: 0.1.1
Depends: R (≥ 2.10)
Suggests: knitr (≥ 1.14), rmarkdown (≥ 1.2), testthat (≥ 1.0.2), microbenchmark (≥ 1.4-2.1)
Published: 2017-01-06
Author: Casimir Saternos [aut, cre]
Maintainer: Casimir Saternos <cas.saternos at gmail.com>
BugReports: https://github.com/ezgraphs/rtrie/issues
License: MIT + file LICENSE
URL: https://github.com/ezgraphs/rtrie
NeedsCompilation: no
CRAN checks: rtrie results


Reference manual: rtrie.pdf
Vignettes: Trie Usage
Package source: rtrie_0.1.1.tar.gz
Windows binaries: r-devel: rtrie_0.1.1.zip, r-release: rtrie_0.1.1.zip, r-oldrel: rtrie_0.1.1.zip
OS X Mavericks binaries: r-release: rtrie_0.1.1.tgz, r-oldrel: rtrie_0.1.1.tgz
Old sources: rtrie archive


Please use the canonical form https://CRAN.R-project.org/package=rtrie to link to this page.