Benchmark: uniq vs lodash vs 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;
lodash
var l = [1, 2, 3, 4, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]; return _.uniq(l);
uniq
function uniq(items) { const result = []; for (let i = 0; i < items.length; i++) { const item = items[i] if (result.includes(item)) continue; result.push(item) } return result; } 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 5 community runs

Desktop Results:

Chrome 5 runs

uniq

10.3M/s

lodash

8.9M/s

set

5.5M/s

Fastest: uniq (1.9x faster)

View exact numbers

✓ uniq: 10,340,687 ops/sec
• lodash: 8,891,711 ops/sec
• set: 5,543,346 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
lodash
uniq

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/126.0.0.0 Safari/537.36

Browser/OS: Chrome 126 on Mac OS X 10.15.7

View result in a separate tab

uniq

7.9M/s

lodash

7.0M/s

set

4.2M/s

View exact numbers

Test name	Executions per second
✓ uniq	7,933,398 Ops/sec
lodash	6,953,493 Ops/sec
set	4,225,498 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 provided JSON and explain what's being tested, compared, and their pros and cons.

**Benchmark Overview**

The benchmark is comparing three approaches to remove duplicates from an array: `Set`, `Lodash` (`_.uniq`), and a custom implementation (`uniq`). The goal is to determine which approach is the fastest.

**What's being tested?**

*   `Set`: A built-in JavaScript object that stores unique values. When you try to add a duplicate value, it simply ignores it.
*   `Lodash` (`_.uniq`): A popular JavaScript library that provides various utility functions. The `_uniq` function takes an array as input and returns a new array with duplicates removed.
*   Custom implementation (`uniq`): A simple recursive function that checks for duplicates in the input array.

**Options Compared**

The benchmark is comparing three options:

1.  `Set`: Using the built-in JavaScript object to remove duplicates.
2.  `Lodash` (`_.uniq`): Leveraging a popular JavaScript library for duplicate removal.
3.  Custom implementation (`uniq`): Implementing a custom solution using a simple recursive function.

**Pros and Cons of Each Approach**

*   **Set**: Pros: Efficient, easy to use, and built-in to JavaScript. Cons: Not designed specifically for array processing, may not be suitable for large datasets or complex data structures.
*   **Lodash` (`_.uniq`): Pros: Well-maintained library with a wide range of utility functions, highly optimized for performance. Cons: Requires an additional import and introduces external dependencies, which might be overhead for some users.
*   **Custom implementation (`uniq`)**: Pros: Lightweight, easy to understand, and doesn't require any additional imports or libraries. Cons: May not be as efficient as the other two options, especially for large datasets.

**Library Used**

The benchmark uses `Lodash`, version 4.17.10, which is a popular JavaScript library providing various utility functions.

**Special JS Features/Syntax**

None are explicitly mentioned in the provided JSON data. However, if you're interested in exploring more advanced JavaScript features or syntax, you can explore other benchmarks on MeasureThat.net that might cover those topics.

**Alternatives**

If you'd like to explore alternative approaches for removing duplicates from an array, consider these options:

1.  Using `Array.prototype.filter()` and a callback function: This approach iterates over the array, checking each element against every other element.
2.  Using `Array.prototype.reduce()`: This approach accumulates a new array with unique elements by applying a reduce operation to the original array.
3.  Utilizing modern JavaScript features like `Map` or `Set` for more efficient data structures.

For a deeper dive into these alternatives, you can search for more benchmark results on MeasureThat.net or explore online resources and documentation for each of these approaches.

If you have any further questions about this benchmark or would like to explore other JavaScript benchmarks, feel free to ask.

uniq vs lodash vs set (version: 0)

Comparing performance of: `set vs lodash vs uniq`

Created: 2 years ago by: Guest

Go to the latest result

set

lodash

uniq

Historical Performance Data aggregated from 5 community runs

Desktop Results:

Chrome 5 runs

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

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

uniq vs lodash vs set (version: 0)

Comparing performance of: set vs lodash vs uniq

Created: 2 years ago by: Guest

Go to the latest result

set

lodash

uniq

Historical Performance Data aggregated from 5 community runs

Desktop Results:

Chrome 5 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 lodash vs uniq`