t

tries

A Java implementations of different Tries (prefix trees). These are ordered tree data structures commonly used for efficient string searches.
https://github.com/michael-rapp/Tries
Apache License version 2.0
Michael Rapp
Files download
File Operation
tries-1.0.1.jar download
tries-1.0.1.pom download
tries-1.0.1-sources.jar download
Apache Maven
<dependency>
  <groupId>com.github.michael-rapp</groupId>
  <artifactId>tries</artifactId>
  <version>1.0.1</version>
</dependency>
Gradle Groovy
implementation 'com.github.michael-rapp:tries:1.0.1'
Gradle Kotlin
implementation("com.github.michael-rapp:tries:1.0.1")
Scala SBT
libraryDependencies += "com.github.michael-rapp" % "tries" % "1.0.1"
Groovy Grape
@Grapes(
  @Grab(group='com.github.michael-rapp', module='tries', version='1.0.1')
)
Apache Ivy
<dependency org="com.github.michael-rapp" name="tries" rev="1.0.1" />
Leiningen
[com.github.michael-rapp/tries "1.0.1"]
Apache Buildr
'com.github.michael-rapp:tries:jar:1.0.1'