| /dports/databases/grass7/grass-7.8.6/lib/vector/diglib/ |
| H A D | angle.c | 39 int n_points; in dig_calc_begin_angle() local
44 n_points = points->n_points; in dig_calc_begin_angle()
58 if (n_points != 2) { in dig_calc_begin_angle()
90 int n_points; in dig_calc_end_angle() local
98 n_points = points->n_points; in dig_calc_end_angle()
109 if (n_points != 2) { in dig_calc_end_angle()
143 int n_points; in dig_is_line_degenerate() local
148 n_points = points->n_points; in dig_is_line_degenerate()
183 int n_points; in dig_line_degenerate() local
187 n_points = points->n_points; in dig_line_degenerate()
[all …]
|
| /dports/graphics/gimp-app/gimp-2.10.30/app/core/ |
| H A D | gimp-transform-resize.c | 135 gint n_points; in gimp_transform_resize_boundary() local
159 valid = (n_points >= 2); in gimp_transform_resize_boundary()
228 for (i = 1; i < n_points; i++) in gimp_transform_resize_adjust()
274 for (i = 0; i < n_points; i++) in gimp_transform_resize_crop()
284 for (i = 0; i < n_points; i++) in gimp_transform_resize_crop()
294 for (i = 1; i < n_points - 1; i++) in gimp_transform_resize_crop()
300 next = n_points - 1; in gimp_transform_resize_crop()
342 points[n_points - i - 1] = t; in gimp_transform_resize_crop()
651 for (i = 1; i <= n_points; i++) in in_poly()
653 p2 = points[i % n_points]; in in_poly()
[all …]
|
| H A D | gimpbezierdesc.c | 65 gint n_points, in add_polyline() argument
72 for (i = 0; i < n_points; i++) in add_polyline()
110 gint n_points; in gimp_bezier_desc_new_from_bound_segs() local
123 n_points = 0; in gimp_bezier_desc_new_from_bound_segs()
125 points[n_points].x = (gdouble) (bound_segs[0].x1); in gimp_bezier_desc_new_from_bound_segs()
128 n_points++; in gimp_bezier_desc_new_from_bound_segs()
140 n_points++; in gimp_bezier_desc_new_from_bound_segs()
145 points[n_points] = points[0]; in gimp_bezier_desc_new_from_bound_segs()
147 n_points++; in gimp_bezier_desc_new_from_bound_segs()
151 n_points = 0; in gimp_bezier_desc_new_from_bound_segs()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/test/test_InterpolationSurrogate/ |
| H A D | test_4D_LinearLagrangeInterpolationSurrogate.C | 68 std::vector<unsigned int> n_points(4); in main()
69 n_points[0] = 101; in main()
70 n_points[1] = 51; in main()
71 n_points[2] = 31; in main()
72 n_points[3] = 41; in main()
76 std::vector<double> values(n_points[0]*n_points[1]*n_points[2]*n_points[3]); in main()
83 for( unsigned int i = 0; i < n_points[0]; i++ ) in main()
85 for( unsigned int j = 0; j < n_points[1]; j++ ) in main()
87 for( unsigned int k = 0; k < n_points[2]; k++ ) in main()
91 unsigned int n = i + j*n_points[0] + k*n_points[0]*n_points[1] in main()
[all …]
|
| H A D | test_3D_LinearLagrangeInterpolationSurrogate.C | 68 std::vector<unsigned int> n_points(3); in main()
69 n_points[0] = 101; in main()
70 n_points[1] = 51; in main()
71 n_points[2] = 31; in main()
74 data(paramDomain,n_points); in main()
76 std::vector<double> values(n_points[0]*n_points[1]*n_points[2]); in main()
78 double spacing_x = (paramMaxs[0] - paramMins[0])/(n_points[0]-1); in main()
82 for( unsigned int i = 0; i < n_points[0]; i++ ) in main()
84 for( unsigned int j = 0; j < n_points[1]; j++ ) in main()
86 for( unsigned int k = 0; k < n_points[2]; k++ ) in main()
[all …]
|
| /dports/science/py-dipy/dipy-1.4.1/dipy/denoise/ |
| H A D | gibbs.py | 47 ptv = np.absolute(xs[:, (n_points+1):(-n_points-1)] -
48 xs[:, (n_points+2):(-n_points)])
49 ntv = np.absolute(xs[:, (n_points+1):(-n_points-1)] -
50 xs[:, (n_points):(-n_points-2)])
53 xs[:, (n_points+2+n):(-n_points+n)])
55 xs[:, (n_points-n):(-n_points-2-n)])
98 tvr, tvl = _image_tv(xs, axis=1, n_points=n_points)
116 tvsr, tvsl = _image_tv(img_p, axis=1, n_points=n_points)
121 tvsr, tvsl = _image_tv(img_n, axis=1, n_points=n_points)
232 img_c1 = _gibbs_removal_1d(image, axis=1, n_points=n_points)
[all …]
|
| /dports/graphics/libart_lgpl/libart_lgpl-2.3.21/ |
| H A D | art_svp_vpath.c | 75 int n_points, n_points_max; in art_svp_from_vpath() local
85 n_points = 0; in art_svp_from_vpath()
106 svp->segs[n_segs].n_points = n_points; in art_svp_from_vpath()
125 n_points = 1; in art_svp_from_vpath()
139 x = points[n_points - 1].x; in art_svp_from_vpath()
140 y = points[n_points - 1].y; in art_svp_from_vpath()
148 svp->segs[n_segs].n_points = n_points; in art_svp_from_vpath()
159 n_points = 1; in art_svp_from_vpath()
176 n_points++; in art_svp_from_vpath()
185 if (n_points >= 2) in art_svp_from_vpath()
[all …]
|
| /dports/print/py-reportlab/reportlab-3.5.68/src/rl_addons/renderPM/libart_lgpl/ |
| H A D | art_svp_vpath.c | 75 int n_points, n_points_max; in art_svp_from_vpath() local
85 n_points = 0; in art_svp_from_vpath()
106 svp->segs[n_segs].n_points = n_points; in art_svp_from_vpath()
125 n_points = 1; in art_svp_from_vpath()
139 x = points[n_points - 1].x; in art_svp_from_vpath()
140 y = points[n_points - 1].y; in art_svp_from_vpath()
148 svp->segs[n_segs].n_points = n_points; in art_svp_from_vpath()
159 n_points = 1; in art_svp_from_vpath()
176 n_points++; in art_svp_from_vpath()
185 if (n_points >= 2) in art_svp_from_vpath()
[all …]
|
| /dports/graphics/gimp-app/gimp-2.10.30/app/display/ |
| H A D | gimpcanvaspolygon.c | 52 gint n_points; member
259 *n_points = private->n_points; in gimp_canvas_polygon_transform()
275 n_points = private->n_points; in gimp_canvas_polygon_draw()
278 n_points = 3 * n_points / 2; in gimp_canvas_polygon_draw()
284 if (n_points < 2) in gimp_canvas_polygon_draw()
319 n_points = private->n_points; in gimp_canvas_polygon_get_extents()
322 n_points = 3 * n_points / 2; in gimp_canvas_polygon_get_extents()
328 if (n_points < 2) in gimp_canvas_polygon_get_extents()
382 n_points = private->n_points; in gimp_canvas_polygon_hit()
385 n_points = 3 * n_points / 2; in gimp_canvas_polygon_hit()
[all …]
|
| /dports/databases/mysql55-client/mysql-5.5.62/sql/ |
| H A D | spatial.cc | 469 size_t n_points; in get_data_size() local
496 n_points++; in init_from_wkt()
540 uint32 n_points; in get_data_as_wkt() local
577 uint32 n_points; in geom_length() local
586 if (n_points < 1 || not_enough_points(data, n_points)) in geom_length()
607 uint32 n_points; in is_closed() local
620 if (n_points == 0 || not_enough_points(data, n_points)) in is_closed()
651 uint32 n_points; in end_point() local
661 uint32 n_points; in point_n() local
914 uint32 n_points; in interior_ring_n() local
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/mbl/tests/ |
| H A D | test_thin_plate_spline_weights_3d.cxx | 12 void test_tpsw3d_at_fixed_points(int n_points) in test_tpsw3d_at_fixed_points() argument
15 std::vector<vgl_point_3d<double> > pts1(n_points),pts2(n_points); in test_tpsw3d_at_fixed_points()
18 mz_random.reseed(1647+2*n_points); in test_tpsw3d_at_fixed_points()
20 for (int i=0;i<n_points;++i) in test_tpsw3d_at_fixed_points()
34 for (int i=0;i<n_points;++i) in test_tpsw3d_at_fixed_points()
47 for (int i=0;i<n_points;++i) in test_tpsw3d_at_fixed_points()
57 std::vector<vgl_point_3d<double> > pts1(n_points),pts2(n_points),wts(n_points); in test_tpsw3d_at_fixed_points_with_weights()
60 mz_random.reseed(1647+2*n_points); in test_tpsw3d_at_fixed_points_with_weights()
62 for (int i=0;i<n_points;++i) in test_tpsw3d_at_fixed_points_with_weights()
80 for (int i=0;i<n_points;++i) in test_tpsw3d_at_fixed_points_with_weights()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/numerics/ |
| H A D | data_out_rotation.cc | 123 const unsigned int n_points = data.n_subdivisions + 1; in build_one_patch() local
342 for (unsigned int x = 0; x < n_points; ++x) in build_one_patch()
343 for (unsigned int y = 0; y < n_points; ++y) in build_one_patch()
349 for (unsigned int x = 0; x < n_points; ++x) in build_one_patch()
353 x * n_points * n_points + in build_one_patch()
429 for (unsigned int x = 0; x < n_points; ++x) in build_one_patch()
430 for (unsigned int y = 0; y < n_points; ++y) in build_one_patch()
436 for (unsigned int x = 0; x < n_points; ++x) in build_one_patch()
437 for (unsigned int y = 0; y < n_points; ++y) in build_one_patch()
438 for (unsigned int z = 0; z < n_points; ++z) in build_one_patch()
[all …]
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/ |
| H A D | spatial.cc | 396 uint32 n_points; in get_mbr_for_points() local
638 uint32 n_points; in get_data_size() local
661 n_points++; in init_from_wkt()
705 uint32 n_points; in get_data_as_wkt() local
732 uint32 n_points; in geom_length() local
754 uint32 n_points; in is_closed() local
789 uint32 n_points; in start_point() local
799 uint32 n_points; in end_point() local
810 uint32 n_points; in point_n() local
824 uint32 n_points; in store_shapes() local
[all …]
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/ |
| H A D | spatial.cc | 396 uint32 n_points; in get_mbr_for_points() local
638 uint32 n_points; in get_data_size() local
661 n_points++; in init_from_wkt()
705 uint32 n_points; in get_data_as_wkt() local
732 uint32 n_points; in geom_length() local
754 uint32 n_points; in is_closed() local
789 uint32 n_points; in start_point() local
799 uint32 n_points; in end_point() local
810 uint32 n_points; in point_n() local
824 uint32 n_points; in store_shapes() local
[all …]
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/ |
| H A D | spatial.cc | 396 uint32 n_points; in get_mbr_for_points() local
638 uint32 n_points; in get_data_size() local
661 n_points++; in init_from_wkt()
705 uint32 n_points; in get_data_as_wkt() local
732 uint32 n_points; in geom_length() local
754 uint32 n_points; in is_closed() local
789 uint32 n_points; in start_point() local
799 uint32 n_points; in end_point() local
810 uint32 n_points; in point_n() local
824 uint32 n_points; in store_shapes() local
[all …]
|
| /dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/ |
| H A D | spatial.cc | 396 uint32 n_points; in get_mbr_for_points() local
638 uint32 n_points; in get_data_size() local
661 n_points++; in init_from_wkt()
705 uint32 n_points; in get_data_as_wkt() local
732 uint32 n_points; in geom_length() local
754 uint32 n_points; in is_closed() local
789 uint32 n_points; in start_point() local
799 uint32 n_points; in end_point() local
810 uint32 n_points; in point_n() local
824 uint32 n_points; in store_shapes() local
[all …]
|
| /dports/databases/mysql56-client/mysql-5.6.51/sql/ |
| H A D | spatial.cc | 396 uint32 n_points; in get_mbr_for_points() local
638 uint32 n_points; in get_data_size() local
661 n_points++; in init_from_wkt()
705 uint32 n_points; in get_data_as_wkt() local
732 uint32 n_points; in geom_length() local
754 uint32 n_points; in is_closed() local
789 uint32 n_points; in start_point() local
799 uint32 n_points; in end_point() local
810 uint32 n_points; in point_n() local
824 uint32 n_points; in store_shapes() local
[all …]
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/vedit/ |
| H A D | distance.c | 49 Points2->x[Points2->n_points - 1], in Vedit_get_min_distance()
50 Points2->y[Points2->n_points - 1], in Vedit_get_min_distance()
51 Points2->z[Points2->n_points - 1], with_z); in Vedit_get_min_distance()
53 distances[2] = Vect_points_distance(Points1->x[Points1->n_points - 1], in Vedit_get_min_distance()
54 Points1->y[Points1->n_points - 1], in Vedit_get_min_distance()
55 Points1->z[Points1->n_points - 1], in Vedit_get_min_distance()
60 Points1->y[Points1->n_points - 1], in Vedit_get_min_distance()
61 Points1->z[Points1->n_points - 1], in Vedit_get_min_distance()
62 Points2->x[Points2->n_points - 1], in Vedit_get_min_distance()
63 Points2->y[Points2->n_points - 1], in Vedit_get_min_distance()
[all …]
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/sql/ |
| H A D | spatial.cc | 1193 n_points++; in init_from_wkt()
1260 n_points++; in init_from_json()
1342 if (n_points < 1 || not_enough_points(data, n_points)) in geom_length()
1390 if (n_points == 0 || not_enough_points(data, n_points)) in is_closed()
1425 if (n_points == 0 || not_enough_points(m_data+4, n_points)) in end_point()
1438 if (num >= n_points || not_enough_points(m_data+4, n_points)) in point_n()
1457 if (n_points < 1 || not_enough_points(data, n_points)) in store_shapes()
1902 if (n_points == 0 || not_enough_points(data, n_points)) in centroid_xy()
1991 if (!n_points || not_enough_points(data, n_points)) in store_shapes()
2078 n_points++; in init_from_wkt()
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/sql/ |
| H A D | spatial.cc | 1193 n_points++; in init_from_wkt()
1260 n_points++; in init_from_json()
1342 if (n_points < 1 || not_enough_points(data, n_points)) in geom_length()
1390 if (n_points == 0 || not_enough_points(data, n_points)) in is_closed()
1425 if (n_points == 0 || not_enough_points(m_data+4, n_points)) in end_point()
1438 if (num >= n_points || not_enough_points(m_data+4, n_points)) in point_n()
1457 if (n_points < 1 || not_enough_points(data, n_points)) in store_shapes()
1902 if (n_points == 0 || not_enough_points(data, n_points)) in centroid_xy()
1991 if (!n_points || not_enough_points(data, n_points)) in store_shapes()
2078 n_points++; in init_from_wkt()
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/sql/ |
| H A D | spatial.cc | 1193 n_points++; in init_from_wkt()
1260 n_points++; in init_from_json()
1342 if (n_points < 1 || not_enough_points(data, n_points)) in geom_length()
1390 if (n_points == 0 || not_enough_points(data, n_points)) in is_closed()
1425 if (n_points == 0 || not_enough_points(m_data+4, n_points)) in end_point()
1438 if (num >= n_points || not_enough_points(m_data+4, n_points)) in point_n()
1457 if (n_points < 1 || not_enough_points(data, n_points)) in store_shapes()
1902 if (n_points == 0 || not_enough_points(data, n_points)) in centroid_xy()
1991 if (!n_points || not_enough_points(data, n_points)) in store_shapes()
2078 n_points++; in init_from_wkt()
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
| H A D | spatial.cc | 1193 n_points++; in init_from_wkt()
1260 n_points++; in init_from_json()
1342 if (n_points < 1 || not_enough_points(data, n_points)) in geom_length()
1390 if (n_points == 0 || not_enough_points(data, n_points)) in is_closed()
1425 if (n_points == 0 || not_enough_points(m_data+4, n_points)) in end_point()
1438 if (num >= n_points || not_enough_points(m_data+4, n_points)) in point_n()
1457 if (n_points < 1 || not_enough_points(data, n_points)) in store_shapes()
1902 if (n_points == 0 || not_enough_points(data, n_points)) in centroid_xy()
1991 if (!n_points || not_enough_points(data, n_points)) in store_shapes()
2078 n_points++; in init_from_wkt()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/misc/src/ |
| H A D | MultiDimensionalIndexing.C | 35 const std::vector<unsigned int>& n_points ) in coordToGlobal() argument
38 queso_assert_equal_to( coord_indices.size(), n_points.size() ); in coordToGlobal()
46 queso_assert_less( coord_indices[0], n_points[0] ); in coordToGlobal()
52 queso_assert_less( coord_indices[d], n_points[d] ); in coordToGlobal()
59 idx *= n_points[local_d]; in coordToGlobal()
69 const std::vector<unsigned int>& n_points, in globalToCoord() argument
73 unsigned int dim = n_points.size(); in globalToCoord()
83 unsigned int np = compute_npoints_factor( n_points, d ); in globalToCoord()
92 queso_assert_equal_to( global, coordToGlobal(coord_indices,n_points) ); in globalToCoord()
95 …ed int MultiDimensionalIndexing::compute_npoints_factor( const std::vector<unsigned int>& n_points, in compute_npoints_factor() argument
[all …]
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/Vlib/ |
| H A D | line.c | 114 Points->n_points = n; in Vect_copy_xyz_to_pnts()
132 Points->n_points = 0; in Vect_reset_line()
158 n = Points->n_points; in Vect_append_point()
297 Points->n_points = j; in Vect_line_prune()
318 Points->n_points = ret; in Vect_line_prune_thresh()
393 *n = Points->n_points; in Vect_copy_pnts_to_xyz()
662 int n_points; in Vect_line_distance() local
665 n_points = points->n_points; in Vect_line_distance()
667 if (n_points == 1) { in Vect_line_distance()
785 int n_points; in Vect_line_geodesic_distance() local
[all …]
|
| /dports/science/mbdyn/mbdyn-1.7.3/contrib/MLS/ |
| H A D | f_regression_derivatives_kdtree.m | 85 if (length(tree) > n_points)
109 r = zeros(n_qpt*n_points,1);
110 c = zeros(n_qpt*n_points,1);
111 h = zeros(n_qpt*n_points,1);
159 %Scale = eye(n_points);
190 r(coef+1:coef+n_points) = stp*ones(n_points,1);
191 c(coef+1:coef+n_points) = Index(stp,1:n_points)';
192 %if (sum(h(coef+1:coef+n_points)) < 0.999) || (sum(h(coef+1:coef+n_points)) > 1.001)
250 rd{i}(coef+1:coef+n_points) = stp*ones(n_points,1);
251 cd{i}(coef+1:coef+n_points) = Index(stp,1:n_points)';
[all …]
|