diff options
author | Sergei Trofimovich <slyfox@gentoo.org> | 2017-07-01 19:23:07 +0100 |
---|---|---|
committer | Sergei Trofimovich <slyfox@gentoo.org> | 2017-07-01 19:23:45 +0100 |
commit | f12a95172b8c2d017b7916972fdb7f9e2bd7ca65 (patch) | |
tree | 23bf3aacd7a520507f25cea5c0174b39c2c6a902 /dev-haskell/vector-algorithms/files | |
parent | dev-ada/gnat_util: 2017 version is only compatible with gnat-gpl-2017 (diff) | |
download | gentoo-f12a95172b8c2d017b7916972fdb7f9e2bd7ca65.tar.gz gentoo-f12a95172b8c2d017b7916972fdb7f9e2bd7ca65.tar.bz2 gentoo-f12a95172b8c2d017b7916972fdb7f9e2bd7ca65.zip |
dev-haskell/vector-algorithms: fix test on ghc-8, bug #623326
Reported-by: Toralf Förster
Bug: https://bugs.gentoo.org/623326
Package-Manager: Portage-2.3.6, Repoman-2.3.2
Diffstat (limited to 'dev-haskell/vector-algorithms/files')
-rw-r--r-- | dev-haskell/vector-algorithms/files/vector-algorithms-0.7.0.1-ghc-8.0.2_rc1.patch | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/dev-haskell/vector-algorithms/files/vector-algorithms-0.7.0.1-ghc-8.0.2_rc1.patch b/dev-haskell/vector-algorithms/files/vector-algorithms-0.7.0.1-ghc-8.0.2_rc1.patch new file mode 100644 index 000000000000..3616dd76d82c --- /dev/null +++ b/dev-haskell/vector-algorithms/files/vector-algorithms-0.7.0.1-ghc-8.0.2_rc1.patch @@ -0,0 +1,44 @@ +diff --git a/tests/properties/Tests.hs b/tests/properties/Tests.hs +index a0b7d35..8fcfd36 100644 +--- a/tests/properties/Tests.hs ++++ b/tests/properties/Tests.hs +@@ -1,2 +1,2 @@ +-{-# LANGUAGE ImpredicativeTypes, RankNTypes, TypeOperators, FlexibleContexts #-} ++{-# LANGUAGE ImpredicativeTypes, RankNTypes, TypeOperators, FlexibleContexts, ScopedTypeVariables #-} + +@@ -44,4 +44,4 @@ args = stdArgs + +-check_Int_sort = forM_ algos $ \(name,algo) -> +- quickCheckWith args (label name . prop_fullsort algo) ++check_Int_sort = forM_ algos (\(name,algo :: Algo Int ()) -> ++ quickCheckWith args (label name . prop_fullsort algo)) + where +@@ -55,4 +55,4 @@ check_Int_sort = forM_ algos $ \(name,algo) -> + +-check_Int_partialsort = forM_ algos $ \(name,algo) -> +- quickCheckWith args (label name . prop_partialsort algo) ++check_Int_partialsort = forM_ algos (\(name,algo :: SizeAlgo Int ()) -> ++ quickCheckWith args (label name . prop_partialsort algo)) + where +@@ -63,4 +63,4 @@ check_Int_partialsort = forM_ algos $ \(name,algo) -> + +-check_Int_select = forM_ algos $ \(name,algo) -> +- quickCheckWith args (label name . prop_select algo) ++check_Int_select = forM_ algos (\(name,algo :: SizeAlgo Int ()) -> ++ quickCheckWith args (label name . prop_select algo)) + where +@@ -119,10 +119,10 @@ check_permutation = do + qc $ label "introsort" . prop_permutation (INT.sort :: Algo Int ()) +- qc $ label "intropartial" . prop_sized (const . prop_permutation) ++ qc $ label "intropartial" . prop_sized (\x -> const (prop_permutation x)) + (INT.partialSort :: SizeAlgo Int ()) +- qc $ label "introselect" . prop_sized (const . prop_permutation) ++ qc $ label "introselect" . prop_sized (\x -> const (prop_permutation x)) + (INT.select :: SizeAlgo Int ()) + qc $ label "heapsort" . prop_permutation (H.sort :: Algo Int ()) +- qc $ label "heappartial" . prop_sized (const . prop_permutation) ++ qc $ label "heappartial" . prop_sized (\x -> const (prop_permutation x)) + (H.partialSort :: SizeAlgo Int ()) +- qc $ label "heapselect" . prop_sized (const . prop_permutation) ++ qc $ label "heapselect" . prop_sized (\x -> const (prop_permutation x)) + (H.select :: SizeAlgo Int ()) |