Trait serde_with::ser::SerializeAs

source ·

pub trait SerializeAs<T: ?Sized> {
    // Required method
    fn serialize_as<S>(source: &T, serializer: S) -> Result<S::Ok, S::Error>
       where S: Serializer;
}

Expand description

A data structure that can be serialized into any data format supported by Serde, analogue to Serialize.

The trait is analogue to the serde::Serialize trait, with the same meaning of input and output arguments. It can and should be implemented using the same code structure as the Serialize trait. As such, the same advice for implementing Serialize applies here.

§Differences to `Serialize`

The trait is only required for container-like types or types implementing specific conversion functions. Container-like types are Vec, BTreeMap, but also Option and Box. Conversion types serialize into a different serde data type. For example, DisplayFromStr uses the Display trait to serialize a String and DurationSeconds converts a Duration into either String or integer values.

This code shows how to implement Serialize for Box:

impl<T> Serialize for Box<T>
where
    T: Serialize,
{
    #[inline]
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        (**self).serialize(serializer)
    }
}

and this code shows how to do the same using SerializeAs:

impl<T, U> SerializeAs<Box<T>> for Box<U>
where
    U: SerializeAs<T>,
{
    fn serialize_as<S>(source: &Box<T>, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        SerializeAsWrap::<T, U>::new(source).serialize(serializer)
    }
}

It uses two type parameters, T and U instead of only one and performs the serialization step using the SerializeAsWrap type. The T type is the type on the Rust side before serialization, whereas the U type determines how the value will be serialized. These two changes are usually enough to make a container type implement SerializeAs.

SerializeAsWrap is a piece of glue code which turns SerializeAs into a serde compatible datatype, by converting all calls to serialize into serialize_as. This allows us to implement SerializeAs such that it can be applied recursively throughout the whole data structure. This is mostly important for container types, such as Vec or BTreeMap. In a BTreeMap this allows us to specify two different serialization behaviors, one for key and one for value, using the SerializeAs trait.

§Implementing a converter Type

This shows a simplified implementation for DisplayFromStr.

struct DisplayFromStr;

impl<T> SerializeAs<T> for DisplayFromStr
where
    T: Display,
{
    fn serialize_as<S>(source: &T, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        serializer.collect_str(&source)
    }
}

Required Methods§

source

