-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack_test.go
172 lines (164 loc) · 2.97 KB
/
stack_test.go
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
package algorithms
import (
"reflect"
"testing"
)
func TestStack_Pop(t *testing.T) {
type fields struct {
Elements []int
Max int
}
tests := []struct {
name string
fields fields
want int
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &Stack{
Elements: tt.fields.Elements,
Max: tt.fields.Max,
}
if got := s.Pop(); got != tt.want {
t.Errorf("Stack.Pop() = %v, want %v", got, tt.want)
}
})
}
}
func TestNewStack(t *testing.T) {
type args struct {
opts []func(*Stack)
}
tests := []struct {
name string
args args
want *Stack
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := NewStack(tt.args.opts...); !reflect.DeepEqual(got, tt.want) {
t.Errorf("NewStack() = %v, want %v", got, tt.want)
}
})
}
}
func TestSetMax(t *testing.T) {
type args struct {
i int
}
tests := []struct {
name string
args args
want func(*Stack)
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := SetMax(tt.args.i); !reflect.DeepEqual(got, tt.want) {
t.Errorf("SetMax() = %v, want %v", got, tt.want)
}
})
}
}
func TestStack_Push(t *testing.T) {
type fields struct {
Elements []int
Max int
}
type args struct {
i int
}
tests := []struct {
name string
fields fields
args args
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &Stack{
Elements: tt.fields.Elements,
Max: tt.fields.Max,
}
s.Push(tt.args.i)
})
}
}
func TestStack_IsEmpty(t *testing.T) {
type fields struct {
Elements []int
Max int
}
tests := []struct {
name string
fields fields
want bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &Stack{
Elements: tt.fields.Elements,
Max: tt.fields.Max,
}
if got := s.IsEmpty(); got != tt.want {
t.Errorf("Stack.IsEmpty() = %v, want %v", got, tt.want)
}
})
}
}
func TestStack_IsFull(t *testing.T) {
type fields struct {
Elements []int
Max int
}
tests := []struct {
name string
fields fields
want bool
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &Stack{
Elements: tt.fields.Elements,
Max: tt.fields.Max,
}
if got := s.IsFull(); got != tt.want {
t.Errorf("Stack.IsFull() = %v, want %v", got, tt.want)
}
})
}
}
func TestStack_Peep(t *testing.T) {
type fields struct {
Elements []int
Max int
}
tests := []struct {
name string
fields fields
want int
}{
// TODO: Add test cases.
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
s := &Stack{
Elements: tt.fields.Elements,
Max: tt.fields.Max,
}
if got := s.Peep(); got != tt.want {
t.Errorf("Stack.Peep() = %v, want %v", got, tt.want)
}
})
}
}