1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
/* -*- tab-width: 2; indent-tabs-mode: nil; js-indent-level: 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/. */
/**
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 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; i < array.length; i++) {
new TestCase(
SECTION,
"testarr1["+i+"]",
realarr[i],
testarr1[i] );
}
for ( var i=0; i < array.length; i++) {
new TestCase(
SECTION,
"testarr2["+i+"]",
realarr[i],
testarr2[i] );
}
for ( var i=0; i < array.length; i++) {
new TestCase(
SECTION,
"testarr3["+i+"]",
realarr[i],
testarr3[i] );
}
for ( var i=0; i < array.length; i++) {
new TestCase(
SECTION,
"testarr4["+i+"]",
stringarr[i].toString(),
testarr4[i].toString() );
}
test();
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;
}
|
