Get rid of any mentions of 'map'

1 files changed, 13 insertions, 13 deletions

diff --git a/src/Data/Dependent/EnumMap/Strict/Internal.hs b/src/Data/Dependent/EnumMap/Strict/Internal.hs
index 369cd48..db083a6 100644
--- a/src/Data/Dependent/EnumMap/Strict/Internal.hs
+++ b/src/Data/Dependent/EnumMap/Strict/Internal.hs
@@ -19,7 +19,7 @@ import Data.Type.Equality
 import Text.Show (showListWith)
 import Unsafe.Coerce (unsafeCoerce)
 
-import Prelude hiding (lookup)
+import Prelude hiding (lookup, map)
 
 data KV k v = forall a. KV !(Enum1Info k) !(v a)
 
@@ -82,7 +82,7 @@ singleton k v =
 -- ** From Unordered Lists
 
 fromList :: Enum1 k => [DSum k v] -> DEnumMap k v
-fromList l = DEnumMap (IM.fromList (map dSumToKV l))
+fromList l = DEnumMap (IM.fromList (dSumToKV <$> l))
 
 fromListWith :: (Enum1 k, TestEquality k)
              => (forall a. v a -> v a -> v a)
@@ -92,7 +92,7 @@ fromListWith f (l :: [DSum k v]) =
              (\i (KV inf1 v1) (KV inf2 v2) ->
                 typeCheck2 (Proxy @k) i inf1 inf2 $
                   KV inf1 (f v1 (coe1 v2)))
-             (map dSumToKV l))
+             (dSumToKV <$> l))
 
 fromListWithKey :: (Enum1 k, TestEquality k)
                 => (forall a. k a -> v a -> v a -> v a)
@@ -102,12 +102,12 @@ fromListWithKey f l =
              (\i (KV inf1 v1) (KV inf2 v2) ->
                 case toEnum1 i inf1 of
                   Some k1 -> typeCheck1 k1 i inf2 $ KV inf1 (f k1 (coe1 v1) (coe1 v2)))
-             (map dSumToKV l))
+             (dSumToKV <$> l))
 
 -- ** From Ascending Lists
 
 fromAscList :: Enum1 k => [DSum k v] -> DEnumMap k v
-fromAscList l = DEnumMap (IM.fromAscList (map dSumToKV l))
+fromAscList l = DEnumMap (IM.fromAscList (dSumToKV <$> l))
 
 fromAscListWith :: (Enum1 k, TestEquality k)
                 => (forall a. v a -> v a -> v a)
@@ -117,7 +117,7 @@ fromAscListWith f (l :: [DSum k v]) =
              (\i (KV inf1 v1) (KV inf2 v2) ->
                typeCheck2 (Proxy @k) i inf1 inf2 $
                  KV inf1 (f v1 (coe1 v2)))
-             (map dSumToKV l))
+             (dSumToKV <$> l))
 
 fromAscListWithKey :: (Enum1 k, TestEquality k)
                    => (forall a. k a -> v a -> v a -> v a)
@@ -127,10 +127,10 @@ fromAscListWithKey f l =
              (\i (KV inf1 v1) (KV inf2 v2) ->
                case toEnum1 i inf1 of
                  Some k1 -> typeCheck1 k1 i inf2 $ KV inf1 (f k1 (coe1 v1) (coe1 v2)))
-             (map dSumToKV l))
+             (dSumToKV <$> l))
 
 fromDistinctAscList :: Enum1 k => [DSum k v] -> DEnumMap k v
-fromDistinctAscList l = DEnumMap (IM.fromDistinctAscList (map dSumToKV l))
+fromDistinctAscList l = DEnumMap (IM.fromDistinctAscList (dSumToKV <$> l))
 
 -- * Insertion
 
@@ -402,13 +402,13 @@ mergeWithKey f g1 g2 (DEnumMap m1) (DEnumMap m2) = DEnumMap (IM.mergeWithKey f'
 -- * Conversion
 
 elems :: DEnumMap k v -> [Some v]
-elems (DEnumMap m) = map (\(KV _ v) -> Some v) (IM.elems m)
+elems (DEnumMap m) = (\(KV _ v) -> Some v) <$> IM.elems m
 
 keys :: Enum1 k => DEnumMap k v -> [Some k]
-keys (DEnumMap m) = map (\(k, KV inf _) -> toEnum1 k inf) (IM.assocs m)
+keys (DEnumMap m) = (\(k, KV inf _) -> toEnum1 k inf) <$> IM.assocs m
 
 assocs :: Enum1 k => DEnumMap k v -> [DSum k v]
-assocs (DEnumMap m) = map kVToDSum $ IM.assocs m
+assocs (DEnumMap m) = kVToDSum <$> IM.assocs m
 
 -- TODO: probably doesn't make much sense until we have DEnumSet?
 -- keysSet
@@ -421,10 +421,10 @@ toList = toAscList
 -- ** Ordered lists
 
 toAscList :: Enum1 k => DEnumMap k v -> [DSum k v]
-toAscList (DEnumMap m) = map kVToDSum (IM.toAscList m)
+toAscList (DEnumMap m) = kVToDSum <$> IM.toAscList m
 
 toDescList :: Enum1 k => DEnumMap k v -> [DSum k v]
-toDescList (DEnumMap m) = map kVToDSum (IM.toDescList m)
+toDescList (DEnumMap m) = kVToDSum <$> IM.toDescList m
 
 -- * Filter