summaryrefslogtreecommitdiffstats
path: root/Lib/heapq.py
diff options
context:
space:
mode:
authorBerker Peksag <berker.peksag@gmail.com>2014-10-19 15:07:05 (GMT)
committerBerker Peksag <berker.peksag@gmail.com>2014-10-19 15:07:05 (GMT)
commit1ed2e69a4ac1a4ac5a83ce3ab332b3051eaf59f0 (patch)
tree141b094c4dc7ce5297eb46e9ce881651abf9a71d /Lib/heapq.py
parent8c06ac5e5817fc7038c92115035107f9ff6c7a64 (diff)
parentf23530f5690d2e37bba7235a6398b2c386a5b485 (diff)
downloadcpython-1ed2e69a4ac1a4ac5a83ce3ab332b3051eaf59f0.zip
cpython-1ed2e69a4ac1a4ac5a83ce3ab332b3051eaf59f0.tar.gz
cpython-1ed2e69a4ac1a4ac5a83ce3ab332b3051eaf59f0.tar.bz2
Issue #22186: Fix typos in Lib/.
Patch by FĂ©vry Thibault.
Diffstat (limited to 'Lib/heapq.py')
-rw-r--r--Lib/heapq.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py
index 258c0ba..07af37e 100644
--- a/Lib/heapq.py
+++ b/Lib/heapq.py
@@ -429,7 +429,7 @@ def merge(*iterables, key=None, reverse=False):
# value seen being in the 100 most extreme values is 100/101.
# * If the value is a new extreme value, the cost of inserting it into the
# heap is 1 + log(k, 2).
-# * The probabilty times the cost gives:
+# * The probability times the cost gives:
# (k/i) * (1 + log(k, 2))
# * Summing across the remaining n-k elements gives:
# sum((k/i) * (1 + log(k, 2)) for i in range(k+1, n+1))