Benchmark: Set has vs object key - small object, no caching

Script Preparation code:

var obj = {
  '.': true,
  ' ': true,
  ',': true,
  ';': true,
};
var array = Object.keys(obj);
var set = new Set(array);

function getKey() {
  return array[Math.floor(Math.random() * array.length)];
}

function getNonKey() {
  return Math.random() > 0.5 ? '!' : '?';
}

Tests:

Includes
array.includes(getKey()) && array.includes(getNonKey())
Object[key]
obj[getKey()] && obj[getNonKey()]
Set.has
set.has(getKey()) && set.has(getNonKey())

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Includes
Object[key]
Set.has

Fastest: N/A

Slowest: N/A

Latest run results:

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

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/134.0.0.0 Safari/537.36

Browser/OS: Chrome 134 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
Includes	15876717.0 Ops/sec
Object[key]	14940740.0 Ops/sec
Set.has	19964588.0 Ops/sec

Related benchmarks:

Set has vs object key - small object, no caching (version: 1)

performance comparison of looking up a value from a set

Comparing performance of: Includes vs Object[key] vs Set.has

Created: one year ago by: Registered User

Jump to the latest result

Includes

Object[key]

Set.has

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A