Benchmark: lodash uniq vs set my

HTML Preparation code:


<script src='https://cdn.jsdelivr.net/npm/lodash@4.17.21/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:

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

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/126.0.0.0 Safari/537.36 Edg/126.0.0.0

Browser/OS: Chrome 126 on Windows

View result in a separate tab

Test name	Executions per second
Set	3994383.2 Ops/sec
Array	6535415.5 Ops/sec

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

LLMs can make mistakes. Check important info.

Measuring JavaScript performance is crucial for creating efficient and scalable applications.

**What is being tested?**

The provided benchmark tests the performance of two approaches to remove duplicates from an array: using a `Set` object and using Lodash's `uniq` function. A `Set` is a data structure that stores unique values, and when we convert an array to a set, it automatically removes any duplicate elements.

**Options being compared**

The two options being compared are:

1. **Using a Set object**: This approach involves converting the input array to a set using the `Array.prototype.set()` method or by creating a new set instance with the array values.
2. **Using Lodash's uniq function**: This approach uses the popular utility library Lodash, which provides a robust set of functions for working with arrays and other data structures.

**Pros and Cons**

### Using a Set object:

Pros:

* Efficient use of memory, as sets only store unique values
* Simple to implement, as it leverages the built-in `Set` object

Cons:

* May not be as efficient as Lodash's implementation for very large arrays (due to the overhead of creating and manipulating set instances)
* May not work correctly if the input array contains non-numeric values that can't be used as keys in a set

### Using Lodash's uniq function:

Pros:

* Efficient performance, optimized for large datasets
* Robust error handling and edge cases handling

Cons:

* Requires including an external library (Lodash), which may add overhead or dependencies
* May have slightly higher memory usage compared to the Set approach

**Library: Lodash**

Lodash is a popular JavaScript utility library that provides a wide range of functions for working with arrays, objects, numbers, and more. The `uniq` function is one of its many contributions to the world of array manipulation.

**Special JS feature or syntax**

There are no special features or syntax in this benchmarking scenario. Both approaches use standard JavaScript features (sets and array methods).

**Other alternatives**

If you need alternative approaches for removing duplicates from an array, consider:

* Using `Array.prototype.filter()` with a callback function to create a new array with unique elements
* Implementing your own custom algorithm using bitwise operations or other techniques

Keep in mind that these alternatives may have varying performance characteristics and memory usage compared to the Set and Lodash approaches.

The provided benchmarking results show Chrome 126 running approximately 2.5 times faster for the `Set` approach compared to the Lodash `uniq` function, on a Windows desktop with an array of 16 elements containing duplicates.

Related benchmarks:

lodash uniq vs set my (version: 0)

Comparing performance of: Set vs Array

Created: one year ago by: Guest

Jump to the latest result

Set

Array

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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