diff options
| author | Ville Skyttä <ville.skytta@iki.fi> | 2018-04-20 20:08:45 (GMT) |
|---|---|---|
| committer | Terry Jan Reedy <tjreedy@udel.edu> | 2018-04-20 20:08:45 (GMT) |
| commit | 61f82e0e337f971da57f8f513abfe693edf95aa5 (patch) | |
| tree | d783b7677df1f57618381c0b7c925a990a115444 /Python/hamt.c | |
| parent | 0399cf9b5e370516e3d0aed6a63ff74aff5eadb5 (diff) | |
| download | cpython-61f82e0e337f971da57f8f513abfe693edf95aa5.zip cpython-61f82e0e337f971da57f8f513abfe693edf95aa5.tar.gz cpython-61f82e0e337f971da57f8f513abfe693edf95aa5.tar.bz2 | |
Spelling fixes to docs, docstrings, and comments (GH-6374)
Diffstat (limited to 'Python/hamt.c')
| -rw-r--r-- | Python/hamt.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Python/hamt.c b/Python/hamt.c index 53a8572..5217122 100644 --- a/Python/hamt.c +++ b/Python/hamt.c @@ -39,7 +39,7 @@ Now let's partition this bit representation of the hash into blocks of 0b00_00000_10010_11101_00101_01011_10000 = 19830128 (6) (5) (4) (3) (2) (1) -Each block of 5 bits represents a number betwen 0 and 31. So if we have +Each block of 5 bits represents a number between 0 and 31. So if we have a tree that consists of nodes, each of which is an array of 32 pointers, those 5-bit blocks will encode a position on a single tree level. @@ -832,7 +832,7 @@ hamt_node_bitmap_assoc(PyHamtNode_Bitmap *self, pairs. Small hamt objects (<30 keys) usually don't have any - Array nodes at all. Betwen ~30 and ~400 keys hamt + Array nodes at all. Between ~30 and ~400 keys hamt objects usually have one Array node, and usually it's a root node. */ |