Home
last modified time | relevance | path

Searched refs:i_iter (Results 1 – 25 of 96) sorted by relevance

1234

/dports/biology/gffread/gffread-0.12.7/gclib/
H A DGHashMap.hh127 i_iter=0; in startIterate()
134 while (i_iter<nb && !this->_used(i_iter)) i_iter++; in Next()
137 ++i_iter; in Next()
334 while (i_iter<nb && !this->_used(i_iter)) i_iter++; in Next()
338 ++i_iter; in Next()
348 while (i_iter<nb && !this->_used(i_iter)) i_iter++; in Next()
352 ++i_iter; in Next()
362 while (i_iter<nb && !this->_used(i_iter)) i_iter++; in NextData()
365 ++i_iter; in NextData()
375 while (i_iter<nb && !this->_used(i_iter)) i_iter++; in NextData()
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/BiasCorrection/test/
H A DitkMRIBiasFieldCorrectionFilterTest.cxx120 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
154 i_iter.GoToBegin(); in itkMRIBiasFieldCorrectionFilterTest()
161 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
179 i_iter.GoToBegin(); in itkMRIBiasFieldCorrectionFilterTest()
184 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
258 i_iter.GoToBegin(); in itkMRIBiasFieldCorrectionFilterTest()
262 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
330 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
398 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
458 ++i_iter; in itkMRIBiasFieldCorrectionFilterTest()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DNOWPACOptimizer.cpp225 StLCIter i_iter; RLCIter m_iter, o_iter; in core_run() local
227 for (i_iter = nln_ineq_map_indices.begin(), in core_run()
230 i_iter != nln_ineq_map_indices.end(); ++i_iter, ++m_iter, ++o_iter) in core_run()
349 i_iter != nonlinIneqConMappingIndices.end(); in evaluate()
357 for (i_iter = linIneqConMappingIndices.begin(), in evaluate()
360 i_iter != linIneqConMappingIndices.end(); in evaluate()
362 size_t index = *i_iter; in evaluate()
400 StLIter i_iter; RLIter m_iter, o_iter; in evaluate() local
416 for (i_iter = linIneqConMappingIndices.begin(), in evaluate()
419 i_iter != linIneqConMappingIndices.end(); in evaluate()
[all …]
H A DNLPQLPOptimizer.cpp310 StLIter i_iter; in core_run() local
312 for (i_iter = linIneqConMappingIndices.begin(), in core_run()
315 i_iter != linIneqConMappingIndices.end(); in core_run()
316 i_iter++, m_iter++, o_iter++) { // linear ineq in core_run()
317 size_t index = *i_iter; in core_run()
367 StLIter i_iter; in core_run() local
369 for (i_iter = linIneqConMappingIndices.begin(), in core_run()
372 i_iter != linIneqConMappingIndices.end(); in core_run()
373 i_iter++, m_iter++, o_iter++) { // linear ineq in core_run()
375 index = *i_iter; in core_run()
/dports/mail/spamprobe/spamprobe-1.4d/src/hdl/
H A DHdlStatement.cc47 typedef ChildVector::const_iterator i_iter; in child() typedef
48 for (i_iter i = m_children.begin(); i != m_children.end(); ++i) { in child()
61 typedef ChildVector::const_iterator i_iter; in child() typedef
62 for (i_iter i = m_children.begin(); i != m_children.end(); ++i) { in child()
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/
H A Dgraphlayout.cpp157 std::map<std::string, unsigned>::iterator i_iter=nodelookup.find(attachedItems[0]->getId()); in graphlayout() local
158 if (i_iter == nodelookup.end()) continue; in graphlayout()
159 unsigned rect_index_first = i_iter->second; in graphlayout()
160 i_iter = nodelookup.find(attachedItems[1]->getId()); in graphlayout()
161 if (i_iter == nodelookup.end()) continue; in graphlayout()
162 unsigned rect_index_second = i_iter->second; in graphlayout()
/dports/net-mgmt/fastnetmon/fastnetmon-1.1.4/src/tests/
H A Dpatricia_performance_tests.c42 int i_iter = 100; in main() local
60 for (i = 0; i < i_iter; i++) { in main()
78 unsigned long total_ops = i_iter * j_iter; in main()
H A Dlpm_performance_tests.cpp123 int i_iter = 100; in main() local
142 for (int i = 0; i < i_iter; i++) { in main()
201 unsigned long total_ops = i_iter * j_iter; in main()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/registration/include/pcl/registration/impl/
H A Dia_ransac.hpp232 int i_iter = 0; in computeTransformation() local
239 i_iter = 1; in computeTransformation()
242 for (; i_iter < max_iterations_; ++i_iter) { in computeTransformation()
259 if (i_iter == 0 || error < lowest_error) { in computeTransformation()
/dports/devel/ppl/ppl-1.2/src/
H A DOctagonal_Shape_templates.hh1268 for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) { in is_disjoint_from() local
1452 for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) { in frequency() local
2154 ++i_iter; in relation_with()
2297 for (row_iterator i_iter = m_begin; i_iter != m_end; i_iter += 2) { in relation_with() local
2382 for (row_iterator i_iter = m_begin ; i_iter != m_end; i_iter += 2) { in relation_with() local
2825 for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) { in incremental_strong_closure_assign() local
2868 for (row_iterator i_iter = m_begin; i_iter != m_end; ++i_iter) { in incremental_strong_closure_assign() local
2940 = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1); in compute_successors()
2972 i_iter != matrix_row_end; ++i_iter) { in compute_leaders()
2976 = (i % 2 != 0) ? *(i_iter-1) : *(i_iter + 1); in compute_leaders()
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Numerics/Statistics/test/
H A DitkStatisticsAlgorithmTest2.cxx65 i_iter(image, image->GetLargestPossibleRegion()); in resetData() local
66 i_iter.GoToBegin(); in resetData()
73 *viter = i_iter.Get()[testDimension]; in resetData()
75 ++i_iter; in resetData()
H A DitkSubsampleTest.cxx241 ImageIterator i_iter(filter->GetInput(), in itkSubsampleTest() local
248 if (itk::Math::NotExactlyEquals(i_iter.Get()[0], s_iter.GetMeasurementVector()[0])) in itkSubsampleTest()
254 ++i_iter; in itkSubsampleTest()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/h5file/
H A Ddump_geom_sets.cxx121 std::map<long,long>::const_iterator d_iter, i_iter; in ent_from_handle() local
123 i_iter = idmap.find( handle ); in ent_from_handle()
124 if (d_iter == dimmap.end() || i_iter == idmap.end()) in ent_from_handle()
138 sprintf(buffer, "%ld", i_iter->second ); in ent_from_handle()
/dports/graphics/proj/proj-7.2.1/src/tests/
H A Dmultistresstest.cpp193 int i_iter; in TestThread() local
219 for( i_iter = 0; i_iter < repeat_count; i_iter++ ) in TestThread()
/dports/science/cp2k-data/cp2k-7.1.0/src/
H A Dforce_env_methods.F1581 i_force_eval, i_iter, i_spin, & local
1743 DO i_iter = 1, opt_embed%n_iter
1744 opt_embed%i_iter = i_iter
1808 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) + energy%total
1855 …opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) - pw_integral_ab(embed_pot%pw, rho_r_ref(i_spi…
1861 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) &
1867 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) + opt_embed%reg_term
1870 CALL print_emb_opt_info(output_unit, i_iter, opt_embed)
2048 DO i_iter = 1, opt_dmfet%n_iter
2050 opt_dmfet%i_iter = i_iter
[all …]
H A Doptimize_embedding_potential.F1180 IF (opt_embed%i_iter .EQ. 1) THEN ! Else it is kept in memory
1604 IF (opt_embed%i_iter .GT. 2) &
1623 IF (opt_embed%i_iter > 1) THEN
2301 actual_ener_change = opt_embed%w_func(opt_embed%i_iter) - &
2399 DO i_iter = 1, max_iter
2761 INTEGER, INTENT(IN) :: i_iter local
2785 IF (i_iter .LE. 1) THEN
3138 INTEGER :: i_iter local
3162 WRITE (filename, '(a5,I3.3,a1,I1.1)') "DIFF_", i_iter
3293 WRITE (filename, '(a10,I3.3)') "embed_pot_", i_iter
[all …]
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/
H A Dforce_env_methods.F1619 i_force_eval, i_iter, i_spin, & local
1781 DO i_iter = 1, opt_embed%n_iter
1782 opt_embed%i_iter = i_iter
1846 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) + energy%total
1893 …opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) - pw_integral_ab(embed_pot%pw, rho_r_ref(i_spi…
1899 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) &
1905 opt_embed%w_func(i_iter) = opt_embed%w_func(i_iter) + opt_embed%reg_term
1908 CALL print_emb_opt_info(output_unit, i_iter, opt_embed)
2086 DO i_iter = 1, opt_dmfet%n_iter
2088 opt_dmfet%i_iter = i_iter
[all …]
H A Doptimize_embedding_potential.F1180 IF (opt_embed%i_iter .EQ. 1) THEN ! Else it is kept in memory
1604 IF (opt_embed%i_iter .GT. 2) &
1623 IF (opt_embed%i_iter > 1) THEN
2301 actual_ener_change = opt_embed%w_func(opt_embed%i_iter) - &
2399 DO i_iter = 1, max_iter
2761 INTEGER, INTENT(IN) :: i_iter local
2785 IF (i_iter .LE. 1) THEN
3138 INTEGER :: i_iter local
3162 WRITE (filename, '(a5,I3.3,a1,I1.1)') "DIFF_", i_iter
3293 WRITE (filename, '(a10,I3.3)') "embed_pot_", i_iter
[all …]
/dports/multimedia/vlc/vlc-3.0.16/modules/video_filter/
H A Dblendbench.c255 for( int i_iter = 0; i_iter < p_sys->i_loops; ++i_iter ) in Filter() local
/dports/misc/vxl/vxl-3.3.2/core/vgui/
H A Dvgui_tview_tableau.cxx270 for (std::vector<icon>::const_iterator i_iter = icons.begin(); i_iter != icons.end(); ++i_iter) in find_closest_icon() local
272 icon i = *i_iter; in find_closest_icon()
/dports/net/storj/storj-1.45.3/vendor/github.com/apache/thrift/lib/c_glib/test/
H A Dtestthrifttestclient.cpp247 map<UserId, map<Numberz::type,Insanity> >::const_iterator i_iter; in testInsanity() local
248 for (i_iter = insane.begin(); i_iter != insane.end(); ++i_iter) { in testInsanity()
249 cout << i_iter->first << " => {"; in testInsanity()
251 for (i2_iter = i_iter->second.begin(); in testInsanity()
252 i2_iter != i_iter->second.end(); in testInsanity()
/dports/www/fabio/fabio-1.5.14/vendor/github.com/apache/thrift/thrift-da1169d75b15/lib/c_glib/test/
H A Dtestthrifttestclient.cpp247 map<UserId, map<Numberz::type,Insanity> >::const_iterator i_iter; in testInsanity() local
248 for (i_iter = insane.begin(); i_iter != insane.end(); ++i_iter) { in testInsanity()
249 cout << i_iter->first << " => {"; in testInsanity()
251 for (i2_iter = i_iter->second.begin(); in testInsanity()
252 i2_iter != i_iter->second.end(); in testInsanity()
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/thrift/lib/c_glib/test/
H A Dtestthrifttestclient.cpp247 map<UserId, map<Numberz::type,Insanity> >::const_iterator i_iter; in testInsanity() local
248 for (i_iter = insane.begin(); i_iter != insane.end(); ++i_iter) { in testInsanity()
249 cout << i_iter->first << " => {"; in testInsanity()
251 for (i2_iter = i_iter->second.begin(); in testInsanity()
252 i2_iter != i_iter->second.end(); in testInsanity()
/dports/devel/thrift-c_glib/thrift-0.14.0/lib/c_glib/test/
H A Dtestthrifttestclient.cpp247 map<UserId, map<Numberz::type,Insanity> >::const_iterator i_iter; in testInsanity() local
248 for (i_iter = insane.begin(); i_iter != insane.end(); ++i_iter) { in testInsanity()
249 cout << i_iter->first << " => {"; in testInsanity()
251 for (i2_iter = i_iter->second.begin(); in testInsanity()
252 i2_iter != i_iter->second.end(); in testInsanity()
/dports/devel/thrift-cpp/thrift-0.14.0/lib/c_glib/test/
H A Dtestthrifttestclient.cpp247 map<UserId, map<Numberz::type,Insanity> >::const_iterator i_iter; in testInsanity() local
248 for (i_iter = insane.begin(); i_iter != insane.end(); ++i_iter) { in testInsanity()
249 cout << i_iter->first << " => {"; in testInsanity()
251 for (i2_iter = i_iter->second.begin(); in testInsanity()
252 i2_iter != i_iter->second.end(); in testInsanity()

1234