Home
last modified time | relevance | path

Searched refs:nearest (Results 1 – 25 of 6464) sorted by relevance

12345678910>>...259

/dports/math/ploticus-nox11/pl240src/src/
H A Dnearest.c25 if( strncmp( nearest, "month", 5 )== 0 || strncmp( nearest, "quarter", 7 )==0 || strncmp( nearest, …
34 if( nearest[0] == 'q' || nearest[0] == '3' ) {
50 if( nearest[0] == 'q' || nearest[0] == '3' ) {
72 else if( strncmp( nearest, "year", 4 )== 0 || strncmp( nearest, "2year", 5 )==0 ||
73 strncmp( nearest, "5year", 5 )==0 || strncmp( nearest, "10year", 6 )==0 ) {
113 else if( strncmp( nearest, "day", 3 )== 0 || strcmp( nearest, "monday" )==0 || strcmp( nearest, "su…
172 strncmp( nearest, "6hour", 5 )==0 || strncmp( nearest, "12hour", 6 )==0 ) {
239 ( nearest[0] >= '0' && nearest[0] <= '9' && stricmp( nearest + 1, "minute" )==0 ) ||
240 …( nearest[0] >= '0' && nearest[0] <= '9' && nearest[1] >= '0' && nearest[1] <= '9' && stricmp( nea…
274 ( nearest[0] >= '0' && nearest[0] <= '9' && stricmp( nearest + 1, "second" )==0 ) ||
[all …]
/dports/math/ploticus/pl240src/src/
H A Dnearest.c25 if( strncmp( nearest, "month", 5 )== 0 || strncmp( nearest, "quarter", 7 )==0 || strncmp( nearest, …
34 if( nearest[0] == 'q' || nearest[0] == '3' ) {
50 if( nearest[0] == 'q' || nearest[0] == '3' ) {
72 else if( strncmp( nearest, "year", 4 )== 0 || strncmp( nearest, "2year", 5 )==0 ||
73 strncmp( nearest, "5year", 5 )==0 || strncmp( nearest, "10year", 6 )==0 ) {
113 else if( strncmp( nearest, "day", 3 )== 0 || strcmp( nearest, "monday" )==0 || strcmp( nearest, "su…
172 strncmp( nearest, "6hour", 5 )==0 || strncmp( nearest, "12hour", 6 )==0 ) {
239 ( nearest[0] >= '0' && nearest[0] <= '9' && stricmp( nearest + 1, "minute" )==0 ) ||
240 …( nearest[0] >= '0' && nearest[0] <= '9' && nearest[1] >= '0' && nearest[1] <= '9' && stricmp( nea…
274 ( nearest[0] >= '0' && nearest[0] <= '9' && stricmp( nearest + 1, "second" )==0 ) ||
[all …]
/dports/math/libccd/libccd-2.1/src/testsuites/
H A Dpolytope.c227 ccd_pt_el_t *nearest; in TEST() local
250 nearest = ccdPtNearest(&pt); in TEST()
259 nearest = ccdPtNearest(&pt); in TEST()
269 nearest = ccdPtNearest(&pt); in TEST()
279 nearest = ccdPtNearest(&pt); in TEST()
289 nearest = ccdPtNearest(&pt); in TEST()
299 nearest = ccdPtNearest(&pt); in TEST()
308 nearest = ccdPtNearest(&pt); in TEST()
319 nearest = ccdPtNearest(&pt); in TEST()
330 nearest = ccdPtNearest(&pt); in TEST()
[all …]
/dports/devel/ode/ode-0.13/libccd/src/testsuites/
H A Dpolytope.c229 ccd_pt_el_t *nearest; in TEST() local
252 nearest = ccdPtNearest(&pt); in TEST()
261 nearest = ccdPtNearest(&pt); in TEST()
271 nearest = ccdPtNearest(&pt); in TEST()
281 nearest = ccdPtNearest(&pt); in TEST()
291 nearest = ccdPtNearest(&pt); in TEST()
301 nearest = ccdPtNearest(&pt); in TEST()
310 nearest = ccdPtNearest(&pt); in TEST()
321 nearest = ccdPtNearest(&pt); in TEST()
332 nearest = ccdPtNearest(&pt); in TEST()
[all …]
/dports/math/openturns/openturns-1.18/python/test/
H A Dt_RegularGridNearestNeighbour_std.expout23 4 nearest neighbours of [-1.26617] (indices= [0,1,2,3]
24 4 nearest neighbours of [-0.438266] (indices= [6,5,7,4]
25 4 nearest neighbours of [1.20548] (indices= [20,19,18,17]
26 4 nearest neighbours of [-2.18139] (indices= [0,1,2,3]
28 4 nearest neighbours of [-0.355007] (indices= [6,7,5,8]
32 4 nearest neighbours of [-0.470526] (indices= [5,6,4,7]
34 4 nearest neighbours of [-2.29006] (indices= [0,1,2,3]
35 4 nearest neighbours of [-1.28289] (indices= [0,1,2,3]
36 4 nearest neighbours of [-1.31178] (indices= [0,1,2,3]
39 4 nearest neighbours of [-0.139453] (indices= [9,8,10,7]
[all …]
/dports/graphics/vips/vips-8.12.0/libvips/morphology/
H A Dnearest.c104 VipsFillNearest *nearest; member
154 x < circle->nearest->width && in vips_fill_nearest_pixel_clip()
156 y < circle->nearest->height ) in vips_fill_nearest_pixel_clip()
191 circle.nearest = nearest; in vips_fill_nearest_grow_seed()
196 seed->x + seed->r < nearest->width && in vips_fill_nearest_grow_seed()
248 g_array_set_size( nearest->seeds, in vips_fill_nearest_build()
249 nearest->seeds->len + 1 ); in vips_fill_nearest_build()
251 Seed, nearest->seeds->len - 1 ); in vips_fill_nearest_build()
265 if( vips_black( &t[1], nearest->width, nearest->height, NULL ) || in vips_fill_nearest_build()
274 while( nearest->seeds->len > 0 ) { in vips_fill_nearest_build()
[all …]
/dports/audio/sonic-visualiser/sonic-visualiser-4.0.1/svcore/data/model/test/
H A DTestZoomConstraints.h112 checkBoth(c, nearest, 1, 1); in unconstrainedNearest()
113 checkBoth(c, nearest, 2, 2); in unconstrainedNearest()
114 checkBoth(c, nearest, 3, 3); in unconstrainedNearest()
115 checkBoth(c, nearest, 4, 4); in unconstrainedNearest()
151 checkBoth(c, nearest, 1, 1); in powerOfTwoNearest()
152 checkBoth(c, nearest, 2, 2); in powerOfTwoNearest()
153 checkBoth(c, nearest, 3, 2); in powerOfTwoNearest()
154 checkBoth(c, nearest, 4, 4); in powerOfTwoNearest()
196 checkBoth(c, nearest, 1, 1); in powerOfSqrtTwoNearest()
220 checkMaxMin(c, nearest); in powerOfSqrtTwoNearest()
[all …]
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/none/tests/s390x/
H A Drounding-6.stdout.exp1 cfebr 1.250000 -> 1 cc = 2 [-> nearest even]
5 cfebr 1.500000 -> 2 cc = 2 [-> nearest even]
9 cfebr 2.500000 -> 2 cc = 2 [-> nearest even]
145 fiebr 1.25000 -> 1 [-> nearest even]
149 fiebr 1.50000 -> 2 [-> nearest even]
153 fiebr 2.50000 -> 2 [-> nearest even]
157 fiebr 1.75000 -> 2 [-> nearest even]
177 fiebr 0.00000 -> 0 [-> nearest even]
181 fidbr 1.25000 -> 1 [-> nearest even]
185 fidbr 1.50000 -> 2 [-> nearest even]
[all …]
/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/none/tests/s390x/
H A Drounding-6.stdout.exp1 cfebr 1.250000 -> 1 cc = 2 [-> nearest even]
5 cfebr 1.500000 -> 2 cc = 2 [-> nearest even]
9 cfebr 2.500000 -> 2 cc = 2 [-> nearest even]
145 fiebr 1.25000 -> 1 [-> nearest even]
149 fiebr 1.50000 -> 2 [-> nearest even]
153 fiebr 2.50000 -> 2 [-> nearest even]
157 fiebr 1.75000 -> 2 [-> nearest even]
177 fiebr 0.00000 -> 0 [-> nearest even]
181 fidbr 1.25000 -> 1 [-> nearest even]
185 fidbr 1.50000 -> 2 [-> nearest even]
[all …]
/dports/science/grib_api/grib_api-1.28.0-Source/src/
H A Dgrib_nearest_class_regular.c50 static int destroy (grib_nearest* nearest);
53 grib_nearest nearest; member
119 if (!nearest->h || (flags & GRIB_NEAREST_SAME_DATA)==0 || nearest->h!=h) {
125 nearest->values_count = nvalues;
126 if (nearest->values) grib_context_free(nearest->context,nearest->values);
131 nearest->values,&(nearest->values_count));
177 nearest->h=h;
209 values[kk]=nearest->values[self->k[kk]];
245 nearest->values_count = nvalues; in find()
316 nearest->h=h; in find()
[all …]
H A Dgrib_nearest_class_gen.c41 static int init (grib_nearest* nearest,grib_handle* h,grib_arguments* args);
43 static int destroy (grib_nearest* nearest);
46 grib_nearest nearest; member
73 static int init(grib_nearest* nearest,grib_handle* h,grib_arguments* args) in init() argument
75 grib_nearest_gen* self = (grib_nearest_gen*) nearest; in init()
82 nearest->values=NULL; in init()
84 nearest->context=h->context; in init()
89 static int destroy(grib_nearest* nearest) { in destroy() argument
90 if (nearest->values) grib_context_free(nearest->context,nearest->values); in destroy()
91 grib_context_free(nearest->context,nearest); in destroy()
[all …]
H A Dgrib_nearest_class_reduced.c50 static int destroy (grib_nearest* nearest);
53 grib_nearest nearest; member
126 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
143 nearest->values_count = nvalues; in find()
195 nearest->h=h; in find()
379 if (!nearest->h || (flags & GRIB_NEAREST_SAME_DATA)==0 || nearest->h!=h) { in find()
385 nearest->values_count = nvalues; in find()
386 if (nearest->values) grib_context_free(nearest->context,nearest->values); in find()
391 nearest->values,&(nearest->values_count)); in find()
427 nearest->h=h; in find()
[all …]
/dports/science/eccodes/eccodes-2.23.0-Source/src/
H A Dgrib_nearest_class_gen.c41 static int init(grib_nearest* nearest, grib_handle* h, grib_arguments* args);
43 static int destroy(grib_nearest* nearest);
47 grib_nearest nearest; member
76 grib_nearest_gen* self = (grib_nearest_gen*)nearest; in init()
83 nearest->values = NULL; in init()
85 nearest->context = h->context; in init()
90 static int destroy(grib_nearest* nearest) in destroy() argument
92 if (nearest->values) in destroy()
93 grib_context_free(nearest->context, nearest->values); in destroy()
94 grib_context_free(nearest->context, nearest); in destroy()
[all …]
H A Dgrib_nearest_class_regular.c50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
119 if (!nearest->h || (flags & GRIB_NEAREST_SAME_DATA)==0 || nearest->h!=h) {
125 nearest->values_count = nvalues;
126 if (nearest->values) grib_context_free(nearest->context,nearest->values);
131 nearest->values,&(nearest->values_count));
177 nearest->h=h;
208 values[kk]=nearest->values[self->k[kk]];
249 nearest->values_count = nvalues; in find()
345 nearest->h = h; in find()
[all …]
H A Dgrib_nearest_class_lambert_conformal.c48 static int init(grib_nearest* nearest, grib_handle* h, grib_arguments* args);
50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
103 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
110 nearest, h, inlat, inlon, flags, /* inputs */ in find()
126 static int destroy(grib_nearest* nearest) in destroy() argument
129 if (self->lats) grib_context_free(nearest->context, self->lats); in destroy()
130 if (self->lons) grib_context_free(nearest->context, self->lons); in destroy()
131 if (self->i) grib_context_free(nearest->context, self->i); in destroy()
132 if (self->j) grib_context_free(nearest->context, self->j); in destroy()
[all …]
H A Dgrib_nearest_class_polar_stereographic.c48 static int init(grib_nearest* nearest, grib_handle* h, grib_arguments* args);
50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
103 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
110 nearest, h, inlat, inlon, flags, /* inputs */ in find()
126 static int destroy(grib_nearest* nearest) in destroy() argument
129 if (self->lats) grib_context_free(nearest->context, self->lats); in destroy()
130 if (self->lons) grib_context_free(nearest->context, self->lons); in destroy()
131 if (self->i) grib_context_free(nearest->context, self->i); in destroy()
132 if (self->j) grib_context_free(nearest->context, self->j); in destroy()
[all …]
H A Dgrib_nearest_class_lambert_azimuthal_equal_area.c48 static int init(grib_nearest* nearest, grib_handle* h, grib_arguments* args);
50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
103 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
110 nearest, h, inlat, inlon, flags, /* inputs */ in find()
126 static int destroy(grib_nearest* nearest) in destroy() argument
129 if (self->lats) grib_context_free(nearest->context, self->lats); in destroy()
130 if (self->lons) grib_context_free(nearest->context, self->lons); in destroy()
131 if (self->i) grib_context_free(nearest->context, self->i); in destroy()
132 if (self->j) grib_context_free(nearest->context, self->j); in destroy()
[all …]
H A Dgrib_nearest_class_space_view.c50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
95 grib_nearest_space_view* self = (grib_nearest_space_view*)nearest; in init()
103 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
108 grib_nearest_space_view* self = (grib_nearest_space_view*)nearest; in find()
110 nearest, h, inlat, inlon, flags, /* inputs */ in find()
126 static int destroy(grib_nearest* nearest) in destroy() argument
128 grib_nearest_space_view* self = (grib_nearest_space_view*)nearest; in destroy()
131 if (self->i) grib_context_free(nearest->context, self->i); in destroy()
132 if (self->j) grib_context_free(nearest->context, self->j); in destroy()
[all …]
H A Dgrib_nearest_class_mercator.c50 static int destroy(grib_nearest* nearest);
54 grib_nearest nearest; member
95 grib_nearest_mercator* self = (grib_nearest_mercator*)nearest; in init()
105 static int find(grib_nearest* nearest, grib_handle* h, in find() argument
110 grib_nearest_mercator* self = (grib_nearest_mercator*)nearest; in find()
112 nearest, h, inlat, inlon, flags, /* inputs */ in find()
128 static int destroy(grib_nearest* nearest) in destroy() argument
130 grib_nearest_mercator* self = (grib_nearest_mercator*)nearest; in destroy()
133 if (self->i) grib_context_free(nearest->context, self->i); in destroy()
134 if (self->j) grib_context_free(nearest->context, self->j); in destroy()
[all …]
/dports/graphics/gimp-app/gimp-2.10.30/app/core/
H A Dgimpimage-snap.c109 gdouble nearest; in gimp_image_snap_x() local
190 gdouble nearest; in gimp_image_snap_y() local
299 gdouble nearest; in gimp_image_snap_point() local
310 gdouble nearest; in gimp_image_snap_point() local
348 GimpCoords nearest; in gimp_image_snap_point() local
484 GimpCoords nearest; in gimp_image_snap_rectangle() local
516 dist = ABS (nearest.x - x2); in gimp_image_snap_rectangle()
537 dist = ABS (nearest.y - y2); in gimp_image_snap_rectangle()
560 dist = ABS (nearest.x - x2); in gimp_image_snap_rectangle()
599 dist = ABS (nearest.y - y2); in gimp_image_snap_rectangle()
[all …]
/dports/math/bcps/CHiPPS-BiCePS-releases-0.99.2/Bcps/examples/Blis/
H A DBlisObjectInt.cpp107 if (nearest > value) { in infeasibility()
114 double weight = fabs(value - nearest); in infeasibility()
117 if (nearest < value) { in infeasibility()
154 double nearest = floor(value + 0.5); in feasibleRegion() local
184 double nearest = floor(value + 0.5); in createBranchObject() local
228 double nearest = floor(value + 0.5); in preferredNewFeasible() local
239 if (nearest > originalLower_ + 0.5) { in preferredNewFeasible()
248 if (nearest < originalUpper_ - 0.5) { in preferredNewFeasible()
273 double nearest = floor(value + 0.5); in notPreferredNewFeasible() local
282 if (nearest > originalLower_ + 0.5) { in notPreferredNewFeasible()
[all …]
/dports/databases/postgis32/postgis-3.2.0/regress/core/
H A Dgeos39.sql4 st_astext(nearest, 4) AS nearest,
10 st_astext(nearest, 4) AS nearest,
14 SELECT 'mic-null' AS name, center, nearest, radius
19 st_astext(nearest, 4) AS nearest,
25 st_astext(nearest, 4) AS nearest,
31 st_astext(nearest, 4) AS nearest,
/dports/databases/postgis31/postgis-3.1.4/regress/core/
H A Dgeos39.sql4 st_astext(nearest, 4) AS nearest,
10 st_astext(nearest, 4) AS nearest,
14 SELECT 'mic-null' AS name, center, nearest, radius
19 st_astext(nearest, 4) AS nearest,
25 st_astext(nearest, 4) AS nearest,
31 st_astext(nearest, 4) AS nearest,
/dports/graphics/blender/blender-2.91.0/source/blender/python/mathutils/
H A Dmathutils_kdtree.c51 BLI_assert(nearest->index >= 0); in kdtree_nearest_to_py_tuple()
66 kdtree_nearest_to_py_tuple(nearest, py_retval); in kdtree_nearest_to_py()
77 if (nearest->index != -1) { in kdtree_nearest_to_py_and_check()
78 kdtree_nearest_to_py_tuple(nearest, py_retval); in kdtree_nearest_to_py_and_check()
221 KDTreeNearest_3d nearest; in py_kdtree_find() local
238 nearest.index = -1; in py_kdtree_find()
275 KDTreeNearest_3d *nearest; in py_kdtree_find_n() local
308 MEM_freeN(nearest); in py_kdtree_find_n()
329 KDTreeNearest_3d *nearest = NULL; in py_kdtree_find_range() local
362 if (nearest) { in py_kdtree_find_range()
[all …]
/dports/science/eccodes/eccodes-2.23.0-Source/src/deprecated/
H A Dgrib_nearest_class_reduced.old3 static int find(grib_nearest* nearest, grib_handle* h,
8 grib_nearest_reduced* self = (grib_nearest_reduced*)nearest;
13 if (!nearest->h || (flags & GRIB_NEAREST_SAME_DATA) == 0 || nearest->h != h) {
19 nearest->values_count = nvalues;
20 if (nearest->values)
21 grib_context_free(nearest->context, nearest->values);
23 if (!nearest->values)
27 nearest->values, &(nearest->values_count));
29 grib_context_log(nearest->context, GRIB_LOG_ERROR,
75 nearest->h = h;
[all …]

12345678910>>...259