Struct caffe2_nomnigraph::ConvRelu
source · pub struct ConvRelu { /* private fields */ }Implementations§
source§impl ConvRelu
impl ConvRelu
pub fn new( kernel_shape: Vec<i32>, pads: Option<Vec<i32>>, strides: Option<Vec<i32>>, group: Option<i32>, dilations: Option<Vec<i32>> ) -> Self
pub fn get_kernel_shape(&self) -> Vec<i32>
pub fn get_pads(&self) -> Vec<i32>
pub fn get_strides(&self) -> Vec<i32>
pub fn get_group(&self) -> i32
pub fn get_dilations(&self) -> Vec<i32>
pub fn set_kernel_shape(&mut self, kernel_shape: Vec<i32>)
pub fn set_pads(&mut self, pads: Vec<i32>)
pub fn set_strides(&mut self, strides: Vec<i32>)
pub fn set_group(&mut self, group: i32)
pub fn set_dilations(&mut self, dilations: Vec<i32>)
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for ConvRelu
impl Send for ConvRelu
impl Sync for ConvRelu
impl Unpin for ConvRelu
impl UnwindSafe for ConvRelu
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.