pub enum RowReduceKind {
RmsNorm,
Softmax,
LayerNorm,
}Expand description
The reduction performed per row in a fused row op — the extensible core of the fused-row family (LayerNorm / fused-add-RMSNorm join here as they land). Each is a shared-memory reduction over one row.
Variants§
RmsNorm
Y[r,i] = X[r,i] / sqrt(mean_i(X[r,·]²) + eps) (× weight[i] when present) — unit-RMS rescale.
Softmax
Y[r,i] = exp(X[r,i]-max) / Σ exp(X[r,·]-max) — a per-row probability distribution.
LayerNorm
Y[r,i] = (X[r,i]-mean_i)/sqrt(var_i+eps) * W[i] + B[i] — per-row mean/variance normalize, scale + shift.
Implementations§
Trait Implementations§
Source§impl Clone for RowReduceKind
impl Clone for RowReduceKind
Source§fn clone(&self) -> RowReduceKind
fn clone(&self) -> RowReduceKind
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RowReduceKind
impl Debug for RowReduceKind
Source§impl<'de> Deserialize<'de> for RowReduceKind
impl<'de> Deserialize<'de> for RowReduceKind
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl Hash for RowReduceKind
impl Hash for RowReduceKind
Source§impl Ord for RowReduceKind
impl Ord for RowReduceKind
Source§fn cmp(&self, other: &RowReduceKind) -> Ordering
fn cmp(&self, other: &RowReduceKind) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for RowReduceKind
impl PartialEq for RowReduceKind
Source§impl PartialOrd for RowReduceKind
impl PartialOrd for RowReduceKind
Source§impl Serialize for RowReduceKind
impl Serialize for RowReduceKind
impl Copy for RowReduceKind
impl Eq for RowReduceKind
impl StructuralPartialEq for RowReduceKind
Auto Trait Implementations§
impl Freeze for RowReduceKind
impl RefUnwindSafe for RowReduceKind
impl Send for RowReduceKind
impl Sync for RowReduceKind
impl Unpin for RowReduceKind
impl UnsafeUnpin for RowReduceKind
impl UnwindSafe for RowReduceKind
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.