FenwickTree

Data structure for fast query and update of cumulative sums

https://github.com/mgajda/FenwickTree

Version on this page:0.1.1
LTS Haskell 23.21:0.1.2.1
Stackage Nightly 2025-05-06: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.1@sha256:a2a2a7ce2def2ac0a893458d35cad7a853053ac57f0b42894d054ace95a66b5d,1508

Module documentation for 0.1.1

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

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.