TMP: how to generalize a Cartesian Product of Vectors?

by

Simpler recursive solution. It takes vectors as function arguments, not as a tuple. This version doesn’t build temporary tuples, but uses lambdas instead. Now it makes no unnecessary copies/moves and seems to get optimized successfully.

#include<tuple>
#include<vector>

// cross_imp(f, v...) means "do `f` for each element of cartesian product of v..."
template<typename F>
inline void cross_imp(F f) {
    f();
}
template<typename F, typename H, typename... Ts>
inline void cross_imp(F f, std::vector<H> const& h,
                           std::vector<Ts> const&... t) {
    for(H const& he: h)
        cross_imp([&](Ts const&... ts){
                      f(he, ts...);
                  }, t...);
}

template<typename... Ts>
std::vector<std::tuple<Ts...>> cross(std::vector<Ts> const&... in) {
    std::vector<std::tuple<Ts...>> res;
    cross_imp([&](Ts const&... ts){
                  res.emplace_back(ts...);
              }, in...);
    return res;
}

#include<iostream>

int main() {
    std::vector<int> is = {2,5,9};
    std::vector<char const*> cps = {"foo","bar"};
    std::vector<double> ds = {1.5, 3.14, 2.71};
    auto res = cross(is, cps, ds);
    for(auto& a: res) {
        std::cout << '{' << std::get<0>(a) << ',' <<
                            std::get<1>(a) << ',' <<
                            std::get<2>(a) << "}\n";
    }
}

More Related Contents:

  1. what is the difference between set and unordered_set in C++?
  2. Why would anyone use set instead of unordered_set?
  3. Program stopped working, when tried to run
  4. How to get the maximum number after erasing n digits from the number [closed]
  5. How can you iterate over the elements of an std::tuple?
  6. Sorting zipped (locked) containers in C++ using boost or the STL
  7. Creating an array initializer from a tuple or variadic template parameters
  8. LRU cache design
  9. Checking a member exists, possibly in a base class, C++11 version
  10. How to make generic computations over heterogeneous argument packs of a variadic template function?
  11. void_t “can implement concepts”?
  12. C++11 “overloaded lambda” with variadic template and variable capture
  13. Easiest way of using min priority queue with key update in C++
  14. constexpr initialization of array to sort contents
  15. Generating one class member per variadic template argument
  16. “What happened to my SFINAE” redux: conditional template class members?
  17. Concatenate compile-time strings in a template at compile time?
  18. Order Statistic Tree in C++
  19. What is the difference between palindrome permutation and permutation? [closed]
  20. Is the safe-bool idiom obsolete in C++11?
  21. Why can’t simple initialize (with braces) 2D std::array? [duplicate]
  22. Resolution of std::chrono::high_resolution_clock doesn’t correspond to measurements
  23. Determine if a type is an STL container at compile time
  24. Is this infinite recursion UB?
  25. Parallel Loops in C++
  26. Is a Union Member’s Destructor Called
  27. what is “stack alignment”?
  28. Function returning a lambda expression
  29. function composition in C++ / C++11
  30. Reference invalidation after applying reverse_iterator on a custom made iterator

Leave a Comment