-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstackm.cpp
51 lines (44 loc) · 842 Bytes
/
stackm.cpp
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
#include "stdafx.h"
#include <iostream>
using namespace std;
#include "stackm.h"
template <class T, int nEl>
void StackM <T, nEl> :: Push (T elem)
{
if(!Full())
{
data [nElements] = elem;
nElements ++;
}
else
cout<<"Stack is full"<<endl;
}
template <class T, int nEl>
T StackM <T, nEl> :: Pop ()
{
nElements --;
return data [nElements];
}
template <class T, int nEl>
int StackM <T, nEl> :: Number ()
{
return nElements;
}
template <class T, int nEl>
int StackM <T, nEl> :: Empty ()
{
return (nElements == 0);
}
template <class T, int nEl>
int StackM <T, nEl> :: Full ()
{
return (nElements == nEl);
}
template <class T, int nEl>
const StackM<T>& StackM <T, nEl> :: operator=(const StackM<T>& p1)
{
nElements=p1.nElements;
for(int i=0;i<nElements;i++)
data[i]=p1.data[i];
return *this;
}