Thank you Sönke and Stefan for the replies!
I guess my thoughts are that compared to just throwing function pointers or delegates into a queue to be ran would come to similar performance (if not better) for a certain case of situations. Is this true? Basically, if sleep is unused, and yields are unused (let us assume that the functions all execute fast and thus don't need yield), then just maintaining a queue of function pointers/delegates would be faster? Or am I misunderstanding.
Is this strength of this approach having access to yield and knowing that things will be done during sleeps?
On Fri, 07 Feb 2014 10:51:52 +0100, Sönke Ludwig wrote:
In the end the concept is really quite simple. But I'll also write up a
small article about how this works (it has been planned for a long
time), but the time currently doesn't really permit that and there are
still a few unknowns that I'd like to carve out first (mostly w.r.t
WinRT) before finally fully committing to a certain model (it's already
99% certain, though).
I would be very interested in reading it.
Regards,
Kelet