Struct Dcg 

pub struct Dcg<T> { /* private fields */ }

Implementations

impl<T> Dcg<T>

pub fn new() -> Self

pub fn binary( &mut self, lhs: NodeIndex, rhs: NodeIndex, op: impl Into<BinaryOp>, ) -> NodeIndex

pub fn constant(&mut self, value: T) -> NodeIndex

pub fn get(&self, index: NodeIndex) -> Option<&Node<T>>

pub fn include(&mut self, node: impl Into<Node<T>>) -> NodeIndex

pub fn input(&mut self, param: bool, value: T) -> NodeIndex

pub fn op( &mut self, inputs: impl IntoIterator<Item = NodeIndex>, op: impl Into<Op>, ) -> NodeIndex

pub fn remove(&mut self, index: NodeIndex) -> Option<Node<T>>

pub fn unary(&mut self, input: NodeIndex, op: impl Into<UnaryOp>) -> NodeIndex

pub fn variable(&mut self, value: T) -> NodeIndex

pub fn add(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn div(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn mul(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn pow(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn rem(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn sub(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex

pub fn abs(&mut self, recv: NodeIndex) -> NodeIndex

pub fn acos(&mut self, recv: NodeIndex) -> NodeIndex

pub fn acosh(&mut self, recv: NodeIndex) -> NodeIndex

pub fn asin(&mut self, recv: NodeIndex) -> NodeIndex

pub fn asinh(&mut self, recv: NodeIndex) -> NodeIndex

pub fn atan(&mut self, recv: NodeIndex) -> NodeIndex

pub fn atanh(&mut self, recv: NodeIndex) -> NodeIndex

pub fn ceil(&mut self, recv: NodeIndex) -> NodeIndex

pub fn cos(&mut self, recv: NodeIndex) -> NodeIndex

pub fn cosh(&mut self, recv: NodeIndex) -> NodeIndex

pub fn exp(&mut self, recv: NodeIndex) -> NodeIndex

pub fn floor(&mut self, recv: NodeIndex) -> NodeIndex

pub fn inv(&mut self, recv: NodeIndex) -> NodeIndex

pub fn ln(&mut self, recv: NodeIndex) -> NodeIndex

pub fn neg(&mut self, recv: NodeIndex) -> NodeIndex

pub fn recip(&mut self, recv: NodeIndex) -> NodeIndex

pub fn sin(&mut self, recv: NodeIndex) -> NodeIndex

pub fn sinh(&mut self, recv: NodeIndex) -> NodeIndex

pub fn sqr(&mut self, recv: NodeIndex) -> NodeIndex

pub fn sqrt(&mut self, recv: NodeIndex) -> NodeIndex

pub fn tan(&mut self, recv: NodeIndex) -> NodeIndex

pub fn tanh(&mut self, recv: NodeIndex) -> NodeIndex

impl<T> Dcg<T>

where T: Scalar<Real = T>,

pub fn backward(&self) -> Result<HashMap<NodeIndex, T>>

pub fn gradient(&self, target: NodeIndex) -> Result<HashMap<NodeIndex, T>>

Trait Implementations

impl<T> Default for Dcg<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Index<NodeIndex> for Dcg<T>

type Output = Node<T>

The returned type after indexing.

fn index(&self, index: NodeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.