Searched defs:v_next (Results 1 - 4 of 4) sorted by relevance

/external/chromium_org/third_party/freetype/src/base/
H A Dftoutln.c905 FT_Vector v_prev, v_first, v_next, v_cur; local
954 v_next = points[n + 1];
956 v_next = v_first;
959 out.x = v_next.x - v_cur.x;
960 out.y = v_next.y - v_cur.y;
1012 v_cur = v_next;
/external/freetype/src/base/
H A Dftoutln.c908 FT_Vector v_prev, v_first, v_next, v_cur; local
957 v_next = points[n + 1];
959 v_next = v_first;
962 out.x = v_next.x - v_cur.x;
963 out.y = v_next.y - v_cur.y;
1015 v_cur = v_next;
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftoutln.c905 FT_Vector v_prev, v_first, v_next, v_cur; local
954 v_next = points[n + 1];
956 v_next = v_first;
959 out.x = v_next.x - v_cur.x;
960 out.y = v_next.y - v_cur.y;
1012 v_cur = v_next;
/external/opencv/cxcore/src/
H A Dcxdatastructs.cpp3815 struct CvTreeNode* v_next; /* 2nd next sequence */ member in struct:CvTreeNode
3838 node->h_next = parent->v_next;
3840 assert( parent->v_next != node );
3842 if( parent->v_next )
3843 parent->v_next->h_prev = node;
3844 parent->v_next = node;
3880 assert( parent->v_next == node );
3881 parent->v_next = node->h_next;
3931 if( node->v_next && level+1 < treeIterator->max_level )
3933 node = node->v_next;
[all...]

Completed in 126 milliseconds