Stack 100%

Author: bitdove

.github/workflows/ci.yml

@@ -16,7 +16,7 @@ jobs:
     strategy:
       matrix:
         # Add your projects from 'data-structures'
-        project: [LinkedList, DoublyLinkedList, Queue]
+        project: [LinkedList, DoublyLinkedList, Queue, Stack]
 
     steps:
     # Step 1: Checkout the repository

data-structures/Stack/__test__/test_Stack.cpp

@@ -1 +1,57 @@
-#include "../include/Stack.h"
+#include "../include/Stack.h"
+#include <cassert>
+#include <iostream>
+
+
+int main(int argc, char* argv[]){
+  Stack<int> stk;
+  assert(stk.empty() == true);
+  assert(stk.size() == 0);
+  try{
+    stk.pop();
+    std::cerr << "pop() throw an exception FAILED!" << std::endl;
+  } catch(const std::underflow_error &e){
+    std::cout << "pop() throw an exception PASSED! " << e.what() << std::endl;
+  }
+  try{
+    stk.top();
+    std::cerr << "top() throw an exception FAILED!" << std::endl;
+  } catch(const std::underflow_error &e){
+    std::cout << "top() throw an exception PASSED! " << e.what() << std::endl;
+  }
+  stk.push(12);
+  assert(stk.empty() == false);
+  assert(stk.size() == 1);
+  assert(stk.top() == 12);
+  stk.push(7); // 7 12
+  assert(stk.empty() == false);
+  assert(stk.size() == 2);
+  assert(stk.top() == 7);
+  stk.pop(); // 12
+  assert(stk.empty() == false);
+  assert(stk.size() == 1);
+  assert(stk.top() == 12);
+  stk.push(9); // 9 12
+  assert(stk.empty() == false);
+  assert(stk.size() == 2);
+  assert(stk.top() == 9);
+  stk.pop();
+  stk.pop();
+  assert(stk.empty() == true);
+  assert(stk.size() == 0);
+  try{
+    stk.pop();
+    std::cerr << "pop() throw an exception FAILED!" << std::endl;
+  } catch(const std::underflow_error &e){
+    std::cout << "pop() throw an exception PASSED! " << e.what() << std::endl;
+  }
+  try{
+    stk.top();
+    std::cerr << "top() throw an exception FAILED!" << std::endl;
+  } catch(const std::underflow_error &e){
+    std::cout << "top() throw an exception PASSED! " << e.what() << std::endl;
+  }
+  std::cout << "ALL TEST PASSED!" << std::endl;
+
+  return 0;
+}

data-structures/Stack/include/Stack.h

@@ -13,18 +13,51 @@ template <typename T>
 class Stack{
   public:
     // Capacity
-    bool empty();
-    size_t size();
+    bool empty() const;
+    size_t size() const;
     // Add
-    void push(T& value);
+    void push(const T& value);
     // Delete
     void pop();
     // Check
-    void top();
+    T& top();
   private:
     LinkedList<T> list;
 };
 
+// Capacity
+template <typename T>
+bool Stack<T>::empty() const{
+  return list.empty();
+}
+
+template <typename T>
+size_t Stack<T>::size() const{
+  return list.size();
+}
+
+// Add
+template <typename T>
+void Stack<T>::push(const T& value){
+  list.push_front(value);
+}
+
+// Delete
+template <typename T>
+void Stack<T>::pop(){
+  if(empty()){
+    throw std::underflow_error("This Stack is empty");
+  }
+  list.pop_front();
+}
 
+// Check
+template <typename T>
+T& Stack<T>::top(){
+  if(list.empty()){
+    throw std::underflow_error("This Stack is empty");
+  }
+  return list.front();
+}
 
 #endif // STACK_H