Run results for: for key in object iteration vs for of array iteration

Run details:

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/118.0.0.0 Safari/537.36 Edg/118.0.2088.46

Browser: Chrome 118

Operating system: Linux

Device Platform: Desktop

Date tested: one year ago

Array tuple stack pop

189.8M/s

Array tuple iteration

659K/s

Array tuple for index iteration

253K/s

Array key iteration

102K/s

Precomputed Obj keys access

100K/s

Obj key precreate keys iteration

17K/s

Obj key iteration

14K/s

View exact numbers

Test name	Executions per second
✓ Array tuple stack pop	189,753,520 Ops/sec
Array tuple iteration	659,003 Ops/sec
Array tuple for index iteration	252,540 Ops/sec
Array key iteration	101,730 Ops/sec
Precomputed Obj keys access	99,989 Ops/sec
Obj key precreate keys iteration	16,967 Ops/sec
Obj key iteration	14,474 Ops/sec

HTML Preparation code:

<!--your preparation HTML code goes here-->

Script Preparation code:

const obj = {};
const array = [];
const arrayTuples = [];

let expectedSum = 0;
for (let i = 0; i < 1000; i++){
	const letterNum1 = i % 27;
  	const letterNum2 = i % 5;
  	const letterNum3 = i % 13;
  	const key = String.fromCharCode(letterNum1 + 65, letterNum2 + 65, letterNum3 + 65)
    
    obj[key] = i;
    array.push(key);
	arrayTuples.push([key, i])
    
    expectedSum += i;
}
const preComputedKeys = Object.keys(obj);

Tests:

Obj key for in iteration
const arrayPop = [].concat(arrayTuples); let number = 0; for (const key in obj){ number += obj[key]; } return number === expectedSum
Array key for of iteration
const arrayPop = [].concat(arrayTuples); let number = 0; for (const key of array){ number += obj[key]; } return number === expectedSum
Obj key precreate keys for of iteration
const arrayPop = [].concat(arrayTuples); const keys = Object.keys(obj); let number = 0; for (const key of keys){ number += obj[key]; } return number === expectedSum
Array tuple for of iteration
const arrayPop = [].concat(arrayTuples); let number = 0; for (const tuple of arrayTuples){ number += tuple[1]; } return number === expectedSum
Precomputed obj keys iterative obj key access
const arrayPop = [].concat(arrayTuples); let number = 0; for (const key of preComputedKeys){ number += obj[key]; } return number === expectedSum
Array tuple stack pop
// I think calling pop removes items for following test runs // --> appears too fast without cloning the array const arrayPop = [].concat(arrayTuples); let number = 0; while (arrayPop.length > 0){ const item = arrayPop.pop(); number += item[1]; } return number === expectedSum
Array tuple for index iteration
const arrayPop = [].concat(arrayTuples); let number = 0; for (let i = 0; i < arrayTuples.length; i++){ number += arrayTuples[i][1]; } return number === expectedSum