-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFixedSizeStack.hpp~
More file actions
83 lines (68 loc) · 1.14 KB
/
FixedSizeStack.hpp~
File metadata and controls
83 lines (68 loc) · 1.14 KB
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
82
83
#ifndef FIXEDSIZESTACK_H
#define FIXEDSIZESTACK_H
#include<iostream>
template<class T>
class FixedSizeStack{
private:
T *items;
int n;
int capacity;
public:
FixedSizeStack(int capacity);
void push(T item);
bool pop(T &out);
int size();
bool isEmpty();
~FixedSizeStack();
};
template<class T>
FixedSizeStack<T>::FixedSizeStack(int capacity)
{
items = new T[capacity];
n = 0;
this->capacity = capacity;
}
template<class T>
void FixedSizeStack<T>::push(T elt)
{
if (n >= capacity)
{
std::cerr << "FULL STACK : NO SPACE TO PUSH" << std::endl;
}
else
{
items[n] = elt;
n = n+1;
}
}
template<class T>
bool FixedSizeStack<T>::pop(T &out)
{
if (n == 0)
{
std::cerr << "STACK EMPTY : NO ELEMENT TO POP" << std::endl;
return false;
}
else
{
n = n-1;
out = items[n];
return true;
}
}
template<class T>
bool FixedSizeStack<T>::isEmpty()
{
return n==0;
}
template<class T>
int FixedSizeStack<T>::size()
{
return n;
}
template<class T>
FixedSizeStack<T>::~FixedSizeStack()
{
delete [] items;
}
#endif