| /external/openscreen/third_party/abseil/src/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
|
| /external/libtextclassifier/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
|
| /external/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
|
| /external/webrtc/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
|
| /external/rust/crates/grpcio-sys/grpc/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
|
| /external/angle/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
|
| /external/guava/android/guava-tests/test/com/google/common/graph/ |
| D | EndpointPairTest.java | 186 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView() local
210 Set<EndpointPair<Integer>> edges = undirectedGraph.edges(); in endpointPair_undirected_contains() local
229 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_directed_contains() local
|
| D | AbstractStandardDirectedNetworkTest.java | 53 Set<String> edges = network.edgesConnecting(node, adjacentNode); in validateSourceAndTarget() local
81 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
509 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
624 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| D | AbstractStandardUndirectedNetworkTest.java | 73 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
404 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
515 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| /external/guava/guava-tests/test/com/google/common/graph/ |
| D | EndpointPairTest.java | 186 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView() local
210 Set<EndpointPair<Integer>> edges = undirectedGraph.edges(); in endpointPair_undirected_contains() local
229 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_directed_contains() local
|
| D | AbstractStandardDirectedNetworkTest.java | 54 Set<String> edges = network.edgesConnecting(node, adjacentNode); in validateSourceAndTarget() local
82 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
521 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
636 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| D | AbstractStandardUndirectedNetworkTest.java | 74 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
419 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
530 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| /external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 44 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
69 static void PrintEdges(Edges *edges) { in PrintEdges()
93 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure()
124 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure()
147 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges()
184 static int RandomEdge(std::mt19937 *rnd, Edges *edges) { in RandomEdge()
190 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
201 Edges edges; // from, to in TEST() local
|
| /external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| D | S2EdgeIndexTest.java | 36 private List<S2Edge> edges; field in S2EdgeIndexTest.EdgeVectorIndex
38 public EdgeVectorIndex(List<S2Edge> edges) { in EdgeVectorIndex()
78 double edgeLengthMetersMax, double capSpanMeters, int numEdges, List<S2Edge> edges) { in generateRandomEarthEdges()
|
| /external/skqp/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 117 SkScalar edges[3 * kMaxEdges]; in Make() local
180 GrConvexPolyEffect::GrConvexPolyEffect(GrClipEdgeType edgeType, int n, const SkScalar edges[]) in GrConvexPolyEffect()
219 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
|
| D | GrConvexPolyEffect.h | 42 const SkScalar edges[]) { in Make()
|
| /external/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 113 SkScalar edges[3 * kMaxEdges]; in Make() local
174 const SkScalar edges[]) in GrConvexPolyEffect()
218 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
|
| D | GrConvexPolyEffect.h | 40 GrClipEdgeType edgeType, int n, const SkScalar edges[]) { in Make()
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 63 public Set<EndpointPair<N>> edges() { in asGraph() method in AbstractNetwork
|
| D | AbstractBaseGraph.java | 66 public Set<EndpointPair<N>> edges() { in edges() method in AbstractBaseGraph
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 64 public Set<EndpointPair<N>> edges() { in asGraph() method in AbstractNetwork
|
| D | AbstractBaseGraph.java | 66 public Set<EndpointPair<N>> edges() { in edges() method in AbstractBaseGraph
|
| /external/bcc/tools/ |
| D | deadlock_detector.py | 76 def edges(self): member in DiGraph
285 def print_cycle(binary, graph, edges, thread_info, print_stack_trace_fn): argument
|
| /external/mesa3d/src/util/ |
| D | dag.h | 45 struct util_dynarray edges; member
|
| /external/freetype/src/autofit/ |
| D | afhints.c | 108 AF_Edge edges; in af_axis_hints_new_edge() local
292 AF_Edge edges = axis->edges; in af_get_edge_index() local
306 AF_Edge edges = axis->edges; in af_get_strong_edge_index() local
445 AF_Edge edges = axis->edges; in af_glyph_hints_dump_segments() local
583 AF_Edge edges = axis->edges; in af_glyph_hints_dump_edges() local
1300 AF_Edge edges = axis->edges; in af_glyph_hints_align_strong_points() local
|