AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
UnaryMinus.java
Go to the documentation of this file.
1package aud.example.expr;
2
4public class UnaryMinus extends Operator {
6 public UnaryMinus() {}
7
8 @Override public double getValue() {
10 assert(node_.getRight()==null); // unary operation
11 return -left.getData().getValue();
12 }
13 @Override public Type getType() { return Type.OpUnaryMinus; }
14 @Override public UnaryMinus clone() { return new UnaryMinus(); }
15 @Override public String toString() { return "-"; }
16}
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
unary - operator: -A ("sign")
Definition: UnaryMinus.java:4
UnaryMinus clone()
Get a copy: a new AtomicExpression of same type/content.
Definition: UnaryMinus.java:14
Type getType()
Get type identifier.
Definition: UnaryMinus.java:13
UnaryMinus()
create operation
Definition: UnaryMinus.java:6
double getValue()
get value
Definition: UnaryMinus.java:8
type identifiers returned by getType