class TreeTests(unittest.TestCase):
def setUp(self):
self.config = {
"max_population": 10,
"tree_generation": {
"method": "FULL_METHOD",
"initial_max_depth": 4
},
"function_nodes": [
{"type": "FUNCTION", "name": "ADD", "arity": 2},
{"type": "FUNCTION", "name": "SUB", "arity": 2},
{"type": "FUNCTION", "name": "MUL", "arity": 2},
{"type": "FUNCTION", "name": "DIV", "arity": 2},
{"type": "FUNCTION", "name": "COS", "arity": 1},
{"type": "FUNCTION", "name": "SIN", "arity": 1}
],
"terminal_nodes": [
{"type": "CONSTANT", "value": 1.0},
{"type": "INPUT", "name": "x"},
{"type": "INPUT", "name": "y"},
{"type": "INPUT", "name": "z"}
],
"input_variables": [
{"name": "x"},
{"name": "y"},
{"name": "z"}
]
}
self.t_parser = TreeParser()
self.tree = Tree()
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
node_z = Node(NodeType.INPUT, name="z")
self.tree.input_nodes.append(node_x)
self.tree.input_nodes.append(node_y)
self.tree.input_nodes.append(node_z)
def test_valid(self):
# assert valid
res = self.tree.valid(self.config["input_variables"])
self.assertTrue(res)
# assert fail valid
self.tree.input_nodes.pop()
res = self.tree.valid(self.config["input_variables"])
self.assertFalse(res)
def test_get_linked_node(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node]
)
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# pass test
linked_node = self.tree.get_linked_node(left_node)
self.assertTrue(linked_node is add_func)
linked_node = self.tree.get_linked_node(right_node)
self.assertTrue(linked_node is add_func)
# fail test
random_node = Node(NodeType.INPUT, name="z")
linked_node = self.tree.get_linked_node(random_node)
self.assertFalse(linked_node is add_func)
def test_replace_node(self):
# setup
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[node_x, node_y]
)
# build tree
tree = Tree()
tree.root = add_func
tree.update_program()
# replace input node
new_node = Node(NodeType.INPUT, name="z")
before_replace = list(tree.program)
tree.replace_node(node_x, new_node)
after_replace = list(tree.program)
# assert
self.assertTrue(before_replace == before_replace)
self.assertTrue(after_replace == after_replace)
self.assertFalse(before_replace == after_replace)
self.assertTrue(add_func.branches[0] is new_node)
def test_equal(self):
# create nodes
left_node_1 = Node(NodeType.CONSTANT, value=1.0)
right_node_1 = Node(NodeType.CONSTANT, value=2.0)
left_node_2 = Node(NodeType.CONSTANT, value=3.0)
right_node_2 = Node(NodeType.CONSTANT, value=4.0)
cos_func_1 = Node(
NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_1]
)
sin_func_1 = Node(
NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_1]
)
cos_func_2 = Node(
NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_2]
)
sin_func_2 = Node(
NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_2]
)
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func_1, sin_func_1]
)
sub_func = Node(
NodeType.FUNCTION,
name="SUB",
arity=2,
branches=[sin_func_2, cos_func_2]
)
# create tree_1
tree_1 = Tree()
tree_1.root = add_func
tree_1.update()
# create tree_2
tree_2 = Tree()
tree_2.root = sub_func
tree_2.update()
self.assertTrue(tree_1.equals(tree_1))
self.assertFalse(tree_1.equals(tree_2))
self.assertTrue(tree_2.equals(tree_2))
self.assertFalse(tree_2.equals(tree_1))
def test_str(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node]
)
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# assert
self.assertEquals(str(self.tree), "(x ADD y)")
class Tree(object):
def __init__(self):
self.tree_id = None
self.score = None
self.tree_type = None
self.root = None
self.depth = 0
self.size = 0
self.program = []
self.func_nodes = []
self.term_nodes = []
self.input_nodes = []
self.parser = TreeParser()
def valid(self, config_input_nodes):
# convert config input nodes from dict to list of Nodes
check_list = []
for node in config_input_nodes:
check_list.append(node["name"])
# convert tree input nodes
tree_input_nodes = []
for node in self.input_nodes:
tree_input_nodes.append(node.name)
result = set(check_list) - set(tree_input_nodes)
if len(list(result)) == 0:
return True
else:
return False
def get_linked_node(self, target_node):
try:
index = self.program.index(target_node) + 1
for node in self.program[index:]:
if node.has_value_node(target_node) is not False:
return node
except ValueError:
return None
def replace_node(self, target_node, replace_with, override_update=False):
linked_node = self.get_linked_node(target_node)
branch_index = linked_node.has_value_node(target_node)
linked_node.branches[branch_index] = replace_with
if override_update is False:
self.update()
def equals(self, tree):
if len(self.program) != len(tree.program):
return False
index = 0
for node in self.program:
equals = node.equals(tree.program[index])
if equals is False:
return False
index += 1
return True
def update_program(self):
del self.program[:]
self.program = self.parser.post_order_traverse(self.root)
def update_func_nodes(self):
del self.func_nodes[:]
for node in self.program:
if node.is_function():
if node is not self.root:
self.func_nodes.append(node)
def update_term_nodes(self):
del self.term_nodes[:]
for node in self.program:
if node.is_terminal():
self.term_nodes.append(node)
def update_input_nodes(self):
del self.input_nodes[:]
for node in self.program:
if node.is_input():
self.input_nodes.append(node)
def update_tree_info(self):
self.size = len(self.program)
self.branches = len(self.term_nodes) + len(self.input_nodes)
def update(self):
self.program = self.parser.parse_tree(self, self.root)
def __str__(self):
if self.tree_type == "CLASSIFICATION_TREE":
return self.parser.parse_classification_tree(self.root)
else:
return self.parser.parse_equation(self.root)
def to_dict(self):
self_dict = {
"id": id(self),
"score": self.score,
"size": self.size,
"depth": self.depth,
"func_nodes_len": len(self.func_nodes),
"term_nodes_len": len(self.term_nodes),
"input_nodes_len": len(self.input_nodes),
"func_nodes": [str(node) for node in self.func_nodes],
"term_nodes": [str(node) for node in self.term_nodes],
"input_nodes": [str(node) for node in self.input_nodes],
"program": str(self)
}
return self_dict
class TreeTests(unittest.TestCase):
def setUp(self):
self.config = {
"max_population":
10,
"tree_generation": {
"method": "FULL_METHOD",
"initial_max_depth": 4
},
"function_nodes": [{
"type": "FUNCTION",
"name": "ADD",
"arity": 2
}, {
"type": "FUNCTION",
"name": "SUB",
"arity": 2
}, {
"type": "FUNCTION",
"name": "MUL",
"arity": 2
}, {
"type": "FUNCTION",
"name": "DIV",
"arity": 2
}, {
"type": "FUNCTION",
"name": "COS",
"arity": 1
}, {
"type": "FUNCTION",
"name": "SIN",
"arity": 1
}],
"terminal_nodes": [{
"type": "CONSTANT",
"value": 1.0
}, {
"type": "INPUT",
"name": "x"
}, {
"type": "INPUT",
"name": "y"
}, {
"type": "INPUT",
"name": "z"
}],
"input_variables": [{
"name": "x"
}, {
"name": "y"
}, {
"name": "z"
}]
}
self.t_parser = TreeParser()
self.tree = Tree()
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
node_z = Node(NodeType.INPUT, name="z")
self.tree.input_nodes.append(node_x)
self.tree.input_nodes.append(node_y)
self.tree.input_nodes.append(node_z)
def test_valid(self):
# assert valid
res = self.tree.valid(self.config["input_variables"])
self.assertTrue(res)
# assert fail valid
self.tree.input_nodes.pop()
res = self.tree.valid(self.config["input_variables"])
self.assertFalse(res)
def test_get_linked_node(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node])
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# pass test
linked_node = self.tree.get_linked_node(left_node)
self.assertTrue(linked_node is add_func)
linked_node = self.tree.get_linked_node(right_node)
self.assertTrue(linked_node is add_func)
# fail test
random_node = Node(NodeType.INPUT, name="z")
linked_node = self.tree.get_linked_node(random_node)
self.assertFalse(linked_node is add_func)
def test_replace_node(self):
# setup
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[node_x, node_y])
# build tree
tree = Tree()
tree.root = add_func
tree.update_program()
# replace input node
new_node = Node(NodeType.INPUT, name="z")
before_replace = list(tree.program)
tree.replace_node(node_x, new_node)
after_replace = list(tree.program)
# assert
self.assertTrue(before_replace == before_replace)
self.assertTrue(after_replace == after_replace)
self.assertFalse(before_replace == after_replace)
self.assertTrue(add_func.branches[0] is new_node)
def test_equal(self):
# create nodes
left_node_1 = Node(NodeType.CONSTANT, value=1.0)
right_node_1 = Node(NodeType.CONSTANT, value=2.0)
left_node_2 = Node(NodeType.CONSTANT, value=3.0)
right_node_2 = Node(NodeType.CONSTANT, value=4.0)
cos_func_1 = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_1])
sin_func_1 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_1])
cos_func_2 = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_2])
sin_func_2 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_2])
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func_1, sin_func_1])
sub_func = Node(NodeType.FUNCTION,
name="SUB",
arity=2,
branches=[sin_func_2, cos_func_2])
# create tree_1
tree_1 = Tree()
tree_1.root = add_func
tree_1.update()
# create tree_2
tree_2 = Tree()
tree_2.root = sub_func
tree_2.update()
self.assertTrue(tree_1.equals(tree_1))
self.assertFalse(tree_1.equals(tree_2))
self.assertTrue(tree_2.equals(tree_2))
self.assertFalse(tree_2.equals(tree_1))
def test_str(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node])
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# assert
self.assertEquals(str(self.tree), "(x ADD y)")
