Skip to main content

ReduceKind

Enum ReduceKind 

Source
#[non_exhaustive]
#[repr(u16)]
pub enum ReduceKind {
Show 15 variants Sum = 0, Mean = 1, Max = 2, Min = 3, Prod = 4, Var = 5, Std = 6, Norm2 = 7, Argmax = 8, Argmin = 9, Any = 10, All = 11, LogSumExp = 12, Trace = 13, CountNonzero = 14,
}
Expand description

Reduction op discriminant — Phase 4 (Category E).

Output shape differs from input: the reduced axis collapses to size 1 (keepdim convention). Other variants are reserved for fanout.

Variants (Non-exhaustive)§

This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§

Sum = 0

Sum along the reduced axis. Phase 4 trailblazer.

§

Mean = 1

Arithmetic mean along the reduced axis.

§

Max = 2

Maximum value along the reduced axis.

§

Min = 3

Minimum value along the reduced axis.

§

Prod = 4

Product along the reduced axis.

§

Var = 5

Sample variance (Bessel-corrected) along the reduced axis.

§

Std = 6

Sample standard deviation along the reduced axis.

§

Norm2 = 7

||x||_2 along the reduced axis.

§

Argmax = 8

argmax along the reduced axis — returns indices (different output dtype). Will need a separate plan shape, reserved here.

§

Argmin = 9

argmin along the reduced axis. Will need a separate plan shape.

§

Any = 10

any (logical OR) along the reduced axis.

§

All = 11

all (logical AND) along the reduced axis.

§

LogSumExp = 12

logsumexp(x) = log(sum(exp(x - max))), numerically stable.

§

Trace = 13

trace(M) = sum(diag(M)) — sum of the diagonal of a 2-D square matrix. Reduces both axes via the i == i constraint rather than a single reduce-axis, so dispatch goes through a dedicated TracePlan (separate from ReducePlan); the discriminant lives here for telemetry / SKU-tagging consistency with the rest of the reduction family.

§

CountNonzero = 14

count_nonzero(x) along the reduced axis — output is i64 (PyTorch torch.count_nonzero returns int64). Heterogeneous output dtype (always i64 regardless of input), so dispatch goes through a dedicated CountReducePlan (separate from ReducePlan); the discriminant lives here for telemetry / SKU-tagging consistency with the rest of the reduction family.

Trait Implementations§

Source§

impl Clone for ReduceKind

Source§

fn clone(&self) -> ReduceKind

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for ReduceKind

Source§

impl Debug for ReduceKind

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
Source§

impl Eq for ReduceKind

Source§

impl Hash for ReduceKind

Source§

fn hash<__H>(&self, state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for ReduceKind

Source§

fn eq(&self, other: &ReduceKind) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for ReduceKind

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.