Struct cont_arith_code::Samples
source · pub struct Samples<D, T> {
pub count: usize,
pub vec: Vec<T>,
pub sampl: Sample<D, T>,
}
Expand description
A vector of values from a distribution. MLE for best results. The model is static and therefore not optimal (values don’t get removed from the distribution, so like a bag “with replacement”)
Fields§
§count: usize
§vec: Vec<T>
§sampl: Sample<D, T>
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<D, T> Freeze for Samples<D, T>where
D: Freeze,
impl<D, T> !RefUnwindSafe for Samples<D, T>
impl<D, T> !Send for Samples<D, T>
impl<D, T> !Sync for Samples<D, T>
impl<D, T> Unpin for Samples<D, T>
impl<D, T> !UnwindSafe for Samples<D, T>
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
§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.