129                 num_init: usize,  in to_vec()
370                     while (index as usize) < i {  in sort_by_cached_key()
371                         index = indices[index as usize].1;  in sort_by_cached_key()
374                     $slice.swap(i, index as usize);  in sort_by_cached_key()
382         let sz_usize = mem::size_of::<(K, usize)>();  in sort_by_cached_key()
388         if sz_u8 < sz_u16 && len <= (u8::MAX as usize) {  in sort_by_cached_key()
391         if sz_u16 < sz_u32 && len <= (u16::MAX as usize) {  in sort_by_cached_key()
394         if sz_u32 < sz_usize && len <= (u32::MAX as usize) {  in sort_by_cached_key()
397         sort_by_key!(usize, self, f)  in sort_by_cached_key()
491     pub fn repeat(&self, n: usize) -> Vec<T>  in repeat()
733         let size = slice.iter().map(|v| v.borrow().len()).sum::<usize>() + slice.len() - 1;  in join()
757             slice.iter().map(|v| v.borrow().len()).sum::<usize>() + sep.len() * (slice.len() - 1);  in join()
853     let elem_alloc_fn = |len: usize| -> *mut T {  in stable_sort()
860     let elem_dealloc_fn = |buf_ptr: *mut T, len: usize| {  in stable_sort()
869     let run_alloc_fn = |len: usize| -> *mut sort::TimSortRun {  in stable_sort()
878     let run_dealloc_fn = |buf_ptr: *mut sort::TimSortRun, len: usize| {  in stable_sort()