one.empty3.apps.tree.altree.AlgebricTree Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of empty3-library-3d Show documentation
Show all versions of empty3-library-3d Show documentation
3D rendering engine. Plus modeling. Expected glsl textures 3d and 2d rendering
/*
* Copyright (c) 2023. Manuel Daniel Dahmen
*
*
* Copyright 2012-2023 Manuel Daniel Dahmen
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package one.empty3.apps.tree.altree;
import java.util.HashMap;
import java.util.Map;
/*__
* Created by Manuel Dahmen on 15-12-16.
*/
public class AlgebricTree extends Tree {
private String formula = "0.0";
Map parametersValues = new HashMap<>();
private one.empty3.apps.tree.altree.TreeNode root;
private int stackSize = 0;
public AlgebricTree(String formula) throws AlgebraicFormulaSyntaxException {
this.formula = formula;
}
public AlgebricTree(String formula, Map parametersValues) {
this.formula = formula;
this.parametersValues = parametersValues;
}
public void setParameter(String s, Double d) {
this.parametersValues.put(s, d);
}
public AlgebricTree construct() throws AlgebraicFormulaSyntaxException {
root = new TreeNode(formula);
stackSize = 0; // Restine sommaire//
add(root, formula);
return this;
}
/***
* Particularité
* @param src
*/
private void checkForSignTreeNode(one.empty3.apps.tree.altree.TreeNode src) {
//System.out.println("DEBUG TREE: current tree" +src);
if (src.getChildren().size() >= 2 && src.getChildren().get(1).type.getClass()
.equals(SignTreeNodeType.class)) {
one.empty3.apps.tree.altree.TreeNode sign = src.getChildren().remove(1);
one.empty3.apps.tree.altree.TreeNode son0 = src.getChildren().remove(0);
double sign1 = ((SignTreeNodeType) sign.type).getSign();
src.getChildren().add(new one.empty3.apps.tree.altree.TreeNode(src, new Object[]{"" + sign1},
new SignTreeNodeType(sign1)));
one.empty3.apps.tree.altree.TreeNode son1 = src.getChildren().get(0);
son1.getChildren().add(son0);
}
}
public boolean add(one.empty3.apps.tree.altree.TreeNode src, String subformula) throws AlgebraicFormulaSyntaxException {
stackSize++;
if (stackSize > 30) {
throw new AlgebraicFormulaSyntaxException("Recursive error (bad formula form");
}
if (src == null || subformula == null || subformula.length() == 0)
return false;
int i = 0;
boolean added = false;
int length = 9;
boolean exception = false;
while (i < length && !added) {
src.getChildren().clear();
try {
int caseChoice = -1;
int lastAdded = -1;
switch (i) {
case 0:
added = addFormulaSeparator(src, subformula);
if (added) caseChoice = 0;
break;
case 1:
added = addTerms(src, subformula);
if (added) caseChoice = 1;
break;
case 2:
added = addFactors(src, subformula);
if (added) caseChoice = 2;
break;
case 3:
added = addPower(src, subformula);
if (added) caseChoice = 3;
break;
case 4: // Mettre - en 4??
added = addSingleSign(src, subformula);
break;
case 5:
added = addDouble(src, subformula);
if (added) caseChoice = 5;
break;
case 6:
added = addFunction(src, subformula);
if (added) caseChoice = 6;
break;
case 7:
added = addBracedExpression(src, subformula);
if (added) caseChoice = 7;
break;
case 8:
added = addVariable(src, subformula);
if (added) caseChoice = 8;
break;
default:
return false;
}
if (added)
checkForSignTreeNode(src);
} catch (AlgebraicFormulaSyntaxException ex) {
exception = true;
}
if (added) {
stackSize--;
return true;
}
i++;
}
throw new AlgebraicFormulaSyntaxException("Cannot add to treeNode or root.", this);
}
private boolean addFormulaSeparator(one.empty3.apps.tree.altree.TreeNode src, String subformula) {
String[] s;
s = subformula.split("=");
if (s.length > 1) {
EquationTreeNode tt = new EquationTreeNode(subformula);
tt.getChildren().add(new EquationTreeNode(s[0]));
tt.getChildren().add(new EquationTreeNode(s[1]));
} else
return false;
return true;
}
private boolean addVariable(one.empty3.apps.tree.altree.TreeNode src, String subformula)
throws AlgebraicFormulaSyntaxException {
if (Character.isLetter(subformula.charAt(0))) {
int i = 1;
while (i < subformula.length() && Character.isLetterOrDigit(subformula.charAt(i))) {
i++;
}
VariableTreeNodeType variableTreeNodeType = new VariableTreeNodeType();
variableTreeNodeType.setValues(new Object[]{subformula.substring(0, i), parametersValues});
src.getChildren().add(new TreeNodeVariable(src, new Object[]{subformula.substring(0, i), parametersValues}, variableTreeNodeType));
if (subformula.length() > i)
throw new AlgebraicFormulaSyntaxException("var tree node test failed. error in formula+ \n" +
subformula.substring(0, i) + " of " + subformula
);
}
return src.getChildren().size() > 0;
}
private boolean addDouble(one.empty3.apps.tree.altree.TreeNode src, String subformula) {
try {
Double d = Double.parseDouble(subformula);
DoubleTreeNodeType doubleTreeNodeType = new DoubleTreeNodeType();
doubleTreeNodeType.setValues(new Object[]{subformula, d});
src.getChildren().add(new TreeNodeDouble(src, new Object[]{subformula, d}, doubleTreeNodeType));
return true;
} catch (NumberFormatException ex) {
return src.getChildren().size() > 0;
}
}
private boolean addSingleSign(one.empty3.apps.tree.altree.TreeNode src, String subformula) throws AlgebraicFormulaSyntaxException {
if (subformula.length() > 1 && subformula.charAt(0) == '-') {
if (add(src, subformula.substring(1))) {
src.getChildren().add(new one.empty3.apps.tree.altree.TreeNode(src, new Object[]{subformula.substring(1)}, new SignTreeNodeType(-1.0)));
return true;
}
}
return false;
}
public boolean addPower(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
int countTerms = 0;
one.empty3.apps.tree.altree.TreeNode t2;
int i = 0;
boolean firstExpFound = false;
boolean isNewExp = false;
int count = 0;
int newExpPos = 0;
int oldExpPos = 0;
char newExp = '^';
double newExpSign = 1;
double oldExpSign = 1;
while (i < values.length()) {
if (values.charAt(i) == '^' && /*9(i < values.length() - 1 || values.charAt(i + 1) != '*') &&*/ count == 0) {
newExp = '^';
newExpPos = i;
isNewExp = true;
firstExpFound = true;
newExpSign = 1;
} else if (values.charAt(i) == '/' && count == 0) {
newExp = '/';
isNewExp = true;
newExpPos = i;
firstExpFound = true;
newExpSign = -1;
}
if (i == values.length() - 1 && firstExpFound) {
isNewExp = true;
newExpPos = i + 1;
}
if (values.charAt(i) == '(') {
count++;
} else if (values.charAt(i) == ')') {
count--;
}
if (values.charAt(values.length() - 1) == '*' || values.charAt(values.length() - 1) == '/')
return false;
if (isNewExp && count == 0) {
String subsubstring = values.substring(oldExpPos, newExpPos);
if (subsubstring.length() > 0) {
t2 = new one.empty3.apps.tree.altree.TreeNode(t, new Object[]{subsubstring}, new PowerTreeNodeType(oldExpSign));
if (subsubstring.charAt(0) == '-') {
subsubstring = subsubstring.substring(1);
SignTreeNodeType signTreeNodeType = new SignTreeNodeType(-1.0);
signTreeNodeType.instantiate(new Object[]{subsubstring});
t2 = new one.empty3.apps.tree.altree.TreeNode(t2, new Object[]{subsubstring}, signTreeNodeType);
}
if (subsubstring.length() > 0 && !add(t2, subsubstring)) {
return false;
} else {
t.getChildren().add(t2);
countTerms++;
}
}
//ab44md78
//gen44md78
isNewExp = false;
newExpPos = i + 1;
oldExpPos = i + 1;
oldExpSign = newExpSign;
}
i++;
}
return t.getChildren().size() > 0 && countTerms > 0;
}
public boolean addFactors(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
int countTerms = 0;
one.empty3.apps.tree.altree.TreeNode t2;
int i = 0;
boolean firstTermFound = false;
boolean isNewFactor = false;
int count = 0;
int newFactorPos = 0;
int oldFactorPos = 0;
char newFactor = '*';
double newFactorSign = 1;
double oldFactorSign = 1;
while (i < values.length()) {
if (values.charAt(i) == '*' && /*9(i < values.length() - 1 || values.charAt(i + 1) != '*') &&*/ count == 0) {
newFactor = '*';
newFactorPos = i;
isNewFactor = true;
firstTermFound = true;
newFactorSign = 1;
} else if (values.charAt(i) == '/' && count == 0) {
newFactor = '/';
isNewFactor = true;
newFactorPos = i;
firstTermFound = true;
newFactorSign = -1;
}
if (i == values.length() - 1 && firstTermFound) {
isNewFactor = true;
newFactorPos = i + 1;
}
if (values.charAt(i) == '(') {
count++;
} else if (values.charAt(i) == ')') {
count--;
}
if (values.charAt(values.length() - 1) == '*' || values.charAt(values.length() - 1) == '/')
return false;
if (isNewFactor && count == 0) {
String subsubstring = values.substring(oldFactorPos, newFactorPos);
if (subsubstring.length() > 0) {
t2 = new one.empty3.apps.tree.altree.TreeNode(t, new Object[]{subsubstring}, new FactorTreeNodeType(oldFactorSign));
if (subsubstring.charAt(0) == '-') {
subsubstring = subsubstring.substring(1);
SignTreeNodeType signTreeNodeType = new SignTreeNodeType(-1.0);
signTreeNodeType.instantiate(new Object[]{subsubstring});
t2 = new one.empty3.apps.tree.altree.TreeNode(t2, new Object[]{subsubstring}, signTreeNodeType);
}
if (!add(t2, subsubstring)) {
return false;
} else {
t.getChildren().add(t2);
countTerms++;
}
}
isNewFactor = false;
newFactorPos = i + 1;
oldFactorPos = i + 1;
oldFactorSign = newFactorSign;
}
i++;
}
return t.getChildren().size() > 0 && countTerms > 0;
}
public boolean addTerms(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
int countTerms = 0;
one.empty3.apps.tree.altree.TreeNode t2;
int i = 0;
boolean firstTermFound = false;
boolean isNewFactor = false;
int count = 0;
int newFactorPos = 0;
int oldFactorPos = 0;
char newFactor = '+';
double newFactorSign = 1;
double oldFactorSign = 1;
while (i < values.length()) {
if (values.charAt(i) == '+' && count == 0 && i > 0/*&& (i < values.length() - 1 || values.charAt(i + 1) != '+')*/ && count == 0) {
newFactor = '+';
newFactorPos = i;
isNewFactor = true;
firstTermFound = true;
newFactorSign = 1;
} else if (values.charAt(i) == '-' && count == 0 && i > 0) {
newFactor = '-';
isNewFactor = true;
newFactorPos = i;
firstTermFound = true;
newFactorSign = -1;
}
if ((values.charAt(i) == '-' || values.charAt(i) == '+') && i == 0) {
}
if (values.charAt(i) == '(') {
count++;
} else if (values.charAt(i) == ')') {
count--;
}
if (i == values.length() - 1 && firstTermFound) {
isNewFactor = true;
newFactorPos = i + 1;
}
if (values.charAt(values.length() - 1) == '+' || values.charAt(values.length() - 1) == '-')
return false;
if (isNewFactor && count == 0) {
countTerms++;
isNewFactor = false;
char op = newFactor;
String subsubstring = values.substring(oldFactorPos, newFactorPos);
if (subsubstring.length() > 0) {
t2 = new one.empty3.apps.tree.altree.TreeNode(t, new Object[]{subsubstring}, new TermTreeNodeType(oldFactorSign));
if (!add(t2, subsubstring)) {
return false;
} else {
t.getChildren().add(t2);
countTerms++;
}
} else
return false;
isNewFactor = false;
newFactorPos = i + 1;
oldFactorPos = i + 1;
newFactor = 0;
oldFactorSign = newFactorSign;
}
i++;
}
return t.getChildren().size() > 0 && countTerms > 0;
}
public boolean addFunction(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
try {
int i = 1;
int count = 0;
int argumentStart = 0;
int argumentEnd = 0;
int functionNameStart = 0;
int countLetters = 0;
boolean isName = true;
while (i < values.length()) {
if (isName && Character.isLetter(values.charAt(0)) && Character.isLetterOrDigit(values.charAt(i)) && count == 0) {
countLetters++;
isName = true;
} else if (values.charAt(i) == '(' && i > 0) {
isName = false;
if (count == 0) {
argumentStart = i + 1;
}
count++;
} else if (values.charAt(i) == ')' && i > 1) {
count--;
argumentEnd = i;
} else if (i < 2)
return false;
i++;
}
if (count == 0 && values.charAt(i - 1) == ')') {
String fName = values.substring(functionNameStart, argumentStart - 1);
String fParamString = values.substring(argumentStart, argumentEnd);
TreeTreeNodeType mathFunctionTreeNodeType = new TreeTreeNodeType(
fParamString, parametersValues
);
one.empty3.apps.tree.altree.TreeNode t2 = new TreeTreeNode(t, new Object[]{fParamString, parametersValues, fName},
mathFunctionTreeNodeType);
if (!add(t2, fParamString))
return false;
t.getChildren().add(t2);
}
} catch (Exception ex) {
return false;
}
return t.getChildren().size() > 0;
}
/*
* add method calls
* examples
* a = new Point(0.0, y/this.getResY());
* b.x >= p.plus(p2.mult(3.0).add(p3)).getY();
* ajouter {; , .}
*/
public boolean addMethodCall(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
int i = 1;
boolean isNewFactor = false;
int count = 0;
int newFactorPos = 0;
int oldFactorPos = 0;
char newFactor = 0;
int countLetters = 0;
while (i < values.length()) {
if (Character.isLetter(values.charAt(0)) && Character.isLetterOrDigit(values.charAt(i)) && count == 0) {
countLetters++;
} else if (values.charAt(i) == '(') {
if (count == 0) {
newFactorPos = i + 1;
}
count++;
} else if (values.charAt(i) == ')') {
count--;
} else if (i < 1)
return false;
if (count == 0 && values.charAt(i) == ')') {
String fName = values.substring(oldFactorPos, newFactorPos - 1);
String fParamString = values.substring(newFactorPos, i);
TreeTreeNodeType mathFunctionTreeNodeType = new TreeTreeNodeType(
"", parametersValues
);
one.empty3.apps.tree.altree.TreeNode t2 = new TreeTreeNode(t, new Object[]{fName, parametersValues, fParamString},
mathFunctionTreeNodeType);
if (!add(t2, fParamString))
return false;
t.getChildren().add(t2);
}
i++;
}
return t.getChildren().size() > 0;
}
public boolean addBracedExpression(one.empty3.apps.tree.altree.TreeNode t, String values) throws AlgebraicFormulaSyntaxException {
one.empty3.apps.tree.altree.TreeNode tBraced;
int i = 0;
int count = 0;
while (i < values.length()) {
if (values.charAt(i) == ')') {
count--;
} else if (values.charAt(i) == '(') {
count++;
} else if (i < 1)
return false;
if (i == values.length() - 1 && count == 0 && values.charAt(i) == ')') {
String subsubstring = values.substring(1, values.length() - 1);
TreeTreeNodeType mathFunctionTreeNodeType = new TreeTreeNodeType(
subsubstring, parametersValues
);
TreeNode t2 = new TreeTreeNode(t, new Object[]{subsubstring, parametersValues, ""}, mathFunctionTreeNodeType);
if (!add(t2, subsubstring))
return false;
t.getChildren().add(t2);
}
i++;
}
return t.getChildren().size() > 0;
}
public Double eval() throws TreeNodeEvalException, AlgebraicFormulaSyntaxException {
return root.eval();
}
public String toString() {
String s = "Arbre algébrique\n" +
"Racine: " + root.getClass() + root.toString();
return s;
}
public void setParametersValues(Map parametersValues) {
this.parametersValues = parametersValues;
}
public Map getParametersValues() {
return parametersValues;
}
}