Benchmark: Object value comparison vs array find

Script Preparation code:

var items = Array.from(Array(1000), (_, x) => ({
    key: x,
    value1: Math.random() * 1000,
    value2: Math.random() * 1000
}));

var objContainer = {};
var arrContainer = [];

for (let i = 100; i >= 0; i--) {
    const index = Math.floor(Math.random() * 1000);
    const item = items[index];
    objContainer[item.key] = item;
    arrContainer.push(item)
}

Tests:

Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Object
var result = []; for (var k in objContainer) { if (objContainer[k].value1 >= 0 && objContainer[k].value1 <= 499 && objContainer[k].value2 >= 500 && objContainer[k].value2 <= 999) { result.push(k); } }
Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Array
var result = []; for (var item of arrContainer) { if (item.value1 >= 0 && item.value1 <= 499 && item.value2 >= 500 && item.value2 <= 999) { result.push(item.key); } }

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Object
Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Array

Fastest: N/A

Slowest: N/A

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

LLMs can make mistakes. Check important info.

Let's dive into the world of JavaScript microbenchmarks!

The provided JSON represents a benchmark test case created on MeasureThat.net. The goal is to compare the performance of two approaches: object value comparison vs array find.

**Options being compared:**

1. **Object Value Comparison**: This approach uses a traditional `for...in` loop to iterate over the keys of an object and checks if the values satisfy the specified condition.
2. **Array Find**: This approach uses the built-in `find()` method on an array to find elements that satisfy the specified condition.

**Pros and Cons:**

* **Object Value Comparison**:
	+ Pros: Easy to understand, straightforward implementation.
	+ Cons: Can be slow for large objects due to the overhead of iterating over all keys.
* **Array Find**:
	+ Pros: Fast and efficient for large arrays, as it uses a optimized algorithm under the hood.
	+ Cons: May have additional overhead due to function calls, and may not be suitable for small arrays.

**Other considerations:**

* The benchmark creates a large dataset of 1000 objects with random values, which can impact performance.
* The condition specified in the `Benchmark Definition` is quite specific (value 1 between 0 and 499, value 2 between 500 and 999), which may not be representative of real-world scenarios.

**Library/Language features:**

The benchmark uses no external libraries or language features that are not part of the standard JavaScript specification. It relies on built-in methods like `Array.from()`, `for...in`, and `find()`.

**Special JS feature/syntax:**

There are no special JS features or syntax used in this benchmark. The code is written in plain JavaScript, using standard constructs and data structures.

Now, let's look at the latest benchmark results:

The two test cases show a significant performance difference between object value comparison and array find. The `Object` test case executes approximately 242k times per second on Mobile Safari 15, while the `Array` test case executes around 30k times per second. This suggests that array find is significantly faster for this particular use case.

Other alternatives to these approaches include:

* Using a library like Lodash or Ramda to implement the same logic in a more concise and efficient way.
* Using a different data structure, such as a Map or a Set, to improve performance.
* Optimizing the condition specified in the `Benchmark Definition` to reduce the number of iterations.

Keep in mind that microbenchmarking is an art, and results may vary depending on specific use cases and environments.

Latest run results:

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

User agent: Mozilla/5.0 (iPhone; CPU iPhone OS 15_6_1 like Mac OS X) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/15.6.1 Mobile/15E148 Safari/604.1

Browser/OS: Mobile Safari 15 on iOS 15.6.1

View result in a separate tab

Test name	Executions per second
Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Object	30161.8 Ops/sec
Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Array	2424853.0 Ops/sec

Related benchmarks:

Object value comparison vs array find (version: 0)

Test speed of object value comparison vs array find to compare

Comparing performance of: Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Object vs Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Array

Created: one year ago by: Guest

Jump to the latest result

Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Object

Get array of keys with value 1 between 0 and 499, and value 2 between 500 and 999 in Array

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

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