list

Documentation

Index

• func ContainerOf(in unsafe.Pointer, offset uintptr) unsafe.Pointer
• type Node
  • func (n *Node) Empty() bool
  • func (n *Node) Init() *Node
  • func (n *Node) Insert(head *Node)
  • func (n *Node) InsertToTail(head *Node)
  • func (n *Node) IsLast(head *Node) bool
  • func (n *Node) IsSingular() bool
  • func (n *Node) Join(head *Node)
  • func (n *Node) Move(head *Node)
  • func (n *Node) MoveToTail(head *Node)
  • func (n *Node) Next() *Node
  • func (n *Node) Remove()
  • func (n *Node) Replace(node *Node)

Functions

func ContainerOf

func ContainerOf(in unsafe.Pointer, offset uintptr) unsafe.Pointer

Types

type Node

type Node struct {
	// contains filtered or unexported fields
}

func (*Node) Empty

func (n *Node) Empty() bool

Tests whether a list `n` is empty

func (*Node) Init

func (n *Node) Init() *Node

Init Node internal param

func (*Node) Insert

func (n *Node) Insert(head *Node)

Insert node at head of list `head`

func (*Node) InsertToTail

func (n *Node) InsertToTail(head *Node)

Insert node at tail of list `head`

func (*Node) IsLast

func (n *Node) IsLast(head *Node) bool

Tests whether `n` is the last entry in list `head`

func (*Node) IsSingular

func (n *Node) IsSingular() bool

Tests whether a list `n` has just one entry.

func (*Node) Join

func (n *Node) Join(head *Node)

List `n` join list head, add `head` to head of `n`

func (*Node) Move

func (n *Node) Move(head *Node)

Move node from old entry to head of `head`

func (*Node) MoveToTail

func (n *Node) MoveToTail(head *Node)

Move node from old entry to tail of `head`

func (*Node) Next

func (n *Node) Next() *Node

Get next entry of node `n`

func (*Node) Remove

func (n *Node) Remove()

Remove node by itself

func (*Node) Replace

func (n *Node) Replace(node *Node)

Replace old entry `n` by new one `node`