Benchmark: lodash uniq vs set with iterator

HTML Preparation code:


<script src='https://cdn.jsdelivr.net/npm/lodash@4.17.10/lodash.min.js'></script>

Tests:

Set
var l = [...new Set([1, 2, 3, 4, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7])]; return l;
Array
var l = [1, 2, 3, 4, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]; return _.uniq(l);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Set
Array

Fastest: N/A

Slowest: N/A

Latest run results:

No previous run results

This benchmark does not have any results yet. Be the first one to run it!

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

LLMs can make mistakes. Check important info.

Let's break down the provided JSON data and explain what's being tested, compared, and considered in the benchmark.

**Benchmark Overview**

The benchmark compares two approaches to remove duplicates from an array: using the built-in `Set` object (also known as the "Set" approach) and using the `_uniq` function from the Lodash library (also known as the "Array" approach).

**What is being tested?**

In this benchmark, we're testing:

1. The execution speed of removing duplicates from an array using two different methods:
	* `Set`: Using the built-in `Set` object to remove duplicates.
	* `_uniq`: A function from Lodash that removes duplicates from an array.
2. The performance difference between these two approaches.

**Options compared**

The benchmark compares two options:

1. **Set**: This approach uses the built-in `Set` object to remove duplicates. In JavaScript, a `Set` is a collection of unique values. When we create a new `Set` from an array and then convert it back to an array using `Array.from()`, duplicates are automatically removed.
2. **_uniq**: This approach uses the `_uniq` function from Lodash, which removes duplicates from an array.

**Pros and Cons**

Here's a brief summary of the pros and cons of each approach:

**Set:**

Pros:

* Native JavaScript implementation, likely to be faster and more efficient.
* Eliminates the need for an external library.

Cons:

* May not work well with certain data types or edge cases (e.g., NaNs or Infinity values).

**_uniq**:

Pros:

* Well-documented and widely used in the JavaScript community.
* Handles a broader range of data types and edge cases.

Cons:

* External dependency on Lodash, which may introduce additional overhead.

**Library usage**

The `_uniq` function is part of the Lodash library. In this benchmark, we're using Lodash to compare its performance with the built-in `Set` approach.

**Special JS feature or syntax**

There's no special JavaScript feature or syntax being used in this benchmark. The test code simply uses standard JavaScript syntax and built-in features (e.g., `Set`, arrays).

**Other alternatives**

If you want to explore alternative approaches, here are a few options:

1. **Using `Array.prototype.filter()`**: This approach would involve filtering the array using `filter()`, which is another native JavaScript method.
2. **Using a custom implementation with a loop**: You could write a simple custom function using a loop to remove duplicates from an array. However, this approach is likely to be slower and less efficient than using built-in methods or libraries.

I hope this explanation helps!

Related benchmarks:

lodash uniq vs set with iterator (version: 0)

Comparing performance of: Set vs Array

Created: 3 years ago by: Guest

Jump to the latest result

Set

Array

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

No previous run results

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