Lines Matching refs:pArrPtr
374 _SwSrchChrAttr* pArrPtr; in SetAttrFwd() local
376 for( pArrPtr = pFndArr, n = 0; n < nArrLen; in SetAttrFwd()
377 ++n, ++pArrPtr ) in SetAttrFwd()
378 if( pArrPtr->nWhich && pArrPtr->nEnd <= aTmp.nStt ) in SetAttrFwd()
380 pArrPtr->nWhich = 0; // geloescht in SetAttrFwd()
389 for( pArrPtr = pStackArr, n=0; n < nArrLen; ++n, ++pArrPtr ) in SetAttrFwd()
391 if( !pArrPtr->nWhich ) in SetAttrFwd()
394 if( pArrPtr->nEnd <= aTmp.nStt ) in SetAttrFwd()
396 pArrPtr->nWhich = 0; // geloescht in SetAttrFwd()
400 else if( pArrPtr->nStt <= aTmp.nStt ) in SetAttrFwd()
404 if( pCmp->nEnd < pArrPtr->nEnd ) // erweitern in SetAttrFwd()
405 pCmp->nEnd = pArrPtr->nEnd; in SetAttrFwd()
409 *pCmp = *pArrPtr; in SetAttrFwd()
412 pArrPtr->nWhich = 0; in SetAttrFwd()
536 _SwSrchChrAttr* pArrPtr; in SetAttrBwd() local
538 for( pArrPtr = pFndArr, n = 0; n < nArrLen; ++n, ++pArrPtr ) in SetAttrBwd()
539 if( pArrPtr->nWhich && pArrPtr->nStt >= aTmp.nEnd ) in SetAttrBwd()
541 pArrPtr->nWhich = 0; // geloescht in SetAttrBwd()
550 for( pArrPtr = pStackArr, n = 0; n < nArrLen; ++n, ++pArrPtr ) in SetAttrBwd()
552 if( !pArrPtr->nWhich ) in SetAttrBwd()
555 if( pArrPtr->nStt >= aTmp.nEnd ) in SetAttrBwd()
557 pArrPtr->nWhich = 0; // geloescht in SetAttrBwd()
561 else if( pArrPtr->nEnd >= aTmp.nEnd ) in SetAttrBwd()
565 if( pCmp->nStt > pArrPtr->nStt ) // erweitern in SetAttrBwd()
566 pCmp->nStt = pArrPtr->nStt; in SetAttrBwd()
570 *pCmp = *pArrPtr; in SetAttrBwd()
573 pArrPtr->nWhich = 0; in SetAttrBwd()
651 _SwSrchChrAttr* pArrPtr = pFndArr; in Start() local
652 for( sal_uInt16 n = 0; n < nArrLen; ++n, ++pArrPtr ) in Start()
653 if( pArrPtr->nWhich && pArrPtr->nStt > nStart ) in Start()
654 nStart = pArrPtr->nStt; in Start()
662 _SwSrchChrAttr* pArrPtr = pFndArr; in End() local
664 for( sal_uInt16 n = 0; n < nArrLen; ++n, ++pArrPtr ) in End()
665 if( pArrPtr->nWhich && pArrPtr->nEnd < nEnd ) in End()
666 nEnd = pArrPtr->nEnd; in End()
679 _SwSrchChrAttr* pArrPtr; in CheckStack() local
680 for( pArrPtr = pStackArr, n = 0; n < nArrLen; ++n, ++pArrPtr ) in CheckStack()
682 if( !pArrPtr->nWhich ) in CheckStack()
685 if( bForward ? pArrPtr->nEnd <= nSttPos : pArrPtr->nStt >= nEndPos ) in CheckStack()
687 pArrPtr->nWhich = 0; // geloescht in CheckStack()
691 else if( bForward ? pArrPtr->nStt < nEndPos : pArrPtr->nEnd > nSttPos ) in CheckStack()
696 pFndArr[ n ] = *pArrPtr; in CheckStack()
697 pArrPtr->nWhich = 0; in CheckStack()