Lines Matching defs:cur
3193 NK_API int nk_progress(struct nk_context*, nk_size *cur, nk_size max, int modifyable);
3194 NK_API nk_size nk_prog(struct nk_context*, nk_size cur, nk_size max, int modifyable);
10797 struct nk_rp_node *node, *cur;
10816 /* let 'cur' point to the remaining nodes needing to be */
10818 cur = *res.prev_link;
10819 if (cur->x < res.x) {
10821 struct nk_rp_node *next = cur->next;
10822 cur->next = node;
10823 cur = next;
10828 /* from here, traverse cur and free the nodes, until we get to one */
10830 while (cur->next && cur->next->x <= res.x + width) {
10831 struct nk_rp_node *next = cur->next;
10833 cur->next = context->free_head;
10834 context->free_head = cur;
10835 cur = next;
10838 node->next = cur;
10840 if (cur->x < res.x + width)
10841 cur->x = (nk_rp_coord) (res.x + width);
21355 nk_progress(struct nk_context *ctx, nk_size *cur, nk_size max, int is_modifyable)
21367 NK_ASSERT(cur);
21370 if (!ctx || !ctx->current || !ctx->current->layout || !cur)
21380 old_value = *cur;
21381 *cur = nk_do_progress(&ctx->last_widget_state, &win->buffer, bounds,
21382 *cur, max, is_modifyable, &style->progress, in);
21383 return (*cur != old_value);
21386 nk_prog(struct nk_context *ctx, nk_size cur, nk_size max, int modifyable)
21388 nk_progress(ctx, &cur, max, modifyable);
21389 return cur;
24136 struct nk_vec2 cur;
24172 cur.x = g->x + (float)(step * (float)g->slots[slot].index);
24173 cur.y = (g->y + g->h) - (ratio * (float)g->h);
24174 nk_stroke_line(out, g->slots[slot].last.x, g->slots[slot].last.y, cur.x, cur.y, 1.0f, color);
24176 bounds.x = cur.x - 3;
24177 bounds.y = cur.y - 3;
24189 nk_fill_rect(out, nk_rect(cur.x - 2, cur.y - 2, 4, 4), 0, color);
24192 g->slots[slot].last.x = cur.x;
24193 g->slots[slot].last.y = cur.y;