bitcoin-checkqueue 0.1.16-alpha.0

one thread is assumed to push batches of verifications onto the CheckQueue, where they are processed
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
63
64

crate::ix!();

/**
  | RAII-style controller object for a
  | CCheckQueue that guarantees the passed
  | queue is finished before continuing.
  |
  */
pub struct CheckQueueControl<T> {
    pqueue: *const CheckQueue<T>,
    done:   bool,
}

impl<T> Drop for CheckQueueControl<T> {
    fn drop(&mut self) {
        todo!();
        /*
            if (!fDone)
                Wait();
            if (pqueue != nullptr) {
                LEAVE_CRITICAL_SECTION(pqueue->m_control_mutex);
            }
        */
    }
}

impl<T> CheckQueueControl<T> {

    pub fn new(pqueue_in: *mut CheckQueue<T>) -> Self {
    
        todo!();
        /*
        : pqueue(pqueueIn),
        : done(false),

            // passed queue is supposed to be unused, or nullptr
            if (pqueue != nullptr) {
                ENTER_CRITICAL_SECTION(pqueue->m_control_mutex);
            }
        */
    }
    
    pub fn wait(&mut self) -> bool {
        
        todo!();
        /*
            if (pqueue == nullptr)
                return true;
            bool fRet = pqueue->Wait();
            fDone = true;
            return fRet;
        */
    }
    
    pub fn add(&mut self, checks: &mut Vec<T>)  {
        
        todo!();
        /*
            if (pqueue != nullptr)
                pqueue->Add(vChecks);
        */
    }
}