| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dfa.st | 5 <edges; separator="\n">
|
| nfa.st | 5 <edges; separator="\n">
|
| 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/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/ui/views/win/ |
| 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);
|
| 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)
|
| /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/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/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 113 // weight of the incoming edges must be equal the block weight which must in
114 // turn be equal to the sume of the weights of the outgoing edges.
128 // To get the block weight, read all incoming edges.
146 // If the edges value is missing (and this is no loop header, and this is
159 SmallVector<Edge, 8> Edges;
167 // *) get all the exit edges, read the flow that is already leaving this
168 // loop, remember the edges that do not have any flow on them right now.
169 // (The edges that have already flow on them are most likely exiting edges of
175 // the remaining exiting edges
[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/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/qemu/distrib/sdl-1.2.15/docs/man3/ |
| SDL_SetClipRect.3 | 13 The rectangle pointed to by \fBrect\fR will be clipped to the edges of the surface so that the clip rectangle for a surface can never fall outside the edges of the surface\&.
|
| /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/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...] |
| /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;
203 final RectF edges = mTempEdges; local
204 getEdgesHelper(edges);
206 mCenterX += Math.ceil(edges.left / scale);
286 final RectF edges = mTempEdges; local
287 getEdgesHelper(edges);
297 if (edges.left > 0)
[all...] |
| /packages/apps/Launcher3/WallpaperPicker/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;
203 final RectF edges = mTempEdges; local
204 getEdgesHelper(edges);
206 mCenterX += Math.ceil(edges.left / scale);
286 final RectF edges = mTempEdges; local
287 getEdgesHelper(edges);
297 if (edges.left > 0)
[all...] |
| /external/llvm/test/Transforms/Mem2Reg/ |
| 2003-04-24-MultipleIdenticalSuccessors.ll | 2 ; multiple incoming edges from a block.
|
| /external/oprofile/events/ppc64/cell-be/ |
| unit_masks | 17 0x000 Count edges [mandatory]
27 0x000 Count edges [mandatory]
38 0x000 Count edges [mandatory]
44 0x000 Count edges [optional ]
57 0x000 Count edges [mandatory]
63 0x000 Count edges [optional ]
90 0x0000 Count edges [optional ]
105 0x0000 Count edges [optional ]
122 0x0000 Count edges [optional ]
|
| /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...] |
| /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...] |
| 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...] |
| /external/chromium_org/components/browser_context_keyed_service/ |
| dependency_graph.cc | 28 // Remove all dependency edges that contain this node.
70 // Step 1: Build a set of nodes with no incoming edges.
85 EdgeMap edges(edges_);
92 edges.equal_range(node);
98 edges.erase(temp);
101 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
113 if (!edges.empty()) {
|
| /external/chromium_org/components/url_matcher/ |
| substring_set_matcher.cc | 34 // For the subsequent patterns, only count the edges which were not counted
191 typedef AhoCorasickNode::Edges Edges;
197 const Edges& root_edges = root.edges();
198 for (Edges::const_iterator e = root_edges.begin(); e != root_edges.end();
208 for (Edges::const_iterator e = current_node.edges().begin();
209 e != current_node.edges().end(); ++e) {
255 Edges::const_iterator i = edges_.find(c)
[all...] |
