Benchmark: random Some vs Find

Script Preparation code:

var data = []
var percent = Math.random()
for (let i = 0; i < 10000 * percent; ++i) data.push({ username: 'toto' })
data.push({ username: 'titi' })
for (let i = 0; i < 10000 * (1 - percent); ++i) data.push({ username: 'toto' })

Tests:

Find
data.find(e => e.username === 'titi')
Some
data.some(e => e.username === 'titi')

Historical Performance Data aggregated from 6 community runs

Desktop Results:

Chrome 6 runs

Some

657K/s

Find

652K/s

View exact numbers

✓ Some: 656,744 ops/sec
• Find: 651,518 ops/sec

Results show median performance across all community submissions. Run this benchmark yourself to verify on your device.

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Find
Some

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

Browser/OS: Chrome 120 on Linux

View result in a separate tab

Some

60K/s

Find

59K/s

View exact numbers

Test name	Executions per second
✓ Some	60,060 Ops/sec
Find	58,655 Ops/sec

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

LLMs can make mistakes. Check important info.

I'll break down the benchmark and explain what's being tested.

**Benchmark Overview**

The benchmark is designed to measure the performance difference between two common JavaScript methods: `find` and `some`. Both methods are used to test whether an element in an array matches a certain condition.

**Script Preparation Code**

The script preparation code generates an array of objects with a username property. The array has two different cases:

1.  **Random Case**: The array contains 10,000 elements where the username is 'toto' (in `percent`% of the total). This represents one possible scenario where we need to find the element with username 'titi'.
2.  **Non-Random Case**: The array contains 10,000 elements where the username is 'toto' (100% of the total). This represents another possible scenario where we need to find the element with username 'titi'.

**HTML Preparation Code**

There is no HTML preparation code provided.

**Individual Test Cases**

There are two test cases:

1.  **Find**: Tests whether an element can be found in the array using the `find` method.
2.  **Some**: Tests whether at least one element can be found in the array using the `some` method.

**Comparison of Find and Some Methods**

Both methods have different pros and cons:

*   **Find Method:**
    *   Pros:
        *   Finds the exact element that meets the condition.
        *   Can be more efficient than `some` when the condition is specific to a single element.
    *   Cons:
        *   Returns undefined if no elements meet the condition.
        *   May have higher overhead for larger arrays due to its exhaustive search nature.
*   **Some Method:**
    *   Pros:
        *   Returns true as soon as an element meets the condition, which can be beneficial for larger arrays.
        *   More concise and often preferred in modern JavaScript development.

However, when it comes to performance, `some` might not perform better if the array is small. Additionally, `find` can be more readable and maintainable when dealing with complex conditions or edge cases.

**Library and Special JS Features**

In this benchmark, we don't see any explicit usage of external libraries. The code only uses built-in JavaScript methods and data structures.

However, it's worth noting that modern browsers often come with their own proprietary performance optimizations for array methods. For example, Google Chrome has a specialized optimizer for the `find` method to reduce overhead in certain cases.

**Alternatives**

If you wanted to create an alternative benchmark, here are some approaches:

*   **Array.prototype.findIndex**: Instead of using the native `find` and `some` methods, you could use the alternative methods provided by Array.prototype. These methods offer a similar API but may have different performance characteristics.
*   **Manual Looping**: You could implement manual loops to find or test elements in the array. This approach would give more control over the loop iterations but might be less readable and performant than using built-in methods.
*   **Benchmarked Libraries**: If you want to explore the performance impact of specific libraries, you could create benchmarks for popular JavaScript libraries that implement array methods, such as Lodash or Underscore.js.

random Some vs Find (version: 0) Benchmark.js

Comparing performance of: `Find vs Some`

Created: 2 years ago by: Guest

Go to the latest result

Find

Some

Historical Performance Data aggregated from 6 community runs

Desktop Results:

Chrome 6 runs

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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

random Some vs Find (version: 0) Benchmark.js

Comparing performance of: Find vs Some

Created: 2 years ago by: Guest

Go to the latest result

Find

Some

Historical Performance Data aggregated from 6 community runs

Desktop Results:

Chrome 6 runs

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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

Related benchmarks

Comparing performance of: `Find vs Some`