Class representing a sine_node leaf. More...

#include <trigonometry.hpp>

Inheritance diagram for graph::arctan_node< T, SAFE_MATH >:

Public Member Functions
	arctan_node (shared_leaf< T, SAFE_MATH > x, shared_leaf< T, SAFE_MATH > y)
	Construct a arctan_node node.

virtual backend::buffer< T >	evaluate ()
	Evaluate the results of arctan.

virtual shared_leaf< T, SAFE_MATH >	reduce ()
	Reduce a arctan node.

virtual shared_leaf< T, SAFE_MATH >	df (shared_leaf< T, SAFE_MATH > x)
	Transform node to derivative.

virtual shared_leaf< T, SAFE_MATH >	compile (std::ostringstream &stream, jit::register_map &registers, jit::register_map &indices, const jit::register_usage &usage)
	Compile the node.

virtual bool	is_match (shared_leaf< T, SAFE_MATH > x)
	Querey if the nodes match.

virtual void	to_latex () const
	Convert the node to latex.

virtual shared_leaf< T, SAFE_MATH >	remove_pseudo ()
	Remove pseudo variable nodes.

virtual shared_leaf< T, SAFE_MATH >	to_vizgraph (std::stringstream &stream, jit::register_map &registers)
	Convert the node to vizgraph.

Public Member Functions inherited from graph::branch_node< T, SAFE_MATH >
	branch_node (shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > r, const std::string s)
	Assigns the left and right branches.

	branch_node (shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > r, const std::string s, const size_t count, const bool pseudo)
	Assigns the left and right branches.

virtual void	compile_preamble (std::ostringstream &stream, jit::register_map &registers, jit::visiter_map &visited, jit::register_usage &usage, jit::texture1d_list &textures1d, jit::texture2d_list &textures2d, int &avail_const_mem)
	Compile preamble.

shared_leaf< T, SAFE_MATH >	get_left ()
	Get the left branch.

shared_leaf< T, SAFE_MATH >	get_right ()
	Get the right branch.

virtual bool	is_all_variables () const
	Test if node acts like a variable.

virtual std::shared_ptr< leaf_node< T, SAFE_MATH > >	get_power_exponent () const
	Get the exponent of a power.

Public Member Functions inherited from graph::leaf_node< T, SAFE_MATH >
	leaf_node (const std::string s, const size_t count, const bool pseudo)
	Construct a basic node.

virtual	~leaf_node ()
	Destructor.

virtual std::shared_ptr< leaf_node< T, SAFE_MATH > >	df (std::shared_ptr< leaf_node< T, SAFE_MATH > > x)=0
	Transform node to derivative.

virtual bool	is_match (std::shared_ptr< leaf_node< T, SAFE_MATH > > x)
	Querey if the nodes match.

bool	is_power_base_match (std::shared_ptr< leaf_node< T, SAFE_MATH > > x)
	Check if the base of the powers match.

virtual void	set (const T d)
	Set the value of variable data.

virtual void	set (const size_t index, const T d)
	Set the value of variable data.

virtual void	set (const std::vector< T > &d)
	Set the value of variable data.

virtual void	set (const backend::buffer< T > &d)
	Set the value of variable data.

virtual bool	is_constant () const
	Test if node is a constant.

virtual bool	has_constant_zero () const
	Test the constant node has a zero.

bool	is_normal ()
	Test if the result is normal.

virtual bool	is_power_like () const
	Test if the node acts like a power of variable.

virtual std::shared_ptr< leaf_node< T, SAFE_MATH > >	get_power_base ()
	Get the base of a power.

size_t	get_hash () const
	Get the hash for the node.

size_t	get_complexity () const
	Get the number of nodes in the subgraph.

virtual bool	has_pseudo () const
	Query if the node contains pseudo variables.

virtual void	endline (std::ostringstream &stream, const jit::register_usage &usage) const final
	End a line in the kernel source.

Additional Inherited Members
Public Types inherited from graph::leaf_node< T, SAFE_MATH >
typedef T	base
	Type def to retrieve the backend type.

Static Public Attributes inherited from graph::leaf_node< T, SAFE_MATH >
static thread_local caches_t	caches
	A per thread instance of the cache structure.

Protected Attributes inherited from graph::branch_node< T, SAFE_MATH >
shared_leaf< T, SAFE_MATH >	left
	Left branch of the tree.

