1
0
Fork 0
mirror of https://codeberg.org/icewind/bitbuffer.git synced 2026-06-03 16:44:06 +02:00

clippy fix

This commit is contained in:
Robin Appelman 2021-07-14 00:23:32 +02:00
commit 3bc1ece2ab
2 changed files with 9 additions and 9 deletions

View file

@ -361,11 +361,11 @@ impl<'a, E: Endianness, T: BitRead<'a, E>, const N: usize> BitRead<'a, E> for [T
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid. // SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
let mut array = let mut array =
unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() }; unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() };
for i in 0..N { for item in array.iter_mut() {
unsafe { unsafe {
// length is already checked // length is already checked
let val = stream.read()?; let val = stream.read()?;
array[i].as_mut_ptr().write(val) item.as_mut_ptr().write(val)
} }
} }
unsafe { Ok((&array as *const _ as *const [T; N]).read()) } unsafe { Ok((&array as *const _ as *const [T; N]).read()) }
@ -378,10 +378,10 @@ impl<'a, E: Endianness, T: BitRead<'a, E>, const N: usize> BitRead<'a, E> for [T
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid. // SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
let mut array = MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init(); let mut array = MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init();
for i in 0..N { for item in array.iter_mut() {
// length is already checked // length is already checked
let val = stream.read_unchecked(end)?; let val = stream.read_unchecked(end)?;
array[i].as_mut_ptr().write(val); item.as_mut_ptr().write(val);
} }
Ok((&array as *const _ as *const [T; N]).read()) Ok((&array as *const _ as *const [T; N]).read())
@ -767,11 +767,11 @@ impl<'a, E: Endianness, T: BitReadSized<'a, E>, const N: usize> BitReadSized<'a,
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid. // SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
let mut array = let mut array =
unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() }; unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() };
for i in 0..N { for item in array.iter_mut() {
unsafe { unsafe {
// length is already checked // length is already checked
let val = stream.read_sized(size)?; let val = stream.read_sized(size)?;
array[i].as_mut_ptr().write(val) item.as_mut_ptr().write(val)
} }
} }
unsafe { Ok((&array as *const _ as *const [T; N]).read()) } unsafe { Ok((&array as *const _ as *const [T; N]).read()) }
@ -788,10 +788,10 @@ impl<'a, E: Endianness, T: BitReadSized<'a, E>, const N: usize> BitReadSized<'a,
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid. // SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
let mut array = MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init(); let mut array = MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init();
for i in 0..N { for item in array.iter_mut() {
// length is already checked // length is already checked
let val = stream.read_sized_unchecked(size, end)?; let val = stream.read_sized_unchecked(size, end)?;
array[i].as_mut_ptr().write(val); item.as_mut_ptr().write(val);
} }
Ok((&array as *const _ as *const [T; N]).read()) Ok((&array as *const _ as *const [T; N]).read())

View file

@ -728,7 +728,7 @@ impl<'a, E: Endianness> PartialEq for BitReadStream<'a, E> {
} }
} }
return true; true
} }
} }