Home
last modified time | relevance | path

Searched refs:edges (Results 1 - 25 of 124) sorted by relevance

12345

/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable() argument
54 for (const auto &edge : *edges) { in IsReachable()
59 IsReachable(edges, edge.to, to, seen)) { in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges() argument
68 ABSL_RAW_LOG(INFO, "EDGES (%zu)", edges->size()); in PrintEdges()
69 for (const auto &edge : *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure() argument
94 if (IsReachable(edges, a, b, &seen)) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure() argument
122 bool reachable = IsReachable(edges, in CheckTransitiveClosure()
136 CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc) CheckEdges() argument
176 RandomEdge(RandomEngine* rng, Edges *edges) RandomEdge() argument
182 EdgeIndex(Edges *edges, int from, int to) EdgeIndex() argument
194 Edges edges; // from, to TEST() local
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DEdge.java33 * Value type for edges in NFA graphs of phone number regular expressions. Outside this package,
37 * <p>Note that the ordering of edges is carefully designed to attempt to replicate as much of the
42 /** API for visiting composite edges; see also {@link #accept(Visitor)}. */
47 * Visits a composited sequence of edges. Note that sequences only ever contain disjunctions or
48 * simple edges, but never other sequences. For edges "a", "b", "c", this represents the
51 void visitSequence(List<Edge> edges); in visitSequence() argument
53 * Visits a disjunction of parallel edges. Note that disjunctions only ever contain sequences
54 * or simple edges, but never other disjunctions. For edges "
57 visitGroup(Set<Edge> edges, boolean isOptional) visitGroup() argument
110 disjunction(Collection<Edge> edges) disjunction() argument
218 private final ImmutableList<Edge> edges; global() field in Edge.Concatenation
220 Concatenation(Collection<Edge> edges) Concatenation() argument
255 private final ImmutableSortedSet<Edge> edges; global() field in Edge.Disjunction
258 Disjunction(Collection<Edge> edges, boolean isOptional) Disjunction() argument
[all...]
H A DEdgeWriter.java76 // simple edges when they are inside other composite edges. Optionality is encoded into the in visit()
91 public void visitSequence(List<Edge> edges) { in visitSequence() argument
92 checkArgument(!edges.isEmpty(), "sequences must have at least one edge"); in visitSequence()
94 // At this level a sequence might be a mix of normal and "any" edges (e.g. "123xxxx"). To in visitSequence()
98 for (Edge e : edges) { in visitSequence()
110 // composite that contains other "any" edges). in visitSequence()
120 public void visitGroup(Set<Edge> edges, boolean isOptional) { in visitGroup() argument
121 checkArgument(!edges.isEmpty(), "groups must have at least one edge"); in visitGroup()
130 if (edges in visitGroup()
185 visitSequence(List<Edge> edges) visitSequence() argument
201 visitGroup(Set<Edge> edges, boolean isOptional) visitGroup() argument
[all...]
/third_party/skia/src/gpu/effects/
H A DGrConvexPolyEffect.cpp40 SkScalar edges[3 * kMaxEdges]; in Make() local
63 edges[3 * n] = v.fY; in Make()
64 edges[3 * n + 1] = -v.fX; in Make()
66 edges[3 * n] = -v.fY; in Make()
67 edges[3 * n + 1] = v.fX; in Make()
69 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY); in Make()
83 return GrConvexPolyEffect::Make(std::move(inputFP), type, n, edges); in Make()
155 const float edges[]) in GrConvexPolyEffect()
152 GrConvexPolyEffect(std::unique_ptr<GrFragmentProcessor> inputFP, GrClipEdgeType edgeType, int n, const float edges[]) GrConvexPolyEffect() argument
199 SkScalar edges[kMaxEdges * 3]; TestCreate() local
[all...]
/third_party/node/tools/gyp/tools/
H A Dgraphviz.py24 """Load the edges map from the dump file, and filter it to only
28 edges = json.load(file)
31 # Copy out only the edges we're interested in from the full edge list.
38 target_edges[src] = edges[src]
39 to_visit.extend(edges[src])
44 def WriteGraph(edges):
46 |edges| is a map of target to a list of other targets it depends on."""
50 for src, dst in edges.items():
59 # its file grouping before writing out any edges that may refer
80 # the edges betwee
[all...]
/third_party/skia/third_party/externals/freetype/src/autofit/
H A Dafhints.c206 AF_Edge edges; in FT_LOCAL() local
211 if ( !axis->edges ) in FT_LOCAL()
213 axis->edges = axis->embedded.edges; in FT_LOCAL()
234 if ( axis->edges == axis->embedded.edges ) in FT_LOCAL()
236 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in FT_LOCAL()
238 ft_memcpy( axis->edges, axis->embedded.edges, in FT_LOCAL()
239 sizeof ( axis->embedded.edges ) ); in FT_LOCAL()
390 AF_Edge edges = axis->edges; af_get_edge_index() local
404 AF_Edge edges = axis->edges; af_get_strong_edge_index() local
543 AF_Edge edges = axis->edges; af_glyph_hints_dump_segments() local
681 AF_Edge edges = axis->edges; af_glyph_hints_dump_edges() local
1395 AF_Edge edges = axis->edges; af_glyph_hints_align_strong_points() local
[all...]
H A Daflatin.c2120 /* Link segments to edges, using feature analysis for selection. */
2180 * We begin by generating a sorted table of edges for the current in FT_LOCAL_DEF()
2189 * Note that the table of edges is sorted along the segment/edge in FT_LOCAL_DEF()
2216 /* A special case for serif edges: If they are smaller than */ in FT_LOCAL_DEF()
2225 AF_Edge edge = axis->edges + ee; in FT_LOCAL_DEF()
2276 /* without a direction: if possible, link them to existing edges */ in FT_LOCAL_DEF()
2289 AF_Edge edge = axis->edges + ee; in FT_LOCAL_DEF()
2335 AF_Edge edges = axis->edges; in FT_LOCAL_DEF() local
2336 AF_Edge edge_limit = FT_OFFSET( edges, axi in FT_LOCAL_DEF()
2995 AF_Edge edges = axis->edges; af_latin_hint_edges() local
[all...]
H A Dafcjk.c1022 * We begin by generating a sorted table of edges for the current in af_cjk_hints_compute_edges()
1031 * Note that the edges table is sorted along the segment/edge in af_cjk_hints_compute_edges()
1053 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges()
1155 AF_Edge edges = axis->edges; in af_cjk_hints_compute_edges() local
1156 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hints_compute_edges()
1160 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1173 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1265 /* Detect segments and edges for given dimension. */
1285 /* Compute all edges whic
1800 AF_Edge edges = axis->edges; af_cjk_hint_edges() local
2179 AF_Edge edges = axis->edges; af_cjk_align_edge_points() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/opt/
H A Dcontrol_dependence.cpp90 // CFG: (all edges pointing downward) in TEST()
177 std::vector<ControlDependence> edges; in TEST() local
178 GatherEdges(cdg, edges); in TEST()
179 EXPECT_THAT(edges, in TEST()
191 for (uint32_t i = 0; i < edges.size(); i++) { in TEST()
192 EXPECT_EQ(expected_condition_ids[i], edges[i].GetConditionID(cfg)); in TEST()
237 // CFG: (edges pointing downward if no arrow) in TEST()
278 std::vector<ControlDependence> edges; in TEST() local
279 GatherEdges(cdg, edges); in TEST()
281 edges, testin in TEST()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/
H A Dcontrol_dependence.cpp90 // CFG: (all edges pointing downward) in TEST()
177 std::vector<ControlDependence> edges; in TEST() local
178 GatherEdges(cdg, edges); in TEST()
179 EXPECT_THAT(edges, in TEST()
191 for (uint32_t i = 0; i < edges.size(); i++) { in TEST()
192 EXPECT_EQ(expected_condition_ids[i], edges[i].GetConditionID(cfg)); in TEST()
237 // CFG: (edges pointing downward if no arrow) in TEST()
278 std::vector<ControlDependence> edges; in TEST() local
279 GatherEdges(cdg, edges); in TEST()
281 edges, testin in TEST()
[all...]
/third_party/spirv-tools/test/opt/
H A Dcontrol_dependence.cpp90 // CFG: (all edges pointing downward) in TEST()
177 std::vector<ControlDependence> edges; in TEST() local
178 GatherEdges(cdg, edges); in TEST()
179 EXPECT_THAT(edges, in TEST()
191 for (uint32_t i = 0; i < edges.size(); i++) { in TEST()
192 EXPECT_EQ(expected_condition_ids[i], edges[i].GetConditionID(cfg)); in TEST()
237 // CFG: (edges pointing downward if no arrow) in TEST()
278 std::vector<ControlDependence> edges; in TEST() local
279 GatherEdges(cdg, edges); in TEST()
281 edges, testin in TEST()
[all...]
/third_party/mesa3d/src/util/
H A Ddag.c38 util_dynarray_append(&parent->edges, struct dag_edge, edge); in append_edge()
46 * list may contain multiple edges to the same child with different data.
51 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge()
71 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge_max_data()
84 * need to be careful when iterating the edges of remaining nodes for NULL
113 util_dynarray_foreach(&node->edges, struct dag_edge, edge) { in dag_prune_head()
125 util_dynarray_init(&node->edges, dag); in dag_init_node()
149 while (node->edges.size != 0) { in dag_traverse_bottom_up_node()
156 util_dynarray_foreach_reverse(&node->edges, struct dag_edge, edge) { in dag_traverse_bottom_up_node()
/third_party/python/Tools/c-analyzer/c_parser/parser/
H A D_regexes.py9 def _ind(text, level=1, edges='both'):
12 if edges == 'pre' or edges == 'both':
14 if edges == 'post' or edges == 'both':
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTree.java61 /** Accepts the given visitor on this node, visiting its immediate outgoing (child) edges. */
68 /** Returns the list of edges leading out from this node.*/
80 * Simple API for representing edges in the DFA during visitation. See also {@link DfaVisitor}
92 * Visitor API for traversing edges in {@code RangeTrees}. When a node accepts a visitor, it
93 * visits only the immediate outgoing edges of that node. If recursive visitation is required, it
96 * <p>Graph nodes and edges obey {@code Object} equality and this can be used by visitor
114 * when they are reached (this is the same as in DFAs). Unlike DFAs however, the out-edges of a
118 * opposed to 5 separate edges, each marked with a single digit.
129 * The list of edges, ordered by the lowest bit in each mask. The masks for each edge must be
130 * mutually disjoint. Only the terminal node is permitted to have zero outbound edges
132 private final ImmutableList<Edge> edges; global() field in RangeTree.Node
170 Node(ImmutableList<Edge> edges, boolean canTerminate) Node() argument
[all...]
/third_party/skia/samplecode/
H A DSamplePathClip.cpp69 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) {
70 SkPoint* edgesStart = edges;
105 *edges++ = p0;
106 *edges++ = p1;
111 *edges++ = p0;
112 *edges++ = p1;
118 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
119 *edges++ = SkPoint::Make(bounds.left(), y);
124 *edges++ = p0;
125 *edges
[all...]
/third_party/node/tools/gyp/pylib/gyp/generator/
H A Ddump_dependency_json.py80 edges = {}
87 if target in edges:
89 edges[target] = []
92 edges[target].append(dep)
101 json.dump(edges, f)
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/generator/
H A Ddump_dependency_json.py80 edges = {}
87 if target in edges:
89 edges[target] = []
92 edges[target].append(dep)
101 json.dump(edges, f)
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DEdgeTest.java54 // Unlike AnyPath, simple edges are not sequences, so don't need parens for optional. in testAny()
71 public void visitSequence(List<Edge> edges) { in testConcatenation()
72 assertThat(edges).containsExactly(Edge.fromMask(0x3), Edge.any()).inOrder(); in testConcatenation()
85 public void visitGroup(Set<Edge> edges, boolean isOptional) { in testGroup()
86 assertThat(edges).containsExactly(Edge.any(), Edge.fromMask(0x3)).inOrder(); in testGroup()
101 public void visitGroup(Set<Edge> edges, boolean isOptional) { in testOptionalGroup()
103 assertThat(edges).containsExactly(Edge.any(), Edge.fromMask(0x3)).inOrder(); in testOptionalGroup()
119 // because of the way composite edges are created. However it seems sensible to test the in testOrdering()
137 // "[01]" < "[01]x" - single edges are "smaller" than sequences of edges i in testOrdering()
188 visitSequence(List<Edge> edges) visitSequence() argument
193 visitGroup(Set<Edge> edges, boolean isOptional) visitGroup() argument
219 or(Edge... edges) or() argument
[all...]
/third_party/node/deps/openssl/openssl/providers/implementations/ciphers/
H A Dcipher_aes_cbc_hmac_sha1_hw.c128 HASH_DESC hash_d[8], edges[8]; in tls1_multi_block_encrypt() local
213 edges[i].ptr = blocks[i].c; in tls1_multi_block_encrypt()
214 edges[i].blocks = 1; in tls1_multi_block_encrypt()
218 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
231 edges[i].ptr = hash_d[i].ptr; in tls1_multi_block_encrypt()
232 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
236 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
240 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_multi_block_encrypt()
242 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
273 edges[ in tls1_multi_block_encrypt()
[all...]
/third_party/openssl/providers/implementations/ciphers/
H A Dcipher_aes_cbc_hmac_sha1_hw.c128 HASH_DESC hash_d[8], edges[8]; in tls1_multi_block_encrypt() local
213 edges[i].ptr = blocks[i].c; in tls1_multi_block_encrypt()
214 edges[i].blocks = 1; in tls1_multi_block_encrypt()
218 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
231 edges[i].ptr = hash_d[i].ptr; in tls1_multi_block_encrypt()
232 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
236 sha1_multi_block(mctx, edges, n4x); in tls1_multi_block_encrypt()
240 edges[i].ptr = hash_d[i].ptr += MAXCHUNKSIZE; in tls1_multi_block_encrypt()
242 edges[i].blocks = MAXCHUNKSIZE / 64; in tls1_multi_block_encrypt()
273 edges[ in tls1_multi_block_encrypt()
[all...]
/third_party/skia/third_party/externals/freetype/src/sdf/
H A Dftsdf.c58 * Each contour comprises of several edges, with three types of edges.
288 * Start position of an edge. Valid for all types of edges.
291 * Etart position of an edge. Valid for all types of edges.
329 * Represent a complete contour, which contains a list of edges.
334 * edges. Useful while decomposing the outline with
337 * edges ::
338 * Linked list of all the edges that make the contour.
348 SDF_Edge* edges; member
551 /* Also free the list of edges
556 SDF_Edge* edges; sdf_contour_done() local
1224 SDF_Edge* edges = contours->edges; split_sdf_shape() local
3261 SDF_Edge* edges = contours->edges; sdf_generate_bounding_box() local
[all...]
/third_party/vk-gl-cts/external/vulkan-docs/src/config/chunkindex/
H A Dlunr.js1372 this.edges = {}
1454 if (char in frame.node.edges) {
1455 noEditNode = frame.node.edges[char]
1458 frame.node.edges[char] = noEditNode
1477 if ("*" in frame.node.edges) {
1478 var insertionNode = frame.node.edges["*"]
1481 frame.node.edges["*"] = insertionNode
1515 if ("*" in frame.node.edges) {
1516 var substitutionNode = frame.node.edges["*"]
1519 frame.node.edges["*"]
[all...]
/third_party/node/deps/v8/src/d8/
H A Dcov.cc24 unsigned char edges[]; member
67 printf("[COV] edge counters initialized. Shared memory: %s with %u edges\n", in __sanitizer_cov_trace_pc_guard_init()
75 if (shmem->edges[i / 8] & (1 << (i % 8))) { in sanitizer_cov_count_discovered_edges()
89 shmem->edges[index / 8] |= 1 << (index % 8); in __sanitizer_cov_trace_pc_guard()
96 "[COV] Error: Insufficient amount of edges left for builtins " in cov_init_builtins_edges()
103 printf("[COV] Additional %d edges for builtins initialized.\n", num_edges); in cov_init_builtins_edges()
118 shmem->edges[(i + builtins_start) / 8] |= in cov_update_builtins_basic_block_coverage()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dcontrol_dependence.cpp114 ControlDependenceList& edges = reverse_nodes_[label]; in ComputePostDominanceFrontierForNode() local
117 edges.push_back(ControlDependence(pred, label)); in ComputePostDominanceFrontierForNode()
124 edges.push_back(ControlDependence(kPseudoEntryBlock, label)); in ComputePostDominanceFrontierForNode()
132 edges.push_back(ControlDependence(dep.source_bb_id(), label, in ComputePostDominanceFrontierForNode()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dcontrol_dependence.cpp114 ControlDependenceList& edges = reverse_nodes_[label]; in ComputePostDominanceFrontierForNode() local
117 edges.push_back(ControlDependence(pred, label)); in ComputePostDominanceFrontierForNode()
124 edges.push_back(ControlDependence(kPseudoEntryBlock, label)); in ComputePostDominanceFrontierForNode()
132 edges.push_back(ControlDependence(dep.source_bb_id(), label, in ComputePostDominanceFrontierForNode()

Completed in 20 milliseconds

12345