Searched refs:prev_elem (Results 1 – 8 of 8) sorted by relevance
642 hull_cur = *(CvPoint**)hull_reader.prev_elem; in cvConvexityDefects()647 index = *(int*)hull_reader.prev_elem; in cvConvexityDefects()766 CvPoint *prev_pt = (CvPoint*)reader.prev_elem; in cvCheckContourConvexity()807 CvPoint2D32f *prev_pt = (CvPoint2D32f*)reader.prev_elem; in cvCheckContourConvexity()
89 reader.prev_elem = reader.ptr; in cvArcLength()99 CvPoint* prev_pt = (CvPoint*)reader.prev_elem; in cvArcLength()107 CvPoint2D32f* prev_pt = (CvPoint2D32f*)reader.prev_elem; in cvArcLength()113 reader.prev_elem = reader.ptr; in cvArcLength()
122 int prev_code = *reader.prev_elem; in icvApproximateChainTC89()124 reader.prev_elem = reader.ptr; in icvApproximateChainTC89()
158 #define prev_elem(elem) ((elem)->prev) macro
1506 schar* prev_elem; /* pointer to previous element */1602 #define CV_PREV_POINT( reader ) (*((CvPoint*)((reader).prev_elem)))1611 (reader).prev_elem = (reader).ptr; \
1118 reader->prev_elem = CV_GET_LAST_ELEM( seq, last_block ); in cvStartReadSeq()1125 reader->ptr = reader->prev_elem; in cvStartReadSeq()1126 reader->prev_elem = temp; in cvStartReadSeq()1143 reader->ptr = reader->prev_elem = reader->block_min = reader->block_max = 0; in cvStartReadSeq()
277 #define CV_PREV_INT( reader ) (*((int *)(reader).prev_elem))
8373 auto prev_elem = std::find(node.prev.begin(), node.prev.end(), dependent_subpasses[k]); in CheckDependencyExists() local8375 if (prev_elem == node.prev.end() && next_elem == node.next.end()) { in CheckDependencyExists()