Struct Inner 

#[repr(transparent)]
pub struct Inner<A>(pub A);

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

Tuple Fields

0: A

Implementations

impl<A> Inner<A>

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

Trait Implementations

impl<A: AI<X, Y>, X, Y> AI<X, Y> for Inner<A>

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

applies to the input

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

applies to the input, possibly updating internal caches

impl<A: Clone> Clone for Inner<A>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for Inner<A>

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

Formats the value using the given formatter.

impl<A: Decompose> Decompose for Inner<A>

type Decomposition = <A as Decompose>::Decomposition

the decomposed type

fn compose(decomposition: 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 Inner<A>

fn default() -> Inner<A>

Returns the “default value” for a type.

impl<A> From<A> for Inner<A>

fn from(inner: A) -> Self

Converts to this type from the input type.

impl<A: Hash> Hash for Inner<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 Inner<A>

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

converts into a sequential module list

impl<A: Op> Op for Inner<A>

type Output = <A as Op>::Output

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

fn abnormal_softmax(self, temperature: f32) -> AbnormalSoftmax<Self>

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

wraps with a softmax operation

fn abs(self) -> Abs<Self>

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

wraps with an absolute value operation

fn acc_q(self, gamma: f32) -> AccQ<Self>

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

wraps with a accq operation

fn cat(self, dim: i32) -> Cat<Self>

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

wraps with a cat operation

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

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

sequences with another ai operation

fn cross_entropy(self, temperature: f32) -> CrossEntropy<Self>

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

wraps with a cross entropy operation. If temperature is a number it will be used to apply softmax to the logits before computing entropy with the target. if the input will already be a probability distribution instead of logits, put NaN temperature

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 log_softmax(self, temperature: f32) -> LogSoftmax<Self>

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

wraps with a softmax operation

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 soft_choose(self, temperature: f32) -> Choose<Self>

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

wraps with a choose operation

fn softmax(self, temperature: f32) -> Softmax<Self>

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

wraps with a softmax operation

fn squared_error(self) -> SquaredError<Self>

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

wraps with a mse operation

fn squeeze(self, dim: i32) -> Squeeze<Self>

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

wraps with a squeeze operation

fn stack(self, dim: i32) -> Stack<Self>

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

wraps with a stack operation

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: Ord> Ord for Inner<A>

fn cmp(&self, other: &Inner<A>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<A: PartialEq> PartialEq for Inner<A>

fn eq(&self, other: &Inner<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: PartialOrd> PartialOrd for Inner<A>

fn partial_cmp(&self, other: &Inner<A>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<A> UnwrapInner for Inner<A>

type Inner = A

the inner type

fn unwrap_inner(self) -> Self::Inner

unwraps the inner value

impl<W: Wrappable> Wrappable for Inner<W>

type B = <W as Wrappable>::B

type With<C: Backend> = Inner<<W as Wrappable>::With<C>>

impl<A: Copy> Copy for Inner<A>

impl<A: Eq> Eq for Inner<A>

impl<A> StructuralPartialEq for Inner<A>