Struct caffe2op_matmul::GetMatMulGradient
source · pub struct GetMatMulGradient<'a> { /* private fields */ }
Trait Implementations§
source§impl<'a> CopyArguments for GetMatMulGradient<'a>
impl<'a> CopyArguments for GetMatMulGradient<'a>
fn copy_arguments(&self) -> bool
source§impl<'a> GetGradientDefs for GetMatMulGradient<'a>
impl<'a> GetGradientDefs for GetMatMulGradient<'a>
fn get_gradient_defs(&mut self) -> Vec<OperatorDef>
Auto Trait Implementations§
impl<'a> RefUnwindSafe for GetMatMulGradient<'a>
impl<'a> Send for GetMatMulGradient<'a>
impl<'a> Sync for GetMatMulGradient<'a>
impl<'a> Unpin for GetMatMulGradient<'a>
impl<'a> UnwindSafe for GetMatMulGradient<'a>
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.