pub struct Minimum;Expand description
minimum as a function object, which also takes integers and Booleans. The minimum of two Booleans is their and.
Trait Implementations§
Source§impl Binary<bool> for Minimum
impl Binary<bool> for Minimum
fn one(&self, x: bool, y: bool) -> bool
fn judged(&self, x: bool, y: bool) -> (bool, bool)
fn slice( &self, args: [Arg<'_, bool>; 2], n: usize, out: &mut [MaybeUninit<bool>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<f16> for Minimum
impl Binary<f16> for Minimum
fn one(&self, x: f16, y: f16) -> f16
fn judged(&self, x: f16, y: f16) -> (f16, bool)
fn slice( &self, x: [Arg<'_, f16>; 2], n: usize, out: &mut [MaybeUninit<f16>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<f32> for Minimum
impl Binary<f32> for Minimum
fn one(&self, x: f32, y: f32) -> f32
fn judged(&self, x: f32, y: f32) -> (f32, bool)
fn slice( &self, args: [Arg<'_, f32>; 2], n: usize, out: &mut [MaybeUninit<f32>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<f64> for Minimum
impl Binary<f64> for Minimum
fn one(&self, x: f64, y: f64) -> f64
fn judged(&self, x: f64, y: f64) -> (f64, bool)
fn slice( &self, args: [Arg<'_, f64>; 2], n: usize, out: &mut [MaybeUninit<f64>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<i16> for Minimum
impl Binary<i16> for Minimum
fn one(&self, x: i16, y: i16) -> i16
fn judged(&self, x: i16, y: i16) -> (i16, bool)
fn slice( &self, args: [Arg<'_, i16>; 2], n: usize, out: &mut [MaybeUninit<i16>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<i32> for Minimum
impl Binary<i32> for Minimum
fn one(&self, x: i32, y: i32) -> i32
fn judged(&self, x: i32, y: i32) -> (i32, bool)
fn slice( &self, args: [Arg<'_, i32>; 2], n: usize, out: &mut [MaybeUninit<i32>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<i64> for Minimum
impl Binary<i64> for Minimum
fn one(&self, x: i64, y: i64) -> i64
fn judged(&self, x: i64, y: i64) -> (i64, bool)
fn slice( &self, args: [Arg<'_, i64>; 2], n: usize, out: &mut [MaybeUninit<i64>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
Source§impl Binary<u8> for Minimum
impl Binary<u8> for Minimum
fn one(&self, x: u8, y: u8) -> u8
fn judged(&self, x: u8, y: u8) -> (u8, bool)
fn slice( &self, args: [Arg<'_, u8>; 2], n: usize, out: &mut [MaybeUninit<u8>], ) -> bool
fn checked(&self, x: T, y: T) -> Option<Self::Out>
fn many( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Vec<Self::Out>, ) -> bool
fn many_into(
&self,
x: Arg<'_, T>,
y: Arg<'_, T>,
n: usize,
out: &mut Slots<'_, Self::Out>,
) -> boolwhere
T: Copy,
impl Copy for Minimum
Source§impl Formula<2> for Minimum
impl Formula<2> for Minimum
Source§const INTEGER_FORMULA: bool = true
const INTEGER_FORMULA: bool = true
Whether
integer runs this formula’s emit on integers, so that range arithmetic over emit_valid bounds an integer kernel’s failures (may_raise). A row with a native_integer body supports integers and leaves this false.fn exact(&self, [x, y]: [&BigRational; 2]) -> Result<Option<BigRational>, Error>
fn character_rule(&self) -> Option<Rule>
fn range(&self, [x, y]: [Range; 2]) -> Range
fn identity(&self) -> [Option<f64>; 2]
fn fold(&self) -> Option<Reduce>
Source§fn truth_table(&self) -> Option<u8>
fn truth_table(&self) -> Option<u8>
The function’s results on Booleans, as bits: bit
2x+y for two arguments, bit x for one. A Boolean kernel computes by it (operation::map_truth).fn supports(&self, dtype: DType) -> bool
fn emit<F: Float, O: Ops<F> + ?Sized>( &self, o: &O, [x, y]: [O::V; 2], ) -> Option<O::V>
fn emit_partials<F: Float, O: Ops<F> + ?Sized>( &self, o: &O, [x, y]: [O::V; 2], _: O::V, [nx, ny]: [bool; 2], ) -> [Option<O::V>; 2]
fn integer<I: Overflowing>(&self, o: &IntegerOps<I>, x: [I; 2]) -> Option<I>
fn native_slices(&self) -> Option<NativeSlices<Self, $n>>
const BOOLEAN: bool = false
Source§const FAILS_NAN: bool = false
const FAILS_NAN: bool = false
Whether a NaN result from arguments that aren’t NaN is a Domain error, which the default
emit_valid checks (nan_valid). A constant, so a checked loop over items reads it at compile time and never calls a method for it.Source§const MAP_ONLY: bool = false
const MAP_ONLY: bool = false
Whether kernels of this formula only map. Modified writes, folds, scans and walks of adjacent items build no code for it: each refuses it at compile time, as it refuses a formula of another arity. A derivative’s slope (
derivative::Slope) only maps.fn result_dtype(&self, input: DType) -> DType
fn computing_dtype(&self, input: DType) -> Option<DType>
fn ordered_kinds(&self, [x, y]: [i32; 2]) -> Option<i32>
fn character_policy(&self, types: [DType; 2]) -> Result<Option<Policy>, Error>
Source§fn domain(&self, _dtype: DType, _args: [Range; N]) -> Option<[Range; N]>
fn domain(&self, _dtype: DType, _args: [Range; N]) -> Option<[Range; N]>
A box at the computing dtype containing args on which graph-numeric results do not raise a data error.
fn inverse_fold(&self) -> Option<Reduce>
fn truth(&self) -> Option<Reduce>
Source§fn same(&self, _arg: Range) -> Option<Range>
fn same(&self, _arg: Range) -> Option<Range>
Refines the real result interval when both operands denote the same value.
fn reads(&self) -> Reads
fn emit_test<F: Float, O: Ops<F> + ?Sized>( &self, _o: &O, _x: [O::V; N], ) -> Option<O::B>
Source§fn emit_against<F: Float, O: Ops<F> + ?Sized>(
&self,
_o: &O,
_c: F,
_v: O::V,
_left: bool,
) -> Option<O::B>
fn emit_against<F: Float, O: Ops<F> + ?Sized>( &self, _o: &O, _c: F, _v: O::V, _left: bool, ) -> Option<O::B>
This comparison of
v with the one number c through o, where that has a cheaper recipe than comparing item by item, as a held constant has. left says whether v is the left argument. None for other formulas.Source§fn bands(&self) -> Option<(Tolerance, Band, Band)>
fn bands(&self) -> Option<(Tolerance, Band, Band)>
This comparison’s tolerance, and the bands that an item on the left and on the right of one number must lie in (
tolerant::Banding), through which it compares many items with one number (tolerant::against). None for other formulas.fn emit_repair<F: Float, O: Ops<F> + ?Sized>( &self, _o: &O, _x: [O::V; N], ) -> Option<O::B>
fn repair_routine(&self) -> Option<Repair>
fn emit_valid<F: Float, O: Ops<F> + ?Sized>( &self, _variant: Variant, o: &O, x: [O::V; N], result: O::V, ) -> Option<(Kind, O::B)>
fn real<F: Native>( &self, ops: &NativeOps<{ crate::FUSED }>, x: [F; N], ) -> Option<F>
fn complex<F: Native>( &self, _ops: &NativeOps<{ crate::FUSED }>, _x: [Complex<F>; N], ) -> Option<Complex<F>>
Source§const REAL_COMPLEX: bool = false
const REAL_COMPLEX: bool = false
Whether
real_complex gives this formula’s complex results from real arguments.Auto Trait Implementations§
impl Forget for Minimum
impl Freeze for Minimum
impl RefUnwindSafe for Minimum
impl Send for Minimum
impl Sync for Minimum
impl Unpin for Minimum
impl UnsafeUnpin for Minimum
impl UnwindSafe for Minimum
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more