it.cnr.istc.pst.platinum.ai.lang.ddl.v3.parser.DDLNumericParameterConstraint.parse() - Code Metrics - pstlab/PLATINUm - Measure and Improve Code Quality continuously with Scrutinizer

parse() F
last analyzed 2025-11-26 17:38 UTC

↳ Parent: it.cnr.istc.pst.platinum.ai.lang.ddl.v3.parser.DDLNumericParameterConstraint

Complexity

Conditions

Size

Total Lines	79
Code Lines	64

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	32
eloc	64
dl	0
loc	79
rs	0
c	0
b	0
f	0

How to fix Long Method Complexity

Long Method

Small methods make your code easier to understand, in particular if combined with a good name. Besides, if your method is small, finding a good name is usually much easier.

For example, if you find yourself adding comments to a method's body, this is usually a good sign to extract the commented part to a new method, and use the comment as a starting point when coming up with a good name for this new method.

Commonly applied refactorings include:

If many parameters/temporary variables are present:
- Replace temporary variables with Query
- Introduce parameter object; often combined with preserve whole object
- If the above two are insufficient: Replace method with method object
If you have long conditionals: Decompose Conditional
Otherwise: Extract method

Complexity

Complex classes like it.cnr.istc.pst.platinum.ai.lang.ddl.v3.parser.DDLNumericParameterConstraint.parse() often do a lot of different things. To break such a class down, we need to identify a cohesive component within that class. A common approach to find such a component is to look for fields/methods that share the same prefixes, or suffixes.

Once you have determined the fields that belong together, you can apply the Extract Class refactoring. If the component makes sense as a sub-class, Extract Subclass is also a candidate, and is often faster.

package it.cnr.istc.pst.platinum.ai.lang.ddl.v3.parser;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

import org.antlr.runtime.Token;

/**
 *
 * @author Riccardo De Benedictis
 */
public class DDLNumericParameterConstraint extends DDLParameterConstraint {

    private DDLNumericParameterConstraintType constraintType;
    private String leftTerm;
    private long leftCoefficient;
    private int absoluteValue = 0;
    private final List<String> rightVariables = new ArrayList<>();
    private final List<Integer> rightCoefficients = new ArrayList<>();

    /**
     * 
     * @param payload
     */
    public DDLNumericParameterConstraint(Token payload) {
        super(payload, DDLParameterConstraintType.NUMERIC);
    }

