| /dports/graphics/embree/embree-3.13.2/kernels/subdiv/ |
| H A D | gridrange.h | 13 unsigned int u_end; member
19 …__forceinline GridRange(unsigned int u_start, unsigned int u_end, unsigned int v_start, unsigned i… in GridRange()
20 : u_start(u_start), u_end(u_end), v_start(v_start), v_end(v_end) {} in GridRange()
23 return u_end-u_start+1; in width()
32 const unsigned int u_size = u_end-u_start+1; in hasLeafSize()
50 const unsigned int u_size = u_end-u_start+1; in split()
57 const unsigned int u_mid = split(u_start,u_end); in split()
58 r0.u_end = u_mid; in split()
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 136 vertex_iterator u_iter, u_end; in push_relabel() local
144 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
149 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
185 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
214 for (tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
437 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
443 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
450 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
562 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
576 for (tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/math/mpir/mpir-3.0.0/mpz/ |
| H A D | scan1.c | 36 mp_srcptr u_end = u_ptr + abs_size; in mpz_scan1() local
59 if (p == u_end) in mpz_scan1()
70 ASSERT (p < u_end); in mpz_scan1()
98 ASSERT (p < u_end); in mpz_scan1()
124 if (p == u_end) in mpz_scan1()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 154 vertex_iterator u_iter, u_end; in push_relabel() local
162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update()
497 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
505 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
514 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
667 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
689 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 154 vertex_iterator u_iter, u_end; in push_relabel() local
162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update()
497 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
505 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
514 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
667 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
689 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 154 vertex_iterator u_iter, u_end; in push_relabel() local
162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update()
497 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
505 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
514 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
667 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
689 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 154 vertex_iterator u_iter, u_end; in push_relabel() local
162 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
170 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
217 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in push_relabel()
250 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in global_distance_update()
497 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
505 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
514 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in convert_preflow_to_flow()
667 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
689 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; in is_flow()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | push_relabel_max_flow.hpp | 141 vertex_iterator u_iter, u_end; in push_relabel() local
149 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in push_relabel()
154 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
192 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in push_relabel()
221 for (boost::tie(u_iter,u_end) = vertices(g); u_iter != u_end; ++u_iter) { in global_distance_update()
444 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) in convert_preflow_to_flow()
450 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
457 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in convert_preflow_to_flow()
570 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
584 for (boost::tie(u_iter, u_end) = vertices(g); u_iter != u_end; ++u_iter) { in is_flow()
[all …]
|
| /dports/math/gmp/gmp-6.2.1/mpz/ |
| H A D | scan0.c | 46 mp_srcptr u_end = u_ptr + abs_size; in mpz_scan0() local
69 if (p == u_end) in mpz_scan0()
110 if (p == u_end) in mpz_scan0()
121 ASSERT (p < u_end); in mpz_scan0()
|
| H A D | scan1.c | 46 mp_srcptr u_end = u_ptr + abs_size - 1; in mpz_scan1() local
72 if (p == u_end) in mpz_scan1()
80 ASSERT (p != u_end); in mpz_scan1()
110 if (p == u_end) in mpz_scan1()
|
| /dports/math/gap/gap-4.11.0/extern/gmp/mpz/ |
| H A D | scan0.c | 47 mp_srcptr u_end = u_ptr + abs_size; in mpz_scan0() local
70 if (p == u_end) in mpz_scan0()
111 if (p == u_end) in mpz_scan0()
122 ASSERT (p < u_end); in mpz_scan0()
|
| H A D | scan1.c | 47 mp_srcptr u_end = u_ptr + abs_size - 1; in mpz_scan1() local
73 if (p == u_end) in mpz_scan1()
81 ASSERT (p != u_end); in mpz_scan1()
111 if (p == u_end) in mpz_scan1()
|
| /dports/math/mingw32-libgmp/gmp-6.0.0/mpz/ |
| H A D | scan0.c | 47 mp_srcptr u_end = u_ptr + abs_size; in mpz_scan0() local
70 if (p == u_end) in mpz_scan0()
111 if (p == u_end) in mpz_scan0()
122 ASSERT (p < u_end); in mpz_scan0()
|