43 lines
1.6 KiB
C
43 lines
1.6 KiB
C
|
// Fig. 15.1: Stack.h
|
||
|
|
// Stack class template.
|
||
|
|
#pragma once
|
||
|
|
#include <deque>
|
||
|
|
|
||
|
|
template<typename T>
|
||
|
|
class Stack {
|
||
|
|
public:
|
||
|
|
// return the top element of Stack
|
||
|
|
const T& top() const {return stack.front();}
|
||
|
|
|
||
|
|
// push an element onto Stack
|
||
|
|
void push(const T& pushValue) {stack.push_front(pushValue);}
|
||
|
|
|
||
|
|
// pop an element from Stack
|
||
|
|
void pop() {stack.pop_front();}
|
||
|
|
|
||
|
|
// determine whether Stack is empty
|
||
|
|
bool isEmpty() const {return stack.empty();}
|
||
|
|
|
||
|
|
// return size of Stack
|
||
|
|
size_t size() const {return stack.size();}
|
||
|
|
private:
|
||
|
|
std::deque<T> stack{}; // internal representation of Stack
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/**************************************************************************
|
||
|
|
* (C) Copyright 1992-2022 by Deitel & Associates, Inc. and *
|
||
|
|
* Pearson Education, Inc. All Rights Reserved. *
|
||
|
|
* *
|
||
|
|
* DISCLAIMER: The authors and publisher of this book have used their *
|
||
|
|
* best efforts in preparing the book. These efforts include the *
|
||
|
|
* development, research, and testing of the theories and programs *
|
||
|
|
* to determine their effectiveness. The authors and publisher make *
|
||
|
|
* no warranty of any kind, expressed or implied, with regard to these *
|
||
|
|
* programs or to the documentation contained in these books. The authors *
|
||
|
|
* and publisher shall not be liable in any event for incidental or *
|
||
|
|
* consequential damages in connection with, or arising out of, the *
|
||
|
|
* furnishing, performance, or use of these programs. *
|
||
|
|
**************************************************************************/
|