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.


Properties

Versions0.1, 0.1.1
Dependenciesbase (>=4.0 && <4.8), QuickCheck (>=2.5.0.0), template-haskell
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
Upload dateMon Dec 9 15:10:23 UTC 2013
Uploaded byMichalGajda
Downloads193 total (46 in last 30 days)

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees