pub struct AbstractReduceFrontOrBackOp<T, Context, Reducer, const FirstDim: bool, InputAccessor> { /* private fields */ }Expand description
| @brief
|
| Simple non-segmented reduction over
| the first few dimensions of the tensor
|
| Inputs:
|
| 0: DATA - input embedding to do lookups
| in
|
| 1..P: AUX_ARG_ - optional additional
| arguments to be passed to the reducer
|
| Args: num_reduce_dim (default 1) -
| the number of dims in front of the tensor
| to reduce
|
| Output:
|
| Tensor without the first num_dim
| dimensions of DATA class InputAccessor
| = BaseInputAccessor
Implementations§
source§impl<T, Context, R: Reducer, const FirstDim: bool, InputAccessor> AbstractReduceFrontOrBackOp<T, Context, R, FirstDim, InputAccessor>
impl<T, Context, R: Reducer, const FirstDim: bool, InputAccessor> AbstractReduceFrontOrBackOp<T, Context, R, FirstDim, InputAccessor>
pub fn new<Args>(args: Args) -> Self
pub fn run_on_device(&mut self) -> bool
pub fn do_run_with_value<const FixedSize: i32>(&mut self) -> bool
Auto Trait Implementations§
impl<T, Context, Reducer, const FirstDim: bool, InputAccessor> !RefUnwindSafe for AbstractReduceFrontOrBackOp<T, Context, Reducer, FirstDim, InputAccessor>
impl<T, Context, Reducer, const FirstDim: bool, InputAccessor> !Send for AbstractReduceFrontOrBackOp<T, Context, Reducer, FirstDim, InputAccessor>
impl<T, Context, Reducer, const FirstDim: bool, InputAccessor> !Sync for AbstractReduceFrontOrBackOp<T, Context, Reducer, FirstDim, InputAccessor>
impl<T, Context, Reducer, const FirstDim: bool, InputAccessor> Unpin for AbstractReduceFrontOrBackOp<T, Context, Reducer, FirstDim, InputAccessor>where Context: Unpin, InputAccessor: Unpin, Reducer: Unpin, T: Unpin,
impl<T, Context, Reducer, const FirstDim: bool, InputAccessor> !UnwindSafe for AbstractReduceFrontOrBackOp<T, Context, Reducer, FirstDim, InputAccessor>
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.