Searched refs:nEndOfs (Results 1 – 3 of 3) sorted by relevance
1573 int nEndOfs = 0; in seekIndexEnd() local1576 case 1: nEndOfs = mpReadPtr[0]; break; in seekIndexEnd()1577 case 2: nEndOfs = (mpReadPtr[0]<<8) + mpReadPtr[1]; break; in seekIndexEnd()1578 case 3: nEndOfs = (mpReadPtr[0]<<16) + (mpReadPtr[1]<<8) + mpReadPtr[2];break; in seekIndexEnd()1579 …case 4: nEndOfs = (mpReadPtr[0]<<24) + (mpReadPtr[1]<<16) + (mpReadPtr[2]<<8) + mpReadPtr[3]; brea… in seekIndexEnd()1582 mpReadPtr += nEndOfs - 1; in seekIndexEnd()1584 assert( nEndOfs >= 0); in seekIndexEnd()
2125 sal_uInt16 nEndOfs = 1; in Summary() local2130 while( ( nWish || bKeep ) && nIndex + nEndOfs < nNextOutNd && in Summary()2131 GetNodes()[ nIndex + nEndOfs ]->IsTxtNode() ) in Summary()2133 SwTxtNode* pTxtNode = (SwTxtNode*)GetNodes()[ nIndex+nEndOfs ]; in Summary()2137 ++nEndOfs; in Summary()2140 SwNodeRange aRange( *rOutNds[ i ], 0, *rOutNds[ i ], nEndOfs ); in Summary()
791 int nEndOfs = pRegexMatcher->end( nIcuErr); in RESrchFrwrd() local792 if( nStartOfs < nEndOfs) in RESrchFrwrd()
Completed in 44 milliseconds