From 96be3400a97946b0b3d032dd8c3c0561786796f1 Mon Sep 17 00:00:00 2001
From: Chillar Anand <chillar@avilpage.com>
Date: Mon, 8 Apr 2019 13:31:09 +0530
Subject: [PATCH] remove duplicate code in biscet (GH-1270)

---
 Lib/bisect.py | 18 ++----------------
 1 file changed, 2 insertions(+), 16 deletions(-)

diff --git a/Lib/bisect.py b/Lib/bisect.py
index 7732c639e38..9786fc9d87c 100644
--- a/Lib/bisect.py
+++ b/Lib/bisect.py
@@ -9,14 +9,7 @@ def insort_right(a, x, lo=0, hi=None):
     slice of a to be searched.
     """
 
-    if lo < 0:
-        raise ValueError('lo must be non-negative')
-    if hi is None:
-        hi = len(a)
-    while lo < hi:
-        mid = (lo+hi)//2
-        if x < a[mid]: hi = mid
-        else: lo = mid+1
+    lo = bisect_right(a, x, lo, hi)
     a.insert(lo, x)
 
 def bisect_right(a, x, lo=0, hi=None):
@@ -49,14 +42,7 @@ def insort_left(a, x, lo=0, hi=None):
     slice of a to be searched.
     """
 
-    if lo < 0:
-        raise ValueError('lo must be non-negative')
-    if hi is None:
-        hi = len(a)
-    while lo < hi:
-        mid = (lo+hi)//2
-        if a[mid] < x: lo = mid+1
-        else: hi = mid
+    lo = bisect_left(a, x, lo, hi)
     a.insert(lo, x)