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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
// Copyright 2018 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package ilist
import (
"runtime"
"testing"
)
type testEntry struct {
Entry
value int
}
type direct struct {
directEntry
value int
}
func verifyEquality(t *testing.T, entries []testEntry, l *List) {
i := 0
for it := l.Front(); it != nil; it = it.Next() {
e := it.(*testEntry)
if e != &entries[i] {
_, file, line, _ := runtime.Caller(1)
t.Errorf("Wrong entry at index (%s:%d): %v", file, line, i)
return
}
i++
}
if i != len(entries) {
_, file, line, _ := runtime.Caller(1)
t.Errorf("Wrong number of entries (%s:%d)", file, line)
return
}
i = 0
for it := l.Back(); it != nil; it = it.Prev() {
e := it.(*testEntry)
if e != &entries[len(entries)-1-i] {
_, file, line, _ := runtime.Caller(1)
t.Errorf("Wrong entry at index (%s:%d): %v", file, line, i)
return
}
i++
}
if i != len(entries) {
_, file, line, _ := runtime.Caller(1)
t.Errorf("Wrong number of entries (%s:%d)", file, line)
return
}
}
func TestZeroEmpty(t *testing.T) {
var l List
if l.Front() != nil {
t.Error("Front is non-nil")
}
if l.Back() != nil {
t.Error("Back is non-nil")
}
}
func TestPushBack(t *testing.T) {
var l List
// Test single entry insertion.
var entry testEntry
l.PushBack(&entry)
e := l.Front().(*testEntry)
if e != &entry {
t.Error("Wrong entry returned")
}
// Test inserting 100 entries.
l.Reset()
var entries [100]testEntry
for i := range entries {
l.PushBack(&entries[i])
}
verifyEquality(t, entries[:], &l)
}
func TestPushFront(t *testing.T) {
var l List
// Test single entry insertion.
var entry testEntry
l.PushFront(&entry)
e := l.Front().(*testEntry)
if e != &entry {
t.Error("Wrong entry returned")
}
// Test inserting 100 entries.
l.Reset()
var entries [100]testEntry
for i := range entries {
l.PushFront(&entries[len(entries)-1-i])
}
verifyEquality(t, entries[:], &l)
}
func TestRemove(t *testing.T) {
// Remove entry from single-element list.
var l List
var entry testEntry
l.PushBack(&entry)
l.Remove(&entry)
if l.Front() != nil {
t.Error("List is empty")
}
var entries [100]testEntry
// Remove single element from lists of lengths 2 to 101.
for n := 1; n <= len(entries); n++ {
for extra := 0; extra <= n; extra++ {
l.Reset()
for i := 0; i < n; i++ {
if extra == i {
l.PushBack(&entry)
}
l.PushBack(&entries[i])
}
if extra == n {
l.PushBack(&entry)
}
l.Remove(&entry)
verifyEquality(t, entries[:n], &l)
}
}
}
func TestReset(t *testing.T) {
var l List
// Resetting list of one element.
l.PushBack(&testEntry{})
if l.Front() == nil {
t.Error("List is empty")
}
l.Reset()
if l.Front() != nil {
t.Error("List is not empty")
}
// Resetting list of 10 elements.
for i := 0; i < 10; i++ {
l.PushBack(&testEntry{})
}
if l.Front() == nil {
t.Error("List is empty")
}
l.Reset()
if l.Front() != nil {
t.Error("List is not empty")
}
// Resetting empty list.
l.Reset()
if l.Front() != nil {
t.Error("List is not empty")
}
}
func BenchmarkIterateForward(b *testing.B) {
var l List
for i := 0; i < 1000000; i++ {
l.PushBack(&testEntry{value: i})
}
for i := b.N; i > 0; i-- {
tmp := 0
for e := l.Front(); e != nil; e = e.Next() {
tmp += e.(*testEntry).value
}
}
}
func BenchmarkIterateBackward(b *testing.B) {
var l List
for i := 0; i < 1000000; i++ {
l.PushBack(&testEntry{value: i})
}
for i := b.N; i > 0; i-- {
tmp := 0
for e := l.Back(); e != nil; e = e.Prev() {
tmp += e.(*testEntry).value
}
}
}
func BenchmarkDirectIterateForward(b *testing.B) {
var l directList
for i := 0; i < 1000000; i++ {
l.PushBack(&direct{value: i})
}
for i := b.N; i > 0; i-- {
tmp := 0
for e := l.Front(); e != nil; e = e.Next() {
tmp += e.value
}
}
}
func BenchmarkDirectIterateBackward(b *testing.B) {
var l directList
for i := 0; i < 1000000; i++ {
l.PushBack(&direct{value: i})
}
for i := b.N; i > 0; i-- {
tmp := 0
for e := l.Back(); e != nil; e = e.Prev() {
tmp += e.value
}
}
}
|
