mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-10 01:40:17 +01:00
196 lines
6.0 KiB
C++
196 lines
6.0 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
*
|
|
* 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 code.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* The MITRE Corporation.
|
|
* Portions created by the Initial Developer are Copyright (C) 1999
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this file under
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
*
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
/*
|
|
* NumberFunctionCall
|
|
* A representation of the XPath Number funtions
|
|
*/
|
|
|
|
#include "FunctionLib.h"
|
|
#include <math.h>
|
|
#include "txNodeSet.h"
|
|
#include "txAtoms.h"
|
|
#include "txIXPathContext.h"
|
|
|
|
/*
|
|
* Creates a NumberFunctionCall of the given type
|
|
*/
|
|
NumberFunctionCall::NumberFunctionCall(NumberFunctions aType)
|
|
: mType(aType)
|
|
{
|
|
}
|
|
|
|
/*
|
|
* 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
|
|
*/
|
|
nsresult
|
|
NumberFunctionCall::evaluate(txIEvalContext* aContext, txAExprResult** aResult)
|
|
{
|
|
*aResult = nsnull;
|
|
|
|
txListIterator iter(¶ms);
|
|
if (mType == NUMBER) {
|
|
if (!requireParams(0, 1, aContext))
|
|
return NS_ERROR_XPATH_BAD_ARGUMENT_COUNT;
|
|
}
|
|
else {
|
|
if (!requireParams(1, 1, aContext))
|
|
return NS_ERROR_XPATH_BAD_ARGUMENT_COUNT;
|
|
}
|
|
|
|
switch (mType) {
|
|
case CEILING:
|
|
{
|
|
double dbl = evaluateToNumber((Expr*)iter.next(), aContext);
|
|
if (!Double::isNaN(dbl) && !Double::isInfinite(dbl)) {
|
|
if (Double::isNeg(dbl) && dbl > -1) {
|
|
dbl *= 0;
|
|
}
|
|
else {
|
|
dbl = ceil(dbl);
|
|
}
|
|
}
|
|
|
|
return aContext->recycler()->getNumberResult(dbl, aResult);
|
|
}
|
|
case FLOOR:
|
|
{
|
|
double dbl = evaluateToNumber((Expr*)iter.next(), aContext);
|
|
if (!Double::isNaN(dbl) &&
|
|
!Double::isInfinite(dbl) &&
|
|
!(dbl == 0 && Double::isNeg(dbl))) {
|
|
dbl = floor(dbl);
|
|
}
|
|
|
|
return aContext->recycler()->getNumberResult(dbl, aResult);
|
|
}
|
|
case ROUND:
|
|
{
|
|
double dbl = evaluateToNumber((Expr*)iter.next(), aContext);
|
|
if (!Double::isNaN(dbl) && !Double::isInfinite(dbl)) {
|
|
if (Double::isNeg(dbl) && dbl >= -0.5) {
|
|
dbl *= 0;
|
|
}
|
|
else {
|
|
dbl = floor(dbl + 0.5);
|
|
}
|
|
}
|
|
|
|
return aContext->recycler()->getNumberResult(dbl, aResult);
|
|
}
|
|
case SUM:
|
|
{
|
|
nsRefPtr<txNodeSet> nodes;
|
|
nsresult rv = evaluateToNodeSet((Expr*)iter.next(), aContext,
|
|
getter_AddRefs(nodes));
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
double res = 0;
|
|
PRInt32 i;
|
|
for (i = 0; i < nodes->size(); ++i) {
|
|
nsAutoString resultStr;
|
|
txXPathNodeUtils::appendNodeValue(nodes->get(i), resultStr);
|
|
res += Double::toDouble(resultStr);
|
|
}
|
|
return aContext->recycler()->getNumberResult(res, aResult);
|
|
}
|
|
case NUMBER:
|
|
{
|
|
double res;
|
|
if (iter.hasNext()) {
|
|
res = evaluateToNumber((Expr*)iter.next(), aContext);
|
|
}
|
|
else {
|
|
nsAutoString resultStr;
|
|
txXPathNodeUtils::appendNodeValue(aContext->getContextNode(),
|
|
resultStr);
|
|
res = Double::toDouble(resultStr);
|
|
}
|
|
return aContext->recycler()->getNumberResult(res, aResult);
|
|
}
|
|
}
|
|
|
|
aContext->receiveError(NS_LITERAL_STRING("Internal error"),
|
|
NS_ERROR_UNEXPECTED);
|
|
return NS_ERROR_UNEXPECTED;
|
|
}
|
|
|
|
#ifdef TX_TO_STRING
|
|
nsresult
|
|
NumberFunctionCall::getNameAtom(nsIAtom** aAtom)
|
|
{
|
|
switch (mType) {
|
|
case NUMBER:
|
|
{
|
|
*aAtom = txXPathAtoms::number;
|
|
break;
|
|
}
|
|
case ROUND:
|
|
{
|
|
*aAtom = txXPathAtoms::round;
|
|
break;
|
|
}
|
|
case FLOOR:
|
|
{
|
|
*aAtom = txXPathAtoms::floor;
|
|
break;
|
|
}
|
|
case CEILING:
|
|
{
|
|
*aAtom = txXPathAtoms::ceiling;
|
|
break;
|
|
}
|
|
case SUM:
|
|
{
|
|
*aAtom = txXPathAtoms::sum;
|
|
break;
|
|
}
|
|
default:
|
|
{
|
|
*aAtom = 0;
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
NS_ADDREF(*aAtom);
|
|
return NS_OK;
|
|
}
|
|
#endif
|