1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112
//! Functions to serialize and deserialize an `IndexMap` as an ordered sequence. //! //! The default `serde` implementation serializes `IndexMap` as a normal map, //! but there is no guarantee that serialization formats will preserve the order //! of the key-value pairs. This module serializes `IndexMap` as a sequence of //! `(key, value)` elements instead, in order. //! //! This module may be used in a field attribute for derived implementations: //! //! ``` //! # use indexmap::IndexMap; //! # use serde_derive::{Deserialize, Serialize}; //! #[derive(Deserialize, Serialize)] //! struct Data { //! #[serde(with = "indexmap::serde_seq")] //! map: IndexMap<i32, u64>, //! // ... //! } //! ``` //! //! Requires crate feature `"serde"` or `"serde-1"` use serde::de::{Deserialize, Deserializer, SeqAccess, Visitor}; use serde::ser::{Serialize, Serializer}; use core::fmt::{self, Formatter}; use core::hash::{BuildHasher, Hash}; use core::marker::PhantomData; use crate::IndexMap; /// Serializes an `IndexMap` as an ordered sequence. /// /// This function may be used in a field attribute for deriving `Serialize`: /// /// ``` /// # use indexmap::IndexMap; /// # use serde_derive::Serialize; /// #[derive(Serialize)] /// struct Data { /// #[serde(serialize_with = "indexmap::serde_seq::serialize")] /// map: IndexMap<i32, u64>, /// // ... /// } /// ``` /// /// Requires crate feature `"serde"` or `"serde-1"` pub fn serialize<K, V, S, T>(map: &IndexMap<K, V, S>, serializer: T) -> Result<T::Ok, T::Error> where K: Serialize + Hash + Eq, V: Serialize, S: BuildHasher, T: Serializer, { serializer.collect_seq(map) } /// Visitor to deserialize a *sequenced* `IndexMap` struct SeqVisitor<K, V, S>(PhantomData<(K, V, S)>); impl<'de, K, V, S> Visitor<'de> for SeqVisitor<K, V, S> where K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, S: Default + BuildHasher, { type Value = IndexMap<K, V, S>; fn expecting(&self, formatter: &mut Formatter<'_>) -> fmt::Result { write!(formatter, "a sequenced map") } fn visit_seq<A>(self, mut seq: A) -> Result<Self::Value, A::Error> where A: SeqAccess<'de>, { let capacity = seq.size_hint().unwrap_or(0); let mut map = IndexMap::with_capacity_and_hasher(capacity, S::default()); while let Some((key, value)) = seq.next_element()? { map.insert(key, value); } Ok(map) } } /// Deserializes an `IndexMap` from an ordered sequence. /// /// This function may be used in a field attribute for deriving `Deserialize`: /// /// ``` /// # use indexmap::IndexMap; /// # use serde_derive::Deserialize; /// #[derive(Deserialize)] /// struct Data { /// #[serde(deserialize_with = "indexmap::serde_seq::deserialize")] /// map: IndexMap<i32, u64>, /// // ... /// } /// ``` /// /// Requires crate feature `"serde"` or `"serde-1"` pub fn deserialize<'de, D, K, V, S>(deserializer: D) -> Result<IndexMap<K, V, S>, D::Error> where D: Deserializer<'de>, K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, S: Default + BuildHasher, { deserializer.deserialize_seq(SeqVisitor(PhantomData)) }