fn fill_nodes(entries: &mut MaybeUninitEntries) {
            let mut size = (MAX_LEVEL + 1) as u8;
            for (i, entry) in entries.iter_mut().enumerate() {
                if is_pow2(i + 1) {
                    size -= 1;
                }

                *entry = MaybeUninit::new(size);
            }
        }
// Limit scope of unsafety, this procedure is safe.
Limit scope of unsafety, this procedure is safe.
Limit scope of unsafety this procedure is safe .
fn fill_nodes(entries: &mut MaybeUninitEntries) {
            let mut size = (MAX_LEVEL + 1) as u8;
            for (i, entry) in entries.iter_mut().enumerate() {
                if is_pow2(i + 1) {
                    size -= 1;
                }
                *entry = MaybeUninit::new(size);
            }
        }
fn fill_nodes ( entries : & mut MaybeUninitEntries ) { let mut size = ( MAX_LEVEL + 1 ) as u8 ; for ( i , entry ) in entries . iter_mut ( ) . enumerate ( ) { if is_pow2 ( i + 1 ) { size -= 1 ; } * entry = MaybeUninit :: new ( size ) ; } }
Limit scope of unsafety, this procedure is safe.
Limit scope of unsafety this procedure is safe .
entries
&mut MaybeUninitEntries
entries
&mut MaybeUninitEntries