Struct caffe2op_counter::CreateCounterOp
source · pub struct CreateCounterOp<T, Context> { /* private fields */ }Expand description
| Creates a count-down counter with initial
| value specified by the init_count
| argument.
|
Implementations§
source§impl<T, Context> CreateCounterOp<T, Context>
impl<T, Context> CreateCounterOp<T, Context>
pub fn new<Args>(args: Args) -> Self
pub fn run_on_device(&mut self) -> bool
Auto Trait Implementations§
impl<T, Context> !RefUnwindSafe for CreateCounterOp<T, Context>
impl<T, Context> !Send for CreateCounterOp<T, Context>
impl<T, Context> !Sync for CreateCounterOp<T, Context>
impl<T, Context> Unpin for CreateCounterOp<T, Context>where Context: Unpin, T: Unpin,
impl<T, Context> !UnwindSafe for CreateCounterOp<T, Context>
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.