fn serialize_as<S>(source: &T, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

Serialize this value into the given Serde serializer.

Object Safety§

This trait is not object safe.

Trait serde_with::ser::SerializeAsCopy item path

§Differences to Serialize

§Implementing a converter Type

Required Methods§

fn serialize_as<S>(source: &T, serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

Object Safety§

Implementations on Foreign Types§

impl SerializeAs<OffsetDateTime> for Rfc2822

fn serialize_as<S>( datetime: &OffsetDateTime, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl SerializeAs<OffsetDateTime> for Rfc3339

fn serialize_as<S>( datetime: &OffsetDateTime, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<'a, T, U> SerializeAs<&'a T> for &'a Uwhere U: SerializeAs<T> + ?Sized, T: ?Sized,

fn serialize_as<S>(source: &&'a T, serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

impl<'a, T, U> SerializeAs<&'a mut T> for &'a mut Uwhere U: SerializeAs<T> + ?Sized, T: ?Sized,

fn serialize_as<S>(source: &&'a mut T, serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

impl<'a, T, U> SerializeAs<Pin<&'a T>> for Pin<&'a U>where U: SerializeAs<T>,

fn serialize_as<S>( source: &Pin<&'a T>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<'a, T, U> SerializeAs<Pin<&'a mut T>> for Pin<&'a mut U>where U: SerializeAs<T>,

fn serialize_as<S>( source: &Pin<&'a mut T>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Option<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Option<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Option<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Option<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Box<[(K, V)]>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Box<[(K, V)]>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Box<[(K, V)]>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Box<[(K, V)]>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BinaryHeap<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BinaryHeap<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BinaryHeap<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BinaryHeap<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeMap<K, V>> for Vec<(KAs, VAs)>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeMap<K, V>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeSet<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeSet<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeSet<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeSet<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<LinkedList<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &LinkedList<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<LinkedList<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &LinkedList<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<VecDeque<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &VecDeque<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<VecDeque<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &VecDeque<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Vec<(K, V)>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Vec<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Vec<(K, V)>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Vec<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<[(K, V)]> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>(source: &[(K, V)], serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<[(K, V)]> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>(source: &[(K, V)], serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashMap<K, V, H>> for Vec<(KAs, VAs)>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashMap<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashMap<K, V, H>> for Vec<(KAs, VAs)>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownMap014<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownSet014<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownSet014<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexMap<K, V, H>> for Vec<(KAs, VAs)>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexMap2<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexMap<K, V, H>> for Vec<(KAs, VAs)>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexMap<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet2<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet2<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, const N: usize> SerializeAs<[(K, V); N]> for BTreeMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &[(K, V); N], serializer: S ) -> Result<S::Ok, S::Error>where S: Serializer,

impl<K, KAs, V, VAs, const N: usize> SerializeAs<[(K, V); N]> for HashMap<KAs, VAs>where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

Trait serde_with::ser::SerializeAs

§Differences to `Serialize`

fn serialize_as<S>(source: &T, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

fn serialize_as<S>( datetime: &OffsetDateTime, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

fn serialize_as<S>( datetime: &OffsetDateTime, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<'a, T, U> SerializeAs<&'a T> for &'a U
where U: SerializeAs<T> + ?Sized, T: ?Sized,

fn serialize_as<S>(source: &&'a T, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<'a, T, U> SerializeAs<&'a mut T> for &'a mut U
where U: SerializeAs<T> + ?Sized, T: ?Sized,

fn serialize_as<S>(source: &&'a mut T, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<'a, T, U> SerializeAs<Pin<&'a T>> for Pin<&'a U>
where U: SerializeAs<T>,

fn serialize_as<S>( source: &Pin<&'a T>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<'a, T, U> SerializeAs<Pin<&'a mut T>> for Pin<&'a mut U>
where U: SerializeAs<T>,

fn serialize_as<S>( source: &Pin<&'a mut T>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Option<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Option<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Option<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Option<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Box<[(K, V)]>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Box<[(K, V)]>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Box<[(K, V)]>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Box<[(K, V)]>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BinaryHeap<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BinaryHeap<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BinaryHeap<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BinaryHeap<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeMap<K, V>> for Vec<(KAs, VAs)>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeMap<K, V>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeSet<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeSet<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<BTreeSet<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeSet<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<LinkedList<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &LinkedList<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<LinkedList<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &LinkedList<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<VecDeque<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &VecDeque<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<VecDeque<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &VecDeque<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Vec<(K, V)>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Vec<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<Vec<(K, V)>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &Vec<(K, V)>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<[(K, V)]> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>(source: &[(K, V)], serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs> SerializeAs<[(K, V)]> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>(source: &[(K, V)], serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashMap<K, V, H>> for Vec<(KAs, VAs)>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashMap<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashMap<K, V, H>> for Vec<(KAs, VAs)>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownMap014<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownSet014<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<HashSet<(K, V), H>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashbrownSet014<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexMap<K, V, H>> for Vec<(KAs, VAs)>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexMap2<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexMap<K, V, H>> for Vec<(KAs, VAs)>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexMap<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet2<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet2<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, H> SerializeAs<IndexSet<(K, V), H>> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &IndexSet<(K, V), H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, const N: usize> SerializeAs<[(K, V); N]> for BTreeMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &[(K, V); N], serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KAs, V, VAs, const N: usize> SerializeAs<[(K, V); N]> for HashMap<KAs, VAs>
where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

fn serialize_as<S>( source: &[(K, V); N], serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KU, V, VU> SerializeAs<BTreeMap<K, V>> for BTreeMap<KU, VU>
where KU: SerializeAs<K>, VU: SerializeAs<V>,

fn serialize_as<S>( source: &BTreeMap<K, V>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KU, V, VU, H> SerializeAs<HashMap<K, V, H>> for HashMap<KU, VU, H>
where KU: SerializeAs<K>, VU: SerializeAs<V>, H: ?Sized + Sized,

fn serialize_as<S>( source: &HashMap<K, V, H>, serializer: S ) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<K, KU, V, VU, H> SerializeAs<HashMap<K, V, H>> for HashbrownMap014<KU, VU, H>
where KU: SerializeAs<K>, VU: SerializeAs<V>, H: ?Sized + Sized,