mirror of
https://github.com/facebook/sapling.git
synced 2024-10-11 01:07:15 +03:00
470276319f
Summary: Since we have some of the nodes sorted we can now use bisect to quickly find matching nodes. Test Plan: arc unit Reviewers: #sourcecontrol Subscribers: mjpieters Differential Revision: https://phabricator.intern.facebook.com/D4494419
23 lines
519 B
Python
23 lines
519 B
Python
|
|
def bisect(l, r, comp, val):
|
|
'''Bisect algorithm with custom compare function
|
|
|
|
Returns smallest index between l and r whose value is equal to val.
|
|
Returns None if there are no such index.
|
|
'''
|
|
if r < l:
|
|
return None
|
|
while l < r:
|
|
m = (l + r) / 2
|
|
cmpresult = comp(m, val)
|
|
if cmpresult == -1:
|
|
l = m + 1
|
|
elif cmpresult == 0:
|
|
r = m
|
|
else:
|
|
r = m - 1
|
|
|
|
if r < l or comp(l, val) != 0:
|
|
return None
|
|
return l
|