go-algorithms/DataStructures/stack/stack_test.go at master · brotherpowers/go-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
package stack

import (
	"reflect"
	"testing"
)

// PUSH
func TestPush(t *testing.T) {
	cases := []struct {
		in   Stack
		push interface{}
		want Stack
	}{
		{Stack{[]interface{}{1, 2, 46, 74, 89, 105}}, 200, Stack{[]interface{}{1, 2, 46, 74, 89, 105, 200}}},
		{Stack{[]interface{}{53, 77, 88, 65, 42, 31, 33, 33, 20}}, 3, Stack{[]interface{}{53, 77, 88, 65, 42, 31, 33, 33, 20, 3}}},
		{Stack{[]interface{}{1, 2, 46, 74, 89, 105}}, 6, Stack{[]interface{}{1, 2, 46, 74, 89, 105, 6}}},
	}

	for _, c := range cases {

		// PUSH
		c.in.Push(c.push)

		// result is the stack
		got := c.in

		if !reflect.DeepEqual(got, c.want) {
			t.Errorf("Stack after  PUSH(%v) = %v and want = %v", got, c.push, c.want)
		}
	}
}

// POP

func TestPop(t *testing.T) {
	cases := []struct {
		in     Stack
		repeat int
		want   Stack
	}{
		{Stack{[]interface{}{1, 2, 46, 74, 89, 105}}, 1, Stack{[]interface{}{1, 2, 46, 74, 89}}},
		{Stack{[]interface{}{53, 77, 88, 65, 42, 31, 33, 33, 20}}, 3, Stack{[]interface{}{53, 77, 88, 65, 42, 31}}},
		{Stack{[]interface{}{1, 2, 46, 74, 89, 105}}, 6, Stack{[]interface{}{}}},
	}

	for _, c := range cases {

		// POP
		for i := 0; i < c.repeat; i++ {
			c.in.Pop()
		}

		// result is the stack
		got := c.in

		if !reflect.DeepEqual(got, c.want) {
			t.Errorf("Stack after POP %v times = %v and want = %v", got, c.repeat, c.want)
		}
	}
}