| /dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/testfiles/src/ |
| H A D | util-test.cpp | 22 #define nearest_common_ancestor(a, b, c) \ in TEST() macro
62 ASSERT_EQ(nearest_common_ancestor(iter(node5a), iter(node5b), iter(node0)), iter(node2)); in TEST()
63 ASSERT_EQ(nearest_common_ancestor(iter(node4a), iter(node5b), iter(node0)), iter(node2)); in TEST()
64 ASSERT_EQ(nearest_common_ancestor(iter(node3a), iter(node5b), iter(node0)), iter(node2)); in TEST()
65 ASSERT_EQ(nearest_common_ancestor(iter(node2), iter(node5b), iter(node0)), iter(node2)); in TEST()
66 ASSERT_EQ(nearest_common_ancestor(iter(node1), iter(node5b), iter(node0)), iter(node1)); in TEST()
67 ASSERT_EQ(nearest_common_ancestor(iter(node0), iter(node5b), iter(node0)), iter(node0)); in TEST()
70 ASSERT_EQ(nearest_common_ancestor(iter(node5a), iter(node5b), iter(node0)), iter(node2)); in TEST()
73 ASSERT_EQ(nearest_common_ancestor(iter(node5a), iter(node2), iter(node0)), iter(node2)); in TEST()
74 ASSERT_EQ(nearest_common_ancestor(iter(node5a), iter(node1), iter(node0)), iter(node1)); in TEST()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 463 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, vertex_descriptor_t w, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
819 nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
847 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in augment_matching()
984 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in adjust_dual()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 275 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
290 while (nearest_common_ancestor in augment_matching()
310 nearest_common_ancestor = v_up; in augment_matching()
312 nearest_common_ancestor = w_up; in augment_matching()
316 nearest_common_ancestor = v_up; in augment_matching()
319 if (nearest_common_ancestor in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
328 v_prime, nearest_common_ancestor, std::make_pair(v, w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 527 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
922 || nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
960 vertex_descriptor_t nca = nearest_common_ancestor( in augment_matching()
1117 vertex_descriptor_t nca = nearest_common_ancestor( in adjust_dual()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 275 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
290 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
310 nearest_common_ancestor = v_up; in augment_matching()
312 nearest_common_ancestor = w_up; in augment_matching()
315 nearest_common_ancestor = v_up; in augment_matching()
318 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
323 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
324 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 275 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
290 while (nearest_common_ancestor in augment_matching()
310 nearest_common_ancestor = v_up; in augment_matching()
312 nearest_common_ancestor = w_up; in augment_matching()
316 nearest_common_ancestor = v_up; in augment_matching()
319 if (nearest_common_ancestor in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
328 v_prime, nearest_common_ancestor, std::make_pair(v, w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 527 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
922 || nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
960 vertex_descriptor_t nca = nearest_common_ancestor( in augment_matching()
1117 vertex_descriptor_t nca = nearest_common_ancestor( in adjust_dual()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 275 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
290 while (nearest_common_ancestor in augment_matching()
310 nearest_common_ancestor = v_up; in augment_matching()
312 nearest_common_ancestor = w_up; in augment_matching()
316 nearest_common_ancestor = v_up; in augment_matching()
319 if (nearest_common_ancestor in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
328 v_prime, nearest_common_ancestor, std::make_pair(v, w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 527 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
922 || nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
960 vertex_descriptor_t nca = nearest_common_ancestor( in augment_matching()
1117 vertex_descriptor_t nca = nearest_common_ancestor( in adjust_dual()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 463 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, vertex_descriptor_t w, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
819 nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
847 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in augment_matching()
984 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in adjust_dual()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 463 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, vertex_descriptor_t w, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
819 nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
847 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in augment_matching()
984 …vertex_descriptor_t nca = nearest_common_ancestor(v_prime, w_prime, v_free_ancestor, w_free_ancest… in adjust_dual()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() &&
320 nearest_common_ancestor = v_up;
322 nearest_common_ancestor = w_up;
325 nearest_common_ancestor = v_up;
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex())
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v));
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w));
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 285 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
300 while (nearest_common_ancestor == graph_traits<Graph>::null_vertex() && in augment_matching()
320 nearest_common_ancestor = v_up; in augment_matching()
322 nearest_common_ancestor = w_up; in augment_matching()
325 nearest_common_ancestor = v_up; in augment_matching()
328 if (nearest_common_ancestor == graph_traits<Graph>::null_vertex()) in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
334 link_and_set_bridges(v_prime, nearest_common_ancestor, std::make_pair(v,w)); in augment_matching()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 275 vertex_descriptor_t nearest_common_ancestor in augment_matching() local
290 while (nearest_common_ancestor in augment_matching()
310 nearest_common_ancestor = v_up; in augment_matching()
312 nearest_common_ancestor = w_up; in augment_matching()
316 nearest_common_ancestor = v_up; in augment_matching()
319 if (nearest_common_ancestor in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
328 v_prime, nearest_common_ancestor, std::make_pair(v, w)); in augment_matching()
|
| H A D | maximum_weighted_matching.hpp | 527 vertex_descriptor_t nearest_common_ancestor(vertex_descriptor_t v, in nearest_common_ancestor() function in boost::weighted_augmenting_path_finder
922 || nearest_common_ancestor(v_prime, label_T[w_prime], in augment_matching()
960 vertex_descriptor_t nca = nearest_common_ancestor( in augment_matching()
1117 vertex_descriptor_t nca = nearest_common_ancestor( in adjust_dual()
|