rhino1.7.7.testsrc.tests.ecma.Expressions.11.8.1.js Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of rhino Show documentation
Show all versions of rhino Show documentation
Rhino is an open-source implementation of JavaScript written entirely in Java. It is typically
embedded into Java applications to provide scripting to end users.
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
gTestfile = '11.8.1.js';
/**
File Name: 11.8.1.js
ECMA Section: 11.8.1 The less-than operator ( < )
Description:
Author: [email protected]
Date: 12 november 1997
*/
var SECTION = "11.8.1";
var VERSION = "ECMA_1";
startTest();
writeHeaderToLog( SECTION + " The less-than operator ( < )");
new TestCase( SECTION, "true < false", false, true < false );
new TestCase( SECTION, "false < true", true, false < true );
new TestCase( SECTION, "false < false", false, false < false );
new TestCase( SECTION, "true < true", false, true < true );
new TestCase( SECTION, "new Boolean(true) < new Boolean(true)", false, new Boolean(true) < new Boolean(true) );
new TestCase( SECTION, "new Boolean(true) < new Boolean(false)", false, new Boolean(true) < new Boolean(false) );
new TestCase( SECTION, "new Boolean(false) < new Boolean(true)", true, new Boolean(false) < new Boolean(true) );
new TestCase( SECTION, "new Boolean(false) < new Boolean(false)", false, new Boolean(false) < new Boolean(false) );
new TestCase( SECTION, "new MyObject(Infinity) < new MyObject(Infinity)", false, new MyObject( Number.POSITIVE_INFINITY ) < new MyObject( Number.POSITIVE_INFINITY) );
new TestCase( SECTION, "new MyObject(-Infinity) < new MyObject(Infinity)", true, new MyObject( Number.NEGATIVE_INFINITY ) < new MyObject( Number.POSITIVE_INFINITY) );
new TestCase( SECTION, "new MyObject(-Infinity) < new MyObject(-Infinity)", false, new MyObject( Number.NEGATIVE_INFINITY ) < new MyObject( Number.NEGATIVE_INFINITY) );
new TestCase( SECTION, "new MyValueObject(false) < new MyValueObject(true)", true, new MyValueObject(false) < new MyValueObject(true) );
new TestCase( SECTION, "new MyValueObject(true) < new MyValueObject(true)", false, new MyValueObject(true) < new MyValueObject(true) );
new TestCase( SECTION, "new MyValueObject(false) < new MyValueObject(false)", false, new MyValueObject(false) < new MyValueObject(false) );
new TestCase( SECTION, "new MyStringObject(false) < new MyStringObject(true)", true, new MyStringObject(false) < new MyStringObject(true) );
new TestCase( SECTION, "new MyStringObject(true) < new MyStringObject(true)", false, new MyStringObject(true) < new MyStringObject(true) );
new TestCase( SECTION, "new MyStringObject(false) < new MyStringObject(false)", false, new MyStringObject(false) < new MyStringObject(false) );
new TestCase( SECTION, "Number.NaN < Number.NaN", false, Number.NaN < Number.NaN );
new TestCase( SECTION, "0 < Number.NaN", false, 0 < Number.NaN );
new TestCase( SECTION, "Number.NaN < 0", false, Number.NaN < 0 );
new TestCase( SECTION, "0 < -0", false, 0 < -0 );
new TestCase( SECTION, "-0 < 0", false, -0 < 0 );
new TestCase( SECTION, "Infinity < 0", false, Number.POSITIVE_INFINITY < 0 );
new TestCase( SECTION, "Infinity < Number.MAX_VALUE", false, Number.POSITIVE_INFINITY < Number.MAX_VALUE );
new TestCase( SECTION, "Infinity < Infinity", false, Number.POSITIVE_INFINITY < Number.POSITIVE_INFINITY );
new TestCase( SECTION, "0 < Infinity", true, 0 < Number.POSITIVE_INFINITY );
new TestCase( SECTION, "Number.MAX_VALUE < Infinity", true, Number.MAX_VALUE < Number.POSITIVE_INFINITY );
new TestCase( SECTION, "0 < -Infinity", false, 0 < Number.NEGATIVE_INFINITY );
new TestCase( SECTION, "Number.MAX_VALUE < -Infinity", false, Number.MAX_VALUE < Number.NEGATIVE_INFINITY );
new TestCase( SECTION, "-Infinity < -Infinity", false, Number.NEGATIVE_INFINITY < Number.NEGATIVE_INFINITY );
new TestCase( SECTION, "-Infinity < 0", true, Number.NEGATIVE_INFINITY < 0 );
new TestCase( SECTION, "-Infinity < -Number.MAX_VALUE", true, Number.NEGATIVE_INFINITY < -Number.MAX_VALUE );
new TestCase( SECTION, "-Infinity < Number.MIN_VALUE", true, Number.NEGATIVE_INFINITY < Number.MIN_VALUE );
new TestCase( SECTION, "'string' < 'string'", false, 'string' < 'string' );
new TestCase( SECTION, "'astring' < 'string'", true, 'astring' < 'string' );
new TestCase( SECTION, "'strings' < 'stringy'", true, 'strings' < 'stringy' );
new TestCase( SECTION, "'strings' < 'stringier'", false, 'strings' < 'stringier' );
new TestCase( SECTION, "'string' < 'astring'", false, 'string' < 'astring' );
new TestCase( SECTION, "'string' < 'strings'", true, 'string' < 'strings' );
test();
function MyObject(value) {
this.value = value;
this.valueOf = new Function( "return this.value" );
this.toString = new Function( "return this.value +''" );
}
function MyValueObject(value) {
this.value = value;
this.valueOf = new Function( "return this.value" );
}
function MyStringObject(value) {
this.value = value;
this.toString = new Function( "return this.value +''" );
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy