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