def test_BinaryIntervalSearchTree():
bist = si.BinaryIntervalSearchTree([(0, .9, 'A'), (1, 1.9, 'B'), (3, 3.9, 'D'), (2, 2.9, 'C')])
assert bist.search(1.5)[2] == 'B'
assert bist.search(0)[2] == 'A'
assert bist.search(2.5)[2] == 'C'
assert bist.search(3.5)[2] == 'D'
def test_BinaryIntervalSearchTree_shared_endpoint():
bist = si.BinaryIntervalSearchTree([(0, 1, 'A'), (1, 2, 'B')])
assert bist.search(0)[2] == 'A'
assert bist.search(1)[2] == 'A'
assert bist.search(1.5)[2] == 'B'