Struct proptest::num::u8::BinarySearch

[+] Show declaration

pub struct BinarySearch { /* fields omitted */ }

[−] Expand description

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

Implementations

impl BinarySearch[−]

pub fn new(start: u8) -> Self[−]

Creates a new binary searcher starting at the given value.

pub fn new_above(lo: u8, start: u8) -> Self[−]

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

Trait Implementations

impl Clone for BinarySearch[+]

[+] Show hidden undocumented items

fn clone(&self) -> BinarySearch[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Copy for BinarySearch

impl Debug for BinarySearch[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl ValueTree for BinarySearch[+]

[+] Show hidden undocumented items

type Value = u8

The type of the value produced by this ValueTree.

fn current(&self) -> u8[−]

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.