Struct serde_tokenstream::OrderedMap

pub struct OrderedMap<K, V> { /* private fields */ }

This is a container for pairs that are deserialized from map syntax without requiring the keys to be unique. This is useful for types that don’t implement traits such as Hash or Ord required for map types that offer efficient lookups. The only mechanism to extract data is via into_iter().

Trait Implementations

impl<K, V> Default for OrderedMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K: Deserialize<'de>, V: Deserialize<'de>> Deserialize<'de> for OrderedMap<K, V>

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V> IntoIterator for OrderedMap<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(K, V), Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.