@@ 71-100 (lines=30) @@ | ||
68 | assert Converter(tree).to_js_tree_dict() == data |
|
69 | ||
70 | ||
71 | def get_simple_tree(): |
|
72 | return OvalNode( |
|
73 | node_id=1, |
|
74 | node_type='operator', |
|
75 | value='and', |
|
76 | children=[ |
|
77 | OvalNode( |
|
78 | node_id=2, |
|
79 | node_type='value', |
|
80 | value='true', |
|
81 | ), |
|
82 | OvalNode( |
|
83 | node_id=3, |
|
84 | node_type='value', |
|
85 | value='false', |
|
86 | ), |
|
87 | OvalNode( |
|
88 | node_id=4, |
|
89 | node_type='operator', |
|
90 | value='or', |
|
91 | children=[ |
|
92 | OvalNode( |
|
93 | node_id=5, |
|
94 | node_type='value', |
|
95 | value='false', |
|
96 | ), |
|
97 | OvalNode( |
|
98 | node_id=6, |
|
99 | node_type='value', |
|
100 | value="true", |
|
101 | ), |
|
102 | ] |
|
103 | ) |
@@ 18-47 (lines=30) @@ | ||
15 | return json.load(f) |
|
16 | ||
17 | ||
18 | def get_simple_tree(): |
|
19 | return OvalNode( |
|
20 | node_id=1, |
|
21 | node_type='operator', |
|
22 | value='and', |
|
23 | children=[ |
|
24 | OvalNode( |
|
25 | node_id=2, |
|
26 | node_type='value', |
|
27 | value='true', |
|
28 | ), |
|
29 | OvalNode( |
|
30 | node_id=3, |
|
31 | node_type='value', |
|
32 | value='false', |
|
33 | ), |
|
34 | OvalNode( |
|
35 | node_id=4, |
|
36 | node_type='operator', |
|
37 | value='or', |
|
38 | children=[ |
|
39 | OvalNode( |
|
40 | node_id=5, |
|
41 | node_type='value', |
|
42 | value='false', |
|
43 | ), |
|
44 | OvalNode( |
|
45 | node_id=6, |
|
46 | node_type='value', |
|
47 | value="true", |
|
48 | ), |
|
49 | ] |
|
50 | ) |