Struct Kcode
pub struct Kcode {
pub recorded_cycles: u32,
pub settle_cycles: u32,
pub variables_provided: u32,
pub results: Vec<KcodeResult>,
}Expand description
KCODE tally data
The KCODE card specifies the MCNP criticality source that is used for determining keff.
If a MCTAL file is written during a KCODE problem, the number of recorded cycles, settle cycles, and variables provided are noted.
All KCODE quantities for each cycle are then listed on as many lines as necessary. These results are stored as a vector of KcodeResult for convenience.
Fields§
§recorded_cycles: u32Number of cycles recorded
settle_cycles: u32Number of cyles taken to stabilise result
variables_provided: u32Number of user defined variables
results: Vec<KcodeResult>List of Kcode results
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Kcode
impl RefUnwindSafe for Kcode
impl Send for Kcode
impl Sync for Kcode
impl Unpin for Kcode
impl UnwindSafe for Kcode
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> 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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.