re-coded bisect

Author: macr

names/names.py

@@ -1,7 +1,18 @@
-from bisect import bisect_left
 import time
 
 
+def bisect_left(a, x, lo=0, hi=None):
+    if hi is None:
+        hi = len(a)
+    while lo < hi:
+        mid = (lo+hi)//2
+        if a[mid] < x:
+            lo = mid+1
+        else:
+            hi = mid
+    return lo
+
+
 class BinarySearchTree:
     def __init__(self, value):
         self.value = value