1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
| package util
import ( "sync" "time"
"github.com/pkg/errors" "github.com/samber/lo" )
func AsyncCollect[T any, R any](items []T, f func(item T) (R, error)) ([]R, []error) { ret := make([]R, 0, len(items)) var errs []error mu := sync.Mutex{} wg := sync.WaitGroup{} wg.Add(len(items)) lo.ForEach(items, func(item T, _ int) { i := item go func() { r, err := f(i) mu.Lock() if err == nil { ret = append(ret, r) } else { errs = append(errs, errors.Wrapf(err, "error running async function for item [%v]", i)) } mu.Unlock() wg.Done() }() }) wg.Wait() return ret, errs }
func AsyncCollectMap[T any, K comparable, R any](items []T, k func(item T) K, f func(item T) (R, error)) (map[K]R, map[K]error) { ret := make(map[K]R, len(items)) errs := map[K]error{} mu := sync.Mutex{} wg := sync.WaitGroup{} wg.Add(len(items)) lo.ForEach(items, func(item T, _ int) { i := item go func() { key := k(i) r, err := f(i) mu.Lock() if err == nil { ret[key] = r } else { errs[key] = errors.Wrapf(err, "error running async function for item [%v]", key) } mu.Unlock() wg.Done() }() }) wg.Wait() return ret, errs }
func AsyncRateLimit[T any, R any](items []T, f func(item T) (R, error), maxConcurrent int, timeout time.Duration) ([]R, []error) { ret := make([]R, 0, len(items)) var errs []error mu := sync.Mutex{} idx := 0
limit := make(chan struct{}, maxConcurrent) defer close(limit)
for { select { case limit <- struct{}{}: idx++ item := items[idx] go func() { r, err := f(item) mu.Lock() if err == nil { ret = append(ret, r) } else { errs = append(errs, errors.Wrapf(err, "error running async function for item [%v]", item)) } mu.Unlock() }() case <-time.After(timeout): errs = append(errs, errors.Errorf("job timed out after [%v]", timeout)) return ret, errs default: return ret, errs } } }
|