Struct Resolved

Source

pub struct Resolved {Show 13 fields
    pub input: Input,
    pub beam: Beam,
    pub divergence: Divergence,
    pub stack: Stack,
    pub layers: Vec<ResolvedLayer>,
    pub config: BcaConfig,
    pub screening: Screening,
    pub screening_length: ScreeningLength,
    pub table_spec: TableSpec,
    pub stopping_tables: Vec<LoadedStoppingTable>,
    pub crystals: Vec<ResolvedCrystal>,
    pub warnings: Vec<String>,
    pub tuning: Option<TuningReport>,
}

Expand description

A validated input, in the engine’s types.

Fields§

§input: Input

The input with defaults filled in (including the screening length).

§beam: Beam

The beam.

§divergence: Divergence

Beam divergence about the nominal direction (crate::ion::crystal::Divergence::None without [beam.divergence]).

§stack: Stack

The target.

§layers: Vec<ResolvedLayer>

Layers in stack order, with where each material came from.

§config: BcaConfig

Engine configuration (including the seed).

§screening: Screening

Screening function.

§screening_length: ScreeningLength

Screening length.

§table_spec: TableSpec

Scattering-table grid.

§stopping_tables: Vec<LoadedStoppingTable>

User stopping tables, in input order (empty without [stopping]).

§crystals: Vec<ResolvedCrystal>

Crystal assignments, in input order (empty: amorphous run).

§warnings: Vec<String>

Non-fatal advice (e.g. beam energy outside a model’s validity range).

§tuning: Option<TuningReport>

The tuning applied, if [physics] tuning named a set.

Implementations§

Source §

impl Resolved

Source

pub fn stopping_model(&self) -> Box<dyn ElectronicStopping + Send + Sync>

The electronic stopping model of the run: the [physics] stopping choice, with any [stopping] tables layered over it for the pairs they declare. This is what to pass to the engine.

Source

pub fn models(&self) -> Vec<ModelInfo>

Every model in use, with its published source, in a fixed order.

Trait Implementations§

Source §

impl Clone for Resolved

Source §

fn clone(&self) -> Resolved

Returns a duplicate of the value. Read more

1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more

Source §

impl Debug for Resolved

Source §

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl UnwindSafe for Resolved

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source §

impl<T> CloneToUninit for T
where T: Clone,

Source §

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

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 more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

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 more

§