Stack/Stack.h at master · AndersLatimore/Stack · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
//
//  Stack.h
//  stackEx
//
//  Created by Anders Akesson on 1/26/13.
//  Copyright (c) 2013 Anders Akesson. All rights reserved.
//

#ifndef __stackEx__Stack__
#define __stackEx__Stack__

#include <iostream>
#include "List.h"
using namespace std;

template <typename T>
class Stack
{
private:
    List<T> *newList; // container
    int nrOfItems;
public:
    Stack();
    void push(T item);
    void pop();
    T* peek();
    bool isEmpty();
    virtual ~Stack();

};

#endif /* defined(__stackEx__Stack__) */

template<typename T>
Stack<T>::Stack()
{
    newList = new List<T>;
    this->nrOfItems = 0;
}
template<typename T>
void Stack<T>::push(T item)
{
    newList->insertFirst(item);
    this->nrOfItems++;
}
template<typename T>
void Stack<T>::pop()
{
    if (isEmpty() == true)
    {
        cout << "Stack is empty. " << endl;
        return;
    }
    else
    {
        newList->removeFirst();
        this->nrOfItems--;
    }
}
template<typename T>
T* Stack<T>::peek()
{
    T* item = newList->elementAt(0);
    return item;
}
template<typename T>
bool Stack<T>::isEmpty()
{
    bool isEmpty = true;

    if (newList->size() > 1)
    {
        isEmpty = false;
    }
    return isEmpty;
}
template<typename T>
Stack<T>::~Stack()
{
    delete newList;
}