11 packages found

A python implementation of the bloom filter used by Ethereum

Python implementation of the Ethereum Trie structure

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…

Immutable, structure sharing collections, including B-trees and S-trees (sequence trees)

Opencc4j is an opensource project for conversion between Traditional Chinese and Simplified Chinese, supporting character-level conversion, phrase-level conversion for java.

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

Radix tree implementation

Curated collection of data structures for the JavaScript/TypeScript.

Generate regular expressions that match a set of strings

Static memory-efficient and fast Trie-like structures for Python.