#include <exprtk.hpp>
|
| T0oT1 (T0 p0, T1 p1, const bfunc_t p2) |
|
expression_node< T >::node_type | type () const |
|
operator_type | operation () const |
|
T | value () const |
|
T0 | t0 () const |
|
T1 | t1 () const |
|
bfunc_t | f () const |
|
virtual expression_node< T > * | branch (const std::size_t &index=0) const |
|
virtual void | collect_nodes (noderef_list_t &) |
|
virtual std::size_t | node_depth () const |
|
std::size_t | compute_node_depth (const expression_node< T > *const &node) const |
|
std::size_t | compute_node_depth (const std::pair< expression_node< T > *, bool > &branch) const |
|
std::size_t | compute_node_depth (const std::pair< expression_node< T > *, bool >(&branch)[N]) const |
|
std::size_t | compute_node_depth (const BranchType &n0, const BranchType &n1) const |
|
std::size_t | compute_node_depth (const BranchType &n0, const BranchType &n1, const BranchType &n2) const |
|
std::size_t | compute_node_depth (const BranchType &n0, const BranchType &n1, const BranchType &n2, const BranchType &n3) const |
|
std::size_t | compute_node_depth (const Sequence< expression_node< T > *, Allocator > &branch_list) const |
|
std::size_t | compute_node_depth (const Sequence< std::pair< expression_node< T > *, bool >, Allocator > &branch_list) const |
|
void | collect (expression_node< T > *const &node, const bool deletable, NodeSequence &delete_node_list) const |
|
void | collect (const std::pair< expression_node< T > *, bool > &branch, NodeSequence &delete_node_list) const |
|
void | collect (expression_node< T > *&node, NodeSequence &delete_node_list) const |
|
void | collect (const std::pair< expression_node< T > *, bool >(&branch)[N], NodeSequence &delete_node_list) const |
|
void | collect (const Sequence< std::pair< expression_node< T > *, bool >, Allocator > &branch, NodeSequence &delete_node_list) const |
|
void | collect (const Sequence< expression_node< T > *, Allocator > &branch_list, NodeSequence &delete_node_list) const |
|
void | collect (const Sequence< expression_node< T > *, AllocatorT > &branch_list, const Sequence< Boolean, AllocatorB > &branch_deletable_list, NodeSequence &delete_node_list) const |
|
◆ bfunc_t
template<typename T , typename T0 , typename T1 >
◆ expression_ptr
◆ functor_t
template<typename T , typename T0 , typename T1 >
◆ nci_t
◆ ndb_t
◆ node_pp_t
◆ node_ptr_t
◆ node_type
template<typename T , typename T0 , typename T1 >
◆ noderef_list_t
◆ value_type
template<typename T , typename T0 , typename T1 >
◆ T0oT1()
template<typename T , typename T0 , typename T1 >
◆ allocate()
template<typename T , typename T0 , typename T1 >
template<typename Allocator >
◆ branch()
Reimplemented in exprtk::details::null_eq_node< T >, exprtk::details::literal_node< T >, exprtk::details::string_literal_node< T >, exprtk::details::unary_node< T >, exprtk::details::unary_branch_node< T, Operation >, exprtk::details::vob_node< T, Operation >, exprtk::details::bov_node< T, Operation >, exprtk::details::cob_node< T, Operation >, exprtk::details::boc_node< T, Operation >, exprtk::details::binary_node< T >, and exprtk::details::binary_ext_node< T, Operation >.
References index.
Referenced by exprtk::details::bipow_node< T, PowOp >::bipow_node(), exprtk::details::bipowninv_node< T, PowOp >::bipowninv_node(), and exprtk::details::string_size_node< T >::string_size_node().
◆ collect() [1/7]
◆ collect() [2/7]
◆ collect() [3/7]
◆ collect() [4/7]
◆ collect() [5/7]
◆ collect() [6/7]
◆ collect() [7/7]
◆ collect_nodes()
◆ compute_node_depth() [1/8]
◆ compute_node_depth() [2/8]
◆ compute_node_depth() [3/8]
◆ compute_node_depth() [4/8]
◆ compute_node_depth() [5/8]
◆ compute_node_depth() [6/8]
◆ compute_node_depth() [7/8]
◆ compute_node_depth() [8/8]
◆ f()
template<typename T , typename T0 , typename T1 >
◆ node_depth()
Reimplemented in exprtk::details::null_eq_node< T >, exprtk::details::unary_node< T >, exprtk::details::binary_node< T >, exprtk::details::binary_ext_node< T, Operation >, exprtk::details::trinary_node< T >, exprtk::details::quaternary_node< T >, exprtk::details::conditional_node< T >, exprtk::details::cons_conditional_node< T >, exprtk::details::break_node< T >, exprtk::details::while_loop_node< T >, exprtk::details::repeat_until_loop_node< T >, exprtk::details::for_loop_node< T >, exprtk::details::while_loop_bc_node< T >, exprtk::details::repeat_until_loop_bc_node< T >, exprtk::details::for_loop_bc_node< T >, exprtk::details::switch_node< T >, exprtk::details::multi_switch_node< T >, exprtk::details::vector_elem_node< T >, exprtk::details::rebasevector_elem_node< T >, exprtk::details::vector_assignment_node< T >, exprtk::details::generic_string_range_node< T >, exprtk::details::string_size_node< T >, exprtk::details::str_vararg_node< T, VarArgFunction >, exprtk::details::vararg_node< T, VarArgFunction >, exprtk::details::vectorize_node< T, VecFunction >, exprtk::details::function_N_node< T, IFunction, N >, exprtk::details::vararg_function_node< T, VarArgFunction >, exprtk::details::generic_function_node< T, GenericFunction >, exprtk::details::generic_function_node< T, null_igenfunc< T > >, exprtk::details::generic_function_node< T, StringFunction >, exprtk::details::return_envelope_node< T >, exprtk::details::unary_branch_node< T, Operation >, exprtk::details::vob_node< T, Operation >, exprtk::details::bov_node< T, Operation >, exprtk::details::cob_node< T, Operation >, exprtk::details::boc_node< T, Operation >, exprtk::details::bipow_node< T, PowOp >, and exprtk::details::bipowninv_node< T, PowOp >.
◆ operation()
template<typename T , typename T0 , typename T1 >
◆ t0()
template<typename T , typename T0 , typename T1 >
◆ t1()
template<typename T , typename T0 , typename T1 >
◆ type()
template<typename T , typename T0 , typename T1 >
◆ value()
template<typename T , typename T0 , typename T1 >
◆ depth
◆ depth_set
The documentation for this class was generated from the following file:
|