Home
last modified time | relevance | path

Searched refs:ui_end (Results 1 – 25 of 389) sorted by relevance

12345678910>>...16

/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dbfs.cpp123 typename Traits::vertex_iterator ui, ui_end; in go() local
139 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
171 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
179 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dbfs.cpp135 typename Traits::vertex_iterator ui, ui_end; in go() local
153 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
187 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
198 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in go()
/dports/biology/lamarc/lamarc-2.1.8/boost/graph/
H A Dgraph_utility.hpp153 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
154 for (tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
167 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
168 for (tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
180 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
181 for (tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
376 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
377 for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
H A Dsloan_ordering.hpp158 typename graph_traits<Graph>::vertex_iterator ui, ui_end; in sloan_start_end_vertices() local
159 for (tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in sloan_start_end_vertices()
200 for (tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in sloan_start_end_vertices()
311 typename graph_traits<Graph>::vertex_iterator ui, ui_end;
312 for (tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui)
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/
H A Dsloan_ordering.hpp141 typename graph_traits<Graph>::vertex_iterator ui, ui_end; in sloan_start_end_vertices() local
142 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in sloan_start_end_vertices()
183 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in sloan_start_end_vertices()
294 typename graph_traits<Graph>::vertex_iterator ui, ui_end;
295 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui)
H A Dgraph_utility.hpp159 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
160 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
173 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
174 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
186 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
187 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
382 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
383 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
152 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
165 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
166 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
178 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
179 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
350 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
351 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_in_edges() local
152 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_in_edges()
166 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
167 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
180 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
181 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
348 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end, vi, in is_connected() local
350 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_in_edges() local
152 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_in_edges()
166 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
167 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
180 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
181 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
348 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end, vi, in is_connected() local
350 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dgraph_utility.hpp159 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
160 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
173 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
174 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
186 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
187 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
358 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
359 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_in_edges() local
152 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_in_edges()
166 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
167 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
180 typename graph_traits< IncidenceGraph >::vertex_iterator ui, ui_end; in print_graph_dispatch() local
181 for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui) in print_graph_dispatch()
348 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end, vi, in is_connected() local
350 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/
H A Dgraph_utility.hpp159 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
160 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
173 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
174 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
186 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
187 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
358 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
359 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dgraph_utility.hpp159 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
160 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
173 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
174 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
186 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
187 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
358 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
359 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
152 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
165 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
166 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
178 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
179 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
350 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
351 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/databases/percona57-client/boost_1_59_0/boost/graph/
H A Dgraph_utility.hpp159 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
160 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
173 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
174 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
186 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
187 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
358 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
359 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
152 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
165 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
166 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
178 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
179 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
350 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
351 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
152 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
165 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
166 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
178 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
179 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
350 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
351 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dgraph_utility.hpp151 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_in_edges() local
152 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_in_edges()
165 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
166 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
178 typename graph_traits<IncidenceGraph>::vertex_iterator ui,ui_end; in print_graph_dispatch() local
179 for (boost::tie(ui,ui_end) = vertices(G); ui != ui_end; ++ui) { in print_graph_dispatch()
350 ui, ui_end, vi, vi_end, ci, ci_end; in is_connected() local
351 for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui) in is_connected()

12345678910>>...16