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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/****************************************************************************
**
** Copyright (C) 2018 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the Qt OPC UA module.
**
** $QT_BEGIN_LICENSE:LGPL3$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see http://www.qt.io/terms-conditions. For further
** information use the contact form at http://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPLv3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or later 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 2.0 requirements will be
** met: http://www.gnu.org/licenses/gpl-2.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "opcuarelativenodeid.h"
#include "opcuanodeid.h"
#include "opcuarelativenodepath.h"
QT_BEGIN_NAMESPACE
/*!
\qmltype RelativeNodeId
\inqmlmodule QtOpcUa
\brief Specifies a relative node by a start node and a path.
\since QtOpcUa 5.12
Proceeding from the given start node, the server tries to match the content
of the path property to any existing nodes on the server. Only if the path fully
matches to exactly one single target node, it will be used. Partial or multiple
matches can not be handled and are treated as error.
\code
import QtOpcUa 5.13 as QtOpcUa
QtOpcUa.RelativeNodeId {
startNode: QtOpcUa.RelativeNodeId {
identifier: "s=Example.Node"
ns: "Example Namespace"
}
path: [ QtOpcUa.RelativeNodePath {
ns: "Test Namespace"
browseName: "SomeName"
}
...
]
}
}
\endcode
\sa NodeId, Node
*/
/*!
\qmlproperty NodeId RelativeNodeId::startNode
Namespace of the node identifier.
The start node specifies the node where resolving the path starts.
It can be an absolute or relative node ID.
\sa NodeId, RelativeNodeId
*/
/*!
\qmlproperty list RelativeNodeId::path
Search path for the designated node.
This is a list of \c OpcUaRelativeNodePath objects specifying the path where
the target node can be found relative to the start node.
*/
/*!
\qmlsignal Relative::nodeChanged()
Emitted when the underlying node has changed.
This happens when the namespace or identifier has changed.
*/
OpcUaRelativeNodeId::OpcUaRelativeNodeId(QObject *parent) : OpcUaNodeIdType(parent)
{
}
OpcUaNodeIdType *OpcUaRelativeNodeId::startNode() const
{
return m_startNode;
}
void OpcUaRelativeNodeId::setStartNode(OpcUaNodeIdType *startNode)
{
if (m_startNode == startNode)
return;
if (m_startNode)
disconnect(m_startNode);
m_startNode = startNode;
connect(m_startNode, &OpcUaNodeIdType::nodeChanged, this, &OpcUaRelativeNodeId::nodeChanged);
emit startNodeChanged(m_startNode);
emit nodeChanged();
}
QQmlListProperty<OpcUaRelativeNodePath> OpcUaRelativeNodeId::paths()
{
return QQmlListProperty<OpcUaRelativeNodePath>(this, this,
&OpcUaRelativeNodeId::appendPath,
&OpcUaRelativeNodeId::pathCount,
&OpcUaRelativeNodeId::path,
&OpcUaRelativeNodeId::clearPaths);
}
void OpcUaRelativeNodeId::appendPath(OpcUaRelativeNodePath* p) {
if (!p)
return;
m_paths.append(p);
emit pathChanged();
emit nodeChanged();
}
int OpcUaRelativeNodeId::pathCount() const
{
return m_paths.count();
}
OpcUaRelativeNodePath *OpcUaRelativeNodeId::path(int index) const
{
return m_paths.at(index);
}
void OpcUaRelativeNodeId::clearPaths() {
m_paths.clear();
emit pathChanged();
emit nodeChanged();
}
void OpcUaRelativeNodeId::appendPath(QQmlListProperty<OpcUaRelativeNodePath>* list, OpcUaRelativeNodePath* p) {
reinterpret_cast< OpcUaRelativeNodeId* >(list->data)->appendPath(p);
}
void OpcUaRelativeNodeId::clearPaths(QQmlListProperty<OpcUaRelativeNodePath>* list) {
reinterpret_cast< OpcUaRelativeNodeId* >(list->data)->clearPaths();
}
OpcUaRelativeNodePath* OpcUaRelativeNodeId::path(QQmlListProperty<OpcUaRelativeNodePath>* list, int i) {
return reinterpret_cast< OpcUaRelativeNodeId* >(list->data)->path(i);
}
int OpcUaRelativeNodeId::pathCount(QQmlListProperty<OpcUaRelativeNodePath>* list) {
return reinterpret_cast< OpcUaRelativeNodeId* >(list->data)->pathCount();
}
QT_END_NAMESPACE
|
