IntervalMap 0.3.0.1 → 0.3.0.2

raw patch · 2 files changed

+7/−5 lines, 2 filesdep ~criterionPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: criterion

API changes (from Hackage documentation)

Files

• IntervalMap.cabal +4/−4
• examples/Example.lhs +3/−1

@@ -1,5 +1,5 @@ Name:                IntervalMap-Version:             0.3.0.1+Version:             0.3.0.2 Stability:           experimental Synopsis:            Maps from Intervals to values, with efficient search. Homepage:            http://www.chr-breitkopf.de/comp/IntervalMap@@ -12,7 +12,7 @@ Category:            Data Build-type:          Simple Cabal-version:       >= 1.8-Tested-With:         GHC==7.4.2, GHC==7.0.4, GHC==6.12.1+Tested-With:         GHC==7.6.3, GHC==7.4.2, GHC==7.0.4, GHC==6.12.1 Description:                      A map from intervals to values, with efficient search                      for all keys containing a point or overlapping an interval.@@ -52,9 +52,9 @@   main-is:            BenchAll.hs   Build-depends:      base >= 4 && < 5,                       containers, random, deepseq,-                      criterion >= 0.6 && < 0.7+                      criterion >= 0.6   ghc-options: -Wall  source-repository head   type:     darcs-  location: http://www.chr-breitkopf.de/repos/IntervalMap+  location: http://hub.darcs.net/bokesan/IntervalMap

@@ -1,5 +1,7 @@+<h1>IntervalMap usage example</h2>+ In this example I use an IntervalMap to store a set of appointments.-The appointments are for several people, so it's clear that they can overlap.+The appointments are for several people, so they can overlap.  This is a literate Haskell file, you can [download it](Example.lhs) and compile it with ghc or run in in ghci. You must first install IntervalMap, if you have not already done so: