HomeSort by relevance Sort by last modified time
    Searched refs:cur_ofs (Results 1 - 3 of 3) sorted by null

  /external/opencv3/apps/traincascade/
old_ml_tree.cpp 752 int* co, cur_ofs = 0; local
768 co[i*2+1] = cur_ofs;
769 cur_ofs += co[i*2];
831 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
832 udst_idx[j] = (unsigned short)cur_ofs;
842 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
843 udst_idx[j] = (unsigned short)cur_ofs;
855 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++
910 int i, vi, total = sample_count, count = total, cur_ofs = 0; local
    [all...]
boost.cpp 397 int* co, cur_ofs = 0; local
412 co[i*2+1] = cur_ofs;
413 cur_ofs += co[i*2];
446 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
447 udst_idx[j] = (unsigned short)cur_ofs;
459 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
460 idst_idx[j] = cur_ofs;
    [all...]
  /external/opencv/ml/src/
mltree.cpp 584 int* co, cur_ofs = 0; local
599 co[i*2+1] = cur_ofs;
600 cur_ofs += co[i*2];
640 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
643 dst[j].i = cur_ofs;
657 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
660 dst[j].i = cur_ofs;
688 int i, vi, total = sample_count, count = total, cur_ofs = 0 local
    [all...]

Completed in 2527 milliseconds