diff options
Diffstat (limited to 'Python')
| -rw-r--r-- | Python/fileutils.c | 2 | ||||
| -rw-r--r-- | Python/hamt.c | 4 |
2 files changed, 3 insertions, 3 deletions
diff --git a/Python/fileutils.c b/Python/fileutils.c index 32aeea4f10..35869c81ac 100644 --- a/Python/fileutils.c +++ b/Python/fileutils.c @@ -431,7 +431,7 @@ decode_error: can be decoded as a surrogate character, escape the bytes using the surrogateescape error handler instead of decoding them. - On sucess, return 0 and write the newly allocated wide character string into + On success, return 0 and write the newly allocated wide character string into *wstr (use PyMem_RawFree() to free the memory). If wlen is not NULL, write the number of wide characters excluding the null character into *wlen. diff --git a/Python/hamt.c b/Python/hamt.c index 53a8572374..52171222b0 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. */ |