Apply a small fraction of hlint hints

6 files changed, 6 insertions, 10 deletions

diff --git a/bench/Main.hs b/bench/Main.hs
index 6148db9..b604eb9 100644
--- a/bench/Main.hs
+++ b/bench/Main.hs
@@ -51,7 +51,7 @@ main_tests = defaultMain
                       " str " ++ showSh (stridesOf inp1) ++ " " ++ showSh (stridesOf inp2)) $
                nf (\(a,b) -> rsumAllPrim (rdot1Inner a b)) (inp1, inp2)
 
-        iota n = riota @Double n
+        iota = riota @Double
     in
     [dotprodBench "dot 1D"
         (iota 10_000_000
diff --git a/src/Data/Array/Nested/Mixed.hs b/src/Data/Array/Nested/Mixed.hs
index a6e94b6..f59d58e 100644
--- a/src/Data/Array/Nested/Mixed.hs
+++ b/src/Data/Array/Nested/Mixed.hs
@@ -555,7 +555,7 @@ instance Elt a => Elt (Mixed sh' a) where
     = fst (shxSplitApp (Proxy @sh') (ssxFromShX sh) (mshape arr))
 
   mindex :: Mixed sh (Mixed sh' a) -> IIxX sh -> Mixed sh' a
-  mindex (M_Nest _ arr) i = mindexPartial arr i
+  mindex (M_Nest _ arr) = mindexPartial arr
 
   mindexPartial :: forall sh1 sh2.
                    Mixed (sh1 ++ sh2) (Mixed sh' a) -> IIxX sh1 -> Mixed sh2 (Mixed sh' a)
diff --git a/src/Data/Array/Nested/Mixed/Shape.hs b/src/Data/Array/Nested/Mixed/Shape.hs
index e63277f..852dd5e 100644
--- a/src/Data/Array/Nested/Mixed/Shape.hs
+++ b/src/Data/Array/Nested/Mixed/Shape.hs
@@ -590,7 +590,7 @@ instance (KnownNat n, KnownShX sh) => KnownShX (Just n : sh) where knownShX = SK
 instance KnownShX sh => KnownShX (Nothing : sh) where knownShX = SUnknown () :!% knownShX
 
 withKnownShX :: forall sh r. StaticShX sh -> (KnownShX sh => r) -> r
-withKnownShX k = withDict @(KnownShX sh) k
+withKnownShX = withDict @(KnownShX sh)
 
 
 -- * Flattening
diff --git a/src/Data/Array/Nested/Shaped/Shape.hs b/src/Data/Array/Nested/Shaped/Shape.hs
index ab16422..5f9ba79 100644
--- a/src/Data/Array/Nested/Shaped/Shape.hs
+++ b/src/Data/Array/Nested/Shaped/Shape.hs
@@ -1,12 +1,9 @@
 {-# LANGUAGE CPP #-}
 {-# LANGUAGE DataKinds #-}
-{-# LANGUAGE DeriveFoldable #-}
-{-# LANGUAGE DeriveFunctor #-}
 {-# LANGUAGE DeriveGeneric #-}
 {-# LANGUAGE DerivingStrategies #-}
 {-# LANGUAGE FlexibleInstances #-}
 {-# LANGUAGE GADTs #-}
-{-# LANGUAGE GeneralizedNewtypeDeriving #-}
 {-# LANGUAGE ImportQualifiedPost #-}
 {-# LANGUAGE NoStarIsType #-}
 {-# LANGUAGE PatternSynonyms #-}
@@ -370,7 +367,7 @@ instance KnownShS '[] where knownShS = ZSS
 instance (KnownNat n, KnownShS sh) => KnownShS (n : sh) where knownShS = natSing :$$ knownShS
 
 withKnownShS :: forall sh r. ShS sh -> (KnownShS sh => r) -> r
-withKnownShS k = withDict @(KnownShS sh) k
+withKnownShS = withDict @(KnownShS sh)
 
 shsKnownShS :: ShS sh -> Dict KnownShS sh
 shsKnownShS ZSS = Dict
diff --git a/src/Data/Array/Nested/Types.hs b/src/Data/Array/Nested/Types.hs
index df466cf..4444acd 100644
--- a/src/Data/Array/Nested/Types.hs
+++ b/src/Data/Array/Nested/Types.hs
@@ -6,7 +6,6 @@
 {-# LANGUAGE PolyKinds #-}
 {-# LANGUAGE ScopedTypeVariables #-}
 {-# LANGUAGE TypeApplications #-}
-{-# LANGUAGE TypeFamilies #-}
 {-# LANGUAGE TypeFamilyDependencies #-}
 {-# LANGUAGE TypeOperators #-}
 {-# LANGUAGE UndecidableInstances #-}
diff --git a/test/Tests/C.hs b/test/Tests/C.hs
index 6881cd4..9567393 100644
--- a/test/Tests/C.hs
+++ b/test/Tests/C.hs
@@ -24,7 +24,7 @@ import Data.Array.Nested.Types (fromSNat')
 
 import Hedgehog
 import Hedgehog.Gen qualified as Gen
-import Hedgehog.Internal.Property (forAllT, LabelName (..))
+import Hedgehog.Internal.Property (LabelName(..), forAllT)
 import Hedgehog.Range qualified as Range
 import Test.Tasty
 import Test.Tasty.Hedgehog
@@ -65,7 +65,7 @@ prop_sum_empty = property $ genRank $ \outrankm1@(SNat @nm1) -> do
     sht <- shuffleShR (0 :$: shtt)  -- n
     n <- Gen.int (Range.linear 0 20)
     return (n :$: sht)  -- n + 1
-  guard (0 `elem` toList (shrTail sh))
+  guard (0 `elem` shrTail sh)
   -- traceM ("sh: " ++ show sh ++ " -> " ++ show (product sh))
   let arr = OR.fromList @(n + 1) @Double (toList sh) []
   let rarr = rfromOrthotope inrank arr