You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tdelibs/kjs/operations.cpp

233 lines
5.4 KiB

// -*- c-basic-offset: 2 -*-
/*
* This file is part of the KDE libraries
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifndef HAVE_FLOAT_H /* just for !Windows */
#define HAVE_FLOAT_H 0
#endif
#include <stdio.h>
#include <assert.h>
#include <math.h>
#include <stdlib.h>
// For declaration of isinf on Sun C++
#ifdef __SUNPRO_CC
#include <sunmath.h>
#endif
#ifdef HAVE_IEEEFP_H
#include <ieeefp.h>
#endif
#if HAVE_FLOAT_H
#include <float.h>
#endif
#include "operations.h"
#include "object.h"
using namespace KJS;
bool KJS::isNaN(double d)
{
return isnan(d);
}
bool KJS::isInf(double d)
{
return isinf(d);
}
bool KJS::isPosInf(double d)
{
return ( isinf(d) && d > 0 );
}
bool KJS::isNegInf(double d)
{
return ( isinf(d) && d < 0 );
}
// ECMA 11.9.3
bool KJS::equal(ExecState *exec, const Value& v1, const Value& v2)
{
Type t1 = v1.type();
Type t2 = v2.type();
if (t1 == t2) {
if (t1 == UndefinedType || t1 == NullType)
return true;
if (t1 == NumberType)
{
double d1 = v1.toNumber(exec);
double d2 = v2.toNumber(exec);
if ( isNaN( d1 ) || isNaN( d2 ) )
return false;
return ( d1 == d2 ); /* TODO: +0, -0 ? */
}
if (t1 == StringType)
return (v1.toString(exec) == v2.toString(exec));
if (t1 == BooleanType)
return (v1.toBoolean(exec) == v2.toBoolean(exec));
// types are Object
return (v1.imp() == v2.imp());
}
// different types
if ((t1 == NullType && t2 == UndefinedType) || (t1 == UndefinedType && t2 == NullType))
return true;
if (t1 == NumberType && t2 == StringType) {
Number n2 = v2.toNumber(exec);
return equal(exec,v1, n2);
}
if ((t1 == StringType && t2 == NumberType) || t1 == BooleanType) {
Number n1 = v1.toNumber(exec);
return equal(exec,n1, v2);
}
if (t2 == BooleanType) {
Number n2 = v2.toNumber(exec);
return equal(exec,v1, n2);
}
if ((t1 == StringType || t1 == NumberType) && t2 >= ObjectType) {
Value p2 = v2.toPrimitive(exec);
return equal(exec,v1, p2);
}
if (t1 >= ObjectType && (t2 == StringType || t2 == NumberType)) {
Value p1 = v1.toPrimitive(exec);
return equal(exec,p1, v2);
}
return false;
}
bool KJS::strictEqual(ExecState *exec, const Value &v1, const Value &v2)
{
Type t1 = v1.type();
Type t2 = v2.type();
if (t1 != t2)
return false;
if (t1 == UndefinedType || t1 == NullType)
return true;
if (t1 == NumberType) {
double n1 = v1.toNumber(exec);
double n2 = v2.toNumber(exec);
if (isNaN(n1) || isNaN(n2))
return false;
if (n1 == n2)
return true;
/* TODO: +0 and -0 */
return false;
} else if (t1 == StringType) {
return v1.toString(exec) == v2.toString(exec);
} else if (t2 == BooleanType) {
return v1.toBoolean(exec) == v2.toBoolean(exec);
}
if (v1.imp() == v2.imp())
return true;
/* TODO: joined objects */
return false;
}
int KJS::relation(ExecState *exec, const Value& v1, const Value& v2)
{
Value p1 = v1.toPrimitive(exec,NumberType);
Value p2 = v2.toPrimitive(exec,NumberType);
if (p1.type() == StringType && p2.type() == StringType)
return p1.toString(exec) < p2.toString(exec) ? 1 : 0;
double n1 = p1.toNumber(exec);
double n2 = p2.toNumber(exec);
if ( isNaN( n1 ) || isNaN( n2 ) )
return -1; // means undefined
if (n1 == n2)
return 0;
/* TODO: +0, -0 */
if ( isPosInf( n1 ) )
return 0;
if ( isPosInf( n2 ) )
return 1;
if ( isNegInf( n2 ) )
return 0;
if ( isNegInf( n1 ) )
return 1;
return (n1 < n2) ? 1 : 0;
}
int KJS::maxInt(int d1, int d2)
{
return (d1 > d2) ? d1 : d2;
}
int KJS::minInt(int d1, int d2)
{
return (d1 < d2) ? d1 : d2;
}
// ECMA 11.6
Value KJS::add(ExecState *exec, const Value &v1, const Value &v2, char oper)
{
// exception for the Date exception in defaultValue()
Type preferred = oper == '+' ? UnspecifiedType : NumberType;
Value p1 = v1.toPrimitive(exec, preferred);
Value p2 = v2.toPrimitive(exec, preferred);
if ((p1.type() == StringType || p2.type() == StringType) && oper == '+') {
UString s1 = p1.toString(exec);
UString s2 = p2.toString(exec);
return String(s1 + s2);
}
double n1 = p1.toNumber(exec);
double n2 = p2.toNumber(exec);
if (oper == '+')
return Number(n1 + n2);
else
return Number(n1 - n2);
}
// ECMA 11.5
Value KJS::mult(ExecState *exec, const Value &v1, const Value &v2, char oper)
{
double n1 = v1.toNumber(exec);
double n2 = v2.toNumber(exec);
double result;
if (oper == '*')
result = n1 * n2;
else if (oper == '/')
result = n1 / n2;
else
result = fmod(n1, n2);
return Number(result);
}