pub struct RobustHoldRequest {
pub scenarios: WindScenarioSetV1,
pub ranges_m: Vec<f64>,
pub target: Option<TargetSpec>,
pub load: CorridorLoad,
}Expand description
One robust-hold run.
Fields§
§scenarios: WindScenarioSetV1§ranges_m: Vec<f64>Ranges to report, meters. Order is preserved in the report; duplicates are rejected.
target: Option<TargetSpec>§load: CorridorLoadImplementations§
Source§impl RobustHoldRequest
impl RobustHoldRequest
Sourcepub fn validate(&self) -> Result<(), WindScenarioError>
pub fn validate(&self) -> Result<(), WindScenarioError>
Validate everything cheap BEFORE any trajectory work begins.
That ordering is the point of the ticket’s cap criterion: an oversized or malformed request must cost a validation pass, never eight full solves.
Trait Implementations§
Source§impl Clone for RobustHoldRequest
impl Clone for RobustHoldRequest
Source§fn clone(&self) -> RobustHoldRequest
fn clone(&self) -> RobustHoldRequest
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RobustHoldRequest
impl Debug for RobustHoldRequest
Source§impl PartialEq for RobustHoldRequest
impl PartialEq for RobustHoldRequest
impl StructuralPartialEq for RobustHoldRequest
Auto Trait Implementations§
impl Freeze for RobustHoldRequest
impl RefUnwindSafe for RobustHoldRequest
impl Send for RobustHoldRequest
impl Sync for RobustHoldRequest
impl Unpin for RobustHoldRequest
impl UnwindSafe for RobustHoldRequest
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<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.