commit 5ba61f488da2e092a81c3d126c5827dad6ab2006
author Miss Islington (bot) <31488909+miss-islington@users.noreply.github.com> Sat Oct 02 12:33:49 2021 -0700
committer GitHub <noreply@github.com> Sat Oct 02 14:33:49 2021 -0500
tree a8c7e54274e5eba548f2d283725a8ab64f137e39
parent 72089f33c0aed391f047b1cbaf19d8da1e51c167

Fix spelling error in comment (GH-28696) (GH-28699)

Objects/setobject.c

diff --git a/Objects/setobject.c b/Objects/setobject.c
index caff85c..9d4cfd3 100644
--- a/Objects/setobject.c
+++ b/Objects/setobject.c
@@ -16,7 +16,7 @@
    reduces the cost of hash collisions because consecutive memory accesses
    tend to be much cheaper than scattered probes.  After LINEAR_PROBES steps,
    we then use more of the upper bits from the hash value and apply a simple
-   linear congruential random number genearator.  This helps break-up long
+   linear congruential random number generator.  This helps break-up long
    chains of collisions.
 
    All arithmetic on hash should ignore overflow.