Trie

A lightweight, efficient, and idiomatic library providing Trie data structures for Kotlin Multiplatform

Simple Java library that implements trie data structure

WebJar for trie-js

Trie data structure for Scala.

Trie data structure for Scala.

A useful Tries data structure originated from Brian

Scala implementation of a Burst Trie

Scala implementation of a Burst Trie

Set of utilities in java: data structures (trie, b-star, octree) and search algorithms (a-star, genetic algorithm)

Module trie of shomei

A bit-alphabet based, space-optimized trie for string storage

The nlp trie tree tool.

Finite State Machine using the AhoCorasick implementation using a Double Array Trie, java 8+

ListSet classes, a fixed-size round-robin list, and a Trie

This plugin enables the Aho-Corasick TRIE building and dictionary recognition algorithm into Neo4j by modeling the resulting TRIE graph right into Neo4j.

High-performance JSON path extractor. Trie-based, single-pass, low-GC, multi-path extraction with stream processing support — optimized for large or streaming JSON.

An implementation of IP radix trie.

节点支持任意数据类型的前缀树组件 1.0.0.RELEASE 首个发布版本 1.0.1.RELEASE 解决树结构查询的小尾巴问题 1.0.2.RELEASE 字典支持删除 1.0.3.RELEASE 序列化方法优化 1.0.4.RELEASE 代码优化 1.0.5.RELEASE 项目依赖优化，支持零依赖 1.0.7.RELEASE 支持扩展自定义操作，优化查询api 1.0.8.RELEASE 支持自定义函数 1.1.0.RELEASE 支持字典树存储数据本身，提供更多的节点属性类型 1.1.1.RELEASE 修复between查询 1.1.2.RELEASE 支持自定义节点类型

RadixTree is an implementation of Radix Trie.