lab / Algor / stack / stack

#include "stack.h"
#include <iostream>

using namespace std;

Stack::Stack(int max1)
{
	maxsize=max1;
	top=maxsize;
	items=new double [maxsize];
	size1=0;
}

Stack::~Stack()
{
	delete[] items;
}

int Stack::sizeRe()
{

	return size1;
}

int Stack::maxsizeRe()
{
	return maxsize;
}

bool Stack::empty1()
{
	return size1==0;
}

bool Stack::full()
{
	return size1==maxsize;
}

bool Stack::push(double value)
{
	if(full())
		return false;
	items[size1]=value;
	top--;
	size1++;
	return true;
}

bool Stack::pop()
{
    if (empty1())
        return false;
	top++;
	size1--;
		return true;
}

void Stack::print()
{
	for (int i=0; i<size1; i++)
	{
		cout << items[i] << endl;
	}
}

void Stack::clear1()
{
    for(int i = 0; i < size1; i++)
        items[i] = 0;
		size1 = 0;
	if (size1==0) cout <<"\nСписко пуст!";

}