Struct cont_arith_code::Decoder 
source · pub struct Decoder<M: Model<T>, I: Iterator<Item = bool>, T> {
    pub code: I,
    pub model: M,
    pub distr: Box<dyn TruncatedDistribution>,
    pub lo_splits: Vec<f64>,
    pub hi_splits: Vec<f64>,
    pub last_bit: bool,
    /* private fields */
}Expand description
Turns a model and binary code into a value
Fields§
§code: I§model: M§distr: Box<dyn TruncatedDistribution>§lo_splits: Vec<f64>§hi_splits: Vec<f64>§last_bit: boolImplementations§
Auto Trait Implementations§
impl<M, I, T> Freeze for Decoder<M, I, T>
impl<M, I, T> !RefUnwindSafe for Decoder<M, I, T>
impl<M, I, T> !Send for Decoder<M, I, T>
impl<M, I, T> !Sync for Decoder<M, I, T>
impl<M, I, T> Unpin for Decoder<M, I, T>
impl<M, I, T> !UnwindSafe for Decoder<M, I, 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.