0
|
1 |
/****************************************************************************
|
|
2 |
**
|
|
3 |
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
4 |
** All rights reserved.
|
|
5 |
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
6 |
**
|
|
7 |
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
|
|
8 |
**
|
|
9 |
** $QT_BEGIN_LICENSE:LGPL$
|
|
10 |
** No Commercial Usage
|
|
11 |
** This file contains pre-release code and may not be distributed.
|
|
12 |
** You may use this file in accordance with the terms and conditions
|
|
13 |
** contained in the Technology Preview License Agreement accompanying
|
|
14 |
** this package.
|
|
15 |
**
|
|
16 |
** GNU Lesser General Public License Usage
|
|
17 |
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
18 |
** General Public License version 2.1 as published by the Free Software
|
|
19 |
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
20 |
** packaging of this file. Please review the following information to
|
|
21 |
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
22 |
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
23 |
**
|
|
24 |
** In addition, as a special exception, Nokia gives you certain additional
|
|
25 |
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
26 |
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
27 |
**
|
|
28 |
** If you have questions regarding the use of this file, please contact
|
|
29 |
** Nokia at qt-info@nokia.com.
|
|
30 |
**
|
|
31 |
**
|
|
32 |
**
|
|
33 |
**
|
|
34 |
**
|
|
35 |
**
|
|
36 |
**
|
|
37 |
**
|
|
38 |
** $QT_END_LICENSE$
|
|
39 |
**
|
|
40 |
****************************************************************************/
|
|
41 |
|
|
42 |
#include "qbuiltintypes_p.h"
|
|
43 |
#include "qcommonsequencetypes_p.h"
|
|
44 |
#include "qitemmappingiterator_p.h"
|
|
45 |
|
|
46 |
#include "qcopyof_p.h"
|
|
47 |
|
|
48 |
QT_BEGIN_NAMESPACE
|
|
49 |
|
|
50 |
using namespace QPatternist;
|
|
51 |
|
|
52 |
CopyOf::CopyOf(const Expression::Ptr &operand,
|
|
53 |
const bool inheritNSS,
|
|
54 |
const bool preserveNSS) : SingleContainer(operand)
|
|
55 |
, m_inheritNamespaces(inheritNSS)
|
|
56 |
, m_preserveNamespaces(preserveNSS)
|
|
57 |
, m_settings((m_inheritNamespaces ? QAbstractXmlNodeModel::InheritNamespaces : QAbstractXmlNodeModel::NodeCopySettings()) |
|
|
58 |
(m_preserveNamespaces ? QAbstractXmlNodeModel::PreserveNamespaces : QAbstractXmlNodeModel::NodeCopySettings()))
|
|
59 |
{
|
|
60 |
}
|
|
61 |
|
|
62 |
Expression::Ptr CopyOf::compress(const StaticContext::Ptr &context)
|
|
63 |
{
|
|
64 |
/* We have zero effect if we have these settings. */
|
|
65 |
if(m_inheritNamespaces && m_preserveNamespaces)
|
|
66 |
return m_operand->compress(context);
|
|
67 |
else
|
|
68 |
{
|
|
69 |
const ItemType::Ptr t(m_operand->staticType()->itemType());
|
|
70 |
/* We have no effect on the empty sequence or atomic values. */
|
|
71 |
if(BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t)
|
|
72 |
|| *t == *CommonSequenceTypes::Empty)
|
|
73 |
return m_operand->compress(context);
|
|
74 |
else
|
|
75 |
return SingleContainer::compress(context);
|
|
76 |
}
|
|
77 |
}
|
|
78 |
|
|
79 |
void CopyOf::evaluateToSequenceReceiver(const DynamicContext::Ptr &context) const
|
|
80 |
{
|
|
81 |
/* Optimization: this completely breaks streaming. We get a call to
|
|
82 |
* evaluateToSequenceReceiver() but we require heap allocations by calling
|
|
83 |
* evaluateSequence(). */
|
|
84 |
|
|
85 |
const Item::Iterator::Ptr it(m_operand->evaluateSequence(context));
|
|
86 |
QAbstractXmlReceiver *const receiver = context->outputReceiver();
|
|
87 |
Item next(it->next());
|
|
88 |
|
|
89 |
while(next)
|
|
90 |
{
|
|
91 |
if(next.isNode())
|
|
92 |
{
|
|
93 |
const QXmlNodeModelIndex &asNode = next.asNode();
|
|
94 |
asNode.model()->copyNodeTo(asNode, receiver, m_settings);
|
|
95 |
}
|
|
96 |
else
|
|
97 |
receiver->item(next);
|
|
98 |
|
|
99 |
next = it->next();
|
|
100 |
}
|
|
101 |
}
|
|
102 |
|
|
103 |
ExpressionVisitorResult::Ptr CopyOf::accept(const ExpressionVisitor::Ptr &visitor) const
|
|
104 |
{
|
|
105 |
return visitor->visit(this);
|
|
106 |
}
|
|
107 |
|
|
108 |
SequenceType::Ptr CopyOf::staticType() const
|
|
109 |
{
|
|
110 |
return m_operand->staticType();
|
|
111 |
}
|
|
112 |
|
|
113 |
SequenceType::List CopyOf::expectedOperandTypes() const
|
|
114 |
{
|
|
115 |
SequenceType::List result;
|
|
116 |
result.append(CommonSequenceTypes::ZeroOrMoreItems);
|
|
117 |
return result;
|
|
118 |
}
|
|
119 |
|
|
120 |
Expression::Properties CopyOf::properties() const
|
|
121 |
{
|
|
122 |
/* We have the content of node constructors as children, but even though
|
|
123 |
* createCopyOf() typically avoids creating us, we can still end up with an operand
|
|
124 |
* that allows compression. We must always avoid that, because we don't have
|
|
125 |
* implementation of evaluateSequence(), and so on. */
|
|
126 |
return (m_operand->properties() & ~CreatesFocusForLast) | DisableElimination;
|
|
127 |
}
|
|
128 |
|
|
129 |
ItemType::Ptr CopyOf::expectedContextItemType() const
|
|
130 |
{
|
|
131 |
return m_operand->expectedContextItemType();
|
|
132 |
}
|
|
133 |
|
|
134 |
QT_END_NAMESPACE
|