Lines Matching refs:idx
407 int idx = 0;
410 MyCvHidHaarTreeNode* node = classifier->node + idx;
419 idx = sum < t ? node->left : node->right;
421 while( idx > 0 );
422 return classifier->alpha[-idx];
1310 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1311 assert( (unsigned)idx < (unsigned)ncomp );
1313 comps[idx].neighbors++;
1314 comps[idx].rect.x += r1.x;
1315 comps[idx].rect.y += r1.y;
1316 comps[idx].rect.width += r1.width;
1317 comps[idx].rect.height += r1.height;
1346 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1347 assert( (unsigned)idx < (unsigned)ncomp );
1349 comps[idx].neighbors++;
1352 comps[idx].rect.x = MIN(comps[idx].rect.x, r1.x);
1353 comps[idx].rect.y = MIN(comps[idx].rect.y, r1.y);
1354 comps[idx].rect.width = MAX(comps[idx].rect.width, r1.x+r1.width-1);
1355 comps[idx].rect.height = MAX(comps[idx].rect.height, r1.y+r1.height-1);
1472 int idx = *(int*)cvGetSeqElem( idx_seq, i );
1473 assert( (unsigned)idx < (unsigned)ncomp );
1475 comps[idx].neighbors++;
1477 comps[idx].rect.x += r1.x;
1478 comps[idx].rect.y += r1.y;
1479 comps[idx].rect.width += r1.width;
1480 comps[idx].rect.height += r1.height;
