Benchmark: Lodash difference vs Set & Filter2

HTML Preparation code:

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

Script Preparation code:

var arr1 = [];
for(let i = 0; i < 50; i++) {
  arr1.push(_.shuffle('asdbdanmeteumy,r.otuo,eimjcwfmfcwoi'.split('')).join(''));
}

var arr2 = [];
for(let i = 50; i >= 0; i--) {
  arr1.push(_.shuffle('asdbdanmeteumy,r.otuo,eimjcwfmfcwoi'.split('')).join(''));
}

Tests:

Lodash
const notInArr1 = _.difference(arr2, arr1) const notInArr2 = _.difference(arr1, arr2)
Set & Filter
const arr1Set = new Set(); const arr2Set = new Set(); arr1.forEach(value => arr1Set.add(value)); arr2.forEach(value => arr2Set.add(value)); const notInArr1 = arr2.filter(value => !arr1Set.has(value)); const notInArr2 = arr1.filter(value => !arr2Set.has(value));

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Lodash
Set & Filter

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 the provided benchmark and its test cases.

**Benchmark Overview**

MeasureThat.net is used to compare the performance of different approaches for finding elements not present in two arrays, `arr1` and `arr2`. The benchmark uses Lodash's `difference` function and a custom implementation using Sets and filtering with `filter`.

**Test Case 1: Lodash Difference**

The first test case compares the execution time of Lodash's `difference` function. Here's what happens:

* `_.shuffle` is used to randomize the order of elements in `arr1`.
* `_.shuffle` is also used on a predefined string, resulting in two identical shuffled arrays: `arr1` and `arr2`.
* The `difference` function is called twice:
	+ First, `difference(arr2, arr1)` finds elements present in `arr1` but not in `arr2`.
	+ Second, `difference(arr1, arr2)` finds elements present in `arr2` but not in `arr1`.

**Pros and Cons of Lodash Difference**

* Pros:
	+ Convenient and readable implementation.
	+ Part of the popular Lodash library.
* Cons:
	+ May have performance overhead due to additional function calls and array manipulations.

**Test Case 2: Set & Filter**

The second test case uses a custom implementation involving Sets and filtering:

* Two arrays, `arr1` and `arr2`, are created by shuffling the same string using `_shuffle`.
* A Set is created for each array to store unique elements.
* The `filter` function is used twice:
	+ First, it finds elements present in `arr2` but not in `arr1Set`.
	+ Second, it finds elements present in `arr1` but not in `arr2Set`.

**Pros and Cons of Set & Filter**

* Pros:
	+ Efficient use of Sets for fast lookups.
	+ No additional function calls or overhead.
* Cons:
	+ More verbose implementation.
	+ Requires understanding of Sets and filtering.

**Library: Lodash.js**

Lodash is a popular JavaScript utility library. Its `difference` function takes two arrays as input and returns an array containing elements present in the first array but not in the second.

**Other Alternatives**

For finding elements not present in two arrays, other alternatives include:

* Using `filter` with a callback function that checks for existence in one of the arrays.
* Implementing a custom solution using a data structure like a Set or a trie.
* Utilizing modern JavaScript features like `Set` and `map` methods.

Keep in mind that the performance difference between these approaches may be negligible in small-scale use cases, but can become significant when working with large datasets.

Related benchmarks:

Lodash difference vs Set & Filter2 (version: 0)

Comparing performance of: Lodash vs Set & Filter

Created: 5 years ago by: Guest

Jump to the latest result

Lodash

Set & Filter

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):