Home
last modified time | relevance | path

Searched refs:N_POINTS (Results 1 – 25 of 40) sorted by relevance

12

/dports/math/adept/adept-2.0.8/test/
H A Dtest_radiances.cpp75 static const int N_POINTS = 25; in main() local
76 static const Real temperature_profile[N_POINTS+1] in main()
87 aReal temperature[N_POINTS]; in main()
88 for (int i = 0; i < N_POINTS; i++) { in main()
105 simulate_radiances_wrapper(N_POINTS, surface_temperature, in main()
135 Real dcost_dtemperature[N_POINTS]; in main()
137 adept::get_gradients(temperature, N_POINTS, dcost_dtemperature); in main()
143 for (int i = 0; i < N_POINTS; i++) { in main()
H A Dtest_radiances_array.cpp83 static const int N_POINTS = 25; in main() local
84 static const Real temperature_profile[N_POINTS+1] in main()
95 aVector temperature(N_POINTS); in main()
96 for (int i = 0; i < N_POINTS; i++) { in main()
113 simulate_radiances_wrapper(N_POINTS, surface_temperature, in main()
150 for (int i = 0; i < N_POINTS; i++) { in main()
/dports/graphics/cogl/cogl-1.22.8/tests/conform/
H A Dtest-point-size-attribute.c10 #define N_POINTS (MAX_POINT_SIZE - MIN_POINT_SIZE + 1) macro
58 PointVertex vertices[N_POINTS]; in create_primitive()
64 for (i = 0; i < N_POINTS; i++) in create_primitive()
89 N_POINTS, in create_primitive()
130 for (i = 0; i < N_POINTS; i++) in do_test()
/dports/x11-wm/muffin/muffin-4.8.0/cogl/tests/conform/
H A Dtest-point-size-attribute.c10 #define N_POINTS (MAX_POINT_SIZE - MIN_POINT_SIZE + 1) macro
58 PointVertex vertices[N_POINTS]; in create_primitive()
64 for (i = 0; i < N_POINTS; i++) in create_primitive()
89 N_POINTS, in create_primitive()
130 for (i = 0; i < N_POINTS; i++) in do_test()
/dports/x11-wm/mutter/mutter-41.1/cogl/tests/conform/
H A Dtest-point-size-attribute.c11 #define N_POINTS (MAX_POINT_SIZE - MIN_POINT_SIZE + 1) macro
60 PointVertex vertices[N_POINTS]; in create_primitive()
66 for (i = 0; i < N_POINTS; i++) in create_primitive()
91 N_POINTS, in create_primitive()
132 for (i = 0; i < N_POINTS; i++) in do_test()
/dports/math/vtk8/VTK-8.2.0/Filters/Hybrid/
H A DvtkProcrustesAlignmentFilter.cxx227 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
229 vtkDebugMacro(<<"N_POINTS is " <<N_POINTS); in RequestData()
231 if(N_POINTS == 0) in RequestData()
247 if(tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
348 new_mean->SetNumberOfPoints(N_POINTS); in RequestData()
371 for(v=0;v<N_POINTS;v++) in RequestData()
380 for(v=0;v<N_POINTS;v++) in RequestData()
407 for(v=0;v<N_POINTS;v++) in RequestData()
430 for(v=0;v<N_POINTS;v++) in RequestData()
H A DvtkPCAAnalysisFilter.cxx249 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
251 vtkDebugMacro(<<"N_POINTS is " <<N_POINTS); in RequestData()
253 if(N_POINTS == 0) in RequestData()
268 if(tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
279 const int n = N_POINTS; in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/Hybrid/
H A DvtkProcrustesAlignmentFilter.cxx231 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
233 vtkDebugMacro(<< "N_POINTS is " << N_POINTS); in RequestData()
235 if (N_POINTS == 0) in RequestData()
250 if (tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
347 new_mean->SetNumberOfPoints(N_POINTS); in RequestData()
370 for (v = 0; v < N_POINTS; v++) in RequestData()
378 for (v = 0; v < N_POINTS; v++) in RequestData()
405 for (v = 0; v < N_POINTS; v++) in RequestData()
426 for (v = 0; v < N_POINTS; v++) in RequestData()
H A DvtkPCAAnalysisFilter.cxx262 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
264 vtkDebugMacro(<< "N_POINTS is " << N_POINTS); in RequestData()
266 if (N_POINTS == 0) in RequestData()
280 if (tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
291 const int n = N_POINTS; in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/Hybrid/
H A DvtkProcrustesAlignmentFilter.cxx227 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
229 vtkDebugMacro(<<"N_POINTS is " <<N_POINTS); in RequestData()
231 if(N_POINTS == 0) in RequestData()
247 if(tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
348 new_mean->SetNumberOfPoints(N_POINTS); in RequestData()
371 for(v=0;v<N_POINTS;v++) in RequestData()
380 for(v=0;v<N_POINTS;v++) in RequestData()
407 for(v=0;v<N_POINTS;v++) in RequestData()
430 for(v=0;v<N_POINTS;v++) in RequestData()
H A DvtkPCAAnalysisFilter.cxx249 const int N_POINTS = input->GetNumberOfPoints(); in RequestData() local
251 vtkDebugMacro(<<"N_POINTS is " <<N_POINTS); in RequestData()
253 if(N_POINTS == 0) in RequestData()
268 if(tmpInput->GetNumberOfPoints() != N_POINTS) in RequestData()
279 const int n = N_POINTS; in RequestData()
/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/src/testing/ptest/dsp/3d/
H A Dcolocation_x3.cpp28 #define N_POINTS 256 macro
79 for (size_t j=0; j<N_POINTS; ++j, xp += 3) in call_pv()
99 for (size_t j=0; j<N_POINTS; ++j, xp += 3) in call_pv()
119 for (size_t j=0; j<N_POINTS*3; ++j, ++xp) in call_vv()
139 for (size_t j=0; j<N_POINTS*3; ++j, ++xp) in call_vv()
147 size_t buf_size = N_PLANES * 3 * sizeof(vector3d_t) + N_POINTS * 3 * sizeof(point3d_t);
174 for (size_t i=0; i < N_POINTS*3; ++i)
/dports/databases/sfcgal/SFCGAL-815d5097f684dbc48b22041bf2047beab36df0a1/test/bench/
H A DBenchTriangulation.cpp52 #define N_POINTS 100000 macro
65 for ( int i = 0; i < N_POINTS; i++ ) { in BOOST_AUTO_TEST_CASE()
70 bench().start( boost::format( "triangulate2DZ %s points" ) % N_POINTS ); in BOOST_AUTO_TEST_CASE()
130 for ( int i = 0; i < N_POINTS; i++ ) { in BOOST_AUTO_TEST_CASE()
135 bench().start( boost::format( "triangulate2D %s points" ) % N_POINTS ); in BOOST_AUTO_TEST_CASE()
H A DKernelPerfTest.cpp53 #define N_POINTS 10000000 macro
61 for ( size_t i = 0; i < N_POINTS; ++i ) { in BOOST_AUTO_TEST_CASE()
72 for ( size_t i = 0; i < N_POINTS; ++i ) { in BOOST_AUTO_TEST_CASE()
H A DIntersectionPerfTest.cpp52 #define N_POINTS 50 macro
66 for ( size_t j = 0; j < N_POINTS; ++j ) { in BOOST_AUTO_TEST_CASE()
/dports/math/polymake/polymake-4.5/apps/polytope/rules/
H A Dpoint_configuration.rules60 rule CONVEX : N_POINTS, CONVEX_HULL.N_VERTICES {
61 $this->CONVEX= $this->N_POINTS==$this->CONVEX_HULL->N_VERTICES;
87 rule GRAPH.ADJACENCY : N_POINTS, VERTEX_POINT_MAP {
88 my $g = new GraphAdjacency($this->N_POINTS);
95 rule GRAPH.ADJACENCY : N_POINTS {
96 my $g = new GraphAdjacency($this->N_POINTS);
146 rule LABELS : N_POINTS {
147 my @labels = (0..$this->N_POINTS-1);
H A Dvisual_point_configuration.rules125 …ISUAL_POINTS(%Visual::Polygons::decorations, %geometric_options) : POINTS, NON_VERTICES, N_POINTS {
127 …ES->{$_} ? $Visual::Color::non_vertices : $Visual::Color::vertices } @{range(0,$this->N_POINTS-1)};
142 …ual::Polygons::decorations, %geometric_options) : POINTS, NON_VERTICES, N_POINTS, PIF_CYCLIC_NORMA…
144 …ES->{$_} ? $Visual::Color::non_vertices : $Visual::Color::vertices } @{range(0,$this->N_POINTS-1)};
H A Daction.rules389 …ition : GROUP.PERMUTATION_ACTION.DEGREE, N_POINTS { $this->GROUP->PERMUTATION_ACTION->DEGREE == $t…
392 …ition : GROUP.PERMUTATION_ACTION.DEGREE, N_POINTS { $this->GROUP->PERMUTATION_ACTION->DEGREE == $t…
H A Dpoint_configuration_properties.rules71 property N_POINTS = override N_VECTORS;
/dports/math/polymake/polymake-4.5/apps/polytope/scripts/
H A Dcore_points.pl62 if ( $p->N_POINTS == $latpoints->rows ) {
66 for ( my $i = 0; $i < $p->N_POINTS; ++$i ) { # POINTS=VERTICES
/dports/math/topcom/topcom-0.17.8/examples/
H A Dtransportation-small.poly74 N_POINTS
/dports/graphics/opencv/opencv-4.5.3/modules/calib3d/test/
H A Dtest_undistort.cpp175 static const int N_POINTS = 10; member in opencv_test::__anon13f2c1d70111::CV_UndistortPointsTest
220 …[REF_OUTPUT][0] = sizes[TEMP][0]= cvtest::randInt(rng)%2 ? cvSize(1,N_POINTS) : cvSize(N_POINTS,1); in get_test_array_types_and_sizes()
264 vector<Point2d> points(N_POINTS); in prepare_test_case()
274 for( int i = 0; i < N_POINTS; i++ ) in prepare_test_case()
375 double* points = new double[N_POINTS*2]; in prepare_to_validation()
376 double* r_points = new double[N_POINTS*2]; in prepare_to_validation()
400 for (int i=0;i<N_POINTS*2;i++) in prepare_to_validation()
407 for (int i=0;i<N_POINTS;i++) in prepare_to_validation()
483 for (int i=0;i<N_POINTS;i++) in distortPoints()
/dports/math/gap/gap-4.11.0/pkg/polymaking-0.8.2/lib/
H A DObjectConverters.gi64 N_POINTS:=ConvertPolymakeScalarToGAP,
/dports/math/polymake/polymake-4.5/apps/fan/rules/
H A Dpolyhedral_complex_properties.rules41 # > print $c->N_POINTS;
43 property N_POINTS = override N_INPUT_RAYS;
/dports/x11-wm/compiz-plugins-extra/compiz-plugins-extra-0.8.8/src/animationaddon/
H A Dpolygon.c2004 #define N_POINTS 8 in polygonsUpdateBB() macro
2006 Point3d cubeCorners[N_POINTS] = in polygonsUpdateBB()
2017 for (j = 0; j < N_POINTS; j++, pnt++) in polygonsUpdateBB()
2027 #undef N_POINTS in polygonsUpdateBB()

12