Typed mutable SSZ views over cached and immutable binary merkle trees
Pure Python 3 Merkle Patricia Trie implementation
CLI to host Trie Server
A database that supports fast autocomplete. Implemented using a trie.
High performance Trie and Ahocorasick automata (AC automata) for python
Client to access server Trie
Programmatically generate a trie representing a section of the filesystem, closely matching what the UNIX `tree` command outputs.
Trie implementation for approximate string matching.
Miscelaneous data containers and utilities: A versioned dictionary, a bidirectional dictionary, a binary tree backed dictionary, a Grouper iterator mapper similar to itertools.tee, and an easy extractor from dictionary key/values to variables
A small harness for evaluating OpenAI-compatible inference endpoints with synthetic agentic workloads.
General Purpose Trie Data Structure in Python
Python library for tries with different grades of fastness.
A trie filled with words from several languages (English - en, German - de , French - fr, Spanish - es, Portuguese - pt)
Efficient trie for storing and searching phrases.
A simlpe Merkle Patricia Trie implementation
Python bindings for NodeTrie, a trie data structure library
A Rust-based n-gram trie library for Python
Python bindings for TCR trie search
Python implementation of the Ethereum Trie structure
A Trie data structure for efficient pattern matching using regular expressions - up to 1000 times faster
Compact, read-only nested dictionary backed by a DAWG-style radix trie
UNKNOWN
A minimal type-safe trie (prefix tree) implementation in Python.
Pure Python implementation of DARTS (Double ARray Trie System)
A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string.
A thread safe implementation of a Trie.
Implementation of the trie data structure
Radix tree implementation
Collection of various string algorithms, including KMP, Aho-Corasick, Trie, SuffixArrays
CLI utility to operate on prefix trie
A fast and efficient trie-based collection for storing and searching millions of strings.
Python Trie data structure for fast string lookups
Flat-packed memory-efficient prefix trie
High-performance adaptive radix tree (ART) for Python with prefix queries and fuzzy search
Hashed Trie data structure for faster memory efficient and fast keyword indexing and lookup
A self-compressing, dependency-free radix trie
A Trie implementation that manages not the single characters but treats its values as typical namespaces.
Fast, pure C trie
Trie (prefix tree) implementation with some special features for e.g. bioinformatics
A trie structure supporting fuzzy string searches.
Super-fast, efficiently stored Trie for Python.
pyahocorasick is a fast and memory efficient library for exact or approximate multi-pattern string search. With the ``ahocorasick.Automaton`` class, you can find multiple key string occurrences at once in some input text. You can use it as a plain dict-like Trie or convert a Trie to an automaton for efficient Aho-Corasick search. And pickle to disk for easy reuse of large automatons. Implemented in C and tested on Python 3.6+. Works on Linux, macOS and Windows. BSD-3-Cause license.
Dane SGJP dla polish-inflection: indeksy rzeczowników (odmien/podaj) + zbiór baz przymiotników (marisa-trie). Wersja = edycja SGJP.
Super-fast, efficiently stored Trie for Python.
A pure Python implementation of a trie with typing.