name: FenwickTree
description: 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.
license_spdx: BSD-3-Clause
version: 0.1.2.1
spec_version: 1.0
download_url: http://hackage.haskell.org/package/FenwickTree-0.1.2.1/FenwickTree-0.1.2.1.tar.gz
home_url: 
                https://github.com/mgajda/FenwickTree
              
news_url: https://libraries.io/hackage/FenwickTree/versions.atom
date: 2015-03-19
about_resource: NONE
libraries_io_url: https://libraries.io/hackage/FenwickTree?number=0.1.2.1
vcs_tool: git
vcs_repository: https://github.com/mgajda/FenwickTree
vcs_branch: master
