Revert "Fix various typos and spelling errors found by codespell."

This reverts commit a93e9d6.

Author: corneliusroemer

Doc/README.rst

@@ -59,10 +59,10 @@ Available make targets are:
 
 * "html", which builds standalone HTML files for offline viewing.
 
-* "htmlview", which reuses the "html" builder, but then opens the main page
+* "htmlview", which re-uses the "html" builder, but then opens the main page
   in your default web browser.
 
-* "htmllive", which reuses the "html" builder, rebuilds the docs,
+* "htmllive", which re-uses the "html" builder, rebuilds the docs,
   starts a local server, and automatically reloads the page in your browser
   when you make changes to reST files (Unix only).
 

Doc/extending/extending.rst

@@ -214,7 +214,7 @@ and initialize it by calling :c:func:`PyErr_NewException` in the module's
 
    SpamError = PyErr_NewException("spam.error", NULL, NULL);
 
-Since :c:data:`!SpamError` is a global variable, it will be overwritten every time
+Since :c:data:`!SpamError` is a global variable, it will be overwitten every time
 the module is reinitialized, when the :c:data:`Py_mod_exec` function is called.
 
 For now, let's avoid the issue: we will block repeated initialization by raising an

Doc/howto/functional.rst

@@ -375,7 +375,7 @@ have the form::
                  if condition3
                  ...
                  for exprN in sequenceN
-                 if condition )
+                 if conditionN )
 
 Again, for a list comprehension only the outside brackets are different (square
 brackets instead of parentheses).
@@ -407,7 +407,7 @@ equivalent to the following Python code::
                 continue   # Skip this element
             ...
             for exprN in sequenceN:
-                if not (condition):
+                if not (conditionN):
                     continue   # Skip this element
 
                 # Output the value of

Doc/howto/gdb_helpers.rst

@@ -136,7 +136,7 @@ enabled::
        at Objects/unicodeobject.c:551
    #7  0x0000000000440d94 in PyUnicodeUCS2_FromString (u=0x5c2b8d "__lltrace__") at Objects/unicodeobject.c:569
    #8  0x0000000000584abd in PyDict_GetItemString (v=
-       {'Yuck': <type at remote 0xad4730>, '__builtins__': <module at remote 0x7ffff7fd5ee8>, '__file__': 'Lib/test/crashes/nasty_eq_vs_dict.py', '__package__': None, 'y': <Yuck(i=0) at remote 0xaacd80>, 'dict': {0: 0, 1: 1, 2: 2, 3: 3}, '__cached__': None, '__name__': '__main__', 'z': <Yuck(i=0) at remote 0xaace60>, '__doc__': None}, key=
+       {'Yuck': <type at remote 0xad4730>, '__builtins__': <module at remote 0x7ffff7fd5ee8>, '__file__': 'Lib/test/crashers/nasty_eq_vs_dict.py', '__package__': None, 'y': <Yuck(i=0) at remote 0xaacd80>, 'dict': {0: 0, 1: 1, 2: 2, 3: 3}, '__cached__': None, '__name__': '__main__', 'z': <Yuck(i=0) at remote 0xaace60>, '__doc__': None}, key=
        0x5c2b8d "__lltrace__") at Objects/dictobject.c:2171
 
 Notice how the dictionary argument to ``PyDict_GetItemString`` is displayed

Doc/includes/email-read-alternative.py

@@ -36,8 +36,8 @@ def magic_html_parser(html_text, partfiles):
 print()
 print(''.join(simplest.get_content().splitlines(keepends=True)[:3]))
 
-and = input("View full message?")
-if and.lower()[0] == 'n':
+ans = input("View full message?")
+if ans.lower()[0] == 'n':
     sys.exit()
 
 # We can extract the richest alternative in order to display it:

Doc/library/bz2.rst

