def test_find_intersection_array(self):
# SA == SAcap at index 1.5, therefore SD=2.5
SD=array([[1,2,3.0],[1,2,3.0],[1,2,3.0]])
SA=array([[2,4,6.0],[2,4,6.0],[2,4,6.0]])
SAcap=array([[0,3,7.0],[0,3,4.0],[0,6,7.0]])
answer = [2.5,3,1.5]
assert allclose(find_intersection(SD,SA,SAcap),answer)
def test_find_intersection(self):
# SA == SAcap at index 1.5, therefore SD=2.5
SD=array([1,2,3.0]) # x-axis
SA=array([2,4,6.0]) # y-axis
SAcap=array([0,3,7.0]) # y-axis
assert (find_intersection(SD,SA,SAcap)==2.5)
# SA exceeds SAcap the whole way, so SD = max(SD)
SD=array([1,2,3.0])
SA=array([2,4,6.0])
SAcap=array([0,3,4.0])
assert (find_intersection(SD,SA,SAcap)==3.0)
# SA is exceeded by SAcap in the first bin
SD=array([1,2,3.0])
SA=array([2,4,6.0])
SAcap=array([0,6,7.0])
assert (find_intersection(SD,SA,SAcap)==1.5)
def test_find_intersectionII(self):
# If there is 2 intersections, are they found? No
SD=array([1,2,3.0])
SA=array([2,4,6.0])
SAcap=array([0,6,4.0])
assert (find_intersection(SD,SA,SAcap)==1.5)
