pub struct SimplestToActivateCounterPool {
pub name: String,
pub average_complexity: f64,
pub total_score: f64,
pub ranked_inputs: FenwickTree,
/* private fields */
}
Expand description
A pool that tries to find a minimal test case activating each sensor counter.
It is compatible with any sensor whose observations
are given by an iterator of (usize, u64)
. In particular, it is recommended to use it
with the CodeCoverageSensor
.
Fields
name: String
average_complexity: f64
total_score: f64
ranked_inputs: FenwickTree
Implementations
Trait Implementations
sourceimpl<O> CompatibleWithObservations<O> for SimplestToActivateCounterPool where
for<'a> &'a O: IntoIterator<Item = &'a (usize, u64)>,
impl<O> CompatibleWithObservations<O> for SimplestToActivateCounterPool where
for<'a> &'a O: IntoIterator<Item = &'a (usize, u64)>,
sourceimpl Pool for SimplestToActivateCounterPool
impl Pool for SimplestToActivateCounterPool
type Stats = UniqueCoveragePoolStats
type Stats = UniqueCoveragePoolStats
Statistics about the pool to be printed to the terminal as the fuzzer is running and saved to a .csv file after the run Read more
sourcefn get_random_index(&mut self) -> Option<PoolStorageIndex>
fn get_random_index(&mut self) -> Option<PoolStorageIndex>
Get the index of a random test case. Read more
Auto Trait Implementations
impl !RefUnwindSafe for SimplestToActivateCounterPool
impl Send for SimplestToActivateCounterPool
impl !Sync for SimplestToActivateCounterPool
impl Unpin for SimplestToActivateCounterPool
impl UnwindSafe for SimplestToActivateCounterPool
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more