aboutsummaryrefslogtreecommitdiffstats
path: root/tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js
diff options
context:
space:
mode:
Diffstat (limited to 'tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js')
-rw-r--r--tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js83
1 files changed, 0 insertions, 83 deletions
diff --git a/tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js b/tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js
deleted file mode 100644
index b89d9145c9..0000000000
--- a/tests/auto/declarative/parserstress/tests/ecma/Expressions/11.4.2.js
+++ /dev/null
@@ -1,83 +0,0 @@
-/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
-/* ***** BEGIN LICENSE BLOCK *****
- * Version: MPL 1.1/GPL 2.0/LGPL 2.1
- *
- * The contents of this file are subject to the Mozilla Public License Version
- * 1.1 (the "License"); you may not use this file except in compliance with
- * the License. You may obtain a copy of the License at
- * http://www.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS" basis,
- * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
- * for the specific language governing rights and limitations under the
- * License.
- *
- * The Original Code is Mozilla Communicator client code, released
- * March 31, 1998.
- *
- * The Initial Developer of the Original Code is
- * Netscape Communications Corporation.
- * Portions created by the Initial Developer are Copyright (C) 1998
- * the Initial Developer. All Rights Reserved.
- *
- * Contributor(s):
- *
- * Alternatively, the contents of this file may be used under the terms of
- * either the GNU General Public License Version 2 or later (the "GPL"), or
- * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
- * in which case the provisions of the GPL or the LGPL are applicable instead
- * of those above. If you wish to allow use of your version of this file only
- * under the terms of either the GPL or the LGPL, and not to allow others to
- * use your version of this file under the terms of the MPL, indicate your
- * decision by deleting the provisions above and replace them with the notice
- * and other provisions required by the GPL or the LGPL. If you do not delete
- * the provisions above, a recipient may use your version of this file under
- * the terms of any one of the MPL, the GPL or the LGPL.
- *
- * ***** END LICENSE BLOCK ***** */
-
-gTestfile = '11.4.2.js';
-
-/**
- File Name: 11.4.2.js
- ECMA Section: 11.4.2 the Void Operator
- Description: always returns undefined (?)
- Author: christine@netscape.com
- Date: 7 july 1997
-
-*/
-var SECTION = "11.4.2";
-var VERSION = "ECMA_1";
-startTest();
-var TITLE = "The void operator";
-
-writeHeaderToLog( SECTION + " "+ TITLE);
-
-new TestCase( SECTION, "void(new String('string object'))", void 0, void(new String( 'string object' )) );
-new TestCase( SECTION, "void('string primitive')", void 0, void("string primitive") );
-new TestCase( SECTION, "void(Number.NaN)", void 0, void(Number.NaN) );
-new TestCase( SECTION, "void(Number.POSITIVE_INFINITY)", void 0, void(Number.POSITIVE_INFINITY) );
-new TestCase( SECTION, "void(1)", void 0, void(1) );
-new TestCase( SECTION, "void(0)", void 0, void(0) );
-new TestCase( SECTION, "void(-1)", void 0, void(-1) );
-new TestCase( SECTION, "void(Number.NEGATIVE_INFINITY)", void 0, void(Number.NEGATIVE_INFINITY) );
-new TestCase( SECTION, "void(Math.PI)", void 0, void(Math.PI) );
-new TestCase( SECTION, "void(true)", void 0, void(true) );
-new TestCase( SECTION, "void(false)", void 0, void(false) );
-new TestCase( SECTION, "void(null)", void 0, void(null) );
-new TestCase( SECTION, "void new String('string object')", void 0, void new String( 'string object' ) );
-new TestCase( SECTION, "void 'string primitive'", void 0, void "string primitive" );
-new TestCase( SECTION, "void Number.NaN", void 0, void Number.NaN );
-new TestCase( SECTION, "void Number.POSITIVE_INFINITY", void 0, void Number.POSITIVE_INFINITY );
-new TestCase( SECTION, "void 1", void 0, void 1 );
-new TestCase( SECTION, "void 0", void 0, void 0 );
-new TestCase( SECTION, "void -1", void 0, void -1 );
-new TestCase( SECTION, "void Number.NEGATIVE_INFINITY", void 0, void Number.NEGATIVE_INFINITY );
-new TestCase( SECTION, "void Math.PI", void 0, void Math.PI );
-new TestCase( SECTION, "void true", void 0, void true );
-new TestCase( SECTION, "void false", void 0, void false );
-new TestCase( SECTION, "void null", void 0, void null );
-
-// array[item++] = new TestCase( SECTION, "void()", void 0, void() );
-
-test();