FenwickTree: Data structure for fast query and update of cumulative sums

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] [Publish]

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.1, 0.1.2, 0.1.2.1
Change log None available
Dependencies base (>=4.0 && <4.8), QuickCheck (>=2.5.0.0), template-haskell [details]
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 2013-12-09T15:10:05Z

Modules

Downloads

Maintainer's 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