The FenwickTree package
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.
Properties
| Version | 0.1 |
|---|---|
| Dependencies | base (≥4.0 & <4.7), QuickCheck (≥2.5.0.0), template-haskell |
| License | BSD3 |
| Copyright | Copyright by Michal J. Gajda '2013 |
| Author | Michal J. Gajda |
| Maintainer | mjgajda@googlemail.com |
| Stability | alpha |
| Category | Data Structures |
| Home page | https://github.com/mgajda/FenwickTree |
| Bug tracker | mailto:mjgajda@googlemail.com |
| Source repository | git clone git://github.com:mgajda/FenwickTree.git |
| Upload date | Sat Feb 9 12:18:46 UTC 2013 |
| Uploaded by | MichalGajda |
| Built on | ghc-7.6 |
Modules
- Data
Downloads
- FenwickTree-0.1.tar.gz (Cabal source package)
- package description (included in the package)