algorithms/data-structure/queue/queue_test.go at master · TTWShell/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
62
63
package queue

import "testing"

func Test_Queue(t *testing.T) {
	queue := Constructor()

	if !queue.IsEmpty() || queue.len != 0 || queue.Len() != 0 {
		t.Fail()
	}

	queue.EnQueue(1)
	queue.EnQueue(2)
	queue.EnQueue(3)

	if queue.queue[0] != 1 || queue.queue[1] != 2 || queue.queue[2] != 3 {
		t.Fatal(queue)
	}

	if queue.Len() != 3 {
		t.Fatal(queue)
	}

	if queue.DeQueue() != 1 || queue.Len() != 2 {
		t.Fatal(queue)
	}

	if queue.Peek() != 2 {
		t.Fatal(queue)
	}

	queue.DeQueue()
	queue.DeQueue()

	if queue.Len() != 0 {
		t.Fatal(queue)
	}

	defer func() {
		if r := recover(); r == nil {
			t.Error("The code did not panic")
		} else {
			if r != "Queue is empty, cannot DeQueue." {
				t.Error(r)
			}
		}
	}()
	queue.DeQueue()
}

func Test_QueuePeek(t *testing.T) {
	queue := Constructor()
	defer func() {
		if r := recover(); r == nil {
			t.Error("The code did not panic")
		} else {
			if r != "Queue is empty, cannot DeQueue." {
				t.Error(r)
			}
		}
	}()
	queue.Peek()
}