def test_range_indexes_max_query(self):
a = [5, 3, 7, 4, 8]
b = list(enumerate(a))
def f(lst):
i, mx = lst[0]
for j, x in lst:
if x > mx:
i, mx = j, x
return i, mx
ign = (0, -float('inf'))
t = build_helper_tree(b, f=f, ignore=ign)
self.assertEqual([(4, 8), (2, 7), (4, 8), (0, 5), (2, 7), (3, 4),
(4, 8), (0, 5), (1, 3), (0, -float('inf')),
(0, -float('inf')), (0, -float('inf')),
(0, -float('inf')), (0, -float('inf')),
(0, -float('inf'))],
build_helper_tree(b, f=f, ignore=ign))
self.assertEqual([(0, 5), (0, 5), (1, 3), (2, 7), (2, 7), (2, 7),
(2, 7), (2, 7), (2, 7), (3, 4), (4, 8), (4, 8),
(4, 8), (4, 8), (4, 8)], [
rmq(len(a), t, i, j - 1, f=f, ignore=ign)
for j in range(1,
len(a) + 1) for i in range(j)
])
def test_range_sum_query(self):
a = [5, 3, 7, 4, 8]
c = [[sum(a[i:j]) for i in range(j)] for j in range(1, len(a) + 1)]
t = build_helper_tree(a, f=sum, ignore=0)
for j in range(1, len(a) + 1):
for i in range(j):
self.assertEqual(c[j - 1][i],
rmq(len(a), t, i, j - 1, f=sum, ignore=0))
def test_range_min_query(self):
a = [5, 3, 7, 4, 8]
c = prepare_stupid_rmq(a)
t = build_helper_tree(a)
for j in range(1, len(a) + 1):
for i in range(j):
self.assertEqual(stupid_rmq(c, i, j - 1),
rmq(len(a), t, i, j - 1))
def test_range_max_query(self):
a = [5, 3, 7, 4, 8]
c = prepare_stupid_rmq(a, f=max)
t = build_helper_tree(a, f=max, ignore=-float('inf'))
for j in range(1, len(a) + 1):
for i in range(j):
self.assertEqual(
stupid_rmq(c, i, j - 1),
rmq(len(a), t, i, j - 1, f=max, ignore=-float('inf')))
def test_range_max_query_1(self):
a = [5]
t = build_helper_tree([5], f=max, ignore=-float('inf'))
m = rmq(len(a), t, 0, 0, f=max, ignore=-float('inf'))
assert 5 == m
def test_range_min_query_1(self):
a = [5]
t = build_helper_tree([5])
m = rmq(len(a), t, 0, 0)
assert 5 == m