rewrite stack with pointers

stack/stack.go

@@ -1,61 +1,47 @@
 package stack
 
-type Stack struct {
+type StackItem struct {
-	st  []interface{}
+	item interface{}
-	len int
+	next *StackItem
-}
-
-func New() *Stack {
-	stack := &Stack{}
-	stack.st = make([]interface{}, 1)
-	stack.len = 0
-	return stack
-}
-
-func (stack *Stack) Length() int {
-	return stack.len
 }
 
-func (stack *Stack) Pop() {
+// Stack is a base structure for LIFO
-	stack.st = stack.st[1:]
+type Stack struct {
-	stack.len -= 1
+	sp    *StackItem
+	depth uint64
 }
 
-func (stack *Stack) Peek() interface{} {
+// Initialzes new Stack
-	return stack.st[0]
+func New() *Stack {
-}
+	var stack *Stack = new(Stack)
 
-func (stack *Stack) IsEmpty() bool {
+	stack.depth = 0
-	return (stack.len == 0)
+	return stack
 }
 
-func (stack *Stack) Push(value interface{}) {
+// Pushes a given item into Stack
-	add(stack, value)
+func (stack *Stack) Push(item interface{}) {
+	stack.sp = &StackItem{item: item, next: stack.sp}
+	stack.depth++
 }
 
-func add(slice *Stack, value interface{}) {
+// Deletes top of a stack and return it
-	slice.len += 1
+func (stack *Stack) Pop() interface{} {
-	var tmpSlice []interface{} = make([]interface{}, slice.len)
+	if stack.depth > 0 {
-	if slice.len == 0 {
+		item := stack.sp.item
-		slice.st[0] = value
+		stack.sp = stack.sp.next
-		return
+		stack.depth--
+		return item
 	}
 
-	for i := 0; i < slice.len; i++ {
+	return nil
-		tmpSlice[i] = 0
+}
-	}
-
-	for i := 0; i < slice.len; i++ {
-		if i == 0 {
-			tmpSlice[0] = value
-		} else {
-			tmpSlice[i] = slice.st[i-1]
-		}
 
-		if i == slice.len-1 {
+// Returns top of a stack without deletion
-			break
+func (stack *Stack) Peek() interface{} {
-		}
+	if stack.depth > 0 {
+		return stack.sp.item
 	}
 
-	slice.st = tmpSlice
+	return nil
 }

stack/stack_test.go

@@ -2,24 +2,20 @@ package stack
 
 import "testing"
 
-func Test_Stack(t *testing.T) {
+func TestStack(t *testing.T) {
-	stack := New()
+	var stack *Stack = New()
 
+	stack.Push(1)
+	stack.Push(2)
+	stack.Push(3)
+	stack.Push(4)
 	stack.Push(5)
-	stack.Push(6)
-	stack.Push(7)
 
-	if stack.Length() != 3 {
+	for i := 5; i > 0; i-- {
-		t.Error("[Error] stack length is wrong")
+		item := stack.Pop()
-	}
-
-	stack.Pop()
-
-	if stack.Length() != 2 {
-		t.Error("[Error] stack length is wrong after pop")
-	}
 
-	if stack.Peek() != 6 {
+		if item != i {
-		t.Error("[Error] stack Peek is wrong")
+			t.Error("TestStack failed...", i)
+		}
 	}
 }