forked from facebook/hermes
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlargeArrayRead.js
More file actions
46 lines (41 loc) · 1.2 KB
/
largeArrayRead.js
File metadata and controls
46 lines (41 loc) · 1.2 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
/**
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
// This benchmark tests the speed of array reads for a large array.
// This returns an array that looks like [1, 2, 3, ..., length].
function makeLargeArray(length) {
return new Array(length).fill().map(function (_, i) { return i + 1; });
}
function sum(array) {
var sum = 0;
var i = 0;
while (i < array.length) {
// Assume the array's length is evenly divisible by 10 to avoid length
// check overhead.
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
sum += array[i++];
}
return sum;
}
function run(numTimes) {
var totalSum = 0;
// Hardcode ten thousand elements as a large array. This can be adjusted
// if it is too small.
var arr = makeLargeArray(10000);
for (var i = 0; i < numTimes; i++) {
totalSum += sum(arr);
}
return totalSum;
}
print(run(10000));