FenwickTree 0.1.1 → 0.1.2

raw patch · 3 files changed

+19/−11 lines, 3 filesdep ~base

Dependency ranges changed: base

Files

• FenwickTree.cabal +4/−4
• README +0/−7
• README.md +15/−0

@@ -1,5 +1,5 @@ name:           FenwickTree-version:        0.1.1+version:        0.1.2 stability:      alpha homepage:       https://github.com/mgajda/FenwickTree package-url:    http://hackage.haskell.org/package/FenwickTree@@ -19,8 +19,8 @@  build-type:     Simple cabal-version:  >=1.8-tested-with:    GHC==7.4.2-data-files:     README+tested-with:    GHC==7.4.2,GHC==7.6.3,GHC==7.8.3+data-files:     README.md  source-repository head   type:     git@@ -28,7 +28,7 @@  Library   ghc-options:      -fspec-constr-count=4 -O3 -  build-depends:    base>=4.0, base <4.8, template-haskell, QuickCheck >= 2.5.0.0+  build-depends:    base>=4.0, base <4.9, template-haskell, QuickCheck >= 2.5.0.0   other-extensions: ScopedTypeVariables   exposed-modules:  Data.Tree.Fenwick   exposed:          True

@@ -1,7 +0,0 @@-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 

@@ -0,0 +1,15 @@+FenwickTree+===========++[![Build Status](https://api.travis-ci.org/mgajda/FenwickTree.png?branch=master)](https://travis-ci.org/mgajda/FenwickTree)++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](http://en.wikipedia.org/wiki/Fenwick_tree).++Official releases are on [Hackage](http://hackage.haskell.org/package/FenwickTree).++This package is also a part of [Stackage](http://daniel-diaz.github.io/stackagelist/) - a stable subset of Hackage.