Lines Matching refs:m_vEntries
259 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in ~ExtensionBox_Impl()
269 m_vEntries.clear(); in ~ExtensionBox_Impl()
282 return static_cast< sal_Int32 >( m_vEntries.size() ); in getItemCount()
302 if ( static_cast< sal_uInt32 >( nIndex ) >= m_vEntries.size()) in checkIndex()
312 return m_vEntries[ nIndex ]->m_sTitle; in getItemName()
320 return m_vEntries[ nIndex ]->m_sVersion; in getItemVersion()
328 return m_vEntries[ nIndex ]->m_sDescription; in getItemDescription()
336 return m_vEntries[ nIndex ]->m_sPublisher; in getItemPublisher()
344 return m_vEntries[ nIndex ]->m_sPublisherURL; in getItemPublisherLink()
361 for ( It iIter = m_vEntries.begin(); iIter < m_vEntries.end(); iIter++ ) in select()
365 long nPos = iIter - m_vEntries.begin(); in select()
396 rtl::OUString aText( m_vEntries[ nPos ]->m_sErrorText ); in CalcActiveHeight()
399 aText += m_vEntries[ nPos ]->m_sDescription; in CalcActiveHeight()
408 if ( m_vEntries[ nPos ]->m_bHasButtons ) in CalcActiveHeight()
430 if ( m_vEntries[ nPos ]->m_bActive ) in GetEntryRect()
489 m_vEntries[ m_nActive ]->m_bActive = false; in selectEntry()
492 if ( ( nPos >= 0 ) && ( nPos < (long) m_vEntries.size() ) ) in selectEntry()
496 m_vEntries[ nPos ]->m_bActive = true; in selectEntry()
731 if ( m_vEntries.empty() ) in HandleCursorKey()
749 nSelect = m_vEntries.size() - 1; in HandleCursorKey()
760 nSelect = m_vEntries.size() - 1; in HandleCursorKey()
765 if ( nSelect >= (long) m_vEntries.size() ) in HandleCursorKey()
766 nSelect = m_vEntries.size() - 1; in HandleCursorKey()
791 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in Paint()
803 long nHeight = m_vEntries.size() * m_nStdHeight; in GetTotalHeight()
876 …selectEntry( m_vEntries.size() ); // Selecting an not existing entry will deselect the current o… in MouseButtonDown()
938 eCompare = pEntry->CompareTo( m_pCollator, m_vEntries[ nStart ] ); in FindEntryPos()
944 if (pEntry->m_xPackage != m_vEntries[nStart]->m_xPackage) in FindEntryPos()
948 m_vEntries[ nStart ]->m_bChecked = true; in FindEntryPos()
959 eCompare = pEntry->CompareTo( m_pCollator, m_vEntries[ nMid ] ); in FindEntryPos()
968 if (pEntry->m_xPackage != m_vEntries[nMid]->m_xPackage) in FindEntryPos()
972 m_vEntries[ nMid ]->m_bChecked = true; in FindEntryPos()
1022 if ( m_vEntries.empty() ) in addEntry()
1025 m_vEntries.push_back( pEntry ); in addEntry()
1029 if ( !FindEntryPos( pEntry, 0, m_vEntries.size()-1, nPos ) ) in addEntry()
1032 m_vEntries.insert( m_vEntries.begin()+nPos, pEntry ); in addEntry()
1067 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in updateEntry()
1107 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in removeEntry()
1111 long nPos = iIndex - m_vEntries.begin(); in removeEntry()
1120 m_vEntries.erase( iIndex ); in removeEntry()
1132 ( nPos == (long) m_vEntries.size() ) ) in removeEntry()
1159 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in RemoveUnlocked()
1178 for ( ITER iIndex = m_vEntries.begin(); iIndex < m_vEntries.end(); ++iIndex ) in prepareChecking()
1194 ITER iIndex = m_vEntries.begin(); in checkEntries()
1195 while ( iIndex < m_vEntries.end() ) in checkEntries()
1201 nPos = iIndex-m_vEntries.begin(); in checkEntries()
1214 else if ( ( nPos == m_nActive ) && ( nPos == (long) m_vEntries.size() - 1 ) ) in checkEntries()
1217 m_vEntries.erase( iIndex ); in checkEntries()
1218 iIndex = m_vEntries.begin() + nPos; in checkEntries()