summaryrefslogtreecommitdiffstats
path: root/Doc/library/heapq.rst
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2009-07-26 14:37:28 (GMT)
committerGeorg Brandl <georg@python.org>2009-07-26 14:37:28 (GMT)
commitd7d4fd7336baca618eb02b9a7e862bd8452d8f7d (patch)
tree2273b0b04e103df5de2a4d51d56bcf20793f1719 /Doc/library/heapq.rst
parent9fa61bb37d68225c827aa7809382ea701c264db5 (diff)
downloadcpython-d7d4fd7336baca618eb02b9a7e862bd8452d8f7d.zip
cpython-d7d4fd7336baca618eb02b9a7e862bd8452d8f7d.tar.gz
cpython-d7d4fd7336baca618eb02b9a7e862bd8452d8f7d.tar.bz2
builtin -> built-in.
Diffstat (limited to 'Doc/library/heapq.rst')
-rw-r--r--Doc/library/heapq.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index bf7e3c4..9a44047 100644
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -147,7 +147,7 @@ The module also offers three general purpose functions based on heaps.
The latter two functions perform best for smaller values of *n*. For larger
values, it is more efficient to use the :func:`sorted` function. Also, when
-``n==1``, it is more efficient to use the builtin :func:`min` and :func:`max`
+``n==1``, it is more efficient to use the built-in :func:`min` and :func:`max`
functions.