Struct serde_json::de::MapAccess
source · struct MapAccess<'a, R: 'a> {
de: &'a mut Deserializer<R>,
first: bool,
}
Fields§
§de: &'a mut Deserializer<R>
§first: bool
Implementations§
Trait Implementations§
source§impl<'de, 'a, R: Read<'de> + 'a> MapAccess<'de> for MapAccess<'a, R>
impl<'de, 'a, R: Read<'de> + 'a> MapAccess<'de> for MapAccess<'a, R>
source§fn next_key_seed<K>(&mut self, seed: K) -> Result<Option<K::Value>>where
K: DeserializeSeed<'de>,
fn next_key_seed<K>(&mut self, seed: K) -> Result<Option<K::Value>>where
K: DeserializeSeed<'de>,
This returns
Ok(Some(key))
for the next key in the map, or Ok(None)
if there are no more remaining entries. Read moresource§fn next_value_seed<V>(&mut self, seed: V) -> Result<V::Value>where
V: DeserializeSeed<'de>,
fn next_value_seed<V>(&mut self, seed: V) -> Result<V::Value>where
V: DeserializeSeed<'de>,
This returns a
Ok(value)
for the next value in the map. Read moresource§fn next_entry_seed<K, V>(
&mut self,
kseed: K,
vseed: V,
) -> Result<Option<(<K as DeserializeSeed<'de>>::Value, <V as DeserializeSeed<'de>>::Value)>, Self::Error>where
K: DeserializeSeed<'de>,
V: DeserializeSeed<'de>,
fn next_entry_seed<K, V>(
&mut self,
kseed: K,
vseed: V,
) -> Result<Option<(<K as DeserializeSeed<'de>>::Value, <V as DeserializeSeed<'de>>::Value)>, Self::Error>where
K: DeserializeSeed<'de>,
V: DeserializeSeed<'de>,
This returns
Ok(Some((key, value)))
for the next (key-value) pair in
the map, or Ok(None)
if there are no more remaining items. Read moresource§fn next_key<K>(&mut self) -> Result<Option<K>, Self::Error>where
K: Deserialize<'de>,
fn next_key<K>(&mut self) -> Result<Option<K>, Self::Error>where
K: Deserialize<'de>,
This returns
Ok(Some(key))
for the next key in the map, or Ok(None)
if there are no more remaining entries. Read moresource§fn next_value<V>(&mut self) -> Result<V, Self::Error>where
V: Deserialize<'de>,
fn next_value<V>(&mut self) -> Result<V, Self::Error>where
V: Deserialize<'de>,
This returns a
Ok(value)
for the next value in the map. Read moresource§fn next_entry<K, V>(&mut self) -> Result<Option<(K, V)>, Self::Error>where
K: Deserialize<'de>,
V: Deserialize<'de>,
fn next_entry<K, V>(&mut self) -> Result<Option<(K, V)>, Self::Error>where
K: Deserialize<'de>,
V: Deserialize<'de>,
This returns
Ok(Some((key, value)))
for the next (key-value) pair in
the map, or Ok(None)
if there are no more remaining items. Read moreAuto Trait Implementations§
impl<'a, R> Freeze for MapAccess<'a, R>
impl<'a, R> RefUnwindSafe for MapAccess<'a, R>where
R: RefUnwindSafe,
impl<'a, R> Send for MapAccess<'a, R>where
R: Send,
impl<'a, R> Sync for MapAccess<'a, R>where
R: Sync,
impl<'a, R> Unpin for MapAccess<'a, R>
impl<'a, R> !UnwindSafe for MapAccess<'a, R>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more