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.5.1.js
michael@0:    ECMA Section:       11.5.1 Applying the * operator
michael@0:    Description:
michael@0: 
michael@0:    11.5.1 Applying the * operator
michael@0: 
michael@0:    The * operator performs multiplication, producing the product of its
michael@0:    operands. Multiplication is commutative. Multiplication is not always
michael@0:    associative in ECMAScript, because of finite precision.
michael@0: 
michael@0:    The result of a floating-point multiplication is governed by the rules
michael@0:    of IEEE 754 double-precision arithmetic:
michael@0: 
michael@0:    If either operand is NaN, the result is NaN.
michael@0:    The sign of the result is positive if both operands have the same sign,
michael@0:    negative if the operands have different signs.
michael@0:    Multiplication of an infinity by a zero results in NaN.
michael@0:    Multiplication of an infinity by an infinity results in an infinity.
michael@0:    The sign is determined by the rule already stated above.
michael@0:    Multiplication of an infinity by a finite non-zero value results in a
michael@0:    signed infinity. The sign is determined by the rule already stated above.
michael@0:    In the remaining cases, where neither an infinity or NaN is involved, the
michael@0:    product is computed and rounded to the nearest representable value using IEEE
michael@0:    754 round-to-nearest mode. If the magnitude is too large to represent,
michael@0:    the result is then an infinity of appropriate sign. If the magnitude is
michael@0:    oo small to represent, the result is then a zero
michael@0:    of appropriate sign. The ECMAScript language requires support of gradual
michael@0:    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.5.1";
michael@0: var VERSION = "ECMA_1";
michael@0: startTest();
michael@0: 
michael@0: writeHeaderToLog( SECTION + " Applying the * operator");
michael@0: 
michael@0: new TestCase( SECTION,    "Number.NaN * Number.NaN",    Number.NaN,     Number.NaN * Number.NaN );
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 * 0",   Number.NaN, Number.POSITIVE_INFINITY * 0 );
michael@0: new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * 0",   Number.NaN, Number.NEGATIVE_INFINITY * 0 );
michael@0: new TestCase( SECTION,    "0 * Number.POSITIVE_INFINITY",   Number.NaN, 0 * Number.POSITIVE_INFINITY );
michael@0: new TestCase( SECTION,    "0 * Number.NEGATIVE_INFINITY",   Number.NaN, 0 * Number.NEGATIVE_INFINITY );
michael@0: 
michael@0: new TestCase( SECTION,    "-0 * Number.POSITIVE_INFINITY",  Number.NaN,   -0 * Number.POSITIVE_INFINITY );
michael@0: new TestCase( SECTION,    "-0 * Number.NEGATIVE_INFINITY",  Number.NaN,   -0 * Number.NEGATIVE_INFINITY );
michael@0: new TestCase( SECTION,    "Number.POSITIVE_INFINITY * -0",  Number.NaN,   Number.POSITIVE_INFINITY * -0 );
michael@0: new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * -0",  Number.NaN,   Number.NEGATIVE_INFINITY * -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: 
michael@0: new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * Number.NEGATIVE_INFINITY",    Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY * Number.NEGATIVE_INFINITY );
michael@0: new TestCase( SECTION,    "Number.POSITIVE_INFINITY * Number.NEGATIVE_INFINITY",    Number.NEGATIVE_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: new TestCase( SECTION,    "Number.POSITIVE_INFINITY * Number.POSITIVE_INFINITY",    Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY * Number.POSITIVE_INFINITY );
michael@0: 
michael@0: new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * 1 ",                          Number.NEGATIVE_INFINITY,   Number.NEGATIVE_INFINITY * 1 );
michael@0: new TestCase( SECTION,    "Number.NEGATIVE_INFINITY * -1 ",                         Number.POSITIVE_INFINITY,   Number.NEGATIVE_INFINITY * -1 );
michael@0: new TestCase( SECTION,    "1 * Number.NEGATIVE_INFINITY",                           Number.NEGATIVE_INFINITY,   1 * Number.NEGATIVE_INFINITY );
michael@0: new TestCase( SECTION,    "-1 * Number.NEGATIVE_INFINITY",                          Number.POSITIVE_INFINITY,   -1 * Number.NEGATIVE_INFINITY );
michael@0: 
michael@0: new TestCase( SECTION,    "Number.POSITIVE_INFINITY * 1 ",                          Number.POSITIVE_INFINITY,   Number.POSITIVE_INFINITY * 1 );
michael@0: new TestCase( SECTION,    "Number.POSITIVE_INFINITY * -1 ",                         Number.NEGATIVE_INFINITY,   Number.POSITIVE_INFINITY * -1 );
michael@0: new TestCase( SECTION,    "1 * Number.POSITIVE_INFINITY",                           Number.POSITIVE_INFINITY,   1 * Number.POSITIVE_INFINITY );
michael@0: new TestCase( SECTION,    "-1 * Number.POSITIVE_INFINITY",                          Number.NEGATIVE_INFINITY,   -1 * Number.POSITIVE_INFINITY );
michael@0: 
michael@0: test();
michael@0: