Struct FloorDivide 

pub struct FloorDivide(pub Tolerance);

The tolerant floor of rounded x ÷ y, as a formula object. A float quotient never fails. Integers divide exactly, give a zero divisor the type’s limit of the dividend’s sign, and fail on an overflowing quotient.

Tuple Fields

0: Tolerance

Trait Implementations

impl Clone for FloorDivide

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for FloorDivide

impl Debug for FloorDivide

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

Formats the value using the given formatter.

impl Formula<2> for FloorDivide

const HAS_EXACT: bool = true

Whether exact computes this formula on rationals.

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 identity(&self) -> [Option<f64>; 2]

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, [_, _]: [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 emit_valid<F: Float, O: Ops<F> + ?Sized>( &self, v: Variant, o: &O, [x, y]: [O::V; 2], _: O::V, ) -> Option<(Kind, O::B)>

fn native_slices(&self) -> Option<NativeSlices<Self, $n>>

const BOOLEAN: 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.

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 character_rule(&self) -> Option<Rule>

fn ordered_kinds(&self, [x, y]: [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_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 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_test<F: Float, O: Ops<F> + ?Sized>( &self, _o: &O, _x: [O::V; N], ) -> 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.

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 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>>

const REAL_COMPLEX: bool = false

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

fn real_complex<F: Native>( &self, _ops: &NativeOps<{ crate::FUSED }>, _x: [F; N], ) -> Option<Complex<F>>

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

impl PartialEq for FloorDivide

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for FloorDivide