| /external/truth/core/src/test/java/com/google/common/truth/ |
| D | GraphMatchingTest.java | 136 ListMultimap<String, String> edges = LinkedListMultimap.create(); in maximumCardinalityBipartiteMatching_failsWithNullLhs() local
147 ListMultimap<String, String> edges = LinkedListMultimap.create(); in maximumCardinalityBipartiteMatching_failsWithNullRhs() local
170 ImmutableListMultimap.Builder<String, String> edges = ImmutableListMultimap.builder(); in fullyConnected() local
187 ImmutableListMultimap.Builder<String, String> edges = ImmutableListMultimap.builder(); in fromBits() local
198 private final ImmutableListMultimap<String, String> edges; field in GraphMatchingTest.TestInstance
201 private TestInstance(ImmutableListMultimap<String, String> edges) { in TestInstance() argument
|
| /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 | 51 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
68 static void PrintEdges(Edges *edges) { in PrintEdges()
90 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
116 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()
175 static int RandomEdge(RandomEngine* rng, Edges *edges) { in RandomEdge()
181 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
193 Edges edges; // from, to in TEST() local
|
| /external/cronet/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/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/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/tensorflow/third_party/absl/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/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/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/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/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/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 40 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
65 static void PrintEdges(Edges *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure()
120 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure()
143 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges()
180 static int RandomEdge(std::mt19937 *rnd, Edges *edges) { in RandomEdge()
186 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
197 Edges edges; // from, to in TEST() local
|
| /external/skia/src/gpu/ganesh/effects/ |
| D | GrConvexPolyEffect.cpp | 42 SkScalar edges[3 * kMaxEdges]; in Make() local
152 const float edges[]) in GrConvexPolyEffect()
196 SkScalar edges[kMaxEdges * 3]; in GR_DEFINE_FRAGMENT_PROCESSOR_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/cronet/base/substring_set_matcher/ |
| D | substring_set_matcher.h | 182 const AhoCorasickEdge* edges() const { in edges() function
281 RAW_PTR_EXCLUSION AhoCorasickEdge* edges; member
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 65 public Set<EndpointPair<N>> edges() { in asGraph() method in AbstractNetwork
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 64 public Set<EndpointPair<N>> edges() { in asGraph() method in AbstractNetwork
|
| /external/bcc/tools/ |
| D | deadlock.py | 76 def edges(self): member in DiGraph
285 def print_cycle(binary, graph, edges, thread_info, print_stack_trace_fn): argument
|
| /external/deqp-deps/SPIRV-Tools/test/opt/ |
| D | control_dependence.cpp | 177 std::vector<ControlDependence> edges; in TEST() local
278 std::vector<ControlDependence> edges; in TEST() local
|
| /external/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
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/test/opt/ |
| D | control_dependence.cpp | 177 std::vector<ControlDependence> edges; in TEST() local
278 std::vector<ControlDependence> edges; in TEST() local
|