Lines Matching defs:result
869 /// Converts an encoded unicode rune into UTF-8 and copies the result into an
886 /// Converts a unicode rune into UTF-8 and copies the result
1313 /// and `nk_end`. Calling any widgets outside these two functions will result in an
1334 /// nest `nk_begin_xxx` calls which will hopefully result in an assert or if not
1345 /// handling and before drawing to screen. Not doing so can result in higher
1505 /// All widget calls after this functions will result in asserts or no state changes
3709 NK_API void nk_triangle_from_direction(struct nk_vec2 *result, struct nk_rect r, float pad_x, float pad_y, enum nk_heading);
6282 nk_triangle_from_direction(struct nk_vec2 *result, struct nk_rect r,
6286 NK_ASSERT(result);
6300 result[0] = nk_vec2(r.x + w_half, r.y);
6301 result[1] = nk_vec2(r.x + r.w, r.y + r.h);
6302 result[2] = nk_vec2(r.x, r.y + r.h);
6304 result[0] = nk_vec2(r.x, r.y);
6305 result[1] = nk_vec2(r.x + r.w, r.y + h_half);
6306 result[2] = nk_vec2(r.x, r.y + r.h);
6308 result[0] = nk_vec2(r.x, r.y);
6309 result[1] = nk_vec2(r.x + r.w, r.y);
6310 result[2] = nk_vec2(r.x + w_half, r.y + r.h);
6312 result[0] = nk_vec2(r.x, r.y + h_half);
6313 result[1] = nk_vec2(r.x + r.w, r.y);
6314 result[2] = nk_vec2(r.x + r.w, r.y + r.h);
6918 int result = -1;
7205 return result;
7209 result = (len >= buf_size)?-1:len;
7210 return result;
7216 int result = -1;
7221 result = NK_VSNPRINTF(buf, (nk_size)buf_size, fmt, args);
7222 result = (result >= buf_size) ? -1: result;
7225 result = nk_vsnprintf(buf, buf_size, fmt, args);
7227 return result;
9608 void *result = (void*)((char*)dst + config->vertex_size);
9621 return result;
11861 nk_tt__rasterize_sorted_edges(struct nk_tt__bitmap *result, struct nk_tt__edge *e,
11874 if (result->w > 64)
11875 scanline = (float *) alloc->alloc(alloc->userdata,0, (nk_size)(result->w*2+1) * sizeof(float));
11878 scanline2 = scanline + result->w;
11880 e[n].y0 = (float) (off_y + result->h) + 1;
11882 while (j < result->h)
11889 NK_MEMSET(scanline , 0, (nk_size)result->w*sizeof(scanline[0]));
11890 NK_MEMSET(scanline2, 0, (nk_size)(result->w+1)*sizeof(scanline[0]));
11922 nk_tt__fill_active_edges_new(scanline, scanline2+1, result->w, active, scan_y_top);
11926 for (i=0; i < result->w; ++i) {
11934 result->pixels[j*result->stride + i] = (unsigned char) m;
12044 nk_tt__rasterize(struct nk_tt__bitmap *result, struct nk_tt__point *pts,
12095 nk_tt__rasterize_sorted_edges(result, e, n, vsubsample, off_x, off_y, alloc);
12212 nk_tt_Rasterize(struct nk_tt__bitmap *result, float flatness_in_pixels,
12224 nk_tt__rasterize(result, windings, winding_lengths, winding_count,
18937 int result;
18970 result = nk_group_scrolled_offset_begin(ctx, x_offset, y_offset, title, flags);
18980 return result;
23519 nk_flags result;
23521 result = nk_edit_string(ctx, flags, buffer, &len, max, filter);
23523 return result;
23806 struct nk_property_variant result;
23807 result.kind = NK_PROPERTY_INT;
23808 result.value.i = value;
23809 result.min_value.i = min_value;
23810 result.max_value.i = max_value;
23811 result.step.i = step;
23812 return result;
23817 struct nk_property_variant result;
23818 result.kind = NK_PROPERTY_FLOAT;
23819 result.value.f = value;
23820 result.min_value.f = min_value;
23821 result.max_value.f = max_value;
23822 result.step.f = step;
23823 return result;
23829 struct nk_property_variant result;
23830 result.kind = NK_PROPERTY_DOUBLE;
23831 result.value.d = value;
23832 result.min_value.d = min_value;
23833 result.max_value.d = max_value;
23834 result.step.d = step;
23835 return result;