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
|
/***************************************************************************
* Copyright (C) 2004 by Alexander Dymo *
* [email protected] *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Library General Public License as *
* published by the Free Software Foundation; either version 2 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 Library General Public *
* License along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "propertylist.h"
#include "property.h"
#include "multiproperty.h"
namespace PropertyLib{
PropertyList::PropertyList()
:TQObject(0, 0), m_propertyOwner(true)
{
}
PropertyList::PropertyList(bool propertyOwner)
:TQObject(0, 0), m_propertyOwner(propertyOwner)
{
}
PropertyList::~PropertyList()
{
clear();
}
MultiProperty *PropertyList::operator[](const TQString &name)
{
if (m_list.contains(name))
return m_list[name];
else
return new MultiProperty(this);
}
MultiProperty *PropertyList::property( const TQString &name )
{
if (m_list.contains(name))
return m_list[name];
else
return new MultiProperty(this);
}
void PropertyList::addProperty(Property *property)
{
if (property == 0)
return;
MultiProperty *mp = 0;
if ( m_list.contains(property->name()) )
{
mp = m_list[property->name()];
mp->addProperty(property);
}
else
{
mp = new MultiProperty(this, property);
m_list[property->name()] = mp;
addToGroup("", mp);
}
}
void PropertyList::addProperty(const TQString &group, Property *property)
{
if (property == 0)
return;
MultiProperty *mp = 0;
if (m_list.contains(property->name()))
{
mp = m_list[property->name()];
mp->addProperty(property);
}
else
{
mp = new MultiProperty(this, property);
m_list[property->name()] = mp;
addToGroup(group, mp);
}
}
void PropertyList::removeProperty(Property *property)
{
if (property == 0)
return;
if (m_propertyOwner)
emit aboutToDeleteProperty(property);
MultiProperty *mp = m_list[property->name()];
TQString group = m_groupOfProperty[mp];
removeFromGroup(mp);
TQString pname = property->name();
mp->removeProperty(property);
if (m_propertyOwner)
delete property;
if (mp->list.count() == 0)
{
// qWarning("rp: removing mp for %s itself", pname.ascii());
m_list.remove(pname);
delete mp;
}
else
addToGroup(group, mp);
}
void PropertyList::removeProperty(const TQString &name)
{
if (m_list.contains(name))
{
TQString group = m_groupOfProperty[m_list[name]];
removeFromGroup(m_list[name]);
Property *property;
for (property = m_list[name]->list.first(); property; property = m_list[name]->list.next())
{
if (m_propertyOwner)
emit aboutToDeleteProperty(property);
m_list[property->name()]->removeProperty(property);
if (m_propertyOwner)
delete property;
}
if (m_list[name]->list.count() == 0)
{
// qWarning("rp2: removing mp for %s itself", name.ascii());
delete m_list[name];
m_list.remove(name);
}
else
{
addToGroup(group, m_list[name]);
}
}
}
const TQValueList<QPair<TQString, TQValueList<TQString> > >& PropertyList::propertiesOfGroup() const
{
return m_propertiesOfGroup;
}
const TQMap<MultiProperty*, TQString>& PropertyList::groupOfProperty() const
{
return m_groupOfProperty;
}
void PropertyList::addToGroup(const TQString &group, MultiProperty *property)
{
if (!property)
return;
//do not add same property to the group twice
if (m_groupOfProperty.contains(property) && (m_groupOfProperty[property] == group))
return;
QPair<TQString, TQValueList<TQString> > *groupPair = 0;
for(TQValueList<QPair<TQString, TQValueList<TQString> > >::iterator it = m_propertiesOfGroup.begin();
it != m_propertiesOfGroup.end(); ++it)
{
if ((*it).first == group)
{
groupPair = &(*it);
break;
}
}
if (groupPair == 0)
{
groupPair = new QPair<TQString, TQValueList<TQString> >();
groupPair->first = group;
groupPair->second.append(property->name());
m_propertiesOfGroup.append(*groupPair);
m_groupOfProperty[property] = group;
return;
}
//check if group already contains property with the same name
if (!groupPair->second.contains(property->name()))
groupPair->second.append(property->name());
m_groupOfProperty[property] = group;
}
void PropertyList::removeFromGroup(MultiProperty *property)
{
TQString group = m_groupOfProperty[property];
// qWarning("removeFromGroup group=%s", group.ascii());
for(TQValueList<QPair<TQString, TQValueList<TQString> > >::iterator it = m_propertiesOfGroup.begin();
it != m_propertiesOfGroup.end(); ++it)
{
// qWarning("removeFromGroup checking %s", (*it).first.ascii());
if ((*it).first == group)
{
// qWarning("removeFromGroup removing %s", property->name().ascii());
(*it).second.remove(property->name());
break;
}
}
m_groupOfProperty.remove(property);
}
void PropertyList::clear( )
{
for (TQMap<TQString, MultiProperty*>::iterator it = m_list.begin(); it != m_list.end(); ++it)
removeProperty(it.key());
}
bool PropertyList::contains( const TQString & name )
{
if (m_list.contains(name))
return true;
return false;
}
TQPtrList<Property> PropertyList::properties(const TQString &name)
{
if (m_list.contains(name))
return m_list[name]->list;
return TQPtrList<Property>();
}
PropertyList::Iterator PropertyList::begin()
{
return Iterator(this);
}
PropertyList::Iterator PropertyList::end()
{
return Iterator(this, true);
}
//PropertyList::Iterator class
PropertyList::Iterator::Iterator(PropertyList *list)
:m_list(list)
{
current = m_list->m_list.begin();
}
PropertyList::Iterator::Iterator(PropertyList *list, bool // end
)
:m_list(list)
{
current = m_list->m_list.end();
}
void PropertyList::Iterator::operator ++()
{
next();
}
void PropertyList::Iterator::operator ++(int)
{
next();
}
void PropertyList::Iterator::next()
{
++current;
}
MultiProperty *PropertyList::Iterator::operator *()
{
return data();
}
TQString PropertyList::Iterator::key()
{
return current.key();
}
MultiProperty *PropertyList::Iterator::data()
{
return current.data();
}
bool PropertyList::Iterator::operator !=(Iterator it)
{
return current != it.current;
}
// PropertyBuffer class
PropertyBuffer::PropertyBuffer( )
:PropertyList(false)
{
}
void PropertyBuffer::intersect(const PropertyList *list)
{
qWarning("PropertyBuffer::intersect");
for (TQMap<TQString, MultiProperty*>::iterator it = m_list.begin(); it != m_list.end(); ++it)
{
// qWarning("intersect:: for mp = %s", it.data()->name().ascii());
if (list->m_list.contains(it.key()))
{
/* qWarning("intersect:: list contains %s", it.key().ascii());
if ( (*(it.data()) == *(list->m_list[it.key()])))
qWarning("intersect:: equal properties");
else
qWarning("intersect:: not equal properties");*/
if ( ((*it.data()) == *(list->m_list[it.key()]))
&& (list->m_groupOfProperty[list->m_list[it.key()]] == m_groupOfProperty[it.data()]) )
{
// qWarning("intersect:: equal properties, adding");
it.data()->addProperty(list->m_list[it.key()]);
continue;
}
}
// qWarning("intersect:: removing %s from intersection", it.key().ascii());
removeProperty(it.key());
}
connect(list, TQT_SIGNAL(propertyValueChanged(Property*)), this, TQT_SLOT(intersectedValueChanged(Property*)));
}
void PropertyBuffer::intersectedValueChanged(Property *property)
{
// qWarning("PropertyBuffer::intersectedValueChanged");
TQString propertyName = property->name();
if (!contains(propertyName))
return;
MultiProperty mp(property);
if (mp == *m_list[propertyName])
{
Property *prop;
TQPtrList<Property> props = properties(propertyName);
for (prop = props.first(); prop; prop = props.next())
emit propertyValueChanged(prop);
}
}
PropertyBuffer::PropertyBuffer(PropertyList *list)
:PropertyList(false)
{
//deep copy of m_list
for (TQMap<TQString, MultiProperty*>::const_iterator it = list->m_list.begin();
it != list->m_list.end(); ++it)
{
MultiProperty *mp = new MultiProperty(*it.data());
mp->m_propertyList = this;
addToGroup(list->m_groupOfProperty[it.data()], mp);
m_list[it.key()] = mp;
}
connect(list, TQT_SIGNAL(propertyValueChanged(Property*)), this, TQT_SLOT(intersectedValueChanged(Property*)));
}
}
#ifndef PURE_QT
#include "propertylist.moc"
#endif
|