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
|
// Copyright (C) 2016 the V8 project authors. All rights reserved.
// This code is governed by the BSD license found in the LICENSE file.
/*---
esid: sec-%typedarray%.prototype.sort
description: Sort values to numeric ascending order
info: |
22.2.3.26 %TypedArray%.prototype.sort ( comparefn )
When the TypedArray SortCompare abstract operation is called with two
arguments x and y, the following steps are taken:
...
includes: [testTypedArray.js, compareArray.js]
features: [TypedArray]
---*/
testWithTypedArrayConstructors(function(TA, N) {
var sample;
sample = new TA(N([4, 3, 2, 1])).sort();
assert(compareArray(sample, N([1, 2, 3, 4])), "descending values");
sample = new TA(N([3, 4, 1, 2])).sort();
assert(compareArray(sample, N([1, 2, 3, 4])), "mixed numbers");
sample = new TA(N([3, 4, 3, 1, 0, 1, 2])).sort();
assert(compareArray(sample, N([0, 1, 1, 2, 3, 3, 4])), "repeating numbers");
sample = new TA(N([1, 0, -0, 2])).sort();
assert(compareArray(sample, N([0, 0, 1, 2])), "0s");
});
testWithTypedArrayConstructors(function(TA) {
var sample = new TA([-4, 3, 4, -3, 2, -2, 1, 0]).sort();
assert(compareArray(sample, [-4, -3, -2, 0, 1, 2, 3, 4]), "negative values");
}, [Float64Array, Float32Array, Int8Array, Int16Array, Int32Array]);
testWithTypedArrayConstructors(function(TA) {
var sample;
sample = new TA([0.5, 0, 1.5, 1]).sort();
assert(compareArray(sample, [0, 0.5, 1, 1.5]), "non integers");
sample = new TA([0.5, 0, 1.5, -0.5, -1, -1.5, 1]).sort();
assert(compareArray(sample, [-1.5, -1, -0.5, 0, 0.5, 1, 1.5]), "non integers + negatives");
sample = new TA([1, 0, -0, 2]).sort();
assert(compareArray(sample, [0, 0, 1, 2]), "0 and -0");
sample = new TA([3, 4, Infinity, -Infinity, 1, 2]).sort();
assert(compareArray(sample, [-Infinity, 1, 2, 3, 4, Infinity]), "infinities");
}, [Float64Array, Float32Array]);
|
