IntervalMap 0.6.2.3 → 0.6.2.4

raw patch · 3 files changed

+5/−4 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• IntervalMap.cabal +2/−2
• bench/RBColorIntBase.hs +2/−2
• changelog +1/−0

@@ -1,5 +1,5 @@ Name:                IntervalMap-Version:             0.6.2.3+Version:             0.6.2.4 Stability:           experimental Synopsis:            Containers for intervals, with efficient search. Homepage:            https://www.chr-breitkopf.de/comp/IntervalMap@@ -12,7 +12,7 @@ Category:            Data Build-type:          Simple Cabal-version:       >= 1.10-Tested-With:         GHC ==8.0.2, GHC ==8.2.1, GHC ==8.4.1, GHC ==8.6.5, GHC ==8.8.3, GHC ==9.0.2, GHC ==9.6.7+Tested-With:         GHC ==8.0.2, GHC ==8.2.1, GHC ==8.4.1, GHC ==8.6.5, GHC ==8.8.3, GHC ==9.0.2, GHC ==9.6.7, GHC ==9.12.4 Description:                      Ordered containers of intervals, with efficient search                      for all keys containing a point or overlapping an interval.

@@ -64,7 +64,7 @@              ) where -import Prelude hiding (null, lookup, map, filter, foldr, foldl)+import Prelude hiding (Foldable(..), lookup, map, filter) import Data.Bits (shiftR, (.&.)) import Data.Monoid (Monoid(..)) import Control.Applicative (Applicative(..), (<$>))@@ -423,7 +423,7 @@ fromDistinctAscList :: (Interval k e) => [(k,v)] -> IntervalMap k v -- exactly 2^n-1 items have height n. They can be all black -- from 2^n - 2^n-2 items have height n+1. The lowest "row" should be red.-fromDistinctAscList lyst = case h (length lyst) lyst of+fromDistinctAscList lyst = case h (L.length lyst) lyst of                              (T2 result []) -> result                              _ -> error "fromDistinctAscList: list not fully consumed"   where

@@ -1,3 +1,4 @@+0.6.2.4  Fix build error of benchmarks with ghc 9.12 0.6.2.3  Fix benchmark broken by fingertree adding its own NFData instance 0.6.2.2  Remove SegmentTree from benchmarks because it does not compile with current ghc/cabal 0.6.2.1  Future-proof against potential Prelude.foldl'