12 //! let vec = vec![1, 2, 3];
13 //! let int_slice = &vec[..];
15 //! let str_slice: &[&str] = &["one", "two", "three"];
24 //! let x = &mut [1, 2, 3];
51 //! let numbers = &[0, 1, 2];
60 //! let mut scores = [7, 8, 9];
169             let len = b.len();  in into_vec()
170             let (b, alloc) = Box::into_raw_with_allocator(b);  in into_vec()
206             let mut vec = Vec::with_capacity_in(s.len(), alloc);  in to_vec()
207             let mut guard = DropGuard { vec: &mut vec, num_init: 0 };  in to_vec()
208             let slots = guard.vec.spare_capacity_mut();  in to_vec()
229             let mut v = Vec::with_capacity_in(s.len(), alloc);  in to_vec()
265     /// let mut v = [-5, 4, 1, -3, 2];
296     /// let mut floats = [5f64, 4.0, 1.0, 3.0, 2.0];
318     /// let mut v = [5, 4, 1, 3, 2];
363     /// let mut v = [-5i32, 4, 1, -3, 2];
408     /// let mut v = [-5i32, 4, 32, -3, 2];
427                 let mut indices: Vec<_> =  in sort_by_cached_key()
434                     let mut index = indices[i].1;  in sort_by_cached_key()
444         let sz_u8 = mem::size_of::<(K, u8)>();  in sort_by_cached_key()
445         let sz_u16 = mem::size_of::<(K, u16)>();  in sort_by_cached_key()
446         let sz_u32 = mem::size_of::<(K, u32)>();  in sort_by_cached_key()
447         let sz_usize = mem::size_of::<(K, usize)>();  in sort_by_cached_key()
449         let len = self.len();  in sort_by_cached_key()
470     /// let s = [10, 40, 30];
471     /// let x = s.to_vec();
495     /// let s = [10, 40, 30];
496     /// let x = s.to_vec_in(System);
519     /// let s: Box<[i32]> = Box::new([10, 40, 30]);
520     /// let x = s.into_vec();
570         let capacity = self.len().checked_mul(n).expect("capacity overflow");  in repeat()
571         let mut buf = Vec::with_capacity(capacity);  in repeat()
576             let mut m = n >> 1;  in repeat()
587                     let buf_len = buf.len();  in repeat()
597         let rem_len = capacity - buf.len(); // `self.len() * rem`  in repeat()
689         let mut me = self.to_vec();  in to_ascii_uppercase()
710         let mut me = self.to_vec();  in to_ascii_lowercase()
778         let size = slice.iter().map(|slice| slice.borrow().len()).sum();  in concat()
779         let mut result = Vec::with_capacity(size);  in concat()
793         let mut iter = slice.iter();  in join()
794         let first = match iter.next() {  in join()
798         let size = slice.iter().map(|v| v.borrow().len()).sum::<usize>() + slice.len() - 1;  in join()
799         let mut result = Vec::with_capacity(size);  in join()
816         let mut iter = slice.iter();  in join()
817         let first = match iter.next() {  in join()
821         let size =  in join()
823         let mut result = Vec::with_capacity(size);  in join()
872         let (init, tail) = self.split_at(target.len());  in clone_into()
911             let tmp = mem::ManuallyDrop::new(ptr::read(&v[0]));  in insert_head()
923             let mut hole = InsertionHole { src: &*tmp, dest: &mut v[1] };  in insert_head()
964     let len = v.len();  in merge()
965     let v = v.as_mut_ptr();  in merge()
966     let (v_mid, v_end) = unsafe { (v.add(mid), v.add(len)) };  in merge()
985     let mut hole;  in merge()
995         let left = &mut hole.start;  in merge()
996         let mut right = v_mid;  in merge()
997         let out = &mut hole.dest;  in merge()
1003                 let to_copy = if is_less(&*right, &**left) {  in merge()
1019         let left = &mut hole.dest;  in merge()
1020         let right = &mut hole.end;  in merge()
1021         let mut out = v_end;  in merge()
1027                 let to_copy = if is_less(&*right.offset(-1), &*left.offset(-1)) {  in merge()
1040         let old = *ptr;  in merge()
1061                 let len = self.end.sub_ptr(self.start);  in merge()
1095     let len = v.len();  in merge_sort()
1111     let mut buf = Vec::with_capacity(len / 2);  in merge_sort()
1117     let mut runs = vec![];  in merge_sort()
1118     let mut end = len;  in merge_sort()
1121         let mut start = end - 1;  in merge_sort()
1151         while let Some(r) = collapse(&runs) {  in merge_sort()
1152             let left = runs[r + 1];  in merge_sort()
1153             let right = runs[r];  in merge_sort()
1186         let n = runs.len();  in merge_sort()