Home
last modified time | relevance | path

Searched refs:w_it (Results 1 – 25 of 54) sorted by relevance

123

/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dhawick_circuits.hpp233 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
234 w_it != w_end; ++w_it) in circuit()
236 Vertex const w = *w_it; in circuit()
261 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
262 w_it != w_end; ++w_it) in circuit()
264 Vertex const w = *w_it; in circuit()
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dhawick_circuits.hpp233 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
234 w_it != w_end; ++w_it) in circuit()
236 Vertex const w = *w_it; in circuit()
261 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
262 w_it != w_end; ++w_it) in circuit()
264 Vertex const w = *w_it; in circuit()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dhawick_circuits.hpp233 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
234 w_it != w_end; ++w_it) in circuit()
236 Vertex const w = *w_it; in circuit()
261 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
262 w_it != w_end; ++w_it) in circuit()
264 Vertex const w = *w_it; in circuit()
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/databases/percona57-client/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dhawick_circuits.hpp233 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
234 w_it != w_end; ++w_it) in circuit()
236 Vertex const w = *w_it; in circuit()
261 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
262 w_it != w_end; ++w_it) in circuit()
264 Vertex const w = *w_it; in circuit()
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/
H A Dhawick_circuits.hpp222 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
223 w_it != w_end; in circuit()
224 ++w_it) in circuit()
226 Vertex const w = *w_it; in circuit()
249 for (AdjacencyIterator w_it = boost::begin(adj_vertices); in circuit() local
250 w_it != w_end; in circuit()
251 ++w_it) in circuit()
253 Vertex const w = *w_it; in circuit()
/dports/graphics/tesseract/tesseract-5.0.0/src/ccmain/
H A Dapplybox.cpp206 WERD_IT w_it(row->word_list()); in SetupApplyBoxes() local
207 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in SetupApplyBoxes()
208 WERD *word = w_it.data(); in SetupApplyBoxes()
210 delete w_it.extract(); in SetupApplyBoxes()
432 WERD_IT w_it(row->word_list()); in ResegmentWordBox() local
433 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in ResegmentWordBox()
434 WERD *word = w_it.data(); in ResegmentWordBox()
479 w_it.add_to_end(new_word); in ResegmentWordBox()
/dports/graphics/tesseract/tesseract-5.0.0/src/ccstruct/
H A Dpageres.cpp1318 for (w_it.forward(); !w_it.at_first() && w_it.data()->part_of_combo; in ComputeWordBounds()
1319 w_it.forward()) { in ComputeWordBounds()
1320 if (w_it.data() == nullptr || w_it.data()->word == nullptr) { in ComputeWordBounds()
1399 WERD_IT w_it(row()->row->word_list()); in ReplaceCurrentWord() local
1401 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in ReplaceCurrentWord()
1402 WERD *word = w_it.data(); in ReplaceCurrentWord()
1408 ASSERT_HOST(!w_it.cycled_list()); in ReplaceCurrentWord()
1481 delete w_it.extract(); in ReplaceCurrentWord()
1497 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in DeleteCurrentWord()
1502 ASSERT_HOST(!w_it.cycled_list()); in DeleteCurrentWord()
[all …]
/dports/games/golly/golly-3.3-src/Rules/TableGenerators/
H A Dmake-ruletable.cpp274 set<state>::const_iterator c_it,n_it,ne_it,e_it,se_it,s_it,sw_it,w_it,nw_it; in all_true() local
284 for(w_it = inputs[7].begin();w_it!=inputs[7].end();w_it++) in all_true()
286 … if(slowcalc(*nw_it,*n_it,*ne_it,*w_it,*c_it,*e_it,*sw_it,*s_it,*se_it)!=ns) in all_true()
295 for(w_it = inputs[4].begin();w_it!=inputs[4].end();w_it++) in all_true()
296 if(slowcalc(0,*n_it,0,*w_it,*c_it,*e_it,0,*s_it,0)!=ns) in all_true()
/dports/math/py-CyLP/CyLP-0.91.4/cylp/cpp/
H A DIClpSimplex.cpp118 PyObject* w_it= PyArray_IterNew(w); in argWeightedMax() local
123 PyArray_ITER_NEXT(w_it); in argWeightedMax()
125 w_val = *(double*)PyArray_ITER_DATA(w_it); in argWeightedMax()
135 PyArray_ITER_NEXT(w_it); in argWeightedMax()
229 PyObject* w_it = PyArray_IterNew(w); in argWeightedMax() local
235 PyArray_ITER_NEXT(w_it); in argWeightedMax()
237 w_val = *(double*)PyArray_ITER_DATA(w_it); in argWeightedMax()
243 PyArray_ITER_NEXT(w_it); in argWeightedMax()
245 w_val = *(double*)PyArray_ITER_DATA(w_it); in argWeightedMax()
258 PyArray_ITER_NEXT(w_it); in argWeightedMax()
[all …]
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/impl/
H A Dmarching_cubes_rbf.hpp99 std::vector<double>::const_iterator w_it (weights.begin()); in voxelizeData() local
101 c_it != centers.end (); ++c_it, ++w_it) in voxelizeData()
102 f += *w_it * kernel (*c_it, point); in voxelizeData()
/dports/graphics/tesseract/tesseract-5.0.0/src/textord/
H A Dtordmain.cpp380 WERD_IT w_it(row->word_list()); in cleanup_nontext_block() local
381 if (w_it.empty()) { in cleanup_nontext_block()
389 w_it.add_after_then_move(word); in cleanup_nontext_block()
392 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in cleanup_nontext_block()
393 WERD *word = w_it.data(); in cleanup_nontext_block()
765 WERD_IT w_it(row->word_list()); in TransferDiacriticsToBlockGroups() local
766 for (w_it.mark_cycle_pt(); !w_it.cycled_list(); w_it.forward()) { in TransferDiacriticsToBlockGroups()
767 WERD *word = w_it.data(); in TransferDiacriticsToBlockGroups()
/dports/graphics/tesseract/tesseract-5.0.0/unittest/
H A Dlayout_test.cc165 const PAGE_RES_IT *w_it = word_it.PageResIt(); in VerifyTotalContainment() local
167 C_BLOB_IT b_it(w_it->word()->word->cblob_list()); in VerifyTotalContainment()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/BulletDynamics/Vehicle/
H A DbtRaycastVehicle.cpp407 for (int w_it=0; w_it<getNumWheels(); w_it++) in updateSuspension() local
409 btWheelInfo &wheel_info = m_wheelInfo[w_it]; in updateSuspension()
/dports/games/critterding/critterding-beta12/src/utils/bullet/BulletDynamics/Vehicle/
H A DbtRaycastVehicle.cpp409 for (int w_it=0; w_it<getNumWheels(); w_it++) in updateSuspension() local
411 btWheelInfo &wheel_info = m_wheelInfo[w_it]; in updateSuspension()

123