Struct caffe2op_string::ForEach
source · pub struct ForEach<Functor> { /* private fields */ }Expand description
| ForEach is a unary functor that forwards | each element of the input array into | the elementwise Functor provided, | and gathers the results of each call | into the resulting array. | | Use it as an adaptor if you want to create | a UnaryElementwiseOp that acts on each | element of the tensor per function call | – this is reasonable for complex types | where vectorization wouldn’t be much | of a gain, performance-wise. |
Implementations§
Auto Trait Implementations§
impl<Functor> RefUnwindSafe for ForEach<Functor>where Functor: RefUnwindSafe,
impl<Functor> Send for ForEach<Functor>where Functor: Send,
impl<Functor> Sync for ForEach<Functor>where Functor: Sync,
impl<Functor> Unpin for ForEach<Functor>where Functor: Unpin,
impl<Functor> UnwindSafe for ForEach<Functor>where Functor: UnwindSafe,
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.