forked from chakra-core/ChakraCore
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharray_qsortr.js
More file actions
110 lines (89 loc) · 3.17 KB
/
array_qsortr.js
File metadata and controls
110 lines (89 loc) · 3.17 KB
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
//-------------------------------------------------------------------------------------------------------
// Copyright (C) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
//-------------------------------------------------------------------------------------------------------
// Test our custom qsort_r implementation on xplat.
function testArray(SORT_FNC, limit, test_id) {
var THROW = function (pos) {
throw new Error("Broken qsort_r!!! (" + pos + ") for test:" + test_id);
};
function getArray(is_typed) {
var t = is_typed ? new Int32Array(limit) : new Array(limit);
for (var i = limit - 1; i >= 0; i--) {
t[i] = i;
}
return t.sort(SORT_FNC);
}
// test array of 1s
var arr = new Array(limit);
arr.fill(1);
arr = arr.sort(SORT_FNC);
if (arr[0] + arr[limit - 1] != 2) THROW(0); // 0
// what if we add couple of other numbers?
arr[0] = 5;
arr[limit - 1] = 0;
arr = arr.sort(SORT_FNC);
if (arr[0] + arr[limit - 1] != 5) THROW(1); // 1
// test reverse ordered JS Array
arr = getArray(0);
if (arr[0] + arr[1] + arr[limit - 1] != limit) THROW(2); // 2
// test reverse ordered JS TypedArray
arr = getArray(1);
if (arr[0] + arr[1] + arr[limit - 1] != limit) THROW(3); // 3
// scramble
for (var i = 1; i < limit / 10; i++) {
var tmp = arr[limit - i];
arr[limit - i] = arr[i];
arr[i] = tmp;
}
// test mixed ordered JS TypedArray
arr = arr.sort(SORT_FNC);
if (arr[0] + arr[1] + arr[limit - 1] != limit) THROW(4); // 4
// scramble further
for (var i = 1; i < limit / 10; i++) {
var tmp = arr[limit - i];
arr[limit - i] = arr[i];
arr[i] = tmp;
}
var pos = limit - 1;
for (var i = limit / 2; i < limit; i++) {
var tmp = arr[pos];
arr[pos] = arr[i];
arr[i] = tmp;
pos--;
}
// test scrambled JS TypedArray
arr = arr.sort(SORT_FNC);
if (arr[0] + arr[1] + arr[limit - 1] != limit) THROW(5); // 5
}
var arraySize = WScript.Platform.BUILD_TYPE == "Release" ? 5e5 /* 500K */ : 1e4; // CI timeout for Debug build
if (arraySize % 2 || arraySize < 1e4) {
throw new Error(
"Array size is too small.. and some of the loops above works better with arraySize % 2 == 0")
}
testArray(
function (x, y) {
return x > y ? +1 : (x < y ? -1 : 0);
},
arraySize /* test 500K items */,
"NoThrow");
testArray(
function (x, y) {
try {
if (x % 2) throw new Error("Crash!!!! ?");
} catch (e) { /* no. this shouldn't crash! */ }
return x > y ? +1 : (x < y ? -1 : 0);
},
1000 /* no need to test bigger arrays. >= 512 is sufficient */,
"Throw-Catch Inside");
// This one actually doesn't sort anything.
try {
testArray(
function (x, y) {
if (x % 2) throw new Error("Crash!!!! ?");
return x > y ? +1 : (x < y ? -1 : 0);
},
1000 /* no need to test bigger arrays.*/,
"Throw-Catch Outside");
} catch (e) { /* no. this shouldn't crash! */ }
WScript.Echo("PASS");