#ifndef SASS_PATHS_H #define SASS_PATHS_H #include #include #include template std::string vector_to_string(std::vector v) { std::stringstream buffer; buffer << "["; if (!v.empty()) { buffer << v[0]; } else { buffer << "]"; } if (v.size() == 1) { buffer << "]"; } else { for (size_t i = 1, S = v.size(); i < S; ++i) buffer << ", " << v[i]; buffer << "]"; } return buffer.str(); } namespace Sass { template std::vector > paths(std::vector > strata, size_t from_end = 0) { if (strata.empty()) { return std::vector >(); } size_t end = strata.size() - from_end; if (end <= 1) { std::vector > starting_points; starting_points.reserve(strata[0].size()); for (size_t i = 0, S = strata[0].size(); i < S; ++i) { std::vector starting_point; starting_point.push_back(strata[0][i]); starting_points.push_back(starting_point); } return starting_points; } std::vector > up_to_here = paths(strata, from_end + 1); std::vector here = strata[end-1]; std::vector > branches; branches.reserve(up_to_here.size() * here.size()); for (size_t i = 0, S1 = up_to_here.size(); i < S1; ++i) { for (size_t j = 0, S2 = here.size(); j < S2; ++j) { std::vector branch = up_to_here[i]; branch.push_back(here[j]); branches.push_back(branch); } } return branches; } } #endif