The FenwickTree package

[Tags: bsd3, library]

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

Versions0.1, 0.1.1, 0.1.2, 0.1.2.1
Change logNone available
Dependenciesbase (>=4.0 && <4.7), QuickCheck (>=2.5.0.0), template-haskell [details]
LicenseBSD3
CopyrightCopyright by Michal J. Gajda '2013
AuthorMichal J. Gajda
Maintainermjgajda@googlemail.com
Stabilityalpha
CategoryData Structures
Home pagehttps://github.com/mgajda/FenwickTree
Bug trackermailto:mjgajda@googlemail.com
Source repositoryhead: git clone git://github.com:mgajda/FenwickTree.git
UploadedSat Feb 9 12:18:46 UTC 2013 by MichalGajda
DistributionsLTSHaskell:0.1.2.1, Stackage:0.1.2.1
Downloads984 total (50 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

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