aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorOskar Haarklou Veileborg <ohv1020@hotmail.com>2023-01-09 20:28:08 +0100
committerOskar Haarklou Veileborg <ohv1020@hotmail.com>2023-01-09 20:28:08 +0100
commit8e1383ea6a9561610e00b8c7f401bca1257f9001 (patch)
tree3ce620c77162717648feb4ae411b6a63acb0f2e3 /README.md
parentMerge pull request #35 from laher/sets-maps-append-multi (diff)
downloadpds-8e1383ea6a9561610e00b8c7f401bca1257f9001.tar.gz
pds-8e1383ea6a9561610e00b8c7f401bca1257f9001.tar.xz
Ensure immutability of sets (and maps with SetMany)
Diffstat (limited to 'README.md')
-rw-r--r--README.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index ed771c6..c547383 100644
--- a/README.md
+++ b/README.md
@@ -286,8 +286,8 @@ Please see the internal `defaultComparer` for an example, bearing in mind that i
## Set
-The `Set` represents a collection of unique values. It uses a `map[T]struct{}`, so it carries over some characteristics from the built-in Go `map` type.
-Values neeed to be `comparable`.
+The `Set` represents a collection of unique values, and it is implemented as a
+wrapper around a `Map[T, struct{}]`.
Like Maps, Sets require a `Hasher` to hash keys and check for equality. There are built-in
hasher implementations for most primitive types such as `int`, `uint`, and