| 668 | } |
| 669 | |
| 670 | inline void insert_node_after(xml_node_struct* child, xml_node_struct* node) |
| 671 | { |
| 672 | xml_node_struct* parent = node->parent; |
| 673 | |
| 674 | child->parent = parent; |
| 675 | |
| 676 | if (node->next_sibling) |
| 677 | node->next_sibling->prev_sibling_c = child; |
| 678 | else |
| 679 | parent->first_child->prev_sibling_c = child; |
| 680 | |
| 681 | child->next_sibling = node->next_sibling; |
| 682 | child->prev_sibling_c = node; |
| 683 | |
| 684 | node->next_sibling = child; |
| 685 | } |
| 686 | |
| 687 | inline void insert_node_before(xml_node_struct* child, xml_node_struct* node) |
| 688 | { |
no outgoing calls
no test coverage detected