Struct rv::test::GewekeTester
source · pub struct GewekeTester<Pr, Fx, X>{
pub pr: Pr,
pub nx: usize,
pub xs: Vec<X>,
pub prior_chain_stats: BTreeMap<String, Vec<f64>>,
pub posterior_chain_stats: BTreeMap<String, Vec<f64>>,
/* private fields */
}
Fields§
§pr: Pr
§nx: usize
§xs: Vec<X>
§prior_chain_stats: BTreeMap<String, Vec<f64>>
§posterior_chain_stats: BTreeMap<String, Vec<f64>>
Implementations§
source§impl<Pr, Fx, X> GewekeTester<Pr, Fx, X>
impl<Pr, Fx, X> GewekeTester<Pr, Fx, X>
pub fn new(pr: Pr, nx: usize) -> Self
pub fn eval(&self, max_err: f64) -> Result<(), String>
pub fn run_chains<R: Rng>(&mut self, n: usize, thinning: usize, rng: &mut R)
pub fn run_prior_chain<R: Rng>(&mut self, n: usize, rng: &mut R)
pub fn run_posterior_chain<R: Rng>( &mut self, n: usize, thinning: usize, rng: &mut R, )
Auto Trait Implementations§
impl<Pr, Fx, X> Freeze for GewekeTester<Pr, Fx, X>where
Pr: Freeze,
impl<Pr, Fx, X> RefUnwindSafe for GewekeTester<Pr, Fx, X>
impl<Pr, Fx, X> Send for GewekeTester<Pr, Fx, X>
impl<Pr, Fx, X> Sync for GewekeTester<Pr, Fx, X>
impl<Pr, Fx, X> Unpin for GewekeTester<Pr, Fx, X>
impl<Pr, Fx, X> UnwindSafe for GewekeTester<Pr, Fx, X>
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<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 moresource§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.