Generating all combinations

[Steven D'Aprano]

On Mon, 01 Jun 2009 17:24:49 -0700, Mensanator wrote:

> On Jun 1, 6:40 pm, Steven D'Aprano <st... at REMOVE-THIS-
> cybersource.com.au> wrote:
>> On Mon, 01 Jun 2009 11:23:35 -0700, Mensanator wrote:
>> > I believe the name you're looking for is
>> > combinations_with_replacement. It is one of the features being added
>> > to 3.1 which should give all the subsets of the Cartesian Product:
>>
>> > permutations_with_replacement:    product()
>> > combinations_with_replacement:    combinations_with_replacement()
>> > permutations_without_replacement: permutations()
>> > combinations_without_replacement: combinations()
>>
>> What, no partitions?
> 
> Itertools does partitions?

Er, no. That's why I asked "What, no partitions?" instead of saying 
"Look, itertools also does partitions!"


>> http://en.wikipedia.org/wiki/Partition_of_a_set
> 
> I didn't see any reference to Cartesian Product there.

Wikipedia is the encyclopedia anyone can edit. Go right ahead and put it 
in if you think it needs to be there. While you're at it, there is no 
mention of Cartesian Product in any of

http://en.wikipedia.org/wiki/Permutations
http://en.wikipedia.org/wiki/Combinations

http://mathworld.wolfram.com/Permutation.html
http://mathworld.wolfram.com/k-Subset.html

either. Are you sure that permutations and combinations are subsets of 
the Cartesian Product?



-- 
Steven