blob: 739575f17d26291da7ac0c13d9322aba278f6411 (
plain)
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
|
// Copyright 2016 The Netstack Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Package ilist provides the implementation of intrusive linked lists.
package ilist
// Linker is the interface that objects must implement if they want to be added
// to and/or removed from List objects.
//
// N.B. When substituted in a template instantiation, Linker doesn't need to
// be an interface, and in most cases won't be.
type Linker interface {
Next() Linker
Prev() Linker
SetNext(Linker)
SetPrev(Linker)
}
// List is an intrusive list. Entries can be added to or removed from the list
// in O(1) time and with no additional memory allocations.
//
// The zero value for List is an empty list ready to use.
//
// To iterate over a list (where l is a List):
// for e := l.Front(); e != nil; e = e.Next() {
// // do something with e.
// }
type List struct {
head Linker
tail Linker
}
// Reset resets list l to the empty state.
func (l *List) Reset() {
l.head = nil
l.tail = nil
}
// Empty returns true iff the list is empty.
func (l *List) Empty() bool {
return l.head == nil
}
// Front returns the first element of list l or nil.
func (l *List) Front() Linker {
return l.head
}
// Back returns the last element of list l or nil.
func (l *List) Back() Linker {
return l.tail
}
// PushFront inserts the element e at the front of list l.
func (l *List) PushFront(e Linker) {
e.SetNext(l.head)
e.SetPrev(nil)
if l.head != nil {
l.head.SetPrev(e)
} else {
l.tail = e
}
l.head = e
}
// PushBack inserts the element e at the back of list l.
func (l *List) PushBack(e Linker) {
e.SetNext(nil)
e.SetPrev(l.tail)
if l.tail != nil {
l.tail.SetNext(e)
} else {
l.head = e
}
l.tail = e
}
// PushBackList inserts list m at the end of list l, emptying m.
func (l *List) PushBackList(m *List) {
if l.head == nil {
l.head = m.head
l.tail = m.tail
} else if m.head != nil {
l.tail.SetNext(m.head)
m.head.SetPrev(l.tail)
l.tail = m.tail
}
m.head = nil
m.tail = nil
}
// InsertAfter inserts e after b.
func (l *List) InsertAfter(b, e Linker) {
a := b.Next()
e.SetNext(a)
e.SetPrev(b)
b.SetNext(e)
if a != nil {
a.SetPrev(e)
} else {
l.tail = e
}
}
// InsertBefore inserts e before a.
func (l *List) InsertBefore(a, e Linker) {
b := a.Prev()
e.SetNext(a)
e.SetPrev(b)
a.SetPrev(e)
if b != nil {
b.SetNext(e)
} else {
l.head = e
}
}
// Remove removes e from l.
func (l *List) Remove(e Linker) {
prev := e.Prev()
next := e.Next()
if prev != nil {
prev.SetNext(next)
} else {
l.head = next
}
if next != nil {
next.SetPrev(prev)
} else {
l.tail = prev
}
}
// Entry is a default implementation of Linker. Users can add anonymous fields
// of this type to their structs to make them automatically implement the
// methods needed by List.
type Entry struct {
next Linker
prev Linker
}
// Next returns the entry that follows e in the list.
func (e *Entry) Next() Linker {
return e.next
}
// Prev returns the entry that precedes e in the list.
func (e *Entry) Prev() Linker {
return e.prev
}
// SetNext assigns 'entry' as the entry that follows e in the list.
func (e *Entry) SetNext(entry Linker) {
e.next = entry
}
// SetPrev assigns 'entry' as the entry that precedes e in the list.
func (e *Entry) SetPrev(entry Linker) {
e.prev = entry
}
|
