The FenwickTree package

[Tags:bsd3, library, test]

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]

Properties

Versions 0.1, 0.1.1, 0.1.2, 0.1.2.1
Dependencies base (>=4.0 && <4.7), QuickCheck (>=2.5.0.0), template-haskell [details]
License BSD3
Copyright Copyright by Michal J. Gajda '2013
Author Michal J. Gajda
Maintainer mjgajda@googlemail.com
Stability alpha
Category Data Structures
Home page https://github.com/mgajda/FenwickTree
Bug tracker mailto:mjgajda@googlemail.com
Source repository head: git clone git://github.com:mgajda/FenwickTree.git
Uploaded Sat Feb 9 12:18:46 UTC 2013 by MichalGajda
Distributions LTSHaskell:0.1.2.1, NixOS:0.1.2.1, Stackage:0.1.2.1, Tumbleweed:0.1.2.1
Downloads 1232 total (6 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for FenwickTree

Readme for FenwickTree-0.1

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.

See:
http://en.wikipedia.org/wiki/Fenwick_tree