@hackage FenwickTree0.1.1

Data structure for fast query and update of cumulative sums

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: http://en.wikipedia.org/wiki/Fenwick_tree