golang源码包中container/list实际上是一个双向链表
提供链表的一些基本操作，下面就结合定义和接口进行下说明
1. 定义
// Element is an element of a linked list.
type Element struct {
// Next and previous pointers in the doubly-linked list of elements.
// To simplify the implementation, internally a list l is implemented
// as a ring, such that &l.root is both the next element of the last
// list element (l.Back()) and the previous element of the first list
// element (l.Front()).
next, prev *Element // The list to which this element belongs.
list *List // The value stored with this element.
Value interface{}
}
Element是数据节点， 提供Next()/Prev()这类常规操作
// List represents a doubly linked list.
// The zero value for List is an empty list ready to use.
type List struct {
root Element // sentinel list element, only &root, root.prev, and root.next are used
len int // current list length excluding (this) sentinel element
}
List双向链表定义
2. 接口说明
func New() *List //创建一个双向链表
func (l *List) Back() *Element //返回双向链表上一个元素
func (l *List) Front() *Element //返回双向链表下一个元素
func (l *List) Init() *List //初始化链表
func (l *List) InsertAfter(v interface{}, mark *Element) *Element //在指定节点后插入，成功返回插入节点的指针，失败返回nil, 时间复杂度O(1)
func (l *List) InsertBefore(v interface{}, mark *Element) *Element //在指定节点之前插入， 成功返回插入节点的指针，失败返回nil, 时间复杂度O(1)
func (l *List) Len() int //返回链表长度，时间复杂度O(1)
func (l *List) MoveAfter(e, mark *Element) //移动节点e到mark节点之后，时间复杂度O(1), 处理方式：先删除然后再插入
func (l *List) MoveBefore(e, mark *Element) //移动节点e到mark节点之前，时间复杂度O(1), 处理方式：先删除然后再插入
func (l *List) MoveToBack(e *Element) //移动节点e到链表的尾部
func (l *List) MoveToFront(e *Element) //移动节点e到链表的头部
func (l *List) PushBack(v interface{}) *Element //在链表尾部追加值为v的新节点
func (l *List) PushBackList(other *List) //把链表other所有节点追加到当前链表的尾部
func (l *List) PushFront(v interface{}) *Element //在链表的头部插入新节点
func (l *List) PushFrontList(other *List) //把链表other所有节点追加到当前链表头部
func (l *List) Remove(e *Element) interface{} //删除指定节点
3. 实例
// Create a new list and put some numbers in it.
l := list.New()
e4 := l.PushBack()
e1 := l.PushFront()
l.InsertBefore(, e4)
l.InsertAfter(, e1) // Iterate through list and print its contents.
for e := l.Front(); e != nil; e = e.Next() {
fmt.Println(e.Value)
} Output: