|
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 "qcommonvalues_p.h" |
|
45 #include "qliteral_p.h" |
|
46 #include "qschemanumeric_p.h" |
|
47 |
|
48 #include "qdeepequalfn_p.h" |
|
49 |
|
50 QT_BEGIN_NAMESPACE |
|
51 |
|
52 using namespace QPatternist; |
|
53 |
|
54 bool DeepEqualFN::evaluateEBV(const DynamicContext::Ptr &context) const |
|
55 { |
|
56 const Item::Iterator::Ptr it1(m_operands.first()->evaluateSequence(context)); |
|
57 const Item::Iterator::Ptr it2(m_operands.at(1)->evaluateSequence(context)); |
|
58 |
|
59 while(true) |
|
60 { |
|
61 const Item item1(it1->next()); |
|
62 const Item item2(it2->next()); |
|
63 |
|
64 if(!item1) |
|
65 { |
|
66 if(item2) |
|
67 return false; |
|
68 else |
|
69 return true; |
|
70 } |
|
71 else if(!item2) |
|
72 { |
|
73 if(item1) |
|
74 return false; |
|
75 else |
|
76 return true; |
|
77 } |
|
78 else if(item1.isNode()) |
|
79 { |
|
80 if(item2.isNode()) |
|
81 { |
|
82 if(item1.asNode().isDeepEqual(item2.asNode())) |
|
83 continue; |
|
84 else |
|
85 return false; |
|
86 } |
|
87 else |
|
88 return false; |
|
89 } |
|
90 else if(item2.isNode()) |
|
91 { |
|
92 /* We know that item1 is not a node due to the check above. */ |
|
93 return false; |
|
94 } |
|
95 else if(flexibleCompare(item1, item2, context)) |
|
96 continue; |
|
97 else if(BuiltinTypes::numeric->itemMatches(item1) && |
|
98 item1.as<Numeric>()->isNaN() && |
|
99 item2.as<Numeric>()->isNaN()) |
|
100 { |
|
101 // TODO |
|
102 /* Handle the specific NaN circumstances. item2 isn't checked whether it's of |
|
103 * type numeric, since the AtomicComparator lookup would have failed if both weren't |
|
104 * numeric. */ |
|
105 continue; |
|
106 } |
|
107 else |
|
108 return false; |
|
109 }; |
|
110 } |
|
111 |
|
112 Expression::Ptr DeepEqualFN::typeCheck(const StaticContext::Ptr &context, |
|
113 const SequenceType::Ptr &reqType) |
|
114 { |
|
115 const Expression::Ptr me(FunctionCall::typeCheck(context, reqType)); |
|
116 const ItemType::Ptr t1(m_operands.first()->staticType()->itemType()); |
|
117 const ItemType::Ptr t2(m_operands.at(1)->staticType()->itemType()); |
|
118 /* TODO This can be much more improved, and the optimizations should be moved |
|
119 * to compress(). */ |
|
120 |
|
121 if(*CommonSequenceTypes::Empty == *t1) |
|
122 { |
|
123 if(*CommonSequenceTypes::Empty == *t2) |
|
124 return wrapLiteral(CommonValues::BooleanTrue, context, this); |
|
125 else |
|
126 return me; |
|
127 } |
|
128 else if(*CommonSequenceTypes::Empty == *t2) |
|
129 { |
|
130 if(*CommonSequenceTypes::Empty == *t1) |
|
131 return wrapLiteral(CommonValues::BooleanTrue, context, this); |
|
132 else |
|
133 return me; |
|
134 } |
|
135 else if(BuiltinTypes::node->xdtTypeMatches(t1) && |
|
136 BuiltinTypes::node->xdtTypeMatches(t2)) |
|
137 return me; /* We're comparing nodes. */ |
|
138 else if(BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t1) && |
|
139 BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t2)) |
|
140 { |
|
141 prepareComparison(fetchComparator(t1, t2, context)); |
|
142 return me; |
|
143 } |
|
144 else |
|
145 { |
|
146 if ((BuiltinTypes::node->xdtTypeMatches(t1) && BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t2)) |
|
147 || (BuiltinTypes::node->xdtTypeMatches(t2) && BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t1))) |
|
148 { |
|
149 /* One operand contains nodes and the other atomic values, or vice versa. They can never |
|
150 * be identical. */ |
|
151 // TODO warn? |
|
152 return wrapLiteral(CommonValues::BooleanFalse, context, this); |
|
153 } |
|
154 else |
|
155 { |
|
156 // TODO Warn? |
|
157 return me; |
|
158 } |
|
159 } |
|
160 } |
|
161 |
|
162 QT_END_NAMESPACE |