This source file includes following definitions.
- evaluate
- evaluate
- evaluate
- evaluate
- compare
- evaluate
- shortCircuitOn
- evaluate
- evaluate
- evaluate
#include "config.h"
#include "core/xml/XPathPredicate.h"
#include <math.h>
#include "core/xml/XPathFunctions.h"
#include "core/xml/XPathUtil.h"
#include "wtf/MathExtras.h"
namespace WebCore {
namespace XPath {
Number::Number(double value)
: m_value(value)
{
}
Value Number::evaluate() const
{
return m_value;
}
StringExpression::StringExpression(const String& value)
: m_value(value)
{
}
Value StringExpression::evaluate() const
{
return m_value;
}
Value Negative::evaluate() const
{
Value p(subExpr(0)->evaluate());
return -p.toNumber();
}
NumericOp::NumericOp(Opcode opcode, PassOwnPtr<Expression> lhs, PassOwnPtr<Expression> rhs)
: m_opcode(opcode)
{
addSubExpression(lhs);
addSubExpression(rhs);
}
Value NumericOp::evaluate() const
{
Value lhs(subExpr(0)->evaluate());
Value rhs(subExpr(1)->evaluate());
double leftVal = lhs.toNumber();
double rightVal = rhs.toNumber();
switch (m_opcode) {
case OP_Add:
return leftVal + rightVal;
case OP_Sub:
return leftVal - rightVal;
case OP_Mul:
return leftVal * rightVal;
case OP_Div:
return leftVal / rightVal;
case OP_Mod:
return fmod(leftVal, rightVal);
}
ASSERT_NOT_REACHED();
return 0.0;
}
EqTestOp::EqTestOp(Opcode opcode, PassOwnPtr<Expression> lhs, PassOwnPtr<Expression> rhs)
: m_opcode(opcode)
{
addSubExpression(lhs);
addSubExpression(rhs);
}
bool EqTestOp::compare(const Value& lhs, const Value& rhs) const
{
if (lhs.isNodeSet()) {
const NodeSet& lhsSet = lhs.toNodeSet();
if (rhs.isNodeSet()) {
const NodeSet& rhsSet = rhs.toNodeSet();
for (unsigned lindex = 0; lindex < lhsSet.size(); ++lindex)
for (unsigned rindex = 0; rindex < rhsSet.size(); ++rindex)
if (compare(stringValue(lhsSet[lindex]), stringValue(rhsSet[rindex])))
return true;
return false;
}
if (rhs.isNumber()) {
for (unsigned lindex = 0; lindex < lhsSet.size(); ++lindex)
if (compare(Value(stringValue(lhsSet[lindex])).toNumber(), rhs))
return true;
return false;
}
if (rhs.isString()) {
for (unsigned lindex = 0; lindex < lhsSet.size(); ++lindex)
if (compare(stringValue(lhsSet[lindex]), rhs))
return true;
return false;
}
if (rhs.isBoolean()) {
return compare(lhs.toBoolean(), rhs);
}
ASSERT(0);
}
if (rhs.isNodeSet()) {
const NodeSet& rhsSet = rhs.toNodeSet();
if (lhs.isNumber()) {
for (unsigned rindex = 0; rindex < rhsSet.size(); ++rindex)
if (compare(lhs, Value(stringValue(rhsSet[rindex])).toNumber()))
return true;
return false;
}
if (lhs.isString()) {
for (unsigned rindex = 0; rindex < rhsSet.size(); ++rindex)
if (compare(lhs, stringValue(rhsSet[rindex])))
return true;
return false;
}
if (lhs.isBoolean())
return compare(lhs, rhs.toBoolean());
ASSERT(0);
}
switch (m_opcode) {
case OP_EQ:
case OP_NE:
bool equal;
if (lhs.isBoolean() || rhs.isBoolean())
equal = lhs.toBoolean() == rhs.toBoolean();
else if (lhs.isNumber() || rhs.isNumber())
equal = lhs.toNumber() == rhs.toNumber();
else
equal = lhs.toString() == rhs.toString();
if (m_opcode == OP_EQ)
return equal;
return !equal;
case OP_GT:
return lhs.toNumber() > rhs.toNumber();
case OP_GE:
return lhs.toNumber() >= rhs.toNumber();
case OP_LT:
return lhs.toNumber() < rhs.toNumber();
case OP_LE:
return lhs.toNumber() <= rhs.toNumber();
}
ASSERT(0);
return false;
}
Value EqTestOp::evaluate() const
{
Value lhs(subExpr(0)->evaluate());
Value rhs(subExpr(1)->evaluate());
return compare(lhs, rhs);
}
LogicalOp::LogicalOp(Opcode opcode, PassOwnPtr<Expression> lhs, PassOwnPtr<Expression> rhs)
: m_opcode(opcode)
{
addSubExpression(lhs);
addSubExpression(rhs);
}
bool LogicalOp::shortCircuitOn() const
{
if (m_opcode == OP_And)
return false;
return true;
}
Value LogicalOp::evaluate() const
{
Value lhs(subExpr(0)->evaluate());
bool lhsBool = lhs.toBoolean();
if (lhsBool == shortCircuitOn())
return lhsBool;
return subExpr(1)->evaluate().toBoolean();
}
Value Union::evaluate() const
{
Value lhsResult = subExpr(0)->evaluate();
Value rhs = subExpr(1)->evaluate();
NodeSet& resultSet = lhsResult.modifiableNodeSet();
const NodeSet& rhsNodes = rhs.toNodeSet();
HashSet<Node*> nodes;
for (size_t i = 0; i < resultSet.size(); ++i)
nodes.add(resultSet[i]);
for (size_t i = 0; i < rhsNodes.size(); ++i) {
Node* node = rhsNodes[i];
if (nodes.add(node).isNewEntry)
resultSet.append(node);
}
resultSet.markSorted(false);
return lhsResult;
}
Predicate::Predicate(PassOwnPtr<Expression> expr)
: m_expr(expr)
{
}
Predicate::~Predicate()
{
}
bool Predicate::evaluate() const
{
ASSERT(m_expr);
Value result(m_expr->evaluate());
if (result.isNumber())
return EqTestOp(EqTestOp::OP_EQ, adoptPtr(createFunction("position")), adoptPtr(new Number(result.toNumber()))).evaluate().toBoolean();
return result.toBoolean();
}
}
}