Modify tiebreak_on_lca to accept an optional pre-build LCA

These issue helps resolve #36 because inside queries needed to run a whole bunch of tie-breaking runs on smaller collections of data and the overhead of recomputing the LCA tree every time was skyrocketing their response time

Author: mpourmpoulis

queries/argument.py

@@ -303,7 +303,7 @@ def inverse_transformation(node):
 			atok = atok,
 			origin = origin,
 			select_node = origin if selection[0]!=selection[1] else None,
-			tiebreaker = lambda x: tiebreak_on_lca(statement_node,origin,x),
+			tiebreaker = lambda x: tiebreak_on_lca(statement_node,origin,x,lca),
 			transformation = transformation,
 			inverse_transformation = inverse_transformation,
 
@@ -356,7 +356,7 @@ def inverse_transformation(node):
 			atok = atok,
 			origin = origin,
 			select_node = origin if selection[0]!=selection[1] else None,
-			tiebreaker = lambda x: tiebreak_on_lca(statement_node,origin,x),
+			tiebreaker = lambda x: tiebreak_on_lca(statement_node,origin,x,lca),
 			transformation = transformation,
 			inverse_transformation = inverse_transformation,
 
@@ -383,7 +383,6 @@ def case_five(self,view_information,query_description, extra = {}):
 			query_description["level_index"] = -1
 		_,calling_parents = search_upwards_log(origin,targets=ast.stmt,log_targets=(ast.Call))
 		index = query_description["level_index"]
-		print("the Dixie's ",index,len(calling_parents),"\n")
 		if index<len(calling_parents):
 			priority["child_level"] = 1
 			origin = calling_parents[index]

queries/tiebreak.py

@@ -6,8 +6,7 @@
 
 
 
-
-def tiebreak_on_lca(root,origin,candidates):
+def tiebreak_on_lca(root,origin,candidates,lca = None):
 	"""ranks nodes based on the depth of their lowest_common_ancestor 
 	With origin (the deeper the better). In case of ties the note
 	Closer to the LCA is preferred.
@@ -20,7 +19,7 @@ def tiebreak_on_lca(root,origin,candidates):
 	Returns:
 	    TYPE: Description
 	"""
-	lca  = LCA(root)
+	lca  = LCA(root) if lca is None else lca
 	def tiebreaker(x):
 		depth,node = lca(x, origin,node_and_depth = True)
 		v = 3