diff options
Diffstat (limited to 'Modules')
| -rw-r--r-- | Modules/_heapqmodule.c | 2 | ||||
| -rw-r--r-- | Modules/_pickle.c | 2 | ||||
| -rw-r--r-- | Modules/_tracemalloc.c | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/Modules/_heapqmodule.c b/Modules/_heapqmodule.c index c343862b8c..136abf5985 100644 --- a/Modules/_heapqmodule.c +++ b/Modules/_heapqmodule.c @@ -550,7 +550,7 @@ representation for a tournament. The numbers below are `k', not a[k]:\n\ \n\ \n\ In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'. In\n\ -an usual binary tournament we see in sports, each cell is the winner\n\ +a usual binary tournament we see in sports, each cell is the winner\n\ over the two cells it tops, and we can trace the winner down the tree\n\ to see all opponents s/he had. However, in many computer applications\n\ of such tournaments, we do not need to trace the history of a winner.\n\ diff --git a/Modules/_pickle.c b/Modules/_pickle.c index 1acf14ade8..78cfe20384 100644 --- a/Modules/_pickle.c +++ b/Modules/_pickle.c @@ -1096,7 +1096,7 @@ _Unpickler_SkipConsumed(UnpicklerObject *self) return 0; assert(self->peek); /* otherwise we did something wrong */ - /* This makes an useless copy... */ + /* This makes a useless copy... */ r = PyObject_CallFunction(self->read, "n", consumed); if (r == NULL) return -1; diff --git a/Modules/_tracemalloc.c b/Modules/_tracemalloc.c index 6327c95d2a..60c1b063ac 100644 --- a/Modules/_tracemalloc.c +++ b/Modules/_tracemalloc.c @@ -296,7 +296,7 @@ tracemalloc_get_frame(PyFrameObject *pyframe, frame_t *frame) if (!PyUnicode_Check(filename)) { #ifdef TRACE_DEBUG - tracemalloc_error("filename is not an unicode string"); + tracemalloc_error("filename is not a unicode string"); #endif return; } |