[Python-checkins] cpython: Issue #27076: More doc and comment spelling fixes for 3.6, by Ville Skyttä

martin.panter python-checkins at python.org
Thu May 26 02:29:48 EDT 2016


https://hg.python.org/cpython/rev/d3d8faaaaade
changeset:   101501:d3d8faaaaade
user:        Martin Panter <vadmium+py at gmail.com>
date:        Thu May 26 06:03:33 2016 +0000
summary:
  Issue #27076: More doc and comment spelling fixes for 3.6, by Ville Skyttä

files:
  Doc/library/datetime.rst   |  2 +-
  Doc/library/imaplib.rst    |  2 +-
  Lib/statistics.py          |  4 ++--
  Lib/test/test_itertools.py |  2 +-
  4 files changed, 5 insertions(+), 5 deletions(-)


diff --git a/Doc/library/datetime.rst b/Doc/library/datetime.rst
--- a/Doc/library/datetime.rst
+++ b/Doc/library/datetime.rst
@@ -2079,7 +2079,7 @@
    Similar to ``%U`` and ``%W``, ``%V`` is only used in calculations when the
    day of the week and the ISO year (``%G``) are specified in a
    :meth:`strptime` format string. Also note that ``%G`` and ``%Y`` are not
-   interchangable.
+   interchangeable.
 
 .. rubric:: Footnotes
 
diff --git a/Doc/library/imaplib.rst b/Doc/library/imaplib.rst
--- a/Doc/library/imaplib.rst
+++ b/Doc/library/imaplib.rst
@@ -507,7 +507,7 @@
       allowed creation of such tags, and popular IMAP servers, such as Gmail,
       accept and produce such flags.  There are non-Python programs which also
       create such tags.  Although it is an RFC violation and IMAP clients and
-      servers are supposed to be strict, imaplib nontheless continues to allow
+      servers are supposed to be strict, imaplib nonetheless continues to allow
       such tags to be created for backward compatibility reasons, and as of
       python 3.6, handles them if they are sent from the server, since this
       improves real-world compatibility.
diff --git a/Lib/statistics.py b/Lib/statistics.py
--- a/Lib/statistics.py
+++ b/Lib/statistics.py
@@ -430,9 +430,9 @@
         L = float(x) - float(interval)/2
 
     # Uses bisection search to search for x in data with log(n) time complexity
-    # Find the position of leftmost occurence of x in data
+    # Find the position of leftmost occurrence of x in data
     l1 = _find_lteq(data, x)
-    # Find the position of rightmost occurence of x in data[l1...len(data)]
+    # Find the position of rightmost occurrence of x in data[l1...len(data)]
     # Assuming always l1 <= l2
     l2 = _find_rteq(data, l1, x)
     cf = l1
diff --git a/Lib/test/test_itertools.py b/Lib/test/test_itertools.py
--- a/Lib/test/test_itertools.py
+++ b/Lib/test/test_itertools.py
@@ -635,7 +635,7 @@
         # Mode 0 is efficient.  It uses an incompletely consumed input
         # iterator to build a cycle object and then passes in state with
         # a list of previously consumed values.  There is no data
-        # overlap bewteen the two.
+        # overlap between the two.
         c = cycle('defg')
         c.__setstate__((list('abc'), 0))
         self.assertEqual(take(20, c), list('defgabcdefgabcdefgab'))

-- 
Repository URL: https://hg.python.org/cpython


More information about the Python-checkins mailing list