pub struct Module { /* private fields */ }Implementations§
Source§impl Module
impl Module
pub fn new( name: RcStr, vars: Vec<RcStr>, doc: Option<RcStr>, docmap: Rc<HashMap<RcStr, RcStr>>, ) -> Module
pub fn new_with_cells( name: RcStr, vars: Vec<(RcStr, Rc<RefCell<Value>>)>, doc: Option<RcStr>, docmap: Rc<HashMap<RcStr, RcStr>>, ) -> Module
pub fn name(&self) -> &RcStr
pub fn map(&self) -> &HashMap<RcStr, Rc<RefCell<Value>>>
pub fn get<M>(&self, name: &M) -> Option<Value>
pub fn doc(&self) -> &Option<RcStr>
pub fn docmap(&self) -> &Rc<HashMap<RcStr, RcStr>>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Module
impl !RefUnwindSafe for Module
impl !Send for Module
impl !Sync for Module
impl Unpin for Module
impl UnsafeUnpin for Module
impl !UnwindSafe for Module
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> SetParameter for T
impl<T> SetParameter 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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.