| /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/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/webkit/Source/WebCore/platform/graphics/ |
| RoundedIntRect.cpp | 78 void RoundedIntRect::Radii::includeLogicalEdges(const RoundedIntRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
82 m_bottomLeft = edges.bottomLeft();
84 m_topRight = edges.topRight();
85 m_topLeft = edges.topLeft();
90 m_topRight = edges.topRight();
92 m_bottomLeft = edges.bottomLeft();
93 m_bottomRight = edges.bottomRight();
133 void RoundedIntRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
135 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
|
| RoundedIntRect.h | 59 void includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge);
93 void includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge);
|
| /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/skia/src/gpu/ |
| GrTesselatedPathRenderer.cpp | 170 const GrDrawState::Edge* edges() const { return fEdges; } function in class:GrEdgePolygonTess
310 GrEdgeArray* edges,
327 *edges->append() = edge;
330 int count = edges->count();
334 GrDrawState::Edge prev_edge = edges->at(0);
336 GrDrawState::Edge edge = edges->at(i < count - 1 ? i + 1 : 0);
347 return edges->count();
470 GrEdgeArray edges; local
474 count = computeEdgesAndIntersect(matrix, inverse, base, count, &edges, 0.0f);
480 // All edges fit; upload all edges and draw all verts as a fa
528 GrEdgeArray edges; local
548 const GrDrawState::Edge* edges = ptess.edges(); local
[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...] |
| SkRegion_path.cpp | 390 edge++; // skip over "used" edges
443 SkTDArray<Edge> edges;
446 Edge* edge = edges.append(2);
450 SkQSort(edges.begin(), edges.count(), sizeof(Edge),
453 int count = edges.count();
454 Edge* start = edges.begin();
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderBoxModelObject.cpp | 1343 BorderEdge edges[4] = { local
[all...] |
| /external/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...] |
| aflatin.c | 1036 /* Link segments to edges, using feature analysis for selection. */
1081 /* We begin by generating a sorted table of edges for the current */
1090 /* Note that the table of edges is sorted along the segment/edge */
1113 /* A special case for serif edges: If they are smaller than */
1193 AF_Edge edges = axis->edges; local
1804 AF_Edge edges = axis->edges; local
[all...] |
| aflatin2.c | 1082 /* We will begin by generating a sorted table of edges for the */
1091 /* Note that the edges table is sorted along the segment/edge */
1203 AF_Edge edges = axis->edges; local
1811 AF_Edge edges = axis->edges; local
[all...] |
| afcjk.c | 914 /* We begin by generating a sorted table of edges for the current */
923 /* Note that the edges table is sorted along the segment/edge */
945 AF_Edge edge = axis->edges + ee;
1044 AF_Edge edges = axis->edges; local
1045 AF_Edge edge_limit = edges + axis->num_edges;
1049 for ( edge = edges; edge < edge_limit; edge++ )
1062 for ( edge = edges; edge < edge_limit; edge++ )
1673 AF_Edge edges = axis->edges; local
2017 AF_Edge edges = axis->edges; local
[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...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 106 EdgeList edges; member in class:PBQP::Graph
123 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
126 EdgeItr edgeItr = edges.insert(edges.end(), e);
157 /// This will clear the current graph, erasing any nodes and edges added,
188 /// \brief Get the number of edges in the graph.
189 /// @return Number of edges in the graph.
260 EdgeItr edgesBegin() { return edges.begin(); }
263 EdgeItr edgesEnd() { return edges.end(); }
267 /// @return Begin iterator for the set of edges connected to the given node
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
| Ruby.stg | 763 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
765 <edges; separator="\nels">
787 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
789 <edges; separator="\nels">
802 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
804 <edges; separator="\nels"><\n>
833 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
835 <edges; separator="\n">
851 dfaOptionalBlockStateSwitch(k, edges, eotPredictsAlt, description, stateNumber, semPredState) ::= <<
853 <edges; separator="\n"
[all...] |
| /external/opencv/cv/src/ |
| cvstereogc.cpp | 134 static int64 icvGCMaxFlow( GCVtx* vtx, int nvtx, GCEdge* edges, GCVtx**& _orphans, int& _maxOrphans )
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[e0].weight -= min_weight
[all...] |
| /system/core/libpixelflinger/ |
| trap.cpp | 32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3]; local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax )
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 33 " $edges$\n" +
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/opencv/cxcore/src/ |
| 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;
2423 CvContour* edges = 0; local
[all...] |
