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

Latest on Hackage:

See all snapshots FenwickTree appears in

BSD-3-Clause licensed by Michal J. Gajda
Maintained by [email protected]

Module documentation for

This version can be pinned in stack with:[email protected]:edc00a594190e1c9381c0fd9ad5fd9d3530e64f92593f721173615113080a910,1519


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.