Home
last modified time | relevance | path

Searched defs:edges (Results 1 – 25 of 230) sorted by relevance

12345678910

/external/truth/core/src/test/java/com/google/common/truth/
DGraphMatchingTest.java136 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/cronet/tot/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc52 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
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc52 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
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc50 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/cronet/stable/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc52 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
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc53 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
70 static void PrintEdges(Edges *edges) { in PrintEdges()
92 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
118 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
138 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
177 static int RandomEdge(RandomEngine* rng, Edges *edges) { in RandomEdge()
183 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
195 Edges edges; // from, to in TEST() local
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles_test.cc50 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/
DEndpointPairTest.java182 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
DAbstractStandardDirectedNetworkTest.java55 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
DAbstractStandardUndirectedNetworkTest.java72 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
400 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
507 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
/external/rust/android-crates-io/crates/petgraph/src/
Dquickcheck.rs45 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
/external/guava/android/guava-tests/test/com/google/common/graph/
DEndpointPairTest.java182 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
DAbstractStandardDirectedNetworkTest.java54 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
DAbstractStandardUndirectedNetworkTest.java71 Set<String> edges = network.edges(); in edges_checkReturnedSetMutability() local
387 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingEdgeBetweenSameNodes() local
494 ImmutableSet<String> edges = ImmutableSet.copyOf(network.edges()); in addEdge_existingSelfLoopEdgeBetweenSameNodes() local
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles_test.cc40 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/s2-geometry-library-java/tests/com/google/common/geometry/
DS2EdgeIndexTest.java36 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/skia/src/gpu/ganesh/effects/
DGrConvexPolyEffect.cpp58 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
/external/libdav1d/src/ppc/
Dcdef_tmpl.c50 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()
/external/cronet/tot/third_party/rust/chromium_crates_io/vendor/skrifa-0.24.1/src/outline/autohint/latin/
Dhint.rs39 let edges = axis.edges.as_mut_slice(); in hint_edges() localVariable
65 let edges = axis.edges.as_mut_slice(); in align_edges_to_blues() localVariable
135 let edges = axis.edges.as_mut_slice(); in align_stem_edges() localVariable
331 let edges = &mut axis.edges; in align_remaining_edges() localVariable
370 let edges = &mut axis.edges; in align_remaining_edges() localVariable
392 let edges = axis.edges.as_mut_slice(); in align_remaining_edges() localVariable
669 let edges = axis.edges.as_mut_slice(); in align_linked_edge() localVariable
690 let edges = axis.edges.as_mut_slice(); in align_serif_edge() localVariable
/external/cronet/stable/third_party/rust/chromium_crates_io/vendor/skrifa-0.24.1/src/outline/autohint/latin/
Dhint.rs39 let edges = axis.edges.as_mut_slice(); in hint_edges() localVariable
65 let edges = axis.edges.as_mut_slice(); in align_edges_to_blues() localVariable
135 let edges = axis.edges.as_mut_slice(); in align_stem_edges() localVariable
331 let edges = &mut axis.edges; in align_remaining_edges() localVariable
370 let edges = &mut axis.edges; in align_remaining_edges() localVariable
392 let edges = axis.edges.as_mut_slice(); in align_remaining_edges() localVariable
669 let edges = axis.edges.as_mut_slice(); in align_linked_edge() localVariable
690 let edges = axis.edges.as_mut_slice(); in align_serif_edge() localVariable
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/stable_graph/
Dserialization.rs31 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
/external/zxing/core/src/main/java/com/google/zxing/common/
DMinimalECIInput.java232 static void addEdge(InputEdge[][] edges, int to, InputEdge edge) { in addEdge()
241 InputEdge[][] edges, in addEdges()
267 InputEdge[][] edges = new InputEdge[inputLength + 1][encoderSet.length()]; in encodeMinimally() local
/external/cronet/stable/base/substring_set_matcher/
Dsubstring_set_matcher.h187 const AhoCorasickEdge* edges() const { in edges() function
286 RAW_PTR_EXCLUSION AhoCorasickEdge* edges; member
/external/cronet/tot/base/substring_set_matcher/
Dsubstring_set_matcher.h187 const AhoCorasickEdge* edges() const { in edges() function
286 RAW_PTR_EXCLUSION AhoCorasickEdge* edges; member
/external/rust/android-crates-io/crates/tokio/src/runtime/task/trace/
Dtree.rs18 edges: HashMap<Symbol, HashSet<Symbol>>, field
25 let mut edges: HashMap<Symbol, HashSet<Symbol>> = HashMap::default(); in from_trace() localVariable

12345678910