/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- * * The contents of this file are subject to the Mozilla Public * License Version 1.1 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or * implied. See the License for the specific language governing * rights and limitations under the License. * * The Original Code is TransforMiiX XSLT processor. * * The Initial Developer of the Original Code is The MITRE Corporation. * Portions created by MITRE are Copyright (C) 1999 The MITRE Corporation. * * Portions created by Keith Visco as a Non MITRE employee, * (C) 1999 Keith Visco. All Rights Reserved. * * Contributor(s): * * Olivier Gerardin, ogerardin@vo.lu * -- original author. * * Nisheeth Ranjan, nisheeth@netscape.com * -- implemented rint function, which was not available on Windows. * */ /* * NumberFunctionCall * A representation of the XPath Number funtions */ #include "FunctionLib.h" #include "XMLDOMUtils.h" #include /* * Creates a NumberFunctionCall of the given type */ NumberFunctionCall::NumberFunctionCall(NumberFunctions aType) { mType = aType; switch (mType) { case ROUND: name = XPathNames::ROUND_FN; break; case CEILING: name = XPathNames::CEILING_FN; break; case FLOOR: name = XPathNames::FLOOR_FN; break; case SUM: name = XPathNames::SUM_FN; break; case NUMBER: name = XPathNames::NUMBER_FN; break; } } /* * Evaluates this Expr based on the given context node and processor state * @param context the context Node for evaluation of this Expr * @param ps the ContextState containing the stack information needed * for evaluation * @return the result of the evaluation */ ExprResult* NumberFunctionCall::evaluate(Node* aContext, ContextState* aCs) { ListIterator iter(¶ms); if (mType == NUMBER) { if (!requireParams(0, 1, aCs)) return new StringResult("error"); } else { if (!requireParams(1, 1, aCs)) return new StringResult("error"); } switch (mType) { case CEILING: { double dbl = evaluateToNumber((Expr*)iter.next(), aContext, aCs); if (Double::isNaN(dbl) || Double::isInfinite(dbl)) return new NumberResult(dbl); if (Double::isNeg(dbl) && dbl > -1) return new NumberResult(0 * dbl); return new NumberResult(ceil(dbl)); } case FLOOR: { double dbl = evaluateToNumber((Expr*)iter.next(), aContext, aCs); if (Double::isNaN(dbl) || Double::isInfinite(dbl) || (dbl == 0 && Double::isNeg(dbl))) return new NumberResult(dbl); return new NumberResult(floor(dbl)); } case ROUND: { double dbl = evaluateToNumber((Expr*)iter.next(), aContext, aCs); if (Double::isNaN(dbl) || Double::isInfinite(dbl)) return new NumberResult(dbl); if (Double::isNeg(dbl) && dbl >= -0.5) return new NumberResult(0 * dbl); return new NumberResult(floor(dbl + 0.5)); } case SUM: { NodeSet* nodes; nodes = evaluateToNodeSet((Expr*)iter.next(), aContext, aCs); if (!nodes) return new StringResult("error"); double res = 0; int i; for (i = 0; i < nodes->size(); i++) { String resultStr; XMLDOMUtils::getNodeValue(nodes->get(i), resultStr); res += Double::toDouble(resultStr); } delete nodes; return new NumberResult(res); } case NUMBER: { if (iter.hasNext()) { return new NumberResult( evaluateToNumber((Expr*)iter.next(), aContext, aCs)); } String resultStr; XMLDOMUtils::getNodeValue(aContext, resultStr); return new NumberResult(Double::toDouble(resultStr)); } } String err("Internal error"); aCs->recieveError(err); return new StringResult("error"); }