collections

Documentation

Index

• Variables
• func FindFirst[T any](collection []T, condition func(T) bool) (*T, error)
• func Map[T any, R any](collection []T, mapper func(T) R) []R
• func MapErr[T any, R any](collection []T, mapper func(T) (R, error)) ([]R, error)
• func MergeMaps[M ~map[K]V, K comparable, V any](src ...M) M
• type Queue
  • func NewQueue[T any]() Queue[T]
  • func (s *Queue[T]) Head() *T
  • func (s *Queue[T]) Pop() *T
  • func (s *Queue[T]) Push(elem T)

Variables

var ErrObjectNotFound = errors.New("object does not exist")

Functions

func FindFirst

func FindFirst[T any](collection []T, condition func(T) bool) (*T, error)

func Map

func Map[T any, R any](collection []T, mapper func(T) R) []R

func MapErr

func MapErr[T any, R any](collection []T, mapper func(T) (R, error)) ([]R, error)

func MergeMaps

func MergeMaps[M ~map[K]V, K comparable, V any](src ...M) M

TODO(SNOW-1479870): Test MergeMaps takes any number of maps (of the same type) and concatenates them. In case of key collision, the value will be selected from the map that is provided later in the src function parameter.

Types

type Queue

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

func NewQueue

func NewQueue[T any]() Queue[T]

func (*Queue[T]) Head

func (s *Queue[T]) Head() *T

func (*Queue[T]) Pop

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

func (*Queue[T]) Push

func (s *Queue[T]) Push(elem T)