More consistently use spaces after commas in lists in docs
This commit is contained in:
parent
d806d65657
commit
ae17d7d455
|
@ -1152,7 +1152,7 @@ declare_lint! {
|
|||
/// ```rust
|
||||
/// #![feature(box_syntax)]
|
||||
/// fn main() {
|
||||
/// let a = (box [1,2,3]).len();
|
||||
/// let a = (box [1, 2, 3]).len();
|
||||
/// }
|
||||
/// ```
|
||||
///
|
||||
|
|
|
@ -1719,7 +1719,7 @@ declare_lint! {
|
|||
///
|
||||
/// impl<T: ?Sized> MyIterator for T where T: Iterator { }
|
||||
///
|
||||
/// let x = vec![1,2,3];
|
||||
/// let x = vec![1, 2, 3];
|
||||
/// let _ = x.iter().is_sorted();
|
||||
/// ```
|
||||
///
|
||||
|
|
|
@ -1037,7 +1037,7 @@ impl<K: Ord, V> BTreeMap<K, V> {
|
|||
/// let mut count: BTreeMap<&str, usize> = BTreeMap::new();
|
||||
///
|
||||
/// // count the number of occurrences of letters in the vec
|
||||
/// for x in vec!["a","b","a","c","a","b"] {
|
||||
/// for x in vec!["a", "b", "a", "c", "a", "b"] {
|
||||
/// *count.entry(x).or_insert(0) += 1;
|
||||
/// }
|
||||
///
|
||||
|
|
|
@ -1962,7 +1962,7 @@ impl<T> VecDeque<T> {
|
|||
/// ```
|
||||
/// use std::collections::VecDeque;
|
||||
///
|
||||
/// let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect();
|
||||
/// let mut buf: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
|
||||
/// let buf2 = buf.split_off(1);
|
||||
/// assert_eq!(buf, [1]);
|
||||
/// assert_eq!(buf2, [2, 3]);
|
||||
|
@ -2514,10 +2514,10 @@ impl<T> VecDeque<T> {
|
|||
/// (3, 1), (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
|
||||
/// (1, 21), (2, 34), (4, 55)].into();
|
||||
///
|
||||
/// assert_eq!(deque.binary_search_by_key(&13, |&(a,b)| b), Ok(9));
|
||||
/// assert_eq!(deque.binary_search_by_key(&4, |&(a,b)| b), Err(7));
|
||||
/// assert_eq!(deque.binary_search_by_key(&100, |&(a,b)| b), Err(13));
|
||||
/// let r = deque.binary_search_by_key(&1, |&(a,b)| b);
|
||||
/// assert_eq!(deque.binary_search_by_key(&13, |&(a, b)| b), Ok(9));
|
||||
/// assert_eq!(deque.binary_search_by_key(&4, |&(a, b)| b), Err(7));
|
||||
/// assert_eq!(deque.binary_search_by_key(&100, |&(a, b)| b), Err(13));
|
||||
/// let r = deque.binary_search_by_key(&1, |&(a, b)| b);
|
||||
/// assert!(matches!(r, Ok(1..=4)));
|
||||
/// ```
|
||||
#[unstable(feature = "vecdeque_binary_search", issue = "78021")]
|
||||
|
|
|
@ -849,7 +849,7 @@ impl<T> Vec<T> {
|
|||
/// }
|
||||
/// x.set_len(size);
|
||||
/// }
|
||||
/// assert_eq!(&*x, &[0,1,2,3]);
|
||||
/// assert_eq!(&*x, &[0, 1, 2, 3]);
|
||||
/// ```
|
||||
#[stable(feature = "vec_as_ptr", since = "1.37.0")]
|
||||
#[inline]
|
||||
|
@ -1395,7 +1395,7 @@ impl<T> Vec<T> {
|
|||
/// # Examples
|
||||
///
|
||||
/// ```
|
||||
/// let mut vec = vec![1,2,3];
|
||||
/// let mut vec = vec![1, 2, 3];
|
||||
/// let vec2 = vec.split_off(1);
|
||||
/// assert_eq!(vec, [1]);
|
||||
/// assert_eq!(vec2, [2, 3]);
|
||||
|
|
|
@ -392,7 +392,7 @@ impl<T> MaybeUninit<T> {
|
|||
/// use std::mem::MaybeUninit;
|
||||
///
|
||||
/// let mut x = MaybeUninit::<Vec<u32>>::uninit();
|
||||
/// unsafe { x.as_mut_ptr().write(vec![0,1,2]); }
|
||||
/// unsafe { x.as_mut_ptr().write(vec![0, 1, 2]); }
|
||||
/// // Create a reference into the `MaybeUninit<T>`. This is okay because we initialized it.
|
||||
/// let x_vec = unsafe { &*x.as_ptr() };
|
||||
/// assert_eq!(x_vec.len(), 3);
|
||||
|
@ -429,7 +429,7 @@ impl<T> MaybeUninit<T> {
|
|||
/// use std::mem::MaybeUninit;
|
||||
///
|
||||
/// let mut x = MaybeUninit::<Vec<u32>>::uninit();
|
||||
/// unsafe { x.as_mut_ptr().write(vec![0,1,2]); }
|
||||
/// unsafe { x.as_mut_ptr().write(vec![0, 1, 2]); }
|
||||
/// // Create a reference into the `MaybeUninit<Vec<u32>>`.
|
||||
/// // This is okay because we initialized it.
|
||||
/// let x_vec = unsafe { &mut *x.as_mut_ptr() };
|
||||
|
@ -565,7 +565,7 @@ impl<T> MaybeUninit<T> {
|
|||
/// use std::mem::MaybeUninit;
|
||||
///
|
||||
/// let mut x = MaybeUninit::<Option<Vec<u32>>>::uninit();
|
||||
/// x.write(Some(vec![0,1,2]));
|
||||
/// x.write(Some(vec![0, 1, 2]));
|
||||
/// let x1 = unsafe { x.assume_init_read() };
|
||||
/// let x2 = unsafe { x.assume_init_read() };
|
||||
/// // We now created two copies of the same vector, leading to a double-free ⚠️ when
|
||||
|
|
|
@ -79,7 +79,7 @@ pub trait Index<Idx: ?Sized> {
|
|||
/// each can be indexed mutably and immutably.
|
||||
///
|
||||
/// ```
|
||||
/// use std::ops::{Index,IndexMut};
|
||||
/// use std::ops::{Index, IndexMut};
|
||||
///
|
||||
/// #[derive(Debug)]
|
||||
/// enum Side {
|
||||
|
|
|
@ -1958,10 +1958,10 @@ impl<T> [T] {
|
|||
/// (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
|
||||
/// (1, 21), (2, 34), (4, 55)];
|
||||
///
|
||||
/// assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b), Ok(9));
|
||||
/// assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b), Err(7));
|
||||
/// assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13));
|
||||
/// let r = s.binary_search_by_key(&1, |&(a,b)| b);
|
||||
/// assert_eq!(s.binary_search_by_key(&13, |&(a, b)| b), Ok(9));
|
||||
/// assert_eq!(s.binary_search_by_key(&4, |&(a, b)| b), Err(7));
|
||||
/// assert_eq!(s.binary_search_by_key(&100, |&(a, b)| b), Err(13));
|
||||
/// let r = s.binary_search_by_key(&1, |&(a, b)| b);
|
||||
/// assert!(match r { Ok(1..=4) => true, _ => false, });
|
||||
/// ```
|
||||
#[stable(feature = "slice_binary_search_by_key", since = "1.10.0")]
|
||||
|
|
Loading…
Reference in New Issue