Back to the Futures
summary
Promises a concrete implementation: a futures trait with a poll method that composes via combinators, compiles down to a state machine on top of mio with an IOCP backend and claims zero-cost futures (no allocations or implicit synchronization), benchmarks showing it among the fastest, and a usable stack (futures-rs and Tokio core published to crates io) plus example crates (mini-http, Redis protocol, TLS, initial hyper client) and plans for HTTP/2; runtime model uses one dynamic dispatch per event and one allocation per connection.
AI-written summary · about
chapters (15)
- 0:00Introduction
- 0:29Async IO
- 2:22Survey
- 3:57What is a Future
- 4:59Futures in Rust
- 7:28Streams in Rust
- 9:04Futures
- 9:20Zero Cost
- 10:24Zero Cost Features
- 11:26Zero Cost Graph
- 11:51Traits
- 12:58Function Signature
- 19:04Protocols
- 19:55Future
- 20:53Links
