numpy permutations with replacement

[skorpio11 at gmail.com]

I am trying to generate all possible permutations of length three from
elements of [0,1]. i.e in this scenario there are a total of 8
distinct permutations:

[0,0,0]
[0,0,1]
[0,1,0]
    .
    .
    .
[1,1,1]


Does numpy define a function to achieve this ?

Thanks in advance