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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119

crate::ix!();

//-------------------------------------------[.cpp/bitcoin/src/bench/prevector.cpp]

pub struct NonTrivial {
    x: i32,
}

lazy_static!{
    /*
    SERIALIZE_METHODS(nonTrivial, obj) { READWRITE(obj.x); }
    */
}

impl Default for NonTrivial {
    
    fn default() -> Self {
        todo!();
        /*
        : x(-1),

        
        */
    }
}


//expected to be trivially constructible
pub type Trivial = u8;

#[bench] fn prevector_destructor<T>(b: &mut Bencher)  {

    todo!();
        /*
            bench.batch(2).run([&] {
            prevector<28, T> t0;
            prevector<28, T> t1;
            t0.resize(28);
            t1.resize(29);
        });
        */
}

#[bench] fn prevector_clear<T>(b: &mut Bencher)  {

    todo!();
        /*
            prevector<28, T> t0;
        prevector<28, T> t1;
        bench.batch(2).run([&] {
            t0.resize(28);
            t0.clear();
            t1.resize(29);
            t1.clear();
        });
        */
}

#[bench] fn prevector_resize<T>(b: &mut Bencher)  {

    todo!();
        /*
            prevector<28, T> t0;
        prevector<28, T> t1;
        bench.batch(4).run([&] {
            t0.resize(28);
            t0.resize(0);
            t1.resize(29);
            t1.resize(0);
        });
        */
}

#[bench] fn prevector_deserialize<T>(b: &mut Bencher)  {

    todo!();
        /*
            DataStream s0(SER_NETWORK, 0);
        prevector<28, T> t0;
        t0.resize(28);
        for (auto x = 0; x < 900; ++x) {
            s0 << t0;
        }
        t0.resize(100);
        for (auto x = 0; x < 101; ++x) {
            s0 << t0;
        }
        bench.batch(1000).run([&] {
            prevector<28, T> t1;
            for (auto x = 0; x < 1000; ++x) {
                s0 >> t1;
            }
            s0.Rewind();
        });
        */
}

macro_rules! prevector_test {
    ($name:ident) => {
        /*
        
            static c_void Prevector##name##Nontrivial(benchmark::Bench& bench) 
            {                                                                
                Prevector##name<nonTrivial>(bench);                        
            }                                                                
            BENCHMARK(Prevector##name##Nontrivial);                          
            static c_void Prevector##name##Trivial(benchmark::Bench& bench)    
            {                                                                
                Prevector##name<Trivial>(bench);                           
            }                                                                
            BENCHMARK(Prevector##name##Trivial);
        */
    }
}

prevector_test!{ Clear }
prevector_test!{ Destructor }
prevector_test!{ Resize }
prevector_test!{ Deserialize }