AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
Divide.java
Go to the documentation of this file.
1package aud.example.expr;
2
4public class Divide extends Operator {
6 public Divide() {}
7
8 @Override public double getValue() {
11 return
12 left.getData().getValue() / right.getData().getValue();
13 }
14 @Override public Type getType() { return Type.OpDivide; }
15 @Override public Divide clone() { return new Divide(); }
16
17 @Override public String toString() { return "/"; }
18}
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
binary / operator: A/B
Definition: Divide.java:4
Divide clone()
Get a copy: a new AtomicExpression of same type/content.
Definition: Divide.java:15
Divide()
create operation
Definition: Divide.java:6
Type getType()
Get type identifier.
Definition: Divide.java:14
double getValue()
get value
Definition: Divide.java:8
Tree representation of arithmetic expression.
Node representing operator in an expression tree.
Definition: Operator.java:6
type identifiers returned by getType