AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
Plus.java
Go to the documentation of this file.
1package aud.example.expr;
2
4public class Plus extends Operator {
6 public Plus() {}
7
8 @Override public double getValue() {
11 return
12 left.getData().getValue() + right.getData().getValue();
13 }
14 @Override public Type getType() { return Type.OpPlus; }
15 @Override public Plus clone() { return new Plus(); }
16 @Override public String toString() { return "+"; }
17}
BinaryTree< T > getLeft()
get left child or null
Definition: BinaryTree.java:86
T getData()
get node data
Definition: BinaryTree.java:81
BinaryTree< T > getRight()
get right child or null)
Definition: BinaryTree.java:88
ExpressionTree node_
uplink reference to node: node_.getData()==this @endiliteral
Tree representation of arithmetic expression.
Node representing operator in an expression tree.
Definition: Operator.java:6
binary + operator: A+B
Definition: Plus.java:4
Type getType()
Get type identifier.
Definition: Plus.java:14
String toString()
Definition: Plus.java:16
Plus()
create operation
Definition: Plus.java:6
double getValue()
get value
Definition: Plus.java:8
Plus clone()
Get a copy: a new AtomicExpression of same type/content.
Definition: Plus.java:15
type identifiers returned by getType