pub struct GoalSpec {
pub node_id: String,
pub expected_symbols: Vec<String>,
}Expand description
The set of symbols a node’s work is required to bring into existence.
A node with an empty spec has no goal-presence obligation: the sensor stays silent rather than guessing, so it never penalizes work whose success cannot be expressed as “these named symbols must exist”.
Fields§
§node_id: String§expected_symbols: Vec<String>Symbol names that MUST be present once the node is done.
Implementations§
Trait Implementations§
impl Eq for GoalSpec
impl StructuralPartialEq for GoalSpec
Auto Trait Implementations§
impl Freeze for GoalSpec
impl RefUnwindSafe for GoalSpec
impl Send for GoalSpec
impl Sync for GoalSpec
impl Unpin for GoalSpec
impl UnsafeUnpin for GoalSpec
impl UnwindSafe for GoalSpec
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.