list

Documentation

Index

• type List
  • func New[V any]() *List[V]
  • func (l *List[V]) Len() int
  • func (l *List[V]) PushHead(v V)
  • func (l *List[V]) PushHeadNode(n *Node[V])
  • func (l *List[V]) PushTail(v V)
  • func (l *List[V]) PushTailNode(n *Node[V])
  • func (l *List[V]) Remove(n *Node[V])
  • func (l *List[V]) String() (str string)
• type Node
  • func (n *Node[V]) Each(fn func(val V))
  • func (n *Node[V]) ReverseEach(fn func(val V))

Types

type List

type List[V any] struct {
	Head, Tail *Node[V]
	// contains filtered or unexported fields
}

List is double linked list

func New

func New[V any]() *List[V]

New retruns a new an empty list

func (*List[V]) Len

func (l *List[V]) Len() int

Len returns length of List

func (*List[V]) PushHead

func (l *List[V]) PushHead(v V)

PushHead push value of element into the head of list

func (*List[V]) PushHeadNode

func (l *List[V]) PushHeadNode(n *Node[V])

PushHeadNode push element into the head of list

func (*List[V]) PushTail

func (l *List[V]) PushTail(v V)

PushTail push value of element into the tail of list

func (*List[V]) PushTailNode

func (l *List[V]) PushTailNode(n *Node[V])

PushTailNode push element into the tail of list

func (*List[V]) Remove

func (l *List[V]) Remove(n *Node[V])

Remove n form list

func (*List[V]) String

func (l *List[V]) String() (str string)

String returns a string with all the message of list, you can print it out to know all about the list.

type Node

type Node[V any] struct {
	Value      V
	Prev, Next *Node[V]
}

Node of list

func (*Node[V]) Each

func (n *Node[V]) Each(fn func(val V))

Each calls `fn` on each Node from n onward in the list

func (*Node[V]) ReverseEach

func (n *Node[V]) ReverseEach(fn func(val V))

ReverseEach calls `fn` on each Node from n backward in the list