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
|
extern crate heapsize;
use self::heapsize::{heap_size_of, HeapSizeOf};
use std::hash::{BuildHasher, Hash};
use {KeyRef, LinkedHashMap, Node};
impl<K> HeapSizeOf for KeyRef<K> {
fn heap_size_of_children(&self) -> usize {
0
}
}
impl<K, V> HeapSizeOf for Node<K, V>
where
K: HeapSizeOf,
V: HeapSizeOf,
{
fn heap_size_of_children(&self) -> usize {
self.key.heap_size_of_children() + self.value.heap_size_of_children()
}
}
impl<K, V, S> HeapSizeOf for LinkedHashMap<K, V, S>
where
K: HeapSizeOf + Hash + Eq,
V: HeapSizeOf,
S: BuildHasher,
{
fn heap_size_of_children(&self) -> usize {
unsafe {
let mut size = self.map.heap_size_of_children();
for &value in self.map.values() {
size += (*value).heap_size_of_children();
size += heap_size_of(value as *const _ as *const _);
}
if !self.head.is_null() {
size += heap_size_of(self.head as *const _ as *const _);
}
let mut free = self.free;
while !free.is_null() {
size += heap_size_of(free as *const _ as *const _);
free = (*free).next
}
size
}
}
}
|
