Struct Sum 

pub struct Sum<A> { /* private fields */ }

wrapper to apply an operation

Implementations

impl<A> Sum<A>

pub fn get_reduction_mode(&self) -> ReductionMode

gets the reduction mode

pub fn inner(&self) -> &A

references the inner value

pub fn inner_mut(&mut self) -> &mut A

references the inner value

pub fn into_inner(self) -> A

converts into the inner value

pub fn new(inner: A) -> Self

where Self: Op,

creates a new layer

pub fn set_reduction_mode(&mut self, mode: ReductionMode)

sets the reduction mode

pub fn with_dim(self, dim: i32) -> Self

sets the dimension

pub fn with_inner<B>(self, inner: B) -> Sum<B>

where Sum<B>: Op,

sets the inner module

pub fn with_reduction_mode(self, mode: ReductionMode) -> Self

sets the reduction mode

Trait Implementations

impl<A: AI<X, Y> + Op<Output = Y>, X, Y, Z> AI<X, Z> for Sum<A>

where SumLayer: AI<Y, Z>,

fn forward(&self, input: X) -> Z

applies to the input

fn forward_mut(&mut self, input: X) -> Z

applies to the input, possibly updating internal caches

impl<A: Clone> Clone for Sum<A>

fn clone(&self) -> Sum<A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for Sum<A>

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

Formats the value using the given formatter.

impl<A: Decompose> Decompose for Sum<A>

type Decomposition = (<A as Decompose>::Decomposition, <SumLayer as Decompose>::Decomposition)

the decomposed type

fn compose((inner, layer): Self::Decomposition) -> Self

recreates from the decomposition

fn decompose(self) -> Self::Decomposition

owned decomposition

fn decompose_cloned(&self) -> Self::Decomposition

decomposition that copies data

impl<A: Default> Default for Sum<A>

fn default() -> Sum<A>

Returns the “default value” for a type.

impl<'de, A> Deserialize<'de> for Sum<A>

where A: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<A: Hash> Hash for Sum<A>

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<A: IntoSequence<M>, M: AI<M::Output, M::Output> + Op> IntoSequence<M> for Sum<A>

where SumLayer: Into<M>,

fn into_sequence(self) -> Sequential<Vec<M>>

converts into a sequential module list

impl<A: Op<Output = Y>, Y> Op for Sum<A>

where SumLayer: AI<Y, f32>,

type Output = f32

suggested output type to help with composition coherence. Ideally, Self should implement AI<X,Self::Output> for some X

fn abs(self) -> Abs<Self>

where Self: Sized, Abs<Self>: Op,

wraps with an absolute value operation

fn chain<B>(self, b: B) -> Sequential<(Self, B)>

where Self: Sized, Sequential<(Self, B)>: Op,

sequences with another ai operation

fn duplicate(self) -> Duplicate<Self>

where Duplicate<Self>: Op, Self: Sized,

wraps with a duplicate operation

fn fix_type<Z>(self) -> SetType<Self, Z, Z>

where Self: AI<Z, Z> + Sized,

set type but with the same input and output

fn flatten<R: Clone>(self, args: R) -> Flatten<Self, R>

where Flatten<Self, R>: Op, Self: Sized,

wraps with a flatten layer

fn forward_fixed<Z>(&self, input: Z) -> Z

where Self: AI<Z, Z> + Sized,

applies to the input

fn forward_fixed_mut<Z>(&mut self, input: Z) -> Z

where Self: AI<Z, Z> + Sized,

applies to the input

fn forward_typed<W, Z>(&self, input: W) -> Z

where Self: AI<W, Z> + Sized,

applies to the input

fn forward_typed_mut<W, Z>(&mut self, input: W) -> Z

where Self: AI<W, Z> + Sized,

applies to the input, possibly updating internal caches

fn infer_autoregressive<X, Y>(self, input: X) -> Autoregression<Self, Y>

where Self: AI<X, Y> + AI<Y, Y> + Sized, Y: Clone,

creates an autoregressive inference

fn map<B>(self, b: B) -> Map<Sequential<(Self, B)>>

where Map<Sequential<(Self, B)>>: Op, Self: Sized, Sequential<(Self, B)>: Op,

applies the operation to every output

fn mean(self) -> Mean<Self>

where Mean<Self>: Op, Self: Sized,

wraps with a mean operation

fn optional(self) -> Option<Self>

where Self: Sized,

creates an optional operation

fn reshape<R: Clone>(self, args: R) -> Reshape<Self, R>

where Reshape<Self, R>: Op, Self: Sized,

wraps with a reshape layer

fn residual(self) -> Residual<Self>

where Residual<Self>: Op, Self: Sized,

wraps in a residual layer

fn set_type<W, Z>(self) -> SetType<Self, W, Z>

where Self: AI<W, Z> + Sized,

sets the input output types

fn to_each(self) -> Map<Self>

where Map<Self>: Op, Self: Sized,

wraps with a map operation

fn unsqueeze(self, dim: i32) -> Unsqueeze<Self>

where Unsqueeze<Self>: Op, Self: Sized,

wraps with a unsqueeze operation

fn sum(self) -> Sum<Self>

where Sum<Self>: Op, Self: Sized,

wraps with a sum operation

fn wrap_inner(self) -> Inner<Self>

where Self: Sized,

wraps the inner value so it can be unwrapped with unwrap inner

fn zip<B>(self, b: B) -> Zip<(Self, B)>

where Self: Sized, Zip<(Self, B)>: Op,

zips with another ai operation

impl<A: PartialEq> PartialEq for Sum<A>

fn eq(&self, other: &Sum<A>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<A> Serialize for Sum<A>

where A: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<A: UnwrapInner> UnwrapInner for Sum<A>

type Inner = <A as UnwrapInner>::Inner

the inner type

fn unwrap_inner(self) -> A::Inner

unwraps the inner value

impl<A: Copy> Copy for Sum<A>

impl<A: Eq> Eq for Sum<A>

impl<A> StructuralPartialEq for Sum<A>