From 79073a61a355a9d6e841414fd81db1028dd2057d Mon Sep 17 00:00:00 2001 From: "H. Joe Lee" Date: Tue, 6 Feb 2024 09:48:08 -0600 Subject: chore: fix typo (#3989) close #144 --- src/H5checksum.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/H5checksum.c b/src/H5checksum.c index 66a6c86..6eafc0d 100644 --- a/src/H5checksum.c +++ b/src/H5checksum.c @@ -345,7 +345,7 @@ the return value. Two keys differing by one or two bits will have totally different hash values. The best hash table sizes are powers of 2. There is no need to do -mod a prime (mod is sooo slow!). If you need less than 32 bits, +mod a prime (mod is so slow!). If you need less than 32 bits, use a bitmask. For example, if you need only 10 bits, do h = (h & hashmask(10)); In which case, the hash table should have hashsize(10) elements. -- cgit v0.12