Struct serde_with::SetLastValueWins
source · pub struct SetLastValueWins<T>(_);
Expand description
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§
source§impl<'de, T, TAs> DeserializeAs<'de, BTreeSet<T, Global>> for SetLastValueWins<TAs>where
TAs: DeserializeAs<'de, T>,
T: Ord,
impl<'de, T, TAs> DeserializeAs<'de, BTreeSet<T, Global>> for SetLastValueWins<TAs>where TAs: DeserializeAs<'de, T>, T: Ord,
source§fn deserialize_as<D>(deserializer: D) -> Result<BTreeSet<T>, D::Error>where
D: Deserializer<'de>,
fn deserialize_as<D>(deserializer: D) -> Result<BTreeSet<T>, D::Error>where D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer.
source§impl<'de, T, TAs, S> DeserializeAs<'de, HashSet<T, S>> for SetLastValueWins<TAs>where
TAs: DeserializeAs<'de, T>,
T: Eq + Hash,
S: BuildHasher + Default,
impl<'de, T, TAs, S> DeserializeAs<'de, HashSet<T, S>> for SetLastValueWins<TAs>where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,
source§fn deserialize_as<D>(deserializer: D) -> Result<HashSet<T, S>, D::Error>where
D: Deserializer<'de>,
fn deserialize_as<D>(deserializer: D) -> Result<HashSet<T, S>, D::Error>where D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer.
source§impl<'de, T, TAs, S> DeserializeAs<'de, IndexSet<T, S>> for SetLastValueWins<TAs>where
TAs: DeserializeAs<'de, T>,
T: Eq + Hash,
S: BuildHasher + Default,
impl<'de, T, TAs, S> DeserializeAs<'de, IndexSet<T, S>> for SetLastValueWins<TAs>where TAs: DeserializeAs<'de, T>, T: Eq + Hash, S: BuildHasher + Default,
source§fn deserialize_as<D>(deserializer: D) -> Result<IndexSet<T, S>, D::Error>where
D: Deserializer<'de>,
fn deserialize_as<D>(deserializer: D) -> Result<IndexSet<T, S>, D::Error>where D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer.
source§impl<T, TAs> SerializeAs<BTreeSet<T, Global>> for SetLastValueWins<TAs>where
TAs: SerializeAs<T>,
impl<T, TAs> SerializeAs<BTreeSet<T, Global>> for SetLastValueWins<TAs>where TAs: SerializeAs<T>,
source§fn serialize_as<S>(value: &BTreeSet<T>, serializer: S) -> Result<S::Ok, S::Error>where
S: Serializer,
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.
source§impl<T, TAs, H> SerializeAs<HashSet<T, H>> for SetLastValueWins<TAs>where
TAs: SerializeAs<T>,
H: ?Sized + Sized,
impl<T, TAs, H> SerializeAs<HashSet<T, H>> for SetLastValueWins<TAs>where TAs: SerializeAs<T>, H: ?Sized + Sized,
source§fn serialize_as<S>(
value: &HashSet<T, H>,
serializer: S
) -> Result<S::Ok, S::Error>where
S: Serializer,
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.
source§impl<T, TAs, H> SerializeAs<IndexSet<T, H>> for SetLastValueWins<TAs>where
TAs: SerializeAs<T>,
H: ?Sized + Sized,
impl<T, TAs, H> SerializeAs<IndexSet<T, H>> for SetLastValueWins<TAs>where TAs: SerializeAs<T>, H: ?Sized + Sized,
source§fn serialize_as<S>(
value: &IndexSet<T, H>,
serializer: S
) -> Result<S::Ok, S::Error>where
S: Serializer,
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.