The FenwickTree package

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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.1, 0.1.2, 0.1.2.1
Change logNone available
Dependenciesbase (>=4.0 && <4.8), QuickCheck (>=2.5.0.0), template-haskell [details]
LicenseBSD3
CopyrightCopyright by Michal J. Gajda '2013
AuthorMichal J. Gajda
Maintainermjgajda@googlemail.com
CategoryData Structures
Home pagehttps://github.com/mgajda/FenwickTree
Bug trackermailto:mjgajda@googlemail.com
Source repositoryhead: git clone git://github.com:mgajda/FenwickTree.git
UploadedMon Dec 9 15:10:05 UTC 2013 by MichalGajda

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees


Readme for FenwickTree-0.1.1

[back to package description]
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