![]() |
GranOO
3.0
A robust and versatile workbench to build 3D dynamic simulations based on the Discrete Element Method
|
#include <Exprtk.hpp>

Public Member Functions | |
| virtual | ~boc_base_node () |
| virtual operator_type | operation () const |
| virtual const T | c () const =0 |
| virtual void | set_c (const T)=0 |
| virtual expression_node< T > * | move_branch (const std::size_t &index)=0 |
Public Member Functions inherited from exprtk::details::expression_node< T > | |
| virtual | ~expression_node () |
| virtual T | value () const |
| virtual expression_node< T > * | branch (const std::size_t &index=0) const |
| virtual node_type | type () const |
| virtual bool | valid () const |
Public Member Functions inherited from exprtk::details::node_collector_interface< expression_node< T > > | |
| virtual | ~node_collector_interface () |
| virtual void | collect_nodes (noderef_list_t &) |
Public Member Functions inherited from exprtk::details::node_depth_base< expression_node< T > > | |
| node_depth_base () | |
| virtual | ~node_depth_base () |
| 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 nb_pair_t &branch) const |
| std::size_t | compute_node_depth (const nb_pair_t(&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< node_ptr_t, Allocator > &branch_list) const |
| std::size_t | compute_node_depth (const Sequence< nb_pair_t, Allocator > &branch_list) const |
| std::size_t | max_node_depth (const BranchType &n0, const BranchType &n1) const |
| std::size_t | max_node_depth (const BranchType &n0, const BranchType &n1, const BranchType &n2) const |
| std::size_t | max_node_depth (const BranchType &n0, const BranchType &n1, const BranchType &n2, const BranchType &n3) const |
| void | collect (node_ptr_t const &node, const bool deletable, NodeSequence &delete_node_list) const |
| void | collect (const nb_pair_t &branch, NodeSequence &delete_node_list) const |
| void | collect (expression_node< T > *&node, NodeSequence &delete_node_list) const |
| void | collect (const nb_pair_t(&branch)[N], NodeSequence &delete_node_list) const |
| void | collect (const Sequence< nb_pair_t, Allocator > &branch, NodeSequence &delete_node_list) const |
| void | collect (const Sequence< node_ptr_t, Allocator > &branch_list, NodeSequence &delete_node_list) const |
| void | collect (const Sequence< node_ptr_t, AllocatorT > &branch_list, const Sequence< Boolean, AllocatorB > &branch_deletable_list, NodeSequence &delete_node_list) const |
|
inlinevirtual |
|
pure virtual |
|
pure virtual |
Implemented in exprtk::details::exprtk_final< T >, and exprtk::details::exprtk_final< T >.
|
inlinevirtual |
Reimplemented in exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, exprtk::details::exprtk_final< T >, and exprtk::details::exprtk_final< T >.
|
pure virtual |
Implemented in exprtk::details::exprtk_final< T >, and exprtk::details::exprtk_final< T >.