def test_get_min_height_of_max_of_all_pairs():
heights = np.array([10, 10, 10, 10, 10, 10, 10, 10, 1, 8, 7, 7, 7, 10, 10, 6, 8, 5, 5, 5, 10,
10, 8, 8, 4, 2, 4, 10, 10, 9, 9, 3, 3, 3, 10, 10, 0, 1, 5, 5, 5, 10, 10,
10, 10, 10, 10, 10, 10])
watersheds = [np.array([0, 1, 2, 7, 8, 9, 14, 15, 16, 21, 22]),
np.array([3, 4, 5, 6, 10, 11, 12, 13, 17, 18, 19, 20, 23, 24, 25, 26, 27,
32, 33, 34, 39, 40, 41, 46, 47, 48]),
np.array([28, 29, 30, 31, 35, 36, 37, 38, 42, 43, 44, 45])]
boundary_pairs = [np.array([np.array([2, 2, 9, 9, 9, 15, 16, 16, 16, 16, 21, 21, 22, 22, 22, 22]),
np.array([3, 10, 3, 10, 17, 23, 10, 17, 23, 24, 28, 29, 23, 28, 29, 30])]),
np.array([np.array([3, 3, 10, 10, 10, 17, 17, 23, 23, 23, 23, 23, 23, 24, 24, 24, 25, 32, 32, 39, 39, 39, 46, 46]),
np.array([2, 9, 2, 9, 16, 9, 16, 15, 16, 22, 29, 30, 31, 16, 30, 31, 31, 31, 38, 31, 38, 45, 38, 45])]),
np.array([np.array([28, 28, 29, 29, 29, 30, 30, 30, 31, 31, 31, 31, 31, 38, 38, 38, 45, 45]),
np.array([21, 22, 21, 22, 23, 22, 23, 24, 23, 24, 25, 32, 39, 32, 39, 46, 39, 46])])]
result_max_heights_of_pairs = np.array([np.array([10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 10, 10, 8, 10, 9, 9]),
np.array([10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 9, 9, 8, 8, 9, 4, 3, 3, 5, 5, 5, 10, 10, 10]),
np.array([10, 10, 10, 9, 9, 9, 9, 9, 8, 4, 3, 3, 5, 5, 5, 10, 10, 10])])
result_min_of_max = np.array([8, 3, 3])
min_of_max, temp = trap_analysis.get_min_height_of_max_of_all_pairs(boundary_pairs, heights)
are_equal = compare_methods.compare_two_lists_of_arrays(min_of_max, result_min_of_max)
assert are_equal
def test_get_boundary_nodes_in_watersheds_advanced():
num_of_cols = 9
num_of_rows = 9
watersheds = [np.array([79, 41, 42, 43, 69, 51, 52, 53, 71, 70, 60, 61, 62, 78, 44, 40, 34,
6, 7, 8, 14, 15, 16, 35, 23, 24, 25, 17, 80, 33, 32, 31, 26]),
np.array([0, 36, 39, 30, 29, 28, 27, 22, 21, 20, 37, 18, 13, 19, 38,
1, 2, 11, 10, 9, 3, 4, 12, 5]),
np.array([77, 76, 75, 74, 73, 72, 68, 67, 50, 49, 64, 63, 45, 46,
47, 59, 58, 57, 56, 55, 54, 48, 65, 66])]
result_boundary_nodes = [np.array([6, 7, 8, 14, 15, 17, 23, 26, 31, 32, 35, 40, 41, 42, 44, 51,
53, 60, 62, 69, 71, 78, 79, 80]),
np.array([0, 1, 2, 3, 4, 5, 9, 13, 18, 21, 22, 27, 30, 36, 37, 38, 39]),
np.array([45, 46, 47, 48, 49, 50, 54, 59, 63, 68, 72, 73, 74, 75, 76, 77])]
boundary_nodes = trap_analysis.get_boundary_nodes_in_watersheds(watersheds, num_of_cols, num_of_rows)
# Sort the elements of each boundary as the compare method is more conservative.
for i in range(len(boundary_nodes)):
boundary_nodes[i] = np.sort(boundary_nodes[i])
print boundary_nodes
are_equal = compare_methods.compare_two_lists_of_arrays(boundary_nodes, result_boundary_nodes)
assert are_equal
def test_compare_two_lists_of_arrays_one():
# The lists have different lengths
l1 = [np.array([1, 2, 3]), np.array([4, 5, 6])]
l2 = [np.array([1, 2, 3])]
are_equal = compare_methods.compare_two_lists_of_arrays(l1, l2)
assert are_equal is False
def test_compare_two_lists_of_arrays_five():
# The lists are equal
l1 = [np.array([1, 2, 3]), np.array([4, 5, 6])]
l2 = [np.array([1, 2, 3]), np.array([4, 5, 6])]
are_equal = compare_methods.compare_two_lists_of_arrays(l1, l2)
assert are_equal
def test_compare_two_lists_of_arrays_three():
# The lists have arrays with different orderings
l1 = [np.array([1, 2, 3]), np.array([4, 5, 6])]
l2 = [np.array([1, 2, 3]), np.array([6, 5, 4])]
are_equal = compare_methods.compare_two_lists_of_arrays(l1, l2)
assert are_equal is False
def test_get_watersheds_basic():
num_of_cols = 3
num_of_rows = 3
heights = np.array([0, 1, 2, 1, 2, 3, 2, 3, 1])
result_watersheds = [np.array([0, 1, 2, 3, 4, 6]), np.array([5, 7, 8])]
watersheds = trap_analysis.get_watersheds(heights, num_of_cols, num_of_rows)
# Sort the elements of each watershed as the compare method is more conservative.
for i in range(len(watersheds)):
watersheds[i] = np.sort(watersheds[i])
are_equal = compare_methods.compare_two_lists_of_arrays(watersheds, result_watersheds)
assert are_equal
def test_get_watersheds_advanced():
num_of_cols = 6
num_of_rows = 5
heights = np.array([5, 7, 8, 7, 6, 0, 7, 2, 10, 10, 7, 6, 7, 2, 4, 5, 5, 4, 7, 7, 3.9, 4, 0, 0, 6, 5, 4, 4, 0, 0])
result_watersheds = [np.array([3, 4, 5, 10, 11]),
np.array([0, 1, 2, 6, 7, 8, 12, 13, 14, 18, 19, 20, 24, 25, 26]),
np.array([9, 15, 16, 17, 21, 22, 23, 27, 28, 29])]
watersheds = trap_analysis.get_watersheds(heights, num_of_cols, num_of_rows)
# Sort the elements of each watershed as the compare method is more conservative.
for i in range(len(watersheds)):
watersheds[i] = np.sort(watersheds[i])
are_equal = compare_methods.compare_two_lists_of_arrays(watersheds, result_watersheds)
assert are_equal
def test_get_spill_pairs():
max_heights_of_pairs = np.array([np.array([10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 10, 10, 8, 10, 9, 9]),
np.array([10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 9, 9, 8, 8, 9, 4, 3, 3, 5, 5, 5, 10, 10, 10]),
np.array([10, 10, 10, 9, 9, 9, 9, 9, 8, 4, 3, 3, 5, 5, 5, 10, 10, 10])])
boundary_pairs = [np.array([np.array([2, 2, 9, 9, 9, 15, 16, 16, 16, 16, 21, 21, 22, 22, 22, 22]),
np.array([3, 10, 3, 10, 17, 23, 10, 17, 23, 24, 28, 29, 23, 28, 29, 30])]),
np.array([np.array([3, 3, 10, 10, 10, 17, 17, 23, 23, 23, 23, 23, 23, 24, 24, 24, 25, 32, 32, 39, 39, 39, 46, 46]),
np.array([2, 9, 2, 9, 16, 9, 16, 15, 16, 22, 29, 30, 31, 16, 30, 31, 31, 31, 38, 31, 38, 45, 38, 45])]),
np.array([np.array([28, 28, 29, 29, 29, 30, 30, 30, 31, 31, 31, 31, 31, 38, 38, 38, 45, 45]),
np.array([21, 22, 21, 22, 23, 22, 23, 24, 23, 24, 25, 32, 39, 32, 39, 46, 39, 46])])]
min_of_max = np.array([8, 3, 3])
result_spill_pairs = [np.array([3, 4, 5, 6, 7, 8, 9, 12]), np.array([16, 17]), np.array([10, 11])]
spill_pairs = trap_analysis.get_spill_pairs(max_heights_of_pairs, min_of_max)
are_equal = compare_methods.compare_two_lists_of_arrays(spill_pairs, result_spill_pairs)
assert are_equal
def test_get_boundary_pairs_in_watersheds():
nx = 7
ny = 7
watersheds = [np.array([0, 1, 2, 7, 8, 9, 14, 15, 16, 21, 22]),
np.array([3, 4, 5, 6, 10, 11, 12, 13, 17, 18, 19, 20, 23, 24, 25, 26, 27,
32, 33, 34, 39, 40, 41, 46, 47, 48]),
np.array([28, 29, 30, 31, 35, 36, 37, 38, 42, 43, 44, 45])]
result_boundary_pairs = [np.array([np.array([2, 2, 9, 9, 9, 15, 16, 16, 16, 16, 21, 21, 22, 22, 22, 22]),
np.array([3, 10, 3, 10, 17, 23, 10, 17, 23, 24, 28, 29, 23, 28, 29, 30])]),
np.array([np.array([3, 3, 10, 10, 10, 17, 17, 23, 23, 23, 23, 23, 23, 24, 24, 24, 25, 32, 32, 39, 39, 39, 46, 46]),
np.array([2, 9, 2, 9, 16, 9, 16, 15, 16, 22, 29, 30, 31, 16, 30, 31, 31, 31, 38, 31, 38, 45, 38, 45])]),
np.array([np.array([28, 28, 29, 29, 29, 30, 30, 30, 31, 31, 31, 31, 31, 38, 38, 38, 45, 45]),
np.array([21, 22, 21, 22, 23, 22, 23, 24, 23, 24, 25, 32, 39, 32, 39, 46, 39, 46])])]
boundary_pairs = trap_analysis.get_boundary_pairs_in_watersheds(watersheds, nx, ny)
are_equal = compare_methods.compare_two_lists_of_arrays(boundary_pairs, result_boundary_pairs)
assert are_equal
def test_merge_watersheds_based_on_steepest_pairs():
nx = 7
ny = 7
watersheds = [np.array([0, 1, 2, 7, 8, 9, 14, 15, 16, 21, 22]),
np.array([3, 4, 5, 6, 10, 11, 12, 13, 17, 18, 19, 20, 23, 24, 25, 26, 27,
32, 33, 34, 39, 40, 41, 46, 47, 48]),
np.array([28, 29, 30, 31, 35, 36, 37, 38, 42, 43, 44, 45])]
heights = np.array([10, 10, 10, 10, 10, 10, 10, 10, 1, 8, 7, 7, 7, 10, 10, 6, 8, 5, 5, 5, 10,
10, 8, 8, 4, 2, 4, 10, 10, 9, 9, 3, 3, 3, 10, 10, 0, 1, 5, 5, 5, 10, 10,
10, 10, 10, 10, 10, 10])
steepest_pairs = [np.array([9, 10]), np.array([25, 31]), np.array([31, 25])]
result_merged_watersheds = [np.array([0, 1, 2])]
merged_watersheds = trap_analysis.merge_watersheds_based_on_steepest_pairs(steepest_pairs, watersheds,
heights, nx, ny)
are_equal = compare_methods.compare_two_lists_of_arrays(merged_watersheds, result_merged_watersheds)
assert are_equal
def test_get_boundary_nodes_in_watersheds():
num_of_cols = 6
num_of_rows = 5
watersheds = [np.array([3, 4, 5, 10, 11]),
np.array([0, 1, 2, 6, 7, 8, 12, 13, 14, 18, 19, 20, 24, 25, 26]),
np.array([9, 15, 16, 17, 21, 22, 23, 27, 28, 29])]
result_boundary_nodes = [np.array([3, 4, 5, 10, 11]),
np.array([0, 1, 2, 6, 8, 12, 14, 18, 20, 24, 25, 26]),
np.array([9, 15, 16, 17, 21, 23, 27, 28, 29])]
boundary_nodes = trap_analysis.get_boundary_nodes_in_watersheds(watersheds, num_of_cols, num_of_rows)
# Sort the elements of each boundary as the compare method is more conservative.
for i in range(len(boundary_nodes)):
boundary_nodes[i] = np.sort(boundary_nodes[i])
are_equal = compare_methods.compare_two_lists_of_arrays(boundary_nodes, result_boundary_nodes)
assert are_equal
def test_get_nodes_in_watersheds():
endpoints = np.array([7, 7, 7, 5, 5, 5, 7, 7, 7, 22, 5, 5, 13, 13, 13, 22, 22,
23, 13, 19, 19, 22, 22, 23, 25, 25, 25, 28, 28, 29])
combined_minimums = [{5}, {7, 13, 19, 25}, {22, 23, 28, 29}]
unique = np.array([5, 7, 13, 19, 22, 23, 25, 28, 29])
counts = np.array([5, 6, 3, 2, 3, 5, 2, 2, 1])
result_watersheds = [np.array([3, 4, 5, 10, 11]),
np.array([0, 1, 2, 6, 7, 8, 12, 13, 14, 18, 19, 20, 24, 25, 26]),
np.array([9, 15, 16, 17, 21, 22, 23, 27, 28, 29])]
watersheds = trap_analysis.get_nodes_in_watersheds(endpoints, combined_minimums)
# Sort the elements of each watershed as the compare method is more conservative.
for i in range(len(watersheds)):
watersheds[i] = np.sort(watersheds[i])
are_equal = compare_methods.compare_two_lists_of_arrays(watersheds, result_watersheds)
assert are_equal