Home
last modified time | relevance | path

Searched refs:nb_iter (Results 1 – 25 of 215) sorted by relevance

123456789

/dports/math/xtensor/xtensor-0.24.0/test/
H A Dtest_xbroadcast.cpp95 size_t nb_iter = 3; in TEST() local
102 for (size_t i = 0; i < nb_iter; ++i) in TEST()
107 for (size_t i = 0; i < nb_iter; ++i) in TEST()
119 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
124 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
136 size_t nb_iter = 3; in TEST() local
143 for (size_t i = 0; i < nb_iter; ++i) in TEST()
148 for (size_t i = 0; i < nb_iter; ++i) in TEST()
160 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
165 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
H A Dtest_xoptional_assembly_adaptor.cpp262 size_t nb_iter = a.size() / 2; in TEST() local
270 for (size_t i = 0; i < nb_iter; ++i) in TEST()
275 for (size_t i = 0; i < nb_iter; ++i) in TEST()
289 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
294 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
305 for (size_t i = 0; i < nb_iter; ++i) in TEST()
310 for (size_t i = 0; i < nb_iter; ++i) in TEST()
324 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
345 size_t nb_iter = a.size() / 2; in TEST() local
353 for (size_t i = 0; i < nb_iter; ++i) in TEST()
[all …]
H A Dtest_xoptional_assembly.cpp354 size_t nb_iter = vec.size() / 2; in TEST() local
361 for (size_t i = 0; i < nb_iter; ++i) in TEST()
366 for (size_t i = 0; i < nb_iter; ++i) in TEST()
380 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
385 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
396 for (size_t i = 0; i < nb_iter; ++i) in TEST()
401 for (size_t i = 0; i < nb_iter; ++i) in TEST()
415 for (size_t i = 0; i < 2 * nb_iter; ++i) in TEST()
435 size_t nb_iter = vec.size() / 2; in TEST() local
442 for (size_t i = 0; i < nb_iter; ++i) in TEST()
[all …]
H A Dtest_common.hpp797 size_t nb_iter = vec.size() / 2; in test_xiterator() local
804 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
809 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
823 for (size_t i = 0; i < 2 * nb_iter; ++i) in test_xiterator()
828 for (size_t i = 0; i < 2 * nb_iter; ++i) in test_xiterator()
839 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
844 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
858 for (size_t i = 0; i < 2 * nb_iter; ++i) in test_xiterator()
877 size_t nb_iter = vec.size() / 2; in test_reverse_xiterator() local
883 for (size_t i = 0; i < nb_iter; ++i) in test_reverse_xiterator()
[all …]
/dports/www/srg/srg-1.3.6/src/
H A DfilterSites.cc121 list<exclude_netblock>::const_iterator nb_iter; in destination_is_excluded() local
122 for (nb_iter=exclude_netblocks.begin(); in destination_is_excluded()
123 nb_iter != exclude_netblocks.end(); in destination_is_excluded()
124 nb_iter++) { in destination_is_excluded()
125 if ((dest_ip.s_addr&(*nb_iter).netmask.s_addr)== in destination_is_excluded()
126 (*nb_iter).network.s_addr) { in destination_is_excluded()
/dports/math/polymake/polymake-4.5/apps/fan/include/
H A Dstacky_fundamental_domain.h78 …for (auto nb_iter = entire(dual_graph.adjacent_nodes(current_index)); !nb_iter.at_end(); ++nb_iter) in fundamental_domain_in_first_bc() local
79 if (!seen_indices.contains(*nb_iter)) { in fundamental_domain_in_first_bc()
80 queue.push_back(*nb_iter); in fundamental_domain_in_first_bc()
81 seen_indices += *nb_iter; in fundamental_domain_in_first_bc()
85 cerr << "added neighbor " << *nb_iter << ": " << indexed_SD_facets[*nb_iter] << endl; in fundamental_domain_in_first_bc()
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/voronoi/
H A DCVT.cpp139 void CentroidalVoronoiTesselation::Lloyd_iterations(index_t nb_iter) { in Lloyd_iterations() argument
148 progress_->reset(nb_iter); in Lloyd_iterations()
152 nb_iter_ = nb_iter; in Lloyd_iterations()
154 for(index_t i = 0; i < nb_iter; i++) { in Lloyd_iterations()
279 index_t nb_iter, index_t m in Newton_iterations() argument
286 Lloyd_iterations(nb_iter); in Newton_iterations()
295 progress_->reset(nb_iter); in Newton_iterations()
299 nb_iter_ = nb_iter; in Newton_iterations()
308 optimizer->set_max_iter(nb_iter); in Newton_iterations()
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/Plugins/PMP/
H A DSmoothing_plugin.cpp159 const unsigned int nb_iter = ui_widget.smooth_iter_spinBox->value(); in on_mesh_smoothing_clicked() local
179 .number_of_iterations(nb_iter) in on_mesh_smoothing_clicked()
197 .number_of_iterations(nb_iter) in on_mesh_smoothing_clicked()
208 … .number_of_iterations(nb_iter) in on_mesh_smoothing_clicked()
236 const unsigned int nb_iter = ui_widget.smooth_iter_spinBox->value(); in on_shape_smoothing_clicked() local
251 smooth_shape(pmesh, time_step, parameters::number_of_iterations(nb_iter) in on_shape_smoothing_clicked()
263 smooth_shape(pmesh, time_step, parameters::number_of_iterations(nb_iter) in on_shape_smoothing_clicked()
269 parameters::number_of_iterations(nb_iter) in on_shape_smoothing_clicked()
H A DIsotropic_remeshing_plugin.cpp365 unsigned int nb_iter = ui.nbIterations_spinbox->value(); in isotropic_remeshing() local
515 , CGAL::Polygon_mesh_processing::parameters::number_of_iterations(nb_iter) in isotropic_remeshing()
643 , CGAL::Polygon_mesh_processing::parameters::number_of_iterations(nb_iter) in isotropic_remeshing()
654 , CGAL::Polygon_mesh_processing::parameters::number_of_iterations(nb_iter) in isotropic_remeshing()
692 unsigned int nb_iter = 1; in isotropic_remeshing_of_several_polyhedra() local
728 nb_iter = ui.nbIterations_spinbox->value(); in isotropic_remeshing_of_several_polyhedra()
790 target_length, nb_iter, protect, smooth_features); in isotropic_remeshing_of_several_polyhedra()
878 const unsigned int nb_iter, in Remesh_polyhedron_item()
883 , nb_iter_(nb_iter) in Remesh_polyhedron_item()
918 const unsigned int nb_iter, in Remesh_polyhedron_item_for_parallel_for()
[all …]
/dports/math/geogram/geogram-1.7.7/src/tutorial/01_basics/hello_GLUP_app/
H A Dmain.cpp118 void compute(index_t nb_iter) { in compute() argument
121 ProgressTask progress("Computing", nb_iter); in compute()
123 for(index_t i=0; i<nb_iter; ++i) { in compute()
/dports/math/xtensor-python/xtensor-python-0.26.0/test/
H A Dtest_common.hpp604 size_t nb_iter = vec.size() / 2; in test_xiterator() local
611 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
615 EXPECT_EQ(vec.data()[nb_iter], *iter); in test_xiterator()
616 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
630 for (size_t i = 0; i < 2 * nb_iter; ++i) in test_xiterator()
635 for (size_t i = 0; i < 2 * nb_iter; ++i) in test_xiterator()
646 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
651 for (size_t i = 0; i < nb_iter; ++i) in test_xiterator()
684 size_t nb_iter = vec.size() / 2; in test_reverse_xiterator() local
690 for (size_t i = 0; i < nb_iter; ++i) in test_reverse_xiterator()
[all …]
/dports/cad/openfpgaloader/openFPGALoader-0.6.1/src/
H A Depcq2.cpp146 int nb_iter, len, nb_read, offset = start_offset;
165 nb_iter = file_size / 256;
166 nb_iter += ((file_size % 256) ? 1 : 0);
183 for (i= 0; i < nb_iter; i++) {
202 printf("%s sector done len %d %d %d\n", __func__, len, i, nb_iter);
/dports/science/siconos/siconos-4.4.0/numerics/src/LCP/
H A Dlcp_pivot.c77 unsigned nb_iter = 0; in lcp_pivot_covering_vector() local
229 t_stack[nb_iter%stack_size] = 1.0; in lcp_pivot_covering_vector()
320 while(nb_iter < itermax && !has_sol) in lcp_pivot_covering_vector()
323 ++nb_iter; in lcp_pivot_covering_vector()
397 t_stack[nb_iter%stack_size] = 1.0; in lcp_pivot_covering_vector()
473 t_stack[nb_iter%stack_size] = mat[t_indx]; in lcp_pivot_covering_vector()
548 if(nb_iter < itermax) in lcp_pivot_covering_vector()
564 options->iparam[SICONOS_IPARAM_ITER_DONE] = nb_iter; in lcp_pivot_covering_vector()
H A Dlcp_pivot_lumod.c114 unsigned nb_iter = 0; in lcp_pivot_lumod_covering_vector() local
221 t_stack[nb_iter%stack_size] = 1.0; in lcp_pivot_lumod_covering_vector()
326 while(nb_iter < itermax && !has_sol) in lcp_pivot_lumod_covering_vector()
329 ++nb_iter; in lcp_pivot_lumod_covering_vector()
448 t_stack[nb_iter%stack_size] = 1.0; in lcp_pivot_lumod_covering_vector()
522 t_stack[nb_iter%stack_size] = mat[t_indx]; in lcp_pivot_lumod_covering_vector()
581 if(nb_iter < itermax) in lcp_pivot_lumod_covering_vector()
598 options->iparam[SICONOS_IPARAM_ITER_DONE] = nb_iter; in lcp_pivot_lumod_covering_vector()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/QuadEdgeMeshFiltering/test/
H A DitkSmoothingQuadEdgeMeshFilterTest.cxx60 unsigned int nb_iter; in itkSmoothingQuadEdgeMeshFilterTest() local
62 ssout >>nb_iter; in itkSmoothingQuadEdgeMeshFilterTest()
79 filter->SetNumberOfIterations( nb_iter ); in itkSmoothingQuadEdgeMeshFilterTest()
/dports/math/gmm++/gmm-5.4/tests/
H A Dgmm_torture01_lusolve.cc43 static size_type nb_iter = 0; in test_procedure() local
56 ++nb_iter; in test_procedure()
72 if (nb_iter == 100) return true; in test_procedure()
H A Dmake_gmm_test.pl23 $nb_iter = 1; # number of iterations on each test
71 $nb_iter = $val;
107 print "Gmm tests : Making $nb_iter execution";
108 if ($nb_iter > 1) { print "s"; }
112 for ($iter = 1; $iter <= $nb_iter; ++$iter) {
117 if ($nb_iter == 1) { print "Testing $org_name"; }
H A Dgmm_torture20_iterative_solvers.cc37 size_type nb_iter, nb_fault, nb_expe; member
38 la_stat(void) : nb_iter(0), nb_fault(0), nb_expe(0) {}; in la_stat()
42 la_stat ps_stat(const PS &, size_type nb_iter, bool fault) { in ps_stat() argument
44 if (nb_iter != size_type(-1)) { in ps_stat()
46 la.nb_iter += nb_iter; in ps_stat()
64 cout << ", average nb iter = " << double(s.nb_iter) / double(s.nb_expe); in print_stat()
/dports/math/polymake/polymake-4.5/apps/fan/src/
H A Dstacky_fundamental_domain.cc84 …for (auto nb_iter = entire(dual_graph.adjacent_nodes(current_index)); !nb_iter.at_end(); ++nb_iter) in find_facet_rep_indices() local
85 if (!seen_indices.contains(*nb_iter)) { in find_facet_rep_indices()
86 queue.push_back(*nb_iter); in find_facet_rep_indices()
87 seen_indices += *nb_iter; in find_facet_rep_indices()
90 cerr << "added neighbor " << *nb_iter << ": " << SD_facets[*nb_iter] << endl; in find_facet_rep_indices()
/dports/net/samba412/samba-4.12.15/source4/scripting/devel/
H A Dgetncchanges138 nb_iter = 0
141 nb_iter += 1
142 if ctr.more_data == 0 or opts.nb_iter == nb_iter:
/dports/math/geogram/geogram-1.7.7/src/examples/graphics/demo_SimpleApplication/
H A Dmain.cpp210 void compute(index_t nb_iter) { in compute() argument
212 ProgressTask progress("Computing", nb_iter); in compute()
214 for(index_t i=0; i<nb_iter; ++i) { in compute()
/dports/math/geogram/geogram-1.7.7/src/lib/exploragram/optimal_transport/
H A DVSDM.cpp147 void VSDM::optimize(index_t nb_iter) { in optimize() argument
148 if(nb_iter == 0) { in optimize()
153 progress_->reset(nb_iter); in optimize()
163 nb_iter_ = nb_iter; in optimize()
176 optimizer_->set_max_iter(nb_iter); in optimize()
/dports/deskutils/cairo-dock-plugins/cairo-dock-plug-ins-3.4.1/Animated-icons/src/
H A Dapplet-mesh-factory.c32 int deg, deg2, iter, nb_iter=20; in cairo_dock_load_capsule_calllist() local
36 amp = 90.0 / nb_iter; in cairo_dock_load_capsule_calllist()
61 double b = 1./nb_iter; in cairo_dock_load_capsule_calllist()
65 for (iter = 0;iter < nb_iter-1;iter ++) in cairo_dock_load_capsule_calllist()
198 int deg, deg2, nb_iter=20; in cairo_dock_load_ring_calllist() local
202 amp = 90.0 / nb_iter; in cairo_dock_load_ring_calllist()
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/
H A Dtree-scalar-evolution.c474 if (nb_iter == chrec_dont_know) in compute_overall_effect_of_inner_loop()
482 nb_iter = chrec_fold_minus (chrec_type (nb_iter), in compute_overall_effect_of_inner_loop()
483 nb_iter, in compute_overall_effect_of_inner_loop()
516 tree nb_iter; in chrec_is_positive() local
539 nb_iter = number_of_iterations_in_loop in chrec_is_positive()
545 nb_iter = chrec_fold_minus in chrec_is_positive()
546 (chrec_type (nb_iter), nb_iter, in chrec_is_positive()
547 build_int_cst (chrec_type (nb_iter), 1)); in chrec_is_positive()
553 nb_iter = chrec_fold_minus in chrec_is_positive()
554 (chrec_type (nb_iter), nb_iter, in chrec_is_positive()
[all …]
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-loop-distribution.c273 fold_convert_loc (loc, sizetype, nb_iter), in build_size_arg_loc()
307 tree nb_iter, mem, fn, nb_bytes; in generate_memset_builtin() local
314 nb_iter = number_of_latch_executions (loop); in generate_memset_builtin()
316 nb_iter = number_of_exit_cond_executions (loop); in generate_memset_builtin()
321 nb_bytes = build_size_arg_loc (loc, partition->main_dr, nb_iter); in generate_memset_builtin()
373 tree nb_iter, dest, src, fn, nb_bytes; in generate_memcpy_builtin() local
380 nb_iter = number_of_latch_executions (loop); in generate_memcpy_builtin()
382 nb_iter = number_of_exit_cond_executions (loop); in generate_memcpy_builtin()
866 tree nb_iter; in classify_partition() local
899 nb_iter = number_of_exit_cond_executions (loop); in classify_partition()
[all …]

123456789