@@ -184,7 +184,7 @@ pub struct Context<'a> {
184
184
}
185
185
186
186
impl < ' a > Context < ' a > {
187
- /// Create a new [ `Context`] from a [`&Waker`](Waker).
187
+ /// Create a new `Context` from a [`&Waker`](Waker).
188
188
#[ stable( feature = "futures_api" , since = "1.36.0" ) ]
189
189
#[ must_use]
190
190
#[ inline]
@@ -214,7 +214,7 @@ impl fmt::Debug for Context<'_> {
214
214
/// This handle encapsulates a [`RawWaker`] instance, which defines the
215
215
/// executor-specific wakeup behavior.
216
216
///
217
- /// The typical life of a [ `Waker`] is that it is constructed by an executor, wrapped in a
217
+ /// The typical life of a `Waker` is that it is constructed by an executor, wrapped in a
218
218
/// [`Context`], then passed to [`Future::poll()`]. Then, if the future chooses to return
219
219
/// [`Poll::Pending`], it must also store the waker somehow and call [`Waker::wake()`] when
220
220
/// the future should be polled again.
@@ -245,7 +245,7 @@ impl Waker {
245
245
/// As long as the executor keeps running and the task is not finished, it is
246
246
/// guaranteed that each invocation of [`wake()`](Self::wake) (or
247
247
/// [`wake_by_ref()`](Self::wake_by_ref)) will be followed by at least one
248
- /// [`poll()`] of the task to which this [ `Waker`] belongs. This makes
248
+ /// [`poll()`] of the task to which this `Waker` belongs. This makes
249
249
/// it possible to temporarily yield to other tasks while running potentially
250
250
/// unbounded processing loops.
251
251
///
@@ -289,7 +289,7 @@ impl Waker {
289
289
unsafe { ( self . waker . vtable . wake_by_ref ) ( self . waker . data ) }
290
290
}
291
291
292
- /// Returns `true` if this `Waker` and another [ `Waker`] would awake the same task.
292
+ /// Returns `true` if this `Waker` and another `Waker` would awake the same task.
293
293
///
294
294
/// This function works on a best-effort basis, and may return false even
295
295
/// when the `Waker`s would awaken the same task. However, if this function
0 commit comments