slice

Documentation

Index

• func Contains[T comparable](haystack []T, needle T) bool
• func ContainsCompare[T any](haystack []T, needle T, equal func(a, b T) bool) bool
• func Overlap[T comparable](a []T, b []T) bool
• func OverlapCompare[T any](a []T, b []T, equal func(a, b T) bool) bool
• func Unique[T comparable](a []T) []T

Functions

func Contains

func Contains[T comparable](haystack []T, needle T) bool

func ContainsCompare

func ContainsCompare[T any](haystack []T, needle T, equal func(a, b T) bool) bool

func Overlap

func Overlap[T comparable](a []T, b []T) bool

Overlap returns if the 2 sets have any overlap (element(s) in common)

func OverlapCompare

func OverlapCompare[T any](a []T, b []T, equal func(a, b T) bool) bool

func Unique

func Unique[T comparable](a []T) []T

Unique returns a new slice with all duplicate elements removed. This is a slow function on large lists. TODO: Sort elements and implement a faster search algorithm if we really start to use this.