Searched refs:ncut (Results 1 – 2 of 2) sorted by relevance
28 Index QuickSplit(VectorV &row, VectorI &ind, Index ncut) in QuickSplit() argument37 ncut--; /* to fit the zero-based indices */ in QuickSplit()40 if (ncut < first || ncut > last ) return 0; in QuickSplit()56 if (mid > ncut) last = mid - 1; in QuickSplit()57 else if (mid < ncut ) first = mid + 1; in QuickSplit()58 } while (mid != ncut ); in QuickSplit()
39 void sortWithPermutation (VectorType& vec, IndexType& perm, typename IndexType::Scalar& ncut)45 for (Index k = 0; k < ncut; k++)