Revert noisy change in Data.HashSet.Internal

Author: sjakobi

Data/HashSet/Internal.hs

@@ -109,7 +109,7 @@ import Text.Read
 
 import qualified Data.Data                  as Data
 import qualified Data.Foldable              as Foldable
-import qualified Data.HashMap.Internal      as HM
+import qualified Data.HashMap.Internal      as H
 import qualified Data.List                  as List
 import qualified GHC.Exts                   as Exts
 import qualified Language.Haskell.TH.Syntax as TH
@@ -259,14 +259,14 @@ hashSetDataType = Data.mkDataType "Data.HashSet.Internal.HashSet" [fromListConst
 -- >>> HashSet.empty
 -- fromList []
 empty :: HashSet a
-empty = HashSet HM.empty
+empty = HashSet H.empty
 
 -- | /O(1)/ Construct a set with a single element.
 --
 -- >>> HashSet.singleton 1
 -- fromList [1]
 singleton :: Hashable a => a -> HashSet a
-singleton a = HashSet (HM.singleton a ())
+singleton a = HashSet (H.singleton a ())
 {-# INLINABLE singleton #-}
 
 -- | /O(1)/ Convert to set to the equivalent 'HashMap' with @()@ values.
@@ -304,7 +304,7 @@ keysSet m = fromMap (() <$ m)
 --
 -- @since 0.2.12
 isSubsetOf :: (Eq a, Hashable a) => HashSet a -> HashSet a -> Bool
-isSubsetOf s1 s2 = HM.isSubmapOfBy (\_ _ -> True) (asMap s1) (asMap s2)
+isSubsetOf s1 s2 = H.isSubmapOfBy (\_ _ -> True) (asMap s1) (asMap s2)
 
 -- | /O(n+m)/ Construct a set containing all elements from both sets.
 --
@@ -314,7 +314,7 @@ isSubsetOf s1 s2 = HM.isSubmapOfBy (\_ _ -> True) (asMap s1) (asMap s2)
 -- >>> union (fromList [1,2]) (fromList [2,3])
 -- fromList [1,2,3]
 union :: (Eq a, Hashable a) => HashSet a -> HashSet a -> HashSet a
-union s1 s2 = HashSet $ HM.union (asMap s1) (asMap s2)
+union s1 s2 = HashSet $ H.union (asMap s1) (asMap s2)
 {-# INLINE union #-}
 
 -- TODO: Figure out the time complexity of 'unions'.
@@ -331,7 +331,7 @@ unions = List.foldl' union empty
 -- >>> HashSet.null (HashSet.singleton 1)
 -- False
 null :: HashSet a -> Bool
-null = HM.null . asMap
+null = H.null . asMap
 {-# INLINE null #-}
 
 -- | /O(n)/ Return the number of elements in this set.
@@ -341,7 +341,7 @@ null = HM.null . asMap
 -- >>> HashSet.size (HashSet.fromList [1,2,3])
 -- 3
 size :: HashSet a -> Int
-size = HM.size . asMap
+size = H.size . asMap
 {-# INLINE size #-}
 
 -- | /O(log n)/ Return 'True' if the given value is present in this
@@ -352,7 +352,7 @@ size = HM.size . asMap
 -- >>> HashSet.member 1 (Hashset.fromList [4,5,6])
 -- False
 member :: (Eq a, Hashable a) => a -> HashSet a -> Bool
-member a s = case HM.lookup a (asMap s) of
+member a s = case H.lookup a (asMap s) of
                Just _ -> True
                _      -> False
 {-# INLINABLE member #-}
@@ -362,7 +362,7 @@ member a s = case HM.lookup a (asMap s) of
 -- >>> HashSet.insert 1 HashSet.empty
 -- fromList [1]
 insert :: (Eq a, Hashable a) => a -> HashSet a -> HashSet a
-insert a = HashSet . HM.insert a () . asMap
+insert a = HashSet . H.insert a () . asMap
 {-# INLINABLE insert #-}
 
 -- | /O(log n)/ Remove the specified value from this set if present.
@@ -372,7 +372,7 @@ insert a = HashSet . HM.insert a () . asMap
 -- >>> HashSet.delete 1 (HashSet.fromList [4,5,6])
 -- fromList [4,5,6]
 delete :: (Eq a, Hashable a) => a -> HashSet a -> HashSet a
-delete a = HashSet . HM.delete a . asMap
+delete a = HashSet . H.delete a . asMap
 {-# INLINABLE delete #-}
 
 -- | /O(n)/ Transform this set by applying a function to every value.
@@ -390,7 +390,7 @@ map f = fromList . List.map f . toList
 -- >>> HashSet.difference (HashSet.fromList [1,2,3]) (HashSet.fromList [2,3,4])
 -- fromList [1]
 difference :: (Eq a, Hashable a) => HashSet a -> HashSet a -> HashSet a
-difference (HashSet a) (HashSet b) = HashSet (HM.difference a b)
+difference (HashSet a) (HashSet b) = HashSet (H.difference a b)
 {-# INLINABLE difference #-}
 
 -- | /O(n)/ Intersection of two sets. Return elements present in both
@@ -399,7 +399,7 @@ difference (HashSet a) (HashSet b) = HashSet (HM.difference a b)
 -- >>> HashSet.intersection (HashSet.fromList [1,2,3]) (HashSet.fromList [2,3,4])
 -- fromList [2,3]
 intersection :: (Eq a, Hashable a) => HashSet a -> HashSet a -> HashSet a
-intersection (HashSet a) (HashSet b) = HashSet (HM.intersection a b)
+intersection (HashSet a) (HashSet b) = HashSet (H.intersection a b)
 {-# INLINABLE intersection #-}
 
 -- | /O(n)/ Reduce this set by applying a binary operator to all
@@ -408,7 +408,7 @@ intersection (HashSet a) (HashSet b) = HashSet (HM.intersection a b)
 -- is evaluated before before using the result in the next
 -- application.  This function is strict in the starting value.
 foldl' :: (a -> b -> a) -> a -> HashSet b -> a
-foldl' f z0 = HM.foldlWithKey' g z0 . asMap
+foldl' f z0 = H.foldlWithKey' g z0 . asMap
   where g z k _ = f z k
 {-# INLINE foldl' #-}
 
@@ -418,7 +418,7 @@ foldl' f z0 = HM.foldlWithKey' g z0 . asMap
 -- is evaluated before before using the result in the next
 -- application. This function is strict in the starting value.
 foldr' :: (b -> a -> a) -> a -> HashSet b -> a
-foldr' f z0 = HM.foldrWithKey' g z0 . asMap
+foldr' f z0 = H.foldrWithKey' g z0 . asMap
   where g k _ z = f k z
 {-# INLINE foldr' #-}
 
@@ -441,7 +441,7 @@ foldl f z0 = foldlWithKey g z0 . asMap
 -- | /O(n)/ Filter this set by retaining only elements satisfying a
 -- predicate.
 filter :: (a -> Bool) -> HashSet a -> HashSet a
-filter p = HashSet . HM.filterWithKey q . asMap
+filter p = HashSet . H.filterWithKey q . asMap
   where q k _ = p k
 {-# INLINE filter #-}
 
@@ -453,7 +453,7 @@ toList t = Exts.build (\ c z -> foldrWithKey ((const .) c) z (asMap t))
 
 -- | /O(n*min(W, n))/ Construct a set from a list of elements.
 fromList :: (Eq a, Hashable a) => [a] -> HashSet a
-fromList = HashSet . List.foldl' (\ m k -> HM.insert k () m) HM.empty
+fromList = HashSet . List.foldl' (\ m k -> H.insert k () m) H.empty
 {-# INLINE fromList #-}
 
 instance (Eq a, Hashable a) => Exts.IsList (HashSet a) where