Results for array_trie

Double array trie implementation of rust

Yada is a yet another double-array trie library aiming for fast search and compact data representation.

Yada is a yet another double-array trie library aiming for fast search and compact data representation. This fork added a tokenization function

A char-wise Double-Array Trie with zero dependencies

A double array trie, A Forward Maximum Matching Searcher.

efficiently-updatable double-array trie in Rust (ported from cedar)

Levenshtein/Universal Automata for approximate string matching using various dictionary backends

efficiently-updatable double-array trie in Rust (ported from cedar)

A fast, compact double-array trie with `no_std` + `alloc` support. Fork of [yada](https://crates.io/crates/yada) providing O(key-length) exact-match and common-prefix search over a flat, cache-friendly byte buffer (4 bytes per node).

This crate provides double-array construction and search functions.

A trie library implemented with a double array

Rust binding of a clone of Darts (Double-ARray Trie System)