Documentation ¶

This section is empty.

This section is empty.

This section is empty.

type LinkedList[T any] struct {
	Size int
	// contains filtered or unexported fields
}

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

New constructs and returns an empty circularly linked-list. time-complexity: O(1)

func (c *LinkedList[T]) AddFirst(data T)

AddFirst adds a new node to the beginning of the list. time-complexity: O(1)

func (c *LinkedList[T]) AddLast(data T)

AddLast adds a new node to the end of the list. time-complexity: O(1)

func (c *LinkedList[T]) First() (data T, ok bool)

First returns the first element of the list. It returns false if the list is empty. time-complexity: O(1)

func (c *LinkedList[T]) IsEmpty() bool

IsEmpty returns true if the linked-list doesn't contain any nodes. time-complexity: O(1)

func (c *LinkedList[T]) Last() (data T, ok bool)

Last returns the last element of the list. It returns false if the list is empty. time-complexity: O(1)

func (c *LinkedList[T]) RemoveFirst() (val T, ok bool)

RemoveFirst removes and returns the first element of the list. It returns false if the list is empty. time-complexity: O(1)

func (c *LinkedList[T]) RemoveLast() (val T, ok bool)

RemoveLast removes and returns the last element of the list. It returns false if the list empty. time-complexity: O(n)

func (c *LinkedList[T]) Rotate()

Rotate rotates the list. It moves the first element to the end. time-complexity: O(1)

func (c *LinkedList[T]) String() string

String returns the string representation of the list. time-complexity: O(n)

type Node[T any] struct {
	Data T
	Next *Node[T]
}

func (n *Node[T]) String() string

String returns the string representation of the node's data. time-complexity: O(1)

Source Files ¶