Stack

Jan 25, 2024

Changes in this version

type ArrayStack

+ func NewArrayStack[T any](values ...T) *ArrayStack[T]

+ func (stack *ArrayStack[T]) Clear()

+ func (stack *ArrayStack[T]) IsEmpty() bool

+ func (stack *ArrayStack[T]) IsFull() bool

+ func (stack *ArrayStack[T]) Peek() T

+ func (stack *ArrayStack[T]) Pop() T

+ func (stack *ArrayStack[T]) Push(value T)

+ func (stack *ArrayStack[T]) Size() int

+ func (stack *ArrayStack[T]) String() string

+ func (stack *ArrayStack[T]) ToSlice() []T

type ErrEmptyStack

+ func NewErrEmptyStack(operation StackOperationType) *ErrEmptyStack

+ type ErrNegativeCapacity struct

+ func (e *ErrNegativeCapacity) Error() string

+ type ErrOutOfBoundsIterator struct

+ func (e *ErrOutOfBoundsIterator) Error() string

+ type ErrTooManyValues struct

+ func (e *ErrTooManyValues) Error() string

+ type LimitedArrayStack struct

+ func NewLimitedArrayStack[T any](capacity int, values ...T) (*LimitedArrayStack[T], error)

+ func (stack *LimitedArrayStack[T]) Clear()

+ func (stack *LimitedArrayStack[T]) IsEmpty() bool

+ func (stack *LimitedArrayStack[T]) IsFull() bool

+ func (stack *LimitedArrayStack[T]) Peek() T

+ func (stack *LimitedArrayStack[T]) Pop() T

+ func (stack *LimitedArrayStack[T]) Push(value T)

+ func (stack *LimitedArrayStack[T]) Size() int

+ func (stack *LimitedArrayStack[T]) String() string

+ func (stack *LimitedArrayStack[T]) ToSlice() []T

+ type LimitedLinkedStack struct

+ func NewLimitedLinkedStack[T any](capacity int, values ...T) (*LimitedLinkedStack[T], error)

+ func (stack *LimitedLinkedStack[T]) Clear()

+ func (stack *LimitedLinkedStack[T]) IsEmpty() bool

+ func (stack *LimitedLinkedStack[T]) IsFull() bool

+ func (stack *LimitedLinkedStack[T]) Peek() T

+ func (stack *LimitedLinkedStack[T]) Pop() T

+ func (stack *LimitedLinkedStack[T]) Push(value T)

+ func (stack *LimitedLinkedStack[T]) Size() int

+ func (stack *LimitedLinkedStack[T]) String() string

+ func (stack *LimitedLinkedStack[T]) ToSlice() []T

type LinkedStack

+ func NewLinkedStack[T any](values ...T) *LinkedStack[T]

+ func (stack *LinkedStack[T]) Clear()

+ func (stack *LinkedStack[T]) IsEmpty() bool

+ func (stack *LinkedStack[T]) IsFull() bool

+ func (stack *LinkedStack[T]) Peek() T

+ func (stack *LinkedStack[T]) Pop() T

+ func (stack *LinkedStack[T]) Push(value T)

+ func (stack *LinkedStack[T]) Size() int

+ func (stack *LinkedStack[T]) String() string

+ func (stack *LinkedStack[T]) ToSlice() []T

+ type StackIterator struct

+ func NewStackIterator[T any](stack Stacker[T]) *StackIterator[T]

+ func (iterator *StackIterator[T]) GetNext() T

+ func (iterator *StackIterator[T]) HasNext() bool

+ type StackOperationType int

+ const Peek

+ const Pop

+ func (qot StackOperationType) String() string

+ type Stacker interface

+ Clear func()

+ IsEmpty func() bool

+ IsFull func() bool

+ Peek func() T

+ Pop func() T

+ Push func(value T)

+ Size func() int

+ ToSlice func() []T

Jan 12, 2024

Changes in this version

type Stack

+ func (stack *Stack[T]) Cleanup()

Jan 7, 2024

Changes in this version

+ type StackImplementationType int

+ const ArrayStack

+ const LinkedStack

+ func (implementation StackImplementationType) String() string

Jan 6, 2024

Changes in this version

+ const ARRAY

+ const LINKED

+ var StackHead string = " | →"

+ var StackSep string = " | "

+ type ErrEmptyStack struct

+ func (e ErrEmptyStack) Error() string

+ type ErrFullStack struct

+ func (e ErrFullStack) Error() string

+ type Stack struct

+ func NewLimitedStack[T any](implementation, capacity int, values ...T) Stack[T]

+ func NewStack[T any](implementation int, values ...T) Stack[T]

+ func (stack *Stack[T]) Clear()

+ func (stack *Stack[T]) Pop() T

+ func (stack *Stack[T]) Push(value T)

+ func (stack *Stack[T]) String() string

+ func (stack *Stack[T]) ToSlice() []T

+ func (stack Stack[T]) IsEmpty() bool

+ func (stack Stack[T]) IsFull() bool

+ func (stack Stack[T]) Peek() T

+ func (stack Stack[T]) Size() int