pub enum LimitKind {
TravelExceeded,
HoldBoundExceeded,
NoTravelData,
NoHoldBoundData,
}Expand description
Why a DialPlan component was clamped, or could not be verified feasible (MBA-1348).
Paired with the offending Axis in a LimitViolation.
Variants§
TravelExceeded
The dial target exceeded the axis’s declared TravelLimits and was clamped to it.
HoldBoundExceeded
The hold component exceeded the axis’s declared HoldBounds and/or
Preferences::max_hold_mil. Holds are never clamped – see Strategy::HoldAll.
NoTravelData
A nonzero dial target was needed, but the optic profile declares no TravelLimits
for this axis, so reachability could not be verified. NOT the same claim as
TravelExceeded – see the module’s “Honesty” doc section.
NoHoldBoundData
A nonzero hold was needed, but neither HoldBounds nor Preferences::max_hold_mil
is declared for this axis, so fitting the reticle could not be verified.
Trait Implementations§
impl Copy for LimitKind
Source§impl<'de> Deserialize<'de> for LimitKind
impl<'de> Deserialize<'de> for LimitKind
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 Eq for LimitKind
impl StructuralPartialEq for LimitKind
Auto Trait Implementations§
impl Freeze for LimitKind
impl RefUnwindSafe for LimitKind
impl Send for LimitKind
impl Sync for LimitKind
impl Unpin for LimitKind
impl UnsafeUnpin for LimitKind
impl UnwindSafe for LimitKind
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>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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.