Skip to content
Data structure for fast query and update of cumulative sums in Haskell.
Haskell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Data/Tree
tests
.gitignore
.travis.yml
FenwickTree.cabal
LICENSE
README.md
Setup.hs
changelog

README.md

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.

You can’t perform that action at this time.