linkedlist

package

v1.1.4 Latest Latest Go to latest Published: May 5, 2024 License: MIT Imports: 0 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type Element[T any] struct {
	Data T
	Next *Element[T]
	Prev *Element[T]
}

func NewElement[T any](data T) *Element[T]

type LinkedList[T any] struct {
	Head *Element[T]
	Tail *Element[T]
	// contains filtered or unexported fields
}

LinkedList represents a doubly linked list.

func New[T any]() *LinkedList[T]

func (l *LinkedList[T]) Clear()

Clear removes all nodes from the list, making it empty.

func (l *LinkedList[T]) Delete(ln *Element[T])

Delete removes a specific node from the list.

func (l *LinkedList[T]) DeleteAtHead()

DeleteAtHead deletes the node at the head of the list.

func (l *LinkedList[T]) DeleteAtTail()

DeleteAtTail deletes the node at the tail of the list.

func (l *LinkedList[T]) InsertAfter(data T, at *Element[T]) *Element[T]

func (l *LinkedList[T]) InsertAtHead(data T) *Element[T]

InsertAtHead inserts a new node at the head of the list.

func (l *LinkedList[T]) InsertAtTail(data T) *Element[T]

InsertAtTail appends a new node at the tail of the list.

func (l *LinkedList[T]) InsertBefore(data T, at *Element[T]) *Element[T]

func (l *LinkedList[T]) Length() int

Length returns the number of nodes in the list.

func (l *LinkedList[T]) Values() []T

Values returns a slice of values in the list.