Struct `BinarySearch`

struct BinarySearch { ... }

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

Implementations

`impl BinarySearch`

fn new(start: u32) -> Self: Creates a new binary searcher starting at the given value.
fn new_above(lo: u32, start: u32) -> Self: Creates a new binary searcher which will not search below the given lo value.

`impl Clone for BinarySearch`

fn clone(self: &Self) -> BinarySearch

`impl Copy for BinarySearch`

`impl Debug for BinarySearch`

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

`impl Freeze for BinarySearch`

`impl RefUnwindSafe for BinarySearch`

`impl Send for BinarySearch`

`impl Sync for BinarySearch`

`impl Unpin for BinarySearch`

`impl UnwindSafe for BinarySearch`

`impl ValueTree for BinarySearch`

fn current(self: &Self) -> u32
fn simplify(self: &mut Self) -> bool
fn complicate(self: &mut Self) -> bool

`impl<T> Any for BinarySearch`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for BinarySearch`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for BinarySearch`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> CloneToUninit for BinarySearch`

unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)

`impl<T> From for BinarySearch`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T> ToOwned for BinarySearch`

fn to_owned(self: &Self) -> T
fn clone_into(self: &Self, target: &mut T)

`impl<T, U> Into for BinarySearch`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for BinarySearch`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for BinarySearch`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>

`impl<V, T> VZip for BinarySearch`

fn vzip(self: Self) -> V