A quick and dirty implementation of generic Stacks in Golang.

stack.go

package containers

import (
	"fmt"
)

type Stack[T any] []T

func (s *Stack[T]) Push(val T) {
	*s = append(*s, val)
}

func (s *Stack[T]) Pop() (T, error) {
	if len(*s) == 0 {
		var defaultValue T
		return defaultValue, fmt.Errorf("can't pop from an empty stack")
	}
	top := (*s)[s.Size()-1]
	*s = (*s)[:s.Size()-1]
	return top, nil
}

func (s *Stack[T]) Size() int {
	return len(*s)
}

func (s *Stack[T]) IsEmpty() bool {
	return s.Size() == 0
}