Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 794) sorted by relevance

12345678910>>...32

/third_party/boost/libs/graph/test/
Ddominator_tree_test.cpp21 vector< edge > edges; member
39 testSet[0].edges.push_back(edge(0, 1)); in main()
40 testSet[0].edges.push_back(edge(0, 2)); in main()
41 testSet[0].edges.push_back(edge(0, 3)); in main()
42 testSet[0].edges.push_back(edge(1, 4)); in main()
43 testSet[0].edges.push_back(edge(2, 1)); in main()
44 testSet[0].edges.push_back(edge(2, 4)); in main()
45 testSet[0].edges.push_back(edge(2, 5)); in main()
46 testSet[0].edges.push_back(edge(3, 6)); in main()
47 testSet[0].edges.push_back(edge(3, 7)); in main()
[all …]
Dstoer_wagner_test.cpp60 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 0, 4 }, { 1, 4 }, in BOOST_AUTO_TEST_CASE() local
63 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE()
96 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 1, 2 }, { 2, 0 } }; in BOOST_AUTO_TEST_CASE() local
98 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE()
120 edge_t edges[] = { { 5, 2 }, { 0, 6 }, { 5, 6 }, { 3, 1 }, { 0, 1 }, in BOOST_AUTO_TEST_CASE() local
123 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE()
143 edge_t edges[] = { { 3, 4 }, { 3, 6 }, { 3, 5 }, { 0, 4 }, { 0, 1 }, in BOOST_AUTO_TEST_CASE() local
147 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE()
173 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 0, 4 }, { 1, 4 }, in BOOST_AUTO_TEST_CASE() local
176 undirected_unweighted_graph g(edges, edges + 14, 8); in BOOST_AUTO_TEST_CASE()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() argument
54 for (const auto &edge : *edges) { in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges() argument
68 ABSL_RAW_LOG(INFO, "EDGES (%zu)", edges->size()); in PrintEdges()
69 for (const auto &edge : *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure() argument
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure() argument
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
[all …]
/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() argument
54 for (const auto &edge : *edges) { in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges() argument
68 ABSL_RAW_LOG(INFO, "EDGES (%zu)", edges->size()); in PrintEdges()
69 for (const auto &edge : *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure() argument
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure() argument
122 bool reachable = IsReachable(edges, a, b, &seen); in CheckTransitiveClosure()
[all …]
/third_party/boost/libs/graph/example/
Dquick_tour.expected2 edges(g) = (0,1) (0,2) (0,3) (0,4) (2,0) (2,4) (3,0) (3,1) (3,4) (4,0) (4,1)
4 out-edges: (0,1) (0,2) (0,3) (0,4)
5 in-edges: (2,0) (3,0) (4,0)
8 out-edges:
9 in-edges: (0,1) (3,1) (4,1)
12 out-edges: (2,0) (2,4)
13 in-edges: (0,2)
16 out-edges: (3,0) (3,1) (3,4)
17 in-edges: (0,3)
20 out-edges: (4,0) (4,1)
[all …]
Dvertex_basics.expected3 out-edges: (0,1) (0,2) (0,3) (0,4)
4 in-edges: (2,0) (3,0) (4,0)
8 out-edges:
9 in-edges: (0,1) (3,1) (4,1)
13 out-edges: (2,0) (2,4)
14 in-edges: (0,2)
18 out-edges: (3,0) (3,1) (3,4)
19 in-edges: (0,3)
23 out-edges: (4,0) (4,1)
24 in-edges: (0,4) (2,4) (3,4)
Dedge_coloring.cpp44 Pair edges[14] = { Pair(0, 3), // a-d in main() local
61 for (size_t i = 0; i < sizeof(edges) / sizeof(edges[0]); i++) in main()
62 add_edge(edges[i].first, edges[i].second, G); in main()
67 for (size_t i = 0; i < sizeof(edges) / sizeof(edges[0]); i++) in main()
69 cout << " " << (char)('a' + edges[i].first) << "-" in main()
70 << (char)('a' + edges[i].second) << ": " in main()
71 << G[edge(edges[i].first, edges[i].second, G).first] << endl; in main()
Dvisitor.cpp74 E edges[] = { E(0, 2), E(1, 1), E(1, 3), E(2, 1), E(2, 3), E(3, 1), E(3, 4), in main() local
78 for (std::size_t j = 0; j < sizeof(edges) / sizeof(E); ++j) in main()
79 add_edge(edges[j].first, edges[j].second, G); in main()
81 Graph G(edges, edges + sizeof(edges) / sizeof(E), 5); in main()
Dprim-example.cpp21 E edges[] in main() local
27 for (std::size_t j = 0; j < sizeof(edges) / sizeof(E); ++j) in main()
31 boost::tie(e, inserted) = add_edge(edges[j].first, edges[j].second, g); in main()
35 Graph g(edges, edges + sizeof(edges) / sizeof(E), weights, num_nodes); in main()
/third_party/boost/boost/graph/detail/
Dadj_list_edge_iterator.hpp54 , edges(x.edges) in adj_list_edge_iterator()
69 edges = out_edges(*vCurr, *m_g); in adj_list_edge_iterator()
79 ++edges BOOST_GRAPH_MEMBER first; in operator ++()
80 if (edges BOOST_GRAPH_MEMBER first in operator ++()
81 == edges BOOST_GRAPH_MEMBER second) in operator ++()
87 edges = out_edges(*vCurr, *m_g); in operator ++()
99 return *edges BOOST_GRAPH_MEMBER first; in operator *()
105 || edges BOOST_GRAPH_MEMBER first in operator ==()
106 == x.edges BOOST_GRAPH_MEMBER first); in operator ==()
112 && edges BOOST_GRAPH_MEMBER first in operator !=()
[all …]
/third_party/boost/libs/yap/example/autodiff_library/
DEdgeSet.cpp21 edges.clear(); in ~EdgeSet()
26 list<Edge>::iterator it = edges.begin(); in containsEdge()
27 for(;it!= edges.end();it++){ in containsEdge()
39 edges.push_front(e); in insertEdge()
44 edges.clear(); in clear()
48 return edges.size(); in size()
53 list<Edge>::iterator it = edges.begin(); in numSelfEdges()
54 for(;it!=edges.end();it++) in numSelfEdges()
68 list<Edge>::iterator it = edges.begin(); in toString()
69 for(;it!=edges.end();it++) in toString()
/third_party/typescript/tests/baselines/reference/
DsourceMapValidationDestructuringParameterObjectBindingPatternDefaultValues.types78 foo1({ name: "Edger", skill: "cutting edges" });
79 >foo1({ name: "Edger", skill: "cutting edges" }) : void
81 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
85 >"cutting edges" : "cutting edges"
92 foo2({ name: "Edger", skill: "cutting edges" });
93 >foo2({ name: "Edger", skill: "cutting edges" }) : void
95 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
99 >"cutting edges" : "cutting edges"
106 foo3({ name: "Edger", skill: "cutting edges" });
107 >foo3({ name: "Edger", skill: "cutting edges" }) : void
[all …]
DsourceMapValidationDestructuringParameterObjectBindingPattern.types71 foo1({ name: "Edger", skill: "cutting edges" });
72 >foo1({ name: "Edger", skill: "cutting edges" }) : void
74 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
78 >"cutting edges" : "cutting edges"
85 foo2({ name: "Edger", skill: "cutting edges" });
86 >foo2({ name: "Edger", skill: "cutting edges" }) : void
88 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
92 >"cutting edges" : "cutting edges"
99 foo3({ name: "Edger", skill: "cutting edges" });
100 >foo3({ name: "Edger", skill: "cutting edges" }) : void
[all …]
DsourceMapValidationDestructuringVariableStatementArrayBindingPattern.types42 let [numberC2] = [3, "edging", "Trimming edges"];
44 >[3, "edging", "Trimming edges"] : [number, string, string]
47 >"Trimming edges" : "Trimming edges"
49 let [numberC, nameC, skillC] = [3, "edging", "Trimming edges"];
53 >[3, "edging", "Trimming edges"] : [number, string, string]
56 >"Trimming edges" : "Trimming edges"
DsourceMapValidationDestructuringVariableStatement1.types50 var c: string, { name: nameC, skill: skillC } = { name: "Edger", skill: "cutting edges" };
56 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
60 >"cutting edges" : "cutting edges"
78 var { name: nameC, skill: skillC } = { name: "Edger", skill: "cutting edges" }, c = hello;
83 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
87 >"cutting edges" : "cutting edges"
111 var c = hello, { name: nameC, skill: skillC } = { name: "Edger", skill: "cutting edges" }, c1 = hel…
118 >{ name: "Edger", skill: "cutting edges" } : { name: string; skill: string; }
122 >"cutting edges" : "cutting edges"
DsourceMapValidationDestructuringVariableStatementArrayBindingPatternDefaultValues.types48 let [numberC2 = -1] = [3, "edging", "Trimming edges"];
52 >[3, "edging", "Trimming edges"] : [number, string, string]
55 >"Trimming edges" : "Trimming edges"
57 let [numberC = -1, nameC = "noName", skillC = "noSkill"] = [3, "edging", "Trimming edges"];
65 >[3, "edging", "Trimming edges"] : [number, string, string]
68 >"Trimming edges" : "Trimming edges"
/third_party/node/deps/npm/node_modules/node-gyp/gyp/tools/
Dgraphviz.py29 edges = json.load(file)
39 target_edges[src] = edges[src]
40 to_visit.extend(edges[src])
45 def WriteGraph(edges): argument
51 for src, dst in edges.items():
81 for src, dsts in edges.items():
95 edges = LoadEdges('dump.json', sys.argv[1:])
97 WriteGraph(edges)
/third_party/node/tools/gyp/tools/
Dgraphviz.py29 edges = json.load(file)
39 target_edges[src] = edges[src]
40 to_visit.extend(edges[src])
45 def WriteGraph(edges): argument
51 for src, dst in edges.items():
82 for src, dsts in edges.items():
96 edges = LoadEdges("dump.json", sys.argv[1:])
98 WriteGraph(edges)
/third_party/skia/src/gpu/effects/
DGrConvexPolyEffect.cpp40 SkScalar edges[3 * kMaxEdges]; in Make() local
63 edges[3 * n] = v.fY; in Make()
64 edges[3 * n + 1] = -v.fX; in Make()
66 edges[3 * n] = -v.fY; in Make()
67 edges[3 * n + 1] = v.fX; in Make()
69 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY); in Make()
83 return GrConvexPolyEffect::Make(std::move(inputFP), type, n, edges); in Make()
148 const float edges[]) in GrConvexPolyEffect() argument
156 std::copy_n(edges, 3*n, fEdges.begin()); in GrConvexPolyEffect()
192 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
[all …]
/third_party/flutter/skia/src/gpu/effects/
DGrConvexPolyEffect.cpp118 SkScalar edges[3 * kMaxEdges]; in Make() local
142 edges[3 * n] = v.fY; in Make()
143 edges[3 * n + 1] = -v.fX; in Make()
145 edges[3 * n] = -v.fY; in Make()
146 edges[3 * n + 1] = v.fX; in Make()
148 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY); in Make()
161 return Make(type, n, edges); in Make()
183 GrConvexPolyEffect::GrConvexPolyEffect(GrClipEdgeType edgeType, int n, const SkScalar edges[]) in GrConvexPolyEffect() argument
189 memcpy(fEdges, edges, 3 * n * sizeof(SkScalar)); in GrConvexPolyEffect()
222 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
[all …]
/third_party/flutter/skia/src/gpu/ops/
DGrQuadPerEdgeAA.cpp306 const Edges& edges) { in get_exact_coverage() argument
320 bool topleftInside = all((edges.fA * left + edges.fB * top + edges.fC) >= 0.f); in get_exact_coverage()
321 bool botleftInside = all((edges.fA * left + edges.fB * bot + edges.fC) >= 0.f); in get_exact_coverage()
322 bool botrightInside = all((edges.fA * right + edges.fB * bot + edges.fC) >= 0.f); in get_exact_coverage()
323 bool toprightInside = all((edges.fA * right + edges.fB * top + edges.fC) >= 0.f); in get_exact_coverage()
336 V4f leftCross = -(edges.fC + edges.fA * left) / edges.fB; in get_exact_coverage()
337 V4f rightCross = -(edges.fC + edges.fA * right) / edges.fB; in get_exact_coverage()
338 V4f topCross = -(edges.fC + edges.fB * top) / edges.fA; in get_exact_coverage()
339 V4f botCross = -(edges.fC + edges.fB * bot) / edges.fA; in get_exact_coverage()
412 int i = edges.fFlipped ? kFlippedCCW[j] : kCCW[j]; in get_exact_coverage()
[all …]
/third_party/flutter/skia/third_party/externals/freetype/src/autofit/
Dafhints.c108 AF_Edge edges; in af_axis_hints_new_edge() local
113 if ( !axis->edges ) in af_axis_hints_new_edge()
115 axis->edges = axis->embedded.edges; in af_axis_hints_new_edge()
136 if ( axis->edges == axis->embedded.edges ) in af_axis_hints_new_edge()
138 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in af_axis_hints_new_edge()
140 ft_memcpy( axis->edges, axis->embedded.edges, in af_axis_hints_new_edge()
141 sizeof ( axis->embedded.edges ) ); in af_axis_hints_new_edge()
145 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
152 edges = axis->edges; in af_axis_hints_new_edge()
153 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
[all …]
/third_party/freetype/src/autofit/
Dafhints.c108 AF_Edge edges; in af_axis_hints_new_edge() local
113 if ( !axis->edges ) in af_axis_hints_new_edge()
115 axis->edges = axis->embedded.edges; in af_axis_hints_new_edge()
136 if ( axis->edges == axis->embedded.edges ) in af_axis_hints_new_edge()
138 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in af_axis_hints_new_edge()
140 ft_memcpy( axis->edges, axis->embedded.edges, in af_axis_hints_new_edge()
141 sizeof ( axis->embedded.edges ) ); in af_axis_hints_new_edge()
145 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
152 edges = axis->edges; in af_axis_hints_new_edge()
153 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
[all …]
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/kernels/image/lite_cv/
Dcanny.cc130 static void NonMaximumSuppression(const LiteMat &gx, const LiteMat &gy, LiteMat &edges, bool L2grad… in NonMaximumSuppression() argument
131 edges.Init(gx.width_, gx.height_, gx.channel_, gx.data_type_); in NonMaximumSuppression()
135 float *edges_ptr = edges; in NonMaximumSuppression()
190 static void Hysteresis(const LiteMat &edges, uint8_t *dst, double low_thresh, double high_thresh) { in Hysteresis() argument
191 const float *edges_ptr = edges; in Hysteresis()
193 int size = edges.height_ * edges.width_; in Hysteresis()
196 int buffer_step = edges.width_; in Hysteresis()
197 for (int y = 0; y < edges.height_; y++) { in Hysteresis()
198 for (int x = 0; x < edges.width_; x++) { in Hysteresis()
199 int pos = y * edges.width_ + x; in Hysteresis()
[all …]
/third_party/skia/third_party/externals/freetype/src/autofit/
Dafhints.c206 AF_Edge edges; in af_axis_hints_new_edge() local
211 if ( !axis->edges ) in af_axis_hints_new_edge()
213 axis->edges = axis->embedded.edges; in af_axis_hints_new_edge()
234 if ( axis->edges == axis->embedded.edges ) in af_axis_hints_new_edge()
236 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in af_axis_hints_new_edge()
238 ft_memcpy( axis->edges, axis->embedded.edges, in af_axis_hints_new_edge()
239 sizeof ( axis->embedded.edges ) ); in af_axis_hints_new_edge()
243 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
250 edges = axis->edges; in af_axis_hints_new_edge()
251 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
[all …]

12345678910>>...32