Struct zebra_test::prelude::prop::num::u16::BinarySearch

pub struct BinarySearch {
    lo: u16,
    curr: u16,
    hi: u16,
}

Shrinks an integer towards 0, using binary search to find boundary points.

Fields

lo: u16

curr: u16

hi: u16

Implementations

impl BinarySearch

pub fn new(start: u16) -> BinarySearch

Creates a new binary searcher starting at the given value.

pub fn new_above(lo: u16, start: u16) -> BinarySearch

Creates a new binary searcher which will not search below the given lo value.

Trait Implementations

impl Clone for BinarySearch

fn clone(&self) -> BinarySearch

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BinarySearch

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

Formats the value using the given formatter.

impl ValueTree for BinarySearch

type Value = u16

The type of the value produced by this ValueTree.

fn current(&self) -> u16

Returns the current value.

fn simplify(&mut self) -> bool

Attempts to simplify the current value. Notionally, this sets the “high” value to the current value, and the current value to a “halfway point” between high and low, rounding towards low.

fn complicate(&mut self) -> bool

Attempts to partially undo the last simplification. Notionally, this sets the “low” value to one plus the current value, and the current value to a “halfway point” between high and the new low, rounding towards low.

impl Copy for BinarySearch