linked

Documentation

Overview

Package linked contains an implementation of a stack backed by a linked list.

Index

• type Stack
  • func New[T any]() *Stack[T]
  • func (s *Stack[T]) Empty() bool
  • func (s *Stack[T]) Len() int
  • func (s *Stack[T]) Peek() T
  • func (s *Stack[T]) Pop() T
  • func (s *Stack[T]) Push(x T)

Types

type Stack

type Stack[T any] struct {
	// contains filtered or unexported fields
}

Stack represents a stack.

func New

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

New returns an initialized stack.

func (*Stack[T]) Empty

func (s *Stack[T]) Empty() bool

Empty returns whether the stack is empty.

func (*Stack[T]) Len

func (s *Stack[T]) Len() int

Len returns the number of elements in the stack.

func (*Stack[T]) Peek

func (s *Stack[T]) Peek() T

Peek returns the element at the top of the stack. If the stack is empty - default value for element's type is returned.

func (*Stack[T]) Pop

func (s *Stack[T]) Pop() T

Pop removes and returns the element at the top of the stack. If the stack is empty - default value for element's type is returned.

func (*Stack[T]) Push

func (s *Stack[T]) Push(x T)

Push adds an element onto the top of the stack.