Struct FlightTimeGrid 

pub struct FlightTimeGrid { /* private fields */ }

Uniform flight-time grid over a window, with the probability that each grid point’s neutrons are counted in each bin.

Implementations

impl FlightTimeGrid

pub fn new( time_edges_us: &[f64], t0_us: f64, pulse: &Arc<IkedaCarpenter>, ) -> Result<Self, FlightTimeGridError>

The grid for bins time_edges_us (µs) with timing offset t0_us, the flight path taken from pulse. The step, half the pulse’s shorter rise at the two ends of the range, is a starting step: the counts are converged once Self::halved no longer changes them.

Errors

See FlightTimeGridError.

pub fn halved(&self) -> Result<Self, FlightTimeGridError>

The same window at half the step.

Errors

As Self::new, when the halved grid exceeds MAX_POINTS.

pub fn range_us(&self) -> (f64, f64)

(u_lo, u_hi), the flight-time range in µs.

pub fn step_us(&self) -> f64

The grid step in µs.

pub fn flight_times_us(&self) -> &[f64]

The grid’s flight times in µs, ascending.

pub fn energies_ev(&self) -> Vec<f64>

The energy, in eV, of each grid point, descending.

pub fn predict(&self, values: &[f64]) -> Result<Vec<f64>, FlightTimeGridError>

step · Σ_j v_j P_k(u_j) for each bin k: the counts a beam of values[j] neutrons per µs at each grid point predicts, or, for any other per-point values, the same linear map. It differs from the trapezoid rule by half a step of the end points’ terms, where P_k is zero, or at most NEGLIGIBLE_ARRIVAL_PROBABILITY at the fast end for an unfolded pulse. Features of the values narrower than the step are not resolved.

Errors

FlightTimeGridError::ValuesLength unless values has one entry per grid point.

Trait Implementations

impl Clone for FlightTimeGrid

fn clone(&self) -> FlightTimeGrid

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for FlightTimeGrid

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.