Refactor 'Data.HashSet'

Author: rockbmb

Data/HashSet.hs

@@ -67,14 +67,14 @@ module Data.HashSet
     , toList
     , fromList
 
-    -- * HashMaps
+    -- * HashMapWs
     , toMap
     , fromMap
     ) where
 
 import Control.DeepSeq (NFData(..))
 import Data.Data hiding (Typeable)
-import Data.HashMap.Base (HashMap, foldrWithKey, equalKeys)
+import Data.HashMap.Base (HashMapW, foldrWithKey, equalKeys)
 import Data.Hashable (Hashable(hashWithSalt))
 #if __GLASGOW_HASKELL__ >= 711
 import Data.Semigroup (Semigroup(..), Monoid(..))
@@ -103,7 +103,7 @@ import qualified Data.Hashable.Lifted as H
 
 -- | A set of values.  A set cannot contain duplicate values.
 newtype HashSet a = HashSet {
-      asMap :: HashMap a ()
+      asMap :: HashMapW a ()
     } deriving (Typeable)
 
 #if __GLASGOW_HASKELL__ >= 708
@@ -202,12 +202,12 @@ singleton :: Hashable a => a -> HashSet a
 singleton a = HashSet (H.singleton a ())
 {-# INLINABLE singleton #-}
 
--- | /O(1)/ Convert to the equivalent 'HashMap'.
-toMap :: HashSet a -> HashMap a ()
+-- | /O(1)/ Convert to the equivalent 'HashMapW'.
+toMap :: HashSet a -> HashMapW a ()
 toMap = asMap
 
--- | /O(1)/ Convert from the equivalent 'HashMap'.
-fromMap :: HashMap a () -> HashSet a
+-- | /O(1)/ Convert from the equivalent 'HashMapW'.
+fromMap :: HashMapW a () -> HashSet a
 fromMap = HashSet
 
 -- | /O(n+m)/ Construct a set containing all elements from both sets.