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
|
/*
This file is part of KDE Schema Parser.
Copyright (c) 2013 David Faure <david.faure@kdab.com>
This program 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 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 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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "group.h"
namespace XSD
{
class Group::Private
{
public:
QName mReference;
Element::List mElements;
};
Group::Group()
: XmlElement(), d(new Private)
{
}
Group::Group(const Group &other)
: XmlElement(other), d(new Private)
{
*d = *other.d;
}
Group::~Group()
{
delete d;
}
Group &Group::operator=(const Group &other)
{
if (this == &other) {
return *this;
}
*d = *other.d;
return *this;
}
void Group::setReference(const QName &reference)
{
d->mReference = reference;
}
QName Group::reference() const
{
return d->mReference;
}
void Group::setElements(const Element::List &elements)
{
d->mElements = elements;
}
Element::List Group::elements() const
{
return d->mElements;
}
bool Group::isResolved() const
{
return !d->mElements.isEmpty() || d->mReference.isEmpty();
}
}
QDebug operator<<(QDebug dbg, const XSD::Group &group)
{
dbg << group.qualifiedName();
return dbg;
}
|
