.try_into()
these days, I thinklet x: Result<[u32; 256], _> = slice.try_into();
Default::default()
arrays of up to size 32 currently[T; N]
, for the element type, T
, and the non-negative compile-time constant size, N
.const
raw pointer to a place, without creating an intermediate reference. They optimize especially well when the optimizer can easily determine the slice length, e.g. <[u8; 4]>::try_from(&slice[4..8]).unwrap().
from_frequencies
(edited)*const [u32; 256]
.try_into().unwrap()
try_into()
didn't existstrstr(m_ppServerlist[i]->m_Info.m_aName, "whitelist")
str_find
btw @scar17offmem_zero(addr, sizeof(NETADDR));
→ mem_zero(addr, sizeof(*addr));
success
is weirdly named, it's true if the call failed and false if it succeededfailure