Compare commits
No commits in common. "main" and "v1.15.1" have entirely different histories.
2 changed files with 1 additions and 32 deletions
|
@ -73,8 +73,6 @@ func CompareMap[K, V comparable](a, b map[K]V) bool {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
// Compact reduces the keys and values of a map down into one value each.
|
|
||||||
// The starting value for each is the default value of that type.
|
|
||||||
func Compact[K comparable, V any](
|
func Compact[K comparable, V any](
|
||||||
m map[K]V,
|
m map[K]V,
|
||||||
compactor func(accK K, accV V, nextK K, nextV V) (K, V),
|
compactor func(accK K, accV V, nextK K, nextV V) (K, V),
|
||||||
|
|
|
@ -1,7 +1,7 @@
|
||||||
// Package sliceutils contains various generic functions for applying an operation across an entire slice
|
// Package sliceutils contains various generic functions for applying an operation across an entire slice
|
||||||
package sliceutils
|
package sliceutils
|
||||||
|
|
||||||
// Map applies a given function to every element of a slice.
|
// MapS applies a given function to every element of a slice.
|
||||||
// The return type may be different from the initial type of the slice.
|
// The return type may be different from the initial type of the slice.
|
||||||
func Map[T any, M any](arr []T, apply func(T) M) []M {
|
func Map[T any, M any](arr []T, apply func(T) M) []M {
|
||||||
n := make([]M, len(arr))
|
n := make([]M, len(arr))
|
||||||
|
@ -73,7 +73,6 @@ func CompareUnordered[T comparable](a, b []T) bool {
|
||||||
return hits == len(a)
|
return hits == len(a)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Returns whether b exists inside a using a simple == comparison
|
|
||||||
func Contains[T comparable](a []T, b T) bool {
|
func Contains[T comparable](a []T, b T) bool {
|
||||||
for _, v := range a {
|
for _, v := range a {
|
||||||
if v == b {
|
if v == b {
|
||||||
|
@ -83,7 +82,6 @@ func Contains[T comparable](a []T, b T) bool {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
// Returns whether the given function f returns true for any element in a
|
|
||||||
func ContainsFunc[T any](a []T, f func(t T) bool) bool {
|
func ContainsFunc[T any](a []T, f func(t T) bool) bool {
|
||||||
for _, v := range a {
|
for _, v := range a {
|
||||||
if f(v) {
|
if f(v) {
|
||||||
|
@ -93,8 +91,6 @@ func ContainsFunc[T any](a []T, f func(t T) bool) bool {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
// Compact the slice a using the compactor function.
|
|
||||||
// For the first call, the accumulator argument will be the default value
|
|
||||||
func Compact[T any](a []T, compactor func(acc T, next T) T) T {
|
func Compact[T any](a []T, compactor func(acc T, next T) T) T {
|
||||||
var acc T
|
var acc T
|
||||||
for _, v := range a {
|
for _, v := range a {
|
||||||
|
@ -102,28 +98,3 @@ func Compact[T any](a []T, compactor func(acc T, next T) T) T {
|
||||||
}
|
}
|
||||||
return acc
|
return acc
|
||||||
}
|
}
|
||||||
|
|
||||||
// Returns a channel that all elements in a will be written to in order.
|
|
||||||
// Once all values of a have been sent, the channel will be closed.
|
|
||||||
// The channel must be fully consumed until closed. Otherwise a goroutine will be leaked
|
|
||||||
func ToChannel[T any](a []T) <-chan T {
|
|
||||||
c := make(chan T)
|
|
||||||
go func() {
|
|
||||||
for _, v := range a {
|
|
||||||
c <- v
|
|
||||||
}
|
|
||||||
close(c)
|
|
||||||
}()
|
|
||||||
|
|
||||||
return c
|
|
||||||
}
|
|
||||||
|
|
||||||
// FromChannel reads from a channel until closed, appending every element to a slice.
|
|
||||||
// If you do not know how many elements to expect, use an expectedSize of 0
|
|
||||||
func FromChannel[T any](c <-chan T, expectedSize uint) []T {
|
|
||||||
a := make([]T, expectedSize)
|
|
||||||
for v := range c {
|
|
||||||
a = append(a, v)
|
|
||||||
}
|
|
||||||
return a
|
|
||||||
}
|
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue