A prefix tree (trie) implementation in go
-
Updated
Jul 13, 2024 - Go
A prefix tree (trie) implementation in go
Knowledge graph of the English language between 1800 and 2019 using open source data, Python 3, and ffmpeg.
A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
Raku package with functions for creation and manipulation of tries (prefix trees) with frequencies
Bartez is a crossword generator written in Python using networkx
Prefix Trie data structure with Pattern Matching, in Rust
Realization of the prefix tree
Standard and compressed (radix) tries for TypeScript, behind one interface: sets and maps of strings with prefix search. find(prefix) returns every word under a prefix without reading the rest. The other methods follow Set and Map: add() or set(), has(), delete() and iteration.
Correctness-fixed Rust/PyO3 flat-array DFA prefix cache — rewrite of BCR-memory v1 with regression tests for four bugs and an SGLang/vLLM head-to-head harness.
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.
data structure libraries for Java
Constrained decoding engine and JSON Schema to GBNF compiler for local LLM gateways with sub-millisecond logit masking
Prefix Trie data structure with Pattern Matching, in C++
A program that finds all possible words for a sequence of numbers. Grad Algorithms (CSCD 501)
Interactive CLI for newspaper restoration using prefix tries, wildcard/best-match recovery, advanced patterns, edit-distance search, visualization, and 17 tests.
To associate your repository with the prefix-trie topic, visit your repo's landing page and select "manage topics."