1 Nov
2026
1 Nov
'26
5:54 p.m.
On Sun, Nov 1, 2026 at 8:49 AM Brook Milligan via Boost < boost@lists.boost.org> wrote:
I am wondering about the overhead of constructing/deconstructing a heap of thread pools in the outer loop.
Seems fine to me.
...is there another way to ensure that one group is complete before the next starts, even with one thread_pool?
You could build a synchronizer which counts down for each task and then unblocks. Your function with the loops would have to be a coroutine. This would let you construct the thread pool once (or even pass it in as a parameter). Thanks