| /external/chromium_org/third_party/WebKit/Source/core/paint/ |
| BoxDecorationData.cpp | 59 BorderEdge edges[4]; local
60 style.getBorderEdgeInfo(edges);
63 const BorderEdge& currEdge = edges[i];
|
| /external/chromium_org/components/url_matcher/ |
| substring_set_matcher.h | 71 // The Aho Corasick algorithm improves this runtime by using failure edges.
85 typedef std::map<char, uint32> Edges;
97 const Edges& edges() const { return edges_; } function in class:url_matcher::SubstringSetMatcher::AhoCorasickNode
107 // Outgoing edges of current node.
108 Edges edges_;
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
| /external/chromium_org/cc/resources/ |
| task_graph_runner.h | 38 // Dependencies are represented as edges in a task graph. Each graph node is
81 Edge::Vector edges; member in struct:cc::TaskGraph
|
| /external/chromium_org/chrome/browser/ui/views/ |
| chrome_views_delegate.cc | 109 int edges = 0; local
111 edges |= views::ViewsDelegate::EDGE_LEFT;
113 edges |= views::ViewsDelegate::EDGE_TOP;
115 edges |= views::ViewsDelegate::EDGE_RIGHT;
117 edges |= views::ViewsDelegate::EDGE_BOTTOM;
118 return edges;
396 // initial value of 0 (no auto-hide edges) then we'll go fullscreen and
398 // in us thinking there is no auto-hide edges. By returning at least one edge
400 // edges.
422 int edges) {
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 381 // We also verify that at least some of the edges changed because of
384 std::string edges[2]; local
410 edges[i].append(reinterpret_cast<char*>(&bb), sizeof(bb));
445 SANDBOX_ASSERT(edges[0] != edges[1]);
447 SANDBOX_ASSERT(edges[0] == edges[1]);
|
| /external/chromium_org/third_party/skia/src/gpu/effects/ |
| GrConvexPolyEffect.cpp | 135 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
222 "edges",
286 SkScalar edges[3 * kMaxEdges]; local
305 edges[3 * n] = v.fY;
306 edges[3 * n + 1] = -v.fX;
308 edges[3 * n] = -v.fY;
309 edges[3 * n + 1] = v.fX;
312 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[3 * n + 1] * p.fY)
369 SkScalar edges[kMaxEdges * 3]; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvdpstereo.cpp | 108 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
158 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
159 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
162 edges[y*imgW+j] = 0;
167 edges[y*imgW+j] |= 1;
172 edges[y*imgW+j] |= 2
[all...] |
| /external/chromium_org/ui/chromeos/ |
| touch_exploration_controller.cc | 461 int edges = FindEdgesWithinBounds(event.location(), kSlopDistanceFromEdge); local
462 bool in_a_bottom_corner = (edges == BOTTOM_LEFT_CORNER) ||
463 (edges == BOTTOM_RIGHT_CORNER);
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/bison/src/ |
| ielr.c | 125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_counts, always_followsp)
[all...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afhints.c | 88 AF_Edge edges; local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
114 edges = axis->edges;
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
259 AF_Edge edges = axis->edges; local
288 AF_INDEX_NUM( seg->edge, edges ),
363 /* Dump the array of linked edges. *
377 AF_Edge edges = axis->edges; local
917 AF_Edge edges = axis->edges; local
[all...] |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
80 * Edges
83 * edges. An edge corresponds to a single position on the main
87 * The auto-hinter first tries to grid fit edges, then to align
88 * segments on the edges unless it detects that they form a serif.
91 * edges; they are specific to a script.
173 * to be interpolated linearly between their two closest edges, even if
198 * alignment of edges and strong points, thus weak points are processed
299 FT_Fixed scale; /* used to speed up interpolation between edges */
324 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
[all...] |
| afcjk.c | 918 /* We begin by generating a sorted table of edges for the current */
927 /* Note that the edges table is sorted along the segment/edge */
949 AF_Edge edge = axis->edges + ee;
1049 AF_Edge edges = axis->edges; local
1050 AF_Edge edge_limit = edges + axis->num_edges;
1054 for ( edge = edges; edge < edge_limit; edge++ )
1678 AF_Edge edges = axis->edges; local
2022 AF_Edge edges = axis->edges; local
[all...] |
| aflatin.c | 1103 /* Link segments to edges, using feature analysis for selection. */
1260 AF_Edge edges = axis->edges; local
1869 AF_Edge edges = axis->edges; local
[all...] |
| aflatin2.c | 1111 /* We will begin by generating a sorted table of edges for the */
1233 AF_Edge edges = axis->edges; local
1841 AF_Edge edges = axis->edges; local
[all...] |
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| PacketMath.h | 309 Packet16uc MSQ, LSQ, edges; local
314 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
327 Packet16uc MSQ, LSQ, edges; local
332 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 88 AF_Edge edges; local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
114 edges = axis->edges;
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
272 AF_Edge edges = axis->edges; local
301 AF_INDEX_NUM( seg->edge, edges ),
387 /* Dump the array of linked edges. *
402 AF_Edge edges = axis->edges; local
1054 AF_Edge edges = axis->edges; local
[all...] |
| afcjk.c | 935 /* We begin by generating a sorted table of edges for the current */
944 /* Note that the edges table is sorted along the segment/edge */
966 AF_Edge edge = axis->edges + ee;
1067 AF_Edge edges = axis->edges; local
1068 AF_Edge edge_limit = edges + axis->num_edges;
1072 for ( edge = edges; edge < edge_limit; edge++ )
1085 for ( edge = edges; edge < edge_limit; edge++ )
1715 AF_Edge edges = axis->edges; local
2094 AF_Edge edges = axis->edges; local
[all...] |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
84 * Edges
87 * edges.
90 * edges. An edge corresponds to a single position on the main
95 * edges, then to align segments on the edges unless it detects that
182 * to be interpolated linearly between their two closest edges, even if
208 * alignment of edges and strong points, thus weak points are processed
310 FT_Fixed scale; /* used to speed up interpolation between edges */
335 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
[all...] |
| /external/chromium_org/ash/wm/workspace/ |
| workspace_window_resizer.cc | 140 // the edges |edges|. |edges| is a bitmask of the MagnetismEdges.
719 const uint32 edges = WindowComponentToMagneticEdge( local
721 if (UpdateMagnetismWindow(*bounds, edges)) {
732 uint32 edges) {
736 MagnetismMatcher matcher(bounds_in_screen, edges);
739 // around when close to multiple edges.
867 const uint32 edges = WindowComponentToMagneticEdge( local
873 if (edges & MAGNETISM_EDGE_TOP &
[all...] |
| /external/chromium_org/v8/src/ |
| heap-snapshot-generator.h | 161 List<HeapGraphEdge>& edges() { return edges_; } function in class:v8::internal::HeapSnapshot
|
| /external/libpcap/ |
| optimize.c | 125 struct edge **edges; variable in typeref:struct:edge
1353 target = fold_edge(ep->succ, edges[k]);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/heap_snapshot_worker/ |
| JSHeapSnapshot.js | 200 for (var iter = node.edges(); iter.hasNext(); iter.next()) {
226 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
232 for (var iter = gcRoots.edges(); iter.hasNext(); iter.next()) {
234 for (var iter2 = subRoot.edges(); iter2.hasNext(); iter2.next())
238 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next())
263 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
275 for (var iter = detachedDOMTreesRoot.edges(); iter.hasNext(); iter.next()) {
278 for (var edgesIter = node.edges(); edgesIter.hasNext(); edgesIter.next())
306 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
530 var edges = snapshot.containmentEdges variable
[all...] |
