Lines Matching refs:GetIndex
150 const SwNode* pPrevInsNd = rNds[ rInsPos.GetIndex() -1 ]; in ChgNode()
159 sal_uLong nNd = rInsPos.GetIndex(); in ChgNode()
161 rNds.GetEndOfRedlines().StartOfSectionNode()->GetIndex() < nNd && in ChgNode()
162 nNd < rNds.GetEndOfRedlines().GetIndex() ); in ChgNode()
168 sal_uInt16 nDiff = rDelPos.GetIndex() < rInsPos.GetIndex() ? 0 : 1; in ChgNode()
170 for( sal_uLong n = rDelPos.GetIndex(); nSz; n += nDiff, --nSz ) in ChgNode()
194 BigPtrArray::Move( aDelIdx.GetIndex(), rInsPos.GetIndex() ); in ChgNode()
273 RemoveNode( rDelPos.GetIndex(), 1, sal_False ); // Indizies verschieben !! in ChgNode()
404 rNds[ rInsPos.GetIndex() - 1 ] ); in ChgNode()
406 if( !pFrmNd && aFrmNdIdx > rNds.GetEndOfExtras().GetIndex() ) in ChgNode()
493 if( ( aIndex.GetIndex()-1 >= aRg.aStart.GetIndex() && in _MoveNodes()
494 aIndex.GetIndex()-1 < aRg.aEnd.GetIndex()) || in _MoveNodes()
495 ( aIndex.GetIndex()-1 == aRg.aEnd.GetIndex() ) ) in _MoveNodes()
537 if (aNodeIndex < aRg.aStart.GetIndex()) in _MoveNodes()
567 nInsPos = (aRg.aEnd.GetIndex() - in _MoveNodes()
568 pSttNd->GetIndex() )+1; in _MoveNodes()
572 sal_uLong nNd = aIdx.GetIndex(); in _MoveNodes()
574 StartOfSectionNode()->GetIndex() < nNd && in _MoveNodes()
575 nNd < rNodes.GetEndOfRedlines().GetIndex() ); in _MoveNodes()
612 BigPtrArray::Move( aMvIdx.GetIndex(), aIdx.GetIndex() ); in _MoveNodes()
652 RemoveNode( aMvIdx.GetIndex(), 1, sal_False ); in _MoveNodes()
701 else if( pSttNd->GetIndex() < aRg.aStart.GetIndex() ) in _MoveNodes()
754 RemoveNode( aRg.aEnd.GetIndex(), 1, sal_False ); // EndNode loeschen in _MoveNodes()
755 sal_uLong nSttPos = pSttNd->GetIndex(); in _MoveNodes()
875 RemoveNode( aRg.aEnd.GetIndex(), 1, sal_True ); in _MoveNodes()
890 SwNode* pTmpNode = (*this)[ aRg.aEnd.GetIndex()+1 ]->GetEndNode(); in _MoveNodes()
983 aRg.aEnd.GetIndex() >= aOrigInsPos.aStart.GetIndex() ) in _MoveNodes()
1155 RemoveNode( pRange->aStart.GetIndex(), 1, sal_True ); in SectionUp()
1156 RemoveNode( pRange->aEnd.GetIndex(), 1, sal_True ); in SectionUp()
1172 else if( aIdx == pRange->aStart.GetIndex()-1 ) // vor StartNode in SectionUp()
1291 sal_uLong nCnt = Count() - rIndex.GetIndex() - 1; in Delete()
1300 !aRg.aStart.GetIndex() ) || in Delete()
1329 if( pAktNode->StartOfSectionIndex() > aRg.aStart.GetIndex() ) in Delete()
1364 RemoveNode( aRg.aEnd.GetIndex()+1, nCnt, sal_True ); // loesche in Delete()
1378 RemoveNode( aRg.aEnd.GetIndex(), nCnt, sal_True ); in Delete()
1384 RemoveNode( aRg.aEnd.GetIndex(), nCnt + 2, sal_True ); // loesche Array in Delete()
1425 RemoveNode( aRg.aEnd.GetIndex(), nCnt, sal_True ); // loesche den Rest in Delete()
1528 if( pIdx->GetIndex() >= Count() - 1 ) in GoNext()
1545 if( !pIdx->GetIndex() ) in GoPrevious()
1550 while( aTmp.GetIndex() && 0 == ( pNd = &aTmp.GetNode())->IsCntntNode() ) in GoPrevious()
1553 if( !aTmp.GetIndex() ) in GoPrevious()
1593 sal_uLong nStt = rStt.GetIndex(), nEnd = rEnd.GetIndex(); in CheckNodesRange()
1595 pEndOfContent->GetIndex() )) return sal_True; in CheckNodesRange()
1597 pEndOfAutotext->GetIndex() )) return sal_True; in CheckNodesRange()
1599 pEndOfPostIts->GetIndex() )) return sal_True; in CheckNodesRange()
1601 pEndOfInserts->GetIndex() )) return sal_True; in CheckNodesRange()
1603 pEndOfRedlines->GetIndex() )) return sal_True; in CheckNodesRange()
1626 sal_uLong nSttIdx = rStart.GetIndex(); in DelNodes()
1628 if( !nSttIdx && nCnt == GetEndOfContent().GetIndex()+1 ) in DelNodes()
1643 sal_uLong nEndIdx = (*ppEndNdArr)->GetIndex(); in DelNodes()
1768 bSplitDestNd = pDestNd->Len() > rPos.nContent.GetIndex() || in MoveRange()
1774 ( (bOneNd) ? pEnd->nContent.GetIndex() : pSrcNd->Len() ) in MoveRange()
1775 - pStt->nContent.GetIndex(); in MoveRange()
1780 sal_uLong nSttNdIdx = pStt->nNode.GetIndex() + 1; in MoveRange()
1781 const sal_uLong nEndNdIdx = pEnd->nNode.GetIndex(); in MoveRange()
1796 if( !rPos.nContent.GetIndex() ) in MoveRange()
1817 pDestNd = rNodes[ rPos.nNode.GetIndex() - 1 ]->GetTxtNode(); in MoveRange()
1853 if( rPos.nContent.GetIndex() ) in MoveRange()
1855 if( rPos.nContent.GetIndex() == pDestNd->Len() ) in MoveRange()
1859 else if( rPos.nContent.GetIndex() ) in MoveRange()
1896 if( rPos.nNode < rNodes.GetEndOfContent().GetIndex() ) in MoveRange()
1911 if( pDestNd && pEnd->nContent.GetIndex() ) in MoveRange()
1916 pEnd->nContent.GetIndex()); in MoveRange()
1943 const sal_uLong nSttDiff = aSttIdx.GetIndex() - pStt->nNode.GetIndex(); in MoveRange()
1951 pStt->nNode = aRg.aEnd.GetIndex() - nSttDiff; in MoveRange()
1964 pStt->nContent.GetIndex() ); in MoveRange()
2040 rIndex.GetIndex() >= aRg.aStart.GetIndex() && in _CopyNodes()
2041 rIndex.GetIndex() < aRg.aEnd.GetIndex() ) in _CopyNodes()
2048 for( sal_uLong nNodeCnt = aRg.aEnd.GetIndex() - aRg.aStart.GetIndex(); in _CopyNodes()
2057 if( aInsPos < pDoc->GetNodes().GetEndOfInserts().GetIndex() && in _CopyNodes()
2059 < aInsPos.GetIndex() ) in _CopyNodes()
2063 aRg.aStart.GetIndex() ); in _CopyNodes()
2070 for( aRg.aStart++; aRg.aStart.GetIndex() < in _CopyNodes()
2098 nNodeCnt -= aInsPos.GetIndex() - nStt.GetIndex() -2; in _CopyNodes()
2115 if( pAktNode->EndOfSectionIndex() < aRg.aEnd.GetIndex() ) in _CopyNodes()
2122 nNodeCnt -= aInsPos.GetIndex() - nStt.GetIndex() -2; in _CopyNodes()
2209 while( aIdx.GetIndex() < rRg.aEnd.GetIndex() ) in _DelDummyNodes()
2212 RemoveNode( aIdx.GetIndex(), 1, sal_True ); in _DelDummyNodes()
2399 pSectNd->GetIndex() < pFrmNd->GetIndex()) in FindPrvNxtFrmNode()
2407 aIdx = pEnd->GetIndex() + 1; in FindPrvNxtFrmNode()
2420 pSectNd->EndOfSectionIndex() > pFrmNd->GetIndex()) in FindPrvNxtFrmNode()
2448 aIdx = pEnd->GetIndex() + 1; in FindPrvNxtFrmNode()
2450 aIdx = rFrmIdx.GetIndex() + 1; in FindPrvNxtFrmNode()
2484 BigPtrArray::ForEach( rStart.GetIndex(), rEnd.GetIndex(), in ForEach()
2504 sal_uLong nIdx = p->GetIndex(); in RemoveNode()
2515 sal_uLong nIdx = p->GetIndex(); in RemoveNode()
2558 sal_uLong nPrevNdIdx = pPrev->GetIndex(); in RemoveNode()
2563 nDelPos = pDel->GetIndex() + 1; in RemoveNode()
2609 BigPtrArray::Insert( pIns, rPos.GetIndex() ); in InsertNode()