    @Override
    void parse() {
        String constraint_type = getText();
        if (constraint_type.equals("=")) {
            constraintType = DDLNumericParameterConstraintType.EQ;
        }
        if (constraint_type.equals(">")) {
            constraintType = DDLNumericParameterConstraintType.GT;
        }
        if (constraint_type.equals("<")) {
            constraintType = DDLNumericParameterConstraintType.LT;
        }
        if (constraint_type.equals(">=")) {
            constraintType = DDLNumericParameterConstraintType.GE;
        }
        if (constraint_type.equals("<=")) {
            constraintType = DDLNumericParameterConstraintType.LE;
        }
        if (constraint_type.equals("!=")) {
            constraintType = DDLNumericParameterConstraintType.NEQ;
        }
        if (getChild(0).getType() == ddl3Lexer.VarID) {
            leftTerm = getChild(0).getText();
            leftCoefficient = 1l;
        } else if (getChild(0).getText().equals("*")) {
            long coefficient = getChild(0).getChild(0).getText().equals("INF") ? Long.MAX_VALUE - 1 : Long.parseLong(getChild(0).getChild(0).getText());
            if (getChild(0).getChild(0).getChildCount() > 0) {
                coefficient = getChild(0).getChild(0).getChild(0).getText().equals("-") ? -coefficient : coefficient;
            }
            leftTerm = getChild(1).getChild(1).getText();
            leftCoefficient = coefficient;
        }
        if (getChild(1).getType() == ddl3Lexer.VarID) {
            rightVariables.add(getChild(1).getText());
//            rightCoefficients.add(1l);
            rightCoefficients.add(1);
        } else if (getChild(1).getText().equals("*")) {
            int coefficient = getChild(1).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(1).getChild(0).getText());
            if (getChild(1).getChild(0).getChildCount() > 0) {
                coefficient = getChild(1).getChild(0).getChild(0).getText().equals("-") ? -coefficient : coefficient;
            }
            rightVariables.add(getChild(1).getChild(1).getText());
            rightCoefficients.add(coefficient);
        } else {
            int coefficient = getChild(1).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(1).getText());
            if (getChild(1).getChildCount() > 0) {
                coefficient = getChild(1).getChild(0).getText().equals("-") ? -coefficient : coefficient;
            }
            rightVariables.add(null);
            rightCoefficients.add(coefficient);
        }
        for (int i = 2; i < getChildCount(); i++) {
            if (getChild(i).getText().equals("+")) {
                if (getChild(i).getChild(0).getType() == ddl3Lexer.VarID) {
                    rightVariables.add(getChild(i).getChild(0).getText());
                    rightCoefficients.add(1);
                } else if (getChild(i).getChild(0).getText().equals("*")) {
                    rightVariables.add(getChild(i).getChild(0).getChild(1).getText());
                    rightCoefficients.add(Integer.parseInt(getChild(i).getChild(0).getChild(0).getText()));
                } else {
                    int coefficient = getChild(i).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(i).getChild(0).getText());
                    if (getChild(i).getChildCount() > 0) {
                        coefficient = getChild(i).getChild(0).getText().equals("-") ? -coefficient : coefficient;
                    }
                    absoluteValue += coefficient;
                }
            } else {
                if (getChild(i).getChild(0).getType() == ddl3Lexer.VarID) {
                    rightVariables.add(getChild(i).getChild(0).getText());
                    rightCoefficients.add(-1);
                } else if (getChild(i).getChild(0).getText().equals("*")) {
                    rightVariables.add(getChild(i).getChild(0).getChild(1).getText());
                    rightCoefficients.add(-Integer.parseInt(getChild(i).getChild(0).getChild(0).getText()));
                } else {
                    long coefficient = getChild(i).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(i).getChild(0).getText());
                    if (getChild(i).getChildCount() > 0) {
                        coefficient = getChild(i).getChild(0).getText().equals("-") ? -coefficient : coefficient;
                    }
                    absoluteValue -= coefficient;
                }
            }
        }
    }

    public boolean isBinary() {
        return rightVariables.size() == 1 && absoluteValue == 0 && rightVariables.get(0) != null;
    }

    /**
     * @return the constraintType
     */
    public DDLNumericParameterConstraintType getNumericConstraintType() {
        return constraintType;
    }

    /**
     * @return the leftTerm
     */
    public String getLeftTerm() {
        return leftTerm;
    }

    /**
     * @return the leftCoefficient
     */
    public long getLeftCoefficient() {
        return leftCoefficient;
    }

    /**
     * @return the rightVariables
     */
    public List<String> getRightVariables() {
        return Collections.unmodifiableList(rightVariables);
    }

    /**
     * @return the rightCoefficients
     */
    public List<Integer> getRightCoefficients() {
        return Collections.unmodifiableList(rightCoefficients);
    }

//    public int getAbsoluteValue() {
//        return absoluteValue;
//    }

    public enum DDLNumericParameterConstraintType {

        EQ, LT, GT, LE, GE, NEQ;
    }
}


