diff options
| author | Raymond Hettinger <rhettinger@users.noreply.github.com> | 2021-10-02 18:52:05 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-10-02 18:52:05 (GMT) |
| commit | dc878240dcbb47e660f5ad094deba5381872f2c9 (patch) | |
| tree | ff51b65dcbc775230dd311ee32d2f7b2efdd1d40 | |
| parent | db91b058d5d4fbff4185982095d90fe6a2741aed (diff) | |
| download | cpython-dc878240dcbb47e660f5ad094deba5381872f2c9.zip cpython-dc878240dcbb47e660f5ad094deba5381872f2c9.tar.gz cpython-dc878240dcbb47e660f5ad094deba5381872f2c9.tar.bz2 | |
Fix spelling error in comment (GH-28696)
| -rw-r--r-- | Objects/setobject.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/setobject.c b/Objects/setobject.c index a3cdd33..f71417d 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. |