Data structure for fast query and update of cumulative sums in Haskell.
Haskell
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
Data/Tree Removed unnecessary LANGUAGE BangPatterns pragma. Feb 9, 2013
tests
.gitignore
.travis.yml Do not allow failure for 7.4.2, since it works. Dec 29, 2014
FenwickTree.cabal Bump dependencies for GHC 7.10 Mar 19, 2015
LICENSE Fenwick tree draft API. Feb 3, 2013
README.md
Setup.hs Cabal cleanup, added Setup.hs. Feb 3, 2013
changelog Added change log. Dec 29, 2014

README.md

FenwickTree

Build Status

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 description on Wikipedia.

Official releases are on Hackage.

This package is also a part of Stackage - a stable subset of Hackage.