completato binary tree e implementato euler tour astratto + una sua implementazione per computazione aritmetica

This commit is contained in:
2014-04-27 13:38:06 +02:00
parent cd1a246d4f
commit 4f68dd31d1
11 changed files with 208 additions and 6 deletions

View File

@@ -0,0 +1,16 @@
package euler_tour.expressions;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:08
*/
public class AdditionOperator extends ExpressionOperator {
public Integer getValue() {
return (firstOperand + secondOperand);
}
public String toString() {
return new String("+"); }
}

View File

@@ -0,0 +1,30 @@
package euler_tour.expressions;
import euler_tour.EulerTour;
import position.Position;
import tree.binarytree.BinaryTree;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:09
*/
public class EvaluateExpressionTour extends EulerTour<ExpressionTerm,Integer> {
public Integer execute(BinaryTree<ExpressionTerm> T) {
init(T);
return eulerTour(tree.root());
}
protected void visitRight(Position<ExpressionTerm> v, TourResult<Integer> r) {
ExpressionTerm term = v.element();
if (tree.isInternal(v)) {
ExpressionOperator op = (ExpressionOperator) term;
op.setOperands(r.left, r.right);
}
r.out = term.getValue();
}
}

View File

@@ -0,0 +1,17 @@
package euler_tour.expressions;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:07
*/
public class ExpressionOperator extends ExpressionTerm {
protected Integer firstOperand, secondOperand;
public void setOperands(Integer x, Integer y) {
firstOperand = x;
secondOperand = y;
}
}

View File

@@ -0,0 +1,15 @@
package euler_tour.expressions;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:06
*/
public class ExpressionTerm {
public Integer getValue() { return 0; }
public String toString() {
return new String("");
}
}

View File

@@ -0,0 +1,18 @@
package euler_tour.expressions;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:06
*/
public class ExpressionVariable extends ExpressionTerm {
protected Integer var;
public ExpressionVariable(Integer x) { var = x; }
public void setVariable(Integer x) { var = x; }
public Integer getValue() { return var; }
public String toString() { return var.toString(); }
}

View File

@@ -0,0 +1,45 @@
package euler_tour.expressions;
import euler_tour.EulerTour;
import position.Position;
import tree.binarytree.BinaryTree;
/**
* Created with MONSTER.
* User: xgiovio
* Date: 27/04/2014
* Time: 13:11
*/
public class StringExpressionTour extends EulerTour<ExpressionTerm,String> {
public String execute(BinaryTree<ExpressionTerm> T) {
init(T);
return eulerTour(T.root());
}
protected void visitLeft(Position<ExpressionTerm> v, TourResult<String> r) {
if (tree.isInternal(v)) {
r.out = new String("(");
}else {
r.out = new String("");
}
}
protected void visitBelow(Position<ExpressionTerm> v, TourResult<String> r) {
if (tree.isInternal(v)) {
r.out += r.left;
}
r.out += v.element();
}
protected void visitRight(Position<ExpressionTerm> v,TourResult<String> r) {
if (tree.isInternal(v)) {
r.out += r.right;
r.out += ")";
}
}
}