Skip to content

Fix benchmarks build error with ghc 9.12 #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
bokesan merged 1 commit into from
Jun 5, 2026
Merged

Fix benchmarks build error with ghc 9.12 #12

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions .gitignore
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,3 +13,4 @@
/cabal.project.local
/doc/
bench*.html
.aider*
4 changes: 2 additions & 2 deletions IntervalMap.cabal
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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
Expand All @@ -12,7 +12,7 @@ Copyright: 2011-2026 Christoph Breitkopf
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.
Expand Down
4 changes: 2 additions & 2 deletions bench/RBColorIntBase.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,7 @@ module RBColorIntBase (

) 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(..), (<$>))
Expand Down Expand Up @@ -423,7 +423,7 @@ data T2 a b = T2 !a !b
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
Expand Down
1 change: 1 addition & 0 deletions changelog
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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'
Expand Down
Loading