Data structure for fast query and update of cumulative sums https://github.com/mgajda/FenwickTree

Version on this page:
LTS Haskell 11.1:
Stackage Nightly 2018-03-19:
Latest on Hackage:

See all snapshots FenwickTree appears in

BSD3 licensed by Michal J. Gajda
Maintained by mjgajda@googlemail.com

Module documentation for


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.


-*-Changelog-*- Dec 2014
* GHC 7.10 release
Depends on 3 packages:
Used by 1 package:
comments powered byDisqus