extensible, high-performance configuration management library, optimized for hierarchical data
-
Updated
Jun 6, 2024 - Go
extensible, high-performance configuration management library, optimized for hierarchical data
Tree and Graph Data Structure
Efficient typo-tolerant search in 76 lines of code, with no dependencies.
Generic prefix tree for golang
Word processing engine built with trie data structure
Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes
Simple Trie Structure implementation in C++
Data Structures and Algorithms
A project for auto complete suggestion using trie data structure and debouncing useDebounce hook
A Double-array trie structure
A versatile and user-friendly text editor built in Java using Swing. This editor offers a range of features, from basic file operations to advanced text formatting and real-time spell-checking.
Fast Succinct Trie for Go. Support Marshalling
A Trie and DAFSA visualizer
Autocompletion Functionality
Word searching application written in python using the trie data structure
Trie base class and derived classes (TStringHashTrie, TIntegerHashTrie). A high performance and low memory footprint Dictionary set of classes
T9 Keyboard controled by numpad keyboard buttons
A multilingual, blazingly fast, offline dictionary for CS163 Final Project
Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
A simple Trie implementation in C with and without Hashing (WIP)
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."