|
Wildmeshing Toolkit
|
Where a screened round collects the next round's candidates: the operations its successes renewed and the ones must_wait set aside, by rank (see OpTable), each with its queue key, which stays counted (keys is empty when the pass sets no queue_key).
More...
Public Attributes | |
| std::mutex | mutex |
| std::deque< std::pair< uint32_t, Tuple > > | ops |
| std::deque< uint64_t > | keys |
Where a screened round collects the next round's candidates: the operations its successes renewed and the ones must_wait set aside, by rank (see OpTable), each with its queue key, which stays counted (keys is empty when the pass sets no queue_key).
Deques, because these lists reach millions of entries on the first rounds of a pass, and a vector growing by doubling holds its old and its new buffer at once.