Fix typos (#348)

src/executor/current_thread/mod.rs

@@ -160,7 +160,7 @@ impl Turn {
     }
 }
 
-/// A `CurrentThread` instance bound to a supplied execution conext.
+/// A `CurrentThread` instance bound to a supplied execution context.
 pub struct Entered<'a, P: Park + 'a> {
     executor: &'a mut CurrentThread<P>,
     enter: &'a mut Enter,
@@ -248,7 +248,7 @@ where F: FnOnce(&mut Context) -> R
 /// and blocks the current thread until the provided future and **all**
 /// subsequently spawned futures complete. In other words:
 ///
-/// * If the provided boostrap future does **not** spawn any additional tasks,
+/// * If the provided bootstrap future does **not** spawn any additional tasks,
 ///   `block_on_all` returns once `future` completes.
 /// * If the provided bootstrap future **does** spawn additional tasks, then
 ///   `block_on_all` returns once **all** spawned futures complete.
@@ -733,7 +733,7 @@ impl RunTimeoutError {
         RunTimeoutError { timeout }
     }
 
-    /// Returns `true` if the error was caused by the operation timeing out.
+    /// Returns `true` if the error was caused by the operation timing out.
     pub fn is_timeout(&self) -> bool {
         self.timeout
     }

src/executor/current_thread/scheduler.rs

@@ -52,7 +52,7 @@ struct List<U> {
 // Specifically, when a node is stored in at least one of the two lists
 // described above, this represents a logical `Arc` handle. This is how
 // `Scheduler` maintains its reference to all nodes it manages. Each
-// `NotifyHande` instance is an `Arc<Node>` as well.
+// `NotifyHandle` instance is an `Arc<Node>` as well.
 //
 // When `Scheduler` drops, it clears the linked list of all nodes that it
 // manages. When doing so, it must attempt to decrement the reference count (by
@@ -642,7 +642,7 @@ impl<'a, U> Clone for Notify<'a, U> {
 
 impl<'a, U> fmt::Debug for Notify<'a, U> {
     fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_struct("Notiy").finish()
+        fmt.debug_struct("Notify").finish()
     }
 }