datasketch/lshforest.py
def _binary_search(self, n, func):
        '''
        https://golang.org/src/sort/search.go?s=2247:2287#L49
        '''
        i, j = 0, n
        while i < j:
            h = int(i + (j - i) / 2)
            if not func(h):
                i = h + 1
            else:
                j = h
        return i
def _binary_search(self, n, func):
        '''
        https://golang.org/src/sort/search.go?s=2247:2287#L49
        '''
        i, j = 0, n
        while i < j:
            h = int(i + (j - i) / 2)
            if not func(h):
                i = h + 1
            else:
                j = h
        return i
def _binary_search ( self , n , func ) : i , j = 0 , n while i < j : h = int ( i + ( j - i ) / 2 ) if not func ( h ) : i = h + 1 else : j = h return i
https://golang.org/src/sort/search.go?s=2247:2287#L49
https : // golang . org / src / sort / search . go?s = 2247 : 2287#L49