Trie

General Purpose Trie Data Structure in Python

A Trie data structure for efficient pattern matching using regular expressions - up to 1000 times faster

A trie filled with words from several languages (English - en, German - de , French - fr, Spanish - es, Portuguese - pt)

An efficient C++ incremental parser for multi-choices grammars (generalization of the trie structure) with Python bindings.

Prefix Tree (trie) for manipulating CIDR sets

A minimal type-safe trie (prefix tree) implementation in Python.

Pure-Python radix tree implementation

Python library for tries with different grades of fastness.

A pure Python implementation of a trie with typing.

CIDR-Bottle is yet another Patricia Trie implementation, however this one is specifically designed for parsing and validating CIDRS in routing tables and ROAs.

CLI utility to operate on prefix trie

A pure python API for Trie data access

Python package for lexicon

Trie on RocksDB

Trie (prefix tree) implementation with some special features for e.g. bioinformatics

Super-fast, efficiently stored Trie for Python.

Hashed Trie data structure for faster memory efficient and fast keyword indexing and lookup

Super-fast, efficiently stored Trie for Python.

A trie structure supporting fuzzy string searches.

A thread safe implementation of a Trie.

Python Trie data structure for fast string lookups

A Trie implementation that manages not the single characters but treats its values as typical namespaces.

Python implementation of the Ethereum Trie structure

Python bindings for NodeTrie, a trie data structure library

CLI for communicating with a Trie hosted online

Fast prefix origin pair lookups

Cython wrapper for tkvdb radix trie key-value database

Fast, pure C trie

Fast and memory efficient Trie implementation for Python

A trie-like data structure that allows storing and searching data based on the longest matching prefix or suffix of a given string.

Python high performance TLD extract module based on a compressed trie with builtin python dict.

Implementation of the trie data structure

Pure Python implementation of DARTS (Double ARray Trie System)

Get repeated capture groups, search without having to fear Exceptions in any df/Series, convert results to appropriate dtypes, use fast Trie regex

Python binding of cedar (implementation of efficiently-updatable double-array trie) using Cython

A Package for a trie class that autocompletes words

Fast and flexible search in a dictionary using Levenshtein distance

Transform trie to regular expression

Tries with byte sequences as keys for Python and Rust

A Radix Tree based router for HTTP and other routing needs with support for middlewares and endpoints with a Cython boost

A simlpe Merkle Patricia Trie implementation

tricli manages a trie data structure that can be globally accessed.

Python datastructures package

An efficient data structure for handling a large number of IP addresses/subnets in a hierarchy.

A pure Python implementation of the trie data structure.

Efficient trie for storing and searching phrases.

A pure Python implementation of the trie data structure.

A database that supports fast autocomplete. Implemented using a trie.

An autocomplete program that gives suggestions