Let stylish-haskell sort things

3 files changed, 10 insertions, 9 deletions

diff --git a/ops/Data/Array/Strided.hs b/ops/Data/Array/Strided.hs
index a0506a9..7d8c2d0 100644
--- a/ops/Data/Array/Strided.hs
+++ b/ops/Data/Array/Strided.hs
@@ -3,5 +3,5 @@ module Data.Array.Strided (
   module Data.Array.Strided.Arith,
 ) where
 
-import Data.Array.Strided.Array
 import Data.Array.Strided.Arith
+import Data.Array.Strided.Array
diff --git a/ops/Data/Array/Strided/Arith/Internal.hs b/ops/Data/Array/Strided/Arith/Internal.hs
index 313d72f..4d7e1da 100644
--- a/ops/Data/Array/Strided/Arith/Internal.hs
+++ b/ops/Data/Array/Strided/Arith/Internal.hs
@@ -1,6 +1,7 @@
 {-# LANGUAGE DataKinds #-}
 {-# LANGUAGE ExistentialQuantification #-}
 {-# LANGUAGE GADTs #-}
+{-# LANGUAGE ImportQualifiedPost #-}
 {-# LANGUAGE KindSignatures #-}
 {-# LANGUAGE MultiWayIf #-}
 {-# LANGUAGE RankNTypes #-}
@@ -9,7 +10,6 @@
 {-# LANGUAGE TupleSections #-}
 {-# LANGUAGE TypeApplications #-}
 {-# LANGUAGE TypeOperators #-}
-{-# LANGUAGE ViewPatterns #-}
 {-# OPTIONS_GHC -fplugin GHC.TypeLits.Normalise #-}
 {-# OPTIONS_GHC -fplugin GHC.TypeLits.KnownNat.Solver #-}
 module Data.Array.Strided.Arith.Internal where
@@ -21,20 +21,20 @@ import Data.Int
 import Data.List (sort, zip4)
 import Data.Proxy
 import Data.Type.Equality
-import qualified Data.Vector.Storable as VS
-import qualified Data.Vector.Storable.Mutable as VSM
+import Data.Vector.Storable qualified as VS
+import Data.Vector.Storable.Mutable qualified as VSM
 import Foreign.C.Types
 import Foreign.Ptr
 import Foreign.Storable
-import qualified GHC.TypeNats as TypeNats
 import GHC.TypeLits
+import GHC.TypeNats qualified as TypeNats
 import Language.Haskell.TH
 import System.IO (hFlush, stdout)
 import System.IO.Unsafe
 
-import Data.Array.Strided.Array
-import Data.Array.Strided.Arith.Internal.Lists
 import Data.Array.Strided.Arith.Internal.Foreign
+import Data.Array.Strided.Arith.Internal.Lists
+import Data.Array.Strided.Array
 
 
 -- TODO: need to sort strides for reduction-like functions so that the C inner-loop specialisation has some chance of working even after transposition
diff --git a/ops/Data/Array/Strided/Array.hs b/ops/Data/Array/Strided/Array.hs
index df455c7..f757cd5 100644
--- a/ops/Data/Array/Strided/Array.hs
+++ b/ops/Data/Array/Strided/Array.hs
@@ -1,12 +1,13 @@
 {-# LANGUAGE DataKinds #-}
+{-# LANGUAGE ImportQualifiedPost #-}
 {-# LANGUAGE KindSignatures #-}
 {-# LANGUAGE ScopedTypeVariables #-}
 {-# LANGUAGE TypeApplications #-}
 module Data.Array.Strided.Array where
 
-import qualified Data.List.NonEmpty as NE
+import Data.List.NonEmpty qualified as NE
 import Data.Proxy
-import qualified Data.Vector.Storable as VS
+import Data.Vector.Storable qualified as VS
 import Foreign.Storable
 import GHC.TypeLits