Struct MapFirstKeyWins 

pub struct MapFirstKeyWins<K, V>(/* private fields */);

Ensure that the first key is taken, if duplicate keys exist

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

The implementation supports both the HashMap and the BTreeMap from the standard library.

Trait Implementations

impl<'de, K, V, KAs, VAs> DeserializeAs<'de, BTreeMap<K, V>> for MapFirstKeyWins<KAs, VAs>

where KAs: DeserializeAs<'de, K>, VAs: DeserializeAs<'de, V>, K: Ord,

fn deserialize_as<D>(deserializer: D) -> Result<BTreeMap<K, V>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, K, V, KAs, VAs, S> DeserializeAs<'de, HashMap<K, V, S>> for MapFirstKeyWins<KAs, VAs>

where KAs: DeserializeAs<'de, K>, VAs: DeserializeAs<'de, V>, K: Eq + Hash, S: BuildHasher + Default,

fn deserialize_as<D>(deserializer: D) -> Result<HashMap<K, V, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, KAs, V, VAs> SerializeAs<BTreeMap<K, V>> for MapFirstKeyWins<KAs, VAs>

where KAs: SerializeAs<K>, VAs: SerializeAs<V>,

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<K, KAs, V, VAs, H> SerializeAs<HashMap<K, V, H>> for MapFirstKeyWins<KAs, VAs>

where KAs: SerializeAs<K>, VAs: SerializeAs<V>, H: ?Sized + Sized,

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

where S: Serializer,

Serialize this value into the given Serde serializer.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 0 bytes