FenwickTree: Data structure for fast query and update of cumulative sums
Fenwick trees are a O(log N) data structure for updating cumulative sums. This implementation comes with an operation to find a least element for which real-valued cumulative sum reaches certain value, and allows for storage of arbitrary information in the nodes.
[Skip to Readme]
Downloads
- FenwickTree-0.1.2.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1, 0.1.1, 0.1.2, 0.1.2.1 |
|---|---|
| Change log | changelog |
| Dependencies | base (>=4.0 && <5), QuickCheck (>=2.5.0.0), template-haskell [details] |
| Tested with | ghc ==7.8.4 |
| License | BSD-3-Clause |
| Copyright | Copyright by Michal J. Gajda '2013 |
| Author | Michal J. Gajda |
| Maintainer | mjgajda@googlemail.com |
| Category | Data Structures |
| Home page | https://github.com/mgajda/FenwickTree |
| Bug tracker | mailto:mjgajda@googlemail.com |
| Source repo | head: git clone git://github.com:mgajda/FenwickTree.git |
| Uploaded | by MichalGajda at 2015-03-19T11:55:19Z |
| Distributions | LTSHaskell:0.1.2.1, NixOS:0.1.2.1, Stackage:0.1.2.1 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 5068 total (6 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Readme for FenwickTree-0.1.2.1
[back to package description]FenwickTree
Fenwick trees are a O(log N) data structure for updating cumulative sums. This implementation comes with an operation to find a least element for which real-valued cumulative sum reaches certain value, and allows for storage of arbitrary information in the nodes.
Official releases are on Hackage.
This package is also a part of Stackage - a stable subset of Hackage.