Struct caffe2_opt::SigridHashConverter
source · pub struct SigridHashConverter {}Trait Implementations§
source§impl Converter for SigridHashConverter
impl Converter for SigridHashConverter
fn convert_to_neural_net_operator( &mut self, op: &OperatorDef ) -> Box<NeuralNetOperator>
fn convert_to_operator_def( &mut self, nn_op: *const NeuralNetOperator ) -> OperatorDef
fn get_arguments_from_operator( &self, op: OperatorDef ) -> HashMap<String, Argument>
fn get_device_option(&self, nn_op: *const NeuralNetOperator) -> DeviceOption
fn get_kernel_shape(&mut self, arg_map: HashMap<String, Argument>) -> Vec<i32>
Auto Trait Implementations§
impl RefUnwindSafe for SigridHashConverter
impl Send for SigridHashConverter
impl Sync for SigridHashConverter
impl Unpin for SigridHashConverter
impl UnwindSafe for SigridHashConverter
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.