Lines Matching refs:idx
669 int idx = 0;
672 CvHidHaarTreeNode* node = classifier->node + idx;
681 idx = sum < t ? node->left : node->right;
683 while( idx > 0 );
684 return classifier->alpha[-idx];
1278 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1279 assert( (unsigned)idx < (unsigned)ncomp );
1281 comps[idx].neighbors++;
1282 comps[idx].rect.x += r1.x;
1283 comps[idx].rect.y += r1.y;
1284 comps[idx].rect.width += r1.width;
1285 comps[idx].rect.height += r1.height;
1314 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1315 assert( (unsigned)idx < (unsigned)ncomp );
1317 comps[idx].neighbors++;
1320 comps[idx].rect.x = MIN(comps[idx].rect.x, r1.x);
1321 comps[idx].rect.y = MIN(comps[idx].rect.y, r1.y);
1322 comps[idx].rect.width = MAX(comps[idx].rect.width, r1.x+r1.width-1);
1323 comps[idx].rect.height = MAX(comps[idx].rect.height, r1.y+r1.height-1);
1436 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1437 assert( (unsigned)idx < (unsigned)ncomp );
1439 comps[idx].neighbors++;
1441 comps[idx].rect.x += r1.x;
1442 comps[idx].rect.y += r1.y;
1443 comps[idx].rect.width += r1.width;
1444 comps[idx].rect.height += r1.height;
