/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include "precompiled_vcl.hxx"
#include "svdata.hxx"
#include "vcl/arrange.hxx"
#include "vcl/edit.hxx"
#include "vcl/svapp.hxx"
#include "com/sun/star/beans/PropertyValue.hpp"
#include "com/sun/star/awt/Rectangle.hpp"
#include "osl/diagnose.h"
using namespace vcl;
using namespace com::sun::star;
// ----------------------------------------
// vcl::WindowArranger
//-----------------------------------------
long WindowArranger::getDefaultBorder()
{
ImplSVData* pSVData = ImplGetSVData();
long nResult = pSVData->maAppData.mnDefaultLayoutBorder;
if( nResult < 0 )
{
OutputDevice* pDefDev = Application::GetDefaultDevice();
if( pDefDev )
{
Size aBorder( pDefDev->LogicToPixel( Size( 3, 3 ), MapMode( MAP_APPFONT ) ) );
nResult = pSVData->maAppData.mnDefaultLayoutBorder = aBorder.Height();
}
}
return nResult > 0 ? nResult : 0;
}
WindowArranger::~WindowArranger()
{}
void WindowArranger::setParent( WindowArranger* i_pParent )
{
OSL_VERIFY( i_pParent->m_pParentWindow == m_pParentWindow || m_pParentWindow == NULL );
m_pParentArranger = i_pParent;
m_pParentWindow = i_pParent->m_pParentWindow;
setParentWindow( m_pParentWindow );
}
void WindowArranger::setParentWindow( Window* i_pNewParent )
{
m_pParentWindow = i_pNewParent;
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
Element* pEle = getElement( i );
if( pEle ) // sanity check
{
#if OSL_DEBUG_LEVEL > 0
if( pEle->m_pElement )
{
OSL_VERIFY( pEle->m_pElement->GetParent() == i_pNewParent );
}
#endif
if( pEle->m_pChild )
pEle->m_pChild->setParentWindow( i_pNewParent );
}
}
}
void WindowArranger::show( bool i_bShow, bool i_bImmediateUpdate )
{
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
Element* pEle = getElement( i );
if( pEle ) // sanity check
{
pEle->m_bHidden = ! i_bShow;
if( pEle->m_pElement )
pEle->m_pElement->Show( i_bShow );
if( pEle->m_pChild.get() )
pEle->m_pChild->show( i_bShow, false );
}
}
if( m_pParentArranger )
{
nEle = m_pParentArranger->countElements();
for( size_t i = 0; i < nEle; i++ )
{
Element* pEle = m_pParentArranger->getElement( i );
if( pEle && pEle->m_pChild.get() == this )
{
pEle->m_bHidden = ! i_bShow;
break;
}
}
}
if( i_bImmediateUpdate )
{
// find the topmost parent
WindowArranger* pResize = this;
while( pResize->m_pParentArranger )
pResize = pResize->m_pParentArranger;
pResize->resize();
}
}
bool WindowArranger::isVisible() const
{
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
const Element* pEle = getConstElement( i );
if( pEle->isVisible() )
return true;
}
return false;
}
bool WindowArranger::Element::isVisible() const
{
bool bVisible = false;
if( ! m_bHidden )
{
if( m_pElement )
bVisible = m_pElement->IsVisible();
else if( m_pChild )
bVisible = m_pChild->isVisible();
}
return bVisible;
}
sal_Int32 WindowArranger::Element::getExpandPriority() const
{
sal_Int32 nPrio = m_nExpandPriority;
if( m_pChild && m_nExpandPriority >= 0 )
{
size_t nElements = m_pChild->countElements();
for( size_t i = 0; i < nElements; i++ )
{
sal_Int32 nCPrio = m_pChild->getExpandPriority( i );
if( nCPrio > nPrio )
nPrio = nCPrio;
}
}
return nPrio;
}
Size WindowArranger::Element::getOptimalSize( WindowSizeType i_eType ) const
{
Size aResult;
if( ! m_bHidden )
{
bool bVisible = false;
if( m_pElement && m_pElement->IsVisible() )
{
aResult = m_pElement->GetOptimalSize( i_eType );
bVisible = true;
}
else if( m_pChild && m_pChild->isVisible() )
{
aResult = m_pChild->getOptimalSize( i_eType );
bVisible = true;
}
if( bVisible )
{
if( aResult.Width() < m_aMinSize.Width() )
aResult.Width() = m_aMinSize.Width();
if( aResult.Height() < m_aMinSize.Height() )
aResult.Height() = m_aMinSize.Height();
aResult.Width() += getBorderValue( m_nLeftBorder ) + getBorderValue( m_nRightBorder );
aResult.Height() += getBorderValue( m_nTopBorder ) + getBorderValue( m_nBottomBorder );
}
}
return aResult;
}
void WindowArranger::Element::setPosSize( const Point& i_rPos, const Size& i_rSize )
{
Point aPoint( i_rPos );
Size aSize( i_rSize );
aPoint.X() += getBorderValue( m_nLeftBorder );
aPoint.Y() += getBorderValue( m_nTopBorder );
aSize.Width() -= getBorderValue( m_nLeftBorder ) + getBorderValue( m_nRightBorder );
aSize.Height() -= getBorderValue( m_nTopBorder ) + getBorderValue( m_nBottomBorder );
if( m_pElement )
m_pElement->SetPosSizePixel( aPoint, aSize );
else if( m_pChild )
m_pChild->setManagedArea( Rectangle( aPoint, aSize ) );
}
uno::Sequence< beans::PropertyValue > WindowArranger::getProperties() const
{
uno::Sequence< beans::PropertyValue > aRet( 3 );
aRet[0].Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "OuterBorder" ) );
aRet[0].Value = uno::makeAny( sal_Int32( getBorderValue( m_nOuterBorder ) ) );
aRet[1].Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "ManagedArea" ) );
awt::Rectangle aArea( m_aManagedArea.getX(), m_aManagedArea.getY(), m_aManagedArea.getWidth(), m_aManagedArea.getHeight() );
aRet[1].Value = uno::makeAny( aArea );
aRet[2].Name = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "Visible" ) );
aRet[2].Value = uno::makeAny( sal_Bool( isVisible() ) );
return aRet;
}
void WindowArranger::setProperties( const uno::Sequence< beans::PropertyValue >& i_rProps )
{
const beans::PropertyValue* pProps = i_rProps.getConstArray();
bool bResize = false;
for( sal_Int32 i = 0; i < i_rProps.getLength(); i++ )
{
if( pProps[i].Name.equalsAscii( "OuterBorder" ) )
{
sal_Int32 nVal = 0;
if( pProps[i].Value >>= nVal )
{
if( getBorderValue( m_nOuterBorder ) != nVal )
{
m_nOuterBorder = nVal;
bResize = true;
}
}
}
else if( pProps[i].Name.equalsAscii( "ManagedArea" ) )
{
awt::Rectangle aArea( 0, 0, 0, 0 );
if( pProps[i].Value >>= aArea )
{
m_aManagedArea.setX( aArea.X );
m_aManagedArea.setY( aArea.Y );
m_aManagedArea.setWidth( aArea.Width );
m_aManagedArea.setHeight( aArea.Height );
bResize = true;
}
}
else if( pProps[i].Name.equalsAscii( "Visible" ) )
{
sal_Bool bVal = sal_False;
if( pProps[i].Value >>= bVal )
{
show( bVal, false );
bResize = true;
}
}
}
if( bResize )
resize();
}
// ----------------------------------------
// vcl::RowOrColumn
//-----------------------------------------
RowOrColumn::~RowOrColumn()
{
for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
it->deleteChild();
}
}
Size RowOrColumn::getOptimalSize( WindowSizeType i_eType ) const
{
Size aRet( 0, 0 );
long nDistance = getBorderValue( m_nBorderWidth );
for( std::vector< WindowArranger::Element >::const_iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->isVisible() )
{
// get the size of type of the managed element
Size aElementSize( it->getOptimalSize( i_eType ) );
if( m_bColumn )
{
// add the distance between elements
aRet.Height() += nDistance;
// check if the width needs adjustment
if( aRet.Width() < aElementSize.Width() )
aRet.Width() = aElementSize.Width();
aRet.Height() += aElementSize.Height();
}
else
{
// add the distance between elements
aRet.Width() += nDistance;
// check if the height needs adjustment
if( aRet.Height() < aElementSize.Height() )
aRet.Height() = aElementSize.Height();
aRet.Width() += aElementSize.Width();
}
}
}
if( aRet.Width() != 0 || aRet.Height() != 0 )
{
// subtract the border for the first element
if( m_bColumn )
aRet.Height() -= nDistance;
else
aRet.Width() -= nDistance;
// add the outer border
long nOuterBorder = getBorderValue( m_nOuterBorder );
aRet.Width() += 2*nOuterBorder;
aRet.Height() += 2*nOuterBorder;
}
return aRet;
}
void RowOrColumn::distributeRowWidth( std::vector<Size>& io_rSizes, long /*i_nUsedWidth*/, long i_nExtraWidth )
{
if( ! io_rSizes.empty() && io_rSizes.size() == m_aElements.size() )
{
// find all elements with the highest expand priority
size_t nElements = m_aElements.size();
std::vector< size_t > aIndices;
sal_Int32 nHighPrio = 0;
for( size_t i = 0; i < nElements; i++ )
{
if( m_aElements[ i ].isVisible() )
{
sal_Int32 nCurPrio = m_aElements[ i ].getExpandPriority();
if( nCurPrio > nHighPrio )
{
aIndices.clear();
nHighPrio = nCurPrio;
}
if( nCurPrio == nHighPrio )
aIndices.push_back( i );
}
}
// distribute extra space evenly among collected elements
nElements = aIndices.size();
if( nElements > 0 )
{
long nDelta = i_nExtraWidth / nElements;
for( size_t i = 0; i < nElements; i++ )
{
io_rSizes[ aIndices[i] ].Width() += nDelta;
i_nExtraWidth -= nDelta;
}
// add the last pixels to the last row element
if( i_nExtraWidth > 0 && nElements > 0 )
io_rSizes[aIndices.back()].Width() += i_nExtraWidth;
}
}
}
void RowOrColumn::distributeColumnHeight( std::vector<Size>& io_rSizes, long /*i_nUsedHeight*/, long i_nExtraHeight )
{
if( ! io_rSizes.empty() && io_rSizes.size() == m_aElements.size() )
{
// find all elements with the highest expand priority
size_t nElements = m_aElements.size();
std::vector< size_t > aIndices;
sal_Int32 nHighPrio = 3;
for( size_t i = 0; i < nElements; i++ )
{
if( m_aElements[ i ].isVisible() )
{
sal_Int32 nCurPrio = m_aElements[ i ].getExpandPriority();
if( nCurPrio > nHighPrio )
{
aIndices.clear();
nHighPrio = nCurPrio;
}
if( nCurPrio == nHighPrio )
aIndices.push_back( i );
}
}
// distribute extra space evenly among collected elements
nElements = aIndices.size();
if( nElements > 0 )
{
long nDelta = i_nExtraHeight / nElements;
for( size_t i = 0; i < nElements; i++ )
{
io_rSizes[ aIndices[i] ].Height() += nDelta;
i_nExtraHeight -= nDelta;
}
// add the last pixels to the last row element
if( i_nExtraHeight > 0 && nElements > 0 )
io_rSizes[aIndices.back()].Height() += i_nExtraHeight;
}
}
}
void RowOrColumn::resize()
{
// check if we can get optimal size, else fallback to minimal size
Size aOptSize( getOptimalSize( WINDOWSIZE_PREFERRED ) );
WindowSizeType eType = WINDOWSIZE_PREFERRED;
if( m_bColumn )
{
if( aOptSize.Height() > m_aManagedArea.GetHeight() )
eType = WINDOWSIZE_MINIMUM;
}
else
{
if( aOptSize.Width() > m_aManagedArea.GetWidth() )
eType = WINDOWSIZE_MINIMUM;
}
size_t nElements = m_aElements.size();
// get all element sizes for sizing
std::vector<Size> aElementSizes( nElements );
long nDistance = getBorderValue( m_nBorderWidth );
long nOuterBorder = getBorderValue( m_nOuterBorder );
long nUsedWidth = 2*nOuterBorder - (nElements ? nDistance : 0);
for( size_t i = 0; i < nElements; i++ )
{
if( m_aElements[i].isVisible() )
{
aElementSizes[i] = m_aElements[i].getOptimalSize( eType );
if( m_bColumn )
{
aElementSizes[i].Width() = m_aManagedArea.GetWidth() - 2 * nOuterBorder;
nUsedWidth += aElementSizes[i].Height() + nDistance;
}
else
{
aElementSizes[i].Height() = m_aManagedArea.GetHeight() - 2 * nOuterBorder;
nUsedWidth += aElementSizes[i].Width() + nDistance;
}
}
}
long nExtraWidth = (m_bColumn ? m_aManagedArea.GetHeight() : m_aManagedArea.GetWidth()) - nUsedWidth;
if( nExtraWidth > 0 )
{
if( m_bColumn )
distributeColumnHeight( aElementSizes, nUsedWidth, nExtraWidth );
else
distributeRowWidth( aElementSizes, nUsedWidth, nExtraWidth );
}
// get starting position
Point aElementPos( m_aManagedArea.TopLeft() );
// outer border
aElementPos.X() += nOuterBorder;
aElementPos.Y() += nOuterBorder;
// position managed windows
for( size_t i = 0; i < nElements; i++ )
{
// get the size of type of the managed element
if( m_aElements[i].isVisible() )
{
m_aElements[i].setPosSize( aElementPos, aElementSizes[i] );
if( m_bColumn )
aElementPos.Y() += nDistance + aElementSizes[i].Height();
else
aElementPos.X() += nDistance + aElementSizes[i].Width();
}
}
}
size_t RowOrColumn::addWindow( Window* i_pWindow, sal_Int32 i_nExpandPrio, const Size& i_rMinSize, size_t i_nIndex )
{
size_t nIndex = i_nIndex;
if( i_nIndex >= m_aElements.size() )
{
nIndex = m_aElements.size();
m_aElements.push_back( WindowArranger::Element( i_pWindow, boost::shared_ptr<WindowArranger>(), i_nExpandPrio, i_rMinSize ) );
}
else
{
std::vector< WindowArranger::Element >::iterator it = m_aElements.begin();
while( i_nIndex-- )
++it;
m_aElements.insert( it, WindowArranger::Element( i_pWindow, boost::shared_ptr<WindowArranger>(), i_nExpandPrio, i_rMinSize ) );
}
return nIndex;
}
size_t RowOrColumn::addChild( boost::shared_ptr<WindowArranger> const & i_pChild, sal_Int32 i_nExpandPrio, size_t i_nIndex )
{
size_t nIndex = i_nIndex;
if( i_nIndex >= m_aElements.size() )
{
nIndex = m_aElements.size();
m_aElements.push_back( WindowArranger::Element( NULL, i_pChild, i_nExpandPrio ) );
}
else
{
std::vector< WindowArranger::Element >::iterator it = m_aElements.begin();
while( i_nIndex-- )
++it;
m_aElements.insert( it, WindowArranger::Element( NULL, i_pChild, i_nExpandPrio ) );
}
return nIndex;
}
void RowOrColumn::remove( Window* i_pWindow )
{
if( i_pWindow )
{
for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->m_pElement == i_pWindow )
{
m_aElements.erase( it );
return;
}
}
}
}
void RowOrColumn::remove( boost::shared_ptr<WindowArranger> const & i_pChild )
{
if( i_pChild )
{
for( std::vector< WindowArranger::Element >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->m_pChild == i_pChild )
{
m_aElements.erase( it );
return;
}
}
}
}
// ----------------------------------------
// vcl::LabeledElement
//-----------------------------------------
LabeledElement::~LabeledElement()
{
m_aLabel.deleteChild();
m_aElement.deleteChild();
}
Size LabeledElement::getOptimalSize( WindowSizeType i_eType ) const
{
Size aRet( m_aLabel.getOptimalSize( WINDOWSIZE_MINIMUM ) );
if( aRet.Width() != 0 )
{
if( m_nLabelColumnWidth != 0 )
aRet.Width() = m_nLabelColumnWidth;
else
aRet.Width() += getBorderValue( m_nDistance );
}
Size aElementSize( m_aElement.getOptimalSize( i_eType ) );
aRet.Width() += aElementSize.Width();
if( aElementSize.Height() > aRet.Height() )
aRet.Height() = aElementSize.Height();
if( aRet.Height() != 0 )
aRet.Height() += 2 * getBorderValue( m_nOuterBorder );
return aRet;
}
void LabeledElement::resize()
{
Size aLabelSize( m_aLabel.getOptimalSize( WINDOWSIZE_MINIMUM ) );
Size aElementSize( m_aElement.getOptimalSize( WINDOWSIZE_PREFERRED ) );
long nDistance = getBorderValue( m_nDistance );
long nOuterBorder = getBorderValue( m_nOuterBorder );
if( nDistance + aLabelSize.Width() + aElementSize.Width() > m_aManagedArea.GetWidth() )
aElementSize = m_aElement.getOptimalSize( WINDOWSIZE_MINIMUM );
// align label and element vertically in LabeledElement
long nYOff = (m_aManagedArea.GetHeight() - 2*nOuterBorder - aLabelSize.Height()) / 2;
Point aPos( m_aManagedArea.Left(),
m_aManagedArea.Top() + nOuterBorder + nYOff );
Size aSize( aLabelSize );
if( m_nLabelColumnWidth != 0 )
aSize.Width() = m_nLabelColumnWidth;
m_aLabel.setPosSize( aPos, aSize );
aPos.X() += aSize.Width() + nDistance;
nYOff = (m_aManagedArea.GetHeight() - 2*nOuterBorder - aElementSize.Height()) / 2;
aPos.Y() = m_aManagedArea.Top() + nOuterBorder + nYOff;
aSize.Width() = aElementSize.Width();
aSize.Height() = m_aManagedArea.GetHeight() - 2*nOuterBorder;
// label style
// 0: position left and right
// 1: keep the element close to label and grow it
// 2: keep the element close and don't grow it
if( m_nLabelStyle == 0)
{
if( aPos.X() + aSize.Width() < m_aManagedArea.Right() )
aPos.X() = m_aManagedArea.Right() - aSize.Width();
}
else if( m_nLabelStyle == 1 )
{
if( aPos.X() + aSize.Width() < m_aManagedArea.Right() )
aSize.Width() = m_aManagedArea.Right() - aPos.X();
}
m_aElement.setPosSize( aPos, aSize );
}
void LabeledElement::setLabel( Window* i_pLabel )
{
m_aLabel.m_pElement = i_pLabel;
m_aLabel.m_pChild.reset();
}
void LabeledElement::setLabel( boost::shared_ptr<WindowArranger> const & i_pLabel )
{
m_aLabel.m_pElement = NULL;
m_aLabel.m_pChild = i_pLabel;
}
void LabeledElement::setElement( Window* i_pElement )
{
m_aElement.m_pElement = i_pElement;
m_aElement.m_pChild.reset();
}
void LabeledElement::setElement( boost::shared_ptr<WindowArranger> const & i_pElement )
{
m_aElement.m_pElement = NULL;
m_aElement.m_pChild = i_pElement;
}
// ----------------------------------------
// vcl::LabelColumn
//-----------------------------------------
LabelColumn::~LabelColumn()
{
}
long LabelColumn::getLabelWidth() const
{
long nWidth = 0;
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
const Element* pEle = getConstElement( i );
if( pEle && pEle->m_pChild.get() )
{
const LabeledElement* pLabel = dynamic_cast< const LabeledElement* >(pEle->m_pChild.get());
if( pLabel )
{
Window* pLW = pLabel->getWindow( 0 );
if( pLW )
{
Size aLabSize( pLW->GetOptimalSize( WINDOWSIZE_MINIMUM ) );
long nLB = 0;
pLabel->getBorders(0, &nLB);
aLabSize.Width() += getBorderValue( nLB );
if( aLabSize.Width() > nWidth )
nWidth = aLabSize.Width();
}
}
}
}
return nWidth + getBorderValue( getBorderWidth() );
}
Size LabelColumn::getOptimalSize( WindowSizeType i_eType ) const
{
long nWidth = getLabelWidth();
long nOuterBorder = getBorderValue( m_nOuterBorder );
Size aColumnSize;
// every child is a LabeledElement
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
Size aElementSize;
const Element* pEle = getConstElement( i );
if( pEle && pEle->m_pChild.get() )
{
const LabeledElement* pLabel = dynamic_cast< const LabeledElement* >(pEle->m_pChild.get());
if( pLabel ) // we have a label
{
aElementSize = pLabel->getLabelSize( WINDOWSIZE_MINIMUM );
if( aElementSize.Width() )
aElementSize.Width() = nWidth;
Size aSize( pLabel->getElementSize( i_eType ) );
aElementSize.Width() += aSize.Width();
if( aSize.Height() > aElementSize.Height() )
aElementSize.Height() = aSize.Height();
}
else // a non label, just treat it as a row
{
aElementSize = pEle->getOptimalSize( i_eType );
}
}
else if( pEle && pEle->m_pElement ) // a general window, treat is as a row
{
aElementSize = pEle->getOptimalSize( i_eType );
}
if( aElementSize.Width() )
{
aElementSize.Width() += 2*nOuterBorder;
if( aElementSize.Width() > aColumnSize.Width() )
aColumnSize.Width() = aElementSize.Width();
}
if( aElementSize.Height() )
{
aColumnSize.Height() += getBorderValue( getBorderWidth() ) + aElementSize.Height();
}
}
if( nEle > 0 && aColumnSize.Height() )
{
aColumnSize.Height() -= getBorderValue( getBorderWidth() ); // for the first element
aColumnSize.Height() += 2*nOuterBorder;
}
return aColumnSize;
}
void LabelColumn::resize()
{
long nWidth = getLabelWidth();
size_t nEle = countElements();
for( size_t i = 0; i < nEle; i++ )
{
Element* pEle = getElement( i );
if( pEle && pEle->m_pChild.get() )
{
LabeledElement* pLabel = dynamic_cast< LabeledElement* >(pEle->m_pChild.get());
if( pLabel )
pLabel->setLabelColumnWidth( nWidth );
}
}
RowOrColumn::resize();
}
size_t LabelColumn::addRow( Window* i_pLabel, boost::shared_ptr<WindowArranger> const& i_rElement, long i_nIndent )
{
boost::shared_ptr< LabeledElement > xLabel( new LabeledElement( this, 1 ) );
xLabel->setLabel( i_pLabel );
xLabel->setBorders( 0, i_nIndent, 0, 0, 0 );
xLabel->setElement( i_rElement );
size_t nIndex = addChild( xLabel );
resize();
return nIndex;
}
size_t LabelColumn::addRow( Window* i_pLabel, Window* i_pElement, long i_nIndent, const Size& i_rElementMinSize )
{
boost::shared_ptr< LabeledElement > xLabel( new LabeledElement( this, 1 ) );
xLabel->setLabel( i_pLabel );
xLabel->setBorders( 0, i_nIndent, 0, 0, 0 );
xLabel->setElement( i_pElement );
xLabel->setMinimumSize( 1, i_rElementMinSize );
size_t nIndex = addChild( xLabel );
resize();
return nIndex;
}
// ----------------------------------------
// vcl::Indenter
//-----------------------------------------
Indenter::~Indenter()
{
m_aElement.deleteChild();
}
Size Indenter::getOptimalSize( WindowSizeType i_eType ) const
{
Size aSize( m_aElement.getOptimalSize( i_eType ) );
long nOuterBorder = getBorderValue( m_nOuterBorder );
long nIndent = getBorderValue( m_nIndent );
aSize.Width() += 2*nOuterBorder + nIndent;
aSize.Height() += 2*nOuterBorder;
return aSize;
}
void Indenter::resize()
{
long nOuterBorder = getBorderValue( m_nOuterBorder );
long nIndent = getBorderValue( m_nIndent );
Point aPt( m_aManagedArea.TopLeft() );
aPt.X() += nOuterBorder + nIndent;
aPt.Y() += nOuterBorder;
Size aSz( m_aManagedArea.GetSize() );
aSz.Width() -= 2*nOuterBorder + nIndent;
aSz.Height() -= 2*nOuterBorder;
m_aElement.setPosSize( aPt, aSz );
}
void Indenter::setWindow( Window* i_pWindow, sal_Int32 i_nExpandPrio )
{
OSL_VERIFY( (m_aElement.m_pElement == 0 && m_aElement.m_pChild == 0) || i_pWindow == 0 );
OSL_VERIFY( i_pWindow == 0 || i_pWindow->GetParent() == m_pParentWindow );
m_aElement.m_pElement = i_pWindow;
m_aElement.m_nExpandPriority = i_nExpandPrio;
}
void Indenter::setChild( boost::shared_ptr<WindowArranger> const & i_pChild, sal_Int32 i_nExpandPrio )
{
OSL_VERIFY( (m_aElement.m_pElement == 0 && m_aElement.m_pChild == 0 ) || i_pChild == 0 );
m_aElement.m_pChild = i_pChild;
m_aElement.m_nExpandPriority = i_nExpandPrio;
}
// ----------------------------------------
// vcl::MatrixArranger
//-----------------------------------------
MatrixArranger::~MatrixArranger()
{
}
Size MatrixArranger::getOptimalSize( WindowSizeType i_eType,
std::vector<long>& o_rColumnWidths, std::vector<long>& o_rRowHeights,
std::vector<sal_Int32>& o_rColumnPrio, std::vector<sal_Int32>& o_rRowPrio
) const
{
long nOuterBorder = getBorderValue( m_nOuterBorder );
Size aMatrixSize( 2*nOuterBorder, 2*nOuterBorder );
// first find out the current number of rows and columns
sal_uInt32 nRows = 0, nColumns = 0;
for( std::vector< MatrixElement >::const_iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->m_nX >= nColumns )
nColumns = it->m_nX+1;
if( it->m_nY >= nRows )
nRows = it->m_nY+1;
}
// now allocate row and column depth vectors
o_rColumnWidths = std::vector< long >( nColumns, 0 );
o_rRowHeights = std::vector< long >( nRows, 0 );
o_rColumnPrio = std::vector< sal_Int32 >( nColumns, 0 );
o_rRowPrio = std::vector< sal_Int32 >( nRows, 0 );
// get sizes an allocate them into rows/columns
for( std::vector< MatrixElement >::const_iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
Size aSize( it->getOptimalSize( i_eType ) );
if( aSize.Width() > o_rColumnWidths[ it->m_nX ] )
o_rColumnWidths[ it->m_nX ] = aSize.Width();
if( aSize.Height() > o_rRowHeights[ it->m_nY ] )
o_rRowHeights[ it->m_nY ] = aSize.Height();
if( it->m_nExpandPriority > o_rColumnPrio[ it->m_nX ] )
o_rColumnPrio[ it->m_nX ] = it->m_nExpandPriority;
if( it->m_nExpandPriority > o_rRowPrio[ it->m_nY ] )
o_rRowPrio[ it->m_nY ] = it->m_nExpandPriority;
}
// add up sizes
long nDistanceX = getBorderValue( m_nBorderX );
long nDistanceY = getBorderValue( m_nBorderY );
for( sal_uInt32 i = 0; i < nColumns; i++ )
aMatrixSize.Width() += o_rColumnWidths[i] + nDistanceX;
if( nColumns > 0 )
aMatrixSize.Width() -= nDistanceX;
for( sal_uInt32 i = 0; i < nRows; i++ )
aMatrixSize.Height() += o_rRowHeights[i] + nDistanceY;
if( nRows > 0 )
aMatrixSize.Height() -= nDistanceY;
return aMatrixSize;
}
Size MatrixArranger::getOptimalSize( WindowSizeType i_eType ) const
{
std::vector<long> aColumnWidths, aRowHeights;
std::vector<sal_Int32> aColumnPrio, aRowPrio;
return getOptimalSize( i_eType, aColumnWidths, aRowHeights, aColumnPrio, aRowPrio );
}
void MatrixArranger::distributeExtraSize( std::vector<long>& io_rSizes, const std::vector<sal_Int32>& i_rPrios, long i_nExtraWidth )
{
if( ! io_rSizes.empty() && io_rSizes.size() == i_rPrios.size() ) // sanity check
{
// find all elements with the highest expand priority
size_t nElements = io_rSizes.size();
std::vector< size_t > aIndices;
sal_Int32 nHighPrio = 0;
for( size_t i = 0; i < nElements; i++ )
{
sal_Int32 nCurPrio = i_rPrios[ i ];
if( nCurPrio > nHighPrio )
{
aIndices.clear();
nHighPrio = nCurPrio;
}
if( nCurPrio == nHighPrio )
aIndices.push_back( i );
}
// distribute extra space evenly among collected elements
nElements = aIndices.size();
if( nElements > 0 )
{
long nDelta = i_nExtraWidth / nElements;
for( size_t i = 0; i < nElements; i++ )
{
io_rSizes[ aIndices[i] ] += nDelta;
i_nExtraWidth -= nDelta;
}
// add the last pixels to the last row element
if( i_nExtraWidth > 0 && nElements > 0 )
io_rSizes[aIndices.back()] += i_nExtraWidth;
}
}
}
void MatrixArranger::resize()
{
// assure that we have at least one row and column
if( m_aElements.empty() )
return;
// check if we can get optimal size, else fallback to minimal size
std::vector<long> aColumnWidths, aRowHeights;
std::vector<sal_Int32> aColumnPrio, aRowPrio;
Size aOptSize( getOptimalSize( WINDOWSIZE_PREFERRED, aColumnWidths, aRowHeights, aColumnPrio, aRowPrio ) );
if( aOptSize.Height() > m_aManagedArea.GetHeight() ||
aOptSize.Width() > m_aManagedArea.GetWidth() )
{
std::vector<long> aMinColumnWidths, aMinRowHeights;
getOptimalSize( WINDOWSIZE_MINIMUM, aMinColumnWidths, aMinRowHeights, aColumnPrio, aRowPrio );
if( aOptSize.Height() > m_aManagedArea.GetHeight() )
aRowHeights = aMinRowHeights;
if( aOptSize.Width() > m_aManagedArea.GetWidth() )
aColumnWidths = aMinColumnWidths;
}
// distribute extra space available
long nExtraSize = m_aManagedArea.GetWidth();
for( size_t i = 0; i < aColumnWidths.size(); ++i )
nExtraSize -= aColumnWidths[i] + m_nBorderX;
if( nExtraSize > 0 )
distributeExtraSize( aColumnWidths, aColumnPrio, nExtraSize );
nExtraSize = m_aManagedArea.GetHeight();
for( size_t i = 0; i < aRowHeights.size(); ++i )
nExtraSize -= aRowHeights[i] + m_nBorderY;
if( nExtraSize > 0 )
distributeExtraSize( aRowHeights, aRowPrio, nExtraSize );
// prepare offsets
long nDistanceX = getBorderValue( m_nBorderX );
long nDistanceY = getBorderValue( m_nBorderY );
long nOuterBorder = getBorderValue( m_nOuterBorder );
std::vector<long> aColumnX( aColumnWidths.size() );
aColumnX[0] = m_aManagedArea.Left() + nOuterBorder;
for( size_t i = 1; i < aColumnX.size(); i++ )
aColumnX[i] = aColumnX[i-1] + aColumnWidths[i-1] + nDistanceX;
std::vector<long> aRowY( aRowHeights.size() );
aRowY[0] = m_aManagedArea.Top() + nOuterBorder;
for( size_t i = 1; i < aRowY.size(); i++ )
aRowY[i] = aRowY[i-1] + aRowHeights[i-1] + nDistanceY;
// now iterate over the elements and assign their positions
for( std::vector< MatrixElement >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
Point aCellPos( aColumnX[it->m_nX], aRowY[it->m_nY] );
Size aCellSize( aColumnWidths[it->m_nX], aRowHeights[it->m_nY] );
it->setPosSize( aCellPos, aCellSize );
}
}
size_t MatrixArranger::addWindow( Window* i_pWindow, sal_uInt32 i_nX, sal_uInt32 i_nY, sal_Int32 i_nExpandPrio, const Size& i_rMinSize )
{
sal_uInt64 nMapValue = getMap( i_nX, i_nY );
std::map< sal_uInt64, size_t >::const_iterator it = m_aMatrixMap.find( nMapValue );
size_t nIndex = 0;
if( it == m_aMatrixMap.end() )
{
m_aMatrixMap[ nMapValue ] = nIndex = m_aElements.size();
m_aElements.push_back( MatrixElement( i_pWindow, i_nX, i_nY, boost::shared_ptr<WindowArranger>(), i_nExpandPrio, i_rMinSize ) );
}
else
{
MatrixElement& rEle( m_aElements[ it->second ] );
rEle.m_pElement = i_pWindow;
rEle.m_pChild.reset();
rEle.m_nExpandPriority = i_nExpandPrio;
rEle.m_aMinSize = i_rMinSize;
rEle.m_nX = i_nX;
rEle.m_nY = i_nY;
nIndex = it->second;
}
return nIndex;
}
void MatrixArranger::remove( Window* i_pWindow )
{
if( i_pWindow )
{
for( std::vector< MatrixElement >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->m_pElement == i_pWindow )
{
m_aMatrixMap.erase( getMap( it->m_nX, it->m_nY ) );
m_aElements.erase( it );
return;
}
}
}
}
size_t MatrixArranger::addChild( boost::shared_ptr<WindowArranger> const &i_pChild, sal_uInt32 i_nX, sal_uInt32 i_nY, sal_Int32 i_nExpandPrio )
{
sal_uInt64 nMapValue = getMap( i_nX, i_nY );
std::map< sal_uInt64, size_t >::const_iterator it = m_aMatrixMap.find( nMapValue );
size_t nIndex = 0;
if( it == m_aMatrixMap.end() )
{
m_aMatrixMap[ nMapValue ] = nIndex = m_aElements.size();
m_aElements.push_back( MatrixElement( NULL, i_nX, i_nY, i_pChild, i_nExpandPrio ) );
}
else
{
MatrixElement& rEle( m_aElements[ it->second ] );
rEle.m_pElement = 0;
rEle.m_pChild = i_pChild;
rEle.m_nExpandPriority = i_nExpandPrio;
rEle.m_nX = i_nX;
rEle.m_nY = i_nY;
nIndex = it->second;
}
return nIndex;
}
void MatrixArranger::remove( boost::shared_ptr<WindowArranger> const &i_pChild )
{
if( i_pChild )
{
for( std::vector< MatrixElement >::iterator it = m_aElements.begin();
it != m_aElements.end(); ++it )
{
if( it->m_pChild == i_pChild )
{
m_aMatrixMap.erase( getMap( it->m_nX, it->m_nY ) );
m_aElements.erase( it );
return;
}
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
-6-2-6</option>
<option value='libreoffice-6-2-7'>libreoffice-6-2-7</option>
<option value='libreoffice-6-2-8'>libreoffice-6-2-8</option>
<option value='libreoffice-6-3'>libreoffice-6-3</option>
<option value='libreoffice-6-3-0'>libreoffice-6-3-0</option>
<option value='libreoffice-6-3-1'>libreoffice-6-3-1</option>
<option value='libreoffice-6-3-2'>libreoffice-6-3-2</option>
<option value='libreoffice-6-3-3'>libreoffice-6-3-3</option>
<option value='libreoffice-6-3-4'>libreoffice-6-3-4</option>
<option value='libreoffice-6-3-5'>libreoffice-6-3-5</option>
<option value='libreoffice-6-3-6'>libreoffice-6-3-6</option>
<option value='libreoffice-6-4'>libreoffice-6-4</option>
<option value='libreoffice-6-4-0'>libreoffice-6-4-0</option>
<option value='libreoffice-6-4-1'>libreoffice-6-4-1</option>
<option value='libreoffice-6-4-2'>libreoffice-6-4-2</option>
<option value='libreoffice-6-4-3'>libreoffice-6-4-3</option>
<option value='libreoffice-6-4-4'>libreoffice-6-4-4</option>
<option value='libreoffice-6-4-5'>libreoffice-6-4-5</option>
<option value='libreoffice-6-4-6'>libreoffice-6-4-6</option>
<option value='libreoffice-6-4-7'>libreoffice-6-4-7</option>
<option value='libreoffice-7-0'>libreoffice-7-0</option>
<option value='libreoffice-7-0-0'>libreoffice-7-0-0</option>
<option value='libreoffice-7-0-1'>libreoffice-7-0-1</option>
<option value='libreoffice-7-0-2'>libreoffice-7-0-2</option>
<option value='libreoffice-7-0-3'>libreoffice-7-0-3</option>
<option value='libreoffice-7-0-4'>libreoffice-7-0-4</option>
<option value='libreoffice-7-0-5'>libreoffice-7-0-5</option>
<option value='libreoffice-7-0-6'>libreoffice-7-0-6</option>
<option value='libreoffice-7-1'>libreoffice-7-1</option>
<option value='libreoffice-7-1-0'>libreoffice-7-1-0</option>
<option value='libreoffice-7-1-1'>libreoffice-7-1-1</option>
<option value='libreoffice-7-1-2'>libreoffice-7-1-2</option>
<option value='libreoffice-7-1-3'>libreoffice-7-1-3</option>
<option value='libreoffice-7-1-4'>libreoffice-7-1-4</option>
<option value='libreoffice-7-1-5'>libreoffice-7-1-5</option>
<option value='libreoffice-7-1-6'>libreoffice-7-1-6</option>
<option value='libreoffice-7-1-7'>libreoffice-7-1-7</option>
<option value='libreoffice-7-2'>libreoffice-7-2</option>
<option value='libreoffice-7-2-0'>libreoffice-7-2-0</option>
<option value='libreoffice-7-2-1'>libreoffice-7-2-1</option>
<option value='libreoffice-7-2-2'>libreoffice-7-2-2</option>
<option value='libreoffice-7-2-3'>libreoffice-7-2-3</option>
<option value='libreoffice-7-2-5'>libreoffice-7-2-5</option>
<option value='libreoffice-7-2-6'>libreoffice-7-2-6</option>
<option value='libreoffice-7-2-7'>libreoffice-7-2-7</option>
<option value='libreoffice-7-3'>libreoffice-7-3</option>
<option value='libreoffice-7-3-0'>libreoffice-7-3-0</option>
<option value='libreoffice-7-3-1'>libreoffice-7-3-1</option>
<option value='libreoffice-7-3-2'>libreoffice-7-3-2</option>
<option value='libreoffice-7-3-3'>libreoffice-7-3-3</option>
<option value='libreoffice-7-3-4'>libreoffice-7-3-4</option>
<option value='libreoffice-7-3-5'>libreoffice-7-3-5</option>
<option value='libreoffice-7-3-6'>libreoffice-7-3-6</option>
<option value='libreoffice-7-3-7'>libreoffice-7-3-7</option>
<option value='libreoffice-7-4'>libreoffice-7-4</option>
<option value='libreoffice-7-4-0'>libreoffice-7-4-0</option>
<option value='libreoffice-7-4-1'>libreoffice-7-4-1</option>
<option value='libreoffice-7-4-2'>libreoffice-7-4-2</option>
<option value='libreoffice-7-4-3'>libreoffice-7-4-3</option>
<option value='libreoffice-7-4-4'>libreoffice-7-4-4</option>
<option value='libreoffice-7-4-6'>libreoffice-7-4-6</option>
<option value='libreoffice-7-4-7'>libreoffice-7-4-7</option>
<option value='libreoffice-7-5'>libreoffice-7-5</option>
<option value='libreoffice-7-5-0'>libreoffice-7-5-0</option>
<option value='libreoffice-7-5-1'>libreoffice-7-5-1</option>
<option value='libreoffice-7-5-2'>libreoffice-7-5-2</option>
<option value='libreoffice-7-5-3'>libreoffice-7-5-3</option>
<option value='libreoffice-7-5-4'>libreoffice-7-5-4</option>
<option value='libreoffice-7-5-5'>libreoffice-7-5-5</option>
<option value='libreoffice-7-5-6'>libreoffice-7-5-6</option>
<option value='libreoffice-7-5-7'>libreoffice-7-5-7</option>
<option value='libreoffice-7-5-8'>libreoffice-7-5-8</option>
<option value='libreoffice-7-5-9'>libreoffice-7-5-9</option>
<option value='libreoffice-7-6'>libreoffice-7-6</option>
<option value='libreoffice-7-6-0'>libreoffice-7-6-0</option>
<option value='libreoffice-7-6-1'>libreoffice-7-6-1</option>
<option value='libreoffice-7-6-2'>libreoffice-7-6-2</option>
<option value='libreoffice-7-6-3'>libreoffice-7-6-3</option>
<option value='libreoffice-7-6-4'>libreoffice-7-6-4</option>
<option value='libreoffice-7-6-5'>libreoffice-7-6-5</option>
<option value='libreoffice-7-6-6'>libreoffice-7-6-6</option>
<option value='libreoffice-7-6-7'>libreoffice-7-6-7</option>
<option value='master' selected='selected'>master</option>
<option value='ports/macosx10.5/master'>ports/macosx10.5/master</option>
<option value='private/Ashod/cd-5.3-3.2_import_unloaded'>private/Ashod/cd-5.3-3.2_import_unloaded</option>
<option value='private/Ashod/cd-5.3-3.2_import_unloaded_share_GfxLink'>private/Ashod/cd-5.3-3.2_import_unloaded_share_GfxLink</option>
<option value='private/Ashod/cd-5.3.3.2'>private/Ashod/cd-5.3.3.2</option>
<option value='private/Ashod/cp-5.0-preinit'>private/Ashod/cp-5.0-preinit</option>
<option value='private/Ashod/fast-calc-rendering'>private/Ashod/fast-calc-rendering</option>
<option value='private/Ashod/pdfium'>private/Ashod/pdfium</option>
<option value='private/Ashod/pdfium_on_master'>private/Ashod/pdfium_on_master</option>
<option value='private/Ashod/pdfium_on_master_fixed'>private/Ashod/pdfium_on_master_fixed</option>
<option value='private/EL-SHREIF/ui_logger'>private/EL-SHREIF/ui_logger</option>
<option value='private/Minion3665/swf-export'>private/Minion3665/swf-export</option>
<option value='private/Rosemary/change-tracking'>private/Rosemary/change-tracking</option>
<option value='private/Sweetshark/killswclient'>private/Sweetshark/killswclient</option>
<option value='private/Sweetshark/lessdepend'>private/Sweetshark/lessdepend</option>
<option value='private/Sweetshark/multilistenerfix'>private/Sweetshark/multilistenerfix</option>
<option value='private/ajrhunt/c4'>private/ajrhunt/c4</option>
<option value='private/ajrhunt/cunit'>private/ajrhunt/cunit</option>
<option value='private/ajrhunt/cunitdemo'>private/ajrhunt/cunitdemo</option>
<option value='private/ajrhunt/firebird-improvement'>private/ajrhunt/firebird-improvement</option>
<option value='private/bansan/chardraw'>private/bansan/chardraw</option>
<option value='private/bubli/textboxchaining'>private/bubli/textboxchaining</option>
<option value='private/hcvcastro/preinit'>private/hcvcastro/preinit</option>
<option value='private/hcvcastro/undo-row-comment'>private/hcvcastro/undo-row-comment</option>
<option value='private/jmux/armin-strip-before-squash'>private/jmux/armin-strip-before-squash</option>
<option value='private/jmux/broken-static-win'>private/jmux/broken-static-win</option>
<option value='private/jmux/current-reorga'>private/jmux/current-reorga</option>
<option value='private/jmux/meson'>private/jmux/meson</option>
<option value='private/jmux/meson-gsoc-2021'>private/jmux/meson-gsoc-2021</option>
<option value='private/jmux/oss-fuzz'>private/jmux/oss-fuzz</option>
<option value='private/jmux/oss-fuzz-wip'>private/jmux/oss-fuzz-wip</option>
<option value='private/jmux/scheduler-fixes'>private/jmux/scheduler-fixes</option>
<option value='private/jmux/shape.odt'>private/jmux/shape.odt</option>
<option value='private/jmux/wasm-for-master'>private/jmux/wasm-for-master</option>
<option value='private/jmux/wasm-tmp'>private/jmux/wasm-tmp</option>
<option value='private/jmux/wasm_for_master_catchall'>private/jmux/wasm_for_master_catchall</option>
<option value='private/jmux/win-arm64'>private/jmux/win-arm64</option>
<option value='private/jmux/win-test-nohang'>private/jmux/win-test-nohang</option>
<option value='private/juergen/Tests'>private/juergen/Tests</option>
<option value='private/juergen/check-cjk'>private/juergen/check-cjk</option>
<option value='private/kendy/condformat-api'>private/kendy/condformat-api</option>
<option value='private/kendy/condformat-fdo82014'>private/kendy/condformat-fdo82014</option>
<option value='private/kendy/mailmerge-04'>private/kendy/mailmerge-04</option>
<option value='private/kendy/mailmerge-05'>private/kendy/mailmerge-05</option>
<option value='private/kendy/swinterpreter'>private/kendy/swinterpreter</option>
<option value='private/kendy/testcl'>private/kendy/testcl</option>
<option value='private/khaledhosny/color-fonts'>private/khaledhosny/color-fonts</option>
<option value='private/khaledhosny/vcl-cleanup-font'>private/khaledhosny/vcl-cleanup-font</option>
<option value='private/kohei/chart-bugs'>private/kohei/chart-bugs</option>
<option value='private/kohei/find-replace-all-perf'>private/kohei/find-replace-all-perf</option>
<option value='private/kohei/headless-perf'>private/kohei/headless-perf</option>
<option value='private/kohei/if-or-not-if-jump'>private/kohei/if-or-not-if-jump</option>
<option value='private/kohei/sort-ref-update'>private/kohei/sort-ref-update</option>
<option value='private/lfrb/opengl-vcl'>private/lfrb/opengl-vcl</option>
<option value='private/lgodard/calc_notes_import_export'>private/lgodard/calc_notes_import_export</option>
<option value='private/lgodard/tdf#117202'>private/lgodard/tdf#117202</option>
<option value='private/llunak/mailmerge'>private/llunak/mailmerge</option>
<option value='private/llunak/mailmerge_01'>private/llunak/mailmerge_01</option>
<option value='private/llunak/mailmerge_02'>private/llunak/mailmerge_02</option>
<option value='private/llunak/mailmerge_03'>private/llunak/mailmerge_03</option>
<option value='private/llunak/munich_12587'>private/llunak/munich_12587</option>
<option value='private/llunak/skia'>private/llunak/skia</option>
<option value='private/lmamane/basetest'>private/lmamane/basetest</option>
<option value='private/lmamane/for-julien2412'>private/lmamane/for-julien2412</option>
<option value='private/lmamane/for-julien2412-master'>private/lmamane/for-julien2412-master</option>
<option value='private/lmamane/tdf110997'>private/lmamane/tdf110997</option>
<option value='private/lmamane/timedate-controls-nanosecond'>private/lmamane/timedate-controls-nanosecond</option>
<option value='private/lmamane/validation'>private/lmamane/validation</option>
<option value='private/mcecchetti/23H1/a11y/paragraph'>private/mcecchetti/23H1/a11y/paragraph</option>
<option value='private/mcecchetti/accessibility/paragraph'>private/mcecchetti/accessibility/paragraph</option>
<option value='private/mcecchetti/amd/pdf-export-jpeg'>private/mcecchetti/amd/pdf-export-jpeg</option>
<option value='private/mcecchetti/bitmapcrc64'>private/mcecchetti/bitmapcrc64</option>
<option value='private/mcecchetti/bitmapcrc64-5-0'>private/mcecchetti/bitmapcrc64-5-0</option>
<option value='private/mcecchetti/calc-perf-unit-test'>private/mcecchetti/calc-perf-unit-test</option>
<option value='private/mcecchetti/calc-unit-test'>private/mcecchetti/calc-unit-test</option>
<option value='private/mcecchetti/gl-program-binary'>private/mcecchetti/gl-program-binary</option>
<option value='private/mert/wip_deepl'>private/mert/wip_deepl</option>
<option value='private/mikekaganski/multicolumn'>private/mikekaganski/multicolumn</option>
<option value='private/mmeeks/aafixes44'>private/mmeeks/aafixes44</option>
<option value='private/mmeeks/backports'>private/mmeeks/backports</option>
<option value='private/mmeeks/binarydatacache'>private/mmeeks/binarydatacache</option>
<option value='private/mmeeks/bitmapcrc64'>private/mmeeks/bitmapcrc64</option>
<option value='private/mmeeks/copy-paste'>private/mmeeks/copy-paste</option>
<option value='private/mmeeks/copypaste'>private/mmeeks/copypaste</option>
<option value='private/mmeeks/cp-6.2-bits'>private/mmeeks/cp-6.2-bits</option>
<option value='private/mmeeks/cp64merge'>private/mmeeks/cp64merge</option>
<option value='private/mmeeks/currency-dropdown'>private/mmeeks/currency-dropdown</option>
<option value='private/mmeeks/foo'>private/mmeeks/foo</option>
<option value='private/mmeeks/formula-iterator'>private/mmeeks/formula-iterator</option>
<option value='private/mmeeks/gldebug'>private/mmeeks/gldebug</option>
<option value='private/mmeeks/hidpi-bits'>private/mmeeks/hidpi-bits</option>
<option value='private/mmeeks/icontest'>private/mmeeks/icontest</option>
<option value='private/mmeeks/opengl-backbuffer'>private/mmeeks/opengl-backbuffer</option>
<option value='private/mmeeks/opengl-backbuffer2'>private/mmeeks/opengl-backbuffer2</option>
<option value='private/mmeeks/sandbox'>private/mmeeks/sandbox</option>
<option value='private/mmeeks/swapdatacontainer'>private/mmeeks/swapdatacontainer</option>
<option value='private/mmeeks/vcl-opengl3'>private/mmeeks/vcl-opengl3</option>
<option value='private/moggi/fix-opengl-context-problems'>private/moggi/fix-opengl-context-problems</option>
<option value='private/moggi/improved-dxf-xls-export'>private/moggi/improved-dxf-xls-export</option>
<option value='private/moggi/opengl-4-4-build-test'>private/moggi/opengl-4-4-build-test</option>
<option value='private/moggi/opengl-preparation'>private/moggi/opengl-preparation</option>
<option value='private/moggi/opengl-vcl-win'>private/moggi/opengl-vcl-win</option>
<option value='private/moggi/orcus-improvements'>private/moggi/orcus-improvements</option>
<option value='private/moggi/track-win-dc'>private/moggi/track-win-dc</option>
<option value='private/moggi/ui-test'>private/moggi/ui-test</option>
<option value='private/moggi/vcl-opengl3'>private/moggi/vcl-opengl3</option>
<option value='private/mst/sw_fieldmarkhide'>private/mst/sw_fieldmarkhide</option>
<option value='private/mst/sw_redlinehide'>private/mst/sw_redlinehide</option>
<option value='private/mst/sw_redlinehide_2'>private/mst/sw_redlinehide_2</option>
<option value='private/mst/sw_redlinehide_3'>private/mst/sw_redlinehide_3</option>
<option value='private/mst/sw_redlinehide_4a'>private/mst/sw_redlinehide_4a</option>
<option value='private/mst/sw_redlinehide_4b'>private/mst/sw_redlinehide_4b</option>
<option value='private/pranavk/modernize_gtktiledviewer'>private/pranavk/modernize_gtktiledviewer</option>
<option value='private/quwex/gsoc-box2d-experimental'>private/quwex/gsoc-box2d-experimental</option>
<option value='private/quwex/notespane-search'>private/quwex/notespane-search</option>
<option value='private/quwex/notespaneflat'>private/quwex/notespaneflat</option>
<option value='private/quwex/notespanesquashed'>private/quwex/notespanesquashed</option>
<option value='private/quwex/tdf59323'>private/quwex/tdf59323</option>
<option value='private/s.mehrbrodt/colorpicker-backport'>private/s.mehrbrodt/colorpicker-backport</option>
<option value='private/sweetshark/swdepend'>private/sweetshark/swdepend</option>
<option value='private/tbsdy/clipping'>private/tbsdy/clipping</option>
<option value='private/tbsdy/drawserverfontlayout'>private/tbsdy/drawserverfontlayout</option>
<option value='private/tbsdy/emf'>private/tbsdy/emf</option>
<option value='private/tbsdy/osl_getAllEnvironment'>private/tbsdy/osl_getAllEnvironment</option>
<option value='private/tbsdy/outdev'>private/tbsdy/outdev</option>
<option value='private/tbsdy/printinfomgr'>private/tbsdy/printinfomgr</option>
<option value='private/tbsdy/workbench'>private/tbsdy/workbench</option>
<option value='private/thb/libo-6-1+backports'>private/thb/libo-6-1+backports</option>
<option value='private/thb/libreoffice-5-2+backports'>private/thb/libreoffice-5-2+backports</option>
<option value='private/thb/sw_redlinehide-6-1'>private/thb/sw_redlinehide-6-1</option>
<option value='private/thb/tdf149754'>private/thb/tdf149754</option>
<option value='private/thb/wasm-upstreaming'>private/thb/wasm-upstreaming</option>
<option value='private/timar/cp-6.2-centos7'>private/timar/cp-6.2-centos7</option>
<option value='private/timar/fontconfigcrash'>private/timar/fontconfigcrash</option>
<option value='private/timar/pythonupgrademsp'>private/timar/pythonupgrademsp</option>
<option value='private/tml/Use-the-iOS-French-and-Italian-dictionaries-for-othe'>private/tml/Use-the-iOS-French-and-Italian-dictionaries-for-othe</option>
<option value='private/tml/android-use-bionic-linker-copy'>private/tml/android-use-bionic-linker-copy</option>
<option value='private/tml/android-use-faulty.lib'>private/tml/android-use-faulty.lib</option>
<option value='private/tml/cp-6-4-28-1'>private/tml/cp-6-4-28-1</option>
<option value='private/tml/fixwintext'>private/tml/fixwintext</option>
<option value='private/tml/iculess'>private/tml/iculess</option>
<option value='private/tml/lov-6.1.5.2'>private/tml/lov-6.1.5.2</option>
<option value='private/tml/lov-6.2.1'>private/tml/lov-6.2.1</option>
<option value='private/tml/lov-7.0.3.3'>private/tml/lov-7.0.3.3</option>
<option value='private/tml/lov-7.0.4'>private/tml/lov-7.0.4</option>
<option value='private/tml/lov-7.1.2'>private/tml/lov-7.1.2</option>
<option value='private/tml/opencl-default-1'>private/tml/opencl-default-1</option>
<option value='private/tvajngerl/staging'>private/tvajngerl/staging</option>
<option value='ref/for/distro/collabora/cp-6.2'>ref/for/distro/collabora/cp-6.2</option>
</select> <input type='submit' value='switch'/></form></td></tr>
<tr><td class='sub'>LibreOffice 核心代码仓库</td><td class='sub right'>文档基金会</td></tr></table>
<table class='tabs'><tr><td>
<a href='/cgit/lo/core/'>summary</a><a href='/cgit/lo/core/refs/?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>refs</a><a class='active' href='/cgit/lo/core/log/unoil/BUCK'>log</a><a href='/cgit/lo/core/tree/unoil/BUCK?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>tree</a><a href='/cgit/lo/core/commit/unoil/BUCK?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>commit</a><a href='/cgit/lo/core/diff/unoil/BUCK?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>diff</a></td><td class='form'><form class='right' method='get' action='/cgit/lo/core/log/unoil/BUCK'>
<input type='hidden' name='id' value='c4aa4b55e21915ca072daa7db93edabc043f26ab'/><select name='qt'>
<option value='grep'>log msg</option>
<option value='author'>author</option>
<option value='committer'>committer</option>
<option value='range'>range</option>
</select>
<input class='txt' type='search' size='10' name='q' value=''/>
<input type='submit' value='search'/>
</form>
</td></tr></table>
<div class='path'>path: <a href='/cgit/lo/core/log/?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>root</a>/<a href='/cgit/lo/core/log/unoil?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>unoil</a>/<a href='/cgit/lo/core/log/unoil/BUCK?id=c4aa4b55e21915ca072daa7db93edabc043f26ab'>BUCK</a></div><div class='content'><table class='list nowrap'><tr class='nohover'><th class='left'>Age</th><th class='left'>Commit message (<a href='/cgit/lo/core/log/unoil/BUCK?id=c4aa4b55e21915ca072daa7db93edabc043f26ab&showmsg=1'>Expand</a>)</th><th class='left'>Author</th></tr>