Skip to content

Commit 4d55200

Browse files
committed
Link to typeclasses.
1 parent fbebeb5 commit 4d55200

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

Data/HashSet.hs

+3-3
Original file line numberDiff line numberDiff line change
@@ -61,10 +61,10 @@ fromList ["Map","HashSet","Graph","HashMap","Set","Sequence"]
6161
=== Using custom data with HashSet
6262
6363
To create a @HashSet@ of your custom type, the type must have instances for
64-
"Data.Eq" and "Data.Hashable". The @Hashable@ typeclass is defined in the
64+
'Data.Eq.Eq' and 'Data.Hashable.Hashable'. The @Hashable@ typeclass is defined in the
6565
<https://hackage.haskell.org/package/hashable hashable> package, see the
6666
documentation for information on how to make your type an instance of
67-
"Data.Hashable".
67+
@Hashable@.
6868
6969
We'll start by setting up our custom data type:
7070
@@ -84,7 +84,7 @@ fromList [Person {name = "Simon", likesDogs = True},Person {name = "Lana", likes
8484
== Performance
8585
8686
The implementation is based on /hash array mapped tries/. A
87-
'HashSet' is often faster than other "Data.Ord"-based set types,
87+
'HashSet' is often faster than other 'Data.Ord.Ord'-based set types,
8888
especially when value comparisons are expensive, as in the case of
8989
strings.
9090

0 commit comments

Comments
 (0)