JS Permutations

/**
* Retrieve an array of all possible unique orders based on the multiplier count
* provided in the parameter
*
* @param multiplier the amount of variants for each combinations (exponent power)
* @param combo0 first element to act as 0 (binary)
* @param combo1 second element to act as 2 (binary)
*
* @return array the combinations
*/
function binaryCombos ( multiplier = 2, combo0 = '0', combo1 = '1' ) {
var combos = [];
var exponent = 2;
for ( var i = 0; i < Math.pow( exponent, multiplier ); i++ ) {
var variants = [];
for ( var x = 0; x < multiplier; x++ ) {
// Shift bit then 'and it' with 1
if ( ( i >> x ) & 1 ) {
variants.push( 1 );
} else {
variants.push( 0 );
}
}
combos.push( variants );
}
return combos;
}
var combos = binaryCombos( 3 );
/**
* Output each combo
*
* EXMAPLE OUTPUT: 0,0,0 debugger eval code:38:5
* 1,0,0 debugger eval code:38:5
* 0,1,0 debugger eval code:38:5
* 1,1,0 debugger eval code:38:5
* 0,0,1 debugger eval code:38:5
* 1,0,1 debugger eval code:38:5
* 0,1,1 debugger eval code:38:5
* 1,1,1 debugger eval code:38:5
*/
for ( var i = 0; i < combos.length; i++ ) {
console.log( combos[ i ].join( ',' ) );
}