debug3 0.4.1

Space Efficient Pretty Printer
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
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

use std::hash::{BuildHasher, Hash};

use dashmap::{
    mapref::entry::{OccupiedEntry, VacantEntry},
    DashMap, DashSet,
};

use crate::{Debug, Formatter};

impl<K, V, S> Debug for DashMap<K, V, S>
where
    K: Debug + Eq + Hash,
    V: Debug,
    S: Clone + BuildHasher,
{
    fn fmt(&self, f: &mut Formatter) {
        let mut m = f.debug_map();
        for entry in self.iter() {
            let (k, v) = entry.pair();
            m.entry(k, v);
        }
        m.finish()
    }
}

impl<T, S> Debug for DashSet<T, S>
where
    T: Eq + Hash + Debug,
    S: Clone + BuildHasher,
{
    fn fmt(&self, f: &mut Formatter) {
        let mut s = f.debug_set();
        for x in self.iter() {
            s.entry(x.key());
        }
        s.finish()
    }
}

impl<K, V, S> Debug for OccupiedEntry<'_, K, V, S>
where
    K: Debug + Hash + Eq,
    V: Debug,
    S: BuildHasher + Clone,
{
    fn fmt(&self, f: &mut Formatter) {
        f.debug_struct("OccupiedEntry")
            .field("key", self.key())
            .field("value", self.get())
            .finish()
    }
}

impl<K, V, S> Debug for VacantEntry<'_, K, V, S>
where
    K: Debug + Hash + Eq,
    S: BuildHasher + Clone,
{
    fn fmt(&self, f: &mut Formatter) {
        f.debug_tuple("VacantEntry").field(self.key()).finish()
    }
}