Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore an in-depth conference talk on implementing composable futures without dynamic allocation and type erasure in C++. Delve into the design and implementation of an experimental future library that embeds asynchronous computation graphs into types. Learn about using template metaprogramming and compile-time transformations to achieve zero allocation and zero type erasure futures. Examine benchmarks and comparisons of running time, compilation time, and generated assembly. Gain insights into C++17 language and library features used throughout the presentation. Suitable for those familiar with C++11/14 features and std::future or boost::future, with recommended knowledge of C++17 features.