1 /****************************************************************************
2 **
3 ** Copyright (C) 2015 The Qt Company Ltd.
4 ** Contact: http://www.qt.io/licensing/
5 **
6 ** This file is part of the QtXmlPatterns module of the Qt Toolkit.
7 **
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 The Qt Company. For licensing terms
14 ** and conditions see http://www.qt.io/terms-conditions. For further
15 ** information use the contact form at http://www.qt.io/contact-us.
16 **
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 or version 3 as published by the Free
20 ** Software Foundation and appearing in the file LICENSE.LGPLv21 and
21 ** LICENSE.LGPLv3 included in the packaging of this file. Please review the
22 ** following information to ensure the GNU Lesser General Public License
23 ** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
24 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
25 **
26 ** As a special exception, The Qt Company gives you certain additional
27 ** rights. These rights are described in The Qt Company LGPL Exception
28 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
29 **
30 ** GNU General Public License Usage
31 ** Alternatively, this file may be used under the terms of the GNU
32 ** General Public License version 3.0 as published by the Free Software
33 ** Foundation and appearing in the file LICENSE.GPL included in the
34 ** packaging of this file. Please review the following information to
35 ** ensure the GNU General Public License version 3.0 requirements will be
36 ** met: http://www.gnu.org/copyleft/gpl.html.
37 **
38 ** $QT_END_LICENSE$
39 **
40 ****************************************************************************/
41
42 #include "qxsdidchelper_p.h"
43
44 #include "qderivedstring_p.h"
45 #include "qxsdschemahelper_p.h"
46
47 QT_BEGIN_NAMESPACE
48
49 using namespace QPatternist;
50
FieldNode()51 FieldNode::FieldNode()
52 {
53 }
54
FieldNode(const QXmlItem & item,const QString & data,const SchemaType::Ptr & type)55 FieldNode::FieldNode(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type)
56 : m_item(item)
57 , m_data(data)
58 , m_type(type)
59 {
60 }
61
isEmpty() const62 bool FieldNode::isEmpty() const
63 {
64 return m_item.isNull();
65 }
66
isEqualTo(const FieldNode & other,const NamePool::Ptr & namePool,const ReportContext::Ptr & context,const SourceLocationReflection * const reflection) const67 bool FieldNode::isEqualTo(const FieldNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const
68 {
69 if (m_type != other.m_type)
70 return false;
71
72 const DerivedString<TypeString>::Ptr string = DerivedString<TypeString>::fromLexical(namePool, m_data);
73 const DerivedString<TypeString>::Ptr otherString = DerivedString<TypeString>::fromLexical(namePool, other.m_data);
74
75 return XsdSchemaHelper::constructAndCompare(string, AtomicComparator::OperatorEqual, otherString, m_type, context, reflection);
76 }
77
item() const78 QXmlItem FieldNode::item() const
79 {
80 return m_item;
81 }
82
TargetNode(const QXmlItem & item)83 TargetNode::TargetNode(const QXmlItem &item)
84 : m_item(item)
85 {
86 }
87
item() const88 QXmlItem TargetNode::item() const
89 {
90 return m_item;
91 }
92
fieldItems() const93 QVector<QXmlItem> TargetNode::fieldItems() const
94 {
95 QVector<QXmlItem> items;
96
97 for (int i = 0; i < m_fields.count(); ++i)
98 items.append(m_fields.at(i).item());
99
100 return items;
101 }
102
emptyFieldsCount() const103 int TargetNode::emptyFieldsCount() const
104 {
105 int counter = 0;
106 for (int i = 0; i < m_fields.count(); ++i) {
107 if (m_fields.at(i).isEmpty())
108 ++counter;
109 }
110
111 return counter;
112 }
113
fieldsAreEqual(const TargetNode & other,const NamePool::Ptr & namePool,const ReportContext::Ptr & context,const SourceLocationReflection * const reflection) const114 bool TargetNode::fieldsAreEqual(const TargetNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const
115 {
116 if (m_fields.count() != other.m_fields.count())
117 return false;
118
119 for (int i = 0; i < m_fields.count(); ++i) {
120 if (!m_fields.at(i).isEqualTo(other.m_fields.at(i), namePool, context, reflection))
121 return false;
122 }
123
124 return true;
125 }
126
addField(const QXmlItem & item,const QString & data,const SchemaType::Ptr & type)127 void TargetNode::addField(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type)
128 {
129 m_fields.append(FieldNode(item, data, type));
130 }
131
operator ==(const TargetNode & other) const132 bool TargetNode::operator==(const TargetNode &other) const
133 {
134 return (m_item.toNodeModelIndex() == other.m_item.toNodeModelIndex());
135 }
136
137 QT_END_NAMESPACE
138