Struct caffe2op_lppool::LpPoolGradientOp
source · pub struct LpPoolGradientOp(_);Implementations§
source§impl LpPoolGradientOp
impl LpPoolGradientOp
pub fn run_f32_on_cpu_device_with_order_nchw(&mut self) -> bool
pub fn run_f32_on_cpu_device_with_order_nhwc(&mut self) -> bool
Auto Trait Implementations§
impl !RefUnwindSafe for LpPoolGradientOp
impl !Send for LpPoolGradientOp
impl !Sync for LpPoolGradientOp
impl Unpin for LpPoolGradientOp
impl !UnwindSafe for LpPoolGradientOp
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.