CRAN

TSTr 1.2

Ternary Search Tree for Auto-Completion and Spell Checking

Released Oct 31, 2015 by Ricardo Merino

This package can be loaded by Renjin but 9 out 10 tests failed.

Dependencies

stringr 1.3.0 stringdist 0.9.4.7 data.table 1.10.4-3

A ternary search tree is a type of prefix tree with up to three children and the ability for incremental string search. The package uses this ability for word auto-completion and spell checking. Includes a dataset with the 10001 most frequent English words.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>TSTr</artifactId>
    <version>1.2-b27</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:TSTr')

Test Results

This package was last tested against Renjin 0.9.2622 on Apr 7, 2018.

Source

R

View GitHub Mirror

Release History