pub struct AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> { /* private fields */ }
Expand description
| Version of gradient that requires the main input | and thus needs to receive length, indices and | other stuff | | bool SparseFused = true, | bool GradientNeedIndices = false>
Implementations§
source§impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
pub fn run_on_device(&mut self) -> bool
pub fn do_run_with_type<IndexType>(&mut self) -> bool
pub fn do_run_with_value<IndexType, const FixedSize: i32>(&mut self) -> bool
Auto Trait Implementations§
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> !RefUnwindSafe for AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> !Send for AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> !Sync for AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> Unpin for AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>where Context: Unpin, ReducerGradient: Unpin, T: Unpin, TLengths: Unpin, Tembedding: Unpin,
impl<Tembedding, T, TLengths, Context, ReducerGradient, const SparseFused: bool, const GradientNeedIndices: bool> !UnwindSafe for AbstractLengthsWithMainInputGradientOp<Tembedding, T, TLengths, Context, ReducerGradient, SparseFused, GradientNeedIndices>
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.