Benchmark: lodash uniq vs set updated lodash

HTML Preparation code:

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

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

LLMs can make mistakes. Check important info.

Let's dive into the world of JavaScript microbenchmarks on MeasureThat.net.

The provided JSON represents a benchmark test comparing two approaches to remove duplicate elements from an array: using a `Set` data structure and using the Lodash library's `uniq` function. The goal is to determine which approach is faster, especially when dealing with large arrays containing repeated values.

**Options compared:**

1. **Set**: Using a JavaScript `Set` object to store unique elements. A `Set` in JavaScript is an unordered collection of unique values.
2. **Lodash `uniq` function**: Using the Lodash library's `uniq` function, which removes duplicate elements from an array.

**Pros and Cons:**

1. **Set**:
	* Pros:
		+ Efficient use of memory, as it only stores unique values.
		+ Fast lookup and insertion times.
	* Cons:
		+ May be slower than Lodash's `uniq` function for very large arrays due to the overhead of creating a new set object and performing lookups.
2. **Lodash `uniq` function**:
	* Pros:
		+ Often faster than using a `Set` for very large arrays, as it leverages optimized internal algorithms.
		+ Handles array iteration internally, which can reduce memory allocation and garbage collection pauses.
	* Cons:
		+ May consume more memory due to the creation of an internal data structure (an array or a hash table).
		+ Requires additional library dependencies.

**Library:**

The Lodash library is a popular utility belt for JavaScript that provides various functions for tasks such as array manipulation, string formatting, and object traversal. The `uniq` function is one of its core utilities, designed to efficiently remove duplicate elements from arrays while preserving the original order.

**Special JS feature or syntax:**

None are mentioned in the provided benchmark JSON.

Now, let's consider other alternatives:

1. **Using a custom implementation**: You could write your own implementation for removing duplicates using an array or a `Set`. This would allow you to optimize the code specifically for your use case.
2. **Other libraries**: Depending on the specific requirements of your project, other libraries like Ramda or Immutable.js might provide optimized implementations for array deduplication.

In summary, the MeasureThat.net benchmark test compares two approaches to remove duplicates from an array: using a `Set` data structure and using Lodash's `uniq` function. The choice between these options depends on factors such as performance requirements, memory constraints, and personal preference.

Latest run results:

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

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/84.0.4147.125 Safari/537.36

Browser/OS: Chrome 84 on Linux

View result in a separate tab

Test name	Executions per second
Set	1758583.8 Ops/sec
Array	3984899.2 Ops/sec

Related benchmarks:

lodash uniq vs set updated lodash (version: 0)

Comparing performance of: Set vs Array

Created: 4 years ago by: Guest

Jump to the latest result

Set

Array

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

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