Versions in this module Expand all Collapse all v0 v0.1.0 Feb 16, 2026 Changes in this version + var ErrArgumentIsNil = errs.New("argument is nil") + func All[S ~[]T, T any](xs S, predicate func(T) bool) bool + func Any[S ~[]T, T any](xs S, predicate func(T) bool) bool + func Combinations[S ~[]T, T any](s S, k uint) iter.Seq[S] + func ContainsFunc[S ~[]T, T any](xs S, x T, equal func(T, T) bool) bool + func CountUniqueFunc[S ~[]T, T any](xs S, equal func(T, T) bool) int + func CountUnique[S ~[]T, T comparable](xs S) int + func Count[S ~[]T, T any](xs S, predicate func(T) bool) int + func Fill[T any](s []T, x T) + func Filter[S ~[]T, T any](xs S, predicate func(T) bool) S + func FoldOrError[T, U any](f func(acc U, x T) (U, error), initial U, rest ...T) (U, error) + func Fold[T, U any](f func(acc U, x T) U, initial U, rest ...T) U + func IsAllUniqueFunc[S ~[]T, T any](xs S, equal func(T, T) bool) bool + func IsAllUnique[S ~[]T, T comparable](xs S) bool + func IsSubSetFunc[SB, SP ~[]T, T any](sub SB, sup SP, equal func(T, T) bool) bool + func IsSubSet[SB, SP ~[]T, T comparable](sub SB, sup SP) bool + func IsSuperSet[T comparable](ss, s []T) bool + func KCoveringCombinations[S ~[]T, T any](s S, k uint) iter.Seq[S] + func MapCast[S ~[]TOut, TOut any, SIn ~[]TIn, TIn any](in SIn, f func(TIn) TOut) S + func MapOrError[SIn ~[]TIn, TIn, TOut any](in SIn, f func(TIn) (TOut, error)) (out []TOut, err error) + func Map[TOut any, SIn ~[]TIn, TIn any](in SIn, f func(TIn) TOut) []TOut + func PadToLeftWith[S ~[]T, T any](xs S, padLength int, pad T) S + func PadToLeft[S ~[]T, T any](xs S, padLength int) S + func PadToRightWith[S ~[]T, T any](xs S, padLength int, pad T) S + func PadToRight[S ~[]T, T any](xs S, padLength int) S + func Reduce[S ~[]T, T any](xs S, initial T, f func(T, T) T) T + func Repeat[S ~[]T, T any](x T, n int) S + func Reverse[S ~[]T, T any](xs S) S + func Reversed[S ~[]T, T any](xs S) S + func Shuffle[S ~[]T, T any](xs S, prng io.Reader) (S, error) + func Shuffled[S ~[]T, T any](xs S, prng io.Reader) (S, error)