pydatastructs Goto Github PK

aatree

AA trees for Python

aho-corasick

https://hkn.eecs.berkeley.edu/~dyoo/python/ahocorasick/

automata

avl

AVL C-implementation and Python extension by Sam Rushing et al.

btree

A BTree implementation as a python C extension

chartrie

Pure C character trie implementation, wrapped into python extension

ctst

A plain C implementation of the Ternary Search Tree structure with Ruby bindings

dablooms

scaling, counting, bloom filter library

datrie

Super-fast, efficiently stored Trie for Python. Uses libdatrie.

dawg

DAWG-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.

hashes

A collection of fast non-standard hash data structures for Python.

hat-trie

HAT-Trie for Python

lists

A collection of fast non-standard linear data structures for Python.

marisa-trie

Static memory-efficient Trie-like structures for Python (2.x and 3.x). Uses marisa-trie C++ library.

pybloomfiltermmap

Fast Python Bloom Filter using Mmap

pysuffix

pytrie

Trie implementation in pure Python.

pytst

C++ Ternary Search Tree implementation with Python bindings

ropes

A binary tree-based data structure for efficiently storing and manipulating a very long string

suffixtree

Danny Yoo's Suffix tree Python wrapper on Gusfield's strmat

suffixtree-1

Continuation of Danny Yoo's SuffixTree and SubstringDict

trees

Various tree structures for Python

tries

Various Trie data structures for Python