1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2016 The Qt Company Ltd. |
4 | ** Contact: https://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 https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://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 3 as published by the Free Software |
20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
21 | ** packaging of this file. Please review the following information to |
22 | ** ensure the GNU Lesser General Public License version 3 requirements |
23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
24 | ** |
25 | ** GNU General Public License Usage |
26 | ** Alternatively, this file may be used under the terms of the GNU |
27 | ** General Public License version 2.0 or (at your option) the GNU General |
28 | ** Public license version 3 or any later version approved by the KDE Free |
29 | ** Qt Foundation. The licenses are as published by the Free Software |
30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
31 | ** included in the packaging of this file. Please review the following |
32 | ** information to ensure the GNU General Public License requirements will |
33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
35 | ** |
36 | ** $QT_END_LICENSE$ |
37 | ** |
38 | ****************************************************************************/ |
39 | |
40 | #include "qxsdidchelper_p.h" |
41 | |
42 | #include "qderivedstring_p.h" |
43 | #include "qxsdschemahelper_p.h" |
44 | |
45 | QT_BEGIN_NAMESPACE |
46 | |
47 | using namespace QPatternist; |
48 | |
49 | FieldNode::FieldNode() |
50 | { |
51 | } |
52 | |
53 | FieldNode::FieldNode(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type) |
54 | : m_item(item) |
55 | , m_data(data) |
56 | , m_type(type) |
57 | { |
58 | } |
59 | |
60 | bool FieldNode::isEmpty() const |
61 | { |
62 | return m_item.isNull(); |
63 | } |
64 | |
65 | bool FieldNode::isEqualTo(const FieldNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const |
66 | { |
67 | if (m_type != other.m_type) |
68 | return false; |
69 | |
70 | const DerivedString<TypeString>::Ptr string = DerivedString<TypeString>::fromLexical(np: namePool, lexical: m_data); |
71 | const DerivedString<TypeString>::Ptr otherString = DerivedString<TypeString>::fromLexical(np: namePool, lexical: other.m_data); |
72 | |
73 | return XsdSchemaHelper::constructAndCompare(operand1: string, op: AtomicComparator::OperatorEqual, operand2: otherString, type: m_type, context, sourceLocationReflection: reflection); |
74 | } |
75 | |
76 | QXmlItem FieldNode::item() const |
77 | { |
78 | return m_item; |
79 | } |
80 | |
81 | TargetNode::TargetNode(const QXmlItem &item) |
82 | : m_item(item) |
83 | { |
84 | } |
85 | |
86 | QXmlItem TargetNode::item() const |
87 | { |
88 | return m_item; |
89 | } |
90 | |
91 | QVector<QXmlItem> TargetNode::fieldItems() const |
92 | { |
93 | QVector<QXmlItem> items; |
94 | |
95 | for (int i = 0; i < m_fields.count(); ++i) |
96 | items.append(t: m_fields.at(i).item()); |
97 | |
98 | return items; |
99 | } |
100 | |
101 | int TargetNode::emptyFieldsCount() const |
102 | { |
103 | int counter = 0; |
104 | for (int i = 0; i < m_fields.count(); ++i) { |
105 | if (m_fields.at(i).isEmpty()) |
106 | ++counter; |
107 | } |
108 | |
109 | return counter; |
110 | } |
111 | |
112 | bool TargetNode::fieldsAreEqual(const TargetNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const |
113 | { |
114 | if (m_fields.count() != other.m_fields.count()) |
115 | return false; |
116 | |
117 | for (int i = 0; i < m_fields.count(); ++i) { |
118 | if (!m_fields.at(i).isEqualTo(other: other.m_fields.at(i), namePool, context, reflection)) |
119 | return false; |
120 | } |
121 | |
122 | return true; |
123 | } |
124 | |
125 | void TargetNode::addField(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type) |
126 | { |
127 | m_fields.append(t: FieldNode(item, data, type)); |
128 | } |
129 | |
130 | bool TargetNode::operator==(const TargetNode &other) const |
131 | { |
132 | return (m_item.toNodeModelIndex() == other.m_item.toNodeModelIndex()); |
133 | } |
134 | |
135 | QT_END_NAMESPACE |
136 | |