| /third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
176 static int RandomEdge(RandomEngine* rng, Edges *edges) { in RandomEdge()
182 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
194 Edges edges; // from, to in TEST() local
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
176 static int RandomEdge(RandomEngine* rng, Edges *edges) { in RandomEdge()
182 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
194 Edges edges; // from, to in TEST() local
|
| /third_party/boost/libs/mpi/src/ |
| D | graph_communicator.cpp | 51 edges(const graph_communicator& comm) in edges() function
57 shared_array<int> edges(new int[nedges]); in edges() local
|
| /third_party/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 40 SkScalar edges[3 * kMaxEdges]; in Make() local
148 const float edges[]) in GrConvexPolyEffect()
192 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
|
| D | GrConvexPolyEffect.h | 42 const float edges[]) { in Make()
|
| /third_party/boost/libs/graph/test/ |
| D | stoer_wagner_test.cpp | 60 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 0, 4 }, { 1, 4 }, in BOOST_AUTO_TEST_CASE() local
96 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 1, 2 }, { 2, 0 } }; in BOOST_AUTO_TEST_CASE() local
120 edge_t edges[] = { { 5, 2 }, { 0, 6 }, { 5, 6 }, { 3, 1 }, { 0, 1 }, in BOOST_AUTO_TEST_CASE() local
143 edge_t edges[] = { { 3, 4 }, { 3, 6 }, { 3, 5 }, { 0, 4 }, { 0, 1 }, in BOOST_AUTO_TEST_CASE() local
173 edge_t edges[] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 0, 4 }, { 1, 4 }, in BOOST_AUTO_TEST_CASE() local
|
| /third_party/flutter/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 118 SkScalar edges[3 * kMaxEdges]; in Make() local
183 GrConvexPolyEffect::GrConvexPolyEffect(GrClipEdgeType edgeType, int n, const SkScalar edges[]) in GrConvexPolyEffect()
222 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
|
| D | GrConvexPolyEffect.h | 42 const SkScalar edges[]) { in Make()
|
| /third_party/boost/libs/yap/example/autodiff_library/ |
| D | EdgeSet.h | 29 std::list<Edge> edges; variable
|
| /third_party/boost/boost/graph/detail/ |
| D | adj_list_edge_iterator.hpp | 122 std::pair< OutEdgeIterator, OutEdgeIterator > edges; member in boost::detail::adj_list_edge_iterator
124 boost::optional< std::pair< OutEdgeIterator, OutEdgeIterator > > edges; member in boost::detail::adj_list_edge_iterator
|
| /third_party/boost/libs/graph/example/ |
| D | remove_edge_if_dir.cpp | 44 Edge edges[6] = { Edge(0, 3), Edge(0, 2), Edge(0, 3), Edge(1, 3), in main() local
|
| D | edge_coloring.cpp | 44 Pair edges[14] = { Pair(0, 3), // a-d in main() local
|
| D | stoer_wagner.cpp | 38 edge_t edges[] = { { 3, 4 }, { 3, 6 }, { 3, 5 }, { 0, 4 }, { 0, 1 }, in main() local
|
| D | topo_sort.cpp | 46 Pair edges[6] = { Pair(0, 1), Pair(2, 4), Pair(2, 5), Pair(0, 3), in main() local
|
| D | prim-example.cpp | 21 E edges[] in main() local
|
| D | copy-example.cpp | 40 E edges[] = { E(a, c), E(a, d), E(b, a), E(b, d), E(c, f), E(d, c), E(d, e), in main() local
|
| D | bellman-ford-internet.cpp | 32 Edge edges[] = { Edge(A, B), Edge(A, C), Edge(B, D), Edge(B, E), Edge(C, E), in main() local
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/tools/ |
| D | graphviz.py | 45 def WriteGraph(edges): argument
|
| /third_party/node/tools/gyp/tools/ |
| D | graphviz.py | 45 def WriteGraph(edges): argument
|
| /third_party/skia/third_party/externals/spirv-tools/test/opt/ |
| D | control_dependence.cpp | 177 std::vector<ControlDependence> edges; in TEST() local
278 std::vector<ControlDependence> edges; in TEST() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/ |
| D | control_dependence.cpp | 177 std::vector<ControlDependence> edges; in TEST() local
278 std::vector<ControlDependence> edges; in TEST() local
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/kernels/image/lite_cv/ |
| D | canny.cc | 130 static void NonMaximumSuppression(const LiteMat &gx, const LiteMat &gy, LiteMat &edges, bool L2grad… in NonMaximumSuppression()
190 static void Hysteresis(const LiteMat &edges, uint8_t *dst, double low_thresh, double high_thresh) { in Hysteresis()
267 LiteMat edges; in Canny() local
|
| /third_party/mesa3d/src/util/ |
| D | dag.h | 45 struct util_dynarray edges; member
|
| /third_party/boost/boost/msm/mpl_graph/ |
| D | mpl_graph.hpp | 101 struct edges : struct
|
| /third_party/boost/boost/graph/ |
| D | ssca_graph_generator.hpp | 106 int edges; in operator ++() local
139 int edges = num_parallel_edges(*gen); in operator ++() local
|