pub struct ProgramState {
pub symbol_table: Ref<SymbolTable>,
pub functions: Ref<Functions>,
pub plan: Plan,
pub kinds: HashMap<u64, ValueKind>,
pub dictionary: Ref<HashMap<u64, String>>,
}
Fields§
§symbol_table: Ref<SymbolTable>
§functions: Ref<Functions>
§plan: Plan
§kinds: HashMap<u64, ValueKind>
§dictionary: Ref<HashMap<u64, String>>
Implementations§
Source§impl ProgramState
impl ProgramState
pub fn new() -> ProgramState
pub fn get_symbol(&self, id: u64) -> Option<Ref<Value>>
pub fn add_plan_step(&self, step: Box<dyn MechFunction>)
pub fn insert_function(&self, fxn: FunctionDefinition)
pub fn save_symbol( &self, id: u64, name: String, value: Value, mutable: bool, ) -> Ref<Value>
Auto Trait Implementations§
impl Freeze for ProgramState
impl !RefUnwindSafe for ProgramState
impl !Send for ProgramState
impl !Sync for ProgramState
impl Unpin for ProgramState
impl !UnwindSafe for ProgramState
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.