|
| 1 | +use crate::de::impls::{ArrayInPlaceVisitor, ArrayVisitor, InPlaceSeed}; |
| 2 | +use de::{Deserialize, Deserializer, Error, SeqAccess, Visitor}; |
| 3 | +use lib::fmt; |
| 4 | + |
| 5 | +struct ArrayGuard<T, const N: usize> { |
| 6 | + dst: *mut T, |
| 7 | + initialized: usize, |
| 8 | +} |
| 9 | + |
| 10 | +impl<T, const N: usize> Drop for ArrayGuard<T, N> { |
| 11 | + fn drop(&mut self) { |
| 12 | + debug_assert!(self.initialized <= N); |
| 13 | + let initialized_part = core::ptr::slice_from_raw_parts_mut(self.dst, self.initialized); |
| 14 | + #[allow(unsafe_code)] |
| 15 | + unsafe { |
| 16 | + core::ptr::drop_in_place(initialized_part); |
| 17 | + } |
| 18 | + } |
| 19 | +} |
| 20 | + |
| 21 | +fn try_create_array<E, F, T, const N: usize>(mut cb: F) -> Result<[T; N], E> |
| 22 | +where |
| 23 | + F: FnMut(usize) -> Result<T, E>, |
| 24 | +{ |
| 25 | + let mut array: core::mem::MaybeUninit<[T; N]> = core::mem::MaybeUninit::uninit(); |
| 26 | + let mut guard: ArrayGuard<T, N> = ArrayGuard { |
| 27 | + dst: array.as_mut_ptr() as _, |
| 28 | + initialized: 0, |
| 29 | + }; |
| 30 | + #[allow(unsafe_code)] |
| 31 | + unsafe { |
| 32 | + for (idx, value_ptr) in (&mut *array.as_mut_ptr()).iter_mut().enumerate() { |
| 33 | + core::ptr::write(value_ptr, cb(idx)?); |
| 34 | + guard.initialized += 1; |
| 35 | + } |
| 36 | + core::mem::forget(guard); |
| 37 | + Ok(array.assume_init()) |
| 38 | + } |
| 39 | +} |
| 40 | + |
| 41 | +impl<'de, T, const N: usize> Visitor<'de> for ArrayVisitor<[T; N]> |
| 42 | +where |
| 43 | + T: Deserialize<'de>, |
| 44 | +{ |
| 45 | + type Value = [T; N]; |
| 46 | + |
| 47 | + fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result { |
| 48 | + formatter.write_str("array") |
| 49 | + } |
| 50 | + |
| 51 | + #[inline] |
| 52 | + fn visit_seq<S>(self, mut seq: S) -> Result<Self::Value, S::Error> |
| 53 | + where |
| 54 | + S: SeqAccess<'de>, |
| 55 | + { |
| 56 | + try_create_array(|idx| seq.next_element()?.ok_or(Error::invalid_length(idx, &self))) |
| 57 | + } |
| 58 | +} |
| 59 | + |
| 60 | +impl<'a, 'de, T, const N: usize> Visitor<'de> for ArrayInPlaceVisitor<'a, [T; N]> |
| 61 | +where |
| 62 | + T: Deserialize<'de>, |
| 63 | +{ |
| 64 | + type Value = (); |
| 65 | + |
| 66 | + fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result { |
| 67 | + formatter.write_str("array") |
| 68 | + } |
| 69 | + |
| 70 | + #[inline] |
| 71 | + fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error> |
| 72 | + where |
| 73 | + A: SeqAccess<'de>, |
| 74 | + { |
| 75 | + let mut fail_idx = None; |
| 76 | + for (idx, dest) in self.0[..].iter_mut().enumerate() { |
| 77 | + if seq.next_element_seed(InPlaceSeed(dest))?.is_none() { |
| 78 | + fail_idx = Some(idx); |
| 79 | + break; |
| 80 | + } |
| 81 | + } |
| 82 | + if let Some(idx) = fail_idx { |
| 83 | + return Err(Error::invalid_length(idx, &self)); |
| 84 | + } |
| 85 | + Ok(()) |
| 86 | + } |
| 87 | +} |
| 88 | + |
| 89 | +impl<'de, T, const N: usize> Deserialize<'de> for [T; N] |
| 90 | +where |
| 91 | + T: Deserialize<'de>, |
| 92 | +{ |
| 93 | + fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> |
| 94 | + where |
| 95 | + D: Deserializer<'de>, |
| 96 | + { |
| 97 | + deserializer.deserialize_tuple(N, ArrayVisitor::<[T; N]>::new()) |
| 98 | + } |
| 99 | + |
| 100 | + fn deserialize_in_place<D>(deserializer: D, place: &mut Self) -> Result<(), D::Error> |
| 101 | + where |
| 102 | + D: Deserializer<'de>, |
| 103 | + { |
| 104 | + deserializer.deserialize_tuple(N, ArrayInPlaceVisitor(place)) |
| 105 | + } |
| 106 | +} |
0 commit comments