Fast and simple SumTree implementation in Rust
Reason this release was yanked:
Bug in the add function when the tree is full
Project description
SumTree
This module contains a SumTree implementation in Rust with Python wrappers. Speedup is around 10x in comparison to an equivalent full Python implementation.
Check the project on github: https://github.com/yamoling/sumtree
Usage
Initialisation
from sumtree import SumTree
st = SumTree(1024)
st.add(10)
print(st.total) # 10
print(len(st)) # 1
print(st.capacity) # 1024
Sampling data
from sumtree import SumTree
st = SumTree(1024)
for i in range(1024):
st.add(i)
index, value = st.get(500)
print(index, value) # 32, 32.0
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
sumtree-0.1.4.tar.gz
(6.5 kB
view hashes)
Built Distribution
Close
Hashes for sumtree-0.1.4-cp38-cp38-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d12083ee338a8668450158498cb6c3d685772ea65104bb310cd575169ec27b70 |
|
MD5 | b88eb72af38fbff12efb6891e8544588 |
|
BLAKE2b-256 | 068dbcf7e4c53bb1e7c291275012fa263f9e949c2a2c7866920883fd722d6393 |