michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: 
michael@0: /**
michael@0:    File Name:          11.6.3.js
michael@0:    ECMA Section:       11.6.3 Applying the additive operators
michael@0:    (+, -) to numbers
michael@0:    Description:
michael@0:    The + operator performs addition when applied to two operands of numeric
michael@0:    type, producing the sum of the operands. The - operator performs
michael@0:    subtraction, producing the difference of two numeric operands.
michael@0: 
michael@0:    Addition is a commutative operation, but not always associative.
michael@0: 
michael@0:    The result of an addition is determined using the rules of IEEE 754
michael@0:    double-precision arithmetic:
michael@0: 
michael@0:    If either operand is NaN, the result is NaN.
michael@0:    The sum of two infinities of opposite sign is NaN.
michael@0:    The sum of two infinities of the same sign is the infinity of that sign.
michael@0:    The sum of an infinity and a finite value is equal to the infinite operand.
michael@0:    The sum of two negative zeros is 0. The sum of two positive zeros, or of
michael@0:    two zeros of opposite sign, is +0.
michael@0:    The sum of a zero and a nonzero finite value is equal to the nonzero
michael@0:    operand.
michael@0:    The sum of two nonzero finite values of the same magnitude and opposite
michael@0:    sign is +0.
michael@0:    In the remaining cases, where neither an infinity, nor a zero, nor NaN is
michael@0:    involved, and the operands have the same sign or have different
michael@0:    magnitudes, the sum is computed and rounded to the nearest
michael@0:    representable value using IEEE 754 round-to-nearest mode. If the
michael@0:    magnitude is too large to represent, the operation overflows and
michael@0:    the result is then an infinity of appropriate sign. The ECMAScript
michael@0:    language requires support of gradual underflow as defined by IEEE 754.
michael@0: 
michael@0:    Author:             christine@netscape.com
michael@0:    Date:               12 november 1997
michael@0: */
michael@0: var SECTION = "11.6.3";
michael@0: var VERSION = "ECMA_1";
michael@0: startTest();
michael@0: 
michael@0: writeHeaderToLog( SECTION + " Applying the additive operators (+,-) to numbers");
michael@0: 
michael@0: new TestCase( SECTION,    "Number.NaN + 1",     Number.NaN,     Number.NaN + 1 );
michael@0: new TestCase( SECTION,    "1 + Number.NaN",     Number.NaN,     1 + Number.NaN );
michael@0: 
michael@0: new TestCase( SECTION,    "Number.NaN - 1",     Number.NaN,     Number.NaN - 1 );
michael@0: new TestCase( SECTION,    "1 - Number.NaN",     Number.NaN,     1 - Number.NaN );
michael@0: 
michael@0: new TestCase( SECTION,  "Number.POSITIVE_INFINITY + Number.POSITIVE_INFINITY",  Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY + Number.POSITIVE_INFINITY);
michael@0: new TestCase( SECTION,  "Number.NEGATIVE_INFINITY + Number.NEGATIVE_INFINITY",  Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY + Number.NEGATIVE_INFINITY);
michael@0: 
michael@0: new TestCase( SECTION,  "Number.POSITIVE_INFINITY + Number.NEGATIVE_INFINITY",  Number.NaN,     Number.POSITIVE_INFINITY + Number.NEGATIVE_INFINITY);
michael@0: new TestCase( SECTION,  "Number.NEGATIVE_INFINITY + Number.POSITIVE_INFINITY",  Number.NaN,     Number.NEGATIVE_INFINITY + Number.POSITIVE_INFINITY);
michael@0: 
michael@0: new TestCase( SECTION,  "Number.POSITIVE_INFINITY - Number.POSITIVE_INFINITY",  Number.NaN,   Number.POSITIVE_INFINITY - Number.POSITIVE_INFINITY);
michael@0: new TestCase( SECTION,  "Number.NEGATIVE_INFINITY - Number.NEGATIVE_INFINITY",  Number.NaN,   Number.NEGATIVE_INFINITY - Number.NEGATIVE_INFINITY);
michael@0: 
michael@0: new TestCase( SECTION,  "Number.POSITIVE_INFINITY - Number.NEGATIVE_INFINITY",  Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY - Number.NEGATIVE_INFINITY);
michael@0: new TestCase( SECTION,  "Number.NEGATIVE_INFINITY - Number.POSITIVE_INFINITY",  Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY - Number.POSITIVE_INFINITY);
michael@0: 
michael@0: new TestCase( SECTION,  "-0 + -0",      -0,     -0 + -0 );
michael@0: new TestCase( SECTION,  "-0 - 0",       -0,     -0 - 0 );
michael@0: 
michael@0: new TestCase( SECTION,  "0 + 0",        0,      0 + 0 );
michael@0: new TestCase( SECTION,  "0 + -0",       0,      0 + -0 );
michael@0: new TestCase( SECTION,  "0 - -0",       0,      0 - -0 );
michael@0: new TestCase( SECTION,  "0 - 0",        0,      0 - 0 );
michael@0: new TestCase( SECTION,  "-0 - -0",      0,     -0 - -0 );
michael@0: new TestCase( SECTION,  "-0 + 0",       0,     -0 + 0 );
michael@0: 
michael@0: new TestCase( SECTION,  "Number.MAX_VALUE - Number.MAX_VALUE",      0,  Number.MAX_VALUE - Number.MAX_VALUE );
michael@0: new TestCase( SECTION,  "1/Number.MAX_VALUE - 1/Number.MAX_VALUE",  0,  1/Number.MAX_VALUE - 1/Number.MAX_VALUE );
michael@0: 
michael@0: new TestCase( SECTION,  "Number.MIN_VALUE - Number.MIN_VALUE",      0,  Number.MIN_VALUE - Number.MIN_VALUE );
michael@0: 
michael@0: test();