Benchmark: lodash uniq vs set for object members

HTML Preparation code:


<script src='https://cdn.jsdelivr.net/npm/lodash@4.17.10/lodash.min.js'></script>

Tests:

Set
var l = new Set([ { a: 3, b: 2 }, { a: 3, b: 3 }, { a: 3, b: 0 }, { a: 3, b: 2 }, { a: 2, b: 2 }, { a: 2, b: 1 }, { a: 5, b: 5 }, { a: 0, b: 2 }, { a: 1, b: 2 }, { a: 3, b: 3 }, { a: 4, b: 3 }, { a: 3, b: 3 }, { a: 2, b: 4 }, { a: 5, b: 1 }, { a: 4, b: 2 } ]); return l;
Array
var l = [ { a: 3, b: 2 }, { a: 3, b: 3 }, { a: 3, b: 0 }, { a: 3, b: 2 }, { a: 2, b: 2 }, { a: 2, b: 1 }, { a: 5, b: 5 }, { a: 0, b: 2 }, { a: 1, b: 2 }, { a: 3, b: 3 }, { a: 4, b: 3 }, { a: 3, b: 3 }, { a: 2, b: 4 }, { a: 5, b: 1 }, { a: 4, b: 2 } ]; return _.uniqWith(l, _.isEqual);

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:

No previous run results

This benchmark does not have any results yet. Be the first one to run it!

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

LLMs can make mistakes. Check important info.

Let's break down what is tested on the provided JSON.

**Benchmark Definition**

The benchmark tests two approaches to remove duplicate object members:

1. **Set**: The test creates an instance of the `Set` data structure, which is a collection of unique values. It populates the set with multiple objects, each containing several properties (e.g., `a`, `b`). The goal is to determine how efficient the `Set` implementation is when removing duplicates.
2. **Array**: The test creates an array of object literals and uses the `_.uniqWith` function from Lodash to remove duplicate members. The `_.uniqWith` function takes a custom comparator function (`_.isEqual`) that checks for deep equality between objects.

**Options Compared**

The two options compared are:

1. **Set**: A built-in JavaScript data structure designed for efficient membership testing and set operations.
2. **Array with Lodash's _.uniqWith**: An approach using an array and a third-party library (Lodash) to remove duplicates. The custom comparator function (`_.isEqual`) ensures that only identical objects are considered as duplicates.

**Pros and Cons**

Here's a brief summary of the pros and cons for each approach:

1. **Set**
	* Pros:
		+ Built-in data structure, so it's likely well-optimized and tested.
		+ Suitable for membership testing and set operations.
	* Cons:
		+ May not be as efficient for larger datasets due to the overhead of set creation and iteration.
2. **Array with Lodash's _.uniqWith**
	* Pros:
		+ Can handle complex objects with nested properties.
		+ Custom comparator function allows for flexible duplicate detection.
	* Cons:
		+ Requires an additional library (Lodash), which may introduce dependencies and overhead.
		+ May be slower than a built-in data structure like `Set` due to the array iteration.

**Library: Lodash**

Lodash is a popular JavaScript utility library that provides various functions for tasks such as string manipulation, object transformation, and collection manipulation. In this benchmark, the `_uniqWith` function from Lodash is used with a custom comparator function (`_.isEqual`) to remove duplicates from an array of objects.

**Special JS Features/Syntax**

This benchmark does not explicitly use any special JavaScript features or syntax that requires explanation.

**Other Alternatives**

If you need to remove duplicates from arrays, other alternatives include:

1. **Using the `some()` and `indexOf()` methods**: You can iterate through the array using `some()` and check if an object already exists in the array using `indexOf()`.
2. **Using a library like moment.js for date formatting**: While not directly related to removing duplicates, moment.js is often used for date manipulation and may be used in conjunction with other libraries for data processing.
3. **Implementing a custom duplicate detection algorithm**: Depending on your specific requirements, you can write a custom algorithm to detect and remove duplicates from an array or object.

These alternatives are not directly comparable to the Set and Array approaches tested in this benchmark, but they demonstrate other ways to achieve similar results.

Related benchmarks:

lodash uniq vs set for object members (version: 0)

Comparing performance of: Set vs Array

Created: 6 years ago by: Guest

Jump to the latest result

Set

Array

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

No previous run results

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