Trie

Welcome to coding in paradise!

A pure Python implementation of a trie with typing.

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

A fast and efficient trie-based collection for storing and searching millions of strings.

Flat-packed memory-efficient prefix trie

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

Pure Python implementation of DARTS (Double ARray Trie System)

Prefix Tree (trie) for manipulating CIDR sets

A pure python API for Trie data access

Storage string trie.

Python Trie data structure for fast string lookups

A self-compressing, dependency-free radix trie

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

CLI utility to operate on prefix trie

A thread safe implementation of a Trie.

Trie on RocksDB

A trie structure supporting fuzzy string searches.

Python package for lexicon

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

Implementation of the trie data structure

Fast and memory efficient Trie implementation for Python

DoubleArrayTrie(DAT) support prefix search & exact search & multiple pattern match for python implemented by c++

Python implementation of the Ethereum Trie structure

Fast, pure C trie

Fast prefix origin pair lookups

Cython wrapper for tkvdb radix trie key-value database

Super-fast, efficiently stored Trie for Python.

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

Pure-Python radix tree implementation

Super-fast, efficiently stored Trie for Python.

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

A Package for a trie class that autocompletes words

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

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

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

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

Python datastructures package

A pure Python prefix tree (trie) for fast in-memory prefix search and filtering

Radix tree implementation

AVL Tree, Interval Tree, Trie and More. All kinds of Trees implemented in python3.

Advanced data structures for Python.

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

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

Efficient trie for storing and searching phrases.

A pure Python implementation of the trie data structure.

A pure Python implementation of the trie data structure.

Fast and flexible search in a dictionary using Levenshtein distance

treg utilizes trie structured regex patterns to search texts for a potientially large number of words and phrases.