Benchmark: Create an array with unique values - Javascript Array.reduce/Array.indexOf vs Lodash Uniq vs custom fn vs custom2

Script Preparation code:

var itemsCount = 1e2;
var items = Array.from({ length: itemsCount }, () => Math.floor(Math.random() * itemsCount));

Tests:

Javascript Array.reduce/Array.indexOf
items.reduce((list, item) => list.indexOf(item) > -1 ? list : [...list, item], []);
object literal/res.push(arr[i]);
function unique(arr) { var hash = {}, result = []; for ( var i = 0, l = arr.length; i < l; ++i ) { if ( !hash.hasOwnProperty(arr[i]) ) { hash[ arr[i] ] = true; result.push(arr[i]); } } return result; } unique(items)
object literal/res.length
function unique(arr) { var hash = {}, result = []; for ( var i = 0, l = arr.length; i < l; ++i ) { if ( !hash.hasOwnProperty(arr[i]) ) { hash[ arr[i] ] = true; result[result.length] = arr[i]; } } return result; } unique(items)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Javascript Array.reduce/Array.indexOf
object literal/res.push(arr[i]);
object literal/res.length

Fastest: N/A

Slowest: N/A

Latest run results:

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

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/102.0.5005.115 Safari/537.36

Browser/OS: Chrome 102 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
Javascript Array.reduce/Array.indexOf	59695.1 Ops/sec
object literal/res.push(arr[i]);	371876.7 Ops/sec
object literal/res.length	370664.2 Ops/sec

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

LLMs can make mistakes. Check important info.

Let's break down the provided benchmark definition and test cases.

**Benchmark Definition**

The benchmark is designed to compare three approaches for creating an array with unique values:

1. `Array.prototype.reduce()`: This method reduces an array by applying a function to each element, returning the first value that satisfies the condition.
2. `Lodash Uniq` (a library): Lodash Uniq is a utility function from the Lodash library that removes duplicate elements from an array.
3. A custom implementation using an object literal and the `res.push()` method.
4. Another custom implementation using an object literal, but with a different approach (`result[result.length] = arr[i];`).

**Options Compared**

The benchmark compares these four approaches:

* **Pros and Cons**
	+ `Array.prototype.reduce()`: This approach is concise and efficient for creating an array of unique values. However, it may not be suitable for very large arrays due to performance overhead.
	+ Lodash Uniq: This library provides a simple and reliable way to remove duplicates from an array. However, it may have a slight performance impact due to the additional function call.
	+ Custom implementation with `res.push()`: This approach is straightforward but may lead to slower performance compared to other methods due to repeated `push()` calls.
	+ Custom implementation with `result.length`: This approach is similar to the previous one but uses indexing instead of `push()`. It might have a slight performance advantage, but it's still not as efficient as `reduce()`.
* **Other Considerations**
	+ The benchmark measures the execution time per second (`ExecutionsPerSecond`), which indicates how many times each approach can be executed in 1 second.
	+ The results may vary depending on the size of the input array and the specific JavaScript engine used by the browser.

**Libraries and Special JS Features**

* Lodash Uniq: This is a utility function from the Lodash library, which provides various utility functions for working with arrays, objects, and other data structures.
* No special JS features are mentioned in the benchmark definition.

**Alternatives**

Other approaches to creating an array of unique values might include:

* Using `Set` or `Map` data structures, which provide built-in functionality for removing duplicates.
* Utilizing a sorting approach followed by an array filter method.
* Implementing a custom solution using a hash table or other data structure.

However, these alternatives are not explicitly tested in this benchmark definition.

Related benchmarks:

Create an array with unique values - Javascript Array.reduce/Array.indexOf vs Lodash Uniq vs custom fn vs custom2 (version: 0)

Comparing performance of: Javascript Array.reduce/Array.indexOf vs object literal/res.push(arr[i]); vs object literal/res.length

Created: 2 years ago by: Guest

Jump to the latest result

Javascript Array.reduce/Array.indexOf

object literal/res.push(arr[i]);

object literal/res.length

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):