Run results for: Map.keys() + Map.get() vs. Map.forEach() vs. Map.entries()

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:149.0) Gecko/20100101 Firefox/149.0

Browser: Firefox 149

Operating system: Windows

Device Platform: Desktop

Date tested: one month ago

forEach()

1.2M/s

entries()

512K/s

keys() + get()

447K/s

View exact numbers

Test name	Executions per second
✓ forEach()	1,224,581 Ops/sec
entries()	511,635 Ops/sec
keys() + get()	447,210 Ops/sec

HTML Preparation code:

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

Script Preparation code:

// Bereite eine globale Test-Map mit 50 Einträgen vor
const LIST_CACHE = new Map();
for (let i = 0; i < 50; i++) {
    const itemMock = { id: `item_${i}`, maxStack: 99, isUnique: false };
    LIST_CACHE.set(itemMock, Math.floor(Math.random() * 10) + 1);
}

// Minimaler Mock für die #has Methode des Inventars (gibt immer true zurück, um reinen Schleifen-Overhead zu messen)
const inventoryMock = {
    has: function(item, count) {
        // Simuliere minimale Logik, damit der JIT die Schleife nicht wegoptimiert
        return item.maxStack > 0 && count > 0;
    }
};

Tests:

keys() + get()
let allItemsMatch = true; for (const item of LIST_CACHE.keys()) { if (!inventoryMock.has(item, LIST_CACHE.get(item))) { allItemsMatch = false; break; } }
forEach()
let allItemsMatch = true; LIST_CACHE.forEach((count, item) => { if (!allItemsMatch) return; if (!inventoryMock.has(item, count)) { allItemsMatch = false; } });
entries()
let allItemsMatch = true; for (const [item, count] of LIST_CACHE) { if (!inventoryMock.has(item, count)) { allItemsMatch = false; break; } }