Searched refs:size_of (Results 1 – 9 of 9) sorted by relevance
113 pub(crate) const MIN_NON_ZERO_CAP: usize = if mem::size_of::<T>() == 1 {115 } else if mem::size_of::<T>() <= 1024 {173 if mem::size_of::<T>() == 0 || capacity == 0 { in allocate_in()234 if mem::size_of::<T>() == 0 { usize::MAX } else { self.cap } in capacity()243 if mem::size_of::<T>() == 0 || self.cap == 0 { in current_memory()391 if mem::size_of::<T>() == 0 { in grow_amortized()417 if mem::size_of::<T>() == 0 { in grow_exact()
93 use core::mem::size_of;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()1091 if size_of::<T>() == 0 { in merge_sort()
155 } else if mem::size_of::<T>() == 0 { in next()173 let exact = if mem::size_of::<T>() == 0 { in size_hint()185 if mem::size_of::<T>() == 0 { in advance_by()222 if mem::size_of::<T>() == 0 { mem::zeroed() } else { ptr::read(self.ptr.add(i)) } in __iterator_get_unchecked()233 } else if mem::size_of::<T>() == 0 { in next_back()249 if mem::size_of::<T>() == 0 { in advance_back_by()
136 if mem::size_of::<T>() == 0 { in drop()
2340 let (new_len, new_cap) = if mem::size_of::<T>() == 0 { in into_flattened()2665 let end = if mem::size_of::<T>() == 0 { in into_iter()
666 u16 size_of; member946 switch (ce_info[f].size_of) { in i40e_set_hmc_context()
473 u16 size_of; member480 .size_of = sizeof_field(struct _struct, _ele), \
4459 if (ce_info[f].width > (ce_info[f].size_of * BITS_PER_BYTE)) { in ice_set_ctx()4461 f, ce_info[f].width, ce_info[f].size_of); in ice_set_ctx()4464 switch (ce_info[f].size_of) { in ice_set_ctx()
42 __le16 size_of; /* sizeof this */ member
