Struct caffe2_nomnigraph::Notifier
source · pub struct Notifier<T> { /* private fields */ }Expand description
| ———–
| @brief
|
| This class enables a listener pattern.
|
| It is to be used with a “curious recursive
| pattern” i.e. Derived : public Notifier
Implementations§
source§impl<T> Notifier<T>
impl<T> Notifier<T>
pub fn register_destructor_callback( &mut self, fn_: NotifierCallback<T> ) -> *mut NotifierCallback<T>
pub fn register_notification_callback( &mut self, fn_: NotifierCallback<T> ) -> *mut NotifierCallback<T>
pub fn delete_callback( &mut self, callback_list: &mut LinkedList<NotifierCallback<T>>, to_delete: *mut NotifierCallback<T> )
pub fn delete_destructor_callback(&mut self, c: *mut NotifierCallback<T>)
pub fn delete_notification_callback(&mut self, c: *mut NotifierCallback<T>)
Trait Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for Notifier<T>
impl<T> Send for Notifier<T>
impl<T> Sync for Notifier<T>
impl<T> Unpin for Notifier<T>
impl<T> UnwindSafe for Notifier<T>
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable for T
§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.