/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | 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/skia/src/gpu/effects/ |
H A D | GrConvexPolyEffect.h | 31 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values. 32 * The edges should form a convex polygon. The positive half-plane is considered to be the 36 * Currently the edges are specified in device space. In the future we may prefer to specify 42 const SkScalar edges[]) { 46 return SkNEW_ARGS(GrConvexPolyEffect, (edgeType, n, edges)); 51 * inverse filled, or has too many edges, this will return NULL. If offset is non-NULL, then 58 * Creates an effect that fills inside the rect with AA edges.. 77 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]); 41 Create(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument
|
H A D | GrConvexPolyEffect.cpp | 128 // The amount of coverage removed in x and y by the edges is computed as a pair of negative 216 "edges", 280 SkScalar edges[3 * kMaxEdges]; local 299 edges[3 * n] = v.fY; 300 edges[3 * n + 1] = -v.fX; 302 edges[3 * n] = -v.fY; 303 edges[3 * n + 1] = v.fX; 306 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[ 338 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) argument 369 SkScalar edges[kMaxEdges * 3]; local [all...] |
/external/opencv/cvaux/src/ |
H A D | cvdpstereo.cpp | 110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local 160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2; 161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1; 164 edges[y*imgW+j] = 0; 169 edges[y*imgW+j] |= 1; 174 edges[ [all...] |
/external/skia/src/core/ |
H A D | SkDistanceFieldGen.cpp | 66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image, argument 72 edges += (pad*dataWidth + pad); 95 *edges = 255; // using 255 makes for convenient debug rendering 99 ++edges; 102 edges += 2*pad; 148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) { argument 156 if (*edges) { 187 ++edges; 361 // create initial distance data, particularly at edges
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | 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/bison/src/ |
H A D | 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_count [all...] |
/external/eigen/Eigen/src/Core/arch/AltiVec/ |
H A D | PacketMath.h | 309 Packet16uc MSQ, LSQ, edges; local 314 edgeAlign = vec_lvsl(0, to); // permute map to extract edges 315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges 317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ) 318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ) 327 Packet16uc MSQ, LSQ, edges; local 332 edgeAlign = vec_lvsl(0, to); // permute map to extract edges 333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges [all...] |
/external/freetype/src/autofit/ |
H A D | afhints.c | 107 AF_Edge edges; local 112 if ( axis->edges == NULL ) 114 axis->edges = axis->embedded.edges; 135 if ( axis->edges == axis->embedded.edges ) 137 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) 139 ft_memcpy( axis->edges, axis->embedded.edges, 140 sizeof ( axis->embedded.edges ) ); 304 AF_Edge edges = axis->edges; local 434 AF_Edge edges = axis->edges; local 1112 AF_Edge edges = axis->edges; local [all...] |
H A D | afhints.h | 36 /* i.e., vertical segments & edges */ 38 /* i.e., horizontal segments & edges */ 83 * edges. 86 * edges. An edge corresponds to a single position on the main 91 * edges, then to align segments on the edges unless it detects that 178 * interpolated linearly between their two closest edges, even if these 204 * alignment of edges and strong points, thus weak points are processed 287 FT_Fixed scale; /* used to speed up interpolation between edges */ 292 FT_Short num_linked; /* number of linked edges */ 314 AF_Edge edges; /* edges array */ member in struct:AF_AxisHintsRec_ 322 AF_EdgeRec edges[AF_EDGES_EMBEDDED]; member in struct:AF_AxisHintsRec_::__anon5032 [all...] |
H A D | afcjk.c | 931 /* We begin by generating a sorted table of edges for the current */ 940 /* Note that the edges table is sorted along the segment/edge */ 962 AF_Edge edge = axis->edges + ee; 1064 AF_Edge edges = axis->edges; local 1065 AF_Edge edge_limit = edges + axis->num_edges; 1069 for ( edge = edges; edge < edge_limit; edge++ ) 1082 for ( edge = edges; edge < edge_limit; edge++ ) 1171 /* Detect segments and edges for given dimension. */ 1191 /* Compute all edges whic 1717 AF_Edge edges = axis->edges; local 2096 AF_Edge edges = axis->edges; local [all...] |
H A D | aflatin.c | 1510 /* Link segments to edges, using feature analysis for selection. */ 1555 /* We begin by generating a sorted table of edges for the current */ 1564 /* Note that the table of edges is sorted along the segment/edge */ 1587 /* A special case for serif edges: If they are smaller than */ 1596 AF_Edge edge = axis->edges + ee; 1667 AF_Edge edges = axis->edges; local 1668 AF_Edge edge_limit = edges + axis->num_edges; 1672 for ( edge = edges; edge < edge_limit; edge++ ) 1685 for ( edge = edges; edg 2298 AF_Edge edges = axis->edges; local [all...] |
H A D | aflatin2.c | 1107 /* We will begin by generating a sorted table of edges for the */ 1116 /* Note that the edges table is sorted along the segment/edge */ 1138 /* A special case for serif edges: If they are smaller than */ 1160 AF_Edge edge = axis->edges + ee; 1230 AF_Edge edges = axis->edges; local 1231 AF_Edge edge_limit = edges + axis->num_edges; 1235 for ( edge = edges; edge < edge_limit; edge++ ) 1248 for ( edge = edges; edge < edge_limit; edge++ ) 1390 AF_Edge edge = axis->edges; 1841 AF_Edge edges = axis->edges; local [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 2264 * used to define edges that identify numerical node indexes that depend on other 2297 topo->limit = 1; // No edges added yet 2298 topo->edges = NULL; // No edges added yet 2334 // First see if we have enough room in the edges array to add the edge? 2336 if (topo->edges == NULL) 2338 // We don't have any edges yet, so create an array to hold them 2340 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1); 2341 if (topo->edges == NULL) 2352 // WE have some edges bu 2417 pANTLR3_BITSET edges; local [all...] |
/external/libpcap/ |
H A D | optimize.c | 125 struct edge **edges; variable in typeref:struct:edge 1353 target = fold_edge(ep->succ, edges[k]); 1807 free((void *)edges); 1916 edges = (struct edge **)calloc(n_edges, sizeof(*edges)); 1917 if (edges == NULL) 1955 edges[i] = &b->et; 1957 edges[n_blocks + i] = &b->ef;
|
/external/v8/src/ |
H A D | heap-snapshot-generator.h | 161 List<HeapGraphEdge>& edges() { return edges_; } function in class:v8::internal::HeapSnapshot
|
H A D | heap-snapshot-generator.cc | 69 snapshot_->edges().Add(edge); 78 snapshot_->edges().Add(edge); 280 children().Allocate(edges().length()); 286 DCHECK(edges().length() == children_index); 287 for (int i = 0; i < edges().length(); ++i) { 288 HeapGraphEdge* edge = &edges()[i]; 2745 writer_->AddString("\"edges\":["); 2846 List<HeapGraphEdge*>& edges = snapshot_->children(); local 2847 for (int i = 0; i < edges.length(); ++i) { 2849 edges[ [all...] |
/external/opencv/cv/src/ |
H A D | 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; 1067 cvReleaseMat( &edges );
|
H A D | cvstereogc.cpp | 134 static int64 icvGCMaxFlow( GCVtx* vtx, int nvtx, GCEdge* edges, GCVtx**& _orphans, int& _maxOrphans ) argument 179 for( ei = v->first; ei != 0; ei = edges[ei].next ) 181 if( edges[ei^vt].weight == 0 ) 183 u = edges[ei].dst; 224 min_weight = edges[e0].weight; 229 for( v = edges[e0^k].dst;; v = edges[ei].dst ) 233 weight = edges[ei^k].weight; 242 // modify weights of the edges along the path and collect orphans 243 edges[e [all...] |
/external/opencv/cxcore/src/ |
H A D | cxdatastructs.cpp | 2881 CvSet *edges = 0; local 2897 CV_CALL( edges = cvCreateSet( CV_SEQ_KIND_GENERIC | CV_SEQ_ELTYPE_GRAPH_EDGE, 2901 graph->edges = edges; 2909 /* Remove all vertices and edges from a graph: */ 2920 cvClearSet( graph->edges ); 2960 /* Remove a vertex from the graph together with its incident edges: */ 2976 count = graph->edges->active_count; 2984 count -= graph->edges->active_count; 2993 /* Remove a vertex from the graph together with its incident edges [all...] |
H A D | cxdrawing.cpp | 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges, 66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color ); 943 CvContour* edges; 948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st )); 954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT )); 955 CV_CALL( icvFillEdgeCollection( img, edges, color )); 999 int edges = npts; 1087 if( ty > y || edges == 0 ) 1092 edges--; 1099 /* no more edges */ 1149 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges, const void* color, int line_type, int shift, CvPoint offset ) argument 1249 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color ) argument 2423 CvContour* edges = 0; local [all...] |
/external/skia/src/gpu/ |
H A D | GrTessellatingPathRenderer.cpp | 29 * 2) Build a mesh of edges connecting the vertices (build_edges()). 31 * 4) Simplify the mesh by inserting new vertices at intersecting edges (simplify()). 38 * Stages (4) and (5) use an active edge list, which a list of all edges for which the 40 * left-to-right based on the point where both edges are active (when both top vertices 42 * (shared), it's sorted based on the last point where both edges are active, so the 52 * neighbouring edges at the top or bottom vertex. This is handled by merging the 53 * edges (merge_collinear_edges()). 76 * that the "left" and "right" orientation in the code remains correct (edges to the left are 77 * increasing in Y; edges to the right are decreasing in Y). That is, the setting rotates 90 153 Edge* fFirstEdgeAbove; // Linked list of edges abov 650 insert_edge(Edge* edge, Edge* prev, EdgeList* edges) argument 657 find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) argument 676 find_enclosing_edges(Edge* edge, EdgeList* edges, Comparator& c, Edge** left, Edge** right) argument 758 erase_edge_if_zero_winding(Edge* edge, EdgeList* edges) argument [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | Grammar.java | 293 /** The NFA that represents the grammar with edges labelled with tokens 486 * incident edges can have synpreds. Same is try for 1206 List<IntervalSet> edges = new ArrayList<IntervalSet>(); 1209 edges.add((IntervalSet)s.tokenTypeSet); 1211 List<IntervalSet> disjoint = makeEdgeSetsDisjoint(edges); 1246 protected List<IntervalSet> makeEdgeSetsDisjoint(List<IntervalSet> edges) { argument 1249 int numEdges = edges.size(); 1251 IntervalSet t = (IntervalSet) edges.get(e);
|
/external/valgrind/coregrind/ |
H A D | m_transtab.c | 107 /* In edges ("to-me") in the graph created by chaining. */ 119 /* Out edges ("from-me") in the graph created by chaining. */ 137 } edges; member in struct:__anon16159 149 } edges; member in struct:__anon16161 217 backwards and forwards edges in the graph of patched-together 284 edges in the graph are not uniquely determined by a 288 If A has multiple edges to B then B will mention A multiple 511 return VG_(sizeXA)(iea->edges.var); 522 VG_(deleteXA)(iea->edges.var); 523 iea->edges [all...] |
/external/v8/test/cctest/ |
H A D | test-heap-profiler.cc | 148 i::List<i::HeapGraphEdge>& edges = heap_snapshot->edges(); local 149 for (int i = 0; i < edges.length(); ++i) { 151 reinterpret_cast<void*>(edges[i].to()), 152 static_cast<uint32_t>(reinterpret_cast<uintptr_t>(edges[i].to())), 929 CHECK(parsed_snapshot->Has(v8_str("edges"))); 959 " var edges = parsed.edges;\n" 965 " if (edges[i + edge_type_offset] === prop_type\n" 966 " && strings[edges[ [all...] |