cartesian-product

I'm bad at math but I kind get idea what cartesian product is. Here is my situation (simplified): public class Project{ public IList<Partner> Partners{get;set;} } public class Partner{ public IList<PartnerCosts> Costs{get;set;} public IList<Address> Addresses{get;set;} } public class PartnerCosts{ public Money Total{get;set;} } public class Money{ public decimal Amount{get;set;} public int CurrencyCode{get;set;} } public class Address{ public string Street{get;set;} } My aim is to effectively load entire Project. Problem of course is: If I try to eager load partners and their costs, query

I wish to produce the Cartesian product of 2 lists in Haskell, but I cannot work out how to do it. The cartesian product gives all combinations of the list elements: xs = [1,2,3] ys = [4,5,6] cartProd :: [a] -> [b] -> [(a,b)] cartProd xs ys ==> [(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6)] This is not an actual homework question and is not related to any such question, but the way in which this problem is solved may help with one I am stuck on. This is very easy with list comprehensions. To get the cartesian product of the lists xs and ys , we just need to take the tuple (x,y) for

I've a vector of vectors say vector<vector<int> > items of different sizes like as follows 1,2,3 4,5 6,7,8 I want to create combinations in terms of Cartesian product of these vectors like 1,4,6 1,4,7 1,4,8 and so on till 3,5,8 How can I do that ? I've looked up several links and I've also listed them at the end of this post but I'm not able to interpret that as I'm not that familiar with the language. Could some body help me with this. #include <iostream> #include <iomanip> #include <vector> using namespace std; int main() { vector<vector<int> > items; int k = 0; for ( int i = 0; i < 5; i++ )