You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
54 lines
1.9 KiB
54 lines
1.9 KiB
package com.fr.design.formula; |
|
|
|
import com.fr.parser.BinaryExpression; |
|
import com.fr.parser.DatasetFunctionCall; |
|
import com.fr.parser.FunctionCall; |
|
import com.fr.stable.script.Node; |
|
|
|
import java.util.Arrays; |
|
|
|
/** |
|
* @author Hoky |
|
* @date 2021/8/30 |
|
*/ |
|
public class UnsupportedFormulaScanner { |
|
public final static String[] UNSUPPORTED_FORMULAS = new String[]{"PROPORTION", "TOIMAGE", |
|
"WEBIMAGE", "SORT", "CROSSLAYERTOTAL", "CIRCULAR", "LAYERTOTAL", "MOM", "HIERARCHY", |
|
"FILENAME", "FILESIZE", "FILETYPE", "TREELAYER", "GETUSERDEPARTMENTS", "GETUSERJOBTITLES"}; |
|
|
|
private String unSupportFormula = ""; |
|
|
|
public boolean travelFormula(Node node) { |
|
if (node instanceof FunctionCall) { |
|
if (isUnsupportedFomula(((FunctionCall) node).getName())) { |
|
unSupportFormula = ((FunctionCall) node).getName(); |
|
return false; |
|
} else { |
|
for (Node argument : ((FunctionCall) node).getArguments()) { |
|
if (!travelFormula(argument)) { |
|
return false; |
|
} |
|
} |
|
} |
|
} else if (node instanceof BinaryExpression) { |
|
for (Node array : ((BinaryExpression) node).getNodes()) { |
|
if (!travelFormula(array)) { |
|
return false; |
|
} |
|
} |
|
} else if (node instanceof DatasetFunctionCall) { |
|
DatasetFunctionCall datasetFunctionCall = (DatasetFunctionCall) node; |
|
unSupportFormula = datasetFunctionCall.getSourceName() + "." + datasetFunctionCall.getFnName() + "()"; |
|
return false; |
|
} |
|
return true; |
|
} |
|
|
|
public String getUnSupportFormula() { |
|
return unSupportFormula; |
|
} |
|
|
|
private static boolean isUnsupportedFomula(String formula) { |
|
return Arrays.asList(UNSUPPORTED_FORMULAS).contains(formula.toUpperCase()); |
|
} |
|
}
|
|
|