Struct caffe2_operator::AsyncTaskGraph
source · pub struct AsyncTaskGraph { /* private fields */ }Implementations§
source§impl AsyncTaskGraph
impl AsyncTaskGraph
pub fn new(helper: *mut ExecutorHelper, options: &ExecutionOptions) -> Self
Trait Implementations§
source§impl AsyncTaskGraphBase for AsyncTaskGraph
impl AsyncTaskGraphBase for AsyncTaskGraph
fn create_node(&mut self, node_id: i32, ops: &Vec<*mut OperatorStorage>) -> bool
fn add_dependency( &mut self, child_node_id: i32, parent_node_ids: &Vec<i32> ) -> bool
fn freeze_graph(&mut self)
fn execute_graph(&mut self) -> *mut AsyncTaskFuture
fn get_future(&mut self) -> *mut AsyncTaskFuture
fn reset(&mut self)
Auto Trait Implementations§
impl !RefUnwindSafe for AsyncTaskGraph
impl !Send for AsyncTaskGraph
impl !Sync for AsyncTaskGraph
impl Unpin for AsyncTaskGraph
impl !UnwindSafe for AsyncTaskGraph
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.