Function cartesianProduct

Computes the cartesian product of a given collection of arrays. based on (but slightly faster than) https://github.com/ehmicky/fast-cartesian without any caching

This function works by generating a string and then using the Function constructor to define a function from that string. This makes the generated function extremely efficient, both in time and memory. The generated code is also very easy to read, since it is effectively how a programmer would implement this by hand if they had a fixed number of arrays.

The generated code looks like

let count = 0;
const n0 = 2;
const n1 = 3;
for (let i0 = 0; i0 < n0; i0++) {
for (let i1 = 0; i1 < n1; i1++) {
result[count] = [arrays[0][i0], arrays[1][i1]];
count++;
}
}
Copy