pub struct RecombinationHistory { /* private fields */ }Expand description
Precomputed recombination history for fast X_e(z) lookups.
Integrates the Peebles ODE once on construction and stores a table of (z, X_e) pairs. Subsequent lookups use binary search + linear interpolation, making each call O(log N) instead of O(N_ode).
For z above the Peebles regime (z > z_switch ~ 1575), the cheap Saha formula is used directly (no table needed).
Implementations§
Auto Trait Implementations§
impl Freeze for RecombinationHistory
impl RefUnwindSafe for RecombinationHistory
impl Send for RecombinationHistory
impl Sync for RecombinationHistory
impl Unpin for RecombinationHistory
impl UnwindSafe for RecombinationHistory
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