// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, vector <int> p0, vector <int> p1, bool hasAnswer, string p2) {
cout << "Test " << testNum << ": [" << "{";
for (int i = 0; int(p0.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p0[i];
}
cout << "}" << "," << "{";
for (int i = 0; int(p1.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p1[i];
}
cout << "}";
cout << "]" << endl;
SetPartialOrder *obj;
string answer;
obj = new SetPartialOrder();
clock_t startTime = clock();
answer = obj->compareSets(p0, p1);
clock_t endTime = clock();
delete obj;
bool res;
res = true;
cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
if (hasAnswer) {
cout << "Desired answer:" << endl;
cout << "\t" << "\"" << p2 << "\"" << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << "\"" << answer << "\"" << endl;
if (hasAnswer) {
res = answer == p2;
}
if (!res) {
cout << "DOESN'T MATCH!!!!" << endl;
} else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
cout << "FAIL the timeout" << endl;
res = false;
} else if (hasAnswer) {
cout << "Match :-)" << endl;
} else {
cout << "OK, but is it right?" << endl;
}
cout << "" << endl;
return res;
}
int main(int argc, char* argv[]) {
SetPartialOrder order;
vector<int> arrA, arrB;
arrA.clear();
arrA.push_back(1);
arrA.push_back(2);
arrA.push_back(3);
arrA.push_back(5);
arrA.push_back(8);
arrB.clear();
arrB.push_back(8);
arrB.push_back(5);
arrB.push_back(1);
arrB.push_back(3);
arrB.push_back(2);
cout << order.compareSets(arrA, arrB) << "\n";
arrA.clear();
arrA.push_back(2);
arrA.push_back(3);
arrA.push_back(5);
arrA.push_back(7);
arrB.clear();
arrB.push_back(1);
arrB.push_back(2);
arrB.push_back(3);
arrB.push_back(4);
arrB.push_back(5);
arrB.push_back(6);
arrB.push_back(7);
arrB.push_back(8);
arrB.push_back(9);
arrB.push_back(10);
cout << order.compareSets(arrA, arrB) << "\n";
arrA.clear();
arrA.push_back(2);
arrA.push_back(4);
arrA.push_back(6);
arrA.push_back(8);
arrA.push_back(10);
arrA.push_back(12);
arrA.push_back(14);
arrA.push_back(16);
arrB.clear();
arrB.push_back(2);
arrB.push_back(4);
arrB.push_back(8);
arrB.push_back(16);
cout << order.compareSets(arrA, arrB) << "\n";
arrA.clear();
arrA.push_back(42);
arrA.push_back(23);
arrA.push_back(31);
arrB.clear();
arrB.push_back(15);
arrB.push_back(23);
arrB.push_back(31);
cout << order.compareSets(arrA, arrB) << "\n";
return 0;
}