1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/js/src/tests/ecma/Expressions/11.8.3.js Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,86 @@
1.4 +/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
1.5 +/* This Source Code Form is subject to the terms of the Mozilla Public
1.6 + * License, v. 2.0. If a copy of the MPL was not distributed with this
1.7 + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
1.8 +
1.9 +
1.10 +/**
1.11 + File Name: 11.8.3.js
1.12 + ECMA Section: 11.8.3 The less-than-or-equal operator ( <= )
1.13 + Description:
1.14 +
1.15 + Author: christine@netscape.com
1.16 + Date: 12 november 1997
1.17 +*/
1.18 +var SECTION = "11.8.1";
1.19 +var VERSION = "ECMA_1";
1.20 +startTest();
1.21 +
1.22 +writeHeaderToLog( SECTION + " The less-than-or-equal operator ( <= )");
1.23 +
1.24 +new TestCase( SECTION, "true <= false", false, true <= false );
1.25 +new TestCase( SECTION, "false <= true", true, false <= true );
1.26 +new TestCase( SECTION, "false <= false", true, false <= false );
1.27 +new TestCase( SECTION, "true <= true", true, true <= true );
1.28 +
1.29 +new TestCase( SECTION, "new Boolean(true) <= new Boolean(true)", true, new Boolean(true) <= new Boolean(true) );
1.30 +new TestCase( SECTION, "new Boolean(true) <= new Boolean(false)", false, new Boolean(true) <= new Boolean(false) );
1.31 +new TestCase( SECTION, "new Boolean(false) <= new Boolean(true)", true, new Boolean(false) <= new Boolean(true) );
1.32 +new TestCase( SECTION, "new Boolean(false) <= new Boolean(false)", true, new Boolean(false) <= new Boolean(false) );
1.33 +
1.34 +new TestCase( SECTION, "new MyObject(Infinity) <= new MyObject(Infinity)", true, new MyObject( Number.POSITIVE_INFINITY ) <= new MyObject( Number.POSITIVE_INFINITY) );
1.35 +new TestCase( SECTION, "new MyObject(-Infinity) <= new MyObject(Infinity)", true, new MyObject( Number.NEGATIVE_INFINITY ) <= new MyObject( Number.POSITIVE_INFINITY) );
1.36 +new TestCase( SECTION, "new MyObject(-Infinity) <= new MyObject(-Infinity)", true, new MyObject( Number.NEGATIVE_INFINITY ) <= new MyObject( Number.NEGATIVE_INFINITY) );
1.37 +
1.38 +new TestCase( SECTION, "new MyValueObject(false) <= new MyValueObject(true)", true, new MyValueObject(false) <= new MyValueObject(true) );
1.39 +new TestCase( SECTION, "new MyValueObject(true) <= new MyValueObject(true)", true, new MyValueObject(true) <= new MyValueObject(true) );
1.40 +new TestCase( SECTION, "new MyValueObject(false) <= new MyValueObject(false)", true, new MyValueObject(false) <= new MyValueObject(false) );
1.41 +
1.42 +new TestCase( SECTION, "new MyStringObject(false) <= new MyStringObject(true)", true, new MyStringObject(false) <= new MyStringObject(true) );
1.43 +new TestCase( SECTION, "new MyStringObject(true) <= new MyStringObject(true)", true, new MyStringObject(true) <= new MyStringObject(true) );
1.44 +new TestCase( SECTION, "new MyStringObject(false) <= new MyStringObject(false)", true, new MyStringObject(false) <= new MyStringObject(false) );
1.45 +
1.46 +new TestCase( SECTION, "Number.NaN <= Number.NaN", false, Number.NaN <= Number.NaN );
1.47 +new TestCase( SECTION, "0 <= Number.NaN", false, 0 <= Number.NaN );
1.48 +new TestCase( SECTION, "Number.NaN <= 0", false, Number.NaN <= 0 );
1.49 +
1.50 +new TestCase( SECTION, "0 <= -0", true, 0 <= -0 );
1.51 +new TestCase( SECTION, "-0 <= 0", true, -0 <= 0 );
1.52 +
1.53 +new TestCase( SECTION, "Infinity <= 0", false, Number.POSITIVE_INFINITY <= 0 );
1.54 +new TestCase( SECTION, "Infinity <= Number.MAX_VALUE", false, Number.POSITIVE_INFINITY <= Number.MAX_VALUE );
1.55 +new TestCase( SECTION, "Infinity <= Infinity", true, Number.POSITIVE_INFINITY <= Number.POSITIVE_INFINITY );
1.56 +
1.57 +new TestCase( SECTION, "0 <= Infinity", true, 0 <= Number.POSITIVE_INFINITY );
1.58 +new TestCase( SECTION, "Number.MAX_VALUE <= Infinity", true, Number.MAX_VALUE <= Number.POSITIVE_INFINITY );
1.59 +
1.60 +new TestCase( SECTION, "0 <= -Infinity", false, 0 <= Number.NEGATIVE_INFINITY );
1.61 +new TestCase( SECTION, "Number.MAX_VALUE <= -Infinity", false, Number.MAX_VALUE <= Number.NEGATIVE_INFINITY );
1.62 +new TestCase( SECTION, "-Infinity <= -Infinity", true, Number.NEGATIVE_INFINITY <= Number.NEGATIVE_INFINITY );
1.63 +
1.64 +new TestCase( SECTION, "-Infinity <= 0", true, Number.NEGATIVE_INFINITY <= 0 );
1.65 +new TestCase( SECTION, "-Infinity <= -Number.MAX_VALUE", true, Number.NEGATIVE_INFINITY <= -Number.MAX_VALUE );
1.66 +new TestCase( SECTION, "-Infinity <= Number.MIN_VALUE", true, Number.NEGATIVE_INFINITY <= Number.MIN_VALUE );
1.67 +
1.68 +new TestCase( SECTION, "'string' <= 'string'", true, 'string' <= 'string' );
1.69 +new TestCase( SECTION, "'astring' <= 'string'", true, 'astring' <= 'string' );
1.70 +new TestCase( SECTION, "'strings' <= 'stringy'", true, 'strings' <= 'stringy' );
1.71 +new TestCase( SECTION, "'strings' <= 'stringier'", false, 'strings' <= 'stringier' );
1.72 +new TestCase( SECTION, "'string' <= 'astring'", false, 'string' <= 'astring' );
1.73 +new TestCase( SECTION, "'string' <= 'strings'", true, 'string' <= 'strings' );
1.74 +
1.75 +test();
1.76 +
1.77 +function MyObject(value) {
1.78 + this.value = value;
1.79 + this.valueOf = new Function( "return this.value" );
1.80 + this.toString = new Function( "return this.value +''" );
1.81 +}
1.82 +function MyValueObject(value) {
1.83 + this.value = value;
1.84 + this.valueOf = new Function( "return this.value" );
1.85 +}
1.86 +function MyStringObject(value) {
1.87 + this.value = value;
1.88 + this.toString = new Function( "return this.value +''" );
1.89 +}
