pub struct Functions {
pub functions: FunctionTable,
pub function_compilers: FunctionCompilerTable,
pub dictionary: Ref<Dictionary>,
}
Fields§
§functions: FunctionTable
§function_compilers: FunctionCompilerTable
§dictionary: Ref<Dictionary>
Implementations§
Source§impl Functions
impl Functions
pub fn new() -> Self
pub fn insert_function(&mut self, fxn: FunctionDescriptor)
Auto Trait Implementations§
impl Freeze for Functions
impl !RefUnwindSafe for Functions
impl !Send for Functions
impl !Sync for Functions
impl Unpin for Functions
impl !UnwindSafe for Functions
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<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.