FenwickTree

Data structure for fast query and update of cumulative sums

LTS Haskell 23.18:	0.1.2.1
Stackage Nightly 2025-04-18:	0.1.2.1
Latest on Hackage:	0.1.2.1

See all snapshots FenwickTree appears in

BSD-3-Clause licensed by Michal J. Gajda

Maintained by [email protected]

This version can be pinned in stack with:FenwickTree-0.1.2.1@sha256:edc00a594190e1c9381c0fd9ad5fd9d3530e64f92593f721173615113080a910,1519

Module documentation for 0.1.2.1

Data
- Data.Tree
  - Data.Tree.Fenwick

Depends on 3 packages(full list with versions):

base, QuickCheck, template-haskell

FenwickTree

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.