Struct Greater 

pub struct Greater(pub Tolerance);

Tolerant::greater at the tolerance it holds, as a function object.

Tuple Fields

0: Tolerance

Trait Implementations

impl Banding for Greater

const BANDS: (Band, Band)

impl Binary<f16> for Greater

fn one(&self, x: f16, y: f16) -> bool

fn judged(&self, x: f16, y: f16) -> (bool, bool)

fn slice( &self, x: [Arg<'_, f16>; 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

where T: Copy + Sync,

fn many_into( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Slots<'_, Self::Out>, ) -> bool

where T: Copy,

impl Binary<f32> for Greater

fn one(&self, x: f32, y: f32) -> bool

fn judged(&self, x: f32, y: f32) -> (bool, bool)

fn slice( &self, _: [Arg<'_, f32>; 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

where T: Copy + Sync,

fn many_into( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Slots<'_, Self::Out>, ) -> bool

where T: Copy,

impl Binary<f64> for Greater

fn one(&self, x: f64, y: f64) -> bool

fn judged(&self, x: f64, y: f64) -> (bool, bool)

fn slice( &self, _: [Arg<'_, f64>; 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

where T: Copy + Sync,

fn many_into( &self, x: Arg<'_, T>, y: Arg<'_, T>, n: usize, out: &mut Slots<'_, Self::Out>, ) -> bool

where T: Copy,

impl Clone for Greater

fn clone(&self) -> Greater

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Greater

impl Debug for Greater

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

Formats the value using the given formatter.

impl Formula<2> for Greater

const HAS_EXACT: bool = true

Whether exact computes this formula on rationals.

const BOOLEAN: 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, _: [&Ratio<BigInt>; 2]) -> Result<Option<Ratio<BigInt>>, Error>

fn character_rule(&self) -> Option<Rule>

fn identity(&self) -> [Option<f64>; 2]

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_test<F, O>( &self, o: &O, _: [<O as Ops<F>>::V; 2], ) -> Option<<O as Ops<F>>::B>

where F: Float, O: Ops<F> + ?Sized,

fn emit_against<F, O>( &self, o: &O, c: F, v: <O as Ops<F>>::V, left: bool, ) -> Option<<O as Ops<F>>::B>

where F: Float, O: Ops<F> + ?Sized,

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.

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 integer<I>(&self, o: &IntegerOps<I>, x: [I; 2]) -> Option<I>

where I: Overflowing,

fn native_slices(&self) -> Option<NativeSlices<Greater, 2>>

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.

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, _: [i32; 2]) -> Option<i32>

fn character_policy(&self, types: [DType; 2]) -> Result<Option<Policy>, Error>

fn range(&self, _args: [Range; N]) -> Range

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 fold(&self) -> Option<Reduce>

fn inverse_fold(&self) -> Option<Reduce>

fn truth(&self) -> Option<Reduce>

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<F, O>( &self, _o: &O, _x: [<O as Ops<F>>::V; N], ) -> Option<<O as Ops<F>>::V>

where F: Float, O: Ops<F> + ?Sized,

fn emit_repair<F, O>( &self, _o: &O, _x: [<O as Ops<F>>::V; N], ) -> Option<<O as Ops<F>>::B>

where F: Float, O: Ops<F> + ?Sized,

fn repair_routine(&self) -> Option<Repair>

fn emit_valid<F, O>( &self, _variant: Variant, o: &O, x: [<O as Ops<F>>::V; N], result: <O as Ops<F>>::V, ) -> Option<(Kind, <O as Ops<F>>::B)>

where F: Float, O: Ops<F> + ?Sized,

fn real<F>( &self, ops: &NativeOps<rustymath_core::::facts::Formula::real::{constant#0}>, x: [F; N], ) -> Option<F>

where F: Native,

fn complex<F>( &self, _ops: &NativeOps<rustymath_core::::facts::Formula::complex::{constant#0}>, _x: [Complex<F>; N], ) -> Option<Complex<F>>

where F: Native,

const REAL_COMPLEX: bool = false

Whether real_complex gives this formula’s complex results from real arguments.

fn real_complex<F>( &self, _ops: &NativeOps<rustymath_core::::facts::Formula::real_complex::{constant#0}>, _x: [F; N], ) -> Option<Complex<F>>

where F: Native,

The complex result from real arguments, where that costs less than from the arguments as complex numbers. None sends the item to complex.

fn emit_partials<F, O>( &self, _o: &O, _x: [<O as Ops<F>>::V; N], _result: <O as Ops<F>>::V, _needed: [bool; N], ) -> [Option<<O as Ops<F>>::V>; N]

where F: Float, O: Ops<F> + ?Sized,

impl PartialEq for Greater

fn eq(&self, other: &Greater) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Results<f16, 2> for Greater

const TOTAL: bool

Whether no result fails: checked always gives Some, and many and many_into always give true. A total float function gives NaN from arguments that aren’t NaN only where NaN is its value, as Subtract gives for ∞ - ∞ and Sin for ±∞.

type Out = bool

The type of each result.

impl Results<f32, 2> for Greater

const TOTAL: bool

Whether no result fails: checked always gives Some, and many and many_into always give true. A total float function gives NaN from arguments that aren’t NaN only where NaN is its value, as Subtract gives for ∞ - ∞ and Sin for ±∞.

type Out = bool

The type of each result.

impl Results<f64, 2> for Greater

const TOTAL: bool

Whether no result fails: checked always gives Some, and many and many_into always give true. A total float function gives NaN from arguments that aren’t NaN only where NaN is its value, as Subtract gives for ∞ - ∞ and Sin for ±∞.

type Out = bool

The type of each result.

impl Stepped for Greater

fn steps<F, O>( self, o: &O, x: <O as Ops<F>>::V, y: <O as Ops<F>>::V, ) -> <O as Ops<F>>::B

where F: Float, O: Ops<F> + ?Sized,

The comparison of x and y through o, at float type F.

impl StructuralPartialEq for Greater