Lines Matching refs:rPositions
435 const Positions_t& rPositions, in FillBoundary() argument
438 rBound.startPos = rPositions[nPos]; in FillBoundary()
439 rBound.endPos = rPositions[nPos+1]; in FillBoundary()
444 const Positions_t& rPositions, in FindBreak() argument
447 DBG_ASSERT( rPositions.size() >= 2, "need min + max value" ); in FindBreak()
448 DBG_ASSERT( rPositions[0] <= nValue, "need min value" ); in FindBreak()
449 DBG_ASSERT( rPositions[rPositions.size()-1] >= nValue, in FindBreak()
451 DBG_ASSERT( rPositions[rPositions.size()-2] >= nValue, in FindBreak()
455 size_t nMax = rPositions.size()-2; in FindBreak()
461 DBG_ASSERT( ( (nMin == 0) && (rPositions[nMin] <= nValue) ) || in FindBreak()
462 ( (nMin != 0) && (rPositions[nMin] < nValue) ), in FindBreak()
464 DBG_ASSERT( nValue <= rPositions[nMax], "max value not maximal" ); in FindBreak()
472 DBG_ASSERT( rPositions[nMin] <= rPositions[nMiddle], in FindBreak()
474 DBG_ASSERT( rPositions[nMiddle] <= rPositions[nMax], in FindBreak()
477 if( nValue > rPositions[nMiddle] ) in FindBreak()
485 if( (rPositions[nMin] < nValue) && (rPositions[nMin+1] <= nValue) ) in FindBreak()
489 DBG_ASSERT( rPositions[nMin] <= nValue, "not smaller or equal" ); in FindBreak()
490 DBG_ASSERT( nValue <= rPositions[nMin+1], "not equal or larger" ); in FindBreak()
491 DBG_ASSERT( (nMin == 0) || (rPositions[nMin-1] <= nValue), in FindBreak()
494 DBG_ASSERT( nMin < rPositions.size()-1, in FindBreak()
501 const Positions_t& rPositions, in FindLastBreak() argument
504 size_t nResult = FindBreak( rPositions, nValue ); in FindLastBreak()
510 while ( nResult < rPositions.size() - 2 && in FindLastBreak()
511 rPositions[nResult+1] <= nValue ) in FindLastBreak()