| 277 | } |
| 278 | |
| 279 | static void node_check(test_batch_runner *runner) { |
| 280 | // Construct an incomplete tree. |
| 281 | cmark_node *doc = cmark_node_new(CMARK_NODE_DOCUMENT); |
| 282 | cmark_node *p1 = cmark_node_new(CMARK_NODE_PARAGRAPH); |
| 283 | cmark_node *p2 = cmark_node_new(CMARK_NODE_PARAGRAPH); |
| 284 | doc->first_child = p1; |
| 285 | p1->next = p2; |
| 286 | |
| 287 | INT_EQ(runner, cmark_node_check(doc, NULL), 4, "node_check works"); |
| 288 | INT_EQ(runner, cmark_node_check(doc, NULL), 0, "node_check fixes tree"); |
| 289 | |
| 290 | cmark_node_free(doc); |
| 291 | } |
| 292 | |
| 293 | static void iterator(test_batch_runner *runner) { |
| 294 | cmark_node *doc = cmark_parse_document("> a *b*\n\nc", 10, CMARK_OPT_DEFAULT); |
no test coverage detected