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
文件下载
文件名 操作
tries-1.0.0.jar 下载
tries-1.0.0.pom 下载
tries-1.0.0-sources.jar 下载
Apache Maven
<dependency>
  <groupId>com.github.michael-rapp</groupId>
  <artifactId>tries</artifactId>
  <version>1.0.0</version>
</dependency>
Gradle Groovy
implementation 'com.github.michael-rapp:tries:1.0.0'
Gradle Kotlin
implementation("com.github.michael-rapp:tries:1.0.0")
Scala SBT
libraryDependencies += "com.github.michael-rapp" % "tries" % "1.0.0"
Groovy Grape
@Grapes(
  @Grab(group='com.github.michael-rapp', module='tries', version='1.0.0')
)
Apache Ivy
<dependency org="com.github.michael-rapp" name="tries" rev="1.0.0" />
Leiningen
[com.github.michael-rapp/tries "1.0.0"]
Apache Buildr
'com.github.michael-rapp:tries:jar:1.0.0'