90
|
1 |
/*
|
|
2 |
* Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
|
|
3 |
* All rights reserved.
|
|
4 |
* This component and the accompanying materials are made available
|
|
5 |
* under the terms of "Eclipse Public License v1.0"
|
|
6 |
* which accompanies this distribution, and is available
|
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
8 |
*
|
|
9 |
* Initial Contributors:
|
|
10 |
* Nokia Corporation - initial contribution.
|
|
11 |
*
|
|
12 |
* Contributors:
|
|
13 |
*
|
|
14 |
* Description:
|
|
15 |
*
|
|
16 |
*/
|
|
17 |
|
|
18 |
#include <QLineF>
|
|
19 |
#include <QtGlobal>
|
|
20 |
#include <QPointF>
|
|
21 |
#include <math.h>
|
|
22 |
|
|
23 |
#include "hswidgetpositioningonwidgetadd.h"
|
|
24 |
#include "hsconfiguration.h"
|
|
25 |
#include "hsgui.h"
|
|
26 |
|
|
27 |
const qreal offset = 20; //TODO: Implement this as configurable parameter
|
|
28 |
|
|
29 |
|
|
30 |
/*!
|
|
31 |
\class HsWidgetPositioningOnWidgetAdd
|
|
32 |
\ingroup group_hsutils
|
|
33 |
\brief
|
|
34 |
*/
|
|
35 |
|
|
36 |
/*!
|
|
37 |
\class HsWidgetPositioningOnWidgetAdd
|
|
38 |
\brief Defines widget positioning on widget add.
|
|
39 |
|
|
40 |
Widget positioning on widget add sets positions for
|
|
41 |
a set of home screen widgets added from application library.
|
|
42 |
*/
|
|
43 |
|
|
44 |
/*!
|
|
45 |
Sets the positioning \a instance as the current one.
|
|
46 |
Deletes the existing instance if present.
|
|
47 |
*/
|
|
48 |
void HsWidgetPositioningOnWidgetAdd::setInstance(
|
|
49 |
HsWidgetPositioningOnWidgetAdd *instance)
|
|
50 |
{
|
|
51 |
if (mInstance)
|
|
52 |
delete mInstance;
|
|
53 |
mInstance = instance;
|
|
54 |
}
|
|
55 |
|
|
56 |
/*!
|
|
57 |
Returns the current positioning instance.
|
|
58 |
*/
|
|
59 |
HsWidgetPositioningOnWidgetAdd *HsWidgetPositioningOnWidgetAdd::instance()
|
|
60 |
{
|
|
61 |
return mInstance;
|
|
62 |
}
|
|
63 |
|
|
64 |
/*!
|
|
65 |
Stores the current positioning instance.
|
|
66 |
*/
|
|
67 |
HsWidgetPositioningOnWidgetAdd *HsWidgetPositioningOnWidgetAdd::mInstance = 0;
|
|
68 |
|
|
69 |
/*!
|
|
70 |
\class HsAnchorPointInBottomRight
|
|
71 |
\brief Diagonal widget positioning algorithm.
|
|
72 |
|
|
73 |
Sets widget's lower right corner to follow content area's diagonal.
|
|
74 |
Widgets are positioned to certain offset to each other.
|
|
75 |
*/
|
95
|
76 |
HsWidgetPositioningOnWidgetAdd::Result HsAnchorPointInBottomRight::convert(
|
90
|
77 |
const QRectF &contentArea,
|
|
78 |
const QList<QRectF> &existingRects,
|
|
79 |
const QList<QRectF> &newRects,
|
|
80 |
const QPointF &startPoint)
|
|
81 |
{
|
|
82 |
Q_UNUSED(existingRects);
|
|
83 |
|
95
|
84 |
HsWidgetPositioningOnWidgetAdd::Result result;
|
90
|
85 |
QList<QRectF> toGeometries;
|
|
86 |
|
|
87 |
//Offset for widgets' bottom right position to each other
|
|
88 |
qreal k = contentArea.height()/contentArea.width(); //slope of the diagonal
|
|
89 |
qreal offset_x = offset/(sqrt(k + 1));
|
|
90 |
qreal offset_y = k*offset_x;
|
|
91 |
QPointF offsetPoint(offset_x, offset_y);
|
|
92 |
|
|
93 |
QPointF anchorPoint;
|
|
94 |
|
|
95 |
if(startPoint.isNull()){
|
|
96 |
|
|
97 |
QLineF diagonal(contentArea.topLeft(), contentArea.bottomRight());
|
|
98 |
QLineF widgetRightSide(contentArea.center().x()+ newRects.at(0).width()/2,
|
|
99 |
contentArea.top(),
|
|
100 |
contentArea.center().x()+ newRects.at(0).width()/2,
|
|
101 |
contentArea.bottom());
|
|
102 |
|
|
103 |
// right side line intersection with diagonal will be bottom right position
|
|
104 |
// for the first rect
|
|
105 |
if(QLineF::BoundedIntersection !=
|
|
106 |
diagonal.intersect(widgetRightSide, &anchorPoint)) {
|
95
|
107 |
result.calculatedRects = newRects;
|
|
108 |
return result; //Return original since undefined error.
|
90
|
109 |
//In this case widget's must be wider than the content area.
|
|
110 |
}
|
95
|
111 |
} else {
|
90
|
112 |
anchorPoint = startPoint - offsetPoint;
|
|
113 |
}
|
|
114 |
|
|
115 |
QRectF widgetRect;
|
|
116 |
for(int i=0;i<newRects.count();++i) {
|
|
117 |
widgetRect = newRects.at(i);
|
|
118 |
widgetRect.moveBottomRight(anchorPoint);
|
|
119 |
//if widget rect doesn't fit, try to move it
|
|
120 |
if(!contentArea.contains(widgetRect)) {
|
|
121 |
/*! precondition is that
|
|
122 |
widget's max height < content area height
|
|
123 |
widget's max widht < content area width
|
|
124 |
*/
|
|
125 |
widgetRect.moveBottomRight(contentArea.bottomRight());
|
|
126 |
// anchorPoin is always previous bottom right
|
|
127 |
anchorPoint = widgetRect.bottomRight();
|
|
128 |
}
|
|
129 |
toGeometries << widgetRect;
|
|
130 |
anchorPoint -= offsetPoint;
|
|
131 |
|
|
132 |
}
|
95
|
133 |
result.calculatedRects = toGeometries;
|
|
134 |
return result;
|
90
|
135 |
}
|
|
136 |
|
|
137 |
/*!
|
|
138 |
\class HsAnchorPointInCenter
|
|
139 |
\brief Diagonal widget positioning algorithm.
|
|
140 |
|
|
141 |
Sets widget's center point to follow content area's diagonal.
|
|
142 |
Widgets are positioned to certain offset to each other.
|
|
143 |
*/
|
|
144 |
#ifdef COVERAGE_MEASUREMENT
|
|
145 |
#pragma CTC SKIP
|
|
146 |
#endif //COVERAGE_MEASUREMENT
|
95
|
147 |
HsWidgetPositioningOnWidgetAdd::Result HsAnchorPointInCenter::convert(
|
90
|
148 |
const QRectF &contentArea,
|
|
149 |
const QList<QRectF> &existingRects,
|
|
150 |
const QList<QRectF> &newRects,
|
|
151 |
const QPointF &startPoint )
|
|
152 |
{
|
|
153 |
Q_UNUSED(existingRects);
|
|
154 |
Q_UNUSED(startPoint)
|
|
155 |
|
95
|
156 |
HsWidgetPositioningOnWidgetAdd::Result result;
|
90
|
157 |
QList<QRectF> toGeometries;
|
|
158 |
|
|
159 |
//Offset for widgets' centers position to each other
|
|
160 |
qreal k = contentArea.height()/contentArea.width(); //slope of the diagonal
|
|
161 |
qreal offset_x = offset/(sqrt(k + 1));
|
|
162 |
qreal offset_y = k*offset_x;
|
|
163 |
QPointF offsetPoint(offset_x, offset_y);
|
|
164 |
|
|
165 |
//First widget to the center of the content area
|
|
166 |
QPointF anchorPoint = contentArea.center();
|
|
167 |
foreach (QRectF g, newRects) {
|
|
168 |
g.moveCenter(anchorPoint);
|
|
169 |
toGeometries << g;
|
|
170 |
anchorPoint -= offsetPoint;
|
|
171 |
if(!contentArea.contains(anchorPoint)) {
|
|
172 |
anchorPoint = contentArea.bottomRight();
|
|
173 |
}
|
|
174 |
}
|
95
|
175 |
result.calculatedRects = toGeometries;
|
|
176 |
return result;
|
90
|
177 |
}
|
|
178 |
|
|
179 |
HsWidgetOrganizer::HsWidgetOrganizer(int anchorDistance,
|
|
180 |
HsConfiguration::WidgetOrganizerSearchSequence sequence)
|
|
181 |
: mAnchorDistance(anchorDistance), mSequence(sequence), mAnchorColumns(0), mAnchorRows(0),
|
|
182 |
mCenterAlgorithm(new HsAnchorPointInCenter())
|
|
183 |
{
|
|
184 |
|
|
185 |
}
|
|
186 |
|
|
187 |
HsWidgetOrganizer::~HsWidgetOrganizer()
|
|
188 |
{
|
|
189 |
delete mCenterAlgorithm;
|
|
190 |
}
|
|
191 |
|
|
192 |
/*!
|
|
193 |
\class HsWidgetOrganizer
|
|
194 |
\brief Advanced widget positioning algorithm.
|
|
195 |
|
|
196 |
Organizes widget's starting from upper left corner towards right,
|
|
197 |
and then continues the on the next line.
|
|
198 |
*/
|
95
|
199 |
HsWidgetPositioningOnWidgetAdd::Result HsWidgetOrganizer::convert(
|
90
|
200 |
const QRectF &contentArea,
|
|
201 |
const QList<QRectF> &existingRects,
|
|
202 |
const QList<QRectF> &newRects,
|
|
203 |
const QPointF &startPoint)
|
|
204 |
{
|
|
205 |
Q_UNUSED(startPoint)
|
|
206 |
|
95
|
207 |
HsWidgetPositioningOnWidgetAdd::Result result;
|
|
208 |
|
90
|
209 |
// mandatory check ups
|
|
210 |
if (mAnchorDistance <= 0 || contentArea == QRectF() ||
|
|
211 |
newRects == QList<QRectF>()) {
|
95
|
212 |
return result;
|
90
|
213 |
}
|
|
214 |
|
|
215 |
// calculate anchor limits based on anchor distance
|
|
216 |
mAnchorColumns = convertToAnchors(contentArea.width());
|
|
217 |
mAnchorRows = convertToAnchors(contentArea.height());
|
|
218 |
mContentArea = contentArea;
|
|
219 |
|
|
220 |
// map rects so that we can later return them in original order
|
|
221 |
QMap<int, QRectF> newRectsMap;
|
|
222 |
for (int id = 0; id < newRects.count(); id++) {
|
|
223 |
newRectsMap.insert(id, newRects.at(id));
|
95
|
224 |
}
|
90
|
225 |
|
|
226 |
// get orientation
|
|
227 |
Qt::Orientation orientation(HsGui::instance()->orientation());
|
|
228 |
|
|
229 |
SortMode mode;
|
|
230 |
// select sorting mode based on orientation and search sequence
|
|
231 |
if((orientation == Qt::Vertical && mSequence == HsConfiguration::SearchRowByRow) ||
|
|
232 |
(orientation == Qt::Horizontal && mSequence == HsConfiguration::SearchColumnByColumn)) {
|
|
233 |
mode = SortByHeight;
|
|
234 |
} else {
|
|
235 |
mode = SortByWidth;
|
|
236 |
}
|
|
237 |
|
|
238 |
// sort rects into order
|
|
239 |
QList<int> newRectsSorted = sortRects(mode, newRectsMap);
|
|
240 |
|
|
241 |
// initialize anchor points
|
|
242 |
initAnchors();
|
|
243 |
|
|
244 |
// go through existing rects
|
|
245 |
bool ok = checkExistingRects(existingRects);
|
|
246 |
if (!ok) {
|
95
|
247 |
return result;
|
90
|
248 |
}
|
|
249 |
|
|
250 |
QList<int> newRectsNotCalculated;
|
95
|
251 |
QList<int> newRectsCalculated;
|
90
|
252 |
QList<QRectF> newExistingRects;
|
|
253 |
newExistingRects += existingRects;
|
|
254 |
|
|
255 |
// get positions for all new rects
|
|
256 |
for (int i = 0; i < newRectsMap.count(); i++) {
|
|
257 |
// proceed in sorted order with the rects
|
|
258 |
QRectF newRect = newRectsMap.value(newRectsSorted.at(i));
|
|
259 |
// find first free anchor point for rect
|
|
260 |
QPointF position = getPosition(newRect.size());
|
|
261 |
if (position != QPointF(-1,-1)) {
|
|
262 |
QRectF calculatedGeometry = QRectF(position.x() + mContentArea.x(),
|
|
263 |
position.y() + mContentArea.y(),
|
|
264 |
newRect.width(), newRect.height());
|
|
265 |
// update new rect instead of old one based on id map
|
|
266 |
newRectsMap.insert(newRectsSorted.at(i), calculatedGeometry);
|
|
267 |
// update existing rects
|
|
268 |
newExistingRects << calculatedGeometry;
|
95
|
269 |
newRectsCalculated << newRectsSorted.at(i);
|
90
|
270 |
// mark new rect reserved
|
|
271 |
bool marked = markAnchors(QRectF(position, newRect.size()));
|
|
272 |
if (!marked) {
|
95
|
273 |
return result;
|
90
|
274 |
}
|
|
275 |
|
|
276 |
} else {
|
|
277 |
// collect rect that do not fit
|
|
278 |
newRectsNotCalculated << newRectsSorted.at(i);
|
|
279 |
}
|
|
280 |
}
|
|
281 |
|
|
282 |
// use center algorithm with offset for the rest rects that did not fit to content area
|
|
283 |
if (newRectsNotCalculated.count() > 0 ) {
|
|
284 |
// collect not organized rects
|
|
285 |
QList<QRectF> undoneRects;
|
|
286 |
for (int i = 0; i < newRectsNotCalculated.count(); i++) {
|
|
287 |
undoneRects << newRectsMap.value(newRectsNotCalculated.at(i));
|
|
288 |
}
|
95
|
289 |
|
|
290 |
HsWidgetPositioningOnWidgetAdd::Result centerResult;
|
|
291 |
centerResult = mCenterAlgorithm->convert(mContentArea, newExistingRects,
|
|
292 |
undoneRects, QPointF());
|
90
|
293 |
// update the rest rects instead of old ones
|
95
|
294 |
for (int i = 0; i < centerResult.calculatedRects.count(); i++) {
|
|
295 |
newRectsMap.insert(newRectsNotCalculated.at(i), centerResult.calculatedRects.at(i));
|
90
|
296 |
}
|
|
297 |
}
|
|
298 |
|
95
|
299 |
result.calculatedRects = newRectsMap.values();
|
|
300 |
result.rectOrder = newRectsCalculated + newRectsNotCalculated;
|
|
301 |
|
|
302 |
return result;
|
90
|
303 |
}
|
|
304 |
|
|
305 |
/*!
|
|
306 |
Initializes anchor point network for area size
|
|
307 |
*/
|
|
308 |
void HsWidgetOrganizer::initAnchors()
|
|
309 |
{
|
|
310 |
// need to zero just in case (if algorithm is called twice)
|
|
311 |
mAnchors = QList<bool>();
|
|
312 |
// create anchor point network
|
|
313 |
for (int i = 0; i < (mAnchorColumns * mAnchorRows); i++) {
|
|
314 |
mAnchors.append(false);
|
|
315 |
}
|
|
316 |
}
|
|
317 |
|
|
318 |
/*!
|
|
319 |
Check existing rects and marks them reserved
|
|
320 |
*/
|
|
321 |
bool HsWidgetOrganizer::checkExistingRects(const QList<QRectF> &existingRects)
|
|
322 |
{
|
|
323 |
foreach (QRectF rect, existingRects) {
|
|
324 |
/* if existing rect is on the edges of content area
|
|
325 |
need to drop one pixels because there is no anchors on the edge */
|
|
326 |
int rightmostPoint = rect.x() + rect.width();
|
|
327 |
if (rightmostPoint == mContentArea.width()) {
|
|
328 |
rect.setWidth(rect.width() - 1);
|
|
329 |
}
|
|
330 |
int undermostPoint = rect.y() + rect.height();
|
|
331 |
if (undermostPoint == mContentArea.height()) {
|
|
332 |
rect.setHeight(rect.height() - 1);
|
|
333 |
}
|
|
334 |
// decrease content area size in case it does not start from (0,0)
|
|
335 |
rect = QRectF(
|
|
336 |
QPointF(rect.x() - mContentArea.x(), rect.y() - mContentArea.y()),
|
|
337 |
rect.size());
|
|
338 |
bool marked = markAnchors(rect);
|
|
339 |
if (!marked) {
|
|
340 |
return false;
|
|
341 |
}
|
|
342 |
}
|
|
343 |
return true;
|
|
344 |
}
|
|
345 |
|
|
346 |
/*!
|
|
347 |
Calculates pixel length as anchor points
|
|
348 |
*/
|
|
349 |
int HsWidgetOrganizer::convertToAnchors(int length)
|
|
350 |
{
|
|
351 |
// calculate remainder
|
|
352 |
int remainder = length % mAnchorDistance;
|
|
353 |
// calculate anchor points (only pixel integrals are counted, decimals are cut away)
|
|
354 |
int anchorPoints = (length - remainder) / mAnchorDistance;
|
|
355 |
return anchorPoints;
|
|
356 |
}
|
|
357 |
|
|
358 |
/*!
|
|
359 |
Marks reserved anchor points based on given rects
|
|
360 |
*/
|
|
361 |
bool HsWidgetOrganizer::markAnchors(const QRectF &rect)
|
|
362 |
{
|
|
363 |
// in case content does not start from zero, need take contentArea into calculations
|
|
364 |
int startWidth = convertToAnchors(rect.x());
|
|
365 |
int endWidth = convertToAnchors(rect.x() + rect.width());
|
|
366 |
int startHeight = convertToAnchors(rect.y());
|
|
367 |
int endHeight = convertToAnchors(rect.y() + rect.height());
|
|
368 |
|
|
369 |
// mark reserved anchors row by row from left to right
|
|
370 |
for (int i = startWidth; i <= endWidth; i++) {
|
|
371 |
for (int j = startHeight; j <= endHeight; j++) {
|
|
372 |
int index = getAnchorListIndex(QPointF(i,j));
|
|
373 |
if (index < 0) {
|
|
374 |
return false;
|
|
375 |
}
|
|
376 |
mAnchors[index] = true;
|
|
377 |
}
|
|
378 |
}
|
|
379 |
return true;
|
|
380 |
}
|
|
381 |
|
|
382 |
/*!
|
|
383 |
Returns anchor's list index based on given position
|
|
384 |
*/
|
|
385 |
int HsWidgetOrganizer::getAnchorListIndex(const QPointF &position)
|
|
386 |
{
|
|
387 |
int index = (position.y() * mAnchorColumns) + position.x();
|
|
388 |
if (index < mAnchors.count()) {
|
|
389 |
return index;
|
|
390 |
} else {
|
|
391 |
return -1;
|
|
392 |
}
|
|
393 |
}
|
|
394 |
|
|
395 |
/*!
|
|
396 |
Finds anchor points for content size
|
|
397 |
*/
|
|
398 |
QPointF HsWidgetOrganizer::getPosition(const QSizeF &size)
|
|
399 |
{
|
|
400 |
QPointF startPoint(0,0);
|
|
401 |
// convert units from pixels to anchors
|
|
402 |
int width = convertToAnchors(size.width());
|
|
403 |
int height = convertToAnchors(size.height());
|
|
404 |
|
|
405 |
// based on search sequence, select position searching method
|
|
406 |
if (mSequence == HsConfiguration::SearchRowByRow) {
|
|
407 |
startPoint = searchPositionRowByRow(startPoint, width, height);
|
|
408 |
} else {
|
|
409 |
startPoint = searchPositionColumnByColumn(startPoint, width, height);
|
|
410 |
}
|
|
411 |
|
|
412 |
if (startPoint == QPointF(-1,-1)) {
|
|
413 |
return startPoint;
|
|
414 |
} else {
|
|
415 |
// return the actual pixel coordinate
|
|
416 |
return QPointF(startPoint.x() * mAnchorDistance, startPoint.y() * mAnchorDistance);
|
|
417 |
}
|
|
418 |
}
|
|
419 |
|
|
420 |
/*!
|
|
421 |
Search sequence that finds anchor position by looking first for width on x-axis and
|
|
422 |
then secondarily on height from y-axis
|
|
423 |
*/
|
|
424 |
QPointF HsWidgetOrganizer::searchPositionRowByRow(QPointF startPoint, int width, int height)
|
|
425 |
{
|
|
426 |
bool anchorFound = false;
|
|
427 |
QPointF candidatePoint(0,0);
|
|
428 |
// loop until anchor point is found
|
|
429 |
while (anchorFound == false) {
|
|
430 |
// search for width on specified row
|
|
431 |
candidatePoint = searchSpace(SearchRow, startPoint, width);
|
|
432 |
if (candidatePoint != QPointF(-1,-1)) {
|
|
433 |
// update start point to where found width starts
|
|
434 |
startPoint.setX(candidatePoint.x());
|
|
435 |
// check all anchor height points corresponding the found free width points
|
|
436 |
for(int i = startPoint.x(); i <= startPoint.x() + width; i++) {
|
|
437 |
// save current start point to be checked
|
|
438 |
QPointF point = QPointF(i, startPoint.y());
|
|
439 |
// search for height on specified column
|
|
440 |
candidatePoint = searchSpace(SearchColumn, point, height);
|
|
441 |
if (candidatePoint == QPointF(-1,-1)) {
|
|
442 |
// update x anchor index
|
|
443 |
startPoint.setX(startPoint.x() + 1);
|
|
444 |
// set i to max to stop searching
|
|
445 |
i = startPoint.x() + width;
|
|
446 |
}
|
|
447 |
}
|
|
448 |
// if all height searches were successfull
|
|
449 |
if (candidatePoint != QPointF(-1,-1)) {
|
|
450 |
anchorFound = true;
|
|
451 |
}
|
|
452 |
} else {
|
|
453 |
// update x and y start positions when row has been checked
|
|
454 |
startPoint.setX(0);
|
|
455 |
startPoint.setY(startPoint.y() + 1);
|
|
456 |
// check that enough height left
|
|
457 |
if (startPoint.y() >= mAnchorRows) {
|
|
458 |
return QPointF(-1,-1);
|
|
459 |
}
|
|
460 |
}
|
|
461 |
}
|
|
462 |
|
|
463 |
return startPoint;
|
|
464 |
}
|
|
465 |
|
|
466 |
/*!
|
|
467 |
Search sequence that finds anchor position by looking first for height on y-axis and
|
|
468 |
then secondarily on width from x-axis
|
|
469 |
*/
|
|
470 |
QPointF HsWidgetOrganizer::searchPositionColumnByColumn(QPointF startPoint,
|
|
471 |
int width, int height)
|
|
472 |
{
|
|
473 |
bool anchorFound = false;
|
|
474 |
QPointF candidatePoint(0,0);
|
|
475 |
|
|
476 |
while (anchorFound == false) {
|
|
477 |
candidatePoint = searchSpace(SearchColumn, startPoint, height);
|
|
478 |
if (candidatePoint != QPointF(-1,-1)) {
|
|
479 |
startPoint.setY(candidatePoint.y());
|
|
480 |
for(int i = startPoint.y(); i <= startPoint.y() + height; i++) {
|
|
481 |
QPointF point = QPointF(startPoint.x(), i);
|
|
482 |
candidatePoint = searchSpace(SearchRow, point, width);
|
|
483 |
if (candidatePoint == QPointF(-1,-1)) {
|
|
484 |
startPoint.setY(startPoint.y() + 1);
|
|
485 |
i = startPoint.y() + height;
|
|
486 |
}
|
|
487 |
}
|
|
488 |
if (candidatePoint != QPointF(-1,-1)) {
|
|
489 |
anchorFound = true;
|
|
490 |
}
|
|
491 |
} else {
|
|
492 |
startPoint.setY(0);
|
|
493 |
startPoint.setX(startPoint.x() + 1);
|
|
494 |
if (startPoint.x() >= mAnchorColumns) {
|
|
495 |
return QPointF(-1,-1);
|
|
496 |
}
|
|
497 |
}
|
|
498 |
}
|
|
499 |
|
|
500 |
return startPoint;
|
|
501 |
}
|
|
502 |
|
|
503 |
/*!
|
|
504 |
Searches anchor point space for given length
|
|
505 |
*/
|
|
506 |
QPointF HsWidgetOrganizer::searchSpace(SearchMode mode, QPointF startPoint, int length)
|
|
507 |
{
|
|
508 |
int availableLength = 0;
|
|
509 |
// convert start point to an index in anchor list
|
|
510 |
int startIndex = getAnchorListIndex(startPoint);
|
|
511 |
int increment = 0;
|
|
512 |
int endIndex = 0;
|
|
513 |
|
|
514 |
// set end anchor index depending on checked axis
|
|
515 |
if (mode == SearchRow) {
|
|
516 |
// save the last index of the checked row
|
|
517 |
endIndex = getAnchorListIndex(QPointF((mAnchorColumns - 1), startPoint.y()));
|
|
518 |
|
|
519 |
} else {
|
|
520 |
// save the last index of the checked column
|
|
521 |
endIndex = getAnchorListIndex(QPointF(startPoint.x(), (mAnchorRows - 1)));
|
|
522 |
// we need to add increment due to anchors are listed row by row
|
|
523 |
increment = mAnchorColumns - 1;
|
|
524 |
}
|
|
525 |
|
|
526 |
// safety checks
|
|
527 |
if (startIndex == -1 || endIndex == -1) {
|
|
528 |
return QPointF(-1,-1);
|
|
529 |
}
|
|
530 |
|
|
531 |
// loop through anchor indexes, increment is added only when going through height
|
|
532 |
for (int i = startIndex; i <= endIndex; i = i + 1 + increment) {
|
|
533 |
// if anchor reserved
|
|
534 |
if (mAnchors.at(i) == true) {
|
|
535 |
availableLength = 0;
|
|
536 |
// if going through the first part of sequence (width/height)
|
|
537 |
if ((mSequence == HsConfiguration::SearchRowByRow && mode == SearchRow) ||
|
|
538 |
(mSequence == HsConfiguration::SearchColumnByColumn && mode == SearchColumn)) {
|
|
539 |
// update start index
|
|
540 |
startIndex = i + 1 + increment;
|
|
541 |
} else {
|
|
542 |
// exit immediately if second part of sequence fails
|
|
543 |
return QPointF(-1,-1);
|
|
544 |
}
|
|
545 |
} else {
|
|
546 |
// if enough space found
|
|
547 |
if (availableLength == length) {
|
|
548 |
// return the actual anchor position
|
|
549 |
return getAnchorCoordinates(startIndex);
|
|
550 |
}
|
|
551 |
// update available length
|
|
552 |
availableLength++;
|
|
553 |
}
|
|
554 |
}
|
|
555 |
|
|
556 |
return QPointF(-1,-1);
|
|
557 |
}
|
|
558 |
|
|
559 |
/*!
|
|
560 |
Returns pixel coordinate based on anchor coordinate
|
|
561 |
*/
|
|
562 |
QPointF HsWidgetOrganizer::getAnchorCoordinates(int index)
|
|
563 |
{
|
|
564 |
if (index < mAnchors.count()) {
|
|
565 |
int x = index % mAnchorColumns;
|
|
566 |
int y = (index - x) / mAnchorColumns;
|
|
567 |
return QPointF(x,y);
|
|
568 |
} else {
|
|
569 |
return QPointF();
|
|
570 |
}
|
|
571 |
}
|
|
572 |
|
|
573 |
/*!
|
|
574 |
Sorts rects based on sort mode and given map of rects
|
|
575 |
*/
|
|
576 |
QList<int> HsWidgetOrganizer::sortRects(SortMode mode, const QMap<int, QRectF> &rects)
|
|
577 |
{
|
|
578 |
QList<int> sortedRects;
|
|
579 |
int i = 0;
|
|
580 |
// loop through all rects
|
|
581 |
QMapIterator<int, QRectF> id(rects);
|
|
582 |
while (id.hasNext()) {
|
|
583 |
id.next();
|
|
584 |
int index = 0;
|
|
585 |
// add first rect id to sorted list
|
|
586 |
if (i == 0) {
|
|
587 |
sortedRects << id.key();
|
|
588 |
} else {
|
|
589 |
// go through existing rects in the sorted list
|
|
590 |
for ( int j = 0; j < sortedRects.count(); j++) {
|
|
591 |
// calculations for sortByArea
|
|
592 |
qreal existingArea = rects.value(sortedRects.at(j)).width() *
|
|
593 |
rects.value(sortedRects.at(j)).height();
|
|
594 |
qreal newArea = id.value().width() * id.value().height();
|
|
595 |
// sort rects in height order
|
|
596 |
switch (mode) {
|
|
597 |
case SortByHeight:
|
|
598 |
/* if rect heigth is smaller on already
|
|
599 |
existing ones in the list -> increment index
|
|
600 |
*/
|
|
601 |
if (id.value().height() <= rects.value(sortedRects.at(j)).height()) {
|
|
602 |
index++;
|
|
603 |
}
|
|
604 |
break;
|
|
605 |
// sort rects in width order
|
|
606 |
case SortByWidth:
|
|
607 |
// if rect width is smaller -> increment index
|
|
608 |
if (id.value().width() <= rects.value(sortedRects.at(j)).width()) {
|
|
609 |
index++;
|
|
610 |
}
|
|
611 |
break;
|
|
612 |
case SortByArea:
|
|
613 |
// if rect area is smaller -> increment index
|
|
614 |
if (newArea <= existingArea) {
|
|
615 |
index++;
|
|
616 |
}
|
|
617 |
// otherwise return in original order
|
|
618 |
default:
|
|
619 |
index++;
|
|
620 |
break;
|
|
621 |
}
|
|
622 |
}
|
|
623 |
// add rect id in the sorted list
|
|
624 |
sortedRects.insert(index, id.key());
|
|
625 |
}
|
|
626 |
i++;
|
|
627 |
}
|
|
628 |
return sortedRects;
|
|
629 |
}
|
|
630 |
|
|
631 |
#ifdef COVERAGE_MEASUREMENT
|
|
632 |
#pragma CTC ENDSKIP
|
|
633 |
#endif //COVERAGE_MEASUREMENT
|
|
634 |
|