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
|
/*
* This file is part of the Shiboken Python Binding Generator project.
*
* Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
*
* Contact: PySide team <contact@pyside.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation. 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.
*
* As a special exception to the GNU Lesser General Public License
* version 2.1, the object code form of a "work that uses the Library"
* may incorporate material from a header file that is part of the
* Library. You may distribute such object code under terms of your
* choice, provided that the incorporated material (i) does not exceed
* more than 5% of the total size of the Library; and (ii) is limited to
* numerical parameters, data structure layouts, accessors, macros,
* inline functions and templates.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#include "objecttype.h"
#include "objecttypelayout.h"
#include <algorithm>
#include <iostream>
using namespace std;
ObjectType::ObjectType(ObjectType* parent) : m_parent(0), m_layout(0)
{
setParent(parent);
}
ObjectType::~ObjectType()
{
for (ObjectTypeList::iterator child_iter = m_children.begin();
child_iter != m_children.end(); ++child_iter)
delete *child_iter;
}
ObjectType*
ObjectType::createWithChild()
{
ObjectType* parent = create();
ObjectType* child = create();
child->setObjectName("child");
child->setParent(parent);
return parent;
}
void
ObjectType::removeChild(ObjectType* child)
{
if (!child)
return;
ObjectTypeList::iterator child_iter = std::find(m_children.begin(), m_children.end(), child);
if (child_iter != m_children.end()) {
m_children.erase(child_iter);
child->m_parent = 0;
}
}
ObjectType*
ObjectType::takeChild(ObjectType* child)
{
if (!child)
return 0;
ObjectTypeList::iterator child_iter = std::find(m_children.begin(), m_children.end(), child);
if (child_iter != m_children.end()) {
m_children.erase(child_iter);
child->m_parent = 0;
return child;
}
return 0;
}
ObjectType*
ObjectType::takeChild(const Str& name)
{
return takeChild(findChild(name));
}
ObjectType*
ObjectType::findChild(const Str& name)
{
for (ObjectTypeList::iterator child_iter = m_children.begin();
child_iter != m_children.end(); ++child_iter) {
if ((*child_iter)->objectName() == name)
return *child_iter;
}
return 0;
}
void
ObjectType::killChild(const Str& name)
{
for (ObjectTypeList::iterator child_iter = m_children.begin();
child_iter != m_children.end(); ++child_iter) {
if ((*child_iter)->objectName() == name) {
ObjectType* child = *child_iter;
removeChild(child);
delete child;
break;
}
}
}
void
ObjectType::setParent(ObjectType* parent)
{
if (m_parent == parent)
return;
if (m_parent)
m_parent->removeChild(this);
m_parent = parent;
if (m_parent)
m_parent->m_children.push_back(this);
}
void
ObjectType::setObjectName(const Str& name)
{
m_objectName = name;
}
Str
ObjectType::objectName() const
{
return m_objectName;
}
bool
ObjectType::causeEvent(Event::EventType eventType)
{
Event e(eventType);
return event(&e);
}
bool
ObjectType::event(Event* event)
{
return true;
}
int
ObjectType::processEvent(ObjectTypeList objects, Event *event)
{
int evaluated = 0;
for (ObjectTypeList::iterator obj_iter = objects.begin();
obj_iter != objects.end(); ++obj_iter) {
if((*obj_iter)->event(event))
evaluated++;
}
return evaluated;
}
void ObjectType::setLayout(ObjectTypeLayout* l)
{
if (!l) {
cerr << "[WARNING] ObjectType::setLayout: Cannot set layout to 0." << endl;
return;
}
if (layout()) {
if (layout() != l) {
cerr << "[WARNING] ObjectType::setLayout: Attempting to set ObjectTypeLayout '" << l->objectName().cstring();
cerr << "' on ObjectType '" << objectName().cstring() << "', which already has a layout." << endl;
}
return;
}
ObjectType* oldParent = l->parent();
if (oldParent && oldParent != this) {
if (oldParent->isLayoutType()) {
cerr << "[WARNING] ObjectType::setLayout: Attempting to set ObjectTypeLayout '" << l->objectName().cstring();
cerr << "' on ObjectType '" << objectName().cstring() << "', when the ObjectTypeLayout already has a parent layout." << endl;
return;
} else {
// Steal the layout from an ObjectType parent.
oldParent->takeLayout();
}
}
m_layout = l;
if (oldParent != this) {
l->setParent(this);
l->reparentChildren(this);
}
}
ObjectTypeLayout* ObjectType::takeLayout()
{
ObjectTypeLayout* l = layout();
if (!l)
return 0;
m_layout = 0;
l->setParent(0);
return l;
}
unsigned int objectTypeHash(const ObjectType* objectType)
{
return reinterpret_cast<std::size_t>(objectType);
}
|
