Recursive Function

[kurousagi]

I'm trying to write a recursive function that takes in a vector of strings that contains

"1 forward", "2 forward", "rotate left", "2 backwards" ... etc

how can I write recursive function that creates a vector of every unique combination of commands?

[MiiNiPaa]

Please define what you mean by "unique combination". Is "1 forward" is an unique combination? Or should it be several (How many?) commands in a row?

[kurousagi]

By unique combination I mean a vector of the same length. So, just "1 forward" is not a unique combination.

[MiiNiPaa]

Maybe that is what you want:
http://en.cppreference.com/w/cpp/algorithm/next_permutation

[kurousagi]

This is what I want but is there a way to do it recursively?

[MiiNiPaa]

vector of every unique combination of commands

You mean it should be vector of vector of strings?

[kurousagi]

yes

[MiiNiPaa]

#include <vector>
#include <algorithm>

std::vector<std::vector<std::string> > recursive_permutation(std::vector<std::string> data)
{
    if( std::next_permutation(data.begin(), data.end()) ) {
        std::vector<std::vector<std::string>> temp  = recursive_permutation(data);
        temp.push_back(data);
        return temp;
    } else {
        std::vector<std::vector<std::string>> result = {data};
        return result;
    }
}

std::vector<std::vector<std::string>> all_unique_combinations(std::vector<std::string> source)
{
    std::sort(source.begin(), source.end());
    return recursive_permutation(source);
}

_{Yay for excessive copy}

[kurousagi]

Thank you