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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Qt Software Information (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at qt-sales@nokia.com.
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QGraphicsWidget>
#include "qgraphicslayout_p.h"
#include "qgraphicsanchorlayout.h"
#include "qgraph_p.h"
#include "qsimplex_p.h"
/*
The public QGraphicsAnchorLayout interface represents an anchorage point
as a pair of a <QGraphicsLayoutItem *> and a <QGraphicsAnchorLayout::Edge>.
Internally though, it has a graph of anchorage points (vertices) and
anchors (edges), represented by the AnchorVertex and AnchorData structs
respectively.
*/
/*!
\internal
Represents a vertex (anchorage point) in the internal graph
*/
struct AnchorVertex {
AnchorVertex(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge edge)
: m_item(item), m_edge(edge) {}
AnchorVertex()
: m_item(0), m_edge(QGraphicsAnchorLayout::Edge(0)) {}
inline QString toString() const;
QGraphicsLayoutItem *m_item;
QGraphicsAnchorLayout::Edge m_edge;
// Current distance from this vertex to the layout edge (Left or Top)
// Value is calculated from the current anchors sizes.
qreal distance;
};
inline QString AnchorVertex::toString() const
{
if (!this || !m_item) {
return QLatin1String("NULL");
}
QString edge;
switch (m_edge) {
case QGraphicsAnchorLayout::Left:
edge = QLatin1String("Left");
break;
case QGraphicsAnchorLayout::HCenter:
edge = QLatin1String("HorizontalCenter");
break;
case QGraphicsAnchorLayout::Right:
edge = QLatin1String("Right");
break;
case QGraphicsAnchorLayout::Top:
edge = QLatin1String("Top");
break;
case QGraphicsAnchorLayout::VCenter:
edge = QLatin1String("VerticalCenter");
break;
case QGraphicsAnchorLayout::Bottom:
edge = QLatin1String("Bottom");
break;
default:
edge = QLatin1String("None");
break;
}
QString itemName;
if (m_item->isLayout()) {
itemName = QLatin1String("layout");
} else {
if (QGraphicsItem *item = m_item->graphicsItem()) {
itemName = item->data(0).toString();
}
}
edge.insert(0, QLatin1String("%1_"));
return edge.arg(itemName);
}
/*!
\internal
Represents an edge (anchor) in the internal graph.
*/
struct AnchorData : public QSimplexVariable {
enum Type {
Normal = 0,
Sequential,
Parallel
};
AnchorData(qreal minimumSize, qreal preferredSize, qreal maximumSize)
: QSimplexVariable(), from(0), to(0),
minSize(minimumSize), prefSize(preferredSize),
maxSize(maximumSize), sizeAtMinimum(preferredSize),
sizeAtPreferred(preferredSize), sizeAtMaximum(preferredSize),
skipInPreferred(0), type(Normal), hasSize(true),
isLayoutAnchor(false) {}
AnchorData(qreal size)
: QSimplexVariable(), from(0), to(0),
minSize(size), prefSize(size), maxSize(size),
sizeAtMinimum(size), sizeAtPreferred(size), sizeAtMaximum(size),
skipInPreferred(0), type(Normal), hasSize(true),
isLayoutAnchor(false) {}
AnchorData()
: QSimplexVariable(), from(0), to(0),
minSize(0), prefSize(0), maxSize(0),
sizeAtMinimum(0), sizeAtPreferred(0), sizeAtMaximum(0),
skipInPreferred(0), type(Normal), hasSize(false),
isLayoutAnchor(false) {}
virtual void updateChildrenSizes() { };
virtual void refreshSizeHints(qreal effectiveSpacing);
void dump(int indent = 2);
inline QString toString() const;
QString name;
// Anchor is semantically directed
AnchorVertex *from;
AnchorVertex *to;
// Size restrictions of this edge. For anchors internal to items, these
// values are derived from the respective item size hints. For anchors
// that were added by users, these values are equal to the specified anchor
// size.
qreal minSize;
qreal prefSize;
qreal maxSize;
// These attributes define which sizes should that anchor be in when the
// layout is at its minimum, preferred or maximum sizes. Values are
// calculated by the Simplex solver based on the current layout setup.
qreal sizeAtMinimum;
qreal sizeAtPreferred;
qreal sizeAtMaximum;
uint skipInPreferred : 1;
uint type : 2; // either Normal, Sequential or Parallel
uint hasSize : 1; // if false, get size from style.
uint isLayoutAnchor : 1; // if this anchor is connected to a layout 'edge'
protected:
AnchorData(Type type, qreal size = 0)
: QSimplexVariable(), from(0), to(0),
minSize(size), prefSize(size),
maxSize(size), sizeAtMinimum(size),
sizeAtPreferred(size), sizeAtMaximum(size),
skipInPreferred(0), type(type), hasSize(true),
isLayoutAnchor(false) {}
};
inline QString AnchorData::toString() const
{
return QString::fromAscii("Anchor(%1)").arg(name);
//return QString().sprintf("Anchor %%1 <Min %.1f Pref %.1f Max %.1f>",
// minSize, prefSize, maxSize).arg(name);
}
struct SequentialAnchorData : public AnchorData
{
SequentialAnchorData() : AnchorData(AnchorData::Sequential)
{
name = QLatin1String("SequentialAnchorData");
}
virtual void updateChildrenSizes();
virtual void refreshSizeHints(qreal effectiveSpacing);
void setVertices(const QVector<AnchorVertex*> &vertices)
{
m_children = vertices;
name = QString::fromAscii("%1 -- %2").arg(vertices.first()->toString(), vertices.last()->toString());
}
QVector<AnchorVertex*> m_children; // list of vertices in the sequence
QVector<AnchorData*> m_edges; // keep the list of edges too.
};
struct ParallelAnchorData : public AnchorData
{
ParallelAnchorData(AnchorData *first, AnchorData *second)
: AnchorData(AnchorData::Parallel),
firstEdge(first), secondEdge(second)
{
// ### Those asserts force that both child anchors have the same direction,
// but can't we simplify a pair of anchors in opposite directions?
Q_ASSERT(first->from == second->from);
Q_ASSERT(first->to == second->to);
from = first->from;
to = first->to;
name = QString::fromAscii("%1 | %2").arg(first->toString(), second->toString());
}
virtual void updateChildrenSizes();
virtual void refreshSizeHints(qreal effectiveSpacing);
AnchorData* firstEdge;
AnchorData* secondEdge;
};
/*!
\internal
Representation of a valid path for a given vertex in the graph.
In this struct, "positives" is the set of anchors that have been
traversed in the forward direction, while "negatives" is the set
with the ones walked backwards.
This paths are compared against each other to produce LP Constraints,
the exact order in which the anchors were traversed is not relevant.
*/
class GraphPath
{
public:
GraphPath() {};
QSimplexConstraint *constraint(const GraphPath &path) const;
QString toString() const;
QSet<AnchorData *> positives;
QSet<AnchorData *> negatives;
};
/*!
\internal
QGraphicsAnchorLayout private methods and attributes.
*/
class QGraphicsAnchorLayoutPrivate : public QGraphicsLayoutPrivate
{
Q_DECLARE_PUBLIC(QGraphicsAnchorLayout)
public:
// When the layout geometry is different from its Minimum, Preferred
// or Maximum values, interpolation is used to calculate the geometries
// of the items.
//
// Interval represents which interpolation interval are we operating in.
enum Interval {
MinToPreferred = 0,
PreferredToMax
};
// Several structures internal to the layout are duplicated to handle
// both Horizontal and Vertical restrictions.
//
// Orientation is used to reference the right structure in each context
enum Orientation {
Horizontal = 0,
Vertical,
NOrientations
};
QGraphicsAnchorLayoutPrivate();
static QGraphicsAnchorLayout::Edge oppositeEdge(
QGraphicsAnchorLayout::Edge edge);
static Orientation edgeOrientation(QGraphicsAnchorLayout::Edge edge);
static QGraphicsAnchorLayout::Edge pickEdge(QGraphicsAnchorLayout::Edge edge, Orientation orientation)
{
if (orientation == Vertical && int(edge) <= 2)
return (QGraphicsAnchorLayout::Edge)(edge + 3);
else if (orientation == Horizontal && int(edge) >= 3) {
return (QGraphicsAnchorLayout::Edge)(edge - 3);
}
return edge;
}
// Init methods
void createLayoutEdges();
void deleteLayoutEdges();
void createItemEdges(QGraphicsLayoutItem *item);
void createCenterAnchors(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge centerEdge);
void removeCenterAnchors(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge centerEdge, bool substitute = true);
void removeCenterConstraints(QGraphicsLayoutItem *item, Orientation orientation);
// helper function used by the 4 API functions
void anchor(QGraphicsLayoutItem *firstItem,
QGraphicsAnchorLayout::Edge firstEdge,
QGraphicsLayoutItem *secondItem,
QGraphicsAnchorLayout::Edge secondEdge,
qreal *spacing = 0);
// Anchor Manipulation methods
void addAnchor(QGraphicsLayoutItem *firstItem,
QGraphicsAnchorLayout::Edge firstEdge,
QGraphicsLayoutItem *secondItem,
QGraphicsAnchorLayout::Edge secondEdge,
AnchorData *data);
void removeAnchor(QGraphicsLayoutItem *firstItem,
QGraphicsAnchorLayout::Edge firstEdge,
QGraphicsLayoutItem *secondItem,
QGraphicsAnchorLayout::Edge secondEdge);
void removeAnchors(QGraphicsLayoutItem *item);
void removeVertex(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge edge);
void correctEdgeDirection(QGraphicsLayoutItem *&firstItem,
QGraphicsAnchorLayout::Edge &firstEdge,
QGraphicsLayoutItem *&secondItem,
QGraphicsAnchorLayout::Edge &secondEdge);
// for getting the actual spacing (will query the style if the
// spacing is not explicitly set).
qreal effectiveSpacing(Orientation orientation) const;
// Activation methods
void simplifyGraph(Orientation orientation);
bool simplifyGraphIteration(Orientation orientation);
void restoreSimplifiedGraph(Orientation orientation);
void calculateGraphs();
void calculateGraphs(Orientation orientation);
void setAnchorSizeHintsFromItems(Orientation orientation);
void findPaths(Orientation orientation);
void constraintsFromPaths(Orientation orientation);
QList<QSimplexConstraint *> constraintsFromSizeHints(const QList<AnchorData *> &anchors);
QList<QList<QSimplexConstraint *> > getGraphParts(Orientation orientation);
inline AnchorVertex *internalVertex(const QPair<QGraphicsLayoutItem*, QGraphicsAnchorLayout::Edge> &itemEdge)
{
return m_vertexList.value(itemEdge).first;
}
inline AnchorVertex *internalVertex(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge edge)
{
return internalVertex(qMakePair(item, edge));
}
AnchorVertex *addInternalVertex(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge edge);
void removeInternalVertex(QGraphicsLayoutItem *item, QGraphicsAnchorLayout::Edge edge);
// Geometry interpolation methods
void setItemsGeometries();
void calculateVertexPositions(Orientation orientation);
void setupEdgesInterpolation(Orientation orientation);
void interpolateEdge(AnchorVertex *base, AnchorData *edge, Orientation orientation);
void interpolateSequentialEdges(AnchorVertex *base, SequentialAnchorData *edge,
Orientation orientation);
void interpolateParallelEdges(AnchorVertex *base, ParallelAnchorData *edge,
Orientation orientation);
// Linear Programming solver methods
QPair<qreal, qreal> solveMinMax(QList<QSimplexConstraint *> constraints,
GraphPath path);
void solvePreferred(QList<QSimplexConstraint *> constraints);
#ifdef QT_DEBUG
void dumpGraph();
#endif
qreal spacings[NOrientations];
// Size hints from simplex engine
qreal sizeHints[2][3];
// Items
QVector<QGraphicsLayoutItem *> items;
// Mapping between high level anchorage points (Item, Edge) to low level
// ones (Graph Vertices)
QHash<QPair<QGraphicsLayoutItem*, QGraphicsAnchorLayout::Edge>, QPair<AnchorVertex *, int> > m_vertexList;
// Internal graph of anchorage points and anchors, for both orientations
Graph<AnchorVertex, AnchorData> graph[2];
// Graph paths and constraints, for both orientations
QMultiHash<AnchorVertex *, GraphPath> graphPaths[2];
QList<QSimplexConstraint *> constraints[2];
QList<QSimplexConstraint *> itemCenterConstraints[2];
// The interpolation interval and progress based on the current size
// as well as the key values (minimum, preferred and maximum)
Interval interpolationInterval[2];
qreal interpolationProgress[2];
// ###
bool graphSimplified[2];
uint calculateGraphCacheDirty : 1;
};
|