summaryrefslogtreecommitdiff
path: root/Lib/bisect.py
diff options
context:
space:
mode:
authorBenjamin Peterson <benjamin@python.org>2017-01-31 23:31:20 -0800
committerBenjamin Peterson <benjamin@python.org>2017-01-31 23:31:20 -0800
commit75a56cd1847142d9c893b6df5fb674f54b34d9ed (patch)
tree73d254a7d8ed4bc2f76293a2b2e223c3f48e7dd4 /Lib/bisect.py
parentbff21dc9e43eaf9549abe72a32d98a6c20de8c5b (diff)
parentfcd15724f28a5249f13690af32dc12628ab186c6 (diff)
downloadcpython-75a56cd1847142d9c893b6df5fb674f54b34d9ed.tar.gz
merge 3.6 (#29398)
Diffstat (limited to 'Lib/bisect.py')
-rw-r--r--Lib/bisect.py8
1 files changed, 4 insertions, 4 deletions
diff --git a/Lib/bisect.py b/Lib/bisect.py
index 4a4d05255e..7732c639e3 100644
--- a/Lib/bisect.py
+++ b/Lib/bisect.py
@@ -19,8 +19,6 @@ def insort_right(a, x, lo=0, hi=None):
else: lo = mid+1
a.insert(lo, x)
-insort = insort_right # backward compatibility
-
def bisect_right(a, x, lo=0, hi=None):
"""Return the index where to insert item x in list a, assuming a is sorted.
@@ -42,8 +40,6 @@ def bisect_right(a, x, lo=0, hi=None):
else: lo = mid+1
return lo
-bisect = bisect_right # backward compatibility
-
def insort_left(a, x, lo=0, hi=None):
"""Insert item x in list a, and keep it sorted assuming a is sorted.
@@ -90,3 +86,7 @@ try:
from _bisect import *
except ImportError:
pass
+
+# Create aliases
+bisect = bisect_right
+insort = insort_right