Let stylish-haskell sort things

1 files changed, 7 insertions, 7 deletions

diff --git a/src/Data/Array/Nested/Internal/Shaped.hs b/src/Data/Array/Nested/Internal/Shaped.hs
index a8f330f..cd69daa 100644
--- a/src/Data/Array/Nested/Internal/Shaped.hs
+++ b/src/Data/Array/Nested/Internal/Shaped.hs
@@ -21,12 +21,12 @@ 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.ShapedS qualified as SS
-import Data.Array.Internal.ShapedG qualified as SG
-import Data.Array.Internal.RankedS qualified as RS
 import Data.Array.Internal.RankedG qualified as RG
+import Data.Array.Internal.RankedS qualified as RS
+import Data.Array.Internal.ShapedG qualified as SG
+import Data.Array.Internal.ShapedS qualified as SS
 import Data.Bifunctor (first)
 import Data.Coerce (coerce)
 import Data.Kind (Type)
@@ -35,16 +35,16 @@ import Data.Proxy
 import Data.Type.Equality
 import Data.Vector.Storable qualified as VS
 import Foreign.Storable (Storable)
-import GHC.Float qualified (log1p, expm1, log1pexp, log1mexp)
+import GHC.Float qualified (expm1, log1mexp, log1p, log1pexp)
 import GHC.Generics (Generic)
 import GHC.TypeLits
 
-import Data.Array.Mixed.XArray (XArray)
-import Data.Array.Mixed.XArray qualified as X
 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 qualified as X
 import Data.Array.Nested.Internal.Lemmas
 import Data.Array.Nested.Internal.Mixed
 import Data.Array.Nested.Internal.Shape