Struct Spread 

pub struct Spread {
    pub share: Value,
    pub kernel: Vec<(f64, f64)>,
    pub grid: [usize; 2],
    pub cells: Vec<Vec<[usize; 2]>>,
}

A share h of the counts arriving in each cell of a detector grid that the detector records elsewhere, spread by the radial kernel Σ_c w_c·exp(−r/s_c)/(2π s_c²) (transfer): region r records (1 − h)·μ_r + h·Σ_q F_rq·μ_q of the counts μ arriving in the regions in each bin of both runs, F_rq the share of the spread counts arriving evenly over region q’s cells that lands in region r’s cells (region_shares). Cells in no region neither send nor record counts.

Fields

share: Value

h, within 0–1.

kernel: Vec<(f64, f64)>

(w_c, s_c): each term’s weight, finite and positive, normalized by their sum, and length in cells, finite and positive.

grid: [usize; 2]

The grid’s rows and columns, at most 2^20 cells in all.

cells: Vec<Vec<[usize; 2]>>

Each region’s cells as [row, column], in the order of Measurement::regions; a cell is in one region at most.

Trait Implementations

impl Clone for Spread

fn clone(&self) -> Spread

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Spread

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

Formats the value using the given formatter.

impl PartialEq for Spread

fn eq(&self, other: &Spread) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Spread