deque

package

v2.3.0 Latest Latest Go to latest Published: Dec 22, 2025 License: Apache-2.0 Imports: 2 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Linked[K comparable, V any] struct {
	// contains filtered or unexported fields
}

func NewLinked[K comparable, V any](isExp bool) *Linked[K, V]

func (d *Linked[K, V]) All() iter.Seq[node.Node[K, V]]

func (d *Linked[K, V]) Backward() iter.Seq[node.Node[K, V]]

func (d *Linked[K, V]) Clear()

func (d *Linked[K, V]) Contains(n node.Node[K, V]) bool

func (d *Linked[K, V]) Delete(n node.Node[K, V])

func (d *Linked[K, V]) Head() node.Node[K, V]

func (d *Linked[K, V]) IsEmpty() bool

func (d *Linked[K, V]) Len() int

func (d *Linked[K, V]) MoveToBack(n node.Node[K, V])

func (d *Linked[K, V]) MoveToFront(n node.Node[K, V])

func (d *Linked[K, V]) NotContains(n node.Node[K, V]) bool

func (d *Linked[K, V]) PopFront() node.Node[K, V]

func (d *Linked[K, V]) PushBack(n node.Node[K, V])

func (d *Linked[K, V]) PushFront(n node.Node[K, V])

func (d *Linked[K, V]) Tail() node.Node[K, V]

func (d *Linked[K, V]) UpdateNode(n, old node.Node[K, V])

Path	Synopsis
queue