Lines Matching refs:nPos
90 SortListData( long nPos, sal_Bool bModified = sal_False );
1451 long nPos = FindPos( pData, 1, nIndex-1 ); in Initialize() local
1453 maS2O.Insert( pData, nPos ); in Initialize()
1518 void SortedResultSet::InsertNew( long nPos, long nCount ) in InsertNew() argument
1529 if ( pData->mnCurPos >= nPos ) in InsertNew()
1543 maO2S.Insert( (void*)nEnd, (sal_uInt32)(nPos+i) ); // Insert( Wert, Position ) in InsertNew()
1550 void SortedResultSet::Remove( long nPos, long nCount, EventList *pEvents ) in Remove() argument
1557 if ( nPos <= mnLastSort ) in Remove()
1559 if ( nPos + nCount - 1 <= mnLastSort ) in Remove()
1562 mnLastSort = nPos - 1; in Remove()
1569 long nSortPos = (long) maO2S.GetObject( nPos ); in Remove()
1570 maO2S.Remove( (sal_uInt32) nPos ); in Remove()
1596 if ( pData->mnCurPos > nPos ) in Remove()
1604 void SortedResultSet::Move( long nPos, long nCount, long nOffset ) in Move() argument
1614 nSortPos = (long) maO2S.GetObject( nPos+i ); in Move()
1621 for ( i=nPos+nOffset; i<nPos; i++ ) in Move()
1630 long nStart = nPos + nCount; in Move()
1643 pTmpArr[i] = (long)maO2S.GetObject( (sal_uInt32)( nPos+i ) ); in Move()
1650 long nFrom = nPos - 1; in Move()
1651 nTo = nPos + nCount - 1; in Move()
1663 long nStart = nPos + nCount; in Move()
1667 maO2S.Replace( (void*) nVal, (sal_uInt32)( nPos+i ) ); in Move()
1672 nTo = nPos + nOffset; in Move()
1733 void SortedResultSet::SetChanged( long nPos, long nCount ) in SetChanged() argument
1737 long nSortPos = (long) maO2S.GetObject( nPos ); in SetChanged()
1747 nPos += 1; in SetChanged()
1855 SortListData::SortListData( long nPos, sal_Bool bModified ) in SortListData() argument
1858 mnCurPos = nPos; in SortListData()
1859 mnOldPos = nPos; in SortListData()
1876 void SortedEntryList::Insert( SortListData *pEntry, long nPos ) in Insert() argument
1878 if ( nPos < (long) maData.size() ) in Insert()
1879 maData.insert( maData.begin() + nPos, pEntry ); in Insert()
1885 SortListData* SortedEntryList::Remove( long nPos ) in Remove() argument
1889 if ( nPos < (long) maData.size() ) in Remove()
1891 pData = maData[ nPos ]; in Remove()
1892 maData.erase( maData.begin() + nPos ); in Remove()
1901 SortListData* SortedEntryList::GetData( long nPos ) in GetData() argument
1905 if ( nPos < (long) maData.size() ) in GetData()
1906 pData = maData[ nPos ]; in GetData()
1914 long SortedEntryList::operator [] ( long nPos ) const in operator []()
1918 if ( nPos < (long) maData.size() ) in operator []()
1919 pData = maData[ nPos ]; in operator []()
1941 void SimpleList::Remove( sal_uInt32 nPos ) in Remove() argument
1943 if ( nPos < (sal_uInt32) maData.size() ) in Remove()
1945 maData.erase( maData.begin() + nPos ); in Remove()
1969 void SimpleList::Insert( void* pData, sal_uInt32 nPos ) in Insert() argument
1971 if ( nPos < (sal_uInt32) maData.size() ) in Insert()
1972 maData.insert( maData.begin() + nPos, pData ); in Insert()
1978 void* SimpleList::GetObject( sal_uInt32 nPos ) const in GetObject()
1980 if ( nPos < (sal_uInt32) maData.size() ) in GetObject()
1981 return maData[ nPos ]; in GetObject()
1987 void SimpleList::Replace( void* pData, sal_uInt32 nPos ) in Replace() argument
1989 if ( nPos < (sal_uInt32) maData.size() ) in Replace()
1990 maData[ nPos ] = pData; in Replace()