mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-08-31 05:58:33 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

Spelling fixes to docs, docstrings, and comments (GH-6374)

Browse source
This commit is contained in:
Ville Skyttä 2018-04-20 23:08:45 +03:00 • committed by Terry Jan Reedy
parent 0399cf9b5e
commit 61f82e0e33
15 changed files with 16 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Python/fileutils.c
View file

@ -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.

4
Python/hamt.c
View file

@ -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.
*/