-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStack.cpp
90 lines (85 loc) · 2.18 KB
/
Stack.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
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
84
85
86
87
88
89
90
//
// Created by avrod on 10/8/2020.
//
#ifndef FROGGER_STACK_CPP
#define FROGGER_STACK_CPP
#include "Stack.h"
template <class T>
Stack<T>::Stack(){
}
template <class T>
Stack<T>::Stack(const Stack<T>& stackObj){
// std::cout << "------COPY CONSTRUCTOR------" << std::endl;
*this = stackObj;
}
template <class T>
Stack<T>& Stack<T>::operator=(const Stack<T>& stackObj){
// std::cout << "------ASSIGNMENT OPERATOR------" << std::endl;
const Node<T>* walker;
for(walker = stackObj.stack.getHead(); walker != nullptr; walker = walker->getNext()){
stack.insertAtEnd(walker->getData());
}
return *this;
}
template <class T>
Stack<T>::~Stack(){
stack.clearList();
}
template <class T>
T Stack<T>::pop(){ //Do We Want It To be A Reference
T value = stack.getHead()->getData();
stack.deleteHead();
return value;
}
template <class T>
void Stack<T>::push(const T& item){
stack.insertAtBeginning(item);
}
template <class T>
bool Stack<T>::empty(){
return stack.getSize() == 0; //Return true if empty, false if not empty
}
template <class T>
int Stack<T>::size() const{
return stack.getSize();
}
template <class T>
T Stack<T>::top(){ //Return what value in at the top
T value = stack.getHead()->getData();
return value;
}
template <class T>
std::ostream& operator <<(std::ostream& outs, const Stack<T>& stackObj){
return outs << stackObj.stack;
}
template <class T>
T Stack<T>::seek(unsigned int n){
Node<T>* walker = stack.getHead();
int count = 0;
while(walker->getNext() != nullptr && count < n){
walker = walker->getNext();
count++;
}
return walker->getData();
}
template <class T>
typename Stack<T>::iterator Stack<T>::begin(){
return stack.begin();
}
template <class T>
typename Stack<T>::iterator Stack<T>::end(){
return stack.end();
}
template <class T>
typename Stack<T>::iterator Stack<T>::rBegin(){
return stack.rBegin();
}
template <class T>
typename Stack<T>::iterator Stack<T>::rEnd(){
return stack.rEnd();
}
template <class T>
typename Stack<T>::iterator Stack<T>::last(){
return stack.last();
}
#endif