Benchmark: Unique lodash vs vanilla

HTML Preparation code:

<script src='https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.5/lodash.min.js'></script>

Script Preparation code:

var arr = Array.from({length: 10000}, () => Math.floor(Math.random() * 10000));

Tests:

vanilla
[...new Set(arr)]
lodash
_.uniq(arr)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
vanilla
lodash

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated 27 days ago):

LLMs can make mistakes. Check important info.

I'd be happy to help explain the JavaScript microbenchmark on MeasureThat.net.

**What is being tested?**

The provided benchmark tests two approaches for removing duplicates from an array: using vanilla JavaScript (without any external libraries) and using Lodash, a popular JavaScript utility library.

**Options compared**

The two options being compared are:

1. **Vanilla JavaScript**: This approach uses the built-in `Set` data structure and the spread operator (`[...new Set(arr)]`) to remove duplicates from the array.
2. **Lodash**: This approach uses the `uniq` function from Lodash, which is a utility function that takes an array as input and returns a new array with all duplicates removed.

**Pros and Cons of each approach**

**Vanilla JavaScript:**

Pros:

* Lightweight and doesn't require any external libraries
* Easy to understand and implement

Cons:

* May be slower than using Lodash due to the overhead of creating a `Set` object and converting it back to an array
* May not work correctly for certain edge cases, such as arrays containing NaN or Infinity values

**Lodash:**

Pros:

* Faster performance compared to vanilla JavaScript due to optimized implementation in Lodash
* Handles more edge cases, such as arrays containing NaN or Infinity values, out of the box

Cons:

* Requires an external library to be included (in this case, Lodash v4.17.5)
* May have a slightly larger overhead compared to vanilla JavaScript

**Library used**

In this benchmark, Lodash is used for its `uniq` function, which removes duplicates from an array. Lodash is a popular utility library that provides various functions for tasks such as string manipulation, number formatting, and data transformation.

**Other considerations**

* The benchmark uses a random array of 10,000 elements to test the performance of both approaches.
* The browser used for running the benchmarks is Chrome 102 on a Windows Desktop platform.
* The benchmark measures the executions per second (FPS) for each approach, which provides an indication of performance.

**Other alternatives**

If you're interested in exploring alternative approaches to removing duplicates from an array, here are some other options:

* Using `Array.prototype.filter()` and creating a set: `[...new Set(arr)].filter(x => arr.includes(x))`
* Using `Array.prototype.map()` and `Set`: `arr.reduce((set, x) => { if (!set.has(x)) set.add(x); return set; }, new Set())`
* Using a library like Fastify or Bun.js with their built-in data transformation utilities

These alternatives may offer different trade-offs in terms of performance, readability, and complexity.

Latest run results:

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

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

Browser/OS: Chrome 102 on Windows

View result in a separate tab

Test name	Executions per second
vanilla	4694.1 Ops/sec
lodash	4283.6 Ops/sec

Related benchmarks:

Unique lodash vs vanilla (version: 0)

Comparing performance of: vanilla vs lodash

Created: 2 years ago by: Guest

Jump to the latest result

vanilla

lodash

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated 27 days ago):