| 111 | } |
| 112 | |
| 113 | void nary_execution(Conductor &conductor) |
| 114 | { |
| 115 | |
| 116 | auto ex = conductor.addNewExecution("n-ary execution"); |
| 117 | |
| 118 | auto &tree = ex->tree(); |
| 119 | |
| 120 | auto root = tree.createRoot(4); |
| 121 | auto n1 = tree.promoteNode(root, 0, 2, tree::NodeStatus::BRANCH, "1"); |
| 122 | auto n2 = tree.promoteNode(root, 1, 2, tree::NodeStatus::BRANCH, "2"); |
| 123 | auto n3 = tree.promoteNode(root, 2, 0, tree::NodeStatus::FAILED, "3"); |
| 124 | auto n4 = tree.promoteNode(root, 3, 2, tree::NodeStatus::BRANCH, "4"); |
| 125 | |
| 126 | auto n5 = tree.promoteNode(n1, 0, 0, tree::NodeStatus::FAILED, "5"); |
| 127 | auto n6 = tree.promoteNode(n1, 1, 0, tree::NodeStatus::FAILED, "6"); |
| 128 | |
| 129 | auto n7 = tree.promoteNode(n2, 0, 0, tree::NodeStatus::FAILED, "7"); |
| 130 | auto n8 = tree.promoteNode(n2, 1, 2, tree::NodeStatus::BRANCH, "8"); |
| 131 | |
| 132 | auto n9 = tree.promoteNode(n4, 0, 0, tree::NodeStatus::FAILED, "9"); |
| 133 | auto n10 = tree.promoteNode(n4, 1, 0, tree::NodeStatus::FAILED, "10"); |
| 134 | |
| 135 | auto n11 = tree.promoteNode(n8, 0, 0, tree::NodeStatus::FAILED, "11"); |
| 136 | auto n12 = tree.promoteNode(n8, 1, 0, tree::NodeStatus::FAILED, "12"); |
| 137 | } |
| 138 | |
| 139 | void larger_nary_execution(Conductor &conductor) |
| 140 | { |
nothing calls this directly
no test coverage detected