1 /* The contents of this file are subject to the Netscape Public
2 * License Version 1.1 (the "License"); you may not use this file
3 * except in compliance with the License. You may obtain a copy of
4 * the License at http://www.mozilla.org/NPL/
6 * Software distributed under the License is distributed on an "AS
7 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
8 * implied. See the License for the specific language governing
9 * rights and limitations under the License.
11 * The Original Code is Mozilla Communicator client code, released March
14 * The Initial Developer of the Original Code is Netscape Communications
15 * Corporation. Portions created by Netscape are
16 * Copyright (C) 1998 Netscape Communications Corporation. All
23 File Name: 15.4.4.5-3.js
24 ECMA Section: Array.prototype.sort(comparefn)
27 This is a regression test for
28 http://scopus/bugsplat/show_bug.cgi?id=117144
30 Verify that sort is successfull, even if the sort compare function returns
31 a very large negative or positive value.
33 Author: christine@netscape.com
34 Date: 12 november 1997
38 var SECTION = "15.4.4.5-3";
39 var VERSION = "ECMA_1";
41 var TITLE = "Array.prototype.sort(comparefn)";
43 writeHeaderToLog( SECTION + " "+ TITLE);
45 var testcases = new Array();
50 for ( tc=0; tc < testcases.length; tc++ ) {
51 testcases[tc].passed = writeTestCaseResult(
54 testcases[tc].description +" = "+
55 testcases[tc].actual );
57 testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
63 function getTestCases() {
64 var array = new Array();
66 array[array.length] = new Date( TIME_2000 * Math.PI );
67 array[array.length] = new Date( TIME_2000 * 10 );
68 array[array.length] = new Date( TIME_1900 + TIME_1900 );
69 array[array.length] = new Date(0);
70 array[array.length] = new Date( TIME_2000 );
71 array[array.length] = new Date( TIME_1900 + TIME_1900 +TIME_1900 );
72 array[array.length] = new Date( TIME_1900 * Math.PI );
73 array[array.length] = new Date( TIME_1900 * 10 );
74 array[array.length] = new Date( TIME_1900 );
75 array[array.length] = new Date( TIME_2000 + TIME_2000 );
76 array[array.length] = new Date( 1899, 0, 1 );
77 array[array.length] = new Date( 2000, 1, 29 );
78 array[array.length] = new Date( 2000, 0, 1 );
79 array[array.length] = new Date( 1999, 11, 31 );
81 var testarr1 = new Array()
82 clone( array, testarr1 );
83 testarr1.sort( comparefn1 );
85 var testarr2 = new Array()
86 clone( array, testarr2 );
87 testarr2.sort( comparefn2 );
89 testarr3 = new Array();
90 clone( array, testarr3 );
91 testarr3.sort( comparefn3 );
93 // when there's no sort function, sort sorts by the toString value of Date.
95 var testarr4 = new Array()
96 clone( array, testarr4 );
99 var realarr = new Array();
100 clone( array, realarr );
101 realarr.sort( realsort );
103 var stringarr = new Array();
104 clone( array, stringarr );
105 stringarr.sort( stringsort );
107 for ( var i = 0, tc = 0; i < array.length; i++, tc++) {
108 testcases[tc] = new TestCase(
115 for ( var i=0; i < array.length; i++, tc++) {
116 testcases[tc] = new TestCase(
123 for ( var i=0; i < array.length; i++, tc++) {
124 testcases[tc] = new TestCase(
131 for ( var i=0; i < array.length; i++, tc++) {
132 testcases[tc] = new TestCase(
135 stringarr[i].toString(),
136 testarr4[i].toString() );
140 function comparefn1( x, y ) {
143 function comparefn2( x, y ) {
144 return x.valueOf() - y.valueOf();
146 function realsort( x, y ) {
147 return ( x.valueOf() == y.valueOf() ? 0 : ( x.valueOf() > y.valueOf() ? 1 : -1 ) );
149 function comparefn3( x, y ) {
150 return ( +x == +y ? 0 : ( x > y ? 1 : -1 ) );
152 function clone( source, target ) {
153 for (i = 0; i < source.length; i++ ) {
154 target[i] = source[i];
157 function stringsort( x, y ) {
158 for ( var i = 0; i < x.toString().length; i++ ) {
159 var d = (x.toString()).charCodeAt(i) - (y.toString()).charCodeAt(i);
170 var d = x.length - y.length;