[−][src]Trait serde::ser::SerializeMap
Returned from Serializer::serialize_map
.
Example use
# use std::marker::PhantomData;
#
# struct HashMap<K, V>(PhantomData<K>, PhantomData<V>);
#
# impl<K, V> HashMap<K, V> {
# fn len(&self) -> usize {
# unimplemented!()
# }
# }
#
# impl<'a, K, V> IntoIterator for &'a HashMap<K, V> {
# type Item = (&'a K, &'a V);
# type IntoIter = Box<Iterator<Item = (&'a K, &'a V)>>;
#
# fn into_iter(self) -> Self::IntoIter {
# unimplemented!()
# }
# }
#
use serde::ser::{Serialize, Serializer, SerializeMap};
impl<K, V> Serialize for HashMap<K, V>
where
K: Serialize,
V: Serialize,
{
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where
S: Serializer,
{
let mut map = serializer.serialize_map(Some(self.len()))?;
for (k, v) in self {
map.serialize_entry(k, v)?;
}
map.end()
}
}
Example implementation
The example data format presented on the website demonstrates an
implementation of SerializeMap
for a basic JSON data format.
Associated Types
type Ok
Must match the Ok
type of our Serializer
.
type Error: Error
Must match the Error
type of our Serializer
.
Required Methods
fn serialize_key<T: ?Sized>(&mut self, key: &T) -> Result<(), Self::Error> where
T: Serialize,
T: Serialize,
Serialize a map key.
If possible, Serialize
implementations are encouraged to use
serialize_entry
instead as it may be implemented more efficiently in
some formats compared to a pair of calls to serialize_key
and
serialize_value
.
fn serialize_value<T: ?Sized>(&mut self, value: &T) -> Result<(), Self::Error> where
T: Serialize,
T: Serialize,
Serialize a map value.
Panics
Calling serialize_value
before serialize_key
is incorrect and is
allowed to panic or produce bogus results.
fn end(self) -> Result<Self::Ok, Self::Error>
Finish serializing a map.
Provided Methods
fn serialize_entry<K: ?Sized, V: ?Sized>(
&mut self,
key: &K,
value: &V
) -> Result<(), Self::Error> where
K: Serialize,
V: Serialize,
&mut self,
key: &K,
value: &V
) -> Result<(), Self::Error> where
K: Serialize,
V: Serialize,
Serialize a map entry consisting of a key and a value.
Some Serialize
types are not able to hold a key and value in memory
at the same time so SerializeMap
implementations are required to
support serialize_key
and serialize_value
individually. The
serialize_entry
method allows serializers to optimize for the case
where key and value are both available. Serialize
implementations
are encouraged to use serialize_entry
if possible.
The default implementation delegates to serialize_key
and
serialize_value
. This is appropriate for serializers that do not
care about performance or are not able to optimize serialize_entry
any
better than this.
Implementors
impl<Ok, Error> SerializeMap for Impossible<Ok, Error> where
Error: Error,
[src]
impl<Ok, Error> SerializeMap for Impossible<Ok, Error> where
Error: Error,
type Ok = Ok
type Error = Error
fn serialize_key<T: ?Sized>(&mut self, key: &T) -> Result<(), Error> where
T: Serialize,
[src]
fn serialize_key<T: ?Sized>(&mut self, key: &T) -> Result<(), Error> where
T: Serialize,
fn serialize_value<T: ?Sized>(&mut self, value: &T) -> Result<(), Error> where
T: Serialize,
[src]
fn serialize_value<T: ?Sized>(&mut self, value: &T) -> Result<(), Error> where
T: Serialize,
fn end(self) -> Result<Ok, Error>
[src]
fn end(self) -> Result<Ok, Error>
fn serialize_entry<K: ?Sized, V: ?Sized>(
&mut self,
key: &K,
value: &V
) -> Result<(), Self::Error> where
K: Serialize,
V: Serialize,
[src]
fn serialize_entry<K: ?Sized, V: ?Sized>(
&mut self,
key: &K,
value: &V
) -> Result<(), Self::Error> where
K: Serialize,
V: Serialize,