Benchmark: set.has vs. array.includes (1 million entries)

Script Preparation code:

var a = [];
for(let i = 0; i < 1000000; i++) {
  a.push(i);
}
var b = new Set(a)

Tests:

array.includes
return a.includes(9)
set.has
return b.has(9)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
array.includes
set.has

Fastest: N/A

Slowest: N/A

Latest run results:

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

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/116.0.0.0 Safari/537.36 OPR/102.0.0.0

Browser/OS: Opera 102 on Windows

View result in a separate tab

Test name	Executions per second
array.includes	15720540.0 Ops/sec
set.has	15684142.0 Ops/sec

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

LLMs can make mistakes. Check important info.

I'll break down the benchmark and explain what's being tested, compared, and the pros and cons of each approach.

**Benchmark Overview**

The benchmark measures the performance difference between using `Array.includes()` and `Set.has()` to search for an element in two arrays with 1 million entries. The test case uses a JavaScript library (a simple array and Set implementation).

**Script Preparation Code**

The script preparation code creates two arrays:

1. `a`: An array of 1 million integers, populated using a `for` loop.
2. `b`: A new `Set` object containing the elements of `a`.

**Html Preparation Code**

There is no HTML preparation code provided.

**Individual Test Cases**

There are two test cases:

1. **Array.includes()**
	* Benchmark Definition: `return a.includes(9)`
	* Purpose: Measure the performance of using `Array.includes()` to search for an element in array `a`.
2. **Set.has()**
	* Benchmark Definition: `return b.has(9)`
	* Purpose: Measure the performance of using `Set.has()` to search for an element in set `b`.

**Pros and Cons**

Here are some pros and cons of each approach:

1. **Array.includes()**
	* Pros:
		+ Widely supported by most browsers.
		+ Easy to use and understand.
		+ Can handle arrays with large numbers of elements efficiently.
	* Cons:
		+ May have performance issues for very large arrays due to the need to scan the entire array.
2. **Set.has()**
	* Pros:
		+ Fast lookup times, especially for large datasets (O(1) on average).
		+ Can be more efficient than `Array.includes()` for very large arrays.
	* Cons:
		+ May not be as widely supported by older browsers.
		+ Requires a Set object to be created beforehand.

**Library: Simple Array and Set Implementation**

The test case uses a simple array and set implementation, which is likely just for demonstration purposes. In real-world scenarios, you would typically use built-in JavaScript arrays and sets.

**Other Considerations**

* **Data Distribution**: The benchmark assumes that the data in both arrays is evenly distributed (i.e., every number appears an equal number of times). This may not always be the case in real-world datasets.
* **Browser Variability**: Different browsers may have varying levels of support for `Array.includes()` and `Set.has()`, which can affect performance.

**Alternatives**

If you wanted to compare the performance of other methods, such as:

1. **Regular expressions (regex)**: You could use a regex to search for the element in the array.
2. **Binary search**: If the data is sorted, binary search can be a more efficient approach.
3. **Other set-based operations**: Depending on your specific requirements, you might want to test other set-based operations like `Set.size()` or `Set.delete()`.

Related benchmarks:

set.has vs. array.includes (1 million entries) (version: 0)

Comparing performance of: array.includes vs set.has

Created: one year ago by: Guest

Jump to the latest result

array.includes

set.has

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

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