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

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

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]

Modules

[Index]

Data
- Tree
  - Data.Tree.Fenwick

Downloads

FenwickTree-0.1.1.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

MichalGajda

For package maintainers and hackage trustees

edit package information

Candidates

0.1.1

Versions [RSS]	0.1, 0.1.1, 0.1.2, 0.1.2.1
Dependencies	base (>=4.0 && <4.8), QuickCheck (>=2.5.0.0), template-haskell [details]
Tested with	ghc ==7.4.2
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:23Z
Distributions	LTSHaskell:0.1.2.1, NixOS:0.1.2.1, Stackage:0.1.2.1
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	5033 total (12 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Successful builds reported [all 2 reports]

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