#include "../include/Ordering.h"
#include "../include/Mgr.h"
#include "../include/Base.h"

#include <functional>

using namespace std;

vector<int> increasing(int n)
{
	return populate<int>(n, id<int>);
}

vector<int> decreasing(int n)
{
	return populate<int>(n, [=] (int i) -> int { return n - i - 1; });
}

vector<vector<BDD>> interleaved(int nInputs, int nOutputs, const vector<int>& innerOrdering)
{
	int k = nInputs + nOutputs;
	vector<vector<BDD>> var(k, vector<BDD>(innerOrdering.size()));

	for (auto it = innerOrdering.begin(); it != innerOrdering.end(); it++)
	for (int i = 0; i < k; i++)
	{
		var[i][*it] = m.bddVar();
	}
	
	return var;
}

vector<vector<BDD>> inOrder(int nInputs, int nOutputs, const vector<int>& innerOrdering)
{
	int k = nInputs + nOutputs;
	vector<vector<BDD>> var(k, vector<BDD>(innerOrdering.size()));

	for (int i = 0; i < k; i++)
	for (auto it = innerOrdering.begin(); it != innerOrdering.end(); it++)
	{
		var[i][*it] = m.bddVar();
	}
	
	return var;
}