slices

package

v0.15.0-pre.1 Latest Latest Go to latest Published: Jan 5, 2024 License: BSD-3-Clause Imports: 0 Imported by: 0

Documentation ¶

Index ¶

func Concat[S ~[]E, E any](slices ...S) S
func Contains[S ~[]E, E comparable](slice S, x E) bool
func ContainsFunc[S ~[]E, E any](s S, f func(E) bool) bool
func Grow[S ~[]E, E any](s S, n int) S
func IndexFunc[S ~[]E, E any](s S, f func(E) bool) int

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func Concat ¶

func Concat[S ~[]E, E any](slices ...S) S

Concat returns a new slice concatenating the passed in slices. TODO(rfindley): use go1.22 slices.Contains.

func Contains ¶

func Contains[S ~[]E, E comparable](slice S, x E) bool

Contains reports whether x is present in slice. TODO(adonovan): use go1.19 slices.Contains.

func ContainsFunc ¶

func ContainsFunc[S ~[]E, E any](s S, f func(E) bool) bool

ContainsFunc reports whether at least one element e of s satisfies f(e). TODO(adonovan): use go1.19 slices.ContainsFunc.

func Grow ¶

func Grow[S ~[]E, E any](s S, n int) S

Grow increases the slice's capacity, if necessary, to guarantee space for another n elements. After Grow(n), at least n elements can be appended to the slice without another allocation. If n is negative or too large to allocate the memory, Grow panics. TODO(rfindley): use go1.19 slices.Grow.

func IndexFunc ¶

func IndexFunc[S ~[]E, E any](s S, f func(E) bool) int

IndexFunc returns the first index i satisfying f(s[i]), or -1 if none do. TODO(adonovan): use go1.19 slices.IndexFunc.

Types ¶

This section is empty.

Source Files ¶

View all Source files

slices.go

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL