Python library for tries with different grades of fastness
The most notable benefit of X-fast and Y-fast tries compared to more common data structures such as binary search trees is that searches are log-logarithmic in the cardinality of the universe as opposed to being logarithmic in the number of elements in the structure itself; For reference if you needed to store 2^20 items with a potential maximum value of 2^32 - 1, finding a particular item would take 20 operations in a red/black or AVL tree, but only 5 with an X-fast or Y-fast trie.
The interfaces of the X-fast and Y-fast tries are identical, the Y-fast trie is used here as an example.
>>> from py_fast_trie import YFastTrie >>> t = YFastTrie(max_length=32) # The library defaults to the machine's word size >>> for i in range(10, 13): ... t += i # Value insertion/removal operations have intuitive >>> t.min # shorthands 10 >>> t += b'\x0d' # The library can handle byte strings less than the >>> t.max # max length by treating them as integers 13 >>> for val in t: ... print val 10 11 12 13 >>> t < 12 # Predecessor/successor queries have intuitive 11 # shorthands >>> t > 0 10 t -= 13 >>> t > 12 >>>
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size py_fast_trie-2.0.1-py3-none-any.whl (14.7 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size py-fast-trie-2.0.1.tar.gz (19.6 kB)||File type Source||Python version None||Upload date||Hashes View|
Hashes for py_fast_trie-2.0.1-py3-none-any.whl