Benchmark: Different method to traverse a reversed array.

Script Preparation code:

const array = Array(10000).fill(0).map((_, i) => i);

Tests:

for loop
let sum = 0; for (let i = array.length - 1; i >= 0; i--) { sum += array[i]; }
for of with reverse
let sum = 0; for (const v of [...array].reverse()) { sum += v; }
for of with toReversed
let sum = 0; for (const v of array.toReversed()) { sum += v; }
reduceRight
const sum = array.reduceRight((prev, curr) => prev + curr, 0);
reduceRight with add operation
let sum = 0; array.reduceRight((_, curr) => { sum += curr; })
forEach with reverse
let sum = 0; [...array].reverse().forEach(v => { sum += v; });
forEach with toReversed
let sum = 0; array.toReversed().forEach(v => { sum += v; });

Rendered benchmark preparation results:

Previous results

Test case name	Result
for loop
for of with reverse
for of with toReversed
reduceRight
reduceRight with add operation
forEach with reverse
forEach with toReversed

Latest run results:

Run details: (Test run date: one year ago)

User agent: Mozilla/5.0 (X11; Linux x86_64; rv:138.0) Gecko/20100101 Firefox/138.0

Browser/OS: Firefox 138 on Linux

Test name	Executions per second
for loop	125857.8 Ops/sec
for of with reverse	7148.9 Ops/sec
for of with toReversed	10398.8 Ops/sec
reduceRight	16015.4 Ops/sec
reduceRight with add operation	14299.3 Ops/sec
forEach with reverse	6738.0 Ops/sec
forEach with toReversed	9918.0 Ops/sec

Related benchmarks:

Different method to traverse a reversed array. (version: 1)