Run results for: Different method to traverse a reversed array.

Run details:

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

Browser: Firefox 138

Operating system: Linux

Device Platform: Desktop

Date tested: one year ago

Test name	Executions per second
✓ for loop	125,858 Ops/sec
reduceRight	16,015 Ops/sec
reduceRight with add operation	14,299 Ops/sec
for of with toReversed	10,399 Ops/sec
forEach with toReversed	9,918 Ops/sec
for of with reverse	7,149 Ops/sec
forEach with reverse	6,738 Ops/sec

Test name

Executions per second

✓ for loop

125,858 Ops/sec

reduceRight

16,015 Ops/sec

reduceRight with add operation

14,299 Ops/sec

for of with toReversed

10,399 Ops/sec

forEach with toReversed

9,918 Ops/sec

for of with reverse

7,149 Ops/sec

forEach with reverse

6,738 Ops/sec

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; });