Lines Matching refs:nIdx
193 void InsertSort( SvUShorts& rArr, sal_uInt16 nIdx, sal_uInt16* pInsPos = 0 );
194 void InsertSort( SvULongs& rArr, sal_uLong nIdx, sal_uInt16* pInsPos = 0 );
1818 sal_uLong nIdx = aTmp[ --n ]; in UndoImpl() local
1819 SwTableBox* pBox = pTblNd->GetTable().GetTblBox( nIdx ); in UndoImpl()
1847 rDoc.DeleteSection( rDoc.GetNodes()[ nIdx ] ); in UndoImpl()
1856 sal_uLong nIdx = (*Ptrs.pNewSttNds)[ --n ]; in UndoImpl() local
1857 SwTableBox* pBox = pTblNd->GetTable().GetTblBox( nIdx ); in UndoImpl()
1863 rDoc.DeleteSection( rDoc.GetNodes()[ nIdx ] ); in UndoImpl()
2071 sal_uLong nIdx = aNewSttNds[ --n ]; in UndoImpl() local
2073 if( !nIdx && n ) in UndoImpl()
2075 nIdx = aNewSttNds[ --n ]; in UndoImpl()
2076 pBox = pTblNd->GetTable().GetTblBox( nIdx ); in UndoImpl()
2121 nIdx = pBox->GetSttIdx(); in UndoImpl()
2124 pBox = pTblNd->GetTable().GetTblBox( nIdx ); in UndoImpl()
2145 rDoc.DeleteSection( rDoc.GetNodes()[ nIdx ] ); in UndoImpl()
3204 void InsertSort( SvUShorts& rArr, sal_uInt16 nIdx, sal_uInt16* pInsPos ) in InsertSort() argument
3213 if( *(rArr.GetData() + nM) == nIdx ) in InsertSort()
3218 if( *(rArr.GetData() + nM) < nIdx ) in InsertSort()
3226 rArr.Insert( nIdx, nU ); in InsertSort()
3231 void InsertSort( SvULongs& rArr, sal_uLong nIdx, sal_uInt16* pInsPos ) in InsertSort() argument
3240 if( *(rArr.GetData() + nM) == nIdx ) in InsertSort()
3245 if( *(rArr.GetData() + nM) < nIdx ) in InsertSort()
3253 rArr.Insert( nIdx, nU ); in InsertSort()