Fix warnings for redundant imports/bindings

Author: Bodigrim

benchmarks/haskell/Benchmarks/FileWrite.hs

@@ -15,11 +15,10 @@ module Benchmarks.FileWrite
 import Control.DeepSeq (NFData, deepseq)
 import Data.Bifunctor (first)
 import Data.List (intercalate, intersperse)
-import Data.Semigroup ((<>))
 import Data.String (fromString)
 import Data.Text (StrictText)
 import Data.Text.Internal.Lazy (LazyText, defaultChunkSize)
-import System.IO (Handle, Newline(CRLF,LF), NewlineMode(NewlineMode), BufferMode(NoBuffering,LineBuffering,BlockBuffering), hSetBuffering, hSetNewlineMode)
+import System.IO (Handle, Newline(CRLF,LF), NewlineMode(NewlineMode), BufferMode(..), hSetBuffering, hSetNewlineMode)
 import Test.Tasty.Bench (Benchmark, bgroup, bench, whnfAppIO)
 import qualified Data.Text as T
 import qualified Data.Text.IO as T
@@ -112,11 +111,15 @@ mkFileWriteBenchmarks mkSinkNRemove = do
 #endif
 
   where
-  lazy, lazyNewlines, lazySmallChunks, lazySmallChunksNewlines :: (String, StrictText -> LazyText)
+  lazy, lazyNewlines :: (String, StrictText -> LazyText)
   lazy                    = ("lazy",                            L.fromChunks . T.chunksOf defaultChunkSize)
   lazyNewlines            = ("lazy many newlines",              snd lazy . snd strictNewlines)
+
+#ifdef ExtendedBenchmarks
+  lazySmallChunks, lazySmallChunksNewlines :: (String, StrictText -> LazyText)
   lazySmallChunks         = ("lazy small chunks",               L.fromChunks . T.chunksOf 10)
   lazySmallChunksNewlines = ("lazy small chunks many newlines", snd lazySmallChunks . snd strictNewlines)
+#endif
 
   strict, strictNewlines :: (String, StrictText -> StrictText)
   strict                  = ("strict",                          id)

benchmarks/haskell/Benchmarks/Programs/Fold.hs

@@ -17,8 +17,9 @@ module Benchmarks.Programs.Fold
     ( benchmark
     ) where
 
-import Data.List (foldl')
+import Data.Foldable (Foldable(..))
 import Data.List (intersperse)
+import Prelude hiding (Foldable(..))
 import System.IO (Handle)
 import Test.Tasty.Bench (Benchmark, bench, whnfIO)
 import qualified Data.Text as T
@@ -29,16 +30,16 @@ import qualified Data.Text.Lazy.IO as TL
 
 benchmark :: FilePath -> Handle -> Benchmark
 benchmark i o =
-    bench "Fold" $ whnfIO $ T.readFile i >>= TL.hPutStr o . fold 80
+    bench "Fold" $ whnfIO $ T.readFile i >>= TL.hPutStr o . foldText 80
 
 -- | We represent a paragraph by a word list
 --
 type Paragraph = [T.Text]
 
 -- | Fold a text
 --
-fold :: Int -> T.Text -> TL.Text
-fold maxWidth = TLB.toLazyText . mconcat .
+foldText :: Int -> T.Text -> TL.Text
+foldText maxWidth = TLB.toLazyText . mconcat .
     intersperse "\n\n" . map (foldParagraph maxWidth) . paragraphs
 
 -- | Fold a paragraph

benchmarks/haskell/Benchmarks/ReadNumbers.hs

@@ -21,8 +21,9 @@ module Benchmarks.ReadNumbers
     , benchmark
     ) where
 
+import Data.Foldable (Foldable(..))
+import Prelude hiding (Foldable(..))
 import Test.Tasty.Bench (Benchmark, bgroup, bench, whnf)
-import Data.List (foldl')
 import qualified Data.Text as T
 import qualified Data.Text.IO as T
 import qualified Data.Text.Lazy as TL

benchmarks/haskell/Benchmarks/WordFrequencies.hs

@@ -13,9 +13,10 @@ module Benchmarks.WordFrequencies
     , benchmark
     ) where
 
-import Test.Tasty.Bench (Benchmark, bench, bgroup, whnf)
-import Data.List (foldl')
+import Data.Foldable (Foldable(..))
 import Data.Map (Map)
+import Prelude hiding (Foldable(..))
+import Test.Tasty.Bench (Benchmark, bench, bgroup, whnf)
 import qualified Data.Map as M
 import qualified Data.Text as T
 import qualified Data.Text.IO as T