bitcoin_checkqueue/
inner.rs

1crate::ix!();
2
3pub struct CheckQueueInner<T> {
4
5    /**
6      |The queue of elements to be processed.
7      |
8      |As the order of booleans doesn't matter, it
9      |is used as a LIFO (stack)
10      */
11    queue:        Vec<T>,
12
13    /**
14      | The number of workers (including the
15      | master) that are idle.
16      |
17      */
18    n_idle:       i32, // default = { 0 }
19
20    /**
21      | The total number of workers (including
22      | the master).
23      |
24      */
25    n_total:      i32, // default = { 0 }
26
27    /**
28      | The temporary evaluation result.
29      |
30      */
31    all_ok:       bool, // default = { true }
32
33    /**
34      | Number of verifications that haven't
35      | completed yet.
36      | 
37      | This includes elements that are no longer
38      | queued, but still in the worker's own
39      | batches.
40      |
41      */
42    n_todo:       u32, // default = { 0 }
43
44    request_stop: bool, // default = { false }
45}
46
47
bitcoin_checkqueue/inner.rs

bitcoin_checkqueue/
inner.rs
