Fast and simple SumTree implementation in Rust
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.5.tar.gz
(6.8 kB
view hashes)
Built Distribution
Close
Hashes for sumtree-0.1.5-cp38-cp38-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | ec137d33b56ccb6d9b0935ed935ab3969e525e08b420c50003820930373f4fba |
|
MD5 | 19ddaa1724585b7dd5d45e2e642facb7 |
|
BLAKE2b-256 | 16cb2ffca43287c3567f7a6f8cbc9926ed2388fff039baeff93970fb8df8d088 |