[Stack] Fix Stack

Stack/Stack.cpp

@@ -1,34 +1,34 @@
 #include "Stack.h"
 
 namespace Deun {
- Stack::Stack(unsigned long size) {
+ Stack::Stack(unsigned int size) {
  this->size = size;
  top = 0;
  elements = new (std::nothrow) int[size];
 
  if (!elements) {
  this->size = 0;
- throw StackError::STACK_ALLOCATE_FAILED;
+ throw StackError::STACK_ALLOCATION_FAILED;
  }
  }
 
  Stack::~Stack() {
  delete[] elements;
  }
 
- bool Stack::isFull() {
- return (top == size);
- }
-
  bool Stack::isEmpty() {
  return (top == 0);
  }
 
- unsigned long Stack::getSize() {
+ bool Stack::isFull() {
+ return (top == size);
+ }
+
+ unsigned int Stack::getSize() {
  return size;
  }
 
- unsigned long Stack::getCount() {
+ unsigned int Stack::getCount() {
  return top;
  }
 

Stack/Stack.h

@@ -5,26 +5,26 @@
 
 namespace Deun {
  enum class StackError {
- STACK_ALLOCATE_FAILED,
- STACK_IS_FULL,
+ STACK_ALLOCATION_FAILED,
  STACK_IS_EMPTY,
  };
 
+ // 배열 기반 스택
  class Stack {
  private:
  int* elements;
- unsigned long size;
- unsigned long top;
+ unsigned int size;
+ unsigned int top;
 
  public:
- Stack(unsigned long size = 100);
+ Stack(unsigned int size = 100);
  ~Stack();
 
- bool isFull();
  bool isEmpty();
-
- unsigned long getSize();
- unsigned long getCount();
+ bool isFull();
+
+ unsigned int getSize();
+ unsigned int getCount();
 
  bool push(int element);
  int pop();