Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity

Generic prefix tree for golang

Missing Trie implementation for Go

Trie base class and derived classes (TStringHashTrie, TIntegerHashTrie). A high performance and low memory footprint Dictionary set of classes

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

A hash array mapped trie implementation in c.

Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes

extensible, high-performance configuration management library, optimized for hierarchical data

A small data structures library for JavaScript

A desktop scrabble app featuring an AI player which always plays the highest possible scoring word each turn.

A Trie and DAFSA visualizer

low-level, primitive autocomplete using trie data structure

A Mini Search Engine in C++, using an inverted index and a trie.

A real-time suggestion service, which enable users to search for known and frequently searched terms.

Fast Succinct Trie for Go. Support Marshalling

Efficient typo-tolerant search in 76 lines of code, with no dependencies.

Implementation of the Autosuggest feature using Trie Data structure

Given replace map, we can replace all the correspond words in input file without wrong twice replace.

C# implementation of a ternary search trie.

DataBase Management Project based on Näive & Advanced Searching Techniques