Lines Matching defs:node
2851 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2867 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2885 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2910 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2929 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2948 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2979 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
2996 /// __type__ | Value from the nk_tree_type section to visually mark a tree node header as either a collapseable UI section or tree node
10590 /* we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2' */
10645 /* node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly) */
10658 struct nk_rp_node *node = first;
10664 NK_ASSERT(node->next->x > x0);
10666 NK_ASSERT(node->x <= x0);
10671 while (node->x < x1)
10673 if (node->y > min_y) {
10677 waste_area += visited_width * (node->y - min_y);
10678 min_y = node->y;
10680 if (node->x < x0)
10681 visited_width += node->next->x - x0;
10683 visited_width += node->next->x - node->x;
10686 int under_width = node->next->x - node->x;
10689 waste_area += under_width * (min_y - node->y);
10692 node = node->next;
10702 struct nk_rp_node **prev, *node, *tail, **best = 0;
10709 node = c->active_head;
10711 while (node->x + width <= c->width) {
10713 y = nk_rp__skyline_find_min_y(c, node, node->x, width, &waste);
10732 prev = &node->next;
10733 node = node->next;
10737 /* if doing best-fit (BF), we also have to try aligning right edge to each node position */
10756 node = c->active_head;
10758 /* find first node that's admissible */
10767 while (node->next->x <= xpos) {
10768 prev = &node->next;
10769 node = node->next;
10771 NK_ASSERT(node->next->x > xpos && node->x <= xpos);
10772 y = nk_rp__skyline_find_min_y(c, node, xpos, width, &waste);
10797 struct nk_rp_node *node, *cur;
10801 /* 2. the best node doesn't fit (we don't always check this) */
10808 /* on success, create new node */
10809 node = context->free_head;
10810 node->x = (nk_rp_coord) res.x;
10811 node->y = (nk_rp_coord) (res.y + height);
10813 context->free_head = node->next;
10815 /* insert the new node into the right starting point, and */
10822 cur->next = node;
10825 *res.prev_link = node;
10832 /* move the current node to the free list */
10838 node->next = cur;
14705 /* node button */
18403 /* update node state */