Benchmark: Array.includes vs Object key lookup vs Set.has

Script Preparation code:

var a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
var b = {1: true, 2: true, 3: true, 4: true, 5: true, 6: true, 7: true, 8: true, 9: true, 10: true}
var set = new Set([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);

Tests:

includes
return a.includes(9)
key lookup
return !!b['9']
set lookup
return set.has(9)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
includes
key lookup
set lookup

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/112.0.0.0 Safari/537.36

Browser/OS: Chrome 112 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
includes	18657414.0 Ops/sec
key lookup	18733108.0 Ops/sec
set lookup	19087262.0 Ops/sec

Autogenerated LLM Summary (model llama3.2:3b, generated one month ago):

LLMs can make mistakes. Check important info.

Let's break down the provided JSON and explain what is being tested, compared, and analyzed.

**Benchmark Definition**

The benchmark definition represents the overall test suite that includes three individual test cases:

1. `Array.includes`
2. `Object key lookup` (using the dot notation `!!b['9']`)
3. `Set lookup` (using the `has()` method)

Each test case is designed to measure the performance of a specific JavaScript operation on an array, object, or set.

**Test Case Analysis**

1. **Array.includes**
	* The test case checks if the element `9` exists in the array `a`. This operation has a time complexity of O(n), where n is the length of the array.
	* The pros: simple and straightforward implementation.
	* Cons: can be slow for large arrays due to the linear search.
2. **Object key lookup**
	* The test case checks if the property `9` exists in the object `b`. This operation has a time complexity of O(1) on average, as it relies on hash tables under the hood.
	* The pros: fast and efficient for accessing individual properties by their keys.
	* Cons: may not be suitable for large datasets or complex objects due to memory constraints.
3. **Set lookup**
	* The test case checks if the element `9` exists in the set `set`. This operation has an average time complexity of O(1), as it uses a hash table to store and retrieve elements.
	* The pros: fast and efficient for accessing individual elements, especially when dealing with large datasets.
	* Cons: may not be suitable for sets with duplicate elements or complex operations.

**Library and Special JS Feature**

None of the test cases explicitly use any external libraries. However, JavaScript's built-in data structures (arrays, objects, and sets) are being used to perform the operations.

There are no special JavaScript features mentioned in this benchmark definition.

Related benchmarks:

Array.includes vs Object key lookup vs Set.has (version: 0)

Comparing performance of: includes vs key lookup vs set lookup

Created: one year ago by: Registered User

Jump to the latest result

includes

key lookup

set lookup

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated one month ago):