Home
last modified time | relevance | path

Searched refs:num_pts (Results 1 – 25 of 238) sorted by relevance

12345678910

/dports/graphics/epix/epix-1.2.19/
H A Dpath.cc109 if (num_pts < 1) in path()
110 num_pts=1; in path()
118 dir *= ((1+c)/num_pts); in path()
171 if (num_pts < 2) in path()
192 unsigned int num_pts) in path() argument
195 if (num_pts < 3) in path()
219 if (num_pts < 2) in path()
220 num_pts = 2; in path()
241 unsigned int num_pts) in path() argument
244 if (num_pts < 2) in path()
[all …]
H A Dplots.cc83 unsigned int num_pts) in plot() argument
96 unsigned int num_pts) in polarplot() argument
99 domain(t_min, t_max, num_pts)); in polarplot()
159 unsigned int num_pts) in plot_deriv() argument
165 unsigned int num_pts) in plot_int() argument
171 unsigned int num_pts) in plot_int() argument
200 unsigned int num_pts) in envelope() argument
216 unsigned int num_pts) in envelope() argument
227 double t_max, unsigned int num_pts) in tan_field() argument
239 unsigned int num_pts) in tan_field() argument
[all …]
H A Dcurves.cc76 unsigned int num_pts) in line() argument
79 num_pts = (unsigned int) max(num_pts, EPIX_NUM_PTS); in line()
299 std::vector<P> shaft(num_pts+1); in arrow()
307 arrow_data data(shaft, shaft.at(num_pts-1), shaft.at(num_pts), scale); in arrow()
323 path data(p1, p2, p3, num_pts); in spline()
335 const double dt(1.0/num_pts); in arrow()
336 std::vector<P> shaft(num_pts+1); in arrow()
341 arrow_data data(shaft, shaft.at(num_pts-1), shaft.at(num_pts), scale); in arrow()
362 path trace(tmp.data(num_pts)); in spline()
370 const double dt(1.0/num_pts); in arrow()
[all …]
H A Dplot_algorithms.h198 unsigned int num_pts) in euler_plot() argument
202 const double dt(t_max/(num_pts*EPIX_ITERATIONS)); in euler_plot()
203 const double dseek(t_min/(num_pts*EPIX_ITERATIONS)); in euler_plot()
205 if (fabs(t_min/num_pts) > EPIX_EPSILON) // seek beginning of path in euler_plot()
206 for (unsigned int i=0; i <= num_pts*EPIX_ITERATIONS; ++i) in euler_plot()
212 for (unsigned int i=0; i <= num_pts*EPIX_ITERATIONS; ++i) in euler_plot()
231 double t_max, unsigned int num_pts=0)
233 if (num_pts == 0) // use "sensible" default; hardwired constant 4
234 num_pts = 4*(1 + (unsigned int)ceil(fabs(t_max)));
236 const double dt(t_max/(num_pts*EPIX_ITERATIONS));
[all …]
H A Dgeometry.h60 double t_min, double t_max, int num_pts,
64 double t_min, double t_max, int num_pts,
68 double t_min, double t_max, int num_pts,
72 double t_min, double t_max, int num_pts,
77 int num_pts, const Sphere& S = Sphere());
80 int num_pts, const Sphere& S = Sphere());
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/python/python_src/PyDakota/unit/
H A Dtest_cross_validation.py95 assert num_failures<=num_pts
96 assert num_secondary_failures<=num_pts
237 indices = numpy.arange(num_pts)
257 for num_pts in [15,16,17]:
274 num_pts = 10; num_folds = 11
341 num_pts = 10
490 num_folds = num_pts
626 if num_pts==num_folds:
659 num_pts = 11; num_eq_per_pt = 1
661 num_folds = num_pts;
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/util/
H A Dutil_math_tools.cpp31 void random_permutation(const int num_pts, in random_permutation() argument
46 boost::random::uniform_int_distribution<> dist(0, num_pts - 1); in random_permutation()
48 for (int i = 0; i < num_pts; i++) { in random_permutation()
58 void create_cv_folds(const int num_folds, const int num_pts, in create_cv_folds() argument
61 if (num_pts < num_folds) { in create_cv_folds()
67 VectorXi::LinSpaced(num_pts, 0, num_pts-1); in create_cv_folds()
70 random_permutation(num_pts, (unsigned int)std::time(0), in create_cv_folds()
74 random_permutation(num_pts, (unsigned int)seed, in create_cv_folds()
79 max_fold_size = std::round(double(num_pts) / double(num_folds)); in create_cv_folds()
86 end_ind = num_pts; in create_cv_folds()
/dports/misc/vxl/vxl-3.3.2/contrib/rpl/rgrl/
H A Drgrl_feature_set_location.hxx98 std::size_t num_pts = temp_point_indices_.size(); in features_in_region() local
99 for (std::size_t i = 0; i<num_pts; i++ ) in features_in_region()
114 std::size_t num_pts = temp_point_indices_.size(); in features_within_radius() local
115 results.reserve( num_pts ); in features_within_radius()
116 for (std::size_t i = 0; i<num_pts; i++ ) in features_within_radius()
155 std::size_t num_pts = temp_point_indices_.size(); in features_within_radius() local
156 for (std::size_t i = 0; i<num_pts; i++ ) in features_within_radius()
172 std::size_t num_pts = temp_point_indices_.size(); in k_nearest_features() local
173 for (std::size_t i = 0; i<num_pts; i++ ) in k_nearest_features()
189 std::size_t num_pts = temp_point_indices_.size(); in k_nearest_features() local
[all …]
/dports/x11/xstroke/xstroke-0.5.12/
H A Dstroke.c39 stroke->num_pts = 0; in stroke_init()
87 if (stroke->num_pts == 0) { in do_add_pt()
118 pt = &stroke->pts[stroke->num_pts++]; in do_add_pt()
128 if (stroke->num_pts) { in stroke_add_pt()
157 int num_pts = stroke->num_pts; in stroke_transform() local
160 stroke->num_pts = 0; in stroke_transform()
165 for (i=0; i < num_pts; i++) { in stroke_transform()
182 for (i=0; i < stroke->num_pts; i++) { in stroke_normalize()
196 for (i=0; i < stroke->num_pts; i++) { in stroke_str_alloc()
232 for (i=0; i < stroke->num_pts; i++) { in stroke_find_bounds()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/unit/
H A DiMeshTest.cpp177 for (i = 0; i < num_pts; ++i) in writeVtkFile()
256 vector<MsqVertex> coordinates( num_pts ); in matchVertexCoordinates()
264 for (size_t i = 0; i < num_pts; ++i) in matchVertexCoordinates()
392 unsigned char bytes[num_pts]; in testVertexByte()
394 for (i = 0; i < num_pts; ++i) in testVertexByte()
400 for (i = 0; i < num_pts; ++i) in testVertexByte()
409 for (i = 0; i < num_pts; ++i) in testVertexByte()
413 unsigned char bytes2[num_pts]; in testVertexByte()
527 std::set<int> adjset[num_pts]; in testVertexAdjacency()
541 for (i = 0; i < num_pts; ++i) in testVertexAdjacency()
[all …]
H A DSphericalDomainTest.cpp158 const int num_pts = 5; in test_snap_to() local
159 double points[num_pts][3] = { { 0, 0, 0 }, in test_snap_to()
164 for (int i = 0; i < num_pts; ++i) { in test_snap_to()
177 const int num_pts = 5; in test_normal_at() local
178 double points[num_pts][3] = { { 0, 0, 0 }, in test_normal_at()
183 for (int i = 0; i < num_pts; ++i) { in test_normal_at()
201 const int num_pts = 5; in test_closest_point() local
202 double points[num_pts][3] = { { 0, 0, 0 }, in test_closest_point()
207 for (int i = 0; i < num_pts; ++i) { in test_closest_point()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/
H A DHermiteInterpPolynomial.cpp29 int i, num_pts = interpPts.size(), n2 = 2*num_pts, n2m1 = n2 - 1; in precompute_data() local
30 RealArray values(num_pts, 0.), derivs(num_pts, 0.); in precompute_data()
33 yT1ValDiffTab.resize(num_pts); yT1GradDiffTab.resize(num_pts); // type 1 in precompute_data()
34 yT2ValDiffTab.resize(num_pts); yT2GradDiffTab.resize(num_pts); // type 2 in precompute_data()
35 for (i=0; i<num_pts; ++i) { in precompute_data()
40 webbur::hermite_interpolant(num_pts, &interpPts[0], &values[0], &derivs[0], in precompute_data()
48 webbur::hermite_interpolant(num_pts, &interpPts[0], &values[0], &derivs[0], in precompute_data()
63 for (i=0; i<num_pts; ++i) { in precompute_data()
67 for (int j=0; j<num_pts; ++j) in precompute_data()
/dports/graphics/tgif/tgif-QPL-4.2.5/
H A Ddup.c183 register int i, num_pts; local
200 for (i=0; i < num_pts; i++) {
222 for (i=0; i < num_pts; i++) {
235 for (i=0; i < num_pts; i++) {
245 num_pts = PolyPtr->ssn;
295 register int i, num_pts; local
312 for (i=0; i < num_pts; i++) {
352 num_pts = PolygonPtr->ssn;
409 int i, num_pts; local
463 int i, num_pts; local
[all …]
H A Dpolygon.c665 if (num_pts == 1) {
1455 num_pts++;
1732 num_pts++;
1859 num_pts++; in InputPolygonPts()
1895 num_pts++; in InputPolygonPts()
2113 if (num_pts <= 0) {
2131 if (num_pts < 3) {
2197 switch (num_pts) {
2208 num_pts = 4;
2220 num_pts = 4;
[all …]
/dports/math/py-sympy/sympy-1.9/examples/intermediate/
H A Dvandermonde.py77 num_pts = len(points)
78 if num_pts == 0:
84 if num_pts < V.shape[0]:
88 (V.shape[0], order, dim, num_pts))
89 elif num_pts > V.shape[0]:
92 (num_pts, V.shape[0], V.shape[0]))
93 num_pts = V.shape[0]
97 for i in range(num_pts):
102 coeffs = V_inv.multiply(Matrix([points[i][-1] for i in range(num_pts)]))
/dports/misc/ompl/ompl-1.5.2/demos/
H A DGeometricCarPlanning.cpp127 const unsigned int num_pts = 50; in printTrajectory() local
138 for (unsigned int i=0; i<=num_pts; ++i) in printTrajectory()
140 space->interpolate(from(), to(), (double)i/num_pts, s()); in printTrajectory()
158 const unsigned int num_pts = 200; in printDistanceGrid() local
162 for (unsigned int i=0; i<num_pts; ++i) in printDistanceGrid()
163 for (unsigned int j=0; j<num_pts; ++j) in printDistanceGrid()
164 for (unsigned int k=0; k<num_pts; ++k) in printDistanceGrid()
166 to[0] = 5. * (2. * (double)i/num_pts - 1.); in printDistanceGrid()
167 to[1] = 5. * (2. * (double)j/num_pts - 1.); in printDistanceGrid()
168 to[2] = boost::math::constants::pi<double>() * (2. * (double)k/num_pts - 1.); in printDistanceGrid()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/util/unit/
H A DMathToolsTest.cpp101 const int num_pts = 9; in TEUCHOS_UNIT_TEST() local
105 VectorXi gold_permutation_indices(num_pts); in TEUCHOS_UNIT_TEST()
110 VectorXi::LinSpaced(num_pts, 0, num_pts-1); in TEUCHOS_UNIT_TEST()
117 random_permutation(num_pts, (unsigned int) 22, in TEUCHOS_UNIT_TEST()
128 const int num_pts = 9; in TEUCHOS_UNIT_TEST() local
144 create_cv_folds(num_folds, num_pts, cv_folds); in TEUCHOS_UNIT_TEST()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DQMEApproximation.cpp69 size_t num_pts = approxData.points(), num_v = sharedDataRep->numVars; in build() local
70 if (num_pts < 1 ) {// || num_pts > 2) { in build()
71 Cerr << "Error: wrong number of data points (" << num_pts in build()
90 if (num_pts == 1) { in build()
149 size_t k=num_pts-1, p=num_pts-2; // indices to current and previous points in find_scaled_coefficients()
168 if ( num_pts > 2 ) { in find_scaled_coefficients()
281 numUsed = std::min(num_v,num_pts-1); in find_scaled_coefficients()
285 size_t num_prev=num_pts-1, p1=num_pts-numUsed-1, n=0; in find_scaled_coefficients()
286 for (p=p1; p<num_pts-1; ++p) { in find_scaled_coefficients()
424 size_t k=num_pts-1, p=num_pts-2; // indices to current and previous points in apxfn_value()
[all …]
H A DQMEApproximation.hpp133 size_t ndv = sharedDataRep->numVars, num_pts = approxData.points(), num_pop; in clear_current_active_data() local
142 num_pop = (num_pts > ndv) ? num_pts - ndv : 0; in clear_current_active_data()
146 size_t excess_pts = (num_pts > ndv) ? num_pts - ndv : 0; in clear_current_active_data()
/dports/misc/vxl/vxl-3.3.2/contrib/rpl/rrel/tests/
H A Dtest_linear_reg.cxx22 constexpr unsigned int num_pts = 7; in test_linear_reg() local
26 std::vector< vnl_vector<double> > pts( num_pts ); in test_linear_reg()
27 std::vector< vnl_vector<double> > ind_vars( num_pts ); in test_linear_reg()
28 std::vector<double> rand_vars( num_pts ); in test_linear_reg()
29 std::vector<double> error( num_pts ); in test_linear_reg()
85 TEST( "num_samples_to_instantiate (3)" , lr1->num_samples(), num_pts); in test_linear_reg()
86 TEST( "num_data_points" , lr2->num_samples(), num_pts); in test_linear_reg()
118 std::vector<double> residuals( num_pts ); in test_linear_reg()
129 std::vector<double> wgts( num_pts ); in test_linear_reg()
/dports/databases/grass7/grass-7.8.6/lib/htmldriver/
H A Dgraph_clse.c54 for (i = 0; i < poly->num_pts && inside; i++) { in HTML_Graph_close()
55 inside = pnpoly(test_poly->num_pts, in HTML_Graph_close()
60 poly->num_pts = 0; /* mark polygon as having no points */ in HTML_Graph_close()
91 if (poly->num_pts >= 3) { in HTML_Graph_close()
97 for (i = 0; i < poly->num_pts; i++) { in HTML_Graph_close()
106 for (i = 0; i < poly->num_pts; i++) { in HTML_Graph_close()
117 for (i = 0; i < poly->num_pts; i++) { in HTML_Graph_close()
/dports/graphics/xfig/xfig-3.2.8a/src/
H A Dd_subspline.c44 create_subspline(int *num_pts, F_spline *spline, F_point *point, F_sfactor **sfactor, F_sfactor **s… in create_subspline() argument
49 *num_pts = num_points(spline->points); in create_subspline()
51 if (*num_pts > MIN_NUMPOINTS_FOR_QUICK_REDRAW) in create_subspline()
67 void free_subspline(int num_pts, F_spline **spline) in free_subspline() argument
69 if (num_pts > MIN_NUMPOINTS_FOR_QUICK_REDRAW) in free_subspline()
74 draw_subspline(int num_pts, F_spline *spline, int op) in draw_subspline() argument
76 if (num_pts > MIN_NUMPOINTS_FOR_QUICK_REDRAW) in draw_subspline()
/dports/misc/vxl/vxl-3.3.2/contrib/rpl/rrel/
H A Drrel_orthogonal_regression.cxx18 unsigned int num_pts = pts.rows (); in rrel_orthogonal_regression() local
20 if ( param_dof() > num_pts ) in rrel_orthogonal_regression()
23 << num_pts << ").\nAn infinite set of equally valid solutions exists.\n"; in rrel_orthogonal_regression()
31 unsigned int num_pts = vars_.rows(); in rrel_orthogonal_regression() local
33 for (unsigned int i=0;i<num_pts;i++) in rrel_orthogonal_regression()
37 if ( param_dof() > num_pts ) in rrel_orthogonal_regression()
40 << num_pts << ").\nAn infinite set of equally valid solutions exists.\n"; in rrel_orthogonal_regression()
/dports/games/fs2open/fs2open.github.com-release_21_4_1/code/math/
H A Dspline.cpp61 num_pts = 0; in bez_spline()
76 num_pts = _num_pts; in bez_set_points()
111 for(idx=0; idx<num_pts; idx++){ in bez_get_point()
113 bez_val = BEZ(idx, num_pts-1, u); in bez_get_point()
160 for(idx=0; idx<num_pts; idx++){ in bez_render()
179 num_pts = 0; in herm_spline()
194 num_pts = _num_pts; in herm_set_points()
271 for(idx=0; idx<num_pts-1; idx++){ in herm_render()
305 for(idx=0; idx<num_pts; idx++){ in herm_render()
/dports/games/diaspora/Diaspora_R1_Linux/Diaspora/fs2_open/code/math/
H A Dspline.cpp52 num_pts = 0; in bez_spline()
67 num_pts = _num_pts; in bez_set_points()
102 for(idx=0; idx<num_pts; idx++){ in bez_get_point()
104 bez_val = BEZ(idx, num_pts-1, u); in bez_get_point()
151 for(idx=0; idx<num_pts; idx++){ in bez_render()
170 num_pts = 0; in herm_spline()
185 num_pts = _num_pts; in herm_set_points()
262 for(idx=0; idx<num_pts-1; idx++){ in herm_render()
296 for(idx=0; idx<num_pts; idx++){ in herm_render()

12345678910