Class CoverageQueue

hail-fuzz/src/queue.rs:430–443

An input queue that attempts to maximize code coverage

/// An input queue that attempts to maximize code coverage
pub(crate) struct CoverageQueue {
    /// A queue of inputs that have previously increased coverage.
    queue: VecDeque<InputId>,

    /// A queue of inputs that have yet to be fuzzed a single time. These are always processed
    /// before existing entries in `queue`.
    new: BinaryHeap<NewInput>,

    /// Approximate number of full iterations of the queue that have been performed.
    pub cycles: usize,

    /// The cycle count that we last found an input at.
    pub found_input_at_cycle: usize,
}

impl CoverageQueue {
    pub fn new() -> Self {