Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
- API
  
  Reference documentation for the pkg.go.dev API
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

slicesutils

package module

Go to main page

Versions in this module

v0

v0.4.0

May 23, 2025

Changes in this version

+ func ExpandSeq[I any, O any](inputSeq iter.Seq[I], reduceFunc func(I) []O) iter.Seq[O]

v0.3.0

May 16, 2025

Changes in this version

+ func GroupBySeq[I any, K comparable](inputSeq iter.Seq[I], keyFunc func(I) K) iter.Seq2[K, iter.Seq[I]]

v0.2.0

Apr 24, 2025

Changes in this version

+ func AllSeq[I any](inputSeq iter.Seq[I], allFunc func(I) bool) bool

+ func AnySeq[I any](inputSeq iter.Seq[I], anyFunc func(I) bool) bool

+ func CompareSeq[I comparable](a, b iter.Seq[I]) bool

+ func ContainsSeq[I comparable](inputSeq iter.Seq[I], element I) bool

+ func DifferenceSeq[I comparable](a, b iter.Seq[I]) iter.Seq[I]

+ func DistinctSeq[I comparable](inputSeq iter.Seq[I]) iter.Seq[I]

+ func Ennumerate[I any](inputSeq iter.Seq[I]) iter.Seq2[int, I]

+ func FilterSeq[I any](inputSeq iter.Seq[I], filterFunc func(I) bool) iter.Seq[I]

+ func FindIndexSeq[I any](inputSeq iter.Seq[I], findFunc func(I) bool) (foundIndex int, didFind bool)

+ func FindSeq[I any](inputSeq iter.Seq[I], findFunc func(I) bool) (foundItem I, didFind bool)

+ func IntersectionSeq[I comparable](inputSeq1, inputSeq2 iter.Seq[I]) iter.Seq[I]

+ func MapSeq[I any, O any](inputSeq iter.Seq[I], mapFunc func(I) O) iter.Seq[O]

+ func MaxFunc[T any](max func(T, T) T, elements ...T) T

+ func MaxSeqFunc[I any](inputSeq iter.Seq[I], maxFunc func(I, I) I) I

+ func MaxSeq[I cmp.Ordered](inputSeq iter.Seq[I]) I

+ func ReduceSeq[I any, O any](inputSeq iter.Seq[I], reduceFunc func(O, I) O, initialValue O) O

+ func RemoveElementSeq[I comparable](inputSeq iter.Seq[I], element I, occurrencesToDelete int) iter.Seq[I]

+ func RemoveElementsSeq[I comparable](inputSeq iter.Seq[I], elements ...I) iter.Seq[I]

+ func SafeFindSeq[I any](inputSeq iter.Seq[I], findFunc func(I) (bool, error)) (foundItem I, didFind bool, err error)

+ func SafeMapSeq[I any, O any](inputSeq iter.Seq[I], mapFunc func(I) (O, error)) iter.Seq[O]

+ func SafeReduceSeq[I any, O any](inputSeq iter.Seq[I], reduceFunc func(O, I) (O, error), initialValue O) (O, error)

+ func UnionSeq[I comparable](inputSeq1, inputSeq2 iter.Seq[I]) iter.Seq[I]

v0.1.3

Mar 28, 2025

Changes in this version

+ func SafeExcecuteWithStackTrace[T_out any](fn func() (T_out, error)) (output T_out, err error)

v0.1.2

Mar 28, 2025

v0.1.1

Mar 26, 2025

Changes in this version

+ func All[I any, S ~[]I](slice S, predicate func(I) bool) bool

+ func Any[I any, S ~[]I](slice S, predicate func(I) bool) bool

+ func Chunk[I any, S ~[]I](slice S, chunkSize int) []S

+ func Compare[I comparable, S ~[]I](a, b S) bool

+ func Contains[I comparable, S ~[]I](slice S, element I) bool

+ func Difference[I comparable, S ~[]I](a, b S) S

+ func Distinct[I comparable, S ~[]I](slice S) S

+ func Filter[I any, S ~[]I](inputSlice S, filterFunc func(I) bool) S

+ func FindIndex[I any, S ~[]I](inputSlice S, findFunc func(I) bool) int

+ func Find[I any, S ~[]I](inputSlice S, findFunc func(I) bool) (foundItem I, didFind bool)

+ func Intersection[I comparable, S ~[]I](a, b S) S

+ func Map[I any, O any, S ~[]I](inputSlice S, mapFunc func(I) O) []O

+ func Max(elements ...int) int

+ func ParallelForEach[I any, S ~[]I](inputSlice S, forEachFunc func(I))

+ func ParallelMap[I any, O any, S ~[]I](inputSlice S, mapFunc func(I) O) []O

+ func Reduce[I any, O any, S ~[]I](inputSlice S, reduceFunc func(O, I) O, initialValue O) O

+ func RemoveElement[I comparable, S ~[]I](slice S, element I, occurrencesToDelete *int) S

+ func RemoveElements[I comparable, S ~[]I](slice S, elements ...I) S

+ func RemoveFirstOccurrence[I comparable, S ~[]I](slice S, element I) S

+ func Reverse[I any, S ~[]I](slice S) S

+ func SafeExcecute[T_out any](fn func() (T_out, error)) (output T_out, err error)

+ func SafeFind[I any, S ~[]I](inputSlice S, findFunc func(I) (bool, error)) (foundItem I, didFind bool, err error)

+ func SafeMap[I any, O any, S ~[]I](inputSlice S, mappingFunc func(I) (O, error)) ([]O, error)

+ func SafeReduce[I any, O any, S ~[]I](inputSlice S, reduceFunc func(O, I) (O, error), initialValue O) (O, error)

+ func Sort[I any, S ~[]I](slice S, less func(i, j I) bool) S

+ func Union[I comparable, S ~[]I](a, b S) S

+ func UniqueItemsById[Id comparable, I identifiable[Id], S ~[]I](slice S) S

+ func WeightedSort[I any, W cmp.Ordered, S ~[]I](slice S, getWeighfn func(I) W, less func(i, j I) bool) S