Run results for: npm:fast-cartesian product vs native .reduce() vs cartesian from https://stackoverflow.com/a/43053803

Run details:

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

Browser: Chrome 112

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: one year ago

Test name	Executions per second
npm:fast-cartesian	11623.7 Ops/sec
native .reduce() with flatmap, concat	1939001.0 Ops/sec
native .reduce() with map, spread	5404997.0 Ops/sec
cartesian from https://stackoverflow.com/a/43053803	944554600.0 Ops/sec

Script Preparation code:

var data = [[1,2,3,4,5,6,7,8,9,10],[1,2,3,4,5,6,7,8,9,10],[1,2,3,4,5,6,7,8,9,10],[1,2,3,4,5,6,7,8,9,10]]

Tests:

npm:fast-cartesian
// Does a cartesian product on several arrays. // Returns an array with the results. // Optimized to be the fastest implementation in JavaScript. function fastCartesian(arrays) { if (arrays.length === 0) { return [] } const loopFunc = getLoopFunc(arrays.length) const result = [] loopFunc(arrays, result) return result } const getLoopFunc = function (length) { const cachedLoopFunc = cache[length] if (cachedLoopFunc !== undefined) { return cachedLoopFunc } const loopFunc = mGetLoopFunc(length) // eslint-disable-next-line fp/no-mutation cache[length] = loopFunc return loopFunc } const cache = {} // Create a function with `new Function()` that does: // function(arrays, results) { // for (const value0 of arrays[0]) { // for (const value1 of arrays[1]) { // // and so on // results.push([value0, value1]) // } // } // } const mGetLoopFunc = function (length) { const indexes = Array.from({ length }, getIndex) const start = indexes .map((index) => `for (const value${index} of arrays[${index}]) {`) .join('\n') const middle = indexes.map((index) => `value${index}`).join(', ') const end = '}\n'.repeat(length) // eslint-disable-next-line no-new-func return new Function( 'arrays', 'result', `${start}\nresult.push([${middle}])\n${end}`, ) } const getIndex = function (value, index) { return String(index) } const product = fastCartesian(data)
native .reduce() with flatmap, concat
const cartesianProduct = (...allEntries) => allEntries.reduce( (subsetsSoFar, entries) => [ ...subsetsSoFar.flatMap((result) => entries.map((entry) => result.concat([entry]))), ], [[]] ) const product2 = cartesianProduct(data)
native .reduce() with map, spread
function cartesianProductWithSpread(...allEntries) { return allEntries.reduce( (results, entries) => results .map(result => entries.map(entry => [...result, entry] )) .reduce((subResults, result) => [...subResults, ...result] , []), [[]] ) } const product3 = cartesianProductWithSpread(data)
cartesian from https://stackoverflow.com/a/43053803
const cartesian = (...a) => { console.log(a) return a.reduce((a, b) => a.flatMap(d => { // console.log(b) return b.map(e => [d, e].flat()) }))}

Run results for: npm:fast-cartesian product vs native .reduce() vs cartesian from https://stackoverflow.com/a/43053803

npm:fast-cartesian

native .reduce() with flatmap, concat

native .reduce() with map, spread

cartesian from https://stackoverflow.com/a/43053803