| /external/chromium_org/tools/gyp/tools/ |
| graphviz.py | 23 """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 between nodes
[all...] |
| /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/third_party/skia/src/gpu/effects/ |
| GrConvexPolyEffect.h | 30 * 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[]);
|
| 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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dot.stg | 33 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/tools/gyp/pylib/gyp/generator/ |
| dump_dependency_json.py | 62 edges = {}
69 if target in edges:
71 edges[target] = []
74 edges[target].append(dep)
79 json.dump(edges, f)
|
| /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];
|
| BoxPainter.cpp | [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...] |
| decomppoly.cpp | 261 // 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[ i * 2 ] == vtxIdx || edges[ i * 2 + 1 ] == vtxIdx )
[all...] |
| cvsubdiv2.cpp | 47 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/ |
| magnetism_matcher.cc | 13 // 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)
124 : edges_(edges) {
125 if (edges & MAGNETISM_EDGE_TOP)
127 if (edges & MAGNETISM_EDGE_LEFT)
129 if (edges & MAGNETISM_EDGE_BOTTOM)
[all...] |
| /external/chromium_org/chrome/tools/ |
| history-viz.py | 161 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/third_party/WebKit/Source/core/page/scrolling/ |
| ScrollingConstraints.h | 62 void setAnchorEdges(AnchorEdges edges) { m_anchorEdges = edges; }
|
| /external/chromium_org/cc/resources/ |
| task_graph_runner.cc | 28 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.begin()
[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...] |
| 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/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...] |
| aflatin2.c | 1112 /* We will begin by generating a sorted table of edges for the */
1234 AF_Edge edges = axis->edges; local
1842 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...] |
| /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/third_party/WebKit/Source/platform/geometry/ |
| RoundedRect.cpp | 97 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
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)
164 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph.cc | 24 // Remove all dependency edges that contain this node.
65 // Step 1: Build a set of nodes with no incoming edges.
77 EdgeMap edges(edges_);
84 edges.equal_range(node);
90 edges.erase(temp);
93 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
105 if (!edges.empty()) {
|
| /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...] |
