def miss_value_argument():
tree = OvalNode(node_id=1,
node_type='operator',
children=[
OvalNode(
node_id=2,
node_type='value',
value="false",
),
])
return
def tree_with_bad_value_of_negation():
tree = OvalNode(node_id=1,
node_type="operator",
value="true",
children=[
OvalNode(
node_id=2,
node_type="value",
value='true',
negation="random_string",
)
])
return
def test_create_node_dict_for_JsTree_2():
src = 'test_data/test_JsTree_data/JsTree_data_2.json'
tree = OvalNode(
node_id=1,
node_type='operator',
value='and',
children=[OvalNode(
node_id=2,
node_type='value',
value='noteval',
)])
tests.any_test_help.any_test_create_node_dict_for_JsTree(tree, src)
def test_create_node_with_negation_dict_for_JsTree1():
src = 'test_data/test_JsTree_data/JsTree_data_negated_1.json'
tree = OvalNode(
node_id=1,
node_type='operator',
value='and',
negation=True,
children=[OvalNode(
node_id=2,
node_type='value',
value='true',
)])
tests.any_test_help.any_test_create_node_dict_for_JsTree(tree, src)
def tree_with_bad_type():
tree = OvalNode(
node_id=1,
node_type="car",
value='and',
)
return
def tree_with_bad_value_of_value():
tree = OvalNode(
node_id=1,
node_type="value",
value='and',
)
return
def tree_with_bad_value_of_operator():
tree = OvalNode(
node_id=1,
node_type="operator",
value='nad',
)
return
def get_and_false_tree():
"""
and
|
f
"""
return OvalNode(node_id=1,
node_type='operator',
value='and',
children=[
OvalNode(
node_id=2,
node_type='value',
value="false",
),
])
def test_UPPERCASETree():
t = OvalNode(node_id=1,
node_type="OPERATOR",
value="AND",
children=[
OvalNode(
node_id=2,
node_type="VALUE",
value="TRUE",
),
OvalNode(
node_id=3,
node_type="VALUE",
value="NOTAPPL",
),
])
return
def test_node_value_negate():
"""
and
|
!f
"""
tree = OvalNode(node_id=1,
node_type='operator',
value='and',
children=[
OvalNode(
node_id=2,
node_type='value',
value="false",
negation=True,
),
])
tests.any_test_help.any_test_treeEvaluation_with_tree(tree, "true")
def test_create_node_dict_for_JsTree_3():
src = 'test_data/test_JsTree_data/JsTree_data_3.json'
tree = OvalNode(
node_id=1,
node_type='value',
value='false',
)
tests.any_test_help.any_test_create_node_dict_for_JsTree(tree, src)
def tree_only_or():
"""
or
"""
tree = OvalNode(
node_id=1,
node_type="operator",
value='or',
)
return
def tree_only_and():
"""
and
"""
tree = OvalNode(
node_id=1,
node_type="operator",
value='and',
)
return
def test_add_to_tree():
test_data_src = 'test_data/add_to_tree.json'
dict_of_tree = tests.any_test_help.any_get_test_data_json(test_data_src)
tree = get_and_false_tree()
tree1 = OvalNode(
node_id=3,
node_type='value',
value="true",
)
tree.add_child_to_node(1, tree1)
assert Converter(tree).to_dict() == dict_of_tree
def get_simple_tree():
return OvalNode(
node_id=1,
node_type='operator',
value='and',
children=[
OvalNode(
node_id=2,
node_type='value',
value='true',
),
OvalNode(
node_id=3,
node_type='value',
value='false',
),
OvalNode(
node_id=4,
node_type='operator',
value='or',
children=[
OvalNode(
node_id=5,
node_type='value',
value='false',
),
OvalNode(
node_id=6,
node_type='value',
value="true",
),
]
)
]
)
def bad_tree():
"""
t
|
and
|
t
"""
t = OvalNode(node_id=1,
node_type="value",
value="true",
children=[
OvalNode(node_id=2,
node_type="operator",
value="and",
children=[
OvalNode(
node_id=3,
node_type="value",
value="true",
),
]),
])
return
def test_ChangeValueTree():
"""
and
/|\
t t or
/ \
f t
"""
Tree = OvalNode(node_id=1,
node_type='operator',
value='and',
children=[
OvalNode(
node_id=2,
node_type='value',
value="true",
),
OvalNode(
node_id=3,
node_type='value',
value="false",
),
OvalNode(node_id=4,
node_type='operator',
value='or',
children=[
OvalNode(
node_id=5,
node_type='value',
value="false",
),
OvalNode(
node_id=6,
node_type='value',
value="true",
),
]),
])
Tree.change_value_of_node(3, "true")
tests.any_test_help.any_test_treeEvaluation_with_tree(Tree, "true")
def test_bigOvalTree():
tree = OvalNode(node_id=1,
node_type='operator',
value='and',
children=[
OvalNode(
node_id=2,
node_type='value',
value="false",
),
OvalNode(node_id=3,
node_type='operator',
value="xor",
children=[
OvalNode(
node_id=4,
node_type='value',
value='true',
),
OvalNode(node_id=5,
node_type='operator',
value='one',
children=[
OvalNode(
node_id=6,
node_type='value',
value='noteval',
),
OvalNode(
node_id=7,
node_type='value',
value='true',
),
OvalNode(
node_id=8,
node_type='value',
value='notappl',
),
]),
OvalNode(
node_id=9,
node_type='value',
value='error',
),
]),
OvalNode(node_id=10,
node_type='operator',
value='or',
children=[
OvalNode(
node_id=11,
node_type='value',
value="unknown",
),
OvalNode(
node_id=12,
node_type='value',
value="true",
),
]),
])
test_data_src = 'test_data/bigOvalTree.json'
dict_of_tree = tests.any_test_help.any_get_test_data_json(test_data_src)
tests.any_test_help.any_test_treeEvaluation_with_tree(tree, "false")
tests.any_test_help.any_test_tree_to_dict_of_tree(tree, dict_of_tree)
tests.any_test_help.find_any_node(tree, 5)
tests.any_test_help.any_test_dict_to_tree(dict_of_tree)
