diff options
| author | H. Joe Lee <hyoklee@hdfgroup.org> | 2024-02-06 15:48:08 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-02-06 15:48:08 (GMT) |
| commit | 33ae371dbb9a1398578c5949b0f95d38ad08d338 (patch) | |
| tree | a310c842ad1745c3a76490d09607996d2cee7e30 | |
| parent | 255ab716f2c86bcb5c1cf424b9eca2d1106f5592 (diff) | |
| download | hdf5-33ae371dbb9a1398578c5949b0f95d38ad08d338.zip hdf5-33ae371dbb9a1398578c5949b0f95d38ad08d338.tar.gz hdf5-33ae371dbb9a1398578c5949b0f95d38ad08d338.tar.bz2 | |
chore: fix typo (#3989)
close #144
| -rw-r--r-- | src/H5checksum.c | 2 |
1 files changed, 1 insertions, 1 deletions
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. |