aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Johnson <benbjohnson@yahoo.com>2023-02-25 13:17:08 -0700
committerGitHub <noreply@github.com>2023-02-25 13:17:08 -0700
commit8fd91f5ef93d3db53c273f7e1ff019979eff4297 (patch)
treec6ef8e0107d5fec8e812b6be289145d790f1882c
parentMerge pull request #38 from BarrensZeppelin/master (diff)
parentFix typo in README NewMap -> NewSet (diff)
downloadpds-8fd91f5ef93d3db53c273f7e1ff019979eff4297.tar.gz
pds-8fd91f5ef93d3db53c273f7e1ff019979eff4297.tar.xz
Merge pull request #43 from infogulch/patch-1
Fix typo in README NewMap -> NewSet
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 177d37d..4a7f0c5 100644
--- a/README.md
+++ b/README.md
@@ -291,7 +291,7 @@ 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
-`string` keys. You may pass in a `nil` hasher to `NewMap()` if you are using
+`string` keys. You may pass in a `nil` hasher to `NewSet()` if you are using
one of these key types.