Revert some stylistic changes

https://x.com/comerijn/status/1257804634833420292

4 files changed, 12 insertions, 12 deletions

diff --git a/src/Data/Array/Nested/Internal/Mixed.hs b/src/Data/Array/Nested/Internal/Mixed.hs
index 4271526..a2f9737 100644
--- a/src/Data/Array/Nested/Internal/Mixed.hs
+++ b/src/Data/Array/Nested/Internal/Mixed.hs
@@ -20,7 +20,7 @@ module Data.Array.Nested.Internal.Mixed where
 
 import Prelude hiding (mconcat)
 
-import Control.DeepSeq (NFData (..))
+import Control.DeepSeq (NFData(..))
 import Control.Monad (forM_, when)
 import Control.Monad.ST
 import Data.Array.RankedS qualified as S
@@ -29,7 +29,7 @@ import Data.Coerce
 import Data.Foldable (toList)
 import Data.Int
 import Data.Kind (Constraint, Type)
-import Data.List.NonEmpty (NonEmpty (..))
+import Data.List.NonEmpty (NonEmpty(..))
 import Data.List.NonEmpty qualified as NE
 import Data.Proxy
 import Data.Type.Equality
@@ -47,7 +47,7 @@ import Data.Array.Mixed.Lemmas
 import Data.Array.Mixed.Permutation
 import Data.Array.Mixed.Shape
 import Data.Array.Mixed.Types
-import Data.Array.Mixed.XArray (XArray (..))
+import Data.Array.Mixed.XArray (XArray(..))
 import Data.Array.Mixed.XArray qualified as X
 import Data.Bag
 
@@ -543,7 +543,7 @@ instance Elt a => Elt (Mixed sh' a) where
     = fst (shxSplitApp (Proxy @sh') (ssxFromShape sh) (mshape arr))
 
   mindex :: Mixed sh (Mixed sh' a) -> IIxX sh -> Mixed sh' a
-  mindex (M_Nest _ arr) = mindexPartial arr
+  mindex (M_Nest _ arr) i = mindexPartial arr i
 
   mindexPartial :: forall sh1 sh2.
                    Mixed (sh1 ++ sh2) (Mixed sh' a) -> IIxX sh1 -> Mixed sh2 (Mixed sh' a)
@@ -858,7 +858,7 @@ msliceU :: Elt a => Int -> Int -> Mixed (Nothing : sh) a -> Mixed (Nothing : sh)
 msliceU i n arr = mlift (ssxFromShape (mshape arr)) (\_ -> X.sliceU i n) arr
 
 mrev1 :: Elt a => Mixed (n : sh) a -> Mixed (n : sh) a
-mrev1 arr = mlift (ssxFromShape (mshape arr)) (const X.rev1) arr
+mrev1 arr = mlift (ssxFromShape (mshape arr)) (\_ -> X.rev1) arr
 
 mreshape :: forall sh sh' a. Elt a => IShX sh' -> Mixed sh a -> Mixed sh' a
 mreshape sh' arr =
diff --git a/src/Data/Array/Nested/Internal/Ranked.hs b/src/Data/Array/Nested/Internal/Ranked.hs
index 3bd4581..daf0374 100644
--- a/src/Data/Array/Nested/Internal/Ranked.hs
+++ b/src/Data/Array/Nested/Internal/Ranked.hs
@@ -21,7 +21,7 @@ module Data.Array.Nested.Internal.Ranked where
 
 import Prelude hiding (mappend, mconcat)
 
-import Control.DeepSeq (NFData (..))
+import Control.DeepSeq (NFData(..))
 import Control.Monad.ST
 import Data.Array.RankedS qualified as S
 import Data.Bifunctor (first)
@@ -42,7 +42,7 @@ import Data.Array.Mixed.Lemmas
 import Data.Array.Mixed.Permutation
 import Data.Array.Mixed.Shape
 import Data.Array.Mixed.Types
-import Data.Array.Mixed.XArray (XArray (..))
+import Data.Array.Mixed.XArray (XArray(..))
 import Data.Array.Mixed.XArray qualified as X
 import Data.Array.Nested.Internal.Mixed
 import Data.Array.Nested.Internal.Shape
diff --git a/src/Data/Array/Nested/Internal/Shape.hs b/src/Data/Array/Nested/Internal/Shape.hs
index c877412..1770e38 100644
--- a/src/Data/Array/Nested/Internal/Shape.hs
+++ b/src/Data/Array/Nested/Internal/Shape.hs
@@ -26,7 +26,7 @@
 {-# OPTIONS_GHC -fplugin GHC.TypeLits.KnownNat.Solver #-}
 module Data.Array.Nested.Internal.Shape where
 
-import Control.DeepSeq (NFData (..))
+import Control.DeepSeq (NFData(..))
 import Data.Array.Mixed.Types
 import Data.Array.Shape qualified as O
 import Data.Coerce (coerce)
@@ -34,7 +34,7 @@ import Data.Foldable qualified as Foldable
 import Data.Functor.Const
 import Data.Functor.Product qualified as Fun
 import Data.Kind (Constraint, Type)
-import Data.Monoid (Sum (..))
+import Data.Monoid (Sum(..))
 import Data.Proxy
 import Data.Type.Equality
 import GHC.Exts (withDict)
@@ -686,7 +686,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 = withDict @(KnownShS sh)
+withKnownShS k = withDict @(KnownShS sh) k
 
 shsKnownShS :: ShS sh -> Dict KnownShS sh
 shsKnownShS ZSS = Dict
diff --git a/src/Data/Array/Nested/Internal/Shaped.hs b/src/Data/Array/Nested/Internal/Shaped.hs
index 3bdbac2..372439f 100644
--- a/src/Data/Array/Nested/Internal/Shaped.hs
+++ b/src/Data/Array/Nested/Internal/Shaped.hs
@@ -20,7 +20,7 @@ module Data.Array.Nested.Internal.Shaped where
 
 import Prelude hiding (mappend, mconcat)
 
-import Control.DeepSeq (NFData (..))
+import Control.DeepSeq (NFData(..))
 import Control.Monad.ST
 import Data.Array.Internal.RankedG qualified as RG
 import Data.Array.Internal.RankedS qualified as RS
@@ -422,7 +422,7 @@ sslice i n@SNat arr =
   in slift (n :$$ sh) (\_ -> X.slice i n) arr
 
 srev1 :: Elt a => Shaped (n : sh) a -> Shaped (n : sh) a
-srev1 arr = slift (sshape arr) (const X.rev1) arr
+srev1 arr = slift (sshape arr) (\_ -> X.rev1) arr
 
 sreshape :: (Elt a, Product sh ~ Product sh') => ShS sh' -> Shaped sh a -> Shaped sh' a
 sreshape sh' (Shaped arr) = Shaped (mreshape (shCvtSX sh') arr)