def lca_wrapper(timer, tree, s, b):
timer.start()
result = find_LCA(tree, must_find_node(tree, s), must_find_node(tree, b))
timer.stop()
if result is None:
raise TestFailureException("Result can't be None")
return result.data
def lca_wrapper(executor, tree, s, b):
result = executor.run(
functools.partial(find_LCA, tree, must_find_node(tree, s),
must_find_node(tree, b)))
if result is None:
raise TestFailure("Result can't be None")
return result.data
def lca_wrapper(executor, tree, s, b):
result = executor.run(
functools.partial(find_LCA, tree, must_find_node(tree, s),
must_find_node(tree, b)))
if result is None:
raise TestFailure("Result can't be None")
return result.data
def lca_wrapper(executor, tree, node0, node1):
result = executor.run(
functools.partial(lca, must_find_node(tree, node0),
must_find_node(tree, node1)))
if result is None:
raise TestFailure('Result can\'t be None')
return result.data
def lca_wrapper(timer, tree, node0, node1):
timer.start()
result = lca(must_find_node(tree, node0), must_find_node(tree, node1))
timer.stop()
if result is None:
raise TestFailureException("Result can't be None")
return result.data
def lca_wrapper(executor, tree, key1, key2):
strip_parent_link(tree)
result = executor.run(
functools.partial(lca, tree, must_find_node(tree, key1),
must_find_node(tree, key2)))
if result is None:
raise TestFailure("Result can't be None")
return result.data
def lca_wrapper(executor, tree, key1, key2):
strip_parent_link(tree)
result = executor.run(
functools.partial(lca, tree, must_find_node(tree, key1),
must_find_node(tree, key2)))
if result is None:
raise TestFailure("Result can't be None")
return result.data
def lca_wrapper(timer, tree, key1, key2):
strip_parent_link(tree)
timer.start()
result = lca(tree, must_find_node(tree, key1), must_find_node(tree, key2))
timer.stop()
if result is None:
raise TestFailureException("Result can't be None")
return result.data
def pair_includes_ancestor_and_descendant_of_m_wrapper(
executor, tree, possible_anc_or_desc_0, possible_anc_or_desc_1,
middle_idx):
candidate0 = must_find_node(tree, possible_anc_or_desc_0)
candidate1 = must_find_node(tree, possible_anc_or_desc_1)
middle_node = must_find_node(tree, middle_idx)
return executor.run(
functools.partial(pair_includes_ancestor_and_descendant_of_m,
candidate0, candidate1, middle_node))
def pair_includes_ancestor_and_descendant_of_m_wrapper(
executor, tree, possible_anc_or_desc_0, possible_anc_or_desc_1,
middle_idx):
candidate0 = must_find_node(tree, possible_anc_or_desc_0)
candidate1 = must_find_node(tree, possible_anc_or_desc_1)
middle_node = must_find_node(tree, middle_idx)
return executor.run(
functools.partial(pair_includes_ancestor_and_descendant_of_m,
candidate0, candidate1, middle_node))
def pair_includes_ancestor_and_descendant_of_m_wrapper(
timer, tree, possible_anc_or_desc_0, possible_anc_or_desc_1,
middle_idx):
candidate0 = must_find_node(tree, possible_anc_or_desc_0)
candidate1 = must_find_node(tree, possible_anc_or_desc_1)
middle_node = must_find_node(tree, middle_idx)
timer.start()
result = pair_includes_ancestor_and_descendant_of_m(
candidate0, candidate1, middle_node)
timer.stop()
return result
def find_successor_wrapper(timer, tree, node_idx):
node = must_find_node(tree, node_idx)
timer.start()
result = find_successor(node)
timer.stop()
return result.data if result else -1
def find_successor_wrapper(executor, tree, node_idx):
node = must_find_node(tree, node_idx)
result = executor.run(functools.partial(find_successor, node))
return result.data if result else -1
def lca_wrapper(executor, tree, node0, node1):
result = executor.run(
functools.partial(lca, must_find_node(tree, node0),
must_find_node(tree, node1)))
if result is None:
def find_successor_wrapper(executor, tree, node_idx):
node = must_find_node(tree, node_idx)
result = executor.run(functools.partial(find_successor, node))
return result.data if result else -1