node.hpp File Reference

Base nodes of graph computation framework. More...

#include <iostream>
#include <string>
#include <memory>
#include <iomanip>
#include <functional>
#include <type_traits>
#include "backend.hpp"

Go to the source code of this file.

Classes
class	graph::leaf_node< T, SAFE_MATH >
	Class representing a node leaf. More...
struct	graph::leaf_node< T, SAFE_MATH >::caches_t
	Data structure to contain the two caches. More...
class	graph::index_node< T, SAFE_MATH >
	Index node. More...
class	graph::constant_node< T, SAFE_MATH >
	Class representing data that cannot change. More...
class	graph::straight_node< T, SAFE_MATH >
	Class representing a straight node. More...
class	graph::branch_node< T, SAFE_MATH >
	Class representing a branch node. More...
class	graph::triple_node< T, SAFE_MATH >
	Class representing a triple branch node. More...
class	graph::n_branch_node< N, T, SAFE_MATH >
	Class representing a N branch node. More...
struct	graph::has_no_derivative< T >
	Type trait for not having a valid derivative. More...
class	graph::no_derivative< T, SAFE_MATH, BASE_NODE, N >
	Nodes without derivatives. More...
class	graph::variable_node< T, SAFE_MATH >
	Class representing data that can change. More...
class	graph::pseudo_variable_node< T, SAFE_MATH >
	Class representing a subexpression that acts like a variable. More...

Namespaces
namespace	graph
	Name space for graph nodes.

Typedefs
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::shared_leaf = std::shared_ptr< leaf_node< T, SAFE_MATH > >
	Convenience type alias for shared leaf nodes.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::output_nodes = std::vector< shared_leaf< T, SAFE_MATH > >
	Convenience type alias for a vector of output nodes.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::shared_index = std::shared_ptr< index_node< T, SAFE_MATH > >
	Convenience type alias for shared index nodes.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::shared_constant = std::shared_ptr< constant_node< T, SAFE_MATH > >
	Convenience type alias for shared constant nodes.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::shared_variable = std::shared_ptr< variable_node< T, SAFE_MATH > >
	Convenience type alias for shared variable nodes.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::input_nodes = std::vector< shared_variable< T, SAFE_MATH > >
	Convenience type alias for a vector of inputs.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::map_nodes = std::vector< std::pair< shared_leaf< T, SAFE_MATH >, shared_variable< T, SAFE_MATH > > >
	Convenience type alias for mapping end codes back to inputs.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::copy_nodes = std::vector< std::pair< shared_variable< T, SAFE_MATH >, shared_variable< T, SAFE_MATH > > >
	Convenience type alias for copying buffers.
template<jit::float_scalar T, bool SAFE_MATH = false>
using	graph::shared_pseudo_variable = std::shared_ptr< pseudo_variable_node< T, SAFE_MATH > >
	Convenience type alias for shared pseudo variable nodes.

Functions
template<jit::float_scalar T, bool SAFE_MATH = false>
constexpr shared_leaf< T, SAFE_MATH >	graph::null_leaf ()
	Create a null leaf.
template<jit::float_scalar T, bool SAFE_MATH = false>
constexpr shared_leaf< T, SAFE_MATH >	graph::zero ()
	Forward declare for zero.
template<jit::float_scalar T, bool SAFE_MATH = false>
constexpr shared_leaf< T, SAFE_MATH >	graph::one ()
	Forward declare for one.
template<jit::float_scalar T, bool SAFE_MATH = false>
void	graph::make_vizgraph (shared_leaf< T, SAFE_MATH > node)
	Build the vizgraph input.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::index ()
	Construct an index.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_index< T, SAFE_MATH >	graph::index_cast (shared_leaf< T, SAFE_MATH > x)
	Cast to a index node.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::constant (const backend::buffer< T > &d)
	Construct a constant.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::constant (const T d)
	Construct a constant.
template<jit::float_scalar T, bool SAFE_MATH = false>
constexpr shared_leaf< T, SAFE_MATH >	graph::none ()
	Create a one constant.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_constant< T, SAFE_MATH >	graph::constant_cast (shared_leaf< T, SAFE_MATH > x)
	Cast to a constant node.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::variable (const size_t s, const std::string &symbol)
	Construct a variable.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::variable (const size_t s, const T d, const std::string &symbol)
	Construct a variable.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::variable (const std::vector< T > &d, const std::string &symbol)
	Construct a variable.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::variable (const backend::buffer< T > &d, const std::string &symbol)
	Construct a variable.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_variable< T, SAFE_MATH >	graph::variable_cast (shared_leaf< T, SAFE_MATH > x)
	Cast to a variable node.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_leaf< T, SAFE_MATH >	graph::pseudo_variable (shared_leaf< T, SAFE_MATH > x)
	Define pseudo variable convenience function.
template<jit::float_scalar T, bool SAFE_MATH = false>
shared_pseudo_variable< T, SAFE_MATH >	graph::pseudo_variable_cast (shared_leaf< T, SAFE_MATH > &x)
	Cast to a pseudo variable node.

Variables
template<jit::complex_scalar T>
constexpr T	graph::i = T(0.0, 1.0)
	Convenience type for imaginary constant.

Detailed Description

Base nodes of graph computation framework.

Defines a tree of operations that allows automatic differentiation.