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
|
/****************************************************************************
**
** Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** 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 "qxsdidchelper_p.h"
#include "qderivedstring_p.h"
#include "qxsdschemahelper_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
FieldNode::FieldNode()
{
}
FieldNode::FieldNode(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type)
: m_item(item)
, m_data(data)
, m_type(type)
{
}
bool FieldNode::isEmpty() const
{
return m_item.isNull();
}
bool FieldNode::isEqualTo(const FieldNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const
{
if (m_type != other.m_type)
return false;
const DerivedString<TypeString>::Ptr string = DerivedString<TypeString>::fromLexical(namePool, m_data);
const DerivedString<TypeString>::Ptr otherString = DerivedString<TypeString>::fromLexical(namePool, other.m_data);
return XsdSchemaHelper::constructAndCompare(string, AtomicComparator::OperatorEqual, otherString, m_type, context, reflection);
}
QXmlItem FieldNode::item() const
{
return m_item;
}
TargetNode::TargetNode(const QXmlItem &item)
: m_item(item)
{
}
QXmlItem TargetNode::item() const
{
return m_item;
}
QVector<QXmlItem> TargetNode::fieldItems() const
{
QVector<QXmlItem> items;
for (int i = 0; i < m_fields.count(); ++i)
items.append(m_fields.at(i).item());
return items;
}
int TargetNode::emptyFieldsCount() const
{
int counter = 0;
for (int i = 0; i < m_fields.count(); ++i) {
if (m_fields.at(i).isEmpty())
++counter;
}
return counter;
}
bool TargetNode::fieldsAreEqual(const TargetNode &other, const NamePool::Ptr &namePool, const ReportContext::Ptr &context, const SourceLocationReflection *const reflection) const
{
if (m_fields.count() != other.m_fields.count())
return false;
for (int i = 0; i < m_fields.count(); ++i) {
if (!m_fields.at(i).isEqualTo(other.m_fields.at(i), namePool, context, reflection))
return false;
}
return true;
}
void TargetNode::addField(const QXmlItem &item, const QString &data, const SchemaType::Ptr &type)
{
m_fields.append(FieldNode(item, data, type));
}
bool TargetNode::operator==(const TargetNode &other) const
{
return (m_item.toNodeModelIndex() == other.m_item.toNodeModelIndex());
}
QT_END_NAMESPACE
|
