- Generated by
1.9.8
|
Graph Framework
|
This is the complete list of members for graph::apply_u_node< T >, including all inherited members.
| any_has_pseudo(std::array< shared_leaf< T, SAFE_MATH >, N > &branches) | graph::n_branch_node< 7, T, false > | inlineprotected |
| apply_u_node(shared_leaf< T > x, shared_leaf< T > i, shared_leaf< T > rand, shared_leaf< T > mof, shared_leaf< T > tbnu_e_dt, shared_leaf< T > A, shared_leaf< T > B) | graph::apply_u_node< T > | inline |
| base typedef | graph::leaf_node< T, SAFE_MATH > | |
| branches | graph::n_branch_node< 7, T, false > | protected |
| caches | graph::leaf_node< T, SAFE_MATH > | inlinestatic |
| compile(std::ostringstream &stream, jit::register_map ®isters, const jit::register_map &thread_mem, const jit::register_usage &usage) | graph::apply_u_node< T > | inlinevirtual |
| compile_preamble(std::ostringstream &stream, jit::register_map ®isters, jit::visiter_map &visited, jit::register_usage &usage, jit::texture1d_list &textures1d, jit::texture2d_list &textures2d, jit::preamble_map &pre_funcs, int &avail_const_mem) | graph::apply_u_node< T > | inlinevirtual |
| complexity | graph::leaf_node< T, SAFE_MATH > | protected |
| contains_pseudo | graph::leaf_node< T, SAFE_MATH > | protected |
| df(std::shared_ptr< leaf_node< T, SAFE_MATH > > x) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | virtual |
| df_cache | graph::leaf_node< T, SAFE_MATH > | protected |
| endline(std::ostringstream &stream, const jit::register_usage &usage, const char end=';') const | graph::leaf_node< T, SAFE_MATH > | inlinevirtual |
| evaluate() | graph::apply_u_node< T > | inlinevirtual |
| get_arg(const size_t index) const | graph::n_branch_node< 7, T, false > | inline |
| get_complexity() const | graph::leaf_node< T, SAFE_MATH > | inline |
| get_hash() const | graph::leaf_node< T, SAFE_MATH > | inline |
| get_power_base() | graph::leaf_node< T, SAFE_MATH > | inlinevirtual |
| get_power_exponent() const | graph::n_branch_node< 7, T, false > | inlinevirtual |
| 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::n_branch_node< 7, T, false > | inlinevirtual |
| is_constant() const | graph::leaf_node< T, SAFE_MATH > | inlinevirtual |
| is_match(shared_leaf< T > x) | graph::apply_u_node< T > | inlinevirtual |
| no_derivative< T, false, n_branch_node< 7, T, false >, 7 >::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 |
| n_branch_node(std::array< shared_leaf< T, SAFE_MATH >, N > branches, const std::string s) | graph::n_branch_node< 7, T, false > | inline |
| no_derivative(const std::string s) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | inline |
| no_derivative(shared_leaf< T, SAFE_MATH > arg, const std::string s) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | inline |
| no_derivative(shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > r, const std::string s) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | inline |
| no_derivative(shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > m, shared_leaf< T, SAFE_MATH > r, const std::string s) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | inline |
| no_derivative(std::array< shared_leaf< T, SAFE_MATH >, N > b, const std::string s) | graph::no_derivative< T, false, n_branch_node< 7, T, false >, 7 > | inline |
| reduce() | graph::apply_u_node< T > | inlinevirtual |
| remove_pseudo() | graph::apply_u_node< T > | inlinevirtual |
| 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::apply_u_node< T > | inlinevirtual |
| to_vizgraph(std::stringstream &stream, jit::register_map ®isters) | graph::apply_u_node< T > | inlinevirtual |
| total_complexity(std::array< shared_leaf< T, SAFE_MATH >, N > &branches) | graph::n_branch_node< 7, T, false > | inlineprotected |
| ~leaf_node() | graph::leaf_node< T, SAFE_MATH > | inlinevirtual |
1.9.8