diff options
| author | Jesus Cea <jcea@jcea.es> | 2009-07-02 15:37:21 (GMT) |
|---|---|---|
| committer | Jesus Cea <jcea@jcea.es> | 2009-07-02 15:37:21 (GMT) |
| commit | 585ad8ae5e352c99bbd87955c64cc9a0654da8c3 (patch) | |
| tree | 98c559aa59ba10d42e6383626b33433343e6b4fc /Objects | |
| parent | b73effab2828b244d2b91d466f7a89df94a6c036 (diff) | |
| download | cpython-585ad8ae5e352c99bbd87955c64cc9a0654da8c3.zip cpython-585ad8ae5e352c99bbd87955c64cc9a0654da8c3.tar.gz cpython-585ad8ae5e352c99bbd87955c64cc9a0654da8c3.tar.bz2 | |
Merged revisions 69846 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r69846 | mark.dickinson | 2009-02-21 21:27:01 +0100 (Sat, 21 Feb 2009) | 2 lines
Issue #5341: Fix a variety of spelling errors.
........
Diffstat (limited to 'Objects')
| -rw-r--r-- | Objects/abstract.c | 2 | ||||
| -rw-r--r-- | Objects/listsort.txt | 2 | ||||
| -rw-r--r-- | Objects/object.c | 2 | ||||
| -rw-r--r-- | Objects/unicodeobject.c | 2 |
4 files changed, 4 insertions, 4 deletions
diff --git a/Objects/abstract.c b/Objects/abstract.c index de8682a..22a72e1 100644 --- a/Objects/abstract.c +++ b/Objects/abstract.c @@ -2244,7 +2244,7 @@ PySequence_Fast(PyObject *v, const char *m) /* Iterate over seq. Result depends on the operation: PY_ITERSEARCH_COUNT: -1 if error, else # of times obj appears in seq. - PY_ITERSEARCH_INDEX: 0-based index of first occurence of obj in seq; + PY_ITERSEARCH_INDEX: 0-based index of first occurrence of obj in seq; set ValueError and return -1 if none found; also return -1 on error. Py_ITERSEARCH_CONTAINS: return 1 if obj in seq, else 0; -1 on error. */ diff --git a/Objects/listsort.txt b/Objects/listsort.txt index 9226984..31a5445 100644 --- a/Objects/listsort.txt +++ b/Objects/listsort.txt @@ -309,7 +309,7 @@ Stability constrains permissible merging patterns. For example, if we have A:10000 B:20000 C:10000 we dare not merge A with C first, because if A, B and C happen to contain -a common element, it would get out of order wrt its occurence(s) in B. The +a common element, it would get out of order wrt its occurrence(s) in B. The merging must be done as (A+B)+C or A+(B+C) instead. So merging is always done on two consecutive runs at a time, and in-place, diff --git a/Objects/object.c b/Objects/object.c index 1d98efe..bb3693b 100644 --- a/Objects/object.c +++ b/Objects/object.c @@ -1960,7 +1960,7 @@ static void none_dealloc(PyObject* ignore) { /* This should never get called, but we also don't want to SEGV if - * we accidently decref None out of existance. + * we accidentally decref None out of existence. */ Py_FatalError("deallocating None"); } diff --git a/Objects/unicodeobject.c b/Objects/unicodeobject.c index 8ffe8ce..6911058 100644 --- a/Objects/unicodeobject.c +++ b/Objects/unicodeobject.c @@ -1688,7 +1688,7 @@ PyObject *PyUnicode_EncodeUTF7(const Py_UNICODE *s, charsleft = (charsleft << 16) | ch; /* out, charsleft, bitsleft = */ ENCODE(out, charsleft, bitsleft); - /* If the next character is special then we dont' need to terminate + /* If the next character is special then we don't need to terminate the shift sequence. If the next character is not a BASE64 character or '-' then the shift sequence will be terminated implicitly and we don't have to insert a '-'. */ |