pub struct DialPlan {
pub strategy: Strategy,
pub instructions: [AxisInstruction; 2],
pub residual_linear_at_range_m: f64,
pub feasible: bool,
pub limits_hit: Vec<LimitViolation>,
}Expand description
One ranked, executable plan for delivering a two-axis AngularCorrection (MBA-1348).
instructions is always exactly [elevation, windage].
Fields§
§strategy: Strategy§instructions: [AxisInstruction; 2]§residual_linear_at_range_m: f64RSS of both axes’ residual_mil, mil-to-linear at DialPlanReportV1::range_m by
the small-angle approximation (assumption 0). The ranking key AMONG EQUALLY-FEASIBLE
plans – feasible itself is checked first (MBA-1348 review fix I4) – see
plan_corrections’s doc comment.
feasible: boolfalse whenever a LimitViolation this strategy’s OWN promise depends on is
present in limits_hit – see the module’s “Honesty” doc section for what each
strategy promises, and therefore what gates it.
limits_hit: Vec<LimitViolation>Trait Implementations§
Source§impl<'de> Deserialize<'de> for DialPlan
impl<'de> Deserialize<'de> for DialPlan
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for DialPlan
Auto Trait Implementations§
impl Freeze for DialPlan
impl RefUnwindSafe for DialPlan
impl Send for DialPlan
impl Sync for DialPlan
impl Unpin for DialPlan
impl UnsafeUnpin for DialPlan
impl UnwindSafe for DialPlan
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T> Scalar for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.