| /aosp_15_r20/external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| H A 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
|
| /aosp_15_r20/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| H A 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
|
| /aosp_15_r20/external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| H A D | graphcycles_test.cc | 52 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
69 static void PrintEdges(Edges *edges) { in PrintEdges()
91 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
117 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
137 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
|
| /aosp_15_r20/external/abseil-cpp/absl/synchronization/internal/ |
| H A D | graphcycles_test.cc | 52 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
69 static void PrintEdges(Edges *edges) { in PrintEdges()
91 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
117 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
137 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
|
| /aosp_15_r20/external/rust/android-crates-io/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
|
| /aosp_15_r20/external/cronet/third_party/abseil-cpp/absl/synchronization/internal/ |
| H A 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
|
| /aosp_15_r20/external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/synchronization/internal/ |
| H A 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
|
| /aosp_15_r20/external/truth/core/src/test/java/com/google/common/truth/ |
| H A 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
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| H A 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
|
| /aosp_15_r20/external/libdav1d/src/ppc/ |
| H A D | cdef_tmpl.c | 50 const enum CdefEdgeFlags edges) in copy4xN()
120 const enum CdefEdgeFlags edges) in copy8xN()
366 const enum CdefEdgeFlags edges, uint16_t *tmp) in filter_4xN()
422 const int pri_shift, const enum CdefEdgeFlags edges, in filter_4xN_pri()
450 const int sec_shift, const enum CdefEdgeFlags edges, in filter_4xN_sec()
484 const int pri_shift, const int sec_shift, const enum CdefEdgeFlags edges, in filter_8xN()
543 const int pri_shift, const enum CdefEdgeFlags edges, in filter_8xN_pri()
571 const int sec_shift, const enum CdefEdgeFlags edges, in filter_8xN_sec()
|
| /aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/graph/ |
| H A D | AbstractStandardDirectedNetworkTest.java | 54 Set<String> edges = network.edgesConnecting(node, adjacentNode); in validateSourceAndTarget() local
78 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
474 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
576 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| H A D | EndpointPairTest.java | 182 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView() local
203 Set<EndpointPair<Integer>> edges = undirectedGraph.edges(); in endpointPair_undirected_contains() local
222 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_directed_contains() local
|
| /aosp_15_r20/external/guava/guava-tests/test/com/google/common/graph/ |
| H A D | AbstractStandardDirectedNetworkTest.java | 55 Set<String> edges = network.edgesConnecting(node, adjacentNode); in validateSourceAndTarget() local
79 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
487 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
589 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
|
| H A D | EndpointPairTest.java | 182 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_unmodifiableView() local
203 Set<EndpointPair<Integer>> edges = undirectedGraph.edges(); in endpointPair_undirected_contains() local
222 Set<EndpointPair<Integer>> edges = directedGraph.edges(); in endpointPair_directed_contains() local
|
| /aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/graph_impl/stable_graph/ |
| D | serialization.rs | 31 edges: &'a [Edge<Option<E>, Ix>], field
48 edges: Vec<Edge<Option<E>, Ix>>, field
164 let edges = &self.raw_edges()[..self.edge_bound()]; in into_serializable() localVariable
202 let edges = input.edges; in from_deserialized() localVariable
|
| /aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/strings/internal/ |
| H A D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/webrtc/third_party/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/cronet/third_party/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/angle/third_party/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree_test.cc | 178 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
192 std::vector<CordRep*> edges; in GetLeafEdges() local
446 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
460 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P() local
489 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
520 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
550 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
581 std::vector<CordRep*> edges = GetLeafEdges(result); in TEST_P() local
722 absl::Span<CordRep* const> edges = tree->Edges(); in RefEdgesAt() local
799 std::vector<CordRep*> edges = CordCollectRepsIf(is_flat, rep); in TEST_P() local
|
| /aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/ |
| D | quickcheck.rs | 45 let edges = ((nodes as f64).powi(2) * edge_prob) as usize; in arbitrary() localVariable
113 let edges = ((nodes as f64).powi(2) * edge_prob) as usize; in arbitrary() localVariable
196 let edges = ((nodes.len() as f64).powi(2) * edge_prob) as usize; in arbitrary() localVariable
|
| /aosp_15_r20/external/freetype/src/autofit/ |
| H A D | afhints.c | 206 AF_Edge edges; in af_axis_hints_new_edge() local
391 AF_Edge edges = axis->edges; in af_get_edge_index() local
405 AF_Edge edges = axis->edges; in af_get_strong_edge_index() local
548 AF_Edge edges = axis->edges; in af_glyph_hints_dump_segments() local
689 AF_Edge edges = axis->edges; in af_glyph_hints_dump_edges() local
1405 AF_Edge edges = axis->edges; in af_glyph_hints_align_strong_points() local
|
| /aosp_15_r20/external/s2-geometry-library-java/tests/com/google/common/geometry/ |
| H A 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()
|
| /aosp_15_r20/external/skia/src/gpu/ganesh/effects/ |
| H A D | GrConvexPolyEffect.cpp | 58 SkScalar edges[3 * kMaxEdges]; in Make() local
168 const float edges[]) in GrConvexPolyEffect()
212 SkScalar edges[kMaxEdges * 3]; in GR_DEFINE_FRAGMENT_PROCESSOR_TEST() local
|