@@ -423,7 +423,7 @@ pub trait Deque<T> : Mutable {
423
423
/// ```
424
424
fn front_mut < ' a > ( & ' a mut self ) -> Option < & ' a mut T > ;
425
425
426
- /// Provide a reference to the back element, or None if the sequence is
426
+ /// Provide a reference to the back element, or ` None` if the sequence is
427
427
/// empty.
428
428
///
429
429
/// # Example
@@ -440,7 +440,7 @@ pub trait Deque<T> : Mutable {
440
440
/// ```
441
441
fn back < ' a > ( & ' a self ) -> Option < & ' a T > ;
442
442
443
- /// Provide a mutable reference to the back element, or None if the sequence
443
+ /// Provide a mutable reference to the back element, or ` None` if the sequence
444
444
/// is empty.
445
445
///
446
446
/// # Example
@@ -487,7 +487,7 @@ pub trait Deque<T> : Mutable {
487
487
/// assert_eq!(d.front(), Some(&1i));
488
488
fn push_back ( & mut self , elt : T ) ;
489
489
490
- /// Remove the last element and return it, or None if the sequence is empty.
490
+ /// Remove the last element and return it, or ` None` if the sequence is empty.
491
491
///
492
492
/// # Example
493
493
///
@@ -503,7 +503,7 @@ pub trait Deque<T> : Mutable {
503
503
/// assert_eq!(d.pop_back(), None);
504
504
fn pop_back ( & mut self ) -> Option < T > ;
505
505
506
- /// Remove the first element and return it, or None if the sequence is empty.
506
+ /// Remove the first element and return it, or ` None` if the sequence is empty.
507
507
///
508
508
/// # Example
509
509
///
0 commit comments