如果我理解这个问题,你想要Cartesian Product只n组小狗.
如果在编译时知道有多少集合,就很容易得到笛卡尔积:
from p1 in dog1.Puppies
from p2 in dog2.Puppies
from p3 in dog3.Puppies
select new {p1, p2, p3};
假设dog1有小狗p11,p12,dog2有小狗p21,dog3有小狗p31,p32.这给你
{p11, p21, p31},
{p11, p21, p32},
{p12, p21, p31},
{p12, p21, p32}
其中每一行都是匿名类型.如果在编译时不知道有多少个集合,可以稍微多做一些工作.见我关于这个主题的文章:
http://ericlippert.com/2010/06/28/computing-a-cartesian-product-with-linq/
还有这个问题:
Generating all Possible Combinations
一旦你有了方法CartesianProduct<T>
,你就可以说
CartesianProduct(from dog in person.Dogs select dog.Puppies)
得到
{p11, p21, p31},
{p11, p21, p32},
{p12, p21, p31},
{p12, p21, p32}
每一排都是一系列的小狗.
有道理?