Lines Matching full:queryidx
132 for (int queryIdx = 0; queryIdx < nQuery; ++queryIdx, ++trainIdx_ptr, ++distance_ptr)
141 DMatch m(queryIdx, trainIndex, 0, dst);
236 for (int queryIdx = 0; queryIdx < nQuery; ++queryIdx)
250 DMatch m(queryIdx, trainIndex, 0, dst);
348 for (int queryIdx = 0; queryIdx < nQuery; ++queryIdx)
350 const int *trainIdx_ptr = trainIdx.ptr<int>(queryIdx);
351 const float *distance_ptr = distance.ptr<float>(queryIdx);
353 const int nMatches = std::min(nMatches_ptr[queryIdx], trainIdx.cols);
371 DMatch m(queryIdx, trainIndex, 0, dst);
654 bool DescriptorMatcher::isPossibleMatch( InputArray _mask, int queryIdx, int trainIdx )
657 return mask.empty() || mask.at<uchar>(queryIdx, trainIdx);
660 bool DescriptorMatcher::isMaskedOut( InputArrayOfArrays _masks, int queryIdx )
668 if( !masks[i].empty() && (countNonZero(masks[i].row(queryIdx)) == 0) )
