bool do_test(vector<int> seq, int __expected) {
time_t startClock = clock();
FoxProgression *instance = new FoxProgression();
int __result = instance->theCount(seq);
double elapsed = (double)(clock() - startClock) / CLOCKS_PER_SEC;
delete instance;
if (__result == __expected) {
cout << "PASSED!" << " (" << elapsed << " seconds)" << endl;
return true;
}
else {
cout << "FAILED!" << " (" << elapsed << " seconds)" << endl;
cout << " Expected: " << to_string(__expected) << endl;
cout << " Received: " << to_string(__result) << endl;
return false;
}
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, vector <int> p0, bool hasAnswer, int p1) {
cout << "Test " << testNum << ": [" << "{";
for (int i = 0; int(p0.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p0[i];
}
cout << "}";
cout << "]" << endl;
FoxProgression *obj;
int answer;
obj = new FoxProgression();
clock_t startTime = clock();
answer = obj->theCount(p0);
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" << p1 << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << answer << endl;
if (hasAnswer) {
res = answer == p1;
}
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;
}
double test0() {
int t0[] = {1, 2, 4, 8};
vector <int> p0(t0, t0+sizeof(t0)/sizeof(int));
FoxProgression * obj = new FoxProgression();
clock_t start = clock();
int my_answer = obj->theCount(p0);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p1 = 1;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p1 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p1 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
void testCase6() {
int seq_[] = {1, 1, 2, 2, 3, 3};
vector<int> seq(seq_, seq_ + (sizeof(seq_) / sizeof(seq_[0])));
int expected_ = 0;
assertEquals(6, expected_, solution.theCount(seq));
}
void testCase5() {
int seq_[] = {4, 8};
vector<int> seq(seq_, seq_ + (sizeof(seq_) / sizeof(seq_[0])));
int expected_ = 2;
assertEquals(5, expected_, solution.theCount(seq));
}
void testCase4() {
int seq_[] = {1};
vector<int> seq(seq_, seq_ + (sizeof(seq_) / sizeof(seq_[0])));
int expected_ = -1;
assertEquals(4, expected_, solution.theCount(seq));
}