shared_leaf< T, SAFE_MATH >	right
	Right branch of the tree.

Protected Attributes inherited from graph::leaf_node< T, SAFE_MATH >
const size_t	hash
	Hash for node.

const size_t	complexity
	Graph complexity.

std::map< size_t, std::shared_ptr< leaf_node< T, SAFE_MATH > > >	df_cache
	Cache derivative terms.

const bool	contains_pseudo
	Node contains pseudo variables.

Detailed Description

template<jit::float_scalar T, bool SAFE_MATH = false>
class graph::arctan_node< T, SAFE_MATH >

Class representing a sine_node leaf.

Template Parameters

T	Base type of the calculation.
SAFE_MATH	Use Safe Math operations.

Constructor & Destructor Documentation

◆ arctan_node()

template<jit::float_scalar T, bool SAFE_MATH = false>

graph::arctan_node< T, SAFE_MATH >::arctan_node	(	shared_leaf< T, SAFE_MATH >	x,
		shared_leaf< T, SAFE_MATH >	y
	)

inline

Construct a arctan_node node.

Parameters

[in]	x	Argument.
[in]	y	Argument.

Member Function Documentation

◆ compile()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual shared_leaf< T, SAFE_MATH > graph::arctan_node< T, SAFE_MATH >::compile	(	std::ostringstream &	stream,
		jit::register_map &	registers,
		jit::register_map &	indices,
		const jit::register_usage &	usage
	)

inlinevirtual

Compile the node.

Parameters

[in,out]	stream	String buffer stream.
[in,out]	registers	List of defined registers.
[in,out]	indices	List of defined indices.
[in]	usage	List of register usage count.

Returns: The current node.

Implements graph::leaf_node< T, SAFE_MATH >.

◆ df()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual shared_leaf< T, SAFE_MATH > graph::arctan_node< T, SAFE_MATH >::df ( shared_leaf< T, SAFE_MATH > x )

inlinevirtual

Transform node to derivative.

d atan(x,y)/dx = 1/(1 + (y/x)^2)*d (y/x)/dx

Parameters

[in] x The variable to take the derivative to.

Returns: The derivative of the node.

◆ evaluate()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual backend::buffer< T > graph::arctan_node< T, SAFE_MATH >::evaluate ( )

inlinevirtual

Evaluate the results of arctan.

result = atan2(y, x)

Returns: The value of atan2(y, x).

Implements graph::leaf_node< T, SAFE_MATH >.

◆ is_match()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual bool graph::arctan_node< T, SAFE_MATH >::is_match ( shared_leaf< T, SAFE_MATH > x )

inlinevirtual

Querey if the nodes match.

Parameters

[in] x Other graph to check if it is a match.

Returns: True if the nodes are a match.

◆ reduce()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual shared_leaf< T, SAFE_MATH > graph::arctan_node< T, SAFE_MATH >::reduce ( )

inlinevirtual

Reduce a arctan node.

Returns: A reduced arctan node.

Implements graph::leaf_node< T, SAFE_MATH >.

◆ remove_pseudo()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual shared_leaf< T, SAFE_MATH > graph::arctan_node< T, SAFE_MATH >::remove_pseudo ( )

inlinevirtual

Remove pseudo variable nodes.

Returns: A tree without variable nodes.

Reimplemented from graph::leaf_node< T, SAFE_MATH >.

◆ to_latex()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual void graph::arctan_node< T, SAFE_MATH >::to_latex ( ) const

inlinevirtual

Convert the node to latex.

Implements graph::leaf_node< T, SAFE_MATH >.

◆ to_vizgraph()

template<jit::float_scalar T, bool SAFE_MATH = false>

virtual shared_leaf< T, SAFE_MATH > graph::arctan_node< T, SAFE_MATH >::to_vizgraph	(	std::stringstream &	stream,
		jit::register_map &	registers
	)

inlinevirtual

Convert the node to vizgraph.

Parameters

[in,out]	stream	String buffer stream.
[in,out]	registers	List of defined registers.

Returns: The current node.

Implements graph::leaf_node< T, SAFE_MATH >.

The documentation for this class was generated from the following file:

graph_framework/trigonometry.hpp

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ arctan_node()

Member Function Documentation

◆ compile()

◆ df()

◆ evaluate()

◆ is_match()

◆ reduce()

◆ remove_pseudo()

◆ to_latex()

◆ to_vizgraph()