pub struct ArithPlan {
pub dmax: u32,
pub arith: Arith,
pub prepass: Vec<u32>,
pub steps: Vec<ArithStep>,
pub remainder: Option<RemainderPlan>,
pub handled: bool,
pub per_receiver: bool,
pub inner_dmax: u32,
}Fields§
§dmax: u32§arith: Arith§prepass: Vec<u32>The places the walker’s dmax pre-pass locates, in its order, static ones left out.
steps: Vec<ArithStep>§remainder: Option<RemainderPlan>§handled: boolON or NOT ON SIZE ERROR is written.
per_receiver: boolADD, SUBTRACT, MULTIPLY or DIVIDE rather than COMPUTE: a step whose expression has its own receiver as an operand of its top operation evaluates the other operand with every step’s, and reads the receiver only when it stores.
inner_dmax: u32The dmax of every operation below a step’s top one, which dmax is for: lower than dmax
only under –dialect gnucobol, where a ROUNDED receiver’s extra place counts in the top
operation alone (assumption C101).
Trait Implementations§
impl Eq for ArithPlan
impl StructuralPartialEq for ArithPlan
Auto Trait Implementations§
impl Freeze for ArithPlan
impl RefUnwindSafe for ArithPlan
impl Send for ArithPlan
impl Sync for ArithPlan
impl Unpin for ArithPlan
impl UnsafeUnpin for ArithPlan
impl UnwindSafe for ArithPlan
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