list

package
Version: v0.0.0-...-be291eb Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: May 4, 2022 License: MIT Imports: 0 Imported by: 0

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
}
Example
package main

import (
	"container/list"
	"fmt"
)

func main() {
	// Create a new list and put some numbers in it.
	l := list.New()
	e4 := l.PushBack(4)
	e1 := l.PushFront(1)
	l.InsertBefore(3, e4)
	l.InsertAfter(2, e1)

	// Iterate through list and and print its contents.
	for e := l.Front(); e != nil; e = e.Next() {
		fmt.Println(e.Value)
	}

}
Output:

1
2
3
4

Index

Examples

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type A

type A int

An A is the element of the List

template type List(A)

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 NewList

func NewList() *List

NewList returns an initialized list.

func (*List) Back

func (l *List) Back() *ListElement

Back returns the last element of list l or nil.

func (*List) Front

func (l *List) Front() *ListElement

Front returns the first element of list l or nil

func (*List) Init

func (l *List) Init() *List

Init initializes or clears list l.

func (*List) InsertAfter

func (l *List) InsertAfter(v A, mark *ListElement) *ListElement

InsertAfter inserts a new element e with value v immediately after mark and returns e. If mark is not an element of l, the list is not modified.

func (*List) InsertBefore

func (l *List) InsertBefore(v A, mark *ListElement) *ListElement

InsertBefore inserts a new element e with value v immediately before mark and returns e. If mark is not an element of l, the list is not modified.

func (*List) Len

func (l *List) Len() int

Len returns the number of elements of list l.

func (*List) MoveToBack

func (l *List) MoveToBack(e *ListElement)

MoveToBack moves element e to the back of list l. If e is not an element of l, the list is not modified.

func (*List) MoveToFront

func (l *List) MoveToFront(e *ListElement)

MoveToFront moves element e to the front of list l. If e is not an element of l, the list is not modified.

func (*List) PushBack

func (l *List) PushBack(v A) *ListElement

PushBack inserts a new element e with value v at the back of list l and returns e.

func (*List) PushBackList

func (l *List) PushBackList(other *List)

PushBackList inserts a copy of an other list at the back of list l. The lists l and other may be the same.

func (*List) PushFront

func (l *List) PushFront(v A) *ListElement

PushFront inserts a new element e with value v at the front of list l and returns e.

func (*List) PushFrontList

func (l *List) PushFrontList(other *List)

PushFrontList inserts a copy of an other list at the front of list l. The lists l and other may be the same.

func (*List) Remove

func (l *List) Remove(e *ListElement) A

Remove removes e from l if e is an element of list l. It returns the element value e.Value.

type ListElement

type ListElement struct {

	// The value stored with this element.
	Value A
	// contains filtered or unexported fields
}

ListElement is an element of a linked list.

func (*ListElement) Next

func (e *ListElement) Next() *ListElement

Next returns the next list element or nil.

func (*ListElement) Prev

func (e *ListElement) Prev() *ListElement

Prev returns the previous list element or nil.

Source Files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL