Struct AddOne

pub struct AddOne<N>(pub N);

Operator that applies f[g](x) = g(x) + 1 element-wise to a buffer.

Examples

let f = AddOne(X.into_var());

assert_eq!(f.evaluate_dual(X, ctx!{X = 1.0}).unwrap(), dual!(2.0, 1.0));
assert_eq!(f.evaluate_dual(X, ctx!{X = 0.0}).unwrap(), dual!(1.0, 1.0));
assert_eq!(f.evaluate_dual(X, ctx!{X = -1.0}).unwrap(), dual!(0.0, 1.0));

Tuple Fields

0: N

Trait Implementations

impl<N: Clone> Clone for AddOne<N>

fn clone(&self) -> AddOne<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N, I: Identifier> Contains<I> for AddOne<N>

where N: Contains<I>,

fn contains(&self, target: I) -> bool

Returns true if the identifier is present in the expression.

impl<N: Debug> Debug for AddOne<N>

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

Formats the value using the given formatter.

impl<T, N> Differentiable<T> for AddOne<N>

where T: Identifier, N: Differentiable<T>,

type Adjoint = <N as Differentiable<T>>::Adjoint

The adjoint operator; i.e. the gradient.

fn adjoint(&self, target: T) -> Self::Adjoint

Transform the node into its Adjoint operator tree.

fn evaluate_adjoint<C: Context, CR: AsRef<C>>( &self, target: T, ctx: CR, ) -> AegirResult<Self::Adjoint, C>

where Self: Function<C>, Self::Adjoint: Function<C>,

Helper method that computes the adjoint and evaluates its value.

fn evaluate_dual<C: Context, CR: AsRef<C>>( &self, target: T, ctx: CR, ) -> Result<DualOf<Self, C, T>, BinaryError<Self::Error, <AdjointOf<Self, T> as Function<C>>::Error, NoError>>

where Self: Function<C>, Self::Adjoint: Function<C>,

Helper method that evaluates the function and its adjoint, wrapping up in a Dual.

impl<N: ToExpr> Display for AddOne<N>

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

Formats the value using the given formatter.

impl<C, N, F> Function<C> for AddOne<N>

where C: Context, N: Function<C>, F: Scalar + Scalar, N::Value: Buffer<Field = F>,

type Error = <N as Function<C>>::Error

The error type of the function.

type Value = <N as Function<C>>::Value

The codomain of the function.

fn evaluate<CR: AsRef<C>>(&self, ctx: CR) -> Result<Self::Value, Self::Error>

Evaluate the function and return its Value.

fn evaluate_spec<CR: AsRef<C>>( &self, ctx: CR, ) -> Result<Spec<Self::Value>, Self::Error>

Evaluate the function and return its lifted Value.

fn evaluate_shape<CR: AsRef<C>>( &self, ctx: CR, ) -> Result<ShapeOf<Self::Value>, Self::Error>

Evaluate the function and return the shape of the Value.

impl<N: Node> Node for AddOne<N>

fn add<N: Node>(self, other: N) -> Add<Self, N>

where Self: Sized,

fn sub<N: Node>(self, other: N) -> Sub<Self, N>

where Self: Sized,

fn mul<N: Node>(self, other: N) -> Mul<Self, N>

where Self: Sized,

fn div<N: Node>(self, other: N) -> Div<Self, N>

where Self: Sized,

fn dot<N: Node>(self, other: N) -> TensorDot<Self, N>

where Self: Sized,

fn abs(self) -> Abs<Self>

where Self: Sized,

fn neg(self) -> Negate<Self>

where Self: Sized,

fn pow<P>(self, power: P) -> Power<Self, P>

where Self: Sized,

fn ln(self) -> Ln<Self>

where Self: Sized,

fn squared(self) -> Square<Self>

where Self: Sized,

fn sum(self) -> Sum<Self>

where Self: Sized,

fn sigmoid(self) -> Sigmoid<Self>

where Self: Sized,

impl<N: PartialEq> PartialEq for AddOne<N>

fn eq(&self, other: &AddOne<N>) -> 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<N: ToExpr> ToExpr for AddOne<N>

fn to_expr(&self) -> Expr

Convert the node to an expression string.

impl<N: Copy> Copy for AddOne<N>

impl<N> StructuralPartialEq for AddOne<N>