heaps 0.2.3 → 0.3.0.1
raw patch · 4 files changed
+24/−7 lines, 4 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
Files
- CHANGELOG.markdown +4/−0
- README.markdown +15/−0
- heaps.cabal +3/−4
- src/Data/Heap.hs +2/−3
+ CHANGELOG.markdown view
@@ -0,0 +1,4 @@+0.3.0.1+-------+* Nicer formatting of the haddocks+
+ README.markdown view
@@ -0,0 +1,15 @@+heaps+======++[](http://travis-ci.org/ekmett/heaps)++This package provides Brodal/Okasaki heaps. These are asymptotically optimal purely functional heaps.++Contact Information+-------------------++Contributions and bug reports are welcome!++Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.++-Edward Kmett
heaps.cabal view
@@ -1,5 +1,5 @@ name: heaps-version: 0.2.3+version: 0.3.0.1 license: BSD3 license-file: LICENSE author: Edward A. Kmett@@ -9,11 +9,11 @@ bug-reports: http://github.com/ekmett/heaps/issues category: Data Structures synopsis: Asymptotically optimal Brodal/Okasaki heaps.-description: Asymptotically optimal Brodal/Okasaki bootstrapped skew-binomial heaps from the paper \"Optimal Purely Functional Priority Queues\", extended with a Foldable interface.+description: Asymptotically optimal Brodal/Okasaki bootstrapped skew-binomial heaps from the paper <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.973 "Optimal Purely Functional Priority Queues">, extended with a 'Foldable' interface. copyright: (c) 2010 Edward A. Kmett build-type: Simple cabal-version: >=1.8-extra-source-files: .travis.yml+extra-source-files: .travis.yml CHANGELOG.markdown README.markdown source-repository head type: git@@ -39,4 +39,3 @@ if impl(ghc<7.6.1) ghc-options: -Werror hs-source-dirs: tests-
src/Data/Heap.hs view
@@ -20,9 +20,8 @@ -- The implementation of 'Heap' is based on /bootstrapped skew binomial heaps/ -- as described by: ----- * G. Brodal and C. Okasaki , \"/Optimal Purely Functional Priority Queues/\",--- /Journal of Functional Programming/ 6:839-857 (1996),--- <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.973>+-- * G. Brodal and C. Okasaki , <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.973 "Optimal Purely Functional Priority Queues">,+-- /Journal of Functional Programming/ 6:839-857 (1996) -- -- All time bounds are worst-case. -----------------------------------------------------------------------------