Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
-
Updated
Mar 25, 2023 - C
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
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
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.
low-level, primitive autocomplete using trie data structure
A Mini Search Engine in C++, using an inverted index and a trie.
A Trie and DAFSA visualizer
A real-time suggestion service, which enable users to search for known and frequently searched terms.
extensible, high-performance configuration management library, optimized for hierarchical data
Efficient typo-tolerant search in 76 lines of code, with no dependencies.
autocomplete text app with cpp GUI QT
Given replace map, we can replace all the correspond words in input file without wrong twice replace.
Fast Succinct Trie for Go. Support Marshalling
A multilingual, blazingly fast, offline dictionary for CS163 Final Project
Implementation of the Autosuggest feature using Trie Data structure
DataBase Management Project based on Näive & Advanced Searching Techniques
Add a description, image, and links to the trie-structure topic page so that developers can more easily learn about it.
To associate your repository with the trie-structure topic, visit your repo's landing page and select "manage topics."