Lines Matching refs:m_aElements
281 for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin(); in ~RowOrColumn()
282 it != m_aElements.end(); ++it ) in ~RowOrColumn()
292 for( std::vector< WindowArranger::Element >::const_iterator it = m_aElements.begin(); in getOptimalSize()
293 it != m_aElements.end(); ++it ) in getOptimalSize()
339 if( ! io_rSizes.empty() && io_rSizes.size() == m_aElements.size() ) in distributeRowWidth()
342 size_t nElements = m_aElements.size(); in distributeRowWidth()
347 if( m_aElements[ i ].isVisible() ) in distributeRowWidth()
349 sal_Int32 nCurPrio = m_aElements[ i ].getExpandPriority(); in distributeRowWidth()
379 if( ! io_rSizes.empty() && io_rSizes.size() == m_aElements.size() ) in distributeColumnHeight()
382 size_t nElements = m_aElements.size(); in distributeColumnHeight()
387 if( m_aElements[ i ].isVisible() ) in distributeColumnHeight()
389 sal_Int32 nCurPrio = m_aElements[ i ].getExpandPriority(); in distributeColumnHeight()
433 size_t nElements = m_aElements.size(); in resize()
441 if( m_aElements[i].isVisible() ) in resize()
443 aElementSizes[i] = m_aElements[i].getOptimalSize( eType ); in resize()
476 if( m_aElements[i].isVisible() ) in resize()
478 m_aElements[i].setPosSize( aElementPos, aElementSizes[i] ); in resize()
490 if( i_nIndex >= m_aElements.size() ) in addWindow()
492 nIndex = m_aElements.size(); in addWindow()
493 …m_aElements.push_back( WindowArranger::Element( i_pWindow, boost::shared_ptr<WindowArranger>(), i_… in addWindow()
497 std::vector< WindowArranger::Element >::iterator it = m_aElements.begin(); in addWindow()
500 …m_aElements.insert( it, WindowArranger::Element( i_pWindow, boost::shared_ptr<WindowArranger>(), i… in addWindow()
508 if( i_nIndex >= m_aElements.size() ) in addChild()
510 nIndex = m_aElements.size(); in addChild()
511 m_aElements.push_back( WindowArranger::Element( NULL, i_pChild, i_nExpandPrio ) ); in addChild()
515 std::vector< WindowArranger::Element >::iterator it = m_aElements.begin(); in addChild()
518 m_aElements.insert( it, WindowArranger::Element( NULL, i_pChild, i_nExpandPrio ) ); in addChild()
527 for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin(); in remove()
528 it != m_aElements.end(); ++it ) in remove()
532 m_aElements.erase( it ); in remove()
543 for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin(); in remove()
544 it != m_aElements.end(); ++it ) in remove()
548 m_aElements.erase( it ); in remove()
843 for( std::vector< MatrixElement >::const_iterator it = m_aElements.begin(); in getOptimalSize()
844 it != m_aElements.end(); ++it ) in getOptimalSize()
859 for( std::vector< MatrixElement >::const_iterator it = m_aElements.begin(); in getOptimalSize()
860 it != m_aElements.end(); ++it ) in getOptimalSize()
937 if( m_aElements.empty() ) in resize()
982 for( std::vector< MatrixElement >::iterator it = m_aElements.begin(); in resize()
983 it != m_aElements.end(); ++it ) in resize()
998 m_aMatrixMap[ nMapValue ] = nIndex = m_aElements.size(); in addWindow()
999 …m_aElements.push_back( MatrixElement( i_pWindow, i_nX, i_nY, boost::shared_ptr<WindowArranger>(), … in addWindow()
1003 MatrixElement& rEle( m_aElements[ it->second ] ); in addWindow()
1019 for( std::vector< MatrixElement >::iterator it = m_aElements.begin(); in remove()
1020 it != m_aElements.end(); ++it ) in remove()
1025 m_aElements.erase( it ); in remove()
1039 m_aMatrixMap[ nMapValue ] = nIndex = m_aElements.size(); in addChild()
1040 m_aElements.push_back( MatrixElement( NULL, i_nX, i_nY, i_pChild, i_nExpandPrio ) ); in addChild()
1044 MatrixElement& rEle( m_aElements[ it->second ] ); in addChild()
1059 for( std::vector< MatrixElement >::iterator it = m_aElements.begin(); in remove()
1060 it != m_aElements.end(); ++it ) in remove()
1065 m_aElements.erase( it ); in remove()