pub fn deserialize<'de, K, V, D>(deserializer: D) -> Result<Vec<(K, V)>, D::Error>
where
    D: Deserializer<'de>,
    K: Deserialize<'de>,
    V: Deserialize<'de>,
{
    deserializer.deserialize_map(TupleVecMapVisitor::new())
}
/// Deserialize to a `Vec<(K, V)>` as if it were a `HashMap<K, V>`.
///
/// This directly deserializes into the returned vec with no intermediate allocation.
///
/// In formats where dictionaries are ordered, this maintains the input data's order.
Deserialize to a `Vec<(K, V)>` as if it were a `HashMap`.
This directly deserializes into the returned vec with no intermediate allocation.

In formats where dictionaries are ordered, this maintains the input data's order.
Deserialize to a ` Vec< ( K V ) > ` as if it were a ` HashMap ` . This directly deserializes into the returned vec with no intermediate allocation . In formats where dictionaries are ordered this maintains the input data ' s order .
pub fn deserialize<'de, K, V, D>(deserializer: D) -> Result<Vec<(K, V)>, D::Error>
where
    D: Deserializer<'de>,
    K: Deserialize<'de>,
    V: Deserialize<'de>,
{
    deserializer.deserialize_map(TupleVecMapVisitor::new())
}
pub fn deserialize < ' de , K , V , D > ( deserializer : D ) -> Result < Vec < ( K , V ) > , D :: Error > where D : Deserializer < ' de > , K : Deserialize < ' de > , V : Deserialize < ' de > , { deserializer . deserialize_map ( TupleVecMapVisitor :: new ( ) ) }
Deserialize to a `Vec<(K, V)>` as if it were a `HashMap<K, V>`.
Deserialize to a ` Vec< ( K V ) > ` as if it were a ` HashMap<K V > ` .
deserializer
D
deserializer
D