heapsz 0.1.0

A crate for calculating the heap usage of a data structure.
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 with::{remote::*, *};

#[allow(dead_code)]
#[path = "with.rs"]
mod with;

#[derive(heapsz_derive::HeapSize)]
pub enum Enum {
    A(#[heap_size] usize),
    B(#[heap_size] usize, usize),
    C(#[heap_size(with = "remote_inner_heap_size")] Inner, usize),
    D {
        #[heap_size(with = "remote_inner_heap_size")]
        inner: Inner,
        #[heap_size]
        size1: usize,
        size2: usize,
    },
}

#[derive(heapsz_derive::HeapSize)]
#[heap_size]
pub enum All {
    A(usize),
    B(usize, usize),
    C(#[heap_size(with = "remote_inner_heap_size")] Inner, usize),
    D {
        #[heap_size(with = "remote_inner_heap_size")]
        inner: Inner,
        size1: usize,
        size2: usize,
    },
}

#[derive(heapsz_derive::HeapSize)]
#[heap_size]
pub enum Skip {
    A(#[heap_size(skip)] Inner, usize),
    B {
        #[heap_size(skip)]
        inner: Inner,
        size1: usize,
        size2: usize,
    },
    #[heap_size(skip)]
    C {
        inner: Inner,
    },
}

#[derive(heapsz_derive::HeapSize)]
#[heap_size]
pub enum Empty {}

#[derive(heapsz_derive::HeapSize)]
#[heap_size]
pub enum Numbers {
    A = 1,
    B = 2,
}

fn main() {}