blob: 87362559aa1f9b6fea5b61aa18cf5751205a2c45 (
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
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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. 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.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qxsdschemamerger_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
XsdSchemaMerger::XsdSchemaMerger(const XsdSchema::Ptr &schema, const XsdSchema::Ptr &otherSchema)
{
merge(schema, otherSchema);
}
XsdSchema::Ptr XsdSchemaMerger::mergedSchema() const
{
return m_mergedSchema;
}
void XsdSchemaMerger::merge(const XsdSchema::Ptr &schema, const XsdSchema::Ptr &otherSchema)
{
m_mergedSchema = XsdSchema::Ptr(new XsdSchema(otherSchema->namePool()));
// first fill the merged schema with the values from schema
if (schema) {
const XsdElement::List elements = schema->elements();
for (int i = 0; i < elements.count(); ++i) {
m_mergedSchema->addElement(elements.at(i));
}
const XsdAttribute::List attributes = schema->attributes();
for (int i = 0; i < attributes.count(); ++i) {
m_mergedSchema->addAttribute(attributes.at(i));
}
const SchemaType::List types = schema->types();
for (int i = 0; i < types.count(); ++i) {
m_mergedSchema->addType(types.at(i));
}
const SchemaType::List anonymousTypes = schema->anonymousTypes();
for (int i = 0; i < anonymousTypes.count(); ++i) {
m_mergedSchema->addAnonymousType(anonymousTypes.at(i));
}
const XsdModelGroup::List elementGroups = schema->elementGroups();
for (int i = 0; i < elementGroups.count(); ++i) {
m_mergedSchema->addElementGroup(elementGroups.at(i));
}
const XsdAttributeGroup::List attributeGroups = schema->attributeGroups();
for (int i = 0; i < attributeGroups.count(); ++i) {
m_mergedSchema->addAttributeGroup(attributeGroups.at(i));
}
const XsdNotation::List notations = schema->notations();
for (int i = 0; i < notations.count(); ++i) {
m_mergedSchema->addNotation(notations.at(i));
}
const XsdIdentityConstraint::List identityConstraints = schema->identityConstraints();
for (int i = 0; i < identityConstraints.count(); ++i) {
m_mergedSchema->addIdentityConstraint(identityConstraints.at(i));
}
}
// then merge in the values from the otherSchema
{
const XsdElement::List elements = otherSchema->elements();
for (int i = 0; i < elements.count(); ++i) {
if (!m_mergedSchema->element(elements.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addElement(elements.at(i));
}
const XsdAttribute::List attributes = otherSchema->attributes();
for (int i = 0; i < attributes.count(); ++i) {
if (!m_mergedSchema->attribute(attributes.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addAttribute(attributes.at(i));
}
const SchemaType::List types = otherSchema->types();
for (int i = 0; i < types.count(); ++i) {
if (!m_mergedSchema->type(types.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addType(types.at(i));
}
const SchemaType::List anonymousTypes = otherSchema->anonymousTypes();
for (int i = 0; i < anonymousTypes.count(); ++i) {
// add anonymous type as they are
m_mergedSchema->addAnonymousType(anonymousTypes.at(i));
}
const XsdModelGroup::List elementGroups = otherSchema->elementGroups();
for (int i = 0; i < elementGroups.count(); ++i) {
if (!m_mergedSchema->elementGroup(elementGroups.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addElementGroup(elementGroups.at(i));
}
const XsdAttributeGroup::List attributeGroups = otherSchema->attributeGroups();
for (int i = 0; i < attributeGroups.count(); ++i) {
if (!m_mergedSchema->attributeGroup(attributeGroups.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addAttributeGroup(attributeGroups.at(i));
}
const XsdNotation::List notations = otherSchema->notations();
for (int i = 0; i < notations.count(); ++i) {
if (!m_mergedSchema->notation(notations.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addNotation(notations.at(i));
}
const XsdIdentityConstraint::List identityConstraints = otherSchema->identityConstraints();
for (int i = 0; i < identityConstraints.count(); ++i) {
if (!m_mergedSchema->identityConstraint(identityConstraints.at(i)->name(otherSchema->namePool())))
m_mergedSchema->addIdentityConstraint(identityConstraints.at(i));
}
}
}
QT_END_NAMESPACE
|
