![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
binary + operator: A+B More...
Inheritance diagram for aud.example.expr.Plus:
Collaboration diagram for aud.example.expr.Plus:Public Member Functions | |
| Plus () | |
| create operation More... | |
| double | getValue () |
| get value More... | |
| Type | getType () |
| Get type identifier. More... | |
| Plus | clone () |
| Get a copy: a new AtomicExpression of same type/content. More... | |
| String | toString () |
Public Member Functions inherited from aud.example.expr.AtomicExpression | |
| boolean | isOperator () |
| node represents operator More... | |
| boolean | isTerminal () |
| node represents number or symbol More... | |
| abstract Type | getType () |
| Get type identifier. More... | |
| AtomicExpression | clone () |
| Get a copy: a new AtomicExpression of same type/content. More... | |
| abstract double | getValue () |
| get value More... | |
Additional Inherited Members | |
Protected Attributes inherited from aud.example.expr.AtomicExpression | |
| ExpressionTree | node_ = null |
uplink reference to node: node_.getData()==this @endiliteral More... | |
create operation
Definition at line 6 of file Plus.java.
Referenced by aud.example.expr.Plus.clone().
Here is the caller graph for this function:| Plus aud.example.expr.Plus.clone | ( | ) |
Get a copy: a new AtomicExpression of same type/content.
Reimplemented from aud.example.expr.AtomicExpression.
Definition at line 15 of file Plus.java.
References aud.example.expr.Plus.Plus().
Here is the call graph for this function:| Type aud.example.expr.Plus.getType | ( | ) |
Get type identifier.
Reimplemented from aud.example.expr.AtomicExpression.
Definition at line 14 of file Plus.java.
References aud.example.expr.AtomicExpression.Type.OpPlus.
| double aud.example.expr.Plus.getValue | ( | ) |
get value
| UnsupportedOperationException | if value cannot be determined |
Reimplemented from aud.example.expr.AtomicExpression.
Definition at line 8 of file Plus.java.
References aud.BinaryTree< T >.getData(), aud.BinaryTree< T >.getLeft(), aud.BinaryTree< T >.getRight(), and aud.example.expr.AtomicExpression.node_.
Here is the call graph for this function:| String aud.example.expr.Plus.toString | ( | ) |