Шаблон на интерфейс AbstractStack

lectures/1/stack/abstract_stack.hpp

@@ -0,0 +1,20 @@
+#ifndef __ABSTRACT_STACK
+#define __ABSTRACT_STACK
+
+template <typename T>
+class AbstractStack {
+public:
+    // проверка за празнота
+    virtual bool empty() const = 0;
+
+    // включване на елемент
+    virtual void push(T const& x) = 0;
+
+    // намиране на последния включен елемент
+    virtual T const& peek() const = 0;
+
+    // изключване на последния включен елемент
+    virtual T pop() = 0;
+};
+
+#endif

lectures/1/stack/lstack.hpp

@@ -4,14 +4,16 @@
 #include <cstddef>
 #include <iostream>
 
+#include "abstract_stack.hpp"
+
 template <typename T>
 struct StackElement {
     T data;
     StackElement<T>* next;
 };
 
 template <typename T>
-class LinkedStack {
+class LinkedStack : public AbstractStack<T> {
 private:
     // указател към двойната кутия, която е връх на стека
     StackElement<T>* top;

lectures/1/stack/main.cpp

@@ -1,11 +1,12 @@
 #include <iostream>
 #include <cassert>
-//#include "stack.hpp"
+#include "stack.hpp"
 #include "rstack.hpp"
 #include "lstack.hpp"
+#include "abstract_stack.hpp"
 
 //using Stack = ResizingStack;
-using Stack = LinkedStack<int>;
+//using Stack = LinkedStack<int>;
 
 void convertBase() {
     unsigned n;
@@ -179,10 +180,30 @@ void testDestroyStack() {
     std::cin >> x;
 }
 
+void testAbstractStack() {
+    AbstractStack<int>* stacks[] = {
+        new Stack,
+        new ResizingStack,
+        new LinkedStack<int>
+    };
+    size_t count = sizeof(stacks) / sizeof(stacks[0]);
+    for(int i = 0; i < count; i++)
+        for(int x = 1; x <= 10; x++)
+            stacks[i]->push(x);
+
+    for(int i = 0; i < count; i++)
+        while (!stacks[i]->empty())
+            std::cout << stacks[i]->pop() << std::endl;
+
+    for(int i = 0; i < count; i++)
+        delete stacks[i];
+}
+
 int main(int, char**) {
     //convertBase();
     //testExpression();
     //autoTestParentheses();
     //testCopyStack();
-     testDestroyStack();
+    //testDestroyStack();
+    testAbstractStack();
 }

lectures/1/stack/rstack.cpp

@@ -39,14 +39,14 @@ bool ResizingStack::empty() const {
 }
 
 // включване на елемент
-void ResizingStack::push(int x) {
+void ResizingStack::push(int const& x) {
     if (full())
         resize();
     stack[++top] = x;
 }
 
 // намиране на последния включен елемент
-int ResizingStack::peek() const {
+int const& ResizingStack::peek() const {
     assert(!empty());
     return stack[top];
 }

lectures/1/stack/rstack.hpp

@@ -1,12 +1,14 @@
 #ifndef __RSTACK_HPP
 #define __RSTACK_HPP
 #include <cstddef>
+#include "abstract_stack.hpp"
 
-const int INITSTACK = 10;
-const int EMPTY_STACK = -1;
 
-class ResizingStack {
+class ResizingStack : public AbstractStack<int> {
 private:
+    static const int EMPTY_STACK = -1;
+    static const int INITSTACK = 10;
+
     // указател към масива на стека
     int* stack;
 
@@ -41,10 +43,10 @@ class ResizingStack {
     bool empty() const;
 
     // включване на елемент
-    void push(int x);
+    void push(int const& x);
 
     // намиране на последния включен елемент
-    int peek() const;
+    int const& peek() const;
 
     // изключване на последния включен елемент
     int pop();

lectures/1/stack/stack.cpp

@@ -12,13 +12,13 @@ bool Stack::empty() const {
 }
 
 // включване на елемент
-void Stack::push(int x) {
+void Stack::push(int const& x) {
     assert(!full());
     stack[++top] = x;
 }
 
 // намиране на последния включен елемент
-int Stack::peek() const {
+int const& Stack::peek() const {
     assert(!empty());
     return stack[top];
 }

lectures/1/stack/stack.hpp

@@ -1,11 +1,13 @@
 #ifndef __STACK_HPP
 #define __STACK_HPP
+#include "abstract_stack.hpp"
 
-const int MAXSTACK = 100;
-const int EMPTY_STACK = -1;
-
-class Stack {
+class Stack : public AbstractStack<int> {
 private:
+    static const int MAXSTACK = 100;
+    static const int EMPTY_STACK = -1;
+
+
     // стекът
     int stack[MAXSTACK];
 
@@ -22,10 +24,10 @@ class Stack {
     bool empty() const;
 
     // включване на елемент
-    void push(int x);
+    void push(int const& x);
 
     // намиране на последния включен елемент
-    int peek() const;
+    int const& peek() const;
 
     // изключване на последния включен елемент
     int pop();