Issue #27076: More doc and comment spelling fixes for 3.6, by Ville Skyttä
diff --git a/Lib/statistics.py b/Lib/statistics.py
index fc0c3d2..b081b5a 100644
--- 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
index 3bbfdf1..945c58d 100644
--- 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'))