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<'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<HashbrownMap014<K, V, S>, 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<HashbrownMap015<K, V, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, K, V, KAs, VAs, S> DeserializeAs<'de, IndexMap<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<IndexMap<K, V, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de, K, V, KAs, VAs, S> DeserializeAs<'de, IndexMap<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<IndexMap2<K, V, S>, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V, KA, VA> JsonSchemaAs<BTreeMap<K, V>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<K, V, S, KA, VA> JsonSchemaAs<HashMap<K, V, S>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<K, V, S, KA, VA> JsonSchemaAs<HashMap<K, V, S>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<K, V, S, KA, VA> JsonSchemaAs<HashMap<K, V, S>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<K, V, S, KA, VA> JsonSchemaAs<IndexMap<K, V, S>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

impl<K, V, S, KA, VA> JsonSchemaAs<IndexMap<K, V, S>> for MapFirstKeyWins<KA, VA>

where VA: JsonSchemaAs<V>,

Available on crate feature schemars_0_8 only.

fn schema_name() -> String

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(gen: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn is_referenceable() -> bool

Whether JSON Schemas generated for this type should be re-used where possible using the $ref keyword.

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.

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: &HashbrownMap014<K, V, H>, 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: &HashbrownMap015<K, V, H>, 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<IndexMap<K, V, H>> for MapFirstKeyWins<KAs, VAs>

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

fn serialize_as<S>( value: &IndexMap<K, V, H>, 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<IndexMap<K, V, H>> for MapFirstKeyWins<KAs, VAs>

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

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

where S: Serializer,

Serialize this value into the given Serde serializer.