Trie

Legacy AO JDBC connection pool.

Sonatype helps open source projects to set up Maven repositories on https://oss.sonatype.org/

Fail-fast JDBC wrapper.

Web resource management in a JSP environment.

The Datatable autocomplete project provides a Trie datastructure that allows AJAX searches on large datasets fast. It is not memory efficient but it is fast especially to know how many results a given prefix matches. Provides a Datatable component when tied to a textfield will show the matched objects in a table format.

WebJar for trie-search-js

Collection of helpful Artifacts and Utilities

Patricia Merkle Trie implementations.

Lightning Fast Java Map implementation

double array trie

Comparable CIDR and IP types, and a Trie collection for suffix, prefix, and longest prefix matching

regexp-trie

Spring Cloud Netflix Zuul Trie Matcher

WebJar for digits-trie

This module contains Fluo stress tests. Stress tests are different than integration tests in that they are designed to run on a cluster while integration tests only run on MiniFluo in a local environment. This module produces the jar needed to run a stress test on a cluster. Currently, this module only has one stress test (the Trie test) but other tests could be added to this module in the future.

WebJar for persistent-hash-trie

Trie Data Structure for high-performance String search and filtering

Scala implementation of a Burst Trie

Scala implementation of a Burst Trie

Scala implementation of a Burst Trie

Scala implementation of a Burst Trie

Scala implementation of a Burst Trie

A library of TRIE structure using Double-Array

Stemmer using a Trie, based on Egothor stemmer

A Java Implementation for a Double Array Trie.

Data structures for Java

Scala implementation of the Aho-Corasick algorithm for efficient longest keyword string matching

WebJar for trie-js

Simple Java library that implements trie data structure

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)

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

The nlp trie tree tool.

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

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

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

An implementation of IP radix trie.

RadixTree is an implementation of Radix Trie.