Commit f157982b authored by Martin Panter's avatar Martin Panter

Issue #27076: More doc and comment spelling fixes for 3.6, by Ville Skyttä

parent 3e04d5b3
...@@ -2079,7 +2079,7 @@ Notes: ...@@ -2079,7 +2079,7 @@ Notes:
Similar to ``%U`` and ``%W``, ``%V`` is only used in calculations when the 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 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 :meth:`strptime` format string. Also note that ``%G`` and ``%Y`` are not
interchangable. interchangeable.
.. rubric:: Footnotes .. rubric:: Footnotes
......
...@@ -507,7 +507,7 @@ An :class:`IMAP4` instance has the following methods: ...@@ -507,7 +507,7 @@ An :class:`IMAP4` instance has the following methods:
allowed creation of such tags, and popular IMAP servers, such as Gmail, allowed creation of such tags, and popular IMAP servers, such as Gmail,
accept and produce such flags. There are non-Python programs which also 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 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 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 python 3.6, handles them if they are sent from the server, since this
improves real-world compatibility. improves real-world compatibility.
......
...@@ -430,9 +430,9 @@ def median_grouped(data, interval=1): ...@@ -430,9 +430,9 @@ def median_grouped(data, interval=1):
L = float(x) - float(interval)/2 L = float(x) - float(interval)/2
# Uses bisection search to search for x in data with log(n) time complexity # 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) 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 # Assuming always l1 <= l2
l2 = _find_rteq(data, l1, x) l2 = _find_rteq(data, l1, x)
cf = l1 cf = l1
......
...@@ -635,7 +635,7 @@ class TestBasicOps(unittest.TestCase): ...@@ -635,7 +635,7 @@ class TestBasicOps(unittest.TestCase):
# Mode 0 is efficient. It uses an incompletely consumed input # Mode 0 is efficient. It uses an incompletely consumed input
# iterator to build a cycle object and then passes in state with # iterator to build a cycle object and then passes in state with
# a list of previously consumed values. There is no data # a list of previously consumed values. There is no data
# overlap bewteen the two. # overlap between the two.
c = cycle('defg') c = cycle('defg')
c.__setstate__((list('abc'), 0)) c.__setstate__((list('abc'), 0))
self.assertEqual(take(20, c), list('defgabcdefgabcdefgab')) self.assertEqual(take(20, c), list('defgabcdefgabcdefgab'))
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment