| /third_party/boost/boost/graph/ |
| D | max_cardinality_matching.hpp | 43 const Graph& g, MateMap mate, VertexIndexMap vm) in matching_size() argument
56 if (get(mate, v) != graph_traits< Graph >::null_vertex() in matching_size()
57 && get(vm, v) < get(vm, get(mate, v))) in matching_size()
65 const Graph& g, MateMap mate) in matching_size() argument
67 return matching_size(g, mate, get(vertex_index, g)); in matching_size()
71 bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap) in is_a_matching() argument
81 if (get(mate, v) != graph_traits< Graph >::null_vertex() in is_a_matching()
82 && v != get(mate, get(mate, v))) in is_a_matching()
89 inline bool is_a_matching(const Graph& g, MateMap mate) in is_a_matching() argument
91 return is_a_matching(g, mate, get(vertex_index, g)); in is_a_matching()
[all …]
|
| D | maximum_weighted_matching.hpp | 23 matching_weight_sum(const Graph& g, MateMap mate, VertexIndexMap vm) in matching_weight_sum() argument
37 if (get(mate, v) != graph_traits< Graph >::null_vertex() in matching_weight_sum()
38 && get(vm, v) < get(vm, get(mate, v))) in matching_weight_sum()
39 weight_sum += get(edge_weight, g, edge(v, mate[v], g).first); in matching_weight_sum()
47 matching_weight_sum(const Graph& g, MateMap mate) in matching_weight_sum() argument
49 return matching_weight_sum(g, mate, get(vertex_index, g)); in matching_weight_sum()
193 mate(mate_vector.begin(), vm) in weighted_augmenting_path_finder()
221 mate[u] = get(arg_mate, u); in weighted_augmenting_path_finder()
297 if (target(*oei, g) != *vi && mate[*vi] != target(*oei, g)) in bloom()
316 vertex_descriptor_t v_mate = mate[v]; in put_T_label()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | matching_example.cpp | 65 std::vector< graph_traits< my_graph >::vertex_descriptor > mate(n_vertices); in main() local
73 bool success = checked_edmonds_maximum_cardinality_matching(g, &mate[0]); in main()
83 << "Found a matching of size " << matching_size(g, &mate[0]) in main()
90 if (mate[*vi] != graph_traits< my_graph >::null_vertex() in main()
91 && *vi < mate[*vi]) in main()
92 std::cout << "{" << *vi << ", " << mate[*vi] << "}" << std::endl; in main()
104 success = checked_edmonds_maximum_cardinality_matching(g, &mate[0]); in main()
114 << "Found a matching of size " << matching_size(g, &mate[0]) in main()
120 if (mate[*vi] != graph_traits< my_graph >::null_vertex() in main()
121 && *vi < mate[*vi]) in main()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | random_matching_test.cpp | 75 mate_t mate(n); in main() local
77 = checked_edmonds_maximum_cardinality_matching(g, mate); in main()
93 if (mate[*vi] != graph_traits< undirected_graph >::null_vertex() in main()
94 && *vi < mate[*vi]) in main()
95 std::cout << "{" << *vi << "," << mate[*vi] << "}, "; in main()
102 if (mate[*vi] != graph_traits< undirected_graph >::null_vertex()) in main()
105 mate[mate[*vi]] = graph_traits< undirected_graph >::null_vertex(); in main()
106 mate[*vi] = graph_traits< undirected_graph >::null_vertex(); in main()
112 vertex_index_map_t >::verify_matching(g, mate, in main()
124 if (matching_size(g, mate) > matching_size(g, greedy_mate) in main()
|
| D | weighted_matching_test.cpp | 77 mate_t mate(num_vertices(g)); in weighted_matching_test() local
78 maximum_weighted_matching(g, mate); in weighted_matching_test()
79 bool same_result = (matching_weight_sum(g, mate) == answer); in weighted_matching_test()
88 << matching_weight_sum(g, mate) << std::endl in weighted_matching_test()
101 if (mate[*vi] != graph_traits< Graph >::null_vertex() in weighted_matching_test()
102 && *vi < mate[*vi]) in weighted_matching_test()
103 std::cout << "{" << *vi << ", " << mate[*vi] << "}" in weighted_matching_test()
|
| /third_party/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1680 bool matesWith(const SkClosestRecord& mate SkDEBUGPARAMS(SkIntersections* i)) const { in matesWith()
1681 SkOPOBJASSERT(i, fC1Span == mate.fC1Span || fC1Span->endT() <= mate.fC1Span->startT() in matesWith()
1682 || mate.fC1Span->endT() <= fC1Span->startT()); in matesWith()
1683 SkOPOBJASSERT(i, fC2Span == mate.fC2Span || fC2Span->endT() <= mate.fC2Span->startT() in matesWith()
1684 || mate.fC2Span->endT() <= fC2Span->startT()); in matesWith()
1685 return fC1Span == mate.fC1Span || fC1Span->endT() == mate.fC1Span->startT() in matesWith()
1686 || fC1Span->startT() == mate.fC1Span->endT() in matesWith()
1687 || fC2Span == mate.fC2Span in matesWith()
1688 || fC2Span->endT() == mate.fC2Span->startT() in matesWith()
1689 || fC2Span->startT() == mate.fC2Span->endT(); in matesWith()
[all …]
|
| /third_party/flutter/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1679 bool matesWith(const SkClosestRecord& mate SkDEBUGPARAMS(SkIntersections* i)) const { in matesWith()
1680 SkOPOBJASSERT(i, fC1Span == mate.fC1Span || fC1Span->endT() <= mate.fC1Span->startT() in matesWith()
1681 || mate.fC1Span->endT() <= fC1Span->startT()); in matesWith()
1682 SkOPOBJASSERT(i, fC2Span == mate.fC2Span || fC2Span->endT() <= mate.fC2Span->startT() in matesWith()
1683 || mate.fC2Span->endT() <= fC2Span->startT()); in matesWith()
1684 return fC1Span == mate.fC1Span || fC1Span->endT() == mate.fC1Span->startT() in matesWith()
1685 || fC1Span->startT() == mate.fC1Span->endT() in matesWith()
1686 || fC2Span == mate.fC2Span in matesWith()
1687 || fC2Span->endT() == mate.fC2Span->startT() in matesWith()
1688 || fC2Span->startT() == mate.fC2Span->endT(); in matesWith()
[all …]
|
| /third_party/alsa-utils/po/ |
| D | sk.po | 958 "Podozrivá pozícia vyrovnávacej pämate (celkom %li): dostupné = %li, "
1094 msgstr " aconnect [-možnosti] odosielateľ prijímateľ\n"
1099 msgstr " odosielateľ, prijímateľ = pár klient:port\n"
|
| /third_party/icu/icu4j/perf-tests/data/collation/ |
| D | vfear11a.txt | 3929 "Hullo, mate!" said he. "You seem heeled and ready."
4026 "All right, mate, no offense meant. The boys will think none
4045 McGinty wants it. So long, mate! Maybe we'll meet in lodge
4116 "By Gar, mate! you know how to speak to the cops," he said
5154 but that evening, had his mate Scanlan not been at hand to lead
6421 mate, as the four sat together at supper.
7592 mate, and lived for five years as a Sussex county gentleman, a life
|
| D | ulyss10.txt | 26711 --See here, he said, showing Antonio. There he is cursing the mate. And
26992 --Let me cross your bows mate, he said to his neighbour who was just
|
| /third_party/littlefs/ |
| D | DESIGN.md | 143 offspring that happens when you mate a block based filesystem with a logging
|
| /third_party/skia/third_party/externals/brotli/tests/testdata/ |
| D | plrabn12.txt | 262 Thus Satan, talking to his nearest mate,
308 Of unblest feet. Him followed his next mate;
3514 Know ye not me? ye knew me once no mate
5940 Bank the mid sea: part single, or with mate,
6761 Thy mate, who sees when thou art seen least wise.
6777 Among the beasts no mate for thee was found.
8918 He never shall find out fit mate, but such
|
| /third_party/mindspore/tests/ut/data/mindrecord/testAclImdbData/ |
| D | vocab.txt | 6776 mate
8586 ##mate
|
| /third_party/libexif/po/ |
| D | nl.po | 2538 msgstr "Geeft de GPS-DOP (Degree Of Precision, mate van nauwkeurigheid). Een HDOP-waarde wordt wegg…
|
| /third_party/icu/icu4j/main/shared/data/ |
| D | Transliterator_Han_Latin_Definition.txt | 17099 㘩 < to\-mate;
20922 姤 < mate;
48902 㘩 > to\-mate;
54631 姤 > mate;
|
| D | Transliterator_Han_Latin_EDICT.txt | 44343 鮲 < mate\ ;
104948 鮲 > mate\ ;
|
| /third_party/eudev/hwdb/ |
| D | 20-OUI.hwdb | 18792 ID_OUI_FROM_DATABASE=Zhongshan General K-mate Electronics Co., Ltd
29625 ID_OUI_FROM_DATABASE=i-mate Development, Inc.
|
| D | 20-pci-vendor-model.hwdb | 45822 …ID_MODEL_FROM_DATABASE=ISL3874 [Prism 2.5]/ISL3872 [Prism 3] (AIR.mate PC-400 PCI Wireless LAN Ada…
|