graph::arctan_node< T, SAFE_MATH > Member List

This is the complete list of members for graph::arctan_node< T, SAFE_MATH >, including all inherited members.

arctan_node(shared_leaf< T, SAFE_MATH > x, shared_leaf< T, SAFE_MATH > y)	graph::arctan_node< T, SAFE_MATH >	inline
base typedef	graph::leaf_node< T, SAFE_MATH >
branch_node(shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > r, const std::string s)	graph::branch_node< T, SAFE_MATH >	inline
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)	graph::branch_node< T, SAFE_MATH >	inline
caches	graph::leaf_node< T, SAFE_MATH >	inlinestatic
compile(std::ostringstream &stream, jit::register_map &registers, jit::register_map &indices, const jit::register_usage &usage)	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
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)	graph::branch_node< T, SAFE_MATH >	inlinevirtual
complexity	graph::leaf_node< T, SAFE_MATH >	protected
contains_pseudo	graph::leaf_node< T, SAFE_MATH >	protected
df(shared_leaf< T, SAFE_MATH > x)	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
graph::branch_node::df(std::shared_ptr< leaf_node< T, SAFE_MATH > > x)=0	graph::leaf_node< T, SAFE_MATH >	pure virtual
df_cache	graph::leaf_node< T, SAFE_MATH >	protected
endline(std::ostringstream &stream, const jit::register_usage &usage) const final	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
evaluate()	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
get_complexity() const	graph::leaf_node< T, SAFE_MATH >	inline
get_hash() const	graph::leaf_node< T, SAFE_MATH >	inline
get_left()	graph::branch_node< T, SAFE_MATH >	inline
get_power_base()	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
get_power_exponent() const	graph::branch_node< T, SAFE_MATH >	inlinevirtual
get_right()	graph::branch_node< T, SAFE_MATH >	inline
has_constant_zero() const	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
has_pseudo() const	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
hash	graph::leaf_node< T, SAFE_MATH >	protected
is_all_variables() const	graph::branch_node< T, SAFE_MATH >	inlinevirtual
is_constant() const	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
is_match(shared_leaf< T, SAFE_MATH > x)	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
graph::branch_node::is_match(std::shared_ptr< leaf_node< T, SAFE_MATH > > x)	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
is_normal()	graph::leaf_node< T, SAFE_MATH >	inline
is_power_base_match(std::shared_ptr< leaf_node< T, SAFE_MATH > > x)	graph::leaf_node< T, SAFE_MATH >	inline
is_power_like() const	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
leaf_node(const std::string s, const size_t count, const bool pseudo)	graph::leaf_node< T, SAFE_MATH >	inline
left	graph::branch_node< T, SAFE_MATH >	protected
reduce()	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
remove_pseudo()	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
right	graph::branch_node< T, SAFE_MATH >	protected
set(const T d)	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
set(const size_t index, const T d)	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
set(const std::vector< T > &d)	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
set(const backend::buffer< T > &d)	graph::leaf_node< T, SAFE_MATH >	inlinevirtual
to_latex() const	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
to_vizgraph(std::stringstream &stream, jit::register_map &registers)	graph::arctan_node< T, SAFE_MATH >	inlinevirtual
~leaf_node()	graph::leaf_node< T, SAFE_MATH >	inlinevirtual