MathTypeLibrary(libmath++)
0.0.3
|
#include <nodes.h>
Public Member Functions | |
TSqrtNode (TNode< T > *ANode) | |
virtual void | accept (TNodeVisitor< T > &) |
calls the visit method in TNodeVisitor<> | |
virtual TSqrtNode * | clone () const |
clones that node | |
![]() | |
TNode< T > * | node () const |
returns the child node for that unary operator node. | |
virtual TNode< T > * | right () const |
returns the child node (wrapper to the more declarative node() method) | |
virtual bool | equals (const TNode< T > *ANode) const |
returns true, if given node equals to this one | |
![]() | |
virtual | ~TNode () |
each virtual class needs a virtual destructor (this one does nothing) | |
TNodeType | nodeType () const |
returns the type of this node | |
short | priority () const |
returns the node priority | |
TNode< T > * | parent () const |
returns the parent node (returns 0 if this node is the root node) | |
virtual TNode< T > * | left () const |
returns the left child node (returns 0 if this node doesn't support one) | |
iterator | begin () |
iterator access to the first value node in this operator level | |
iterator | end () |
iterator access to the end |
Additional Inherited Members | |
![]() | |
enum | TNodeType { NUMBER_NODE, SYMBOL_NODE, PARAM_NODE, PLUS_NODE, NEG_NODE, MUL_NODE, DIV_NODE, MOD_NODE, POW_NODE, EQU_NODE, UNEQU_NODE, LESS_EQU_NODE, GREATER_EQU_NODE, LESS_NODE, GREATER_NODE, FUNC_NODE, SQRT_NODE, SIN_NODE, COS_NODE, TAN_NODE, LN_NODE, IF_NODE } |
typedef TNodeIterator< T > | iterator |
typedef const TNodeIterator< T > | const_iterator |
typedef TOperandIter< TNode< T > > | operand_iterator |
typedef TOperandIter< const TNode< T > > | const_operand_iterator |
![]() | |
TUnaryNodeOp (typename TUnaryNodeOp< T >::TNodeType AType, short APriority, TNode< T > *ANode) | |
creates an unary operator node of type AType. |
TSqrtNode<> implements the build-in sqrt() function. for numbers of type T.