-
Notifications
You must be signed in to change notification settings - Fork 2
/
deque_test.go
121 lines (104 loc) · 3.02 KB
/
deque_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
// Copyright (c) 2022 Marin Atanasov Nikolov <dnaeon@gmail.com>
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer
// in this position and unchanged.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
package deque_test
import (
"testing"
"gopkg.in/dnaeon/go-deque.v1"
)
func TestDeque(t *testing.T) {
deque := deque.New[int]()
if deque.Length() != 0 {
t.Fatal("deque length should be 0")
}
// Insert a few items. Resulting deque is: 5 4 1 2 3
deque.PushBack(1)
deque.PushBack(2)
deque.PushBack(3) // Back item
deque.PushFront(4)
deque.PushFront(5) // Front item
if deque.IsEmpty() {
t.Fatal("deque should not be empty")
}
if deque.Length() != 5 {
t.Fatal("deque length should be 5")
}
backValue := 3
back, err := deque.PeekBack()
if err != nil {
t.Fatal(err)
}
if back != backValue {
t.Fatalf("item at the back should be %d", backValue)
}
frontValue := 5
front, err := deque.PeekFront()
if err != nil {
t.Fatal(err)
}
if front != frontValue {
t.Fatalf("item at the front should be %d", frontValue)
}
// Consume all items - front to back
dequeItems := []int{5, 4, 1, 2, 3}
i := 0
for !deque.IsEmpty() {
want := dequeItems[i]
got, err := deque.PopFront()
if err != nil {
t.Fatal(err)
}
if want != got {
t.Fatalf("want %d, got %d", want, got)
}
i++
}
// Deque should be empty at this point
if !deque.IsEmpty() {
t.Fatal("deque should be empty")
}
if deque.Length() != 0 {
t.Fatal("deque length should be 0")
}
}
func TestPopBack(t *testing.T) {
deque := deque.New[int]()
// Deque[int]: 1, 2, 3
deque.PushBack(1)
deque.PushBack(2)
deque.PushBack(3)
// Consume all items - back to front
dequeItems := []int{3, 2, 1}
i := 0
for !deque.IsEmpty() {
want := dequeItems[i]
got, err := deque.PopBack()
if err != nil {
t.Fatal(err)
}
if want != got {
t.Fatalf("want %d, got %d", want, got)
}
i++
}
}