dev-haskell/bloomfilter: remove unused patch(es)

Package-Manager: Portage-3.0.6, Repoman-3.0.1
Signed-off-by: Michael Mair-Keimberger <m.mairkeimberger@gmail.com>
Signed-off-by: Sergei Trofimovich <slyfox@gentoo.org>

2 files changed, 0 insertions, 58 deletions

diff --git a/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-ghc-7.7.patch b/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-ghc-7.7.patch
deleted file mode 100644
index 899fb4176aa2..000000000000
--- a/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-ghc-7.7.patch
+++ /dev/null
@@ -1,46 +0,0 @@
-diff --git a/Data/BloomFilter.hs b/Data/BloomFilter.hs
-index 69711ef..97a8348 100644
---- a/Data/BloomFilter.hs
-+++ b/Data/BloomFilter.hs
-@@ -93,7 +93,8 @@ import Control.Monad (liftM, forM_)
- import Control.Monad.ST (ST, runST)
- import Control.DeepSeq (NFData(..))
- import Data.Array.Base (unsafeAt, unsafeRead, unsafeWrite)
--import Data.Array.ST (STUArray, thaw, unsafeFreeze)
-+import Data.Array.ST (STUArray, thaw)
-+import qualified Data.Array.Unsafe as U (unsafeFreeze)
- import Data.Array.Unboxed (UArray)
- import Data.Bits ((.&.), (.|.))
- import Data.BloomFilter.Array (newArray)
-@@ -336,7 +337,7 @@ notElemB elt ub = any test (hashesU ub elt)
- -- occur.  For a safer creation interface, use 'createB'.
- unsafeFreezeMB :: MBloom s a -> ST s (Bloom a)
- unsafeFreezeMB mb = B (hashMB mb) (shiftMB mb) (maskMB mb) `liftM`
--                    unsafeFreeze (bitArrayMB mb)
-+                    U.unsafeFreeze (bitArrayMB mb)
- 
- -- | Copy an immutable Bloom filter to create a mutable one.  There is
- -- no non-copying equivalent.
-diff --git a/Data/BloomFilter/Array.hs b/Data/BloomFilter/Array.hs
-index e085bbe..5accde9 100644
---- a/Data/BloomFilter/Array.hs
-+++ b/Data/BloomFilter/Array.hs
-@@ -3,7 +3,8 @@
- 
- module Data.BloomFilter.Array (newArray) where
- 
--import Control.Monad.ST (ST, unsafeIOToST)
-+import Control.Monad.ST (ST)
-+import qualified Control.Monad.ST.Unsafe as U (unsafeIOToST)
- import Data.Array.Base (MArray, STUArray(..), unsafeNewArray_)
- #if __GLASGOW_HASKELL__ >= 704
- import Foreign.C.Types (CInt(..), CSize(..))
-@@ -18,7 +19,7 @@ newArray :: forall e s. (MArray (STUArray s) e (ST s)) =>
- {-# INLINE newArray #-}
- newArray numElems numBytes = do
-   ary@(STUArray _ _ _ marr#) <- unsafeNewArray_ (0, numElems - 1)
--  _ <- unsafeIOToST (memset marr# 0 (fromIntegral numBytes))
-+  _ <- U.unsafeIOToST (memset marr# 0 (fromIntegral numBytes))
-   return ary
- 
- foreign import ccall unsafe "memset"
diff --git a/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-quickcheck-2.6.patch b/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-quickcheck-2.6.patch
deleted file mode 100644
index 0b27043aed2f..000000000000
--- a/dev-haskell/bloomfilter/files/bloomfilter-1.2.6.10-quickcheck-2.6.patch
+++ /dev/null
@@ -1,12 +0,0 @@
---- bloomfilter-1.2.6.10-orig/tests/QCSupport.hs	2012-06-16 09:59:56.000000000 +1000
-+++ bloomfilter-1.2.6.10/tests/QCSupport.hs	2012-07-14 19:00:06.035731133 +1000
-@@ -20,9 +20,6 @@
-     arbitrary = choose (epsilon, 1 - epsilon)
-         where epsilon = 1e-6 :: P
- 
--instance Arbitrary Ordering where
--    arbitrary = oneof [return LT, return GT, return EQ]
--
- -- For some reason, MIN_VERSION_random doesn't work here :-(
- #if __GLASGOW_HASKELL__ < 704
- integralRandomR :: (Integral a, RandomGen g) => (a, a) -> g -> (a, g)