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
174
175
176
177
178
179
180
181
182
183
184
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "txExpr.h"
#include "txNodeSet.h"
#include "txIXPathContext.h"
#include "txXPathTreeWalker.h"
/**
* Compares the two ExprResults based on XPath 1.0 Recommendation (section 3.4)
*/
bool RelationalExpr::compareResults(txIEvalContext* aContext,
txAExprResult* aLeft,
txAExprResult* aRight) {
short ltype = aLeft->getResultType();
short rtype = aRight->getResultType();
nsresult rv = NS_OK;
// Handle case for just Left NodeSet or Both NodeSets
if (ltype == txAExprResult::NODESET) {
if (rtype == txAExprResult::BOOLEAN) {
BooleanResult leftBool(aLeft->booleanValue());
return compareResults(aContext, &leftBool, aRight);
}
txNodeSet* nodeSet = static_cast<txNodeSet*>(aLeft);
RefPtr<StringResult> strResult;
rv = aContext->recycler()->getStringResult(getter_AddRefs(strResult));
NS_ENSURE_SUCCESS(rv, false);
int32_t i;
for (i = 0; i < nodeSet->size(); ++i) {
strResult->mValue.Truncate();
txXPathNodeUtils::appendNodeValue(nodeSet->get(i), strResult->mValue);
if (compareResults(aContext, strResult, aRight)) {
return true;
}
}
return false;
}
// Handle case for Just Right NodeSet
if (rtype == txAExprResult::NODESET) {
if (ltype == txAExprResult::BOOLEAN) {
BooleanResult rightBool(aRight->booleanValue());
return compareResults(aContext, aLeft, &rightBool);
}
txNodeSet* nodeSet = static_cast<txNodeSet*>(aRight);
RefPtr<StringResult> strResult;
rv = aContext->recycler()->getStringResult(getter_AddRefs(strResult));
NS_ENSURE_SUCCESS(rv, false);
int32_t i;
for (i = 0; i < nodeSet->size(); ++i) {
strResult->mValue.Truncate();
txXPathNodeUtils::appendNodeValue(nodeSet->get(i), strResult->mValue);
if (compareResults(aContext, aLeft, strResult)) {
return true;
}
}
return false;
}
// Neither is a NodeSet
if (mOp == EQUAL || mOp == NOT_EQUAL) {
bool result;
const nsString *lString, *rString;
// If either is a bool, compare as bools.
if (ltype == txAExprResult::BOOLEAN || rtype == txAExprResult::BOOLEAN) {
result = aLeft->booleanValue() == aRight->booleanValue();
}
// If either is a number, compare as numbers.
else if (ltype == txAExprResult::NUMBER || rtype == txAExprResult::NUMBER) {
double lval = aLeft->numberValue();
double rval = aRight->numberValue();
result = (lval == rval);
}
// Otherwise compare as strings. Try to use the stringobject in
// StringResult if possible since that is a common case.
else if ((lString = aLeft->stringValuePointer())) {
if ((rString = aRight->stringValuePointer())) {
result = lString->Equals(*rString);
} else {
nsAutoString rStr;
aRight->stringValue(rStr);
result = lString->Equals(rStr);
}
} else if ((rString = aRight->stringValuePointer())) {
nsAutoString lStr;
aLeft->stringValue(lStr);
result = rString->Equals(lStr);
} else {
nsAutoString lStr, rStr;
aLeft->stringValue(lStr);
aRight->stringValue(rStr);
result = lStr.Equals(rStr);
}
return mOp == EQUAL ? result : !result;
}
double leftDbl = aLeft->numberValue();
double rightDbl = aRight->numberValue();
switch (mOp) {
case LESS_THAN: {
return (leftDbl < rightDbl);
}
case LESS_OR_EQUAL: {
return (leftDbl <= rightDbl);
}
case GREATER_THAN: {
return (leftDbl > rightDbl);
}
case GREATER_OR_EQUAL: {
return (leftDbl >= rightDbl);
}
default: {
MOZ_ASSERT_UNREACHABLE("We should have caught all cases");
}
}
return false;
}
nsresult RelationalExpr::evaluate(txIEvalContext* aContext,
txAExprResult** aResult) {
*aResult = nullptr;
RefPtr<txAExprResult> lResult;
nsresult rv = mLeftExpr->evaluate(aContext, getter_AddRefs(lResult));
NS_ENSURE_SUCCESS(rv, rv);
RefPtr<txAExprResult> rResult;
rv = mRightExpr->evaluate(aContext, getter_AddRefs(rResult));
NS_ENSURE_SUCCESS(rv, rv);
aContext->recycler()->getBoolResult(
compareResults(aContext, lResult, rResult), aResult);
return NS_OK;
}
TX_IMPL_EXPR_STUBS_2(RelationalExpr, BOOLEAN_RESULT, mLeftExpr, mRightExpr)
bool RelationalExpr::isSensitiveTo(ContextSensitivity aContext) {
return mLeftExpr->isSensitiveTo(aContext) ||
mRightExpr->isSensitiveTo(aContext);
}
#ifdef TX_TO_STRING
void RelationalExpr::toString(nsAString& str) {
mLeftExpr->toString(str);
switch (mOp) {
case NOT_EQUAL:
str.AppendLiteral("!=");
break;
case LESS_THAN:
str.Append(char16_t('<'));
break;
case LESS_OR_EQUAL:
str.AppendLiteral("<=");
break;
case GREATER_THAN:
str.Append(char16_t('>'));
break;
case GREATER_OR_EQUAL:
str.AppendLiteral(">=");
break;
default:
str.Append(char16_t('='));
break;
}
mRightExpr->toString(str);
}
#endif
|
