Struct caffe2op_lengthstile::LengthsTileOp
source · pub struct LengthsTileOp<Context> { /* private fields */ }
Expand description
| Given DATA tensor of rank r >= 1, and LENGTHS | tensor of rank 1, duplicate each entry | of the outer-most dimension of DATA | according to LENGTHS, and concatenate | them in an output tensor of rank r. |
Implementations§
source§impl<Context> LengthsTileOp<Context>
impl<Context> LengthsTileOp<Context>
pub fn run_on_device(&mut self) -> bool
source§impl LengthsTileOp<CPUContext>
impl LengthsTileOp<CPUContext>
pub fn run_on_cpu_device(&mut self) -> bool
Auto Trait Implementations§
impl<Context> !RefUnwindSafe for LengthsTileOp<Context>
impl<Context> !Send for LengthsTileOp<Context>
impl<Context> !Sync for LengthsTileOp<Context>
impl<Context> Unpin for LengthsTileOp<Context>where Context: Unpin,
impl<Context> !UnwindSafe for LengthsTileOp<Context>
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.