Benchmark: slice v splice chunking

Script Preparation code:

var input = [];
var size = 3;
for (var i = 0; i < 100 * 100; i++) {
  input.push(i);
}

Tests:

slice
const fromRight = false; const result = []; let index = fromRight ? input.length % size : 0; if (index !== 0) { result.push(input.slice(0, index)); } while (index < input.length) { result.push(input.slice(index, size + index)); index += size; }
slice right
const fromRight = true; const result = []; let index = fromRight ? input.length % size : 0; if (index !== 0) { result.push(input.slice(0, index)); } while (index < input.length) { result.push(input.slice(index, size + index)); index += size; }
splice
const fromRight = false; const source = [...input]; const result = []; if (fromRight) { result.push(source.splice(0, source.length % size)); } while (input.length > 0) { result.push(input.splice(0, size)); }
splice right
const fromRight = true; const source = [...input]; const result = []; if (fromRight) { result.push(source.splice(0, source.length % size)); } while (input.length > 0) { result.push(input.splice(0, size)); }
splice slice
const fromRight = false; const source = input.slice(); const result = []; if (fromRight) { result.push(source.splice(0, source.length % size)); } while (input.length > 0) { result.push(input.splice(0, size)); }

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
slice
slice right
splice
splice right
splice slice

Fastest: N/A

Slowest: N/A

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

LLMs can make mistakes. Check important info.

Let's dive into the world of JavaScript microbenchmarks.

**Benchmark Definition**

The provided benchmark definition is for creating and manipulating an array of 100,000 elements. The goal is to compare the performance of different approaches to chunking and splicing the array.

**Options Compared**

There are four main options compared in this benchmark:

1. **splice**: This approach uses `splice` method to remove elements from the beginning of the array.
2. **slice right**: This approach uses `splice` method with a negative start index to remove elements from the end of the array, and then uses `slice` method to get a chunk of elements from the beginning of the array.
3. **splice slice**: This approach creates a copy of the entire array using `slice` method, and then uses `splice` method to remove elements from the beginning of the copied array.
4. **slice right**: This approach uses `slice` method with a negative start index to get a chunk of elements from the end of the original array.

**Pros and Cons**

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

* **splice**:
	+ Pros: Simple and efficient, as it only requires a single call to `splice`.
	+ Cons: Can be slow if the array is large, as it involves shifting all remaining elements.
* **slice right**:
	+ Pros: Can take advantage of optimized `splice` implementation for arrays with many elements at the beginning.
	+ Cons: Requires more calls to `splice` and `slice`, which can be slower than a single call to `splice`.
* **splice slice**:
	+ Pros: Avoids the need for repeated calls to `splice`, but creates an unnecessary copy of the array.
	+ Cons: Can be slower due to the creation of the copied array, even if it's only used once.

**Library Usage**

The benchmark uses a few libraries and features:

* **Array.prototype.slice**: Used in all options to get chunks of elements from the array.
* **Array.prototype.splice**: Used in all options to remove elements from the beginning of the array.
* **Spread operator (...)**: Used in some options to create a copy of the original array.

**Special JS Features**

There are no special JS features or syntax used in this benchmark. All code is standard JavaScript, using only the built-in `Array` prototype methods and operators.

**Other Alternatives**

If you're interested in exploring alternative approaches, here are a few options:

* **Using `map()`**: Instead of using `splice`, you could use `map()` to create a new array with chunked elements.
* **Using a custom implementation**: You could implement your own optimized algorithm for chunking and splicing arrays, tailored to your specific use case.
* **Using a specialized library**: There are libraries available that specialize in array manipulation and may offer optimized implementations of these operations.

Keep in mind that the choice of approach will depend on your specific requirements, performance needs, and personal preference.

Latest run results:

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

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/90.0.4430.212 Safari/537.36

Browser/OS: Chrome 90 on Mac OS X 10.15.6

View result in a separate tab

Test name	Executions per second
slice	997.8 Ops/sec
slice right	1002.7 Ops/sec
splice	6618081.5 Ops/sec
splice right	3535790.0 Ops/sec
splice slice	7358031.0 Ops/sec

Related benchmarks:

slice v splice chunking (version: 0)

100k list splice and shift win, they mutate list slice loose, it creates a copy of list 7.5x slower

Comparing performance of: slice vs slice right vs splice vs splice right vs splice slice

Created: 3 years ago by: Guest

Jump to the latest result

slice

slice right

splice

splice right

splice slice

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

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