Benchmark: Array.includes vs String.includes vs Object Hashmap vs Set vs Array.indexOf Large

Script Preparation code:

var testArray = ['foo', 'a','b', 'c','d','e','f','g','h','i','j', 'k', 'l','m','n' ,'bar','o', 'p', 'q', 'r', 's','t','u', 'v','w','x','y', 'z'];
var testString = testArray.join(',');
var objectHash = testArray.reduce((acc, key) => {acc[key] = true; return acc;},{});
var testSet = new Set(testArray);

Tests:

Array.includes
const testStrFirst = 'foo'; testArray.includes(testStrFirst); const testStrSecond = 'bar'; testArray.includes(testStrSecond); const testStrNotMatch = 'baz'; testArray.includes(testStrNotMatch);
String.includes
const testStrFirst = 'foo'; testString.includes(testStrFirst); const testStrSecond = 'bar'; testString.includes(testStrSecond); const testStrNotMatch = 'baz'; testString.includes(testStrNotMatch);
Object Hash-map
const testStrFirst = 'foo'; objectHash[testStrFirst]; const testStrSecond = 'bar'; objectHash[testStrSecond]; const testStrNotMatch = 'baz'; objectHash[testStrNotMatch];
ES6 Set
const testStrFirst = 'foo'; testSet.has(testStrFirst); const testStrSecond = 'bar'; testSet.has(testStrSecond); const testStrNotMatch = 'baz'; testSet.has(testStrNotMatch);
Array.indexOf
const testStrFirst = 'foo'; testArray.indexOf(testStrFirst); const testStrSecond = 'bar'; testArray.indexOf(testStrSecond); const testStrNotMatch = 'baz'; testArray.indexOf(testStrNotMatch);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Array.includes
String.includes
Object Hash-map
ES6 Set
Array.indexOf

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: 2 months ago)

User agent: Mozilla/5.0 (iPad; CPU OS 18_3_0 like Mac OS X) AppleWebKit/605.1.15 (KHTML, like Gecko) CriOS/133.0.6943.33 Mobile/15E148 Safari/604.1

Browser/OS: Chrome Mobile iOS 133 on iOS 18.3.0

View result in a separate tab

Test name	Executions per second
Array.includes	17318366.0 Ops/sec
String.includes	12903018.0 Ops/sec
Object Hash-map	473191008.0 Ops/sec
ES6 Set	429307264.0 Ops/sec
Array.indexOf	470702048.0 Ops/sec

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

LLMs can make mistakes. Check important info.

Let's dive into the benchmark and its various test cases.

**Benchmark Overview**

The benchmark measures the performance of different methods for matching a string against multiple possibilities in an array or object. The tests are designed to compare the speed of:

1. `Array.includes`
2. `String.includes` (a method introduced in ECMAScript 2015, also known as "string includes")
3. Object Hashmap (using a hash map data structure)
4. ES6 Set (using a set data structure)
5. `Array.indexOf`

**Test Cases**

Each test case consists of a benchmark definition and a name. The benchmark definitions are:

1. `const testStrFirst = 'foo';\r\ntestArray.includes(testStrFirst);\r\n\r\nconst testStrSecond = 'bar';\r\ntestArray.includes(testStrSecond);\r\n\r\nconst testStrNotMatch = 'baz';\r\ntestArray.includes(testStrNotMatch);` (Array includes)
2. `const testStrFirst = 'foo';\r\ntestString.includes(testStrFirst);\r\n\r\nconst testStrSecond = 'bar';\r\ntestString.includes(testStrSecond);\r\n\r\nconst testStrNotMatch = 'baz';\r\ntestString.includes(testStrNotMatch);` (String includes)
3. `const testStrFirst = 'foo';\r\nobjectHash[testStrFirst];\r\n\r\nconst testStrSecond = 'bar';\r\nobjectHash[testStrSecond];\r\n\r\nconst testStrNotMatch = 'baz';\r\nobjectHash[testStrNotMatch];` (Object Hashmap)
4. `const testStrFirst = 'foo';\r\ntestSet.has(testStrFirst);\r\n\r\nconst testStrSecond = 'bar';\r\ntestSet.has(testStrSecond);\r\n\r\nconst testStrNotMatch = 'baz';\r\ntestSet.has(testStrNotMatch);` (ES6 Set)
5. `const testStrFirst = 'foo';\r\ntestArray.indexOf(testStrFirst);\r\n\r\nconst testStrSecond = 'bar';\r\ntestArray.indexOf(testStrSecond);\r\n\r\nconst testStrNotMatch = 'baz';\r\ntestArray.indexOf(testStrNotMatch);` (Array indexOf)

**Library and Data Structures**

1. `Object Hashmap`: A hash map is a data structure that stores key-value pairs in an array. In this benchmark, the object hashmap is created by reducing the test array into a single object with all keys being true.
2. ES6 Set: A set is a data structure that stores unique values in an unordered collection. In this benchmark, the set is created from the test array.

**Special Features and Syntax**

None of the tests use any special JavaScript features or syntax beyond what's required for the specific method being tested (e.g., `includes`, `has`).

**Alternatives**

Other alternatives for matching a string against multiple possibilities in an array or object might include:

1. `Array.prototype.some()`: A method that returns true if at least one element of the array satisfies the specified condition.
2. `Array.prototype.every()`: A method that returns true if all elements of the array satisfy the specified condition.
3. Custom implementation using a loop and conditional statements.

However, these alternatives may not be as optimized or efficient as the methods being tested in this benchmark (e.g., `includes`, `has`).

Overall, this benchmark provides a good comparison of different methods for matching a string against multiple possibilities in an array or object, highlighting the performance differences between various approaches.

Related benchmarks:

Array.includes vs String.includes vs Object Hashmap vs Set vs Array.indexOf Large (version: 0)

Matching a string against more than one possibility.

Comparing performance of: Array.includes vs String.includes vs Object Hash-map vs ES6 Set vs Array.indexOf

Created: 2 years ago by: Guest

Jump to the latest result

Array.includes

String.includes

Object Hash-map

ES6 Set

Array.indexOf

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

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