stdlib | \nconc | \n
|---|---|
| \n\n```go\ntype caughtPanicError struct {\n val any\n stack []byte\n}\n\nfunc (e *caughtPanicError) Error() string {\n return fmt.Sprintf(\n \"panic: %q\\n%s\",\n e.val,\n string(e.stack)\n )\n}\n\nfunc main() {\n done := make(chan error)\n go func() {\n defer func() {\n if v := recover(); v != nil {\n done <- &caughtPanicError{\n val: v,\n stack: debug.Stack()\n }\n } else {\n done <- nil\n }\n }()\n doSomethingThatMightPanic()\n }()\n err := <-done\n if err != nil {\n panic(err)\n }\n}\n```\n | \n\n\n```go\nfunc main() {\n var wg conc.WaitGroup\n wg.Go(doSomethingThatMightPanic)\n // panics with a nice stacktrace\n wg.Wait()\n}\n```\n | \n
stdlib | \nconc | \n
|---|---|
| \n\n```go\nfunc main() {\n var wg sync.WaitGroup\n for i := 0; i < 10; i++ {\n wg.Add(1)\n go func() {\n defer wg.Done()\n // crashes on panic!\n doSomething()\n }()\n }\n wg.Wait()\n}\n```\n | \n\n\n```go\nfunc main() {\n var wg conc.WaitGroup\n for i := 0; i < 10; i++ {\n wg.Go(doSomething)\n }\n wg.Wait()\n}\n```\n | \n
stdlib | \nconc | \n
|---|---|
| \n\n```go\nfunc process(stream chan int) {\n var wg sync.WaitGroup\n for i := 0; i < 10; i++ {\n wg.Add(1)\n go func() {\n defer wg.Done()\n for elem := range stream {\n handle(elem)\n }\n }()\n }\n wg.Wait()\n}\n```\n | \n\n\n```go\nfunc process(stream chan int) {\n p := pool.New().WithMaxGoroutines(10)\n for elem := range stream {\n elem := elem\n p.Go(func() {\n handle(elem)\n })\n }\n p.Wait()\n}\n```\n | \n
stdlib | \nconc | \n
|---|---|
| \n\n```go\nfunc process(values []int) {\n feeder := make(chan int, 8)\n\n var wg sync.WaitGroup\n for i := 0; i < 10; i++ {\n wg.Add(1)\n go func() {\n defer wg.Done()\n for elem := range feeder {\n handle(elem)\n }\n }()\n }\n\n for _, value := range values {\n feeder <- value\n }\n close(feeder)\n wg.Wait()\n}\n```\n | \n\n\n```go\nfunc process(values []int) {\n iter.ForEach(values, handle)\n}\n```\n | \n
stdlib | \nconc | \n
|---|---|
| \n\n```go\nfunc concMap(\n input []int,\n f func(int) int,\n) []int {\n res := make([]int, len(input))\n var idx atomic.Int64\n\n var wg sync.WaitGroup\n for i := 0; i < 10; i++ {\n wg.Add(1)\n go func() {\n defer wg.Done()\n\n for {\n i := int(idx.Add(1) - 1)\n if i >= len(input) {\n return\n }\n\n res[i] = f(input[i])\n }\n }()\n }\n wg.Wait()\n return res\n}\n```\n | \n\n\n```go\nfunc concMap(\n input []int,\n f func(*int) int,\n) []int {\n return iter.Map(input, f)\n}\n```\n | \n
stdlib | \nconc | \n
|---|---|
| \n\n```go\nfunc mapStream(\n in chan int,\n out chan int,\n f func(int) int,\n) {\n tasks := make(chan func())\n taskResults := make(chan chan int)\n\n // Worker goroutines\n var workerWg sync.WaitGroup\n for i := 0; i < 10; i++ {\n workerWg.Add(1)\n go func() {\n defer workerWg.Done()\n for task := range tasks {\n task()\n }\n }()\n }\n\n // Ordered reader goroutines\n var readerWg sync.WaitGroup\n readerWg.Add(1)\n go func() {\n defer readerWg.Done()\n for result := range taskResults {\n item := <-result\n out <- item\n }\n }()\n\n // Feed the workers with tasks\n for elem := range in {\n resultCh := make(chan int, 1)\n taskResults <- resultCh\n tasks <- func() {\n resultCh <- f(elem)\n }\n }\n\n // We've exhausted input.\n // Wait for everything to finish\n close(tasks)\n workerWg.Wait()\n close(taskResults)\n readerWg.Wait()\n}\n```\n | \n\n\n```go\nfunc mapStream(\n in chan int,\n out chan int,\n f func(int) int,\n) {\n s := stream.New().WithMaxGoroutines(10)\n for elem := range in {\n elem := elem\n s.Go(func() stream.Callback {\n res := f(elem)\n return func() { out <- res }\n })\n }\n s.Wait()\n}\n```\n | \n