Red/black tree with support for fast accumulation of values in a key range
Project description
A red/black tree which also stores partial aggregations at each node, making getting aggregations of key range slices an O(log(N)) operation.
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
accumulation_tree-0.1.tar.gz
(46.4 kB
view details)
File details
Details for the file accumulation_tree-0.1.tar.gz.
File metadata
- Download URL: accumulation_tree-0.1.tar.gz
- Upload date:
- Size: 46.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 2fb3265792475f9388e0d2c8557774fb52560646db3acf82233eee92f241b157 |
|
| MD5 | adbd65ddae703885f623a2050c1b3432 |
|
| BLAKE2b-256 | 85f928c790117cf291d924f1ab634c5273574aee029145e02460c1fc48cb9b49 |
