Struct BinarySearch

pub struct BinarySearch { /* private fields */ }

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

Implementations

impl BinarySearch

pub fn new(start: i32) -> Self

Creates a new binary searcher starting at the given 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

Formats the value using the given formatter.

impl ValueTree for BinarySearch

type Value = i32

The type of the value produced by this ValueTree.

fn current(&self) -> i32

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

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 12 bytes