| /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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| CSharp2.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| CSharp3.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
| Delphi.stg | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| ObjC.stg | [all...] |
| /ndk/build/core/ |
| definitions-graph.mk | 266 # For topological sort, we need to count the number of incoming edges
270 # Count the number of incoming edges for each node during topological
274 # 2 edges -> 'xx'
275 # 3 edges -> 'xxx'
294 # Find first node in a list that has zero incoming edges.
296 # Out: first node that has zero incoming edges, or empty.
329 # Given a closure list of nodes, count their incoming edges.
|
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 174 // Purpose: Function seeks all non-boundary edges incident to
180 // LinkedEdges : out, matrix of incident edges
183 // for this pSite, this property hold out far all edges)
184 // Returns: number of incident edges (must be less than 10)
329 LCMEdgeSeq = (CvSeq*)(*Graph)->edges;
542 counter < pLCM->VoronoiDiagram->edges->total;
598 cvSetAdd( (CvSet*)(pLCM->Graph->edges), 0, (CvSetElem**)&pLCMEdge );
|
| /external/opencv/cv/src/ |
| cvhough.cpp | 858 CvMat *edges = 0; local
876 CV_CALL( edges = cvCreateMat( img->rows, img->cols, CV_8UC1 ));
877 CV_CALL( cvCanny( img, edges, MAX(canny_threshold/2,1), canny_threshold, 3 ));
903 const uchar* edges_row = edges->data.ptr + y*edges->step;
[all...] |
| /external/libpcap/ |
| optimize.c | 125 struct edge **edges; variable in typeref:struct:edge
1353 target = fold_edge(ep->succ, edges[k]);
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2881 CvSet *edges = 0; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| C.stg | [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/chromium_org/cc/resources/ |
| raster_worker_pool.cc | 284 graph->edges.push_back(TaskGraph::Edge(decode_task, raster_task));
|
| pixel_buffer_raster_worker_pool.cc | 595 graph_.edges.push_back(TaskGraph::Edge(
621 graph_.edges.push_back(
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
| HeapSnapshotLoader.js | 169 this._state = "find-edges";
173 case "find-edges": {
174 var edgesToken = "\"edges\"";
186 this._state = "parse-edges";
189 case "parse-edges": {
191 this._progress.updateProgress("Loading edges\u2026 %d\%", this._arrayIndex, this._array.length);
194 this._snapshot.edges = this._array;
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| 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.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...] |
| /frameworks/support/v4/java/android/support/v4/widget/ |
| ViewDragHelper.java | 84 * Edge flag set indicating all edges should be affected.
204 * Called when one of the subscribed edges in the parent view has been touched
220 * unlocked. The default behavior is to leave edges unlocked.
231 * of the subscribed edges in the parent view while no child view is currently captured.
425 * Enable edge tracking for the selected edges of the parent view.
428 * for edges for which edge tracking has been enabled.
430 * @param edgeFlags Combination of edge flags describing the edges to watch
441 * Return the size of an edge. This is the range in pixels along the edges of this view
[all...] |
| /packages/apps/Dialer/src/com/android/dialer/widget/ |
| ViewDragHelper.java | 84 * Edge flag set indicating all edges should be affected.
220 * Called when one of the subscribed edges in the parent view has been touched
236 * unlocked. The default behavior is to leave edges unlocked.
247 * of the subscribed edges in the parent view while no child view is currently captured.
431 * Enable edge tracking for the selected edges of the parent view.
434 * for edges for which edge tracking has been enabled.
436 * @param edgeFlags Combination of edge flags describing the edges to watch
447 * Return the size of an edge. This is the range in pixels along the edges of this view
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| GuidelineHandler.java | 116 * is a constraint between two horizontal edges)
123 * is a constraint between two vertical edges)
134 * All horizontal segments in the relative layout - top and bottom edges, baseline
135 * edges, and top and bottom edges offset by the applicable margins in each direction
140 * All vertical segments in the relative layout - left and right edges, and left and
141 * right edges offset by the applicable margins in each direction
147 * they only match other center edges.
153 * since they only match other center edges.
316 /** Records the matchable outside edges for the given node to the potential match list *
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PhotoView.java | [all...] |
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
| /external/chromium_org/v8/test/mjsunit/ |
| unicodelctest-no-optimization.js | 77 // edges.
[all...] |
| unicodelctest.js | 76 // edges.
[all...] |
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
