Searched defs:edges (Results 1 - 25 of 28) sorted by relevance

12

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java32 /** 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/dropbear/libtomcrypt/src/pk/asn1/der/set/
H A Dder_encode_setof.c66 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[
[all...]
/external/webkit/Source/WebCore/platform/graphics/
H A DRoundedIntRect.cpp78 void RoundedIntRect::Radii::includeLogicalEdges(const RoundedIntRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
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) argument
135 m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
/external/opencv/cvaux/src/
H A Dcvdpstereo.cpp108 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[
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h409 * 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 Dielr.c125 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 DPacketMath.h306 Packet16uc MSQ, LSQ, edges; local
311 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
312 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
314 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
315 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
324 Packet16uc MSQ, LSQ, edges; local
329 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
330 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...]
/external/freetype/src/autofit/
H A Dafhints.c77 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
895 AF_Edge edges = axis->edges; local
[all...]
H A Dafhints.h36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & 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 */
304 FT_Short num_linked; /* number of linked edges */
324 AF_Edge edges; /* edges array */ member in struct:AF_AxisHintsRec_
[all...]
H A Dafcjk.c914 /* 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++ )
1175 AF_Edge edge = axis->edges;
1212 /* if it is a top zone, check for right edges
1673 AF_Edge edges = axis->edges; local
2017 AF_Edge edges = axis->edges; local
[all...]
H A Daflatin.c1036 /* 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 */
1122 AF_Edge edge = axis->edges + ee;
1193 AF_Edge edges = axis->edges; local
1194 AF_Edge edge_limit = edges + axis->num_edges;
1198 for ( edge = edges; edge < edge_limit; edge++ )
1211 for ( edge = edges; edg
1804 AF_Edge edges = axis->edges; local
[all...]
H A Daflatin2.c1082 /* We will begin by generating a sorted table of edges for the */
1091 /* Note that the edges table is sorted along the segment/edge */
1113 /* A special case for serif edges: If they are smaller than */
1134 AF_Edge edge = axis->edges + ee;
1203 AF_Edge edges = axis->edges; local
1204 AF_Edge edge_limit = edges + axis->num_edges;
1208 for ( edge = edges; edge < edge_limit; edge++ )
1221 for ( edge = edges; edge < edge_limit; edge++ )
1363 AF_Edge edge = axis->edges;
1811 AF_Edge edges = axis->edges; local
[all...]
/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h111 EdgeList edges; member in class:PBQP::Graph
128 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
131 EdgeItr edgeItr = edges.insert(edges.end(), e);
162 /// This will clear the current graph, erasing any nodes and edges added,
193 /// \brief Get the number of edges in the graph.
194 /// @return Number of edges in the graph.
265 EdgeItr edgesBegin() { return edges.begin(); }
268 EdgeItr edgesEnd() { return edges.end(); }
272 /// @return Begin iterator for the set of edges connecte
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c2264 * 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 Doptimize.c149 struct edge **edges; variable in typeref:struct:edge
1400 target = fold_edge(ep->succ, edges[k]);
1870 free((void *)edges);
1984 edges = (struct edge **)calloc(n_edges, sizeof(*edges));
1985 if (edges == NULL)
2023 edges[i] = &b->et;
2025 edges[n_blocks + i] = &b->ef;
/external/quake/quake/src/WinQuake/
H A Dmodel.h113 int numedges; // are backwards edges
335 medge_t *edges; member in struct:model_s
H A Dgl_model.h132 int numedges; // are backwards edges
383 medge_t *edges; member in struct:model_s
/external/opencv/cv/src/
H A Dcvhough.cpp858 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 Dcvstereogc.cpp134 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 Dcxdatastructs.cpp2881 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 Dcxdrawing.cpp61 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/quake/quake/src/QW/client/
H A Dgl_model.h136 int numedges; // are backwards edges
386 medge_t *edges; member in struct:model_s
H A Dmodel.h124 int numedges; // are backwards edges
352 medge_t *edges; member in struct:model_s
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DGrammar.java293 /** 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/webkit/Source/WebCore/rendering/
H A DRenderBoxModelObject.cpp1141 static inline bool colorsMatchAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1143 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender())
1146 if (!edgesShareColor(edges[side], edges[adjacentSide]))
1149 return !borderStyleHasUnmatchedColorsAtCorner(edges[side].style, side, adjacentSide);
1153 static inline bool willBeOverdrawn(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1158 if (edges[adjacentSide].presentButInvisible())
1161 if (!edgesShareColor(edges[side], edges[adjacentSid
1191 joinRequiresMitre(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[], bool allowOverdraw) argument
1208 paintOneBorderSide(GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedIntRect& outerBorder, const RoundedIntRect& innerBorder, const IntRect& sideRect, BoxSide side, BoxSide adjacentSide1, BoxSide adjacentSide2, const BorderEdge edges[], const Path* path, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias, const Color* overrideColor) argument
1250 paintBorderSides(GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedIntRect& outerBorder, const RoundedIntRect& innerBorder, const BorderEdge edges[], BorderEdgeFlags edgeSet, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias, const Color* overrideColor) argument
1292 paintTranslucentBorderSides(GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedIntRect& outerBorder, const RoundedIntRect& innerBorder, const BorderEdge edges[], bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias) argument
1343 BorderEdge edges[4] = { local
1448 drawBoxSideFromPath(GraphicsContext* graphicsContext, const IntRect& borderRect, const Path& borderPath, const BorderEdge edges[], float thickness, float drawThickness, BoxSide side, const RenderStyle* style, Color color, EBorderStyle borderStyle, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
[all...]

Completed in 1816 milliseconds

12