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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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 General Public License for more details.
*
*/
#ifndef RECTANGLERELATIVEPOSITIONLIST_H
#define RECTANGLERELATIVEPOSITIONLIST_H
#include <vector>
#include <list>
#include <tulip/Rectangle.h>
/**
*This structure enables the storage of the data corresponding to the search
*of the optimal position of the rectangle designated by the field
*rectangleIterator.
*/
struct RectangleRelativePosition {
std::vector<tlp::Rectangle<float>>::iterator
rectangleIterator; /**< pointer towards the rectangle whose position optimal is searched.*/
int rectangleNumber; /**< the number which identifies the rectangle. */
float rectangleWidth; /**< the width of the rectangle. */
float rectangleHeight; /**< the height of the rectangle. */
float rectangleLeftAbscissa; /**< the left abscissa of the rectangle chosen after the position
tests. */
float rectangleLowOrdinate; /**< the low ordinate of the rectangle chosen after the position
tests. */
float rectangleTemporaryLeftAbscissa; /**< the left abscissa of the rectangle for the current
test. */
float
rectangleTemporaryLowOrdinate; /**< the low ordinate of the rectangle for the current test. */
float rectangleTemporaryBestLeftAbscissa; /** the best left abscissa of the rectangle calculated
since the beginning of the tests. */
float rectangleTemporaryBestLowOrdinate; /** the best low ordinate of the rectangle calculated
since the beginning of the tests. */
};
/**
*This class is a list of structures of RectangleRelativePosition. It enables
*the stocking of the first sequence of the even sequence made up as we insert
*the new rectangles.
*/
class RectangleRelativePositionList : public std::list<RectangleRelativePosition> {
public:
/**
*Add a structure RectangleRelativePosition to the list.
*/
void addRectangleRelativePosition(
std::vector<tlp::Rectangle<float>>::iterator itr, int numRect, float wdth, float hght,
float x, float y, std::list<RectangleRelativePosition>::iterator itRectangleRelativePosition);
/**
*Modify the coordinates of the Rectangles pointed by the fields
*RectangleIterator of the elements of the list. These new coordinates are
*calculated from the values of the fields rectangleLeftAbscissa and
*rectangleLowOrdinate.
*/
void allocateCoordinates();
/**
*Stock the values of the fields rectangleTemporaryLeftAbscissa and
*rectangleTemporaryLowOrdinate in the fields rectangle
*TemporaryBestLeftAbscissa and rectangleTemporaryBestLowOrdinate for all
*the elements of the list from one position in the list.
*/
void stockOfTemporaryBestCoordinates(int bestPlaceInFirstSequence);
};
#endif
|
