summaryrefslogtreecommitdiffstats
path: root/JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js
diff options
context:
space:
mode:
Diffstat (limited to 'JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js')
-rw-r--r--JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js181
1 files changed, 0 insertions, 181 deletions
diff --git a/JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js b/JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js
deleted file mode 100644
index 47bbe5d..0000000
--- a/JavaScriptCore/tests/mozilla/ecma/Array/15.4.4.5-3.js
+++ /dev/null
@@ -1,181 +0,0 @@
-/* The contents of this file are subject to the Netscape 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/NPL/
- *
- * 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 Netscape are
- * Copyright (C) 1998 Netscape Communications Corporation. All
- * Rights Reserved.
- *
- * Contributor(s):
- *
- */
-/**
- File Name: 15.4.4.5-3.js
- ECMA Section: Array.prototype.sort(comparefn)
- Description:
-
- This is a regression test for
- http://scopus/bugsplat/show_bug.cgi?id=117144
-
- Verify that sort is successfull, even if the sort compare function returns
- a very large negative or positive value.
-
- Author: christine@netscape.com
- Date: 12 november 1997
-*/
-
-
- var SECTION = "15.4.4.5-3";
- var VERSION = "ECMA_1";
- startTest();
- var TITLE = "Array.prototype.sort(comparefn)";
-
- writeHeaderToLog( SECTION + " "+ TITLE);
-
- var testcases = new Array();
- getTestCases();
- test();
-
-function test() {
- for ( tc=0; tc < testcases.length; tc++ ) {
- testcases[tc].passed = writeTestCaseResult(
- testcases[tc].expect,
- testcases[tc].actual,
- testcases[tc].description +" = "+
- testcases[tc].actual );
-
- testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
- }
- stopTest();
- return ( testcases );
-}
-
-function getTestCases() {
- var array = new Array();
-
- array[array.length] = new Date( TIME_2000 * Math.PI );
- array[array.length] = new Date( TIME_2000 * 10 );
- array[array.length] = new Date( TIME_1900 + TIME_1900 );
- array[array.length] = new Date(0);
- array[array.length] = new Date( TIME_2000 );
- array[array.length] = new Date( TIME_1900 + TIME_1900 +TIME_1900 );
- array[array.length] = new Date( TIME_1900 * Math.PI );
- array[array.length] = new Date( TIME_1900 * 10 );
- array[array.length] = new Date( TIME_1900 );
- array[array.length] = new Date( TIME_2000 + TIME_2000 );
- array[array.length] = new Date( 1899, 0, 1 );
- array[array.length] = new Date( 2000, 1, 29 );
- array[array.length] = new Date( 2000, 0, 1 );
- array[array.length] = new Date( 1999, 11, 31 );
-
- var testarr1 = new Array()
- clone( array, testarr1 );
- testarr1.sort( comparefn1 );
-
- var testarr2 = new Array()
- clone( array, testarr2 );
- testarr2.sort( comparefn2 );
-
- testarr3 = new Array();
- clone( array, testarr3 );
- testarr3.sort( comparefn3 );
-
- // when there's no sort function, sort sorts by the toString value of Date.
-
- var testarr4 = new Array()
- clone( array, testarr4 );
- testarr4.sort();
-
- var realarr = new Array();
- clone( array, realarr );
- realarr.sort( realsort );
-
- var stringarr = new Array();
- clone( array, stringarr );
- stringarr.sort( stringsort );
-
- for ( var i = 0, tc = 0; i < array.length; i++, tc++) {
- testcases[tc] = new TestCase(
- SECTION,
- "testarr1["+i+"]",
- realarr[i],
- testarr1[i] );
- }
-
- for ( var i=0; i < array.length; i++, tc++) {
- testcases[tc] = new TestCase(
- SECTION,
- "testarr2["+i+"]",
- realarr[i],
- testarr2[i] );
- }
-
- for ( var i=0; i < array.length; i++, tc++) {
- testcases[tc] = new TestCase(
- SECTION,
- "testarr3["+i+"]",
- realarr[i],
- testarr3[i] );
- }
-
- for ( var i=0; i < array.length; i++, tc++) {
- testcases[tc] = new TestCase(
- SECTION,
- "testarr4["+i+"]",
- stringarr[i].toString(),
- testarr4[i].toString() );
- }
-
-}
-function comparefn1( x, y ) {
- return x - y;
-}
-function comparefn2( x, y ) {
- return x.valueOf() - y.valueOf();
-}
-function realsort( x, y ) {
- return ( x.valueOf() == y.valueOf() ? 0 : ( x.valueOf() > y.valueOf() ? 1 : -1 ) );
-}
-function comparefn3( x, y ) {
- return ( +x == +y ? 0 : ( x > y ? 1 : -1 ) );
-}
-function clone( source, target ) {
- for (i = 0; i < source.length; i++ ) {
- target[i] = source[i];
- }
-}
-function stringsort( x, y ) {
- for ( var i = 0; i < x.toString().length; i++ ) {
- var d = (x.toString()).charCodeAt(i) - (y.toString()).charCodeAt(i);
- if ( d > 0 ) {
- return 1;
- } else {
- if ( d < 0 ) {
- return -1;
- } else {
- continue;
- }
- }
-
- var d = x.length - y.length;
-
- if ( d > 0 ) {
- return 1;
- } else {
- if ( d < 0 ) {
- return -1;
- }
- }
- }
- return 0;
-} \ No newline at end of file