FenwickTree

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

Stackage Nightly 2017-08-20:0.1.2.1
LTS Haskell 9.1:0.1.2.1
Stackage Nightly 2017-08-20:0.1.2.1
Latest on Hackage:0.1.2.1
BSD3 licensed by Michal J. Gajda
Maintained by mjgajda@googlemail.com

Module documentation for 0.1.2.1

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.

Changes

-*-Changelog-*-

0.1.2.1 Dec 2014
* GHC 7.10 release
Used by 1 package:
comments powered byDisqus