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
indices, values = st.sample(10)
Updating data
from sumtree import SumTree
st = SumTree(1024)
for i in range(1024):
st.add(i)
# Set leaf 0 to value 40.
tree.update(0, 40.)
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.2.5.tar.gz
(11.9 kB
view hashes)
Built Distribution
Close
Hashes for sumtree-0.2.5-cp311-cp311-manylinux_2_28_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 84d80cd9b491f510c2b9e1a819455c2607d84192bdbd4990ddedb22e3c8aca09 |
|
MD5 | 7b96403e995dd7d6acc85ac44fca99d5 |
|
BLAKE2b-256 | 5dc49bf4bc736b1097ff1d62a91d763293ed2064a019ab9309300911e8f72edc |