Struct Cdf 

pub struct Cdf(pub Distribution);

Distribution::cdf as a function object. The normal and log-normal distributions’ slice forms take erfc from Erfc’s slice form, which computes only the formulas that each block of arguments needs. The Cauchy distribution’s takes atan from Atan’s, and the Weibull distribution uses the shared [Pow] formula.

Tuple Fields

0: Distribution

Trait Implementations

impl Clone for Cdf

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 Cdf

impl Debug for Cdf

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

Formats the value using the given formatter.

impl Formula<1> for Cdf

const FAILS_NAN: bool = true

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.

fn supports(&self, dtype: DType) -> bool

fn real<F: Native>( &self, _: &NativeOps<{ crate::FUSED }>, [x]: [F; 1], ) -> Option<F>

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

const BOOLEAN: bool = false

const HAS_EXACT: bool = false

Whether exact computes this formula on rationals.

const INTEGER_FORMULA: bool = false

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.

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 exact(&self, _args: [&BigRational; N]) -> Result<Option<BigRational>, 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 identity(&self) -> [Option<f64>; N]

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

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 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 integer<I: Overflowing>(&self, _ops: &IntegerOps<I>, _x: [I; N]) -> Option<I>

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.

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

impl PartialEq for Cdf

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

Equality operator ==.

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

Inequality operator !=.

impl Results<f16, 1> for Cdf

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

The type of each result.

impl Results<f32, 1> for Cdf

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

The type of each result.

impl Results<f64, 1> for Cdf

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

The type of each result.

impl StructuralPartialEq for Cdf

impl Unary<f16> for Cdf

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

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

fn slice( &self, x: [Arg<'_, f16>; 1], n: usize, out: &mut [MaybeUninit<f16>], ) -> bool

fn checked(&self, x: T) -> Option<Self::Out>

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

where T: Copy + Sync,

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

where T: Copy,

impl Unary<f32> for Cdf

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

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

fn slice( &self, [x]: [Arg<'_, f32>; 1], n: usize, out: &mut [MaybeUninit<f32>], ) -> bool

fn checked(&self, x: T) -> Option<Self::Out>

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

where T: Copy + Sync,

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

where T: Copy,

impl Unary<f64> for Cdf

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

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

fn slice( &self, [x]: [Arg<'_, f64>; 1], n: usize, out: &mut [MaybeUninit<f64>], ) -> bool

fn checked(&self, x: T) -> Option<Self::Out>

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

where T: Copy + Sync,

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

where T: Copy,