@@ -322,9 +322,9 @@ Using :func:`compress` and :func:`decompress` to demonstrate round-trip compress
     >>> import bz2
     >>> data = b"""\
     ... Donec rhoncus quis sapien sit amet molestie. Fusce scelerisque vel augue
-    ... nec ullamcorper. Name rutrum pretium placerat. Aliquam vel tristique lorem,
+    ... nec ullamcorper. Nam rutrum pretium placerat. Aliquam vel tristique lorem,
     ... sit amet cursus ante. In interdum laoreet mi, sit amet ultrices purus
-    ... pulvinar a. Name gravida euismod magna, non various justo tincidunt feugiat.
+    ... pulvinar a. Nam gravida euismod magna, non varius justo tincidunt feugiat.
     ... Aliquam pharetra lacus non risus vehicula rutrum. Maecenas aliquam leo
     ... felis. Pellentesque semper nunc sit amet nibh ullamcorper, ac elementum
     ... dolor luctus. Curabitur lacinia mi ornare consectetur vestibulum."""
@@ -362,9 +362,9 @@ Writing and reading a bzip2-compressed file in binary mode:
     >>> import bz2
     >>> data = b"""\
     ... Donec rhoncus quis sapien sit amet molestie. Fusce scelerisque vel augue
-    ... nec ullamcorper. Name rutrum pretium placerat. Aliquam vel tristique lorem,
+    ... nec ullamcorper. Nam rutrum pretium placerat. Aliquam vel tristique lorem,
     ... sit amet cursus ante. In interdum laoreet mi, sit amet ultrices purus
-    ... pulvinar a. Name gravida euismod magna, non various justo tincidunt feugiat.
+    ... pulvinar a. Nam gravida euismod magna, non varius justo tincidunt feugiat.
     ... Aliquam pharetra lacus non risus vehicula rutrum. Maecenas aliquam leo
     ... felis. Pellentesque semper nunc sit amet nibh ullamcorper, ac elementum
     ... dolor luctus. Curabitur lacinia mi ornare consectetur vestibulum."""

Doc/library/collections.rst

@@ -455,8 +455,8 @@ or subtracting from an empty counter.
     Returns a new deque object initialized left-to-right (using :meth:`append`) with
     data from *iterable*.  If *iterable* is not specified, the new deque is empty.
 
-    Dequeues are a generalization of stacks and queues (the name is pronounced "deck"
-    and is short for "double-ended queue").  Dequeues support thread-safe, memory
+    Deques are a generalization of stacks and queues (the name is pronounced "deck"
+    and is short for "double-ended queue").  Deques support thread-safe, memory
     efficient appends and pops from either side of the deque with approximately the
     same *O*\ (1) performance in either direction.
 
@@ -466,11 +466,11 @@ or subtracting from an empty counter.
     position of the underlying data representation.
 
 
-    If *maxlen* is not specified or is ``None``, dequeues may grow to an
+    If *maxlen* is not specified or is ``None``, deques may grow to an
     arbitrary length.  Otherwise, the deque is bounded to the specified maximum
     length.  Once a bounded length deque is full, when new items are added, a
     corresponding number of items are discarded from the opposite end.  Bounded
-    length dequeues provide functionality similar to the ``tail`` filter in
+    length deques provide functionality similar to the ``tail`` filter in
     Unix. They are also useful for tracking transactions and other pools of data
     where only the most recent activity is of interest.
 
@@ -582,13 +582,13 @@ or subtracting from an empty counter.
         .. versionadded:: 3.1
 
 
-In addition to the above, dequeues support iteration, pickling, ``len(d)``,
+In addition to the above, deques support iteration, pickling, ``len(d)``,
 ``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing with
 the :keyword:`in` operator, and subscript references such as ``d[0]`` to access
 the first element.  Indexed access is *O*\ (1) at both ends but slows to *O*\ (*n*) in
 the middle.  For fast random access, use lists instead.
 
-Starting in version 3.5, dequeues support ``__add__()``, ``__mul__()``,
+Starting in version 3.5, deques support ``__add__()``, ``__mul__()``,
 and ``__imul__()``.
 
 Example:
