Struct robust_binary_search::AutoSearcher

pub struct AutoSearcher { /* fields omitted */ }

Performs a robust binary search over a linear range and automatically infers the flakiness based on the votes.

Implementations

impl AutoSearcher

pub fn new(len: usize) -> Self

Creates a new AutoSearcher over a range with the given number of testable indices.

pub fn report(&mut self, index: usize, heads: bool)

Adds a vote to the internal statistics. With low flakiness, false votes are expected to have smaller indices than true votes.

Panics

Panics if index >= len.

pub fn next_index(&self) -> usize

Returns the next index that should be tested. Can return values in the range 0 to len, exclusive.

pub fn best_index(&self) -> usize

Returns the current estimate of the best index. Can return values in the range 0 to len, inclusive.

pub fn likelihood(&self, index: usize) -> f64

Returns the likelihood of the given index.

Panics

Panics if index > len.

Trait Implementations

impl Clone for AutoSearcher

fn clone(&self) -> AutoSearcher

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AutoSearcher

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.