Opening a new issue to continue the discussion in #23 which was becoming off-topic for that issue. The initial question was
how does ?= run code concurrently without using a threadpool?
The answer was
Parking happens when the computation requires a value that is not immediately available. It doesn't use a threadpool, the code is run synchronously by the thread responsible for unparking.
This "value that is not immediately available" point is what alludes me. Consider a simple example
Consider fetch an IO operation that is a black box, i.e. outside of our reach to reimplement. Can the last example be rewritten to happen concurrently? The only solution I could come up with is
Opening a new issue to continue the discussion in #23 which was becoming off-topic for that issue. The initial question was
The answer was
This "value that is not immediately available" point is what alludes me. Consider a simple example
Consider
fetch
an IO operation that is a black box, i.e. outside of our reach to reimplement. Can the last example be rewritten to happen concurrently? The only solution I could come up with is