1			package it.cnr.istc.pst.platinum.ai.lang.ddl.v3.parser;
2
3			import java.util.ArrayList;
4			import java.util.Collections;
5			import java.util.List;
6
7			import org.antlr.runtime.Token;
8
9			/**
10			*
11			* @author Riccardo De Benedictis
12			*/
13			public class DDLNumericParameterConstraint extends DDLParameterConstraint {
14
15			private DDLNumericParameterConstraintType constraintType;
16			private String leftTerm;
17			private long leftCoefficient;
18			private int absoluteValue = 0;
19			private final List<String> rightVariables = new ArrayList<>();
20			private final List<Integer> rightCoefficients = new ArrayList<>();
21
22			/**
23			*
24			* @param payload
25			*/
26			public DDLNumericParameterConstraint(Token payload) {
27			super(payload, DDLParameterConstraintType.NUMERIC);
28			}
29
30			@Override
31			void parse() {
32			String constraint_type = getText();
33			if (constraint_type.equals("=")) {
34			constraintType = DDLNumericParameterConstraintType.EQ;
35			}
36			if (constraint_type.equals(">")) {
37			constraintType = DDLNumericParameterConstraintType.GT;
38			}
39			if (constraint_type.equals("<")) {
40			constraintType = DDLNumericParameterConstraintType.LT;
41			}
42			if (constraint_type.equals(">=")) {
43			constraintType = DDLNumericParameterConstraintType.GE;
44			}
45			if (constraint_type.equals("<=")) {
46			constraintType = DDLNumericParameterConstraintType.LE;
47			}
48			if (constraint_type.equals("!=")) {
49			constraintType = DDLNumericParameterConstraintType.NEQ;
50			}
51			if (getChild(0).getType() == ddl3Lexer.VarID) {
52			leftTerm = getChild(0).getText();
53			leftCoefficient = 1l;
54			} else if (getChild(0).getText().equals("*")) {
55			long coefficient = getChild(0).getChild(0).getText().equals("INF") ? Long.MAX_VALUE - 1 : Long.parseLong(getChild(0).getChild(0).getText());
56			if (getChild(0).getChild(0).getChildCount() > 0) {
57			coefficient = getChild(0).getChild(0).getChild(0).getText().equals("-") ? -coefficient : coefficient;
58			}
59			leftTerm = getChild(1).getChild(1).getText();
60			leftCoefficient = coefficient;
61			}
62			if (getChild(1).getType() == ddl3Lexer.VarID) {
63			rightVariables.add(getChild(1).getText());
64			// rightCoefficients.add(1l);
65			rightCoefficients.add(1);
66			} else if (getChild(1).getText().equals("*")) {
67			int coefficient = getChild(1).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(1).getChild(0).getText());
68			if (getChild(1).getChild(0).getChildCount() > 0) {
69			coefficient = getChild(1).getChild(0).getChild(0).getText().equals("-") ? -coefficient : coefficient;
70			}
71			rightVariables.add(getChild(1).getChild(1).getText());
72			rightCoefficients.add(coefficient);
73			} else {
74			int coefficient = getChild(1).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(1).getText());
75			if (getChild(1).getChildCount() > 0) {
76			coefficient = getChild(1).getChild(0).getText().equals("-") ? -coefficient : coefficient;
77			}
78			rightVariables.add(null);
79			rightCoefficients.add(coefficient);
80			}
81			for (int i = 2; i < getChildCount(); i++) {
82			if (getChild(i).getText().equals("+")) {
83			if (getChild(i).getChild(0).getType() == ddl3Lexer.VarID) {
84			rightVariables.add(getChild(i).getChild(0).getText());
85			rightCoefficients.add(1);
86			} else if (getChild(i).getChild(0).getText().equals("*")) {
87			rightVariables.add(getChild(i).getChild(0).getChild(1).getText());
88			rightCoefficients.add(Integer.parseInt(getChild(i).getChild(0).getChild(0).getText()));
89			} else {
90			int coefficient = getChild(i).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(i).getChild(0).getText());
91			if (getChild(i).getChildCount() > 0) {
92			coefficient = getChild(i).getChild(0).getText().equals("-") ? -coefficient : coefficient;
93			}
94			absoluteValue += coefficient;
95			}
96			} else {
97			if (getChild(i).getChild(0).getType() == ddl3Lexer.VarID) {
98			rightVariables.add(getChild(i).getChild(0).getText());
99			rightCoefficients.add(-1);
100			} else if (getChild(i).getChild(0).getText().equals("*")) {
101			rightVariables.add(getChild(i).getChild(0).getChild(1).getText());
102			rightCoefficients.add(-Integer.parseInt(getChild(i).getChild(0).getChild(0).getText()));
103			} else {
104			long coefficient = getChild(i).getChild(0).getText().equals("INF") ? Integer.MAX_VALUE - 1 : Integer.parseInt(getChild(i).getChild(0).getText());
105			if (getChild(i).getChildCount() > 0) {
106			coefficient = getChild(i).getChild(0).getText().equals("-") ? -coefficient : coefficient;
107			}
108			absoluteValue -= coefficient;
109			}
110			}
111			}
112			}
113
114			public boolean isBinary() {
115			return rightVariables.size() == 1 && absoluteValue == 0 && rightVariables.get(0) != null;
116			}
117
118			/**
119			* @return the constraintType
120			*/
121			public DDLNumericParameterConstraintType getNumericConstraintType() {
122			return constraintType;
123			}
124
125			/**
126			* @return the leftTerm
127			*/
128			public String getLeftTerm() {
129			return leftTerm;
130			}
131
132			/**
133			* @return the leftCoefficient
134			*/
135			public long getLeftCoefficient() {
136			return leftCoefficient;
137			}
138
139			/**
140			* @return the rightVariables
141			*/
142			public List<String> getRightVariables() {
143			return Collections.unmodifiableList(rightVariables);
144			}
145
146			/**
147			* @return the rightCoefficients
148			*/
149			public List<Integer> getRightCoefficients() {
150			return Collections.unmodifiableList(rightCoefficients);
151			}
152
153			// public int getAbsoluteValue() {
154			// return absoluteValue;
155			// }
156
157			public enum DDLNumericParameterConstraintType {
158
159			EQ, LT, GT, LE, GE, NEQ;
160			}
161			}
162

pstlab / PLATINUm

parse() F last analyzed 2025-11-26 17:38 UTC

Complexity

Size

Duplication

Importance

How to fix Long Method Complexity

Long Method

Complexity

Duplication Side-by-Side

Filter issues like

parse() F
last analyzed 2025-11-26 17:38 UTC