Lines Matching defs:next
544 /// __nk_clear__ | Called at the end of the frame to reset and prepare the context for the next frame
1135 /// __nk__next__ | Increments the draw command iterator to the next command inside the context draw command list
1139 /// __nk__draw_next__ | Increments the vertex command iterator to the next command inside the context vertex command list
1183 /// Returns draw command pointer pointing to the next command inside the draw command list
1194 /// Returns draw command pointer pointing to the next command inside the draw command list
2007 /// functions it will allocate the next row without you having to make another layouting <br /><br />
2252 /// nk_layout_space_push | Pushes position and size of the next widget in own coordinate space either as pixel or ratio
2289 /// Returns the width of the next row allocate by one of the layouting functions
2298 /// Return `nk_rect` with both position and size of the next row
2312 /// Returns `nk_rect` with both position and size of the next row
2430 /// __width__ | Holds the minimum pixel width the next column must always be
2442 /// __width__ | Holds the absolute pixel width value the next column must be
2471 /// Pushes position and size of the next widget in own coordinate space either as pixel or ratio
3755 handling scheme and only requires essential data to run nuklear. The next
3911 /* offset to the next glyph */
3951 struct nk_font_config *next;
3994 struct nk_font *next;
4400 nk_size next;
5431 struct nk_window *next;
5538 struct nk_table *next, *prev;
5549 struct nk_page_element *next;
5555 struct nk_page *next;
6714 /* update pattern iter IFF the next pattern letter was matched */
6718 /* update best letter in str which may be for a "next" letter or a rematch */
8779 /* make sure the offset to the next command is aligned */
8789 cmd->next = b->base->allocated + alignment;
8793 b->end = cmd->next;
10346 nk_rune next = 0;
10369 next_glyph_len = nk_utf_decode(text + text_len + glyph_len, &next, (int)len - text_len);
10371 (next == NK_UTF_INVALID) ? '\0' : next);
10381 /* offset next glyph */
10385 unicode = next;
10577 struct nk_rp_node *next;
10634 nodes[i].next = &nodes[i+1];
10635 nodes[i].next = 0;
10648 context->extra[0].next = &context->extra[1];
10651 context->extra[1].next = 0;
10664 NK_ASSERT(node->next->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;
10692 node = node->next;
10732 prev = &node->next;
10733 node = node->next;
10760 tail = tail->next;
10767 while (node->next->x <= xpos) {
10768 prev = &node->next;
10769 node = node->next;
10771 NK_ASSERT(node->next->x > xpos && node->x <= xpos);
10784 tail = tail->next;
10813 context->free_head = node->next;
10820 /* preserve the existing one, so start testing with the next one */
10821 struct nk_rp_node *next = cur->next;
10822 cur->next = node;
10823 cur = next;
10830 while (cur->next && cur->next->x <= res.x + width) {
10831 struct nk_rp_node *next = cur->next;
10833 cur->next = context->free_head;
10835 cur = next;
10838 node->next = cur;
10999 struct nk_tt__hheap_chunk *next;
11014 struct nk_tt__active_edge *next;
11416 /* next point is also a curve point, so interpolate an on-point curve */
11420 /* otherwise just use the next point as our start point */
11624 c->next = hh->head;
11643 struct nk_tt__hheap_chunk *n = c->next;
11664 z->next = 0;
11857 e = e->next;
11897 *step = z->next; /* delete from list */
11902 step = &((*step)->next); /* advance through list */
11913 z->next = active;
11942 step = &((*step)->next); /* advance through list */
12177 /* start the next contour */
12696 for (iter = config_list; iter; iter = iter->next) {
12747 for (config_iter = config_list; config_iter; config_iter = config_iter->next) {
12755 for (config_iter = config_list; config_iter; config_iter = config_iter->next) {
12789 config_iter = config_iter->next) {
12866 config_iter = config_iter->next) {
12878 config_iter = config_iter->next) {
13032 /* offset next glyph */
13286 /* INVERSE of memmove... write each byte before copying the next...*/
13527 cfg->next = 0;
13530 while (i->next) i = i->next;
13531 i->next = cfg;
13532 cfg->next = 0;
13545 font->next = 0;
13548 while (i->next) i = i->next;
13549 i->next = font;
13550 font->next = 0;
13789 for (font_iter = atlas->fonts; font_iter; font_iter = font_iter->next) {
13852 for (font_iter = atlas->fonts; font_iter; font_iter = font_iter->next) {
13881 for (iter = atlas->config; iter; iter = iter->next) {
13903 struct nk_font_config *iter, *next;
13904 for (iter = atlas->config; iter; iter = next) {
13912 next = iter->next;
13920 struct nk_font *iter, *next;
13921 for (iter = atlas->fonts; iter; iter = next) {
13922 next = iter->next;
15070 struct nk_window *next;
15091 iter = iter->next;
15113 n = it->next;
15124 next = iter->next;
15127 iter = next;
15128 } else iter = iter->next;
15202 parent_last->next = buf->end;
15232 struct nk_window *next = it->next;
15238 while (next && ((next->buffer.last == next->buffer.begin) ||
15239 (next->flags & NK_WINDOW_HIDDEN) || next->seq != ctx->seq))
15240 next = next->next; /* skip empty command buffers */
15242 if (next) cmd->next = next->buffer.begin;
15243 cont: it = next;
15248 struct nk_window *next = it->next;
15254 cmd->next = buf->begin;
15257 skip: it = next;
15262 cmd->next = ctx->overlay.begin;
15263 else cmd->next = ctx->memory.allocated;
15283 iter = iter->next;
15292 const struct nk_command *next;
15295 if (cmd->next >= ctx->memory.allocated) return 0;
15297 next = nk_ptr_add_const(struct nk_command, buffer, cmd->next);
15298 return next;
15328 struct nk_page *next = iter->next;
15330 iter = next;
15359 page->next = pool->pages;
15382 ctx->freelist = elem->next;
15397 elem->next = 0;
15409 elem->next = ctx->freelist;
15459 tbl->next = 0;
15466 tbl->next = win->tables;
15476 win->tables = tbl->next;
15477 if (tbl->next)
15478 tbl->next->prev = tbl->prev;
15480 tbl->prev->next = tbl->next;
15481 tbl->next = 0;
15515 iter = iter->next;
16152 win->next = 0;
16157 struct nk_table *n = it->next;
16176 NK_ASSERT(iter != iter->next);
16182 iter = iter->next;
16197 NK_ASSERT(iter != iter->next);
16200 iter = iter->next;
16204 win->next = 0;
16215 end->next = win;
16217 win->next = 0;
16224 win->next = ctx->begin;
16236 ctx->begin = win->next;
16237 if (win->next)
16238 win->next->prev = 0;
16243 win->prev->next = 0;
16246 if (win->next)
16247 win->next->prev = win->prev;
16249 win->prev->next = win->next;
16256 win->next = 0;
16351 iter = win->next;
16365 iter = iter->next;
16371 iter = win->next;
16385 iter = iter->next;
16587 iter = iter->next;
17258 Instead it will be closed in the next frame.*/
21023 /* only update value if the next slider step is reached */
22061 if (unicode == 127) goto next;
22063 if (unicode == '\n' && state->single_line) goto next;
22065 if (state->filter && !state->filter(state, unicode)) goto next;
22090 next: