Benchmark: lodash uniq vs [...new Set]

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

Historical Performance Data aggregated from 53 community runs

Desktop Results:

Chrome 43 runs

Array

25.1M/s

Set

8.3M/s

Fastest: Array (3.0x faster)

View exact numbers

✓ Array: 25,057,082 ops/sec
• Set: 8,294,968 ops/sec

Firefox 10 runs

Array

8.7M/s

Set

3.6M/s

Fastest: Array (2.4x faster)

View exact numbers

✓ Array: 8,714,846 ops/sec
• Set: 3,600,444 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
Set
Array

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: 8 days ago)

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

Browser/OS: Chrome 154 on Mac OS X 10.15.7

View result in a separate tab

Array

19.1M/s

Set

7.4M/s

View exact numbers

Test name	Executions per second
✓ Array	19,143,022 Ops/sec
Set	7,388,538 Ops/sec

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

LLMs can make mistakes. Check important info.

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

**Benchmark Overview**

The benchmark compares two approaches to remove duplicates from an array: using a `Set` object and using Lodash's `uniq()` function.

**Options Compared**

There are two options being compared:

1. **Using a Set Object**: This approach uses the built-in `Set` object in JavaScript, which automatically removes duplicates by only storing unique values.
2. **Using Lodash's uniq() Function**: This approach uses the `uniq()` function from the Lodash library, which also removes duplicates from an array.

**Pros and Cons**

**Using a Set Object:**

Pros:

* Fast and efficient, as it leverages the optimized implementation of the `Set` object.
* Simple to implement and understand.
* Eliminates duplicates in a single pass through the data.

Cons:

* May not work as expected if the input array contains non-numeric or non-string values that can be hashed (e.g., objects, functions).
* Does not preserve the original order of elements.

**Using Lodash's uniq() Function:**

Pros:

* Preserves the original order of elements.
* Works with any type of data that can be compared using the `===` operator.
* Can handle edge cases like NaN and undefined values.

Cons:

* Slower than using a `Set` object, as it iterates over the array and checks for duplicates using the `===` operator.
* Requires an external library (Lodash), which may add overhead and dependencies.

**Library: Lodash**

Lodash is a popular JavaScript utility library that provides a collection of functional programming helpers. In this benchmark, the `uniq()` function is used to remove duplicates from an array. The `uniq()` function takes an optional second argument to specify the comparison function; in this case, no comparison function is provided, so it defaults to the default comparison function.

**Special JS Feature or Syntax**

There are no special JavaScript features or syntaxes being tested in this benchmark. However, it's worth noting that the use of Lodash and the `Set` object both rely on modern JavaScript features like closures and prototypal inheritance.

**Other Alternatives**

If you didn't have access to Lodash, you could implement a custom implementation for removing duplicates from an array using the following approach:

```javascript
function removeDuplicates(arr) {
  const seen = {};
  return arr.filter(x => seen[x] === undefined ? seen[x] = true : false);
}
```

This implementation uses a simple object (`seen`) to keep track of unique values and iterates over the input array using the `filter()` method.

Alternatively, you could use a more advanced algorithm like the "counting sort" or "bucket sort" approach, which can be more efficient for large datasets but are also more complex to implement.

lodash uniq vs [...new Set] (version: 0) Benchmark.js

Comparing performance of: `Set vs Array`

Created: 4 years ago by: Guest

Go to the latest result

Set

Array

Historical Performance Data aggregated from 53 community runs

Desktop Results:

Chrome 43 runs

Firefox 10 runs

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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

lodash uniq vs [...new Set] (version: 0) Benchmark.js

Comparing performance of: Set vs Array

Created: 4 years ago by: Guest

Go to the latest result

Set

Array

Historical Performance Data aggregated from 53 community runs

Desktop Results:

Chrome 43 runs

Firefox 10 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: `Set vs Array`