Lines Matching refs:usize
194 num_init: usize, in to_vec()
435 while (index as usize) < i { in sort_by_cached_key()
436 index = indices[index as usize].1; in sort_by_cached_key()
439 $slice.swap(i, index as usize); in sort_by_cached_key()
447 let sz_usize = mem::size_of::<(K, usize)>(); in sort_by_cached_key()
453 if sz_u8 < sz_u16 && len <= (u8::MAX as usize) { in sort_by_cached_key()
456 if sz_u16 < sz_u32 && len <= (u16::MAX as usize) { in sort_by_cached_key()
459 if sz_u32 < sz_usize && len <= (u32::MAX as usize) { in sort_by_cached_key()
462 sort_by_key!(usize, self, f) in sort_by_cached_key()
556 pub fn repeat(&self, n: usize) -> Vec<T> in repeat()
798 let size = slice.iter().map(|v| v.borrow().len()).sum::<usize>() + slice.len() - 1; in join()
822 slice.iter().map(|v| v.borrow().len()).sum::<usize>() + sep.len() * (slice.len() - 1); in join()
960 unsafe fn merge<T, F>(v: &mut [T], mid: usize, buf: *mut T, is_less: &mut F) in merge() argument
1086 const MAX_INSERTION: usize = 20; in merge_sort()
1088 const MIN_RUN: usize = 10; in merge_sort()
1185 fn collapse(runs: &[Run]) -> Option<usize> { in merge_sort() argument
1201 start: usize, in merge_sort()
1202 len: usize, in merge_sort()