Benchmark: Object array search by property

Script Preparation code:

a = [];
for(var i=0;i<10000;i++){
  a.push({index:i,data:"blabla",randomField:"foobarfoobarfoobarfoobar",date:Date.now()});
}
var indexToFind = 5780;

Tests:

for loop
ind = -1; for(var i =0;i<a.length;i++){ if(a[i].index == indexToFind){ ind = i; } } a[ind].data;
javascript array.find
a.find(x => x.index == indexToFind).data;
javascript array.find with function
a.find(function(cv,i){ return cv.index == indexToFind;}).data;
javascript array.find with function and index
a.find(function(cv,i){ if(cv.index == indexToFind){ ind = i; return true; }else return false; }).data;

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
for loop
javascript array.find
javascript array.find with function
javascript array.find with function and index

Fastest: N/A

Slowest: N/A

Latest run results:

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

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/121.0.0.0 Safari/537.36

Browser/OS: Chrome 121 on Linux

View result in a separate tab

Test name	Executions per second
for loop	548.6 Ops/sec
javascript array.find	4168.9 Ops/sec
javascript array.find with function	4167.5 Ops/sec
javascript array.find with function and index	4219.5 Ops/sec

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

LLMs can make mistakes. Check important info.

Let's dive into the world of JavaScript microbenchmarks on MeasureThat.net.

**Benchmark Definition**

The benchmark defines an array `a` with 10,000 elements, each containing an `index`, `data`, and `randomField`. The `date` field is set to the current time. We're interested in finding the element at a specific index (`5780`) using different approaches: for loops, `Array.prototype.find()`, and variations of the latter.

**Options Compared**

The benchmark compares four options:

1. **For Loop**: A traditional loop that iterates over the array until it finds the desired element.
2. **JavaScript Array.prototype.find()**: A method that returns the first element in the array that satisfies a given condition.
3. **JavaScript Array.prototype.find() with function**: Similar to the previous option, but instead of passing an expression, we pass a function that returns `true` when the element is found.
4. **JavaScript Array.prototype.find() with function and index**: A variation of the previous option where the function also updates an external variable (`ind`) with the index of the found element.

**Pros and Cons**

Here's a brief summary of each approach:

* **For Loop**:
	+ Pros: Simple, intuitive, and works well for small arrays.
	+ Cons: Slow for large arrays due to the overhead of iteration.
* **JavaScript Array.prototype.find()**:
	+ Pros: Fast and efficient for finding a single element in an array. It uses a more optimized algorithm than traditional loops.
	+ Cons: May not work as expected if the array is very large or has many duplicate elements, causing it to skip elements.
* **JavaScript Array.prototype.find() with function**:
	+ Pros: More flexible and customizable than the `find()` method alone, but still relatively efficient.
	+ Cons: May incur additional overhead due to function call and execution.
* **JavaScript Array.prototype.find() with function and index**:
	+ Pros: Combines the benefits of custom functions with the efficiency of `find()`. However, be cautious about using external variables in this context.
	+ Cons: Potential for issues with variable scope, synchronization, or data corruption.

**Library Usage**

None of the benchmark options rely on any specific libraries. They are all pure JavaScript implementations.

**Special JS Features**

The benchmark doesn't explicitly mention any special JavaScript features like `let`/`const`, arrow functions, or ES6 classes. However, it does use traditional for loops and function definitions, which might be less efficient than their modern counterparts.

**Benchmark Preparation Code**

The preparation code creates an array of 10,000 elements with specific properties and values. The `indexToFind` variable is set to a specific value (5780) that will be used in the benchmark tests.

Now that we've explored the benchmark definition, let's move on to some alternative approaches:

**Other Alternatives**

Some possible alternative approaches for finding an element in an array include:

* Using `Array.prototype.findIndex()` instead of `find()`, which returns -1 if no element is found.
* Utilizing WebAssembly or other low-level optimization techniques.
* Implementing a custom binary search algorithm.
* Leveraging existing libraries like Lodash or Ramda.

Keep in mind that each approach has its trade-offs and might be more suitable for specific use cases.

Related benchmarks:

Object array search by property (version: 4)

Comparing performance of: for loop vs javascript array.find vs javascript array.find with function vs javascript array.find with function and index

Created: 9 years ago by: Registered User

Jump to the latest result

for loop

javascript array.find

javascript array.find with function

javascript array.find with function and index

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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