def test_search_1D(): tree = KDTree([1]) right = KDTree([2]) left = KDTree([0]) tree.right = right tree.left = left assert tree.search([2]) == right assert tree.search([0]) == left assert tree.search([3]) is None assert tree.search([-1]) is None
def test_search_2D(): tree = KDTree([1,1], k=2) right = KDTree([1,2], k=2, axis=1) tree.right = right assert tree.search([1,2]) == right assert tree.search([1,0]) is None
