indexmap 2.11.4

A hash table with consistent order and fast iteration.
Documentation 
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

#![cfg_attr(docsrs, doc(cfg(feature = "sval")))]

use crate::{IndexMap, IndexSet};
use sval::{Stream, Value};

impl<K: Value, V: Value, S> Value for IndexMap<K, V, S> {
    fn stream<'sval, ST: Stream<'sval> + ?Sized>(&'sval self, stream: &mut ST) -> sval::Result {
        stream.map_begin(Some(self.len()))?;

        for (k, v) in self {
            stream.map_key_begin()?;
            stream.value(k)?;
            stream.map_key_end()?;

            stream.map_value_begin()?;
            stream.value(v)?;
            stream.map_value_end()?;
        }

        stream.map_end()
    }
}

impl<K: Value, S> Value for IndexSet<K, S> {
    fn stream<'sval, ST: Stream<'sval> + ?Sized>(&'sval self, stream: &mut ST) -> sval::Result {
        stream.seq_begin(Some(self.len()))?;

        for value in self {
            stream.seq_value_begin()?;
            stream.value(value)?;
            stream.seq_value_end()?;
        }

        stream.seq_end()
    }
}