Documentation
¶
Overview ¶
Package list implements a doubly linked list.
To iterate over a list (where l is a *List):
for e := l.Front(); e != nil; e = e.Next() {
// do something with e.Value
}
Index ¶
- type Element
- type List
- func (l *List) Back() *Element
- func (l *List) Front() *Element
- func (l *List) Init() *List
- func (l *List) Len() int
- func (l *List) MergeBack(l1 *List)
- func (l *List) Next(e *Element) *Element
- func (l *List) PushBack(v interface{}) *Element
- func (l *List) PushFront(v interface{}) *Element
- func (l *List) Remove(e *Element) interface{}
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Element ¶
type Element struct {
// The value stored with this element.
Value interface{}
// contains filtered or unexported fields
}
Element is an element of a linked list.
type List ¶
type List struct {
// contains filtered or unexported fields
}
List represents a doubly linked list. The zero value for List is an empty list ready to use.
func (*List) PushBack ¶
PushBack inserts a new element e with value v at the back of list l and returns e.
Source Files
Click to show internal directories.
Click to hide internal directories.