More review.

Author: m-renaud

Data/HashSet.hs

@@ -18,7 +18,7 @@ Portability :  portable
 lookups, and deletion. A 'HashSet' makes no guarantees as to the order of its
 elements.
 
-If you are storing sets of @Int@s consider using the @Data.IntSet@ from the
+If you are storing sets of "Data.Int"s consider using "Data.IntSet" from the
 <https://hackage.haskell.org/package/containers containers> package.
 
 
@@ -42,7 +42,7 @@ False
 Add a new entry to the set:
 
 >>> let moreDataStructures = HashSet.insert "Trie" dataStructures
->>> HashSet.member \"Trie\" moreDataStructures
+>>> HashSet.member "Trie" moreDataStructures
 > True
 
 Remove the @\"Graph\"@ entry from the set of data structures.
@@ -60,11 +60,11 @@ 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 'Eq'
-and 'Hashable'. The 'Hashable' typeclass is defined in the
+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
 <https://hackage.haskell.org/package/hashable hashable> package, see the
 documentation for information on how to make your type an instance of
-'Hashable'.
+"Data.Hashable".
 
 We'll start by setting up our custom data type:
 
@@ -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 'Ord'-based set types,
+'HashSet' is often faster than other "Data.Ord"-based set types,
 especially when value comparisons are expensive, as in the case of
 strings.