1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/* -*- 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 "flow.hxx"
#include <sal/macros.h>
namespace layoutimpl
{
using namespace css;
bool Flow::ChildData::isVisible()
{
return xChild.is();
}
Flow::Flow()
: Container()
, mnSpacing( 0 )
, mbHomogeneous( false )
{
addProp( RTL_CONSTASCII_USTRINGPARAM( "Homogeneous" ),
::getCppuType( static_cast< const sal_Bool* >( NULL ) ),
&mbHomogeneous );
addProp( RTL_CONSTASCII_USTRINGPARAM( "Spacing" ),
::getCppuType( static_cast< const sal_Int32* >( NULL ) ),
&mnSpacing );
}
bool
Flow::emptyVisible ()
{
return true;
}
void SAL_CALL
Flow::addChild( const uno::Reference< awt::XLayoutConstrains >& xChild )
throw (uno::RuntimeException, css::awt::MaxChildrenException)
{
if ( xChild.is() )
{
ChildData *pData = new ChildData();
pData->xChild = xChild;
maChildren.push_back( pData );
setChildParent( xChild );
queueResize();
}
}
void SAL_CALL
Flow::removeChild( const css::uno::Reference< css::awt::XLayoutConstrains >& xChild )
throw (css::uno::RuntimeException)
{
for ( std::list< ChildData * >::iterator it = maChildren.begin();
it != maChildren.end(); it++ )
{
if ( (*it)->xChild == xChild )
{
delete *it;
maChildren.erase( it );
unsetChildParent( xChild );
queueResize();
break;
}
}
}
css::uno::Sequence< css::uno::Reference < css::awt::XLayoutConstrains > > SAL_CALL
Flow::getChildren()
throw (css::uno::RuntimeException)
{
uno::Sequence< uno::Reference< awt::XLayoutConstrains > > children( maChildren.size() );
unsigned int i = 0;
for ( std::list< ChildData * >::iterator it = maChildren.begin();
it != maChildren.end(); it++, i++ )
children[i] = (*it)->xChild;
return children;
}
uno::Reference< beans::XPropertySet > SAL_CALL
Flow::getChildProperties( const uno::Reference< awt::XLayoutConstrains >& /*xChild*/ )
throw (uno::RuntimeException)
{
return uno::Reference< beans::XPropertySet >();
}
css::awt::Size
Flow::calculateSize( long nMaxWidth )
{
long nNeedHeight = 0;
std::list<ChildData *>::const_iterator it;
mnEachWidth = 0;
// first pass, for homogeneous property
for (it = maChildren.begin(); it != maChildren.end(); it++)
{
if ( !(*it)->isVisible() )
continue;
(*it)->aRequisition = (*it)->xChild->getMinimumSize();
if ( mbHomogeneous )
mnEachWidth = SAL_MAX( mnEachWidth, (*it)->aRequisition.Width );
}
long nRowWidth = 0, nRowHeight = 0;
for (it = maChildren.begin(); it != maChildren.end(); it++)
{
if ( !(*it)->isVisible() )
continue;
awt::Size aChildSize = (*it)->aRequisition;
if ( mbHomogeneous )
aChildSize.Width = mnEachWidth;
if ( nMaxWidth && nRowWidth > 0 && nRowWidth + aChildSize.Width > nMaxWidth )
{
nRowWidth = 0;
nNeedHeight += nRowHeight;
nRowHeight = 0;
}
nRowHeight = SAL_MAX( nRowHeight, aChildSize.Height );
nRowWidth += aChildSize.Width;
}
nNeedHeight += nRowHeight;
return awt::Size( nRowWidth, nNeedHeight );
}
awt::Size SAL_CALL
Flow::getMinimumSize() throw(uno::RuntimeException)
{
return maRequisition = calculateSize( 0 );
}
sal_Bool SAL_CALL
Flow::hasHeightForWidth()
throw(css::uno::RuntimeException)
{
return true;
}
sal_Int32 SAL_CALL
Flow::getHeightForWidth( sal_Int32 nWidth )
throw(css::uno::RuntimeException)
{
return calculateSize( nWidth ).Height;
}
void SAL_CALL
Flow::allocateArea( const css::awt::Rectangle &rArea )
throw (css::uno::RuntimeException)
{
maAllocation = rArea;
std::list<ChildData *>::const_iterator it;
long nX = 0, nY = 0, nRowHeight = 0;
for (it = maChildren.begin(); it != maChildren.end(); it++)
{
ChildData *child = *it;
if ( !child->isVisible() )
continue;
awt::Size aChildSize( child->aRequisition );
if ( mbHomogeneous )
aChildSize.Width = mnEachWidth;
if ( nX > 0 && nX + aChildSize.Width > rArea.Width )
{
nX = 0;
nY += nRowHeight;
nRowHeight = 0;
}
nRowHeight = SAL_MAX( nRowHeight, aChildSize.Height );
allocateChildAt( child->xChild,
awt::Rectangle( rArea.X + nX, rArea.Y + nY, aChildSize.Width, aChildSize.Height ) );
nX += aChildSize.Width;
}
}
} // namespace layoutimpl
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
