Struct libafl::corpus::queue::QueueCorpusScheduler

pub struct QueueCorpusScheduler<C, I, S> where
    S: HasCorpus<C, I>,
    C: Corpus<I>,
    I: Input,  { /* fields omitted */ }

Walk the corpus in a queue-like fashion

Implementations

impl<C, I, S> QueueCorpusScheduler<C, I, S> where
    S: HasCorpus<C, I>,
    C: Corpus<I>,
    I: Input, 

pub fn new() -> Self

Creates a new QueueCorpusScheduler

Trait Implementations

impl<C, I, S> CorpusScheduler<I, S> for QueueCorpusScheduler<C, I, S> where
    S: HasCorpus<C, I>,
    C: Corpus<I>,
    I: Input, 

fn next(&self, state: &mut S) -> Result<usize, Error>

Gets the next entry in the queue

fn on_add(&self, _state: &mut S, _idx: usize) -> Result<(), Error>

Add an entry to the corpus and return its index

fn on_replace(
    &self,
    _state: &mut S,
    _idx: usize,
    _testcase: &Testcase<I>
) -> Result<(), Error>

Replaces the testcase at the given idx

fn on_remove(
    &self,
    _state: &mut S,
    _idx: usize,
    _testcase: &Option<Testcase<I>>
) -> Result<(), Error>

Removes an entry from the corpus, returning it if it was present.

impl<C, I, S> Default for QueueCorpusScheduler<C, I, S> where
    S: HasCorpus<C, I>,
    C: Corpus<I>,
    I: Input, 

fn default() -> Self

Returns the “default value” for a type.