FenwickTree

Data structure for fast query and update of cumulative sums

https://github.com/mgajda/FenwickTree

Version on this page:0.1.2
LTS Haskell 24.18:0.1.2.1
Stackage Nightly 2025-11-01: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@sha256:c90a3b69ef145829be416c0ede4a9489960c5e73f2c05976eb8d7553a23a3cc5,1533

Module documentation for 0.1.2

  • Data
    • Data.Tree
      • Data.Tree.Fenwick

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.