pub const fn memory_layout(len: usize) -> (usize, usize) {
        let (l_size, l_align) = size_align::<L>(1);
        let (calc_size, calc_align) = {
            let (dsize, dalign) = size_align::<E>(len);
            let l_size = aligned_size::<L>(dalign);
            (l_size + dsize, max(l_align, dalign))
        };
        (
            cond(len == 0, l_size, calc_size),
            cond(len == 0, l_align, calc_align),
        )
    }
/// Get size and alignment of the memory that a block of length `len` would need.
///
/// Returns a tuple in the form `(size, align)`
Get size and alignment of the memory that a block of length `len` would need.
Returns a tuple in the form `(size, align)`
Get size and alignment of the memory that a block of length ` len ` would need . Returns a tuple in the form ` ( size align ) `
pub const fn memory_layout(len: usize) -> (usize, usize) {
        let (l_size, l_align) = size_align::<L>(1);
        let (calc_size, calc_align) = {
            let (dsize, dalign) = size_align::<E>(len);
            let l_size = aligned_size::<L>(dalign);
            (l_size + dsize, max(l_align, dalign))
        };
        (
            cond(len == 0, l_size, calc_size),
            cond(len == 0, l_align, calc_align),
        )
    }
pub const fn memory_layout ( len : usize ) -> ( usize , usize ) { let ( l_size , l_align ) = size_align :: < L > ( 1 ) ; let ( calc_size , calc_align ) = { let ( dsize , dalign ) = size_align :: < E > ( len ) ; let l_size = aligned_size :: < L > ( dalign ) ; ( l_size + dsize , max ( l_align , dalign ) ) } ; ( cond ( len == 0 , l_size , calc_size ) , cond ( len == 0 , l_align , calc_align ) , ) }
Get size and alignment of the memory that a block of length `len` would need.
Get size and alignment of the memory that a block of length ` len ` would need .
len
usize