Struct serde_with::SetLastValueWins

pub struct SetLastValueWins<T>(/* private fields */);

Ensure that the last value is taken, if duplicate values exist

By default serde has a first-value-wins implementation, if duplicate keys for a set exist. Sometimes the opposite strategy is desired. This helper implements a first-value-wins strategy.

The implementation supports both the HashSet and the BTreeSet from the standard library.

Trait Implementations

impl<'de, T, TAs> DeserializeAs<'de, BTreeSet<T>> for SetLastValueWins<TAs>

where TAs: DeserializeAs<'de, T>, T: Ord,

fn deserialize_as<D>(deserializer: D) -> Result<BTreeSet<T>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, TAs, S> DeserializeAs<'de, HashSet<T, S>> for SetLastValueWins<TAs>

where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,

fn deserialize_as<D>(deserializer: D) -> Result<HashbrownSet014<T, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, TAs, S> DeserializeAs<'de, HashSet<T, S>> for SetLastValueWins<TAs>

where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,

fn deserialize_as<D>(deserializer: D) -> Result<HashSet<T, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, TAs, S> DeserializeAs<'de, IndexSet<T, S>> for SetLastValueWins<TAs>

where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,

fn deserialize_as<D>(deserializer: D) -> Result<IndexSet<T, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, T, TAs, S> DeserializeAs<'de, IndexSet<T, S>> for SetLastValueWins<TAs>

where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,

fn deserialize_as<D>(deserializer: D) -> Result<IndexSet2<T, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, TAs> SerializeAs<BTreeSet<T>> for SetLastValueWins<TAs>

where TAs: SerializeAs<T>,

fn serialize_as<S>( value: &BTreeSet<T>, serializer: S ) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, TAs, H> SerializeAs<HashSet<T, H>> for SetLastValueWins<TAs>

where TAs: SerializeAs<T>, H: ?Sized + Sized,

fn serialize_as<S>( value: &HashSet<T, H>, serializer: S ) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, TAs, H> SerializeAs<HashSet<T, H>> for SetLastValueWins<TAs>

where TAs: SerializeAs<T>, H: ?Sized + Sized,

fn serialize_as<S>( value: &HashbrownSet014<T, H>, serializer: S ) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, TAs, H> SerializeAs<IndexSet<T, H>> for SetLastValueWins<TAs>

where TAs: SerializeAs<T>, H: ?Sized + Sized,

fn serialize_as<S>( value: &IndexSet2<T, H>, serializer: S ) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, TAs, H> SerializeAs<IndexSet<T, H>> for SetLastValueWins<TAs>

where TAs: SerializeAs<T>, H: ?Sized + Sized,

fn serialize_as<S>( value: &IndexSet<T, H>, serializer: S ) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.