@@ -650,17 +650,17 @@ Example:
 :class:`deque` Recipes
 ^^^^^^^^^^^^^^^^^^^^^^
 
-This section shows various approaches to working with dequeues.
+This section shows various approaches to working with deques.
 
-Bounded length dequeues provide functionality similar to the ``tail`` filter
+Bounded length deques provide functionality similar to the ``tail`` filter
 in Unix::
 
     def tail(filename, n=10):
         'Return the last n lines of a file'
         with open(filename) as f:
             return deque(f, n)
 
-Another approach to using dequeues is to maintain a sequence of recently
+Another approach to using deques is to maintain a sequence of recently
 added elements by appending to the right and popping to the left::
 
     def moving_average(iterable, n=3):

Doc/library/datetime.rst

@@ -2515,8 +2515,8 @@ requires, and these work on all platforms with a standard C implementation.
 +-----------+--------------------------------+------------------------+-------+
 | ``%B``    | Month as locale's full name.   || January, February,    | \(1)  |
 |           |                                |  ..., December (en_US);|       |
-|           |                                || January, February, ..., |       |
-|           |                                |  December (de_DE)      |       |
+|           |                                || Januar, Februar, ..., |       |
+|           |                                |  Dezember (de_DE)      |       |
 +-----------+--------------------------------+------------------------+-------+
 | ``%m``    | Month as a zero-padded         | 01, 02, ..., 12        | \(9)  |
 |           | decimal number.                |                        |       |

Doc/library/difflib.rst

@@ -246,7 +246,7 @@ diffs. For comparing directories and files, see also, the :mod:`filecmp` module.
       >>> print(''.join(diff), end="")
       - one
       ?  ^
-      + or
+      + ore
       ?  ^
       - two
       - three
@@ -273,7 +273,7 @@ diffs. For comparing directories and files, see also, the :mod:`filecmp` module.
       two
       three
       >>> print(''.join(restore(diff, 2)), end="")
-      or
+      ore
       tree
       emu
 
@@ -420,12 +420,12 @@ The :class:`SequenceMatcher` class has this constructor:
       is not changed.
 
 
-   .. method:: find_longest_match(also=0, ahi=None, blo=0, bhi=None)
+   .. method:: find_longest_match(alo=0, ahi=None, blo=0, bhi=None)
 
-      Find longest matching block in ``a[also:ahi]`` and ``b[blo:bhi]``.
+      Find longest matching block in ``a[alo:ahi]`` and ``b[blo:bhi]``.
 
       If *isjunk* was omitted or ``None``, :meth:`find_longest_match` returns
-      ``(i, j, k)`` such that ``a[i:i+k]`` is equal to ``b[j:j+k]``, where ``also
+      ``(i, j, k)`` such that ``a[i:i+k]`` is equal to ``b[j:j+k]``, where ``alo
       <= i <= i+k <= ahi`` and ``blo <= j <= j+k <= bhi``. For all ``(i', j',
       k')`` meeting those conditions, the additional conditions ``k >= k'``, ``i
       <= i'``, and if ``i == i'``, ``j <= j'`` are also met. In other words, of
@@ -453,7 +453,7 @@ The :class:`SequenceMatcher` class has this constructor:
          >>> s.find_longest_match(0, 5, 0, 9)
          Match(a=1, b=0, size=4)
 
-      If no blocks match, this returns ``(also, blo, 0)``.
+      If no blocks match, this returns ``(alo, blo, 0)``.
 
       This method returns a :term:`named tuple` ``Match(a, b, size)``.
 

Doc/library/index.rst

@@ -54,7 +54,7 @@ the `Python Package Index <https://pypi.org>`_.
    archiving.rst
    fileformats.rst
    crypto.rst
-   allows.rst
+   allos.rst
    cmdlinelibs.rst
    concurrency.rst
    ipc.rst