pub enum DistributionSamplerKind<P>where
Standard: Distribution<P>,
P: SampleUniform,{
Standard(Standard),
Uniform(Uniform<P>),
Bernoulli(Bernoulli),
Normal(Normal),
}Variants§
Auto Trait Implementations§
impl<P> RefUnwindSafe for DistributionSamplerKind<P>where
<P as SampleUniform>::Sampler: RefUnwindSafe,
impl<P> Send for DistributionSamplerKind<P>where
<P as SampleUniform>::Sampler: Send,
impl<P> Sync for DistributionSamplerKind<P>where
<P as SampleUniform>::Sampler: Sync,
impl<P> Unpin for DistributionSamplerKind<P>where
<P as SampleUniform>::Sampler: Unpin,
impl<P> UnwindSafe for DistributionSamplerKind<P>where
<P as SampleUniform>::Sampler: UnwindSafe,
Blanket Implementations§
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.