accumulation-tree
Red/black tree with support for fast accumulation of values in a key range
Decision gist · record as of 2026-08-14
Yes, if you need fast range aggregations on sorted data and are comfortable with high install friction from a source distribution. The dormant maintenance status (last release 687 days ago) and lack of active development are acceptable for a stable, narrow-purpose data structure with no known vulnerabilities, but expect no updates or support for new Python versions.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Source distribution (.tar.gz); may require a C compiler and build tools to install.
- High install friction from a source distribution with no runtime dependencies.
- Maintenance is dormant—last release was 687 days ago, though the repository remains active with a recent commit on 2024-09-26.
License · maintenance · safety
MIT License (permissive) — MIT License (permissive) places no restrictions on use, modification, or distribution in commercial or private projects.
last release 2024-09-26 (687 days) · last repo commit 2024-09-26 · 18 stars
0 known vulnerabilities (OSV.dev, 2026-08-14) · 231,465 downloads/mo, #9,086 on PyPI
Alternatives
Verify before relying
from accumulation_tree import AccumulationTree
t = AccumulationTree(lambda x: x)
for x in range(10000):
t.insert(x, x)
result = t.get_accumulation(0, 5)- Whether the package requires a C compiler or build tools to install from source
- Actual Python version compatibility beyond the classifiers (2 and 3 listed but requires_python unspecified)
- Performance characteristics and memory overhead compared to alternatives like Fenwick trees
What it is and what it does
AccumulationTree is a red/black binary search tree variant that maintains partial aggregations (sums, products, or other reductions) at each node. This design allows range queries—asking for the accumulated value across all keys between two bounds—to complete in O(log N) time instead of requiring a linear scan. The package is similar in purpose to a Fenwick tree but uses explicit heap-allocated nodes rather than an implicit array-based structure.
The package was originally written for use in tdigest and borrows implementation details from bintrees. It accepts a user-supplied aggregation function (e.g., `lambda x: x` for summation) and supports insertion and range accumulation queries. No external runtime dependencies are required, making it a lightweight addition to projects that need fast range aggregations on sorted data.
Use it for
- Computing cumulative sums over ranges of time-series data in O(log N) time
- Building digest or histogram structures that need efficient percentile or range-based statistics
- Implementing range queries in sorted key-value stores without scanning all intermediate values
- Aggregating metrics or measurements across time windows in monitoring or analytics pipelines
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, if you need fast range aggregations on sorted data and are comfortable with high install friction from a source distribution.
The dormant maintenance status (last release 687 days ago) and lack of active development are acceptable for a stable, narrow-purpose data structure with no known vulnerabilities, but expect no updates or support for new Python versions.
Install
accumulation-tree on PyPI
Before you install
High install friction from a source distribution with no runtime dependencies. Maintenance is dormant—last release was 687 days ago, though the repository remains active with a recent commit on 2024-09-26.
Source distribution (.tar.gz); may require a C compiler and build tools to install.
License in practice
MIT License (permissive) places no restrictions on use, modification, or distribution in commercial or private projects.
Quickstart
from accumulation_tree import AccumulationTree
t = AccumulationTree(lambda x: x)
for x in range(10000):
t.insert(x, x)
result = t.get_accumulation(0, 5)Verify before relying
- Whether the package requires a C compiler or build tools to install from source
- Actual Python version compatibility beyond the classifiers (2 and 3 listed but requires_python unspecified)
- Performance characteristics and memory overhead compared to alternatives like Fenwick trees
Package facts
| License | MIT License permissive |
| Python support | Not specified |
| Install friction | High. Source build required |
| Runtime dependencies | None |
| Maintenance | Dormant 687 days since the last release |
| Last repo commit | |
| First released | |
| Downloads | 231,465 / month, #9,086 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | Development Status :: 5 - Production/StableLicense :: OSI Approved :: MIT LicenseProgramming Language :: PythonProgramming Language :: Python :: 2Programming Language :: Python :: 3Topic :: Scientific/Engineering |
Evidence: accumulation_tree-0.6.4.tar.gz
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “range sum query data structure”
- accumulation-treeImplements a red/black tree that stores partial aggregations at each…
- sumtypesProvides algebraic data types for Python, specifically sum types…
- intervaltreeA self-balancing interval tree data structure that stores and queries…
Give your agent the search over MCP, or paste the wish link into any chat.
More Scientific/Engineering packages
NumPy provides an N-dimensional array object and a comprehensive suite of mathematical, linear algebra, Fourier transform, and random number functions for scientific computing in Python.
pandas provides fast, flexible data structures (Series and DataFrame) for loading, cleaning, transforming, and analyzing labeled or relational data in Python.
scipy provides numerical algorithms for mathematics, science, and engineering—including optimization, integration, linear algebra, Fourier transforms, signal and image processing, and ODE solvers—built on numpy arrays.
scikit-learn provides a comprehensive Python library for supervised and unsupervised machine learning, including classification, regression, clustering, dimensionality reduction, and model evaluation tools built on NumPy and SciPy.
Install it if you need to train, evaluate, or deploy supervised or unsupervised learning models.
dill extends Python's pickle module to serialize and deserialize a much wider range of Python objects, including functions, lambdas, classes, and interpreter sessions, to byte streams for storage or network transmission.
Multiprocess is an enhanced fork of Python's standard multiprocessing library that uses dill for better serialization, allowing you to spawn processes with a threading-like API and share complex objects between them.
Install it if you use multiprocessing and encounter pickle serialization limits with lambdas or complex objects.
See also red-black-tree-mod · flox · dask-expr · tdigest · fastdigest · nutree · django-tree-queries · bc-jsonpath-ng · treelib · pytest-harvest