| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 66 struct edge *edges; local
88 /* allocate edges */
89 edges = XCALLOC(inlen, sizeof(*edges));
90 if (edges == NULL) {
108 /* scan for edges */
112 edges[x].start = ptr;
120 edges[x].size = y;
123 edges[x].size = 0;
125 edges[x].size = (edges[x].size << 8) | ((unsigned long)ptr[z++])
[all...] |
| /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/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 | 74 edges = {}
81 if target in edges:
83 edges[target] = []
86 edges[target].append(dep)
91 json.dump(edges, f)
|
| /frameworks/base/packages/WallpaperCropper/src/com/android/wallpapercropper/ |
| CropView.java | 121 final RectF edges = mTempEdges; local
122 getEdgesHelper(edges);
125 float cropLeft = -edges.left / scale;
126 float cropTop = -edges.top / scale;
202 final RectF edges = mTempEdges; local
203 getEdgesHelper(edges);
205 mCenterX += Math.ceil(edges.left / scale);
285 final RectF edges = mTempEdges; local
286 getEdgesHelper(edges);
296 if (edges.left > 0)
[all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/ |
| CropView.java | 121 final RectF edges = mTempEdges; local
122 getEdgesHelper(edges);
125 float cropLeft = -edges.left / scale;
126 float cropTop = -edges.top / scale;
202 final RectF edges = mTempEdges; local
203 getEdgesHelper(edges);
205 mCenterX += Math.ceil(edges.left / scale);
285 final RectF edges = mTempEdges; local
286 getEdgesHelper(edges);
296 if (edges.left > 0)
[all...] |
| /external/chromium_org/ui/views/win/ |
| appbar.cc | 45 // initial value of 0 (no auto-hide edges) then we'll go fullscreen and
47 // in us thinking there is no auto-hide edges. By returning at least one edge
49 // edges.
79 int* edges) {
80 edge_map_[monitor] = *edges;
81 if (returned_edges == *edges)
|
| appbar.h | 18 // Appbar provides an API to query for the edges of the monitor that have an
36 // Starts a query for the autohide edges of the specified monitor and returns
37 // the current value. If the edges have changed |callback| is subsequently
38 // invoked. If the edges have not changed |callback| is never run.
40 // Return value is a bitmask of Edges.
49 // Callback on main thread with the edges. |returned_edges| is the value that
54 int* edges);
|
| /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/chrome/browser/profiles/ |
| profile_dependency_manager.cc | 30 // Remove all dependency edges that contain this component.
74 // Step 1: Build a set of nodes with no incoming edges.
89 EdgeMap edges(edges_);
96 edges.equal_range(node);
102 edges.erase(temp);
105 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
117 if (edges.size()) {
|
| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher.cc | 15 // Returns true if |a| is close enough to |b| that the two edges snap.
21 // primary edge of |primary|. |edges| is a bitmask of the allowed
25 uint32 edges) {
26 // Convert |secondary| to a MagnetismEdge so we can compare it to |edges|.
48 return (edges & secondary_as_magnetism_edge) != 0;
125 MagnetismMatcher::MagnetismMatcher(const gfx::Rect& bounds, uint32 edges)
126 : edges_(edges) {
127 if (edges & MAGNETISM_EDGE_TOP)
129 if (edges & MAGNETISM_EDGE_LEFT)
131 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/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...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRegion_rects.cpp | 46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
239 // check if we have no edges
[all...] |
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
239 // check if we have no edges
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| RoundedRect.cpp | 99 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
103 m_bottomLeft = edges.bottomLeft();
105 m_topRight = edges.topRight();
106 m_topLeft = edges.topLeft();
111 m_topRight = edges.topRight();
113 m_bottomLeft = edges.bottomLeft();
114 m_bottomRight = edges.bottomRight();
164 void RoundedRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
166 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderBoxModelObject.cpp | 2317 BorderEdge edges[4]; local
[all...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afhints.c | 77 AF_Edge edges; local
97 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
103 edges = axis->edges;
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
343 /* Dump the array of linked edges. */
357 AF_Edge edges = axis->edges; local
358 AF_Edge limit = edges + axis->num_edges
895 AF_Edge edges = axis->edges; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| PolygonShape.cpp | 247 Vector<const FloatPolygonEdge*> edges; local
248 if (!polygon.overlappingEdges(y, y, edges))
253 for (unsigned i = 0; i < edges.size(); ++i) {
254 if (computeXIntersection(edges[i], y, intersection) && intersection.type != VertexYBoth)
317 Vector<const FloatPolygonEdge*> edges;
318 if (!polygon.overlappingEdges(y1, y2, edges))
322 for (unsigned i = 0; i < edges.size(); ++i) {
323 const FloatPolygonEdge *edge = edges[i];
409 Vector<const FloatPolygonEdge*> edges; local
410 if (!polygon.overlappingEdges(rect.y(), rect.maxY(), edges))
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| JSHeapSnapshot.js | 54 createEdge: function(edges, edgeIndex)
56 return new WebInspector.JSHeapSnapshotEdge(this, edges, edgeIndex);
103 // Mark hidden edges of global objects as invisible.
106 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
112 for (var innerIter = node.edges(); innerIter.hasNext(); innerIter.next()) {
158 for (var iter = node.edges(); iter.hasNext(); iter.next()) {
173 for (var iter = node.edges(); iter.hasNext(); iter.next()) {
199 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
212 for (var iter = gcRoots.edges(); iter.hasNext(); iter.next()) {
214 for (var iter2 = subRoot.edges(); iter2.hasNext(); iter2.next()
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 20 * 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.length; y++)
[all...] |
