Add runtime

src/SUMMARY.md

@@ -16,8 +16,7 @@
     - [Lifecycle](basic/waker/lifecycle.md)
     - [std::task::Waker](basic/waker/rust.md)
     - [Examples](basic/waker/examples.md)
-- [Scheduler]()
-- [Runtime]()
+- [Runtime](basic/runtime/readme.md)
 - [Composing]()
 - [async and await]()
 

src/basic/runtime/readme.md

@@ -0,0 +1,21 @@
+# Runtime
+
+A runtime provides what Rust left. Only with a runtime, async Rust can actually
+be used to program.
+
+## Features
+
+Runtimes are all third-party. Some of the major features they provide:
+
+1. Future implementations.
+1. Reactor implementations.
+1. Managing Futures.
+1. Managing Wakers.
+1. Scheduling Future polling.
+1. Utilities.
+
+## Links
+
+1. [Tokio](https://github.com/tokio-rs/tokio)
+1. [smol](https://github.com/smol-rs/smol)
+1. [Embassy](https://github.com/embassy-rs/embassy)

src/basic/waker/reactor.md

@@ -1,10 +1,10 @@
 # Reactor, handling I/O event notifications
 
 ## Question
-How can a waker **effectively** knows when its data is ready?
+How can a waker **efficiently** knows when its data is ready?
 
 ## Answer
-"Effectively" means no loop. In other words, a waker should be *notified* when
+"efficiently" means no loop. In other words, a waker should be *notified* when
 its data is ready. Such effectiveness is often achieved by using the
 notification mechanisms provided by the operating systems.
 

src/basic/waker/rust.md

@@ -26,10 +26,10 @@ RawWakers function like [Trait Objects][6]. The [RawWakerVTable][7] provides a
 common behavior, and the `*const ()` pointer stores arbitrary data that the
 common behavior applies on.
 
-Benefits of the "vtable strategy":
-1. Breaking away from the requirements that [dyn compatibility][8] (formerly
+While inconvenient, this "vtable strategy" has its benefits:
+1. Breaks away from the requirements that [dyn compatibility][8] (formerly
    "object safety") enforces.
-1. [Reducing allocations][9].
+1. Enables [reducing allocations][9].
 
 
 [1]: https://doc.rust-lang.org/std/task/struct.Waker.html

src/basic/waker/waking.md

@@ -1,16 +1,16 @@
-# Waking, pushing futures in a polling queue
+# Waking, pushing futures to a polling queue
 
 ## Question
 How can a waker have its future "polled"?
 
 ## Answer
 A waker calls specific "waking" code when the waker is notified that its data
 is ready. The "waking" code locates the future that the waker associates to,
-and push the future to a "polling queue".
+and pushes the future to a "polling queue". A waker's job is finished after
+"waking".
 
-A waker's job is finished after "waking". With a "polling queue", wakers are
-decoupled from "external code" which pops futures from the queue, polls the
-futures and handles data.
+With a "polling queue", wakers are decoupled from "external code" which pops
+futures from the queue, polls the futures and dispatches data.
 
 Diagram: a waker wakes.
 ```d2