Home
last modified time | relevance | path

Searched refs:parent (Results 1 – 3 of 3) sorted by relevance

/hal_rpi_pico-3.4.0/src/common/pico_util/
Dpheap.c59 assert(!ph_get_node(heap, root_id)->parent); in ph_remove_any_head()
71 if (new_root_id) ph_get_node(heap, new_root_id)->parent = 0; in ph_remove_any_head()
91 if (!node->parent) return false; // not in tree in ph_remove_and_free_node()
92 pheap_node_t *parent = ph_get_node(heap, node->parent); in ph_remove_and_free_node() local
93 if (parent->child == id) { in ph_remove_and_free_node()
94 parent->child = node->sibling; in ph_remove_and_free_node()
96 pheap_node_id_t prev_sibling_id = parent->child; in ph_remove_and_free_node()
109 node->sibling = node->parent = 0; in ph_remove_and_free_node()
126 printf("%d (c=%d s=%d p=%d) ", id, node->child, node->sibling, node->parent); in ph_dump_node()
/hal_rpi_pico-3.4.0/src/common/pico_util/include/pico/util/
Dpheap.h52 pheap_node_id_t child, sibling, parent; member
115 c->parent = parent_id; in ph_add_child_node()
149 hn->child = hn->sibling = hn->parent = 0; in ph_new_node()
167 hn->child = hn->sibling = hn->parent = 0; in ph_insert_node()
235 return id == heap->root_id || ph_get_node(heap, id)->parent; in ph_contains_node()
/hal_rpi_pico-3.4.0/docs/
Dmain.js11 $('#main-nav ul li > ul').parent().addClass('hasChildren');