Searched refs:next_sibling (Results 1 – 9 of 9) sorted by relevance
157 previous_sibling=None, next_sibling=None): argument185 self.next_sibling = next_sibling186 if self.next_sibling is not None:187 self.next_sibling.previous_sibling = self195 self.previous_sibling.next_sibling = self379 and self.previous_sibling is not self.next_sibling):380 self.previous_sibling.next_sibling = self.next_sibling381 if (self.next_sibling is not None382 and self.next_sibling is not self.previous_sibling):383 self.next_sibling.previous_sibling = self.previous_sibling[all …]
629 next_element = previous_sibling = next_sibling = None632 next_sibling = o.next_sibling639 o.setup(parent, previous_element, next_element, previous_sibling, next_sibling)667 child.next_sibling = None677 descendant.next_sibling = None682 elif target.next_sibling is not None:683 descendant.next_element = target.next_sibling684 target.next_sibling.previous_element = child
658 pldm_entity_node *next_sibling; member700 while (start->next_sibling != NULL) { in find_insertion_at()702 pldm_entity_node *next = start->next_sibling; in find_insertion_at()707 start = start->next_sibling; in find_insertion_at()753 node->next_sibling = NULL; in pldm_entity_association_tree_add_entity()812 pldm_entity_node *next = prev->next_sibling; in pldm_entity_association_tree_add_entity()823 prev->next_sibling = node; in pldm_entity_association_tree_add_entity()825 node->next_sibling = next; in pldm_entity_association_tree_add_entity()844 get_num_nodes(node->next_sibling, num); in get_num_nodes()861 entity_association_tree_visit(node->next_sibling, entities, index); in entity_association_tree_visit()[all …]
188 new_node->children = new_child->next_sibling; in merge_nodes()190 new_child->next_sibling = NULL; in merge_nodes()244 assert(first->next_sibling == NULL); in chain_node()246 first->next_sibling = list; in chain_node()286 child->next_sibling = NULL; in add_child()291 p = &((*p)->next_sibling); in add_child()305 node = node->next_sibling; in delete_node_by_name()743 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()744 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
161 struct node *next_sibling; member188 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
254 for (child2 = child->next_sibling; in check_duplicate_node_names()256 child2 = child2->next_sibling) in check_duplicate_node_names()
400 final_next_element = element.next_sibling428 new_parents_last_child.next_sibling = first_child442 last_childs_last_descendant.next_sibling = None
114 pldm_entity_node* next_sibling; in TEST() member
13059 'name' => 'next_sibling',