Function for generating binary combinations

gistfile1.js

//Returns an array of boolean values representing
//every possible combination of n binary digits
function binaryCombos(n){
    var result = [];
    for(y=0; y<Math.pow(2,n); y++){
        var combo = [];
        for(x=0; x<n; x++){
            //shift bit and and it with 1
            if((y >> x) & 1)
                combo.push(true);
             else 
                combo.push(false);
        }
        result.push(combo);
    }
    return result;
}

//Usage
combos = binaryCombos(3);

for(x=0; x<combos.length; x++){
    console.log(combos[x].join(','));
}

//OUTPUT
//false,false,false
//true,false,false
//false,true,false
//true,true,false
//false,false,true
//true,false,true
//false,true,true
//true,true,true