/*
 * main.cpp
 *
 *  Created on: 17.03.2014
 *      Author: trifon
 */

#include <iostream>
using namespace std;

#include "stack.h"
#include "rstack.h"
#include "lstack.h"

typedef LinkedStack MyStack;

void testStack() {
	MyStack s;
	for(int i = 1; i <= 10; i++)
		s.push(i);
	MyStack s2 = s;
	cout << "s:\n";
	while (!s.empty())
		cout << s.pop() << endl;
	MyStack s3;
	s3 = s;
	for(int i = 11; i <= 20; i++)
			s.push(i);
	cout << "s2:\n";
	while (!s2.empty())
		cout << s2.pop() << endl;
	cout << "Живи сме!\n";
}

bool checkParentheses() {
	char c;
	MyStack s;
	do {
		cin >> c;
		switch(c) {
		case '(':
		case '[':
		case '{':
			s.push(c);
			break;
		case ')':
			if (s.empty() || s.pop() != '(')
				return false;
			break;
		case ']':
			if (s.empty() || s.pop() != '[')
				return false;
			break;
		case '}':
			if (s.empty() || s.pop() != '{')
				return false;
		}
	} while (c != '.');
	return s.empty();
}

void testAbstractStack() {
	int const N = 3;
	AbstractStack* s[N] = { new Stack, new ResizingStack, new LinkedStack };
	int j = 0;
	for(int i = 0; i < 40; i++) {
		s[j]->push(i);
		++j %= N;
	}

	for(int i = 0; i < N; i++)
		s[i]->print();

	for(int i = 0; i < N; i++)
		delete s[i];
}

int main() {
	/*
	 *
	 testStack();
	if (checkParentheses())
		cout << "OK!" << endl;
	else
		cout << "FAIL!" << endl;
	*/
	testAbstractStack();
	return 0;
}