pub struct LvkCdf {
pub g_steps: usize,
pub c_steps: usize,
pub g_max: f64,
pub marginal_g: Vec<f64>,
pub conditional_c: Vec<Vec<f64>>,
}Expand description
Pre-computed CDF table for efficient LVK sampling. Built once per LDT, then sampled in O(log n) via binary search. Pre-computed CDF table for efficient LVK sampling.
Fields§
§g_steps: usizeGamma angles sampled at 1° resolution
c_steps: usizeC angles sampled at 5° resolution
g_max: f64g_max from LDT data
marginal_g: Vec<f64>Marginal CDF over gamma: P(G <= g)
conditional_c: Vec<Vec<f64>>Conditional CDF over C for each gamma bin: P(C <= c | G=g)
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LvkCdf
impl RefUnwindSafe for LvkCdf
impl Send for LvkCdf
impl Sync for LvkCdf
impl Unpin for LvkCdf
impl UnsafeUnpin for LvkCdf
impl UnwindSafe for LvkCdf
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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<T> Pointable for T
impl<T> Pointable for T
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.