643     pub unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize) -> Self {  in from_raw_parts()
901     pub unsafe fn from_raw_parts_in(ptr: *mut T, length: usize, capacity: usize, alloc: A) -> Self {  in from_raw_parts_in()
938     pub fn into_raw_parts(self) -> (*mut T, usize, usize) {  in into_raw_parts()
982     pub fn into_raw_parts_with_alloc(self) -> (*mut T, usize, usize, A) {  in into_raw_parts_with_alloc()
1218     pub fn into_boxed_slice(mut self) -> Box<[T], A> {  in into_boxed_slice()
1306     pub fn as_slice(&self) -> &[T] {  in as_slice()
1323     pub fn as_mut_slice(&mut self) -> &mut [T] {  in as_mut_slice()
1381     pub fn as_ptr(&self) -> *const T {  in as_ptr()
1441     pub fn as_mut_ptr(&mut self) -> *mut T {  in as_mut_ptr()
1566     pub fn swap_remove(&mut self, index: usize) -> T {  in swap_remove()
1607     pub fn insert(&mut self, index: usize, element: T) {  in insert()
1668     pub fn remove(&mut self, index: usize) -> T {  in remove()
1797         fn process_loop<F, T, A: Allocator, const DELETED: bool>(  in retain_mut()  argument
1887         F: FnMut(&mut T, &mut T) -> bool,  in dedup_by()
1996     pub fn push(&mut self, value: T) {  in push()
2065     pub fn push_within_capacity(&mut self, value: T) -> Result<(), T> {  in push_within_capacity()  argument
2094     pub fn pop(&mut self) -> Option<T> {  in pop()
2133     unsafe fn append_elements(&mut self, other: *const [T]) {  in append_elements()
2137         unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) };  in append_elements()  constant
2147         unsafe { ptr::copy_nonoverlapping(other as *const T, self.as_mut_ptr().add(len), count) };  in try_append_elements()  constant
2183     pub fn drain<R>(&mut self, range: R) -> Drain<'_, T, A>  in drain()  argument
2362         F: FnMut() -> T,  in resize_with()
2435     pub fn spare_capacity_mut(&mut self) -> &mut [MaybeUninit<T>] {  in spare_capacity_mut()
2500     pub fn split_at_spare_mut(&mut self) -> (&mut [T], &mut [MaybeUninit<T>]) {  in split_at_spare_mut()
2512     ) -> (&mut [T], &mut [MaybeUninit<T>], &mut usize) {  in split_at_spare_mut_with_len()
2560     pub fn resize(&mut self, new_len: usize, value: T) {  in resize()
2630     pub fn extend_from_slice(&mut self, other: &[T]) {  in extend_from_slice()
2719     pub fn into_flattened(self) -> Vec<T, A> {  in into_flattened()
2744     fn extend_with(&mut self, n: usize, value: T) {  in extend_with()
2832 pub fn from_elem<T: Clone>(elem: T, n: usize) -> Vec<T> {  in from_elem()
2839 pub fn from_elem_in<T: Clone, A: Allocator>(elem: T, n: usize, alloc: A) -> Vec<T, A> {  in from_elem_in()  argument
2907     fn deref(&self) -> &[T] {  in deref()
2915     fn deref_mut(&mut self) -> &mut [T] {  in deref_mut()
3028                 begin.add(me.len()) as *const T  in into_iter()  constant
3072     fn extend_one(&mut self, item: T) {  in extend_one()
3296     pub fn extract_if<F>(&mut self, filter: F) -> ExtractIf<'_, T, F, A>  in extract_if()  argument
3325     fn extend_one(&mut self, &item: &'a T) {  in extend_one()
3344     fn partial_cmp(&self, other: &Vec<T, A2>) -> Option<Ordering> {  in partial_cmp()
3393     fn as_ref(&self) -> &Vec<T, A> {  in as_ref()
3400     fn as_mut(&mut self) -> &mut Vec<T, A> {  in as_mut()
3407     fn as_ref(&self) -> &[T] {  in as_ref()
3414     fn as_mut(&mut self) -> &mut [T] {  in as_mut()
3430     fn from(s: &[T]) -> Vec<T> {  in from()
3434     fn from(s: &[T]) -> Vec<T> {  in from()
3450     fn from(s: &mut [T]) -> Vec<T> {  in from()
3454     fn from(s: &mut [T]) -> Vec<T> {  in from()
3469     fn from(s: &[T; N]) -> Vec<T> {  in from()
3484     fn from(s: &mut [T; N]) -> Vec<T> {  in from()
3500     fn from(s: [T; N]) -> Vec<T> {  in from()
3505     fn from(s: [T; N]) -> Vec<T> {  in from()
3530     fn from(s: Cow<'a, [T]>) -> Vec<T> {  in from()
3548     fn from(s: Box<[T], A>) -> Self {  in from()
3576     fn from(v: Vec<T, A>) -> Self {  in from()
3626     fn try_from(mut vec: Vec<T, A>) -> Result<[T; N], Vec<T, A>> {  in try_from()