blob: 07586e17d9c2e8c00d865e2c4b80821e1fa6a7ad (
plain)
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
|
/*
BasicWriter
Copyright (C) 2014 Benjamin Paaßen, Andreas Stöckel
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _TILE_TREE_NODE_HPP_
#define _TILE_TREE_NODE_HPP_
#include <QSize>
#include <QRect>
#include <list>
namespace TiledUI {
class TileTreeNode {
private:
TileTreeNode *parent;
std::list<TileTreeNode*> children;
protected:
void setParent(TileTreeNode *newParent);
bool removeChild(TileTreeNode *child, bool recursive = false);
void addChild(TileTreeNode *child, int idx = -1);
int indexOf(TileTreeNode *child);
virtual ();
public:
TileTreeNode();
TileTreeNode(TileTreeNode *parent);
~TileTreeNode();
virtual QSize minimumSize() const = 0;
virtual QSize maximumSize() const = 0;
virtual QRect geometry() const = 0;
void resize(QSize size);
void resize(int width, int height);
virtual QWidget* parentWidget();
virtual void
};
}
#endif /* _TILE_TREE_NODE_HPP_ */
|
