bsearch 0.0.3

Binary search - bisect_left and bisect_right with more flexible comparison

Bsearch

Binary search in python with more flexible comparisons.

Installation

pip install bsearch

Usage

bisect_left and bisect_right are backwards compatible with the bisect library. For example:

from bsearch import bisect_left
a = [1,2,3,4,5]
i = bisect_left(a, 4) # returns 3

You can use the key option to search arrays of different types

from bsearch import bisect_left
a = [(1,100), (2, 100), (5,200)]

# using the first element of the tuple as the key
i = bisect_left(a, 2, key=lambda x: x[0]) # returns 1

To search descending list, use the wrapper binary_search, and provide an operator. This will return the smallest i such that op(a[i], v)

from bsearch import binary_search
a = [5, 4, 3, 2]
i = binary_search(a, 4, op=lambda a b: a >= b) # returns 1