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

12345

/external/chromium_org/tools/gyp/tools/
H A Dgraphviz.py23 """Load the edges map from the dump file, and filter it to only
27 edges = json.load(file)
30 # Copy out only the edges we're interested in from the full edge list.
37 target_edges[src] = edges[src]
38 to_visit.extend(edges[src])
43 def WriteGraph(edges):
45 |edges| is a map of target to a list of other targets it depends on."""
49 for src, dst in edges.items():
58 # its file grouping before writing out any edges that may refer
78 # the edges betwee
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java32 /** 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/tools/gyp/pylib/gyp/generator/
H A Ddump_dependency_json.py62 edges = {}
69 if target in edges:
71 edges[target] = []
74 edges[target].append(dep)
79 json.dump(edges, f)
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
H A Ddot.stg33 dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
38 <edges; separator="\n">
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
47 <edges; separator="\n">
/external/chromium_org/ui/keyboard/resources/
H A Dtouch_fuzzing.js373 // All edges of keys.
374 var edges = [];
379 edges.push(min);
380 edges.push(max);
383 edges.sort(function(a, b) {
386 edges = unique(edges);
388 var intervalWeight = zeroes(edges.length);
395 exports.binarySearch(edges, 0, edges
[all...]
/external/chromium_org/third_party/WebKit/Source/core/paint/
H A DBoxDecorationData.cpp59 BorderEdge edges[4]; local
60 style.getBorderEdgeInfo(edges);
63 const BorderEdge& currEdge = edges[i];
H A DBoxPainter.cpp1049 static IntRect calculateSideRect(const RoundedRect& outerBorder, const BorderEdge edges[], int side) argument
1052 int width = edges[side].width;
1119 static inline bool colorsMatchAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1121 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender())
1124 if (!edges[side].sharesColorWith(edges[adjacentSide]))
1127 return !borderStyleHasUnmatchedColorsAtCorner(edges[side].borderStyle(), side, adjacentSide);
1130 static inline bool colorNeedsAntiAliasAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1132 if (!edges[sid
1159 willBeOverdrawn(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1197 joinRequiresMitre(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[], bool allowOverdraw) argument
1214 calculateSideRectIncludingInner(const RoundedRect& outerBorder, const BorderEdge edges[], BoxSide side) argument
1321 clipBorderSideForComplexInnerPath(GraphicsContext* graphicsContext, const RoundedRect& outerBorder, const RoundedRect& innerBorder, BoxSide side, const BorderEdge edges[]) argument
1545 paintTranslucentBorderSides(RenderObject& obj, GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedRect& outerBorder, const RoundedRect& innerBorder, const IntPoint& innerBorderAdjustment, const BorderEdge edges[], BorderEdgeFlags edgesToDraw, BackgroundBleedAvoidance bleedAvoidance, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias) argument
1595 paintOneBorderSide(RenderObject& obj, GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedRect& outerBorder, const RoundedRect& innerBorder, const IntRect& sideRect, BoxSide side, BoxSide adjacentSide1, BoxSide adjacentSide2, const BorderEdge edges[], const Path* path, BackgroundBleedAvoidance bleedAvoidance, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias, const Color* overrideColor) argument
1642 paintBorderSides(RenderObject& obj, GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedRect& outerBorder, const RoundedRect& innerBorder, const IntPoint& innerBorderAdjustment, const BorderEdge edges[], BorderEdgeFlags edgeSet, BackgroundBleedAvoidance bleedAvoidance, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias, const Color* overrideColor) argument
1690 drawBoxSideFromPath(GraphicsContext* graphicsContext, const LayoutRect& borderRect, const Path& borderPath, const BorderEdge edges[], float thickness, float drawThickness, BoxSide side, const RenderStyle* style, Color color, EBorderStyle borderStyle, BackgroundBleedAvoidance bleedAvoidance, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
[all...]
/external/chromium_org/third_party/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h30 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
31 * The edges should form a convex polygon. The positive half-plane is considered to be the
35 * Currently the edges are specified in device space. In the future we may prefer to specify
41 const SkScalar edges[]) {
45 return SkNEW_ARGS(GrConvexPolyEffect, (edgeType, n, edges));
50 * inverse filled, or has too many edges, this will return NULL. If offset is non-NULL, then
57 * Creates an effect that fills inside the rect with AA edges..
78 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]);
40 Create(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
H A DGrConvexPolyEffect.cpp135 // 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[
339 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
369 SkScalar edges[kMaxEdges * 3]; local
[all...]
/external/skia/src/gpu/effects/
H A DGrConvexPolyEffect.h30 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
31 * The edges should form a convex polygon. The positive half-plane is considered to be the
35 * Currently the edges are specified in device space. In the future we may prefer to specify
40 static GrEffectRef* Create(GrEffectEdgeType edgeType, int n, const SkScalar edges[]) { argument
45 (edgeType, n, edges))));
50 * inverse filled, or has too many edges, this will return NULL. If offset is non-NULL, then
56 * Creates an effect that fills inside the rect with AA edges..
77 GrConvexPolyEffect(GrEffectEdgeType edgeType, int n, const SkScalar edges[]);
H A DGrConvexPolyEffect.cpp132 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
218 "edges",
279 SkScalar edges[3 * kMaxEdges]; local
298 edges[3 * n] = v.fY;
299 edges[3 * n + 1] = -v.fX;
301 edges[3 * n] = -v.fY;
302 edges[3 * n + 1] = v.fX;
305 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[
332 GrConvexPolyEffect(GrEffectEdgeType edgeType, int n, const SkScalar edges[]) argument
362 SkScalar edges[kMaxEdges * 3]; local
[all...]
/external/opencv/cvaux/src/
H A Dcvdpstereo.cpp108 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[
[all...]
H A Ddecomppoly.cpp261 // this edge intersects some other initial edges
328 int* edges,
344 if( edges[ mainEdgeIdx * 2 ] == vtxIdx ) {
347 x0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].x;
348 y0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].y;
353 //x0 = contour[ edges[ mainEdgeIdx * 2 ] ].x;
354 //y0 = contour[ edges[ mainEdgeIdx * 2 ] ].y;
359 x0_end = contour[ edges[ mainEdgeIdx * 2 ] ].x;
360 y0_end = contour[ edges[ mainEdgeIdx * 2 ] ].y;
368 ( edges[
[all...]
H A Dcvsubdiv2.cpp47 int i, j, total = subdiv->edges->total;
59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i);
114 // count number of edges in facet
166 int i, total = subdiv->edges->total;
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i );
/external/chromium_org/ash/wm/workspace/
H A Dmagnetism_matcher.cc13 // Returns true if |a| is close enough to |b| that the two edges snap.
19 // primary edge of |primary|. |edges| is a bitmask of the allowed
23 uint32 edges) {
24 // Convert |secondary| to a MagnetismEdge so we can compare it to |edges|.
46 return (edges & secondary_as_magnetism_edge) != 0;
123 MagnetismMatcher::MagnetismMatcher(const gfx::Rect& bounds, uint32 edges) argument
124 : edges_(edges) {
125 if (edges & MAGNETISM_EDGE_TOP)
127 if (edges & MAGNETISM_EDGE_LEFT)
129 if (edges
21 CanMatchSecondaryEdge(MagnetismEdge primary, SecondaryMagnetismEdge secondary, uint32 edges) argument
[all...]
/external/chromium_org/chrome/tools/
H A Dhistory-viz.py161 edges = {} # Map of urlid->urlid->Edge.
167 edges[src] = edges.get(src, {})
168 edge = edges[src][dst] = edges[src].get(dst, Edge(src, dst))
174 return urls, edges
178 urls, edges = LoadHistory(sys.argv[1])
209 # Output all the edges between nodes.
210 for src, dsts in edges.items():
/external/chromium_org/cc/resources/
H A Dtask_graph_runner.cc28 DCHECK_LT(current_index_, graph_->edges.size());
29 DCHECK_EQ(graph_->edges[current_index_].task, task_);
35 DCHECK_LT(current_index_, graph_->edges.size());
36 DCHECK_EQ(graph_->edges[current_index_].task, task_);
41 // Note: Performance can be improved by keeping edges sorted.
46 if (current_index_ == graph_->edges.size())
48 } while (graph_->edges[current_index_].task != task_);
55 graph_->edges[current_index_].dependent));
62 operator bool() const { return current_index_ < graph_->edges.size(); }
77 return static_cast<size_t>(std::count_if(graph_->edges
[all...]
/external/chromium_org/third_party/freetype/src/autofit/
H A Dafhints.c88 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...]
H A Daflatin.c1103 /* Link segments to edges, using feature analysis for selection. */
1148 /* We begin by generating a sorted table of edges for the current */
1157 /* Note that the table of edges is sorted along the segment/edge */
1180 /* A special case for serif edges: If they are smaller than */
1189 AF_Edge edge = axis->edges + ee;
1260 AF_Edge edges = axis->edges; local
1261 AF_Edge edge_limit = edges + axis->num_edges;
1265 for ( edge = edges; edge < edge_limit; edge++ )
1278 for ( edge = edges; edg
1869 AF_Edge edges = axis->edges; local
[all...]
/external/freetype/src/autofit/
H A Dafhints.c88 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...]
/external/chromium_org/chrome/browser/ui/views/
H A Dchrome_views_delegate.cc109 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) {
418 OnGotAppbarAutohideEdges( const base::Closure& callback, HMONITOR monitor, int returned_edges, int edges) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DRoundedRect.cpp97 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
101 m_bottomLeft = edges.bottomLeft();
103 m_topRight = edges.topRight();
104 m_topLeft = edges.topLeft();
109 m_topRight = edges.topRight();
111 m_bottomLeft = edges.bottomLeft();
112 m_bottomRight = edges.bottomRight();
162 void RoundedRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
164 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
/external/chromium_org/tools/clang/blink_gc_plugin/
H A Dprocess-graph.py90 # Representation of graph nodes. Basically a map of directed edges.
94 self.edges = {}
97 return "%s(%s) %s" % (self.name, self.visited, self.edges)
99 # Currently we don't track any node info besides its edges.
103 edge = self.edges.get(new_edge.key)
108 self.edges[new_edge.key] = new_edge
110 return [ e for e in self.edges.itervalues() if e.is_super() ]
112 return [ e for e in self.edges.itervalues() if e.is_subclass() ]
121 for e in self.edges.itervalues():
124 # Representation of directed graph edges
[all...]
/external/chromium_org/third_party/WebKit/Source/core/page/scrolling/
H A DScrollingConstraints.h62 void setAnchorEdges(AnchorEdges edges) { m_anchorEdges = edges; } argument
/external/replicaisland/tools/
H A DExtractPoints.js20 * each path in the current document and generates a list of edges and normals
53 // Walk the list of paths and extract edges and normals. Store these in
67 tile.edges = new Array();
111 tile.edges.push(edge);
138 // For each tile print the edges to a string.
142 for (var y = 0; y < tile.edges.length; y++) {
143 var edge = tile.edges[y];
191 // Render the edges and normals to the new document.
195 // draw the edges to make sure everything works
224 for (var y = 0; y < tile.edges
[all...]

Completed in 677 milliseconds

12345