mirror of
https://codeberg.org/icewind/bitbuffer.git
synced 2026-06-03 16:44:06 +02:00
clippy fix
This commit is contained in:
parent
3f53a8e438
commit
3bc1ece2ab
2 changed files with 9 additions and 9 deletions
16
src/read.rs
16
src/read.rs
|
|
@ -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.
|
||||
let mut array =
|
||||
unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() };
|
||||
for i in 0..N {
|
||||
for item in array.iter_mut() {
|
||||
unsafe {
|
||||
// length is already checked
|
||||
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()) }
|
||||
|
|
@ -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.
|
||||
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
|
||||
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())
|
||||
|
|
@ -767,11 +767,11 @@ impl<'a, E: Endianness, T: BitReadSized<'a, E>, const N: usize> BitReadSized<'a,
|
|||
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
|
||||
let mut array =
|
||||
unsafe { MaybeUninit::<[MaybeUninit<T>; N]>::uninit().assume_init() };
|
||||
for i in 0..N {
|
||||
for item in array.iter_mut() {
|
||||
unsafe {
|
||||
// length is already checked
|
||||
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()) }
|
||||
|
|
@ -788,10 +788,10 @@ impl<'a, E: Endianness, T: BitReadSized<'a, E>, const N: usize> BitReadSized<'a,
|
|||
// SAFETY: An uninitialized `[MaybeUninit<_>; LEN]` is valid.
|
||||
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
|
||||
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())
|
||||
|
|
|
|||
|
|
@ -728,7 +728,7 @@ impl<'a, E: Endianness> PartialEq for BitReadStream<'a, E> {
|
|||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
true
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue