next 2942 3rdparty/include/ffmpeg_/libavcodec/avcodec.h struct AVCodec *next; next 3035 3rdparty/include/ffmpeg_/libavcodec/avcodec.h struct AVHWAccel *next; next 3970 3rdparty/include/ffmpeg_/libavcodec/avcodec.h struct AVCodecParser *next; next 4608 3rdparty/include/ffmpeg_/libavcodec/avcodec.h struct AVBitStreamFilterContext *next; next 4620 3rdparty/include/ffmpeg_/libavcodec/avcodec.h struct AVBitStreamFilter *next; next 424 3rdparty/include/ffmpeg_/libavformat/avformat.h struct AVOutputFormat *next; next 504 3rdparty/include/ffmpeg_/libavformat/avformat.h struct AVInputFormat *next; next 1308 3rdparty/include/ffmpeg_/libavformat/avformat.h struct AVPacketList *next; next 1915 3rdparty/libjasper/jpc_dec.c jpc_dec_seg_t *next; next 1919 3rdparty/libjasper/jpc_dec.c next = prev ? (prev->next) : 0; next 1921 3rdparty/libjasper/jpc_dec.c node->next = next; next 1923 3rdparty/libjasper/jpc_dec.c prev->next = node; next 1927 3rdparty/libjasper/jpc_dec.c if (next) { next 1928 3rdparty/libjasper/jpc_dec.c next->prev = node; next 1937 3rdparty/libjasper/jpc_dec.c jpc_dec_seg_t *next; next 1940 3rdparty/libjasper/jpc_dec.c next = seg->next; next 1942 3rdparty/libjasper/jpc_dec.c prev->next = next; next 1944 3rdparty/libjasper/jpc_dec.c list->head = next; next 1946 3rdparty/libjasper/jpc_dec.c if (next) { next 1947 3rdparty/libjasper/jpc_dec.c next->prev = prev; next 1952 3rdparty/libjasper/jpc_dec.c seg->next = 0; next 1963 3rdparty/libjasper/jpc_dec.c seg->next = 0; next 229 3rdparty/libjasper/jpc_dec.h struct jpc_dec_seg_s *next; next 325 3rdparty/libjasper/jpc_t1dec.c cblk->curseg = seg->next; next 322 3rdparty/libjasper/jpc_t2dec.c seg = seg->next; next 400 3rdparty/libjasper/jpc_t2dec.c cblk->curseg = seg->next; next 402 3rdparty/libjasper/jpc_t2dec.c seg = seg->next; next 897 3rdparty/libjpeg/jdmarker.c cur_marker->next = NULL; next 939 3rdparty/libjpeg/jdmarker.c while (prev->next != NULL) next 940 3rdparty/libjpeg/jdmarker.c prev = prev->next; next 941 3rdparty/libjpeg/jdmarker.c prev->next = cur_marker; next 94 3rdparty/libjpeg/jmemmgr.c small_pool_ptr next; /* next in list of pools */ next 105 3rdparty/libjpeg/jmemmgr.c large_pool_ptr next; /* next in list of pools */ next 163 3rdparty/libjpeg/jmemmgr.c jvirt_sarray_ptr next; /* link to next virtual sarray control block */ next 179 3rdparty/libjpeg/jmemmgr.c jvirt_barray_ptr next; /* link to next virtual barray control block */ next 201 3rdparty/libjpeg/jmemmgr.c lhdr_ptr = lhdr_ptr->hdr.next) { next 207 3rdparty/libjpeg/jmemmgr.c shdr_ptr = shdr_ptr->hdr.next) { next 284 3rdparty/libjpeg/jmemmgr.c hdr_ptr = hdr_ptr->hdr.next; next 309 3rdparty/libjpeg/jmemmgr.c hdr_ptr->hdr.next = NULL; next 315 3rdparty/libjpeg/jmemmgr.c prev_hdr_ptr->hdr.next = hdr_ptr; next 370 3rdparty/libjpeg/jmemmgr.c hdr_ptr->hdr.next = mem->large_list[pool_id]; next 546 3rdparty/libjpeg/jmemmgr.c result->next = mem->virt_sarray_list; /* add to list of virtual arrays */ next 576 3rdparty/libjpeg/jmemmgr.c result->next = mem->virt_barray_list; /* add to list of virtual arrays */ next 599 3rdparty/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 607 3rdparty/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 640 3rdparty/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 664 3rdparty/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 951 3rdparty/libjpeg/jmemmgr.c for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { next 958 3rdparty/libjpeg/jmemmgr.c for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { next 972 3rdparty/libjpeg/jmemmgr.c large_pool_ptr next_lhdr_ptr = lhdr_ptr->hdr.next; next 986 3rdparty/libjpeg/jmemmgr.c small_pool_ptr next_shdr_ptr = shdr_ptr->hdr.next; next 205 3rdparty/libjpeg/jpeglib.h jpeg_saved_marker_ptr next; /* next in list, or NULL */ next 373 3rdparty/libpng/pngrtran.c struct png_dsort_struct FAR * next; next 595 3rdparty/libpng/pngrtran.c t->next = hash[d]; next 612 3rdparty/libpng/pngrtran.c for (p = hash[i]; p; p = p->next) next 680 3rdparty/libpng/pngrtran.c t = p->next; next 67 3rdparty/libtiff/tif_close.c tif->tif_clientinfo = link->next; next 181 3rdparty/libtiff/tif_compress.c struct _codec* next; next 192 3rdparty/libtiff/tif_compress.c for (cd = registeredCODECS; cd; cd = cd->next) next 214 3rdparty/libtiff/tif_compress.c cd->next = registeredCODECS; next 230 3rdparty/libtiff/tif_compress.c for (pcd = ®isteredCODECS; (cd = *pcd); pcd = &cd->next) next 232 3rdparty/libtiff/tif_compress.c *pcd = cd->next; next 261 3rdparty/libtiff/tif_compress.c for (cd = registeredCODECS; cd; cd = cd->next) { next 72 3rdparty/libtiff/tif_extension.c link = link->next; next 90 3rdparty/libtiff/tif_extension.c link = link->next; next 104 3rdparty/libtiff/tif_extension.c link->next = tif->tif_clientinfo; next 122 3rdparty/libtiff/tif_lzw.c struct code_ent *next; next 246 3rdparty/libtiff/tif_lzw.c sp->dec_codetab[code].next = NULL; next 397 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 403 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 417 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 469 3rdparty/libtiff/tif_lzw.c free_entp->next = oldcodep; next 470 3rdparty/libtiff/tif_lzw.c if (free_entp->next < &sp->dec_codetab[0] || next 471 3rdparty/libtiff/tif_lzw.c free_entp->next >= &sp->dec_codetab[CSIZE]) { next 477 3rdparty/libtiff/tif_lzw.c free_entp->firstchar = free_entp->next->firstchar; next 478 3rdparty/libtiff/tif_lzw.c free_entp->length = free_entp->next->length+1; next 509 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 516 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 529 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 621 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 626 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 637 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 687 3rdparty/libtiff/tif_lzw.c free_entp->next = oldcodep; next 688 3rdparty/libtiff/tif_lzw.c if (free_entp->next < &sp->dec_codetab[0] || next 689 3rdparty/libtiff/tif_lzw.c free_entp->next >= &sp->dec_codetab[CSIZE]) { next 694 3rdparty/libtiff/tif_lzw.c free_entp->firstchar = free_entp->next->firstchar; next 695 3rdparty/libtiff/tif_lzw.c free_entp->length = free_entp->next->length+1; next 726 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 732 3rdparty/libtiff/tif_lzw.c codep = codep->next; next 741 3rdparty/libtiff/tif_lzw.c } while( (codep = codep->next) != NULL ); next 76 3rdparty/libtiff/tiffiop.h struct client_info *next; next 56 3rdparty/libwebp/enc/token.c const VP8Tokens* const next = p->next_; next 58 3rdparty/libwebp/enc/token.c p = next; next 222 3rdparty/libwebp/enc/token.c const VP8Tokens* const next = p->next_; next 223 3rdparty/libwebp/enc/token.c const int N = (next == NULL) ? b->left_ : 0; next 235 3rdparty/libwebp/enc/token.c p = next; next 57 3rdparty/libwebp/mux/muxinternal.c WebPChunk* next; next 62 3rdparty/libwebp/mux/muxinternal.c next = chunk->next_; next 64 3rdparty/libwebp/mux/muxinternal.c return next; next 186 3rdparty/libwebp/mux/muxinternal.c WebPChunk* const next = ChunkRelease(chunk); next 188 3rdparty/libwebp/mux/muxinternal.c return next; next 233 3rdparty/libwebp/mux/muxinternal.c WebPMuxImage* next; next 239 3rdparty/libwebp/mux/muxinternal.c next = wpi->next_; next 241 3rdparty/libwebp/mux/muxinternal.c return next; next 318 3rdparty/libwebp/mux/muxinternal.c WebPMuxImage* const next = MuxImageRelease(wpi); next 320 3rdparty/libwebp/mux/muxinternal.c return next; next 187 3rdparty/openexr/Imath/ImathRandom.cpp next (); next 118 3rdparty/openexr/Imath/ImathRandom.h void next (); next 254 3rdparty/openexr/Imath/ImathRandom.h Rand32::next () next 263 3rdparty/openexr/Imath/ImathRandom.h next (); next 272 3rdparty/openexr/Imath/ImathRandom.h next (); next 332 3rdparty/zlib/deflate.c z_const unsigned char *next; next 360 3rdparty/zlib/deflate.c next = strm->next_in; next 385 3rdparty/zlib/deflate.c strm->next_in = next; next 425 3rdparty/zlib/gzlib.c state->x.next += n; next 156 3rdparty/zlib/gzread.c state->x.next = state->out; next 158 3rdparty/zlib/gzread.c memcpy(state->x.next, strm->next_in, strm->avail_in); next 210 3rdparty/zlib/gzread.c state->x.next = strm->next_out - state->x.have; next 243 3rdparty/zlib/gzread.c state->x.next = state->out; next 269 3rdparty/zlib/gzread.c state->x.next += n; next 332 3rdparty/zlib/gzread.c memcpy(buf, state->x.next, n); next 333 3rdparty/zlib/gzread.c state->x.next += n; next 408 3rdparty/zlib/gzread.c return *(state->x.next)++; next 453 3rdparty/zlib/gzread.c state->x.next = state->out + (state->size << 1) - 1; next 454 3rdparty/zlib/gzread.c state->x.next[0] = c; next 467 3rdparty/zlib/gzread.c if (state->x.next == state->out) { next 472 3rdparty/zlib/gzread.c state->x.next = dest; next 475 3rdparty/zlib/gzread.c state->x.next--; next 476 3rdparty/zlib/gzread.c state->x.next[0] = c; next 526 3rdparty/zlib/gzread.c eol = (unsigned char *)memchr(state->x.next, '\n', n); next 528 3rdparty/zlib/gzread.c n = (unsigned)(eol - state->x.next) + 1; next 531 3rdparty/zlib/gzread.c memcpy(buf, state->x.next, n); next 533 3rdparty/zlib/gzread.c state->x.next += n; next 59 3rdparty/zlib/gzwrite.c state->x.next = strm->next_out; next 100 3rdparty/zlib/gzwrite.c have = (unsigned)(strm->next_out - state->x.next); next 101 3rdparty/zlib/gzwrite.c if (have && ((got = write(state->fd, state->x.next, have)) < 0 || next 110 3rdparty/zlib/gzwrite.c state->x.next = strm->next_out; next 93 3rdparty/zlib/infback.c static code *next; next 101 3rdparty/zlib/infback.c next = fixed; next 102 3rdparty/zlib/infback.c lenfix = next; next 104 3rdparty/zlib/infback.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); next 109 3rdparty/zlib/infback.c distfix = next; next 111 3rdparty/zlib/infback.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); next 132 3rdparty/zlib/infback.c next = strm->next_in; \ next 143 3rdparty/zlib/infback.c strm->next_in = next; \ next 161 3rdparty/zlib/infback.c have = in(in_desc, &next); \ next 163 3rdparty/zlib/infback.c next = Z_NULL; \ next 176 3rdparty/zlib/infback.c hold += (unsigned long)(*next++) << bits; \ next 258 3rdparty/zlib/infback.c z_const unsigned char FAR *next; /* next input */ next 282 3rdparty/zlib/infback.c next = strm->next_in; next 283 3rdparty/zlib/infback.c have = next != Z_NULL ? strm->avail_in : 0; next 347 3rdparty/zlib/infback.c zmemcpy(put, next, copy); next 349 3rdparty/zlib/infback.c next += copy; next 385 3rdparty/zlib/infback.c state->next = state->codes; next 386 3rdparty/zlib/infback.c state->lencode = (code const FAR *)(state->next); next 388 3rdparty/zlib/infback.c ret = inflate_table(CODES, state->lens, 19, &(state->next), next 459 3rdparty/zlib/infback.c state->next = state->codes; next 460 3rdparty/zlib/infback.c state->lencode = (code const FAR *)(state->next); next 462 3rdparty/zlib/infback.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), next 469 3rdparty/zlib/infback.c state->distcode = (code const FAR *)(state->next); next 472 3rdparty/zlib/infback.c &(state->next), &(state->distbits), state->work); next 626 3rdparty/zlib/infback.c strm->next_in = next; next 122 3rdparty/zlib/inflate.c state->lencode = state->distcode = state->next = state->codes; next 272 3rdparty/zlib/inflate.c static code *next; next 280 3rdparty/zlib/inflate.c next = fixed; next 281 3rdparty/zlib/inflate.c lenfix = next; next 283 3rdparty/zlib/inflate.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); next 288 3rdparty/zlib/inflate.c distfix = next; next 290 3rdparty/zlib/inflate.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); next 463 3rdparty/zlib/inflate.c next = strm->next_in; \ next 474 3rdparty/zlib/inflate.c strm->next_in = next; \ next 493 3rdparty/zlib/inflate.c hold += (unsigned long)(*next++) << bits; \ next 610 3rdparty/zlib/inflate.c z_const unsigned char FAR *next; /* next input */ next 741 3rdparty/zlib/inflate.c zmemcpy(state->head->extra + len, next, next 746 3rdparty/zlib/inflate.c state->check = crc32(state->check, next, copy); next 748 3rdparty/zlib/inflate.c next += copy; next 760 3rdparty/zlib/inflate.c len = (unsigned)(next[copy++]); next 767 3rdparty/zlib/inflate.c state->check = crc32(state->check, next, copy); next 769 3rdparty/zlib/inflate.c next += copy; next 781 3rdparty/zlib/inflate.c len = (unsigned)(next[copy++]); next 788 3rdparty/zlib/inflate.c state->check = crc32(state->check, next, copy); next 790 3rdparty/zlib/inflate.c next += copy; next 886 3rdparty/zlib/inflate.c zmemcpy(put, next, copy); next 888 3rdparty/zlib/inflate.c next += copy; next 923 3rdparty/zlib/inflate.c state->next = state->codes; next 924 3rdparty/zlib/inflate.c state->lencode = (const code FAR *)(state->next); next 926 3rdparty/zlib/inflate.c ret = inflate_table(CODES, state->lens, 19, &(state->next), next 997 3rdparty/zlib/inflate.c state->next = state->codes; next 998 3rdparty/zlib/inflate.c state->lencode = (const code FAR *)(state->next); next 1000 3rdparty/zlib/inflate.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), next 1007 3rdparty/zlib/inflate.c state->distcode = (const code FAR *)(state->next); next 1010 3rdparty/zlib/inflate.c &(state->next), &(state->distbits), state->work); next 1360 3rdparty/zlib/inflate.c unsigned next; next 1363 3rdparty/zlib/inflate.c next = 0; next 1364 3rdparty/zlib/inflate.c while (next < len && got < 4) { next 1365 3rdparty/zlib/inflate.c if ((int)(buf[next]) == (got < 2 ? 0 : 0xff)) next 1367 3rdparty/zlib/inflate.c else if (buf[next]) next 1371 3rdparty/zlib/inflate.c next++; next 1374 3rdparty/zlib/inflate.c return next; next 1475 3rdparty/zlib/inflate.c copy->next = copy->codes + (state->next - state->codes); next 115 3rdparty/zlib/inflate.h code FAR *next; /* next available space in codes[] */ next 54 3rdparty/zlib/inftrees.c code FAR *next; /* next available space in table */ next 203 3rdparty/zlib/inftrees.c next = *table; /* current table to fill in */ next 238 3rdparty/zlib/inftrees.c next[(huff >> drop) + fill] = here; next 266 3rdparty/zlib/inftrees.c next += min; /* here min is 1 << curr */ next 288 3rdparty/zlib/inftrees.c (*table)[low].val = (unsigned short)(next - *table); next 299 3rdparty/zlib/inftrees.c next[huff] = here; next 1672 3rdparty/zlib/zlib.h unsigned char *next; next 1679 3rdparty/zlib/zlib.h ((g)->have ? ((g)->have--, (g)->pos++, *((g)->next)++) : gzgetc(g)) next 1682 3rdparty/zlib/zlib.h ((g)->have ? ((g)->have--, (g)->pos++, *((g)->next)++) : gzgetc(g)) next 79 apps/traincascade/old_ml.hpp CvVectors* next; next 349 apps/traincascade/old_ml.hpp CvSVMKernelRow* next; next 583 apps/traincascade/old_ml.hpp CvDTreeSplit* next; next 1514 apps/traincascade/old_ml_boost.cpp for( ; split != 0; split = split->next ) next 1567 apps/traincascade/old_ml_boost.cpp for( ; split != 0; split = split->next ) next 1785 apps/traincascade/old_ml_boost.cpp for( ; !dir && split != 0; split = split->next ) next 1084 apps/traincascade/old_ml_tree.cpp split->next = 0; next 1101 apps/traincascade/old_ml_tree.cpp split->next = 0; next 1113 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* next = split->next; next 1115 apps/traincascade/old_ml_tree.cpp split = next; next 1747 apps/traincascade/old_ml_tree.cpp while( prev_split->next && next 1748 apps/traincascade/old_ml_tree.cpp prev_split->next->quality > split->quality ) next 1749 apps/traincascade/old_ml_tree.cpp prev_split = prev_split->next; next 1750 apps/traincascade/old_ml_tree.cpp split->next = prev_split->next; next 1751 apps/traincascade/old_ml_tree.cpp prev_split->next = split; next 2956 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* split = node->split->next; next 2957 apps/traincascade/old_ml_tree.cpp for( ; split != 0 && nz; split = split->next ) next 3668 apps/traincascade/old_ml_tree.cpp for( ; !dir && split != 0; split = split->next ) next 3764 apps/traincascade/old_ml_tree.cpp for( ; split != 0; split = split->next ) next 3846 apps/traincascade/old_ml_tree.cpp for( split = node->split; split != 0; split = split->next ) next 4062 apps/traincascade/old_ml_tree.cpp last_split = last_split->next = split; next 1150 modules/calib3d/src/rho.cpp double next; next 1153 modules/calib3d/src/rho.cpp next = (ctrl.phEndFpI * ctrl.phNum)/(ctrl.phNum - SMPL_SIZE); next 1154 modules/calib3d/src/rho.cpp ctrl.phEndI += (unsigned)ceil(next - ctrl.phEndFpI); next 1155 modules/calib3d/src/rho.cpp ctrl.phEndFpI = next; next 141 modules/calib3d/src/stereobm.cpp const uchar* next = sptr + srcstep*MIN(y+1,size.height-1); next 157 modules/calib3d/src/stereobm.cpp int val = ((curr[0]*5 + curr[1] + prev[0] + next[0])*scale_g - sum*scale_s) >> 10; next 163 modules/calib3d/src/stereobm.cpp val = ((curr[x]*4 + curr[x-1] + curr[x+1] + prev[x] + next[x])*scale_g - sum*scale_s) >> 10; next 168 modules/calib3d/src/stereobm.cpp val = ((curr[x]*5 + curr[x-1] + prev[x] + next[x])*scale_g - sum*scale_s) >> 10; next 2623 modules/core/include/opencv2/core.hpp unsigned next(); next 2763 modules/core/include/opencv2/core.hpp unsigned next(); next 2849 modules/core/include/opencv2/core.hpp virtual const char* next() = 0; next 544 modules/core/include/opencv2/core/core_c.h if( mat_iterator->node->next ) next 545 modules/core/include/opencv2/core/core_c.h return mat_iterator->node = mat_iterator->node->next; next 175 modules/core/include/opencv2/core/cvstd.inl.hpp for(const char* str = fmtd->next(); str; str = fmtd->next()) next 2425 modules/core/include/opencv2/core/mat.hpp size_t next; next 336 modules/core/include/opencv2/core/operations.hpp inline RNG::operator uchar() { return (uchar)next(); } next 337 modules/core/include/opencv2/core/operations.hpp inline RNG::operator schar() { return (schar)next(); } next 338 modules/core/include/opencv2/core/operations.hpp inline RNG::operator ushort() { return (ushort)next(); } next 339 modules/core/include/opencv2/core/operations.hpp inline RNG::operator short() { return (short)next(); } next 340 modules/core/include/opencv2/core/operations.hpp inline RNG::operator int() { return (int)next(); } next 341 modules/core/include/opencv2/core/operations.hpp inline RNG::operator unsigned() { return next(); } next 342 modules/core/include/opencv2/core/operations.hpp inline RNG::operator float() { return next()*2.3283064365386962890625e-10f; } next 343 modules/core/include/opencv2/core/operations.hpp inline RNG::operator double() { unsigned t = next(); return (((uint64)t << 32) | next()) * 5.4210108624275221700372640043497e-20; } next 346 modules/core/include/opencv2/core/operations.hpp inline unsigned RNG::operator ()() { return next(); } next 348 modules/core/include/opencv2/core/operations.hpp inline int RNG::uniform(int a, int b) { return a == b ? a : (int)(next() % (b - a) + a); } next 381 modules/core/include/opencv2/core/operations.hpp for(const char* str = fmtd->next(); str; str = fmtd->next()) next 713 modules/core/include/opencv2/core/types_c.h struct CvSparseNode* next; next 1183 modules/core/include/opencv2/core/types_c.h struct CvMemBlock* next; next 1218 modules/core/include/opencv2/core/types_c.h struct CvSeqBlock* next; /**< Next sequence block. */ next 1318 modules/core/include/opencv2/core/types_c.h struct CvGraphEdge* next[2]; \ next 1650 modules/core/include/opencv2/core/types_c.h (edge)->next[(edge)->vtx[1] == (vertex)]) next 1683 modules/core/include/opencv2/core/types_c.h struct CvAttrList* next; /**< Pointer to next chunk of the attributes list. */ next 1689 modules/core/include/opencv2/core/types_c.h CvAttrList* next CV_DEFAULT(NULL) ) next 1693 modules/core/include/opencv2/core/types_c.h l.next = next; next 1747 modules/core/include/opencv2/core/types_c.h struct CvStringHashNode* next; next 1798 modules/core/include/opencv2/core/types_c.h struct CvTypeInfo* next; /**< next registered type in the list */ next 1823 modules/core/include/opencv2/core/types_c.h struct CvModuleInfo* next; next 137 modules/core/perf/opencl/perf_matop.cpp for ( ; next(); ) next 208 modules/core/src/alloc.cpp Node* next; next 219 modules/core/src/alloc.cpp next = _next; next 233 modules/core/src/alloc.cpp prev->next = this; next 234 modules/core/src/alloc.cpp next = _next; next 235 modules/core/src/alloc.cpp if(next) next 236 modules/core/src/alloc.cpp next->prev = this; next 252 modules/core/src/alloc.cpp Block* next; next 271 modules/core/src/alloc.cpp next = _next; next 284 modules/core/src/alloc.cpp BigBlock* next; next 300 modules/core/src/alloc.cpp BigBlock* nextBlock = pool->next; next 319 modules/core/src/alloc.cpp freeBlocks = freeBlocks->next; next 330 modules/core/src/alloc.cpp block->next = freeBlocks; next 360 modules/core/src/alloc.cpp Block* next = block->next; next 364 modules/core/src/alloc.cpp block->next = block->prev = 0; next 367 modules/core/src/alloc.cpp for( ; node != 0; node = node->next ) next 372 modules/core/src/alloc.cpp block = next; next 383 modules/core/src/alloc.cpp CV_DbgAssert( block->next->prev == block && block->prev->next == block ); next 388 modules/core/src/alloc.cpp gcPtr = block->next; next 389 modules/core/src/alloc.cpp if( block->next != block ) next 391 modules/core/src/alloc.cpp block->prev->next = block->next; next 392 modules/core/src/alloc.cpp block->next->prev = block->prev; next 394 modules/core/src/alloc.cpp block->next = freePtr->next; next 396 modules/core/src/alloc.cpp freePtr = block->next->prev = block->prev->next = block; next 475 modules/core/src/alloc.cpp block = block->next; next 518 modules/core/src/alloc.cpp CV_DbgAssert( block->next->prev == block && block->prev->next == block ); next 530 modules/core/src/alloc.cpp block->privateFreeList = block->privateFreeList->next; next 536 modules/core/src/alloc.cpp block = block->next; next 555 modules/core/src/alloc.cpp CV_DbgAssert( block->next->prev == block && block->prev->next == block ); next 564 modules/core/src/alloc.cpp for(;node != 0; node = node->next) next 567 modules/core/src/alloc.cpp block->privateFreeList = block->privateFreeList->next; next 568 modules/core/src/alloc.cpp gcPtr = block->next; next 573 modules/core/src/alloc.cpp block = block->next; next 637 modules/core/src/alloc.cpp if( block == block->next ) next 645 modules/core/src/alloc.cpp freePtr = block->next; next 647 modules/core/src/alloc.cpp gcPtr = block->next; next 649 modules/core/src/alloc.cpp startPtr = block->next; next 650 modules/core/src/alloc.cpp block->prev->next = block->next; next 651 modules/core/src/alloc.cpp block->next->prev = block->prev; next 660 modules/core/src/alloc.cpp node->next = block->privateFreeList; next 668 modules/core/src/alloc.cpp node->next = block->publicFreeList; next 682 modules/core/src/alloc.cpp block->next = startPtr; next 684 modules/core/src/alloc.cpp block->next->prev = block->prev->next = block; next 680 modules/core/src/array.cpp node != 0; node = node->next ) next 715 modules/core/src/array.cpp CvSparseNode* next = cvGetNextSparseNode( &iterator ); next 717 modules/core/src/array.cpp node->next = (CvSparseNode*)newtable[newidx]; next 719 modules/core/src/array.cpp node = next; next 730 modules/core/src/array.cpp node->next = (CvSparseNode*)mat->hashtable[tabidx]; next 772 modules/core/src/array.cpp node != 0; prev = node, node = node->next ) next 788 modules/core/src/array.cpp prev->next = node->next; next 790 modules/core/src/array.cpp mat->hashtable[tabidx] = node->next; next 1355 modules/core/src/copy.cpp node_copy->next = (CvSparseNode*)dst1->hashtable[tabidx]; next 149 modules/core/src/datastructs.cpp block = block->next; next 155 modules/core/src/datastructs.cpp temp->next = dst_top->next; next 156 modules/core/src/datastructs.cpp if( temp->next ) next 157 modules/core/src/datastructs.cpp temp->next->prev = temp; next 158 modules/core/src/datastructs.cpp dst_top = dst_top->next = temp; next 163 modules/core/src/datastructs.cpp temp->prev = temp->next = 0; next 220 modules/core/src/datastructs.cpp if( !storage->top || !storage->top->next ) next 248 modules/core/src/datastructs.cpp parent->top->next = block->next; next 249 modules/core/src/datastructs.cpp if( block->next ) next 250 modules/core/src/datastructs.cpp block->next->prev = parent->top; next 255 modules/core/src/datastructs.cpp block->next = 0; next 259 modules/core/src/datastructs.cpp storage->top->next = block; next 264 modules/core/src/datastructs.cpp if( storage->top->next ) next 265 modules/core/src/datastructs.cpp storage->top = storage->top->next; next 459 modules/core/src/datastructs.cpp block = block->next; next 507 modules/core/src/datastructs.cpp block = block->next; next 569 modules/core/src/datastructs.cpp reader.block = reader.block->next; next 615 modules/core/src/datastructs.cpp block->prev = block->next = block; next 690 modules/core/src/datastructs.cpp block->prev = block->next = 0; next 695 modules/core/src/datastructs.cpp seq->free_blocks = block->next; next 701 modules/core/src/datastructs.cpp block->prev = block->next = block; next 706 modules/core/src/datastructs.cpp block->next = seq->first; next 707 modules/core/src/datastructs.cpp block->prev->next = block->next->prev = block; next 745 modules/core/src/datastructs.cpp block = block->next; next 792 modules/core/src/datastructs.cpp block = block->next; next 797 modules/core/src/datastructs.cpp seq->first = block->next; next 800 modules/core/src/datastructs.cpp block->prev->next = block->next; next 801 modules/core/src/datastructs.cpp block->next->prev = block->prev; next 805 modules/core/src/datastructs.cpp block->next = seq->free_blocks; next 866 modules/core/src/datastructs.cpp block = block->next; next 998 modules/core/src/datastructs.cpp reader->block = reader->block->next; next 1071 modules/core/src/datastructs.cpp block = block->next; next 1107 modules/core/src/datastructs.cpp reader->block = block = block->next; next 1338 modules/core/src/datastructs.cpp CvSeqBlock *next_block = block->next; next 1401 modules/core/src/datastructs.cpp block = block->next; next 1412 modules/core/src/datastructs.cpp CvSeqBlock *next_block = block->next; next 1645 modules/core/src/datastructs.cpp first_block = subseq->first = block->prev = block->next = block; next 1651 modules/core/src/datastructs.cpp block->next = first_block; next 1652 modules/core/src/datastructs.cpp last_block->next = first_block->prev = block; next 1663 modules/core/src/datastructs.cpp reader.block = reader.block->next; next 2713 modules/core/src/datastructs.cpp for( ; edge; edge = edge->next[ofs] ) next 2784 modules/core/src/datastructs.cpp edge->next[0] = start_vtx->first; next 2785 modules/core/src/datastructs.cpp edge->next[1] = end_vtx->first; next 2854 modules/core/src/datastructs.cpp prev_ofs = ofs, prev_edge = edge, edge = edge->next[ofs] ) next 2865 modules/core/src/datastructs.cpp next_edge = edge->next[ofs]; next 2867 modules/core/src/datastructs.cpp prev_edge->next[prev_ofs] = next_edge; next 2872 modules/core/src/datastructs.cpp prev_ofs = ofs, prev_edge = edge, edge = edge->next[ofs] ) next 2882 modules/core/src/datastructs.cpp next_edge = edge->next[ofs]; next 2884 modules/core/src/datastructs.cpp prev_edge->next[prev_ofs] = next_edge; next 533 modules/core/src/lapack.cpp _Tp val = (rng.next() & 256) != 0 ? val0 : -val0; next 866 modules/core/src/matrix.cpp if(!copyData && seq->first->next == seq->first) next 4931 modules/core/src/matrix.cpp nidx = elem->next; next 4953 modules/core/src/matrix.cpp nidx = elem->next; next 4976 modules/core/src/matrix.cpp nidx = elem->next; next 5005 modules/core/src/matrix.cpp nidx = elem->next; next 5023 modules/core/src/matrix.cpp nidx = elem->next; next 5043 modules/core/src/matrix.cpp nidx = elem->next; next 5069 modules/core/src/matrix.cpp nidx = elem->next; next 5094 modules/core/src/matrix.cpp size_t next = elem->next; next 5096 modules/core/src/matrix.cpp elem->next = newh[newhidx]; next 5098 modules/core/src/matrix.cpp nidx = next; next 5124 modules/core/src/matrix.cpp ((Node*)(pool + i))->next = i + nsz; next 5125 modules/core/src/matrix.cpp ((Node*)(pool + i))->next = 0; next 5129 modules/core/src/matrix.cpp hdr->freeList = elem->next; next 5132 modules/core/src/matrix.cpp elem->next = hdr->hashtab[hidx]; next 5157 modules/core/src/matrix.cpp prev->next = n->next; next 5160 modules/core/src/matrix.cpp hdr->hashtab[hidx] = n->next; next 5161 modules/core/src/matrix.cpp n->next = hdr->freeList; next 5192 modules/core/src/matrix.cpp size_t next = ((const SparseMat::Node*)(ptr - hdr.valueOffset))->next; next 5193 modules/core/src/matrix.cpp if( next ) next 5195 modules/core/src/matrix.cpp ptr = &hdr.pool[next] + hdr.valueOffset; next 171 modules/core/src/out.cpp return next(); next 191 modules/core/src/out.cpp return next(); next 202 modules/core/src/out.cpp return next(); next 215 modules/core/src/out.cpp return next(); next 233 modules/core/src/out.cpp return next(); next 171 modules/core/src/persistence.cpp struct CvFileMapNode* next; next 361 modules/core/src/persistence.cpp attr = attr->next; next 602 modules/core/src/persistence.cpp for( node = (CvStringHashNode*)(map->table[i]); node != 0; node = node->next ) next 615 modules/core/src/persistence.cpp node->next = (CvStringHashNode*)(map->table[i]); next 672 modules/core/src/persistence.cpp for( another = (CvFileMapNode*)(map->table[i]); another != 0; another = another->next ) next 688 modules/core/src/persistence.cpp node->next = (CvFileMapNode*)(map->table[i]); next 751 modules/core/src/persistence.cpp for( another = (CvFileMapNode*)(map->table[i]); another != 0; another = another->next ) next 2136 modules/core/src/persistence.cpp last = last->next = chunk; next 2344 modules/core/src/persistence.cpp if( !list.next ) next 2346 modules/core/src/persistence.cpp list = *list.next; next 4147 modules/core/src/persistence.cpp for( block = seq->first; block; block = block->next ) next 4325 modules/core/src/persistence.cpp for( block = seq->first; block; block = block->next ) next 4769 modules/core/src/persistence.cpp _info.prev = _info.next = 0; next 4850 modules/core/src/persistence.cpp info->next = CvType::first; next 4869 modules/core/src/persistence.cpp info->prev->next = info->next; next 4871 modules/core/src/persistence.cpp CvType::first = info->next; next 4873 modules/core/src/persistence.cpp if( info->next ) next 4874 modules/core/src/persistence.cpp info->next->prev = info->prev; next 4899 modules/core/src/persistence.cpp for( info = CvType::first; info != 0; info = info->next ) next 4914 modules/core/src/persistence.cpp for( info = CvType::first; info != 0; info = info->next ) next 938 modules/core/src/rand.cpp cv::RNG_MT19937::operator unsigned() { return next(); } next 940 modules/core/src/rand.cpp cv::RNG_MT19937::operator int() { return (int)next();} next 942 modules/core/src/rand.cpp cv::RNG_MT19937::operator float() { return next() * (1.f / 4294967296.f); } next 946 modules/core/src/rand.cpp unsigned a = next() >> 5; next 947 modules/core/src/rand.cpp unsigned b = next() >> 6; next 951 modules/core/src/rand.cpp int cv::RNG_MT19937::uniform(int a, int b) { return (int)(next() % (b - a) + a); } next 957 modules/core/src/rand.cpp unsigned cv::RNG_MT19937::operator ()(unsigned b) { return next() % b; } next 959 modules/core/src/rand.cpp unsigned cv::RNG_MT19937::operator ()() { return next(); } next 112 modules/core/test/test_countnonzero.cpp int i = rng.next()%size.height, j = rng.next()%size.width; next 194 modules/core/test/test_countnonzero.cpp int w = rng.next()%MAX_WIDTH + 1, h = rng.next()%MAX_HEIGHT + 1; next 196 modules/core/test/test_countnonzero.cpp current_type = rng.next()%7; next 216 modules/core/test/test_countnonzero.cpp int count_non_zero = rng.next()%(w*h); next 468 modules/core/test/test_ds.cpp prev_block->next == block, next 472 modules/core/test/test_ds.cpp block = block->next; next 350 modules/core/test/test_rand.cpp actual[(unsigned)(rng.next() ^ i) % length]++; next 128 modules/cudabgsegm/perf/perf_bgsegm.cpp if(!next()) next 232 modules/cudabgsegm/perf/perf_bgsegm.cpp if(!next()) next 291 modules/cudabgsegm/perf/perf_bgsegm.cpp if(!next()) next 136 modules/cudacodec/perf/perf_video.cpp startTimer(); next(); next 153 modules/cudacodec/perf/perf_video.cpp startTimer(); next(); next 78 modules/cudaimgproc/src/mssegmentation.cpp GraphEdge(int to_, int next_, const T& val_) : to(to_), next(next_), val(val_) {} next 80 modules/cudaimgproc/src/mssegmentation.cpp int next; next 152 modules/cudaimgproc/src/mssegmentation.cpp int next = parent[elem]; next 154 modules/cudaimgproc/src/mssegmentation.cpp elem = next; next 321 modules/cudaimgproc/src/mssegmentation.cpp for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next) next 337 modules/cudaimgproc/src/mssegmentation.cpp for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next) next 107 modules/cudalegacy/perf/perf_bgsegm.cpp if(!next()) next 207 modules/cudalegacy/perf/perf_bgsegm.cpp if(!next()) next 578 modules/cudaobjdetect/src/cascadeclassifier.cpp level = level.next(scaleFactor_, image.size(), NxM, minObjectSize_); next 279 modules/features2d/src/kaze/AKAZEFeatures.cpp float* next = evolution_[i].Ldet.ptr<float>(ix + 1); next 294 modules/features2d/src/kaze/AKAZEFeatures.cpp value > next[jx-1] && next 295 modules/features2d/src/kaze/AKAZEFeatures.cpp value > next[jx] && next 296 modules/features2d/src/kaze/AKAZEFeatures.cpp value > next[jx+1]) { next 360 modules/features2d/src/kaze/AKAZEFeatures.cpp curr = next; next 114 modules/features2d/src/mser.cpp void setNext(int next) { val = (val & ~NEXT_MASK) | next; } next 661 modules/features2d/src/mser.cpp MSCRNode* next; next 696 modules/features2d/src/mser.cpp node->prev = node->next = node->shortcut = node; next 861 modules/features2d/src/mser.cpp MSCRNode* next; next 864 modules/features2d/src/mser.cpp next = x->shortcut; next 866 modules/features2d/src/mser.cpp if ( next == x ) break; next 868 modules/features2d/src/mser.cpp x = next; next 946 modules/features2d/src/mser.cpp lr->prev->next = rr; next 948 modules/features2d/src/mser.cpp rr->prev->next = lr; next 1010 modules/features2d/src/mser.cpp lpt = lpt->next; next 99 modules/features2d/test/test_nearestneighbors.cpp int fi = rng.next() % featuresCount; next 118 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h rnd = r.next(); next 117 modules/flann/include/opencv2/flann/kmeans_index.h rnd = r.next(); next 120 modules/flann/include/opencv2/flann/random.h int next() next 70 modules/flann/include/opencv2/flann/sampling.h long r = rand.next(); next 68 modules/highgui/src/window_carbon.cpp CvTrackbar* next; next 87 modules/highgui/src/window_carbon.cpp CvWindow* next; next 166 modules/highgui/src/window_carbon.cpp trackbar = trackbar->next; next 178 modules/highgui/src/window_carbon.cpp trackbar = trackbar->next; next 181 modules/highgui/src/window_carbon.cpp window = window->next; next 191 modules/highgui/src/window_carbon.cpp window = window->next; next 200 modules/highgui/src/window_carbon.cpp window = window->next; next 210 modules/highgui/src/window_carbon.cpp trackbar = trackbar->next; next 312 modules/highgui/src/window_carbon.cpp window->prev->next = window->next; next 314 modules/highgui/src/window_carbon.cpp hg_windows = window->next; next 316 modules/highgui/src/window_carbon.cpp if( window->next ) next 317 modules/highgui/src/window_carbon.cpp window->next->prev = window->prev; next 319 modules/highgui/src/window_carbon.cpp window->prev = window->next = 0; next 326 modules/highgui/src/window_carbon.cpp CvTrackbar* next = trackbar->next; next 328 modules/highgui/src/window_carbon.cpp trackbar = next; next 548 modules/highgui/src/window_carbon.cpp trackbar->next = window->toolbar.first; next 921 modules/highgui/src/window_carbon.cpp window->next = hg_windows; next 1059 modules/highgui/src/window_carbon.cpp for ( t = window->toolbar.first; t != 0; t = t->next ) next 506 modules/highgui/src/window_gtk.cpp CvTrackbar* next; next 526 modules/highgui/src/window_gtk.cpp CvWindow* next; next 652 modules/highgui/src/window_gtk.cpp window = window->next; next 663 modules/highgui/src/window_gtk.cpp window = window->next; next 1031 modules/highgui/src/window_gtk.cpp window->next = hg_windows; next 1199 modules/highgui/src/window_gtk.cpp window->prev->next = window->next; next 1201 modules/highgui/src/window_gtk.cpp hg_windows = window->next; next 1203 modules/highgui/src/window_gtk.cpp if( window->next ) next 1204 modules/highgui/src/window_gtk.cpp window->next->prev = window->prev; next 1206 modules/highgui/src/window_gtk.cpp window->prev = window->next = 0; next 1212 modules/highgui/src/window_gtk.cpp CvTrackbar* next = trackbar->next; next 1214 modules/highgui/src/window_gtk.cpp trackbar = next; next 1386 modules/highgui/src/window_gtk.cpp for( ; trackbar != 0 && strcmp( trackbar->name, name ) != 0; trackbar = trackbar->next ) next 1430 modules/highgui/src/window_gtk.cpp trackbar->next = window->toolbar.first; next 135 modules/highgui/src/window_w32.cpp CvTrackbar* next; next 155 modules/highgui/src/window_w32.cpp CvWindow* next; next 276 modules/highgui/src/window_w32.cpp for( ; window != 0 && strcmp( name, window->name) != 0; window = window->next ) next 814 modules/highgui/src/window_w32.cpp window->next = hg_windows; next 928 modules/highgui/src/window_w32.cpp window->prev->next = window->next; next 930 modules/highgui/src/window_w32.cpp hg_windows = window->next; next 932 modules/highgui/src/window_w32.cpp if( window->next ) next 933 modules/highgui/src/window_w32.cpp window->next->prev = window->prev; next 935 modules/highgui/src/window_w32.cpp window->prev = window->next = 0; next 945 modules/highgui/src/window_w32.cpp CvTrackbar* next = trackbar->next; next 951 modules/highgui/src/window_w32.cpp trackbar = next; next 1816 modules/highgui/src/window_w32.cpp for( ; trackbar != 0; trackbar = trackbar->next ) next 1846 modules/highgui/src/window_w32.cpp window = window->next; next 1922 modules/highgui/src/window_w32.cpp for( window = hg_windows; window != 0 && is_processed == 0; window = window->next ) next 1986 modules/highgui/src/window_w32.cpp for( ; trackbar != 0 && strcmp( trackbar->name, name ) != 0; trackbar = trackbar->next ) next 2123 modules/highgui/src/window_w32.cpp trackbar->next = window->toolbar.first; next 950 modules/imgproc/include/opencv2/imgproc.hpp int next[4]; next 156 modules/imgproc/perf/perf_blur.cpp while(next()) next 63 modules/imgproc/perf/perf_floodfill.cpp for (; next(); ) next 52 modules/imgproc/src/approx.cpp struct _CvPtInfo *next; next 88 modules/imgproc/src/approx.cpp temp.next = 0; next 115 modules/imgproc/src/approx.cpp current = current->next = array + i; next 126 modules/imgproc/src/approx.cpp current->next = 0; next 129 modules/imgproc/src/approx.cpp current = temp.next; next 215 modules/imgproc/src/approx.cpp current = current->next; next 220 modules/imgproc/src/approx.cpp current = temp.next; next 248 modules/imgproc/src/approx.cpp prev_current->next = current->next; next 253 modules/imgproc/src/approx.cpp current = current->next; next 259 modules/imgproc/src/approx.cpp current = temp.next; next 278 modules/imgproc/src/approx.cpp prev_current->next = current->next; next 286 modules/imgproc/src/approx.cpp current = current->next; next 295 modules/imgproc/src/approx.cpp assert( temp.next ); next 309 modules/imgproc/src/approx.cpp array[i2].next = 0; next 316 modules/imgproc/src/approx.cpp i1 = (int)(array[0].next - array); next 318 modules/imgproc/src/approx.cpp array[len].next = 0; next 319 modules/imgproc/src/approx.cpp array[len - 1].next = array + len; next 321 modules/imgproc/src/approx.cpp temp.next = array + i1; next 324 modules/imgproc/src/approx.cpp current = temp.next; next 331 modules/imgproc/src/approx.cpp if( current->next == 0 || current->next - current != 1 ) next 342 modules/imgproc/src/approx.cpp prev_current->next = current->next; next 345 modules/imgproc/src/approx.cpp first->next = current; next 348 modules/imgproc/src/approx.cpp first->next->next = current; next 356 modules/imgproc/src/approx.cpp current = current->next; next 363 modules/imgproc/src/approx.cpp current = temp.next; next 369 modules/imgproc/src/approx.cpp current = current->next; next 786 modules/imgproc/src/approx.cpp if( src_seq->first->next == src_seq->first ) next 117 modules/imgproc/src/contours.cpp struct _CvContourInfo *next; /* next contour with the same mark value */ next 228 modules/imgproc/src/contours.cpp scanner->frame_info.next = 0; next 607 modules/imgproc/src/contours.cpp writer.seq->first->next == writer.seq->first) ); next 794 modules/imgproc/src/contours.cpp writer.seq->first->next == writer.seq->first) ); next 983 modules/imgproc/src/contours.cpp writer.seq->first->next == writer.seq->first) ); next 1106 modules/imgproc/src/contours.cpp cur = cur->next; next 1179 modules/imgproc/src/contours.cpp l_cinfo->next = scanner->cinfo_table[lval]; next 1286 modules/imgproc/src/contours.cpp struct CvLinkedRunPoint* next; next 1364 modules/imgproc/src/contours.cpp tmp_prev->next = 0; next 1383 modules/imgproc/src/contours.cpp tmp_prev->next = (CvLinkedRunPoint*)CV_GET_WRITTEN_ELEM( writer ); next 1384 modules/imgproc/src/contours.cpp tmp_prev = tmp_prev->next; next 1391 modules/imgproc/src/contours.cpp tmp_prev->next = (CvLinkedRunPoint*)CV_GET_WRITTEN_ELEM( writer ); next 1392 modules/imgproc/src/contours.cpp tmp_prev->link = tmp_prev->next; next 1395 modules/imgproc/src/contours.cpp tmp_prev = tmp_prev->next; next 1398 modules/imgproc/src/contours.cpp upper_line = upper_line->next; next 1401 modules/imgproc/src/contours.cpp tmp_prev->next = 0; next 1417 modules/imgproc/src/contours.cpp tmp_prev->next = (CvLinkedRunPoint*)CV_GET_WRITTEN_ELEM( writer ); next 1418 modules/imgproc/src/contours.cpp tmp_prev = tmp_prev->next; next 1425 modules/imgproc/src/contours.cpp tmp_prev = tmp_prev->next = (CvLinkedRunPoint*)CV_GET_WRITTEN_ELEM( writer ); next 1428 modules/imgproc/src/contours.cpp lower_line = last_elem->next; next 1431 modules/imgproc/src/contours.cpp tmp_prev->next = 0; next 1443 modules/imgproc/src/contours.cpp if( upper_run->next->pt.x < lower_run->next->pt.x ) next 1445 modules/imgproc/src/contours.cpp if( upper_run->next->pt.x >= lower_run->pt.x -1 ) next 1449 modules/imgproc/src/contours.cpp prev_point = upper_run->next; next 1452 modules/imgproc/src/contours.cpp upper_run->next->link = upper_run; next 1454 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1458 modules/imgproc/src/contours.cpp if( upper_run->pt.x <= lower_run->next->pt.x +1 ) next 1462 modules/imgproc/src/contours.cpp prev_point = lower_run->next; next 1466 modules/imgproc/src/contours.cpp lower_run->link = lower_run->next; next 1471 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1475 modules/imgproc/src/contours.cpp if( upper_run->pt.x > lower_run->next->pt.x +1 ) next 1477 modules/imgproc/src/contours.cpp prev_point->link = lower_run->next; next 1480 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1485 modules/imgproc/src/contours.cpp if( upper_run->next->pt.x < lower_run->next->pt.x ) next 1488 modules/imgproc/src/contours.cpp prev_point = upper_run->next; next 1489 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1494 modules/imgproc/src/contours.cpp prev_point = lower_run->next; next 1496 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1501 modules/imgproc/src/contours.cpp if( lower_run->pt.x > upper_run->next->pt.x +1 ) next 1503 modules/imgproc/src/contours.cpp upper_run->next->link = prev_point; next 1506 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1514 modules/imgproc/src/contours.cpp if( lower_run->next->pt.x < upper_run->next->pt.x ) next 1517 modules/imgproc/src/contours.cpp prev_point = lower_run->next; next 1518 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1524 modules/imgproc/src/contours.cpp prev_point = upper_run->next; next 1525 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1536 modules/imgproc/src/contours.cpp prev_point->link = lower_run->next; next 1538 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1541 modules/imgproc/src/contours.cpp lower_run->link = lower_run->next; next 1546 modules/imgproc/src/contours.cpp lower_run = lower_run->next->next; next 1553 modules/imgproc/src/contours.cpp upper_run->next->link = prev_point; next 1555 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1558 modules/imgproc/src/contours.cpp upper_run->next->link = upper_run; next 1559 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 1570 modules/imgproc/src/contours.cpp upper_run->next->link = upper_run; next 1571 modules/imgproc/src/contours.cpp upper_run = upper_run->next->next; next 57 modules/imgproc/src/drawing.cpp PolyEdge *next; next 1299 modules/imgproc/src/drawing.cpp tmp.next = 0; next 1311 modules/imgproc/src/drawing.cpp last = tmp.next; next 1317 modules/imgproc/src/drawing.cpp prelast->next = last->next; next 1318 modules/imgproc/src/drawing.cpp last = last->next; next 1326 modules/imgproc/src/drawing.cpp last = last->next; next 1331 modules/imgproc/src/drawing.cpp prelast->next = e; next 1332 modules/imgproc/src/drawing.cpp e->next = last; next 1381 modules/imgproc/src/drawing.cpp last = tmp.next; next 1383 modules/imgproc/src/drawing.cpp while( last != keep_prelast && last->next != 0 ) next 1385 modules/imgproc/src/drawing.cpp PolyEdge *te = last->next; next 1390 modules/imgproc/src/drawing.cpp prelast->next = te; next 1391 modules/imgproc/src/drawing.cpp last->next = te->next; next 1392 modules/imgproc/src/drawing.cpp te->next = last; next 1404 modules/imgproc/src/drawing.cpp while( sort_flag && keep_prelast != tmp.next && keep_prelast != &tmp ); next 69 modules/imgproc/src/emd.cpp struct CvNode1D *next; next 77 modules/imgproc/src/emd.cpp struct CvNode2D *next[2]; /* next row & next column */ next 574 modules/imgproc/src/emd.cpp u0_head.next = u; next 577 modules/imgproc/src/emd.cpp u[i].next = u + i + 1; next 579 modules/imgproc/src/emd.cpp u[ssize - 1].next = 0; next 580 modules/imgproc/src/emd.cpp u1_head.next = 0; next 582 modules/imgproc/src/emd.cpp v0_head.next = ssize > 1 ? v + 1 : 0; next 585 modules/imgproc/src/emd.cpp v[i].next = v + i + 1; next 587 modules/imgproc/src/emd.cpp v[dsize - 1].next = 0; next 588 modules/imgproc/src/emd.cpp v1_head.next = 0; next 593 modules/imgproc/src/emd.cpp v1_head.next = v; next 594 modules/imgproc/src/emd.cpp v1_head.next->next = 0; next 606 modules/imgproc/src/emd.cpp for( found |= (cur_v = v1_head.next) != 0; cur_v != 0; cur_v = cur_v->next ) next 613 modules/imgproc/src/emd.cpp for( cur_u = u0_head.next; cur_u != 0; ) next 621 modules/imgproc/src/emd.cpp prev_u->next = cur_u->next; next 622 modules/imgproc/src/emd.cpp cur_u->next = u1_head.next; next 623 modules/imgproc/src/emd.cpp u1_head.next = cur_u; next 624 modules/imgproc/src/emd.cpp cur_u = prev_u->next; next 629 modules/imgproc/src/emd.cpp cur_u = cur_u->next; next 632 modules/imgproc/src/emd.cpp prev_v->next = cur_v->next; next 641 modules/imgproc/src/emd.cpp for( found |= (cur_u = u1_head.next) != 0; cur_u != 0; cur_u = cur_u->next ) next 652 modules/imgproc/src/emd.cpp for( cur_v = v0_head.next; cur_v != 0; ) next 660 modules/imgproc/src/emd.cpp prev_v->next = cur_v->next; next 661 modules/imgproc/src/emd.cpp cur_v->next = v1_head.next; next 662 modules/imgproc/src/emd.cpp v1_head.next = cur_v; next 663 modules/imgproc/src/emd.cpp cur_v = prev_v->next; next 668 modules/imgproc/src/emd.cpp cur_v = cur_v->next; next 671 modules/imgproc/src/emd.cpp prev_u->next = cur_u->next; next 739 modules/imgproc/src/emd.cpp enter_x->next[0] = state->rows_x[i]; next 740 modules/imgproc/src/emd.cpp enter_x->next[1] = state->cols_x[j]; next 778 modules/imgproc/src/emd.cpp head.next[0] = state->rows_x[i]; next 780 modules/imgproc/src/emd.cpp while( (next_x = cur_x->next[0]) != leave_x ) next 785 modules/imgproc/src/emd.cpp cur_x->next[0] = next_x->next[0]; next 786 modules/imgproc/src/emd.cpp state->rows_x[i] = head.next[0]; next 788 modules/imgproc/src/emd.cpp head.next[1] = state->cols_x[j]; next 790 modules/imgproc/src/emd.cpp while( (next_x = cur_x->next[1]) != leave_x ) next 795 modules/imgproc/src/emd.cpp cur_x->next[1] = next_x->next[1]; next 796 modules/imgproc/src/emd.cpp state->cols_x[j] = head.next[1]; next 831 modules/imgproc/src/emd.cpp new_x = new_x->next[0]; next 838 modules/imgproc/src/emd.cpp new_x = new_x->next[1]; next 858 modules/imgproc/src/emd.cpp new_x = new_x->next[i]; next 899 modules/imgproc/src/emd.cpp u_head.next = u; next 902 modules/imgproc/src/emd.cpp u[i].next = u + i + 1; next 904 modules/imgproc/src/emd.cpp u[ssize - 1].next = 0; next 906 modules/imgproc/src/emd.cpp v_head.next = v; next 910 modules/imgproc/src/emd.cpp v[i].next = v + i + 1; next 912 modules/imgproc/src/emd.cpp v[dsize - 1].next = 0; next 952 modules/imgproc/src/emd.cpp for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next ) next 958 modules/imgproc/src/emd.cpp for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next ) next 978 modules/imgproc/src/emd.cpp remember = prev_u_min_i->next; next 982 modules/imgproc/src/emd.cpp if( remember == prev_u_min_i->next ) /* line min_i was deleted */ next 984 modules/imgproc/src/emd.cpp for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next ) next 992 modules/imgproc/src/emd.cpp for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next ) next 1005 modules/imgproc/src/emd.cpp for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next ) next 1013 modules/imgproc/src/emd.cpp for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next ) next 1021 modules/imgproc/src/emd.cpp for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next ) next 1035 modules/imgproc/src/emd.cpp for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next ) next 1042 modules/imgproc/src/emd.cpp while( u_head.next != 0 || v_head.next != 0 ); next 1077 modules/imgproc/src/emd.cpp end_x->next[0] = state->rows_x[min_i]; next 1078 modules/imgproc/src/emd.cpp end_x->next[1] = state->cols_x[min_j]; next 1084 modules/imgproc/src/emd.cpp if( state->s[min_i] == 0 && u_head->next->next != 0 ) next 1085 modules/imgproc/src/emd.cpp prev_u_min_i->next = prev_u_min_i->next->next; /* remove row from list */ next 1087 modules/imgproc/src/emd.cpp prev_v_min_j->next = prev_v_min_j->next->next; /* remove column from list */ next 61 modules/imgproc/src/gcgraph.hpp Vtx *next; // initialized and used in maxFlow() only next 73 modules/imgproc/src/gcgraph.hpp int next; next 126 modules/imgproc/src/gcgraph.hpp fromI.next = vtcs[i].first; next 132 modules/imgproc/src/gcgraph.hpp toI.next = vtcs[j].first; next 158 modules/imgproc/src/gcgraph.hpp stub.next = nilNode; next 171 modules/imgproc/src/gcgraph.hpp last = last->next = v; next 179 modules/imgproc/src/gcgraph.hpp first = first->next; next 180 modules/imgproc/src/gcgraph.hpp last->next = nilNode; next 181 modules/imgproc/src/gcgraph.hpp nilNode->next = 0; next 198 modules/imgproc/src/gcgraph.hpp for( ei = v->first; ei != 0; ei = edgePtr[ei].next ) next 209 modules/imgproc/src/gcgraph.hpp if( !u->next ) next 211 modules/imgproc/src/gcgraph.hpp u->next = nilNode; next 212 modules/imgproc/src/gcgraph.hpp last = last->next = u; next 235 modules/imgproc/src/gcgraph.hpp first = first->next; next 236 modules/imgproc/src/gcgraph.hpp v->next = 0; next 300 modules/imgproc/src/gcgraph.hpp for( ei = v2->first; ei != 0; ei = edgePtr[ei].next ) next 356 modules/imgproc/src/gcgraph.hpp for( ei = v2->first; ei != 0; ei = edgePtr[ei].next ) next 362 modules/imgproc/src/gcgraph.hpp if( edgePtr[ei^(vt^1)].weight && !u->next ) next 364 modules/imgproc/src/gcgraph.hpp u->next = nilNode; next 365 modules/imgproc/src/gcgraph.hpp last = last->next = u; next 270 modules/imgproc/src/lsd.cpp struct coorlist* next; next 607 modules/imgproc/src/lsd.cpp range_e[i]->next = &list[count]; next 612 modules/imgproc/src/lsd.cpp range_e[i]->next = 0; next 628 modules/imgproc/src/lsd.cpp end->next = range_s[idx]; next 54 modules/imgproc/src/segmentation.cpp int next; next 76 modules/imgproc/src/segmentation.cpp storage[0].next = 0; next 80 modules/imgproc/src/segmentation.cpp storage[i].next = i+1; next 81 modules/imgproc/src/segmentation.cpp storage[newsz-1].next = 0; next 124 modules/imgproc/src/segmentation.cpp free_node = storage[free_node].next;\ next 125 modules/imgproc/src/segmentation.cpp storage[node].next = 0; \ next 129 modules/imgproc/src/segmentation.cpp storage[q[idx].last].next=node; \ next 139 modules/imgproc/src/segmentation.cpp q[idx].first = storage[node].next; \ next 140 modules/imgproc/src/segmentation.cpp if( !storage[node].next ) \ next 142 modules/imgproc/src/segmentation.cpp storage[node].next = free_node; \ next 49 modules/imgproc/src/subdivision2d.cpp return qedges[edge >> 2].next[edge & 3]; next 65 modules/imgproc/src/subdivision2d.cpp edge = qedges[edge >> 2].next[(edge + nextEdgeType) & 3]; next 124 modules/imgproc/src/subdivision2d.cpp next[0] = next[1] = next[2] = next[3] = 0; next 131 modules/imgproc/src/subdivision2d.cpp next[0] = edgeidx; next 132 modules/imgproc/src/subdivision2d.cpp next[1] = edgeidx+3; next 133 modules/imgproc/src/subdivision2d.cpp next[2] = edgeidx+2; next 134 modules/imgproc/src/subdivision2d.cpp next[3] = edgeidx+1; next 141 modules/imgproc/src/subdivision2d.cpp return next[0] <= 0; next 169 modules/imgproc/src/subdivision2d.cpp int& a_next = qedges[edgeA >> 2].next[edgeA & 3]; next 170 modules/imgproc/src/subdivision2d.cpp int& b_next = qedges[edgeB >> 2].next[edgeB & 3]; next 173 modules/imgproc/src/subdivision2d.cpp int& a_rot_next = qedges[a_rot >> 2].next[a_rot & 3]; next 174 modules/imgproc/src/subdivision2d.cpp int& b_rot_next = qedges[b_rot >> 2].next[b_rot & 3]; next 236 modules/imgproc/src/subdivision2d.cpp freeQEdge = qedges[edge >> 2].next[1]; next 249 modules/imgproc/src/subdivision2d.cpp qedges[edge].next[0] = 0; next 250 modules/imgproc/src/subdivision2d.cpp qedges[edge].next[1] = freeQEdge; next 105 modules/imgproc/test/test_boundingrect.cpp int n = rng.next()%MAX_COUNT_OF_POINTS + 1; next 609 modules/imgproc/test/test_color.cpp bool full_hrange = (rng.next() & 256) != 0; next 1900 modules/imgproc/test/test_color.cpp bool next = true; next 1902 modules/imgproc/test/test_color.cpp for (int y = 0; y < ssize.height && next; ++y) next 1906 modules/imgproc/test/test_color.cpp for (int x = 0; x < ssize.width && next; ++x) next 1909 modules/imgproc/test/test_color.cpp next = false; next 2049 modules/imgproc/test/test_color.cpp bool& next, const char* bayer_type) next 2059 modules/imgproc/test/test_color.cpp for (int y = 0; y < size.height && next; ++y) next 2064 modules/imgproc/test/test_color.cpp for (int x = 0; x < size.width && next; ++x) next 2083 modules/imgproc/test/test_color.cpp next = false; next 2113 modules/imgproc/test/test_color.cpp bool next = true; next 2115 modules/imgproc/test/test_color.cpp for (int i = 0; i < 4 && next; ++i) next 2132 modules/imgproc/test/test_color.cpp checkData<unsigned char>(actual, reference, ts, types[i], next, "CV_8U"); next 2137 modules/imgproc/test/test_color.cpp checkData<unsigned short int>(actual, tmp, ts, types[i], next, "CV_16U"); next 2168 modules/imgproc/test/test_color.cpp bool next = true; next 2169 modules/imgproc/test/test_color.cpp for (int y = 0; y < ssize.height && next; ++y) next 2173 modules/imgproc/test/test_color.cpp for (int x = 0; x < ssize.width && next; ++x) next 2176 modules/imgproc/test/test_color.cpp next = false; next 1509 modules/imgproc/test/test_imgwarp.cpp bool next = true; next 1510 modules/imgproc/test/test_imgwarp.cpp for (int dy = 0; dy < dsize.height && next; ++dy) next 1515 modules/imgproc/test/test_imgwarp.cpp for (int dx = 0; dx < dsize.width && next; ++dx) next 1529 modules/imgproc/test/test_imgwarp.cpp next = false; next 2179 modules/java/generator/src/cpp/Mat.cpp for(const char* str = fmtd->next(); str; str = fmtd->next()) next 1049 modules/ml/include/opencv2/ml.hpp int next; //!< Index of the next split in the list of splits for the node next 246 modules/ml/src/precomp.hpp varIdx = next = 0; next 255 modules/ml/src/precomp.hpp int next; next 451 modules/ml/src/svm.cpp KernelRow() { idx = -1; prev = next = 0; } next 455 modules/ml/src/svm.cpp int next; next 549 modules/ml/src/svm.cpp lru_cache[last.prev].next = 0; next 552 modules/ml/src/svm.cpp last.next = 0; next 559 modules/ml/src/svm.cpp if( kr.next ) next 560 modules/ml/src/svm.cpp lru_cache[kr.next].prev = kr.prev; next 564 modules/ml/src/svm.cpp lru_cache[kr.prev].next = kr.next; next 566 modules/ml/src/svm.cpp lru_first = kr.next; next 570 modules/ml/src/svm.cpp kr.next = lru_first; next 93 modules/ml/src/tree.cpp next = -1; next 681 modules/ml/src/tree.cpp int next = sorted_idx[i+1]; next 691 modules/ml/src/tree.cpp if( values[curr] + epsilon < values[next] ) next 1017 modules/ml/src/tree.cpp int next = sorted_idx[i+1]; next 1024 modules/ml/src/tree.cpp if( values[curr] + epsilon < values[next] ) next 1640 modules/ml/src/tree.cpp for( int splitidx = node.split; splitidx >= 0; splitidx = splits[splitidx].next ) next 1886 modules/ml/src/tree.cpp splits[prevsplit].next = splitidx; next 273 modules/ml/test/test_emknearestkmeans.cpp bestLabels.at<int>( rng.next() % pointsCount, 0 ) = rng.next() % 3; next 99 modules/objdetect/include/opencv2/objdetect/objdetect_c.h int next; next 47 modules/objdetect/perf/opencl/perf_cascades.cpp while(next()) next 110 modules/objdetect/src/haar.cpp struct CvHidHaarStageClassifier* next; next 297 modules/objdetect/src/haar.cpp hid_stage_classifier->next = (stage_classifier->next == -1) next 298 modules/objdetect/src/haar.cpp ? NULL : out->stage_classifier + stage_classifier->next; next 302 modules/objdetect/src/haar.cpp out->is_tree |= hid_stage_classifier->next != NULL; next 894 modules/objdetect/src/haar.cpp while( ptr && ptr->next == NULL ) ptr = ptr->parent; next 897 modules/objdetect/src/haar.cpp ptr = ptr->next; next 1837 modules/objdetect/src/haar.cpp int next = -1; next 1913 modules/objdetect/src/haar.cpp if( sscanf( stage, "%d%d%n", &parent, &next, &dl ) != 2 ) next 1916 modules/objdetect/src/haar.cpp next = -1; next 1921 modules/objdetect/src/haar.cpp cascade->stage_classifier[i].next = next; next 2062 modules/objdetect/src/haar.cpp int parent, next; next 2358 modules/objdetect/src/haar.cpp next = -1; next 2375 modules/objdetect/src/haar.cpp next = fn->data.i; next 2378 modules/objdetect/src/haar.cpp cascade->stage_classifier[i].next = next; next 2490 modules/objdetect/src/haar.cpp cvWriteInt( fs, ICV_HAAR_NEXT_NAME, cascade->stage_classifier[i].next ); next 2515 modules/objdetect/src/haar.cpp cascade->stage_classifier[i].next = cascade_src->stage_classifier[i].next; next 75 modules/photo/src/inpaint.cpp struct CvHeapElem* next; next 102 modules/photo/src/inpaint.cpp head->next = mem+1; next 107 modules/photo/src/inpaint.cpp mem[i].next = mem+i+1; next 114 modules/photo/src/inpaint.cpp tail->next = NULL; next 136 modules/photo/src/inpaint.cpp add->prev->next = add->next; next 137 modules/photo/src/inpaint.cpp add->next->prev = add->prev; next 138 modules/photo/src/inpaint.cpp empty = add->next; next 140 modules/photo/src/inpaint.cpp add->next = tmp; next 141 modules/photo/src/inpaint.cpp add->prev->next = add; next 142 modules/photo/src/inpaint.cpp add->next->prev = add; next 144 modules/photo/src/inpaint.cpp empty = empty->next; next 155 modules/photo/src/inpaint.cpp CvHeapElem *tmp=head->next; next 159 modules/photo/src/inpaint.cpp tmp->prev->next = tmp->next; next 160 modules/photo/src/inpaint.cpp tmp->next->prev = tmp->prev; next 162 modules/photo/src/inpaint.cpp tmp->next = empty; next 163 modules/photo/src/inpaint.cpp tmp->prev->next = tmp; next 164 modules/photo/src/inpaint.cpp tmp->next->prev = tmp; next 172 modules/photo/src/inpaint.cpp CvHeapElem *tmp=head->next; next 177 modules/photo/src/inpaint.cpp tmp->prev->next = tmp->next; next 178 modules/photo/src/inpaint.cpp tmp->next->prev = tmp->prev; next 180 modules/photo/src/inpaint.cpp tmp->next = empty; next 181 modules/photo/src/inpaint.cpp tmp->prev->next = tmp; next 182 modules/photo/src/inpaint.cpp tmp->next->prev = tmp; next 48 modules/stitching/perf/opencl/perf_stitch.cpp while(next()) next 85 modules/stitching/perf/opencl/perf_stitch.cpp while(next()) next 127 modules/stitching/perf/opencl/perf_stitch.cpp while(next()) next 46 modules/stitching/perf/perf_stich.cpp while(next()) next 83 modules/stitching/perf/perf_stich.cpp while(next()) next 137 modules/stitching/perf/perf_stich.cpp while(next()) next 196 modules/stitching/perf/perf_stich.cpp while(next()) next 63 modules/stitching/src/util.cpp int next; next 66 modules/stitching/src/util.cpp next = parent[elem]; next 68 modules/stitching/src/util.cpp elem = next; next 100 modules/ts/include/opencv2/ts/ocl_perf.hpp for (cvtest::ocl::perf::safeFinish(); startTimer(), next(); cvtest::ocl::perf::safeFinish(), stopTimer()) next 103 modules/ts/include/opencv2/ts/ocl_perf.hpp for(declare.iterations(n), cvtest::ocl::perf::safeFinish(); startTimer(), next(); cvtest::ocl::perf::safeFinish(), stopTimer()) next 106 modules/ts/include/opencv2/ts/ocl_perf.hpp for (declare.runs(runsNum), cvtest::ocl::perf::safeFinish(); startTimer(), next(); cvtest::ocl::perf::safeFinish(), stopTimer()) \ next 249 modules/ts/include/opencv2/ts/ocl_test.hpp RNG dataRng(rng.next()); next 382 modules/ts/include/opencv2/ts/ts_perf.hpp bool next(); next 646 modules/ts/include/opencv2/ts/ts_perf.hpp #define TEST_CYCLE_N(n) for(declare.iterations(n); startTimer(), next(); stopTimer()) next 647 modules/ts/include/opencv2/ts/ts_perf.hpp #define TEST_CYCLE() for(; startTimer(), next(); stopTimer()) next 648 modules/ts/include/opencv2/ts/ts_perf.hpp #define TEST_CYCLE_MULTIRUN(runsNum) for(declare.runs(runsNum); startTimer(), next(); stopTimer()) for(int r = 0; r < runsNum; ++r) next 961 modules/ts/src/ts_perf.cpp for(declare.iterations(20); startTimer(), next(); stopTimer()) next 967 modules/ts/src/ts_perf.cpp for(declare.iterations(1000); startTimer(), next(); stopTimer()){} next 218 modules/video/include/opencv2/video/tracking.hpp CV_EXPORTS_W void calcOpticalFlowFarneback( InputArray prev, InputArray next, InputOutputArray flow, next 102 modules/video/include/opencv2/video/tracking_c.h CVAPI(void) cvCalcOpticalFlowFarneback( const CvArr* prev, const CvArr* next, next 296 modules/video/src/compat_video.cpp cv::Mat prev = cv::cvarrToMat(_prev), next = cv::cvarrToMat(_next); next 299 modules/video/src/compat_video.cpp cv::calcOpticalFlowFarneback( prev, next, flow, pyr_scale, levels, next 232 modules/video/test/test_optflowpyrlk.cpp std::vector<cv::Point2f> next; next 244 modules/video/test/test_optflowpyrlk.cpp ASSERT_NO_THROW(cv::calcOpticalFlowPyrLK(img1, img2, prev, next, status, error)); next 1910 modules/videoio/src/cap_msmf.hpp Node *next; next 1961 modules/videoio/src/cap_msmf.hpp return m_anchor.next; next 1982 modules/videoio/src/cap_msmf.hpp Node *pAfter = pBefore->next; next 1984 modules/videoio/src/cap_msmf.hpp pBefore->next = pNode; next 1988 modules/videoio/src/cap_msmf.hpp pNode->next = pAfter; next 2026 modules/videoio/src/cap_msmf.hpp pNode->next->prev = pNode->prev; next 2029 modules/videoio/src/cap_msmf.hpp pNode->prev->next = pNode->next; next 2048 modules/videoio/src/cap_msmf.hpp m_anchor.next = &m_anchor; next 2149 modules/videoio/src/cap_msmf.hpp Node *n = m_anchor.next; next 2156 modules/videoio/src/cap_msmf.hpp Node *tmp = n->next; next 2162 modules/videoio/src/cap_msmf.hpp m_anchor.next = &m_anchor; next 2209 modules/videoio/src/cap_msmf.hpp if (pos.pNode && (pos.pNode->next != &m_anchor)) next 2211 modules/videoio/src/cap_msmf.hpp return POSITION(pos.pNode->next); next 356 modules/videoio/test/test_ffmpeg.cpp for (unsigned int i = 0; i < frameCount && next; ++i) next 384 modules/videoio/test/test_ffmpeg.cpp next = false; next 390 modules/videoio/test/test_ffmpeg.cpp static bool next; next 397 modules/videoio/test/test_ffmpeg.cpp bool ReadImageAndTest::next; next 423 modules/videoio/test/test_ffmpeg.cpp ReadImageAndTest::next = true; next 38 platforms/android/service/engine/src/org/opencv/engine/OpenCVEngineService.java eventType = p.next(); next 87 samples/android/color-blob-detection/src/org/opencv/samples/colorblobdetect/ColorBlobDetector.java MatOfPoint wrapper = each.next(); next 97 samples/android/color-blob-detection/src/org/opencv/samples/colorblobdetect/ColorBlobDetector.java MatOfPoint contour = each.next(); next 131 samples/android/tutorial-3-cameracontrol/src/org/opencv/samples/tutorial3/Tutorial3Activity.java String element = effectItr.next(); next 143 samples/android/tutorial-3-cameracontrol/src/org/opencv/samples/tutorial3/Tutorial3Activity.java Size element = resolutionItr.next(); next 73 samples/cpp/tutorial_code/core/mat_mask_operations/mat_mask_operations.cpp const uchar* next = myImage.ptr<uchar>(j + 1); next 80 samples/cpp/tutorial_code/core/mat_mask_operations/mat_mask_operations.cpp -current[i-nChannels] - current[i+nChannels] - previous[i] - next[i]); next 53 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *next; next 56 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node() : prev(nullptr), next(nullptr) next 60 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node(T item) : prev(nullptr), next(nullptr) next 104 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h return m_anchor.next; next 125 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *pAfter = pBefore->next; next 127 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h pBefore->next = pNode; next 131 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h pNode->next = pAfter; next 169 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h pNode->next->prev = pNode->prev; next 172 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h pNode->prev->next = pNode->next; next 191 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h m_anchor.next = &m_anchor; next 292 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *n = m_anchor.next; next 299 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *tmp = n->next; next 305 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h m_anchor.next = &m_anchor; next 352 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h if (pos.pNode && (pos.pNode->next != &m_anchor)) next 354 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h return POSITION(pos.pNode->next);