File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -350,7 +350,7 @@ The result is a hash code created using the FNV-1 algorithm.
350
350
Glenn Fowler, Landon Curt Noll, and Phong Vo.
351
351
This code is relatively fast on short keys, and is small enough that
352
352
it will often be retained in the instruction cache if hashing is
353
- intermitent .
353
+ intermittent .
354
354
As a result it should give good performance for typical hash map
355
355
applications.
356
356
This code does not pass any of the SMHasher tests, but the resulting
@@ -414,7 +414,7 @@ The result is a hash code created using the FNV-1a algorithm.
414
414
of Glenn Fowler, Landon Curt Noll, and Phong Vo.
415
415
This code is relatively fast on short keys, and is small enough that
416
416
it will often be retained in the instruction cache if hashing is
417
- intermitent .
417
+ intermittent .
418
418
As a result it should give good performance for typical hash map
419
419
applications.
420
420
This code does not pass any of the SMHasher tests, but the resulting
You can’t perform that action at this time.
0 commit comments