ds

package

v0.10.0 Latest Latest Go to latest Published: Oct 13, 2025 License: MIT Imports: 2 Imported by: 0

Details

Package ds provides some utilities relating to data structures.

This section is empty.

This section is empty.

func Copy[T any, ST ~[]T](arr ST) ST

func FlatMap[T any, R any, ST ~[]T, SR ~[]R](arr ST, iteratee func(T) SR) SR

func FlatMapError[T any, R any, ST ~[]T, SR ~[]R](arr ST, iteratee func(T) (SR, error)) (SR, error)

func Limit[T any, ST ~[]T](arr ST, limit int) ST

Limit limits array to given limit length, if the slice is larger than the given limit.

func Map[T any, R any, ST ~[]T](arr ST, iteratee func(T) R) []R

func MapError[T any, R any, ST ~[]T](arr ST, iteratee func(T) (R, error)) ([]R, error)

func MergeMap[K comparable, V any, M ~map[K]V](m1, m2 M) M

func SortAsc[E any, K constraints.Ordered](key func(e E) K) func(e1, e2 E) int

func SortCompose[E any](comparators ...func(e1, e2 E) int) func(e1, e2 E) int

func SortDesc[E any, K constraints.Ordered](key func(e E) K) func(e1, e2 E) int

func Uniq[E comparable, S ~[]E](sorted S) S

Uniq compresses all successive duplicate elements in sorted slice, like unix command 'uniq'.

type SyncMap[K comparable, V any] struct {
	// contains filtered or unexported fields
}

func (m *SyncMap[K, V]) Copy() map[K]V

func (m *SyncMap[K, V]) Delete(key K)

func (m *SyncMap[K, V]) Load(key K) (value V, ok bool)

func (m *SyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)

func (m *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)

func (m *SyncMap[K, V]) Range(f func(key K, value V) bool)

func (m *SyncMap[K, V]) Store(key K, value V)