#ifdef ADEQUEHNAME
#include ADEQUEHNAME
#else
#include "adeque.h"
#endif
#ifdef DEQUEHNAME
#include DEQUEHNAME
#else
#include "deque.h"
#endif

#include <CPstring.h>

// prototypes
void test1();
void test2();
void test3();
void test4();
void test5();
void test6();
void test7();
void test8();
void test9();
void test10();
void test11();
void test12();

const int numtests = 12;
void (*testfns[numtests])() = {
				test1, test2, test3, test4, test5,
				test6, test7, test8, test9, test10,
				test11, test12
			      };

void printintDeque(ADeque<int> * const ad) {
    int len = ad->Size();
    for (int i=0; i < len; i++) {
        cout << (*ad)[i] << " ";
    }
    cout << endl;
}

void printconstintDeque(const ADeque<int> * const ad) {
    int len = ad->Size();
    for (int i=0; i < len; i++) {
        cout << (*ad)[i] << " ";
    }
    cout << endl;
}

void printstringDeque(ADeque<string> * const ad) {
    int len = ad->Size();
    for (int i=0; i < len; i++) {
        cout << (*ad)[i] << " ";
    }
    cout << endl;
}

int main(int argc, char *argv[])
{

    int i;
    if (argc > 1) {
	for (int argnum=1; argnum < argc; argnum++) {
	    cout << endl;
	    int testnum = atoi(argv[argnum]);
	    if (testnum > numtests || testnum < 1) {
		cout << testnum << " is not a valid test number." << endl;
		continue;
	    }
	    cout << "================================================" << endl;
	    testfns[atoi(argv[argnum]) - 1]();
	}
    } else {
	for (i=1; i<=numtests; i++) {
	    cout << endl;
	    cout << "================================================" << endl;
	    testfns[i - 1]();
	}
    }

}

void test1() {
    cout << "TEST 1 -- appending 100 ints to the deque" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "Should have the numbers 99 descending to 0:" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	if ((*intdeq)[i] != 99-i) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    if (intdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test2() {
    cout << "TEST 2 -- prepending 100 ints to the deque" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Prepend(i);
    }
    cout << "Should have the numbers 0 ascending to 99:" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	if ((*intdeq)[i] != i) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    if (intdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test3() {
    cout << "TEST3 -- appending and prepending ints to the deque" << endl;
    ADeque<int> *intdeq = new Deque<int>();
    int i;
    for (i=0; i<100; i++) {
	if (i % 2) {
	    intdeq->Append(i);
	} else {
	    intdeq->Prepend(i);
	}
    }
    cout << "Should have descending even numbers, then ascending odd numbers" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	if ((*intdeq)[i] != abs(i-49) * 2 - ((i>=50)?1:0)) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    cout << " it should be " << abs(i-49) * 2 - ((i>=50)?1:0) << endl;
	}
    }
    if (intdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test4() {
    cout << "TEST4 -- appending and prepending strings to the deque" << endl;
    ADeque<string> *stringdeq = new Deque<string>();
    int i;
    for (i=0; i<100; i++) {
	if (i % 2) {
	    stringdeq->Append(itoa(i));
	} else {
	    stringdeq->Prepend(itoa(i));
	}
    }
    cout << "Should have descending even numbers, then ascending odd numbers" << endl;
    printstringDeque(stringdeq);
    for (i=0; i<100; i++) {
	if (atoi((*stringdeq)[i]) != abs(i-49) * 2 - ((i>=50)?1:0)) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    cout << " it should be " << abs(i-49) * 2 - ((i>=50)?1:0) << endl;
	}
    }
    if (stringdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test5() {
    cout << "TEST 5 -- appending 100 ints to the deque, then inserting 100 ints" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "(Append) Should have the numbers 99 to 0:" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	intdeq->Insert(i*2, i);
    }
    cout <<endl;
    cout << "(Insert) Should have ascending and descending series merged (alternating):" << endl;
    cout << "         (first and last elements should be 0, not 99)" << endl;
    printintDeque(intdeq);
    for (i=0; i<200; i++) {
	if ((*intdeq)[i] != (i%2 ? (99 - (i-1)/2) : i/2)) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    if (intdeq->Size() != 200) {
	cout << endl;
	cout << "*** Size() is not 200?" <<endl;
    }
    cout << endl;
}

void test6() {
    cout << "TEST 6 -- append 100 ints to the deque, then testing non-const index mutator" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "Should have the numbers 99 descending to 0:" << endl;
    printintDeque(intdeq);
    for (i=1; i<100; i+=2) {
	(*intdeq)[i] = 100;
    }
    cout <<endl;
    cout << "Should have the numbers 99 descending to 0 with even numbers replaced with 100 :" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	if ((*intdeq)[i] != (i%2 ? 100 : 99-i)) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    if (intdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test7() {
    cout << "TEST 7 -- appending 100 ints to the deque, then testing const indexing" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "Should have the numbers 99 descending to 0 (uses const indexing):" << endl;
    printconstintDeque(intdeq);
    ADeque<int> * const constintdeq = intdeq;
    for (i=0; i<100; i++) {
	if ((*constintdeq)[i] != 99-i) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    if (intdeq->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test8() {
    cout << "TEST 8 -- testing Popfirst, Poplast" << endl;
    ADeque<int> *intdeq = new Deque<int>();
    int i;
    for (i=0; i<100; i++) {
	if (i % 2) {
	    intdeq->Append(i);
	} else {
	    intdeq->Prepend(i);
	}
    }
    cout << "Should have descending even numbers, then ascending odd numbers" << endl;
    printintDeque(intdeq);
    for (i=0; i<50; i++) {
	if (i % 2) {
	    intdeq->Poplast();
	} else {
	    intdeq->Popfirst();
	}
    }
    cout <<endl;
    cout << "Should be the same, but only from 48 to 0 to 49" << endl;
    printintDeque(intdeq);
    for (i=0; i<50; i++) {
	if ((*intdeq)[i] != abs(i-24) * 2 - ((i>=25)?1:0)) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    cout << " it should be " << abs(i-49) * 2 - ((i>=50)?1:0) << endl;
	}
    }
    if (intdeq->Size() != 50) {
	cout << endl;
	cout << "*** Size() is not 50?" <<endl;
    }
    cout << endl;
}

void test9() {
    cout << "TEST 9 -- appending 100 ints to the deque, testing destructor" << endl;
    ADeque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "Should have the numbers 99 descending to 0:" << endl;
    printintDeque(intdeq);
    for (i=0; i<100; i++) {
	if ((*intdeq)[i] != 99-i) {
	    cout << "*** Seems to be a problem at element " << i << endl;
	    break;
	}
    }
    cout << endl;
    cout << "Destructing..." << endl;
    delete intdeq;
    cout << endl;
}

void test10() {
    cout << "TEST 10 -- Stress test!" << endl;
    cout << "If this test breaks, check the code for deque-growing problems" << endl;
    for (int num = 100; num < 1000000; num *= 10) {
	cout << endl;
	cout << "appending and prepending " << num << " ints to the deque" << endl;
	ADeque<int> *intdeq = new Deque<int>();
	int i;
	for (i=0; i<num; i++) {
	    if (i % 2) {
		intdeq->Append(i);
	    } else {
		intdeq->Prepend(i);
	    }
	}
	for (i=0; i<num; i++) {
	    if ((*intdeq)[i] != abs(i-(num/2 - 1)) * 2 - ((i>=num/2)?1:0)) {
		cout << "*** Seems to be a problem at element " << i << endl;
		cout << " it should be " << abs(i-(num/2 - 1)) * 2 - ((i>=num/2)?1:0) << endl;
		break;
	    }
	}
	if (intdeq->Size() != num) {
	    cout << endl;
	    cout << "*** Size() is not " << num << "?" <<endl;
	}
	cout << endl;
	cout << "Destructing..." << endl;
	delete intdeq;
	cout << endl;
    }
}

void test11() {
    cout << "TEST 11 -- testing copy constructor" << endl;
    Deque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "First deque:" << endl;
    printintDeque(intdeq);

    Deque<int> * intdeq2 = new Deque<int>(*intdeq);
    cout << "Second deque (should be the same):" << endl;
    printintDeque(intdeq2);
    if (intdeq2->Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}

void test12() {
    cout << "TEST 12 -- testing assignment operator" << endl;
    Deque<int> * intdeq = new Deque<int>();
    int i;
    for (i=99; i>=0; i--) {
	intdeq->Append(i);
    }
    cout << "First deque:" << endl;
    printintDeque(intdeq);

    Deque<int> intdeq2 = (*intdeq);
    delete intdeq;
    cout << "Second deque (should be the same):" << endl;
    printintDeque(&intdeq2);
    if (intdeq2.Size() != 100) {
	cout << endl;
	cout << "*** Size() is not 100?" <<endl;
    }
    cout << endl;
}