Benchmark: Removing a list of elements from another list

Script Preparation code:

var lista1 =  ["red", "orange", "green",20 , 40, 57, "blue", "white", "black", "yellow", 4 ,7, 1, 9 , 45 , 78 , 95 ]
var lista2 =  [ "white", 95, "red", 78,  "blue"]

Tests:

Filter + indexOF
let myArray = lista1.filter( function( el ) { return lista2.indexOf( el ) < 0; } );
Filter + includes
let myArray = lista1.filter( function( el ) { return !lista2.includes( el ); } );
for + indexof
let novaLista = [] for (let index = 0; index < lista1.length; index++) { const elementLista1 = lista1[index]; if (lista2.indexOf( elementLista1 ) < 0) novaLista.push(elementLista1) }

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Filter + indexOF
Filter + includes
for + indexof

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's being tested in this JavaScript microbenchmark.

**Benchmark Definition:**

The benchmark is designed to measure the performance of three different approaches for removing elements from one list while keeping another list unchanged:

1. **Filter + indexOf**: Using the `filter()` method with a callback function that checks if an element exists in another list (`indexOf`) using the same list.
2. **Filter + includes**: Using the `filter()` method with a callback function that checks if an element is not included in another list (`includes`).
3. **For loop + indexOf**: Iterating through the first list and pushing elements to a new array only if they don't exist in the second list, using the same indexing check as above.

**Options Compared:**

The benchmark compares the performance of these three approaches:

* **Pros:**
	+ Filter-based methods are concise and easier to read.
	+ They are likely to be faster since `indexOf` is a built-in function that has been optimized for performance.
* **Cons:**
	+ May not work correctly if the lists contain duplicate elements or if the filtering condition is complex.
	+ Can be slower than simple loop-based approaches in certain cases (e.g., when dealing with large datasets).
* **For loop + indexOf:**
	+ Pros:
		- Allows for more control over the iteration process and can be tailored to specific use cases.
		- Can handle complex filtering conditions.
	+ Cons:
		- Requires manual indexing, which can be error-prone and verbose.
		- May not be as concise or readable as filter-based methods.

**Library Usage:**

The benchmark uses built-in JavaScript functions:

* `filter()`: A method that creates a new array with all elements that pass the test implemented by the provided function.
* `indexOf()`: A static method of the String prototype that returns the index at which the string can be found in another string, or -1 if it is not present.
* `includes()`: A static method of the Array prototype that returns a boolean value indicating whether an element with the specified value exists in the array.

**Special JavaScript Features/Syntax:**

This benchmark does not utilize any special JavaScript features or syntax beyond what's standard for 2023. The methods and libraries used are well-established and widely supported across modern browsers and environments.

**Other Alternatives:**

Some possible alternative approaches that could be tested in this benchmark include:

* Using `set` and `delete` operations to create a new set of elements from the original list, excluding those present in another list.
* Utilizing libraries like Lodash or Underscore.js, which provide additional utility functions for array manipulation and filtering.

However, as this is a microbenchmark focused on basic filtering and removal techniques, these alternative approaches may not offer significant performance improvements over the tested methods.

Related benchmarks:

Removing a list of elements from another list (version: 0)

Comparing performance of: Filter + indexOF vs Filter + includes vs for + indexof

Created: 6 years ago by: Registered User

Jump to the latest result

Filter + indexOF

Filter + includes

for + indexof

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