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.

Documentation

Manual: rtrie.pdf
Vignette: Trie Usage

Maintainer: Casimir Saternos <cas.saternos at gmail.com>

Author(s): Casimir Saternos*

Install package and any missing dependencies by running this line in your R console:

install.packages("rtrie")

Depends R (>= 2.10)
Imports
Suggests knitr(>=1.14), rmarkdown(>=1.2), testthat(>=1.0.2), microbenchmark(>=1.4-2.1)
Enhances
Linking to
Reverse
depends
Reverse
imports
Reverse
suggests
Reverse
enhances
Reverse
linking to

Package rtrie
Materials
URL https://github.com/ezgraphs/rtrie
Task Views
Version 0.1.1
Published 2017-01-06
License MIT + file LICENSE
BugReports https://github.com/ezgraphs/rtrie/issues
SystemRequirements
NeedsCompilation no
Citation
CRAN checks rtrie check results
Package source rtrie_0.1.1.tar.gz