Algorithm to find the longest matching prefix for a binary string using a binary trie
-
Updated
Dec 10, 2023 - Rust
Algorithm to find the longest matching prefix for a binary string using a binary trie
This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.
Radix is an adaptive radix tree for in-memory database indexes.
An implementation of RadixTree data-structure, which is a great tool for indexing a large number of records with string keys.
a fast and light-weighted key-value store library
Implementation of Data Structures and Algorithms
🏃 🏃 🏃Somewhat fast, somewhat optimal Prefix Search in Go
An implementation of ternary tree for auto-completion
LexiSearch is an API for retrieving information in given datasets.
Trie Data structure and its Variants
Simple Prefix Binary Tree-based string search engine written in Rust.
Python bindings for NodeTrie, a prefix tree data structure library
Build an efficient and customized dictionary using modified TRIE data structure having substring search, sorting and autocomplete features from a file of words in C++.
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
This example project demonstrates a clean way to architect an Android application.
An efficient implementation of RNN-T Prefix Beam Search in C++/CUDA.
a fast and light-weighted key-value store library
PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete
Add a description, image, and links to the prefix-search topic page so that developers can more easily learn about it.
To associate your repository with the prefix-search topic, visit your repo's landing page and select "manage topics."