author | Eckhart Koeppen <eckhart.koppen@nokia.com> |
Mon, 19 Apr 2010 10:15:19 +0300 | |
branch | RCL_3 |
changeset 9 | b5b118452c7d |
parent 4 | 3b1da2848fc7 |
permissions | -rw-r--r-- |
0 | 1 |
/**************************************************************************** |
2 |
** |
|
4
3b1da2848fc7
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3 |
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
0 | 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 "qatomicstring_p.h" |
|
43 |
#include "qcommonsequencetypes_p.h" |
|
44 |
||
45 |
#include "qxsltsimplecontentconstructor_p.h" |
|
46 |
||
47 |
QT_BEGIN_NAMESPACE |
|
48 |
||
49 |
using namespace QPatternist; |
|
50 |
||
51 |
XSLTSimpleContentConstructor::XSLTSimpleContentConstructor(const Expression::Ptr &source) : SimpleContentConstructor(source) |
|
52 |
{ |
|
53 |
} |
|
54 |
||
55 |
QString XSLTSimpleContentConstructor::processItem(const Item &item, |
|
56 |
bool &discard, |
|
57 |
bool &isText) |
|
58 |
{ |
|
59 |
if(item.isNode()) |
|
60 |
{ |
|
61 |
isText = (item.asNode().kind() == QXmlNodeModelIndex::Text); |
|
62 |
||
63 |
if(isText) |
|
64 |
{ |
|
65 |
const QString value(item.stringValue()); |
|
66 |
||
67 |
/* "1. Zero-length text nodes in the sequence are discarded." */ |
|
68 |
discard = value.isEmpty(); |
|
69 |
return value; |
|
70 |
} |
|
71 |
else |
|
72 |
{ |
|
73 |
Item::Iterator::Ptr it(item.sequencedTypedValue()); /* Atomic values. */ |
|
74 |
Item next(it->next()); |
|
75 |
QString result; |
|
76 |
||
77 |
if(next) |
|
78 |
result = next.stringValue(); |
|
79 |
||
80 |
next = it->next(); |
|
81 |
||
82 |
while(next) |
|
83 |
{ |
|
84 |
result += next.stringValue(); |
|
85 |
result += QLatin1Char(' '); |
|
86 |
next = it->next(); |
|
87 |
} |
|
88 |
||
89 |
return result; |
|
90 |
} |
|
91 |
} |
|
92 |
else |
|
93 |
{ |
|
94 |
discard = false; |
|
95 |
isText = false; |
|
96 |
return item.stringValue(); |
|
97 |
} |
|
98 |
} |
|
99 |
||
100 |
Item XSLTSimpleContentConstructor::evaluateSingleton(const DynamicContext::Ptr &context) const |
|
101 |
{ |
|
102 |
const Item::Iterator::Ptr it(m_operand->evaluateSequence(context)); |
|
103 |
||
104 |
Item next(it->next()); |
|
105 |
QString result; |
|
106 |
||
107 |
bool previousIsText = false; |
|
108 |
bool discard = false; |
|
109 |
||
110 |
if(next) |
|
111 |
{ |
|
112 |
const QString unit(processItem(next, discard, previousIsText)); |
|
113 |
||
114 |
if(!discard) |
|
115 |
result = unit; |
|
116 |
||
117 |
next = it->next(); |
|
118 |
} |
|
119 |
else |
|
120 |
return Item(); |
|
121 |
||
122 |
while(next) |
|
123 |
{ |
|
124 |
bool currentIsText = false; |
|
125 |
const QString unit(processItem(next, discard, currentIsText)); |
|
126 |
||
127 |
if(!discard) |
|
128 |
{ |
|
129 |
/* "Adjacent text nodes in the sequence are merged into a single text |
|
130 |
* node." */ |
|
131 |
if(previousIsText && currentIsText) |
|
132 |
; |
|
133 |
else |
|
134 |
result += QLatin1Char(' '); |
|
135 |
||
136 |
result += unit; |
|
137 |
} |
|
138 |
||
139 |
next = it->next(); |
|
140 |
previousIsText = currentIsText; |
|
141 |
} |
|
142 |
||
143 |
return AtomicString::fromValue(result); |
|
144 |
} |
|
145 |
||
146 |
SequenceType::List XSLTSimpleContentConstructor::expectedOperandTypes() const |
|
147 |
{ |
|
148 |
SequenceType::List result; |
|
149 |
result.append(CommonSequenceTypes::ZeroOrMoreItems); |
|
150 |
return result; |
|
151 |
} |
|
152 |
||
153 |
SequenceType::Ptr XSLTSimpleContentConstructor::staticType() const |
|
154 |
{ |
|
155 |
return CommonSequenceTypes::ZeroOrOneString; |
|
156 |
} |
|
157 |
||
158 |
QT_END_NAMESPACE |