| 70 | } |
| 71 | |
| 72 | void growing_tree() |
| 73 | { |
| 74 | |
| 75 | tree::Structure str; |
| 76 | |
| 77 | auto root = str.createRoot(0); |
| 78 | |
| 79 | auto n1 = str.addExtraChild(root); |
| 80 | |
| 81 | assert(n1 == str.getChild(root, 0)); |
| 82 | |
| 83 | auto n2 = str.addExtraChild(root); |
| 84 | |
| 85 | assert(n1 == str.getChild(root, 0)); |
| 86 | assert(n2 == str.getChild(root, 1)); |
| 87 | |
| 88 | auto n3 = str.addExtraChild(root); |
| 89 | |
| 90 | assert(n1 == str.getChild(root, 0)); |
| 91 | assert(n2 == str.getChild(root, 1)); |
| 92 | assert(n3 == str.getChild(root, 2)); |
| 93 | } |
| 94 | |
| 95 | void run() |
| 96 | { |
no test coverage detected