|
| TUnEquNode (TNode< T > *ALeft, TNode< T > *ARight) |
|
virtual void | accept (TNodeVisitor< T > &) |
| calls the visit method in TNodeVisitor<>
|
|
virtual TUnEquNode * | clone () const |
| clones that node
|
|
virtual TNode< T > * | left () const |
| returns the right child node of the expression tree
|
|
virtual TNode< T > * | right () const |
| returns the left child node of the expression tree
|
|
virtual bool | equals (const TNode< T > *ANode) const |
| returns true, if given node equals to this one
|
|
TNode< T > * | parent () const |
| returns the parent node (returns 0 if this node is the root node)
|
|
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
|
|
iterator | begin () |
| iterator access to the first value node in this operator level
|
|
iterator | end () |
| iterator access to the end
|
|
template<typename T>
class math::TUnEquNode< T >
Definition at line 616 of file nodes.h.