This is the third in a series of posts covering how we have used C++ coroutines at Facebook to regain stack traces for dependent chains of asynchronous waiting tasks. In the previous post in the series, we looked at the difference between synchronous and asynchronous stacks and the data structures we can use to chain them. In this post we’ll look at how to tie those data structures together into a chain.
http://dlvr.it/S8gDX7
تعليقات
إرسال تعليق