Format long import lists more compactly

Author: sjakobi

.stylish-haskell.yaml

@@ -2,7 +2,7 @@ steps:
   - imports:
       align: group
       pad_module_names: true
-      long_list_align: multiline
+      long_list_align: inline
   - language_pragmas:
       align: true
       remove_redundant: true

Data/HashMap/Internal.hs

@@ -144,41 +144,21 @@ import Control.Applicative        (Const (..))
 import Control.DeepSeq            (NFData (..), NFData1 (..), NFData2 (..))
 import Control.Monad.ST           (ST, runST)
 import Data.Bifoldable            (Bifoldable (..))
-import Data.Bits
-    ( complement
-    , popCount
-    , unsafeShiftL
-    , unsafeShiftR
-    , (.&.)
-    , (.|.)
-    )
+import Data.Bits                  (complement, popCount, unsafeShiftL,
+                                   unsafeShiftR, (.&.), (.|.))
 import Data.Coerce                (coerce)
 import Data.Data                  (Constr, Data (..), DataType)
-import Data.Functor.Classes
-    ( Eq1 (..)
-    , Eq2 (..)
-    , Ord1 (..)
-    , Ord2 (..)
-    , Read1 (..)
-    , Show1 (..)
-    , Show2 (..)
-    )
+import Data.Functor.Classes       (Eq1 (..), Eq2 (..), Ord1 (..), Ord2 (..),
+                                   Read1 (..), Show1 (..), Show2 (..))
 import Data.Functor.Identity      (Identity (..))
 import Data.HashMap.Internal.List (isPermutationBy, unorderedCompare)
 import Data.Hashable              (Hashable)
 import Data.Hashable.Lifted       (Hashable1, Hashable2)
 import Data.Semigroup             (Semigroup (..), stimesIdempotentMonoid)
 import GHC.Exts                   (Int (..), Int#, TYPE, (==#))
 import GHC.Stack                  (HasCallStack)
-import Prelude                    hiding
-    ( filter
-    , foldl
-    , foldr
-    , lookup
-    , map
-    , null
-    , pred
-    )
+import Prelude                    hiding (filter, foldl, foldr, lookup, map,
+                                   null, pred)
 import Text.Read                  hiding (step)
 
 import qualified Data.Data                   as Data

Data/HashMap/Internal/Array.hs

@@ -82,38 +82,18 @@ import Control.Applicative (liftA2)
 import Control.DeepSeq     (NFData (..), NFData1 (..))
 import Control.Monad       ((>=>))
 import Control.Monad.ST    (runST, stToIO)
-import GHC.Exts
-    ( Int (..)
-    , SmallArray#
-    , SmallMutableArray#
-    , cloneSmallMutableArray#
-    , copySmallArray#
-    , copySmallMutableArray#
-    , indexSmallArray#
-    , newSmallArray#
-    , readSmallArray#
-    , reallyUnsafePtrEquality#
-    , sizeofSmallArray#
-    , sizeofSmallMutableArray#
-    , tagToEnum#
-    , thawSmallArray#
-    , unsafeCoerce#
-    , unsafeFreezeSmallArray#
-    , unsafeThawSmallArray#
-    , writeSmallArray#
-    )
+import GHC.Exts            (Int (..), SmallArray#, SmallMutableArray#,
+                            cloneSmallMutableArray#, copySmallArray#,
+                            copySmallMutableArray#, indexSmallArray#,
+                            newSmallArray#, readSmallArray#,
+                            reallyUnsafePtrEquality#, sizeofSmallArray#,
+                            sizeofSmallMutableArray#, tagToEnum#,
+                            thawSmallArray#, unsafeCoerce#,
+                            unsafeFreezeSmallArray#, unsafeThawSmallArray#,
+                            writeSmallArray#)
 import GHC.ST              (ST (..))
-import Prelude             hiding
-    ( all
-    , filter
-    , foldMap
-    , foldl
-    , foldr
-    , length
-    , map
-    , read
-    , traverse
-    )
+import Prelude             hiding (all, filter, foldMap, foldl, foldr, length,
+                            map, read, traverse)
 
 import qualified Language.Haskell.TH.Syntax as TH
 #if defined(ASSERTS)

Data/HashMap/Internal/Strict.hs

@@ -126,28 +126,12 @@ import Control.Monad.ST      (runST)
 import Data.Bits             ((.&.), (.|.))
 import Data.Coerce           (coerce)
 import Data.Functor.Identity (Identity (..))
-import Data.HashMap.Internal hiding
-    ( adjust
-    , alter
-    , alterF
-    , differenceWith
-    , fromList
-    , fromListWith
-    , fromListWithKey
-    , insert
-    , insertWith
-    , intersectionWith
-    , intersectionWithKey
-    , map
-    , mapMaybe
-    , mapMaybeWithKey
-    , mapWithKey
-    , singleton
-    , traverseWithKey
-    , unionWith
-    , unionWithKey
-    , update
-    )
+import Data.HashMap.Internal hiding (adjust, alter, alterF, differenceWith,
+                              fromList, fromListWith, fromListWithKey, insert,
+                              insertWith, intersectionWith, intersectionWithKey,
+                              map, mapMaybe, mapMaybeWithKey, mapWithKey,
+                              singleton, traverseWithKey, unionWith,
+                              unionWithKey, update)
 import Data.Hashable         (Hashable)
 import Prelude               hiding (lookup, map)
 

Data/HashSet/Internal.hs

@@ -93,14 +93,8 @@ module Data.HashSet.Internal
 import Control.DeepSeq       (NFData (..), NFData1 (..), liftRnf2)
 import Data.Data             (Constr, Data (..), DataType)
 import Data.Functor.Classes
-import Data.HashMap.Internal
-    ( HashMap
-    , equalKeys
-    , equalKeys1
-    , foldMapWithKey
-    , foldlWithKey
-    , foldrWithKey
-    )
+import Data.HashMap.Internal (HashMap, equalKeys, equalKeys1, foldMapWithKey,
+                              foldlWithKey, foldrWithKey)
 import Data.Hashable         (Hashable (hashWithSalt))
 import Data.Hashable.Lifted  (Hashable1 (..), Hashable2 (..))
 import Data.Semigroup        (Semigroup (..), stimesIdempotentMonoid)

tests/Properties/HashMapLazy.hs

@@ -18,14 +18,8 @@ import Data.Function            (on)
 import Data.Functor.Identity    (Identity (..))
 import Data.Hashable            (Hashable (hashWithSalt))
 import Data.Ord                 (comparing)
-import Test.QuickCheck
-    ( Arbitrary (..)
-    , Property
-    , elements
-    , forAll
-    , (===)
-    , (==>)
-    )
+import Test.QuickCheck          (Arbitrary (..), Property, elements, forAll,
+                                 (===), (==>))
 import Test.QuickCheck.Function (Fun, apply)
 import Test.QuickCheck.Poly     (A, B)
 import Test.Tasty               (TestTree, testGroup)

tests/Strictness.hs

@@ -12,12 +12,8 @@ import Data.HashMap.Strict          (HashMap)
 import Data.Hashable                (Hashable (hashWithSalt))
 import Data.Maybe                   (fromMaybe, isJust)
 import Test.ChasingBottoms.IsBottom
-import Test.QuickCheck
-    ( Arbitrary (arbitrary)
-    , Property
-    , (.&&.)
-    , (===)
-    )
+import Test.QuickCheck              (Arbitrary (arbitrary), Property, (.&&.),
+                                     (===))
 import Test.QuickCheck.Function
 import Test.QuickCheck.Poly         (A)
 import Test.Tasty                   (TestTree, testGroup)