Struct statrs::distribution::Pareto
source · pub struct Pareto { /* private fields */ }
Expand description
Implementations§
source§impl Pareto
impl Pareto
sourcepub fn new(scale: f64, shape: f64) -> Result<Pareto>
pub fn new(scale: f64, shape: f64) -> Result<Pareto>
Constructs a new Pareto distribution with scale scale
, and shape
shape.
Errors
Returns an error if any of scale
or shape
are NaN
.
Returns an error if scale <= 0.0
or shape <= 0.0
Examples
use statrs::distribution::Pareto;
let mut result = Pareto::new(1.0, 2.0);
assert!(result.is_ok());
result = Pareto::new(0.0, 0.0);
assert!(result.is_err());
Trait Implementations§
source§impl ContinuousCDF<f64, f64> for Pareto
impl ContinuousCDF<f64, f64> for Pareto
source§fn inverse_cdf(&self, p: T) -> K
fn inverse_cdf(&self, p: T) -> K
Due to issues with rounding and floating-point accuracy the default
implementation may be ill-behaved.
Specialized inverse cdfs should be used whenever possible.
Performs a binary search on the domain of
cdf
to obtain an approximation
of F^-1(p) := inf { x | F(x) >= p }
. Needless to say, performance may
may be lacking.source§impl Distribution<f64> for Pareto
impl Distribution<f64> for Pareto
source§impl Distribution<f64> for Pareto
impl Distribution<f64> for Pareto
source§fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> f64
Generate a random value of
T
, using rng
as the source of randomness.source§impl PartialEq<Pareto> for Pareto
impl PartialEq<Pareto> for Pareto
impl Copy for Pareto
impl StructuralPartialEq for Pareto
Auto Trait Implementations§
impl RefUnwindSafe for Pareto
impl Send for Pareto
impl Sync for Pareto
impl Unpin for Pareto
impl UnwindSafe for Pareto
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
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.