Address more review comments.

Author: m-renaud

Data/HashSet.hs

@@ -14,11 +14,13 @@ Portability :  portable
 
 = Introduction
 
-'HashSet' allows you to store /unique/ elements, providing efficient
-insertion, lookups, and deletion. If you are storing sets of @Int@s consider
-using the @Data.IntSet@ from the
-<https://hackage.haskell.org/packages/containers containers> package.
-A 'HashSet' makes no guarantees as to the order of its elements.
+'HashSet' allows you to store /unique/ elements, providing efficient insertion,
+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
+<https://hackage.haskell.org/package/containers containers> package.
+
 
 == Examples
 
@@ -60,7 +62,7 @@ fromList ["Map","HashSet","Graph","HashMap","Set","Sequence"]
 
 To create a @HashSet@ of your custom type, the type must have instances for 'Eq' and
 'Hashable'. The 'Hashable' typeclass is defined in the
-<https://hackage.haskell.org/packages/hashable hashable> package and the
+<https://hackage.haskell.org/package/hashable hashable> package and the
 recommended way to define the instance is using generics, for which you'll need
 the @DeriveGeneric@ GHC extension.