1291     sal_uLong nCnt = Count() - rIndex.GetIndex() - 1;  in Delete()  local
1292     if( nCnt > nNodes ) nCnt = nNodes;  in Delete()
1294     if( nCnt == 0 )         // keine Anzahl -> return  in Delete()
1297     SwNodeRange aRg( rIndex, 0, rIndex, nCnt-1 );  in Delete()
1311     nCnt = 0;  in Delete()
1358                     nCnt++;  in Delete()
1364                 RemoveNode( aRg.aEnd.GetIndex()+1, nCnt, sal_True );    // loesche  in Delete()
1365                 nCnt = 0;  in Delete()
1374                 if( nCnt )  in Delete()
1378                     RemoveNode( aRg.aEnd.GetIndex(), nCnt, sal_True );  in Delete()
1379                     nCnt = 0;  in Delete()
1384                 RemoveNode( aRg.aEnd.GetIndex(), nCnt + 2, sal_True );          // loesche Array  in Delete()
1385                 nCnt = 0;  in Delete()
1419             nCnt++;  in Delete()
1424     if( nCnt != 0 )  in Delete()
1425         RemoveNode( aRg.aEnd.GetIndex(), nCnt, sal_True );              // loesche den Rest  in Delete()
1623 void SwNodes::DelNodes( const SwNodeIndex & rStart, sal_uLong nCnt )  in DelNodes()  argument
1628     if( !nSttIdx && nCnt == GetEndOfContent().GetIndex()+1 )  in DelNodes()
1653         for( sal_uLong n = nSttIdx, nEnd = nSttIdx + nCnt; n < nEnd; ++n )  in DelNodes()
1674         RemoveNode( nSttIdx, nCnt, sal_True );  in DelNodes()
2525         for (sal_uLong nCnt = 0; nCnt < nSz; nCnt++)  in RemoveNode()  local
2527             SwTxtNode * pTxtNd = ((*this)[ nDelPos + nCnt ])->GetTxtNode();  in RemoveNode()
2541         sal_uLong nCnt = nSz;  in RemoveNode()  local
2542         SwNode *pDel = (*this)[ nDelPos+nCnt-1 ], *pPrev = (*this)[ nDelPos+nCnt-2 ];  in RemoveNode()
2554         while( nCnt-- )  in RemoveNode()
2560             if( nCnt )  in RemoveNode()