goscade/queue_test.go at main · ognick/goscade · 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
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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
package goscade

import (
	"testing"

	"github.com/stretchr/testify/assert"
)

// TestFIFOQueue_Push tests adding items to the end of a FIFO queue.
func TestFIFOQueue_Push(t *testing.T) {
	queue := &fifoQueue[int]{}

	queue.Push(1)
	queue.Push(2)
	queue.Push(3)

	assert.False(t, queue.IsEmpty())

	// Check that items are popped in FIFO order
	item, ok := queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 1, item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 2, item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 3, item)

	assert.True(t, queue.IsEmpty())
}

// TestFIFOQueue_Pop tests removing items from a FIFO queue in correct order.
func TestFIFOQueue_Pop(t *testing.T) {
	queue := &fifoQueue[string]{}

	// Test empty queue
	_, ok := queue.Pop()
	assert.False(t, ok)

	// Add items
	queue.Push("first")
	queue.Push("second")
	queue.Push("third")

	// Pop and verify order
	item, ok := queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "first", item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "second", item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "third", item)

	// Queue should be empty now
	_, ok = queue.Pop()
	assert.False(t, ok)
}

// TestFIFOQueue_IsEmpty tests the IsEmpty method of a FIFO queue.
func TestFIFOQueue_IsEmpty(t *testing.T) {
	queue := &fifoQueue[int]{}

	assert.True(t, queue.IsEmpty())

	queue.Push(1)
	assert.False(t, queue.IsEmpty())

	queue.Pop()
	assert.True(t, queue.IsEmpty())
}

// TestLIFOQueue_Push tests adding items to the end of a LIFO queue.
func TestLIFOQueue_Push(t *testing.T) {
	queue := &lifoQueue[int]{}

	queue.Push(1)
	queue.Push(2)
	queue.Push(3)

	assert.False(t, queue.IsEmpty())

	// Check that items are popped in LIFO order (stack behavior)
	item, ok := queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 3, item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 2, item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 1, item)

	assert.True(t, queue.IsEmpty())
}

// TestLIFOQueue_Pop tests removing items from a LIFO queue in LIFO order.
func TestLIFOQueue_Pop(t *testing.T) {
	queue := &lifoQueue[string]{}

	// Test empty queue
	_, ok := queue.Pop()
	assert.False(t, ok)

	// Add items
	queue.Push("first")
	queue.Push("second")
	queue.Push("third")

	// Pop and verify LIFO order (stack behavior)
	item, ok := queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "third", item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "second", item)

	item, ok = queue.Pop()
	assert.True(t, ok)
	assert.Equal(t, "first", item)

	// Queue should be empty now
	_, ok = queue.Pop()
	assert.False(t, ok)
}

// TestLIFOQueue_IsEmpty tests the IsEmpty method of a LIFO queue.
func TestLIFOQueue_IsEmpty(t *testing.T) {
	queue := &lifoQueue[int]{}

	assert.True(t, queue.IsEmpty())

	queue.Push(1)
	assert.False(t, queue.IsEmpty())

	queue.Pop()
	assert.True(t, queue.IsEmpty())
}

// TestQueue_Interface tests that both fifoQueue and lifoQueue implement the queue interface.
func TestQueue_Interface(t *testing.T) {
	var fifoQueue queue[int] = &fifoQueue[int]{}
	var lifoQueue queue[int] = &lifoQueue[int]{}

	// Test that FIFOQueue implements Queue interface
	fifoQueue.Push(1)
	fifoQueue.Push(2)

	item, ok := fifoQueue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 1, item)

	assert.False(t, fifoQueue.IsEmpty())

	// Test that LIFOQueue implements Queue interface
	lifoQueue.Push(1)
	lifoQueue.Push(2)

	item, ok = lifoQueue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 2, item) // LIFO order

	assert.False(t, lifoQueue.IsEmpty())
}

// TestQueue_ComplexTypes tests queue operations with complex types.
func TestQueue_ComplexTypes(t *testing.T) {
	type TestStruct struct {
		ID   int
		Name string
	}

	// Test fifoQueue with structs
	fifoQueue := &fifoQueue[TestStruct]{}

	fifoQueue.Push(TestStruct{ID: 1, Name: "first"})
	fifoQueue.Push(TestStruct{ID: 2, Name: "second"})

	item, ok := fifoQueue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 1, item.ID)
	assert.Equal(t, "first", item.Name)

	// Test lifoQueue with structs
	lifoQueue := &lifoQueue[TestStruct]{}

	lifoQueue.Push(TestStruct{ID: 1, Name: "first"})
	lifoQueue.Push(TestStruct{ID: 2, Name: "second"})

	item, ok = lifoQueue.Pop()
	assert.True(t, ok)
	assert.Equal(t, 2, item.ID)
	assert.Equal(t, "second", item.Name)
}