Link to Eq and Ord typeclasses.

Author: m-renaud

Data/HashSet.hs

@@ -60,8 +60,8 @@ fromList ["Map","HashSet","Graph","HashMap","Set","Sequence"]
 
 === Using custom data with HashSet
 
-To create a @HashSet@ of your custom type, the type must have instances for "Data.Eq"
-and "Data.Hashable". The @Hashable@ typeclass is defined in the
+To create a @HashSet@ of your custom type, the type must have instances for
+"Data.Eq.Eq" and "Data.Hashable". The @Hashable@ typeclass is defined in the
 <https://hackage.haskell.org/package/hashable hashable> package, see the
 documentation for information on how to make your type an instance of
 "Data.Hashable".
@@ -84,7 +84,7 @@ fromList [Person {name = "Simon", likesDogs = True},Person {name = "Lana", likes
 == Performance
 
 The implementation is based on /hash array mapped tries/.  A
-'HashSet' is often faster than other "Data.Ord"-based set types,
+'HashSet' is often faster than other "Data.Ord.Ord"-based set types,
 especially when value comparisons are expensive, as in the case of
 strings.