pub struct RascalVM {
pub bindings: HashMap<String, (String, String)>,
pub equalities: HashMap<String, EqualityWith>,
pub push_values: Vec<String>,
/* private fields */
}
Fields
bindings: HashMap<String, (String, String)>
equalities: HashMap<String, EqualityWith>
push_values: Vec<String>
Implementations
sourceimpl RascalVM
impl RascalVM
pub fn new() -> Self
pub fn is_something_printed(&self) -> bool
pub fn interpret_stateful(
&mut self,
world: &mut World,
system: &SystemSignature
)
pub fn interpret_eventful(
&mut self,
world: &mut World,
system: &SystemSignature,
event_descriptor: &ComponentSignature,
chunk: BinaryComponent
) -> Option<RascalEventfulResult>
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for RascalVM
impl Send for RascalVM
impl Sync for RascalVM
impl Unpin for RascalVM
impl UnwindSafe for RascalVM
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.