pub struct ToRealLE<T> { /* private fields */ }
Expand description
Reduce innermost axis to numbers within range. Leftmost is least significant.
§Examples
use optimal_binary::ToRealLE;
// It returns lower bound for empty arrays:
assert_eq!(ToRealLE::new(1.0..=2.0, 0).decode([]), 1.);
// It returns lower bound when all bits are false:
assert_eq!(ToRealLE::new(0.0..=1.0, 1).decode([false]), 0.);
assert_eq!(ToRealLE::new(1.0..=2.0, 2).decode([false, false]), 1.);
// It returns upper bound when all bits are true:
assert_eq!(ToRealLE::new(0.0..=1.0, 1).decode([true]), 1.);
assert_eq!(ToRealLE::new(1.0..=2.0, 2).decode([true, true]), 2.);
// It returns a number between lower and upper bound when some bits are true:
assert_eq!(ToRealLE::new(1.0..=4.0, 2).decode([true, false]), 2.);
assert_eq!(ToRealLE::new(1.0..=4.0, 2).decode([false, true]), 3.);
Implementations§
Trait Implementations§
impl<T: Eq> Eq for ToRealLE<T>
impl<T> StructuralPartialEq for ToRealLE<T>
Auto Trait Implementations§
impl<T> Freeze for ToRealLE<T>where
T: Freeze,
impl<T> RefUnwindSafe for ToRealLE<T>where
T: RefUnwindSafe,
impl<T> Send for ToRealLE<T>where
T: Send,
impl<T> Sync for ToRealLE<T>where
T: Sync,
impl<T> Unpin for ToRealLE<T>where
T: Unpin,
impl<T> UnwindSafe for ToRealLE<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more