[Stack] Add print()

Stack/ArrayStack.h

@@ -74,6 +74,11 @@ namespace Deun {
  */
  const T& peek();
 
+ /**
+ * 스택을 출력합니다.
+ */
+ void print();
+
  /**
  * 스택을 초기화합니다.
  * 모든 원소가 삭제됩니다.

Stack/ArrayStack.hpp

@@ -69,6 +69,24 @@ namespace Deun {
  return array[count - 1];
  }
 
+ template <typename T>
+ void ArrayStack<T>::print() {
+ using namespace std;
+ cout << "ArrayStack(size=" << size << ", count=" << count << ")" << endl;
+ if (!count) {
+ cout << "(empty)" << endl;
+ return;
+ }
+ cout << "(top) ";
+ for (int i = count - 1; i >= 0; i--) {
+ cout << array[i];
+ if (i) {
+ cout << " / ";
+ }
+ }
+ cout << endl;
+ }
+
  template <typename T>
  void ArrayStack<T>::clear() {
  count = 0;

Stack/LinkedListStack.h

@@ -73,6 +73,11 @@ namespace Deun {
  */
  const T& peek();
 
+ /**
+ * 스택을 출력합니다.
+ */
+ void print();
+
  /**
  * 스택을 초기화합니다.
  * 모든 원소가 삭제됩니다.

Stack/LinkedListStack.hpp

@@ -65,14 +65,31 @@ namespace Deun {
  return head->data;
  }
 
+ template <typename T>
+ void LinkedListStack<T>::print() {
+ using namespace std;
+ cout << "LinkedListStack(size=inf, count=" << count << ")" << endl;
+ if (!head) {
+ cout << "(empty)" << endl;
+ return;
+ }
+ StackNode<T>* current = head;
+ cout << "(head)";
+ while (current) {
+ cout << " -> " << current->data;
+ current = current->next;
+ }
+ cout << endl;
+ }
+
  template <typename T>
  void LinkedListStack<T>::clear() {
- StackNode<T>* front = head;
+ StackNode<T>* current = head;
  StackNode<T>* next;
- while (front) {
- next = front->next;
- delete front;
- front = next;
+ while (current) {
+ next = current->next;
+ delete current;
+ current = next;
  }
  head = nullptr;
  count = 0;

Stack/Stack.hpp

@@ -1,6 +1,7 @@
 #ifndef __DEUN_STACK_HPP__
 #define __DEUN_STACK_HPP__
 
+#include <iostream>
 #include <new>
 
 namespace Deun {
@@ -22,6 +23,8 @@ namespace Deun {
  virtual bool push(const T& element) = 0;
  virtual T pop() = 0;
  virtual const T& peek() = 0;
+
+ virtual void print() = 0;
  virtual void clear() = 0;
  };