1 /****************************************************************************
3 ** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
4 ** Contact: http://www.qt-project.org/legal
6 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** Commercial License Usage
10 ** Licensees holding valid commercial Qt licenses may use this file in
11 ** accordance with the commercial license agreement provided with the
12 ** Software or, alternatively, in accordance with the terms contained in
13 ** a written agreement between you and Digia. For licensing terms and
14 ** conditions see http://qt.digia.com/licensing. For further information
15 ** use the contact form at http://qt.digia.com/contact-us.
17 ** GNU Lesser General Public License Usage
18 ** Alternatively, this file may be used under the terms of the GNU Lesser
19 ** General Public License version 2.1 as published by the Free Software
20 ** Foundation and appearing in the file LICENSE.LGPL included in the
21 ** packaging of this file. Please review the following information to
22 ** ensure the GNU Lesser General Public License version 2.1 requirements
23 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
25 ** In addition, as a special exception, Digia gives you certain additional
26 ** rights. These rights are described in the Digia Qt LGPL Exception
27 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
29 ** GNU General Public License Usage
30 ** Alternatively, this file may be used under the terms of the GNU
31 ** General Public License version 3.0 as published by the Free Software
32 ** Foundation and appearing in the file LICENSE.GPL included in the
33 ** packaging of this file. Please review the following information to
34 ** ensure the GNU General Public License version 3.0 requirements will be
35 ** met: http://www.gnu.org/copyleft/gpl.html.
40 ****************************************************************************/
42 #include "qxsdschemamerger_p.h"
46 using namespace QPatternist;
48 XsdSchemaMerger::XsdSchemaMerger(const XsdSchema::Ptr &schema, const XsdSchema::Ptr &otherSchema)
50 merge(schema, otherSchema);
53 XsdSchema::Ptr XsdSchemaMerger::mergedSchema() const
55 return m_mergedSchema;
58 void XsdSchemaMerger::merge(const XsdSchema::Ptr &schema, const XsdSchema::Ptr &otherSchema)
60 m_mergedSchema = XsdSchema::Ptr(new XsdSchema(otherSchema->namePool()));
62 // first fill the merged schema with the values from schema
64 const XsdElement::List elements = schema->elements();
65 for (int i = 0; i < elements.count(); ++i) {
66 m_mergedSchema->addElement(elements.at(i));
69 const XsdAttribute::List attributes = schema->attributes();
70 for (int i = 0; i < attributes.count(); ++i) {
71 m_mergedSchema->addAttribute(attributes.at(i));
74 const SchemaType::List types = schema->types();
75 for (int i = 0; i < types.count(); ++i) {
76 m_mergedSchema->addType(types.at(i));
79 const SchemaType::List anonymousTypes = schema->anonymousTypes();
80 for (int i = 0; i < anonymousTypes.count(); ++i) {
81 m_mergedSchema->addAnonymousType(anonymousTypes.at(i));
84 const XsdModelGroup::List elementGroups = schema->elementGroups();
85 for (int i = 0; i < elementGroups.count(); ++i) {
86 m_mergedSchema->addElementGroup(elementGroups.at(i));
89 const XsdAttributeGroup::List attributeGroups = schema->attributeGroups();
90 for (int i = 0; i < attributeGroups.count(); ++i) {
91 m_mergedSchema->addAttributeGroup(attributeGroups.at(i));
94 const XsdNotation::List notations = schema->notations();
95 for (int i = 0; i < notations.count(); ++i) {
96 m_mergedSchema->addNotation(notations.at(i));
99 const XsdIdentityConstraint::List identityConstraints = schema->identityConstraints();
100 for (int i = 0; i < identityConstraints.count(); ++i) {
101 m_mergedSchema->addIdentityConstraint(identityConstraints.at(i));
105 // then merge in the values from the otherSchema
107 const XsdElement::List elements = otherSchema->elements();
108 for (int i = 0; i < elements.count(); ++i) {
109 if (!m_mergedSchema->element(elements.at(i)->name(otherSchema->namePool())))
110 m_mergedSchema->addElement(elements.at(i));
113 const XsdAttribute::List attributes = otherSchema->attributes();
114 for (int i = 0; i < attributes.count(); ++i) {
115 if (!m_mergedSchema->attribute(attributes.at(i)->name(otherSchema->namePool())))
116 m_mergedSchema->addAttribute(attributes.at(i));
119 const SchemaType::List types = otherSchema->types();
120 for (int i = 0; i < types.count(); ++i) {
121 if (!m_mergedSchema->type(types.at(i)->name(otherSchema->namePool())))
122 m_mergedSchema->addType(types.at(i));
125 const SchemaType::List anonymousTypes = otherSchema->anonymousTypes();
126 for (int i = 0; i < anonymousTypes.count(); ++i) {
127 // add anonymous type as they are
128 m_mergedSchema->addAnonymousType(anonymousTypes.at(i));
131 const XsdModelGroup::List elementGroups = otherSchema->elementGroups();
132 for (int i = 0; i < elementGroups.count(); ++i) {
133 if (!m_mergedSchema->elementGroup(elementGroups.at(i)->name(otherSchema->namePool())))
134 m_mergedSchema->addElementGroup(elementGroups.at(i));
137 const XsdAttributeGroup::List attributeGroups = otherSchema->attributeGroups();
138 for (int i = 0; i < attributeGroups.count(); ++i) {
139 if (!m_mergedSchema->attributeGroup(attributeGroups.at(i)->name(otherSchema->namePool())))
140 m_mergedSchema->addAttributeGroup(attributeGroups.at(i));
143 const XsdNotation::List notations = otherSchema->notations();
144 for (int i = 0; i < notations.count(); ++i) {
145 if (!m_mergedSchema->notation(notations.at(i)->name(otherSchema->namePool())))
146 m_mergedSchema->addNotation(notations.at(i));
149 const XsdIdentityConstraint::List identityConstraints = otherSchema->identityConstraints();
150 for (int i = 0; i < identityConstraints.count(); ++i) {
151 if (!m_mergedSchema->identityConstraint(identityConstraints.at(i)->name(otherSchema->namePool())))
152 m_mergedSchema->addIdentityConstraint(identityConstraints.at(i));