diff --git a/prism/src/explicit/Model.java b/prism/src/explicit/Model.java index 8a420a52..79626f87 100644 --- a/prism/src/explicit/Model.java +++ b/prism/src/explicit/Model.java @@ -164,7 +164,7 @@ public interface Model * Find all deadlock states and store this information in the model. * If requested (if fix=true) and if needed (i.e. for DTMCs/CTMCs), * fix deadlocks by adding self-loops in these states. - * The set of deadlocks (before any possible fixing) can be obtained from {@link #getDeadlocks()}. + * The set of deadlocks (before any possible fixing) can be obtained from {@link #getDeadlockStates()}. * @throws PrismException if the model is unable to fix deadlocks because it is non-mutable. */ public void findDeadlocks(boolean fix) throws PrismException; diff --git a/prism/src/jdd/JDD.java b/prism/src/jdd/JDD.java index b3e114ca..e2284547 100644 --- a/prism/src/jdd/JDD.java +++ b/prism/src/jdd/JDD.java @@ -473,7 +473,7 @@ public class JDD // wrapper methods for dd_vars /** - * permute (->) variables in dd (cf. swap) + * permute (->) variables in dd (cf. swap) *
[ REFS: result, DEREFS: dd ] */ public static JDDNode PermuteVariables(JDDNode dd, JDDVars old_vars, JDDVars new_vars) @@ -484,7 +484,7 @@ public class JDD } /** - * swap (<->) variables in dd (cf. permute) + * swap (<->) variables in dd (cf. permute) *
[ REFS: result, DEREFS: dd ] */ public static JDDNode SwapVariables(JDDNode dd, JDDVars old_vars, JDDVars new_vars) @@ -495,7 +495,7 @@ public class JDD } /** - * build x > y for variables x, y + * build x > y for variables x, y *
[ REFS: result, DEREFS: none ] */ public static JDDNode VariablesGreaterThan(JDDVars x_vars, JDDVars y_vars) @@ -504,7 +504,7 @@ public class JDD } /** - * build x >= y for variables x, y + * build x >= y for variables x, y *
[ REFS: result, DEREFS: none ] */ public static JDDNode VariablesGreaterThanEquals(JDDVars x_vars, JDDVars y_vars) @@ -513,7 +513,7 @@ public class JDD } /** - * build x < y for variables x, y + * build x < y for variables x, y *
[ REFS: result, DEREFS: none ] */ public static JDDNode VariablesLessThan(JDDVars x_vars, JDDVars y_vars) @@ -522,7 +522,7 @@ public class JDD } /** - * build x <= y for variables x, y + * build x <= y for variables x, y *
[ REFS: result, DEREFS: none ] */ public static JDDNode VariablesLessThanEquals(JDDVars x_vars, JDDVars y_vars) @@ -715,7 +715,7 @@ public class JDD /** * returns dd restricted to first non-zero path (cube) - *
[ REFS: result, DEREFS:
] + *
[ REFS: result, DEREFS: dd ] */ public static JDDNode RestrictToFirst(JDDNode dd, JDDVars vars) { @@ -941,7 +941,7 @@ public class JDD /** * sets element in vector dd - *
[ REFS: result, DEREFS:
] + *
[ REFS: result, DEREFS: dd ] */ public static JDDNode SetVectorElement(JDDNode dd, JDDVars vars, long index, double value) { @@ -952,7 +952,7 @@ public class JDD /** * sets element in matrix dd - *
[ REFS: result, DEREFS:
] + *
[ REFS: result, DEREFS: dd ] */ public static JDDNode SetMatrixElement(JDDNode dd, JDDVars rvars, JDDVars cvars, long rindex, long cindex, double value) { @@ -963,7 +963,7 @@ public class JDD /** * sets element in 3d matrix dd - *
[ REFS: result, DEREFS:
] + *
[ REFS: result, DEREFS: dd ] */ public static JDDNode Set3DMatrixElement(JDDNode dd, JDDVars rvars, JDDVars cvars, JDDVars lvars, long rindex, long cindex, long lindex, double value) { @@ -992,7 +992,7 @@ public class JDD /** * returns transpose of matrix dd - *
[ REFS: result, DEREFS:
] + *
[ REFS: result, DEREFS: dd ] */ public static JDDNode Transpose(JDDNode dd, JDDVars rvars, JDDVars cvars) { @@ -1003,7 +1003,7 @@ public class JDD /** * returns matrix multiplication of matrices dd1 and dd2 - *
[ REFS: result, DEREFS: ] + *
[ REFS: result, DEREFS: dd1, dd2 ] */ public static JDDNode MatrixMultiply(JDDNode dd1, JDDNode dd2, JDDVars vars, int method) { @@ -1144,10 +1144,10 @@ public class JDD * For example, for a model with the variable * x : [0..2]; * and transitions - * [a] (x=0) -> 0.3:(x'=1) + 0.7:(x'=2); - * [b] (x=0) -> 1:(x'=2); - * [a] (x=2) -> (x'=1); - * [a] (x=1) -> (x'=0); + * [a] (x=0) -> 0.3:(x'=1) + 0.7:(x'=2); + * [b] (x=0) -> 1:(x'=2); + * [a] (x=2) -> (x'=1); + * [a] (x=1) -> (x'=0); * the output would be (e.g.) * 4 * 4 diff --git a/prism/src/parser/ast/ExpressionProb.java b/prism/src/parser/ast/ExpressionProb.java index 104658f3..acc836d1 100644 --- a/prism/src/parser/ast/ExpressionProb.java +++ b/prism/src/parser/ast/ExpressionProb.java @@ -69,7 +69,7 @@ public class ExpressionProb extends ExpressionQuant } /** - * Get a string describing the type of P operator, e.g. "P=?" or "P=". + * Set the attached relational operator (e.g. "<" in "P<0.1"). + * The operator is passed as a string, e.g. "<" or ">=". */ public void setRelOp(String relOpString) { @@ -77,7 +77,7 @@ public abstract class ExpressionQuant extends Expression } /** - * Set the attached bound, as an expression (e.g. "p" in "P> and [[.]] operators, i.e. quantification over strategies + * Class to represent ATL <<.>> and [[.]] operators, i.e. quantification over strategies * ("there exists a strategy" or "for all strategies"). */ public class ExpressionStrategy extends Expression @@ -94,7 +94,7 @@ public class ExpressionStrategy extends Expression } /** - * Get a string ""<<>>"" or "[[]]" indicating type of quantification. + * Get a string ""<<>>"" or "[[]]" indicating type of quantification. */ public String getOperatorString() { diff --git a/prism/src/parser/ast/ExpressionTemporal.java b/prism/src/parser/ast/ExpressionTemporal.java index 909a1efe..476c1cce 100644 --- a/prism/src/parser/ast/ExpressionTemporal.java +++ b/prism/src/parser/ast/ExpressionTemporal.java @@ -91,7 +91,7 @@ public class ExpressionTemporal extends Expression } /** - * Set lower time bound to be of form >= e + * Set lower time bound to be of form >= e * (null denotes no lower bound, i.e. zero) */ public void setLowerBound(Expression e) @@ -100,7 +100,7 @@ public class ExpressionTemporal extends Expression } /** - * Set lower time bound to be of form >= e or > e + * Set lower time bound to be of form >= e or > e * (null denotes no lower bound, i.e. zero) */ public void setLowerBound(Expression e, boolean strict) @@ -110,7 +110,7 @@ public class ExpressionTemporal extends Expression } /** - * Set upper time bound to be of form <= e + * Set upper time bound to be of form <= e * (null denotes no upper bound, i.e. infinity) */ public void setUpperBound(Expression e) @@ -119,7 +119,7 @@ public class ExpressionTemporal extends Expression } /** - * Set upper time bound to be of form <= e or < e + * Set upper time bound to be of form <= e or < e * (null denotes no upper bound, i.e. infinity) */ public void setUpperBound(Expression e, boolean strict) diff --git a/prism/src/parser/ast/RelOp.java b/prism/src/parser/ast/RelOp.java index 4608e38c..4cf5100e 100644 --- a/prism/src/parser/ast/RelOp.java +++ b/prism/src/parser/ast/RelOp.java @@ -31,7 +31,7 @@ public enum RelOp { } /** - * Returns true if this corresponds to a lower bound (i.e. >, >=). + * Returns true if this corresponds to a lower bound (i.e. >, >=). * NB: "min=?" does not return true for this. */ public boolean isLowerBound() @@ -46,7 +46,7 @@ public enum RelOp { } /** - * Returns true if this corresponds to an upper bound (i.e. <, <=). + * Returns true if this corresponds to an upper bound (i.e. <, <=). * NB: "max=?" does not return true for this. */ public boolean isUpperBound() @@ -61,7 +61,7 @@ public enum RelOp { } /** - * Returns true if this is a strict bound (i.e. < or >). + * Returns true if this is a strict bound (i.e. < or >). */ public boolean isStrict() { @@ -102,7 +102,7 @@ public enum RelOp { /** * Returns the RelOp object corresponding to a (string) symbol, - * e.g. parseSymbol("<=") returns RelOp.LEQ. Returns null if invalid. + * e.g. parseSymbol("<=") returns RelOp.LEQ. Returns null if invalid. * @param symbol The symbol to look up * @return */ diff --git a/prism/src/parser/ast/Update.java b/prism/src/parser/ast/Update.java index 2e31cfc4..a3f0eff6 100644 --- a/prism/src/parser/ast/Update.java +++ b/prism/src/parser/ast/Update.java @@ -35,7 +35,7 @@ import prism.PrismLangException; /** * Class to store a single update, i.e. a mapping from variables to expressions. - * e.g. (s'=1)&(x'=x+1) + * e.g. (s'=1)&(x'=x+1) */ public class Update extends ASTElement { diff --git a/prism/src/parser/ast/Updates.java b/prism/src/parser/ast/Updates.java index 9de5e19c..ef924210 100644 --- a/prism/src/parser/ast/Updates.java +++ b/prism/src/parser/ast/Updates.java @@ -34,7 +34,7 @@ import prism.PrismLangException; /** * Class to store a list of updates with associated probabilities (or rates). - * e.g. 0.5:(s'=1)&(x'=x+1) + 0.5:(s'=2)&(x'=x-1) + * e.g. 0.5:(s'=1)&(x'=x+1) + 0.5:(s'=2)&(x'=x-1) */ public class Updates extends ASTElement { diff --git a/prism/src/prism/DA.java b/prism/src/prism/DA.java index de816f67..7bd0ff80 100644 --- a/prism/src/prism/DA.java +++ b/prism/src/prism/DA.java @@ -244,7 +244,7 @@ public class DA /** * Switch the acceptance condition. This may change the acceptance type, - * i.e., a DA may become a DA + * i.e., a DA<BitSet, AcceptanceRabin> may become a DA<BitSet, AcceptanceStreett> * @param da the automaton * @param newAcceptance the new acceptance condition */ diff --git a/prism/src/prism/IntegerBound.java b/prism/src/prism/IntegerBound.java index cb307acc..8640bc05 100644 --- a/prism/src/prism/IntegerBound.java +++ b/prism/src/prism/IntegerBound.java @@ -41,9 +41,9 @@ public class IntegerBound /** Create new bounds. * @param lower: The lower bound, {@code null} represents "no lower bound" - * @param lower_strict: Is the lower bound strict (> lower) or non-strict (>= lower) + * @param lower_strict: Is the lower bound strict (> lower) or non-strict (>= lower) * @param upper: The upper bound, {@code null} represents "no upper bound" - * @param upper_strict: Is the upper bound strict (< upper) or non-strict (<= upper) + * @param upper_strict: Is the upper bound strict (< upper) or non-strict (<= upper) */ public IntegerBound(Integer lower, boolean lower_strict, Integer upper, boolean upper_strict) { @@ -86,7 +86,7 @@ public class IntegerBound * If {@code check} is {@code true}, throws an exception for negative or empty bounds. * * @param expression the expression - * @param values the values for constants (may be {@code null}) + * @param constantValues the values for constants (may be {@code null}) * @param check check for non-negative bounds / non-emptiness? * @return the {@code IntegerBound} for the expression * @throws PrismException @@ -181,7 +181,7 @@ public class IntegerBound } /** Get the maximal interesting value, i.e., the value v such that - * for _all_ i>=v either isInBound(i)=true or isInBound(i)=false */ + * for _all_ i>=v either isInBound(i)=true or isInBound(i)=false */ public int getMaximalInterestingValue() { int max = 0; diff --git a/prism/src/prism/LTL2DA.java b/prism/src/prism/LTL2DA.java index a985be25..11680d4f 100644 --- a/prism/src/prism/LTL2DA.java +++ b/prism/src/prism/LTL2DA.java @@ -64,7 +64,7 @@ public class LTL2DA extends PrismComponent * The LTL formula is represented as a PRISM Expression, * in which atomic propositions are represented by ExpressionLabel objects. * @param ltl the formula - * @param constantValues the values of constants, may be {@code null} + * @param constants the values of constants, may be {@code null} * @param allowedAcceptance the AcceptanceTypes that are allowed to be returned */ public DA convertLTLFormulaToDA(Expression ltl, Values constants, AcceptanceType... allowedAcceptance) throws PrismException diff --git a/prism/src/prism/LTL2RabinLibrary.java b/prism/src/prism/LTL2RabinLibrary.java index 8a587531..1ce216f2 100644 --- a/prism/src/prism/LTL2RabinLibrary.java +++ b/prism/src/prism/LTL2RabinLibrary.java @@ -76,7 +76,7 @@ public class LTL2RabinLibrary * constructions {@code constructDRAFor....} * * Return {@code null} if the automaton can not be constructed using the library. - *
The LTL formula is represented as a PRISM Expression, + *
The LTL formula is represented as a PRISM Expression, * in which atomic propositions are represented by ExpressionLabel objects. * @param ltl the LTL formula * @param constants values for constants in the formula (may be {@code null}) @@ -136,7 +136,7 @@ public class LTL2RabinLibrary } /** - * Construct a prism.DA for the given until formula. + * Construct a prism.DA<BitSet,AcceptanceRabin> for the given until formula. * The expression is expected to have the form a U b, where * a and b are either ExpressionLabels or true/false. * The operator can have integer bounds. diff --git a/prism/src/prism/LTLModelChecker.java b/prism/src/prism/LTLModelChecker.java index 38799a60..2b3e0e9d 100644 --- a/prism/src/prism/LTLModelChecker.java +++ b/prism/src/prism/LTLModelChecker.java @@ -165,7 +165,7 @@ public class LTLModelChecker extends PrismComponent /** * Construct the product of a DA and a DTMC/CTMC. - * @param dra The DA + * @param da The DA * @param model The DTMC/CTMC * @param labelDDs BDDs giving the set of states for each AP in the DA * @param daDDRowVarsCopy (Optionally) empty JDDVars object to obtain copy of DD row vars for DA diff --git a/prism/src/prism/MultiObjModelChecker.java b/prism/src/prism/MultiObjModelChecker.java index 49b598fa..6c9f3c33 100644 --- a/prism/src/prism/MultiObjModelChecker.java +++ b/prism/src/prism/MultiObjModelChecker.java @@ -113,7 +113,7 @@ public class MultiObjModelChecker extends PrismComponent * * @param modelProduct * @param rewardsIndex - * @param relOpsReward + * @param opsAndBounds * @return True if some transitions were removed */ protected boolean removeNonZeroRewardTrans(NondetModel modelProduct, List rewardsIndex, OpsAndBoundsList opsAndBounds) diff --git a/prism/src/prism/MultiObjUtils.java b/prism/src/prism/MultiObjUtils.java index 37a266b2..77d5e7c1 100644 --- a/prism/src/prism/MultiObjUtils.java +++ b/prism/src/prism/MultiObjUtils.java @@ -49,7 +49,6 @@ public class MultiObjUtils * * @param point A point which should be at one direction from the separating hyperplane. * @param computedPoints Set of points which should be at the other direction from the separating hyperplane. - * @param tolerance * @return A vector orthogonal to the computed separating hyperplane. * @throws PrismException When the LP solver throws an exception or returns an unexpected result, an exception with a related message is thrown. */ @@ -249,11 +248,11 @@ public class MultiObjUtils * This method takes a list of computed points together with their associated directions, where points are possibly * repeated, and returns a map in which to each point from {@code computedPoints} corresponds the associated direction * from {@code directions} which has the most extreme slope. Which extreme is taken depends on the {@code horiz} parameter. - *

- * Note that this method considers two points as "equal" if the method {@link #isCloseTo(Point)} returns {@code true}. + *
+ * Note that this method considers two points as "equal" if the method {@code isCloseTo(Point)} returns {@code true}. * So the returned map will not contain two keys which are too close to each other, which should be fine w.r.t. roundoff * errors, but might theoretically cause trouble if the corner points of the Pareto curve are very close to each other. - *

+ *
* It is guaranteed that if there are two points {@code p1} and {@code p2} in {@code computedPoints} such that * {@code p1.isCloseTo{p2}} is {@code true} and {@code p1} occurs in {@code computedPoints} before * {@code p2}, then {@code p1} will be given precedence when picking a representative for the key in the map. This is crucial @@ -291,7 +290,7 @@ public class MultiObjUtils /** * This method takes a list of points and returns a sub-list in which points that are very close to - * each other (where {@link #isCloseTo(Point)} is used to determine what is "very close") are removed. + * each other (where {@code isCloseTo(Point)} is used to determine what is "very close") are removed. * The order of elements is preserved. * * It is guaranteed that if there are two points {@code p1} and {@code p2} in {@code list} such that @@ -328,7 +327,7 @@ public class MultiObjUtils /** * This method takes the set of some corner points of a pareto curve {@code computedPoints} together - * with associated orthogonal lines {@directions} that determine current over-approximation, + * with associated orthogonal lines {@code directions} that determine current over-approximation, * and returns the points which determine the over-approximation. (These points are in fact the intersecting * points of the directions which are not covered by other points.) * @param computedPoints Corner points of the Pareto curve diff --git a/prism/src/prism/NativeIntArray.java b/prism/src/prism/NativeIntArray.java index 28106364..fa344ffa 100644 --- a/prism/src/prism/NativeIntArray.java +++ b/prism/src/prism/NativeIntArray.java @@ -83,7 +83,6 @@ public class NativeIntArray /** * Returns the {@code index}-th element of the aray * @param index - * @return * @throws IndexOutOfBoundsException If the index is outside of the bounds of the array */ public int get(int index) throws IndexOutOfBoundsException @@ -96,7 +95,7 @@ public class NativeIntArray /** * Sets the {@code index}-th element of the array to {@code val}. * @param index - * @return + * @param value * @throws IndexOutOfBoundsException If the index is outside of the bounds of the array */ public void set(int index, int value) throws IndexOutOfBoundsException diff --git a/prism/src/prism/Operator.java b/prism/src/prism/Operator.java index f936a673..5e2f27e9 100644 --- a/prism/src/prism/Operator.java +++ b/prism/src/prism/Operator.java @@ -42,8 +42,8 @@ public enum Operator { } /** - * Returns {@code true} if op is one {@link Operator.P_MIN}, - * {@link Operator.R_MIN}, {@link Operator.P_LE}, or {@link Operator.R_LE}. + * Returns {@code true} if op is one {@code Operator.P_MIN}, + * {@code Operator.R_MIN}, {@code Operator.P_LE}, or {@code Operator.R_LE}. */ public static boolean isMinOrLe(Operator op) { diff --git a/prism/src/prism/OpsAndBoundsList.java b/prism/src/prism/OpsAndBoundsList.java index c047b89d..90fd8195 100644 --- a/prism/src/prism/OpsAndBoundsList.java +++ b/prism/src/prism/OpsAndBoundsList.java @@ -35,8 +35,8 @@ import java.util.List; * * The instance keeps an ordered instance of (operator,bound) values. * These are currently held in two separate lists internally. A tuple - * is added using {@link add(Operator,bound)} method, and retrieved using - * {@link getOperator(int)} and {@link getBound(double} methods. + * is added using {@link add(OpRelOpBound, Operator,double,int)} method, and retrieved using + * {@link getOperator(int)} and {@link getBound(int)} methods. * * The class also provides methods for accessing i-th elements in the * subsequence containing only the tuples in which operator is a probabilistic @@ -226,7 +226,7 @@ public class OpsAndBoundsList /** * True if the ith probabilistic objective is negation of what the user required - * (i.e. formula is negated and we use >= instead <= or max instead of min). + * (i.e. formula is negated and we use >= instead <= or max instead of min). * Used to determine what values to display to the user. * @param i * @return @@ -237,7 +237,7 @@ public class OpsAndBoundsList } /** - * Replace min by max and <= by >= in prob. + * Replace min by max and <= by >= in prob. */ //TODO: why not do prob also in main list? public void makeAllProbUp() diff --git a/prism/src/prism/PermutedLexicographicComparator.java b/prism/src/prism/PermutedLexicographicComparator.java index 61ac9314..934db980 100644 --- a/prism/src/prism/PermutedLexicographicComparator.java +++ b/prism/src/prism/PermutedLexicographicComparator.java @@ -32,8 +32,8 @@ import java.util.Comparator; /** * A class that allows to compare points w.r.g. a lexicographic order. * The order of elements is given by the array {@code dimensionPermutation} - * passed in the constructor {@link #PermutedLexicographicComparator(int[])}. - *

+ * passed in the constructor {@link #PermutedLexicographicComparator(int[],boolean[])}. + *
* Note that the comparator is only capable of comparing points with equal * dimension. This probably violates the specification of the {@link Comparator} * class, but it shouldn't be any problem as comparing points of different dimensions diff --git a/prism/src/prism/Prism.java b/prism/src/prism/Prism.java index b83ec76a..0e3aef35 100644 --- a/prism/src/prism/Prism.java +++ b/prism/src/prism/Prism.java @@ -1095,7 +1095,7 @@ public class Prism extends PrismComponent implements PrismSettingsListener /** * Compare two version numbers of PRISM (strings). * Example ordering: { "1", "2.0", "2.1.alpha", "2.1.alpha.r5555", "2.1.alpha.r5557", "2.1.beta", "2.1.beta4", "2.1", "2.1.dev", "2.1.dev.r6666", "2.1.dev1", "2.1.dev2", "2.1.2", "2.9", "3", "3.4"}; - * Returns: 1 if v1>v2, -1 if v1 + *
* Also increases {@link #numberOfWarnings} by one. This variable can then be * queried using {@link #getNumberOfWarnings()} at the end of computation * and the user can be appropriately informed that there were warnings generated. diff --git a/prism/src/prism/PrismUtils.java b/prism/src/prism/PrismUtils.java index e9ed9360..0326db64 100644 --- a/prism/src/prism/PrismUtils.java +++ b/prism/src/prism/PrismUtils.java @@ -203,7 +203,7 @@ public class PrismUtils } /** - * Format a double, as would be done by printf's %.g + * Format a double, as would be done by printf's %.(prec)g */ public static String formatDouble(int prec, double d) { @@ -214,7 +214,7 @@ public class PrismUtils /** * Create a string for a list of objects, with a specified separator, - * e.g. ["a","b","c"], "," -> "a,b,c" + * e.g. ["a","b","c"], "," -> "a,b,c" */ public static String joinString(List objs, String separator) { @@ -233,7 +233,7 @@ public class PrismUtils /** * Create a string for an array of objects, with a specified separator, - * e.g. ["a","b","c"], "," -> "a,b,c" + * e.g. ["a","b","c"], "," -> "a,b,c" */ public static String joinString(Object[] objs, String separator) { diff --git a/prism/src/prism/StateValuesMTBDD.java b/prism/src/prism/StateValuesMTBDD.java index 44761232..fd9eaf98 100644 --- a/prism/src/prism/StateValuesMTBDD.java +++ b/prism/src/prism/StateValuesMTBDD.java @@ -429,7 +429,6 @@ public class StateValuesMTBDD implements StateValues /** * Sum up the elements of the vector, over a subset of its DD vars * store the result in a new StateValues (for newModel) - * @throws PrismException (on out-of-memory) */ public StateValues sumOverDDVars(JDDVars sumVars, Model newModel) { diff --git a/prism/src/prism/Tile.java b/prism/src/prism/Tile.java index d9c33fee..03c71ea8 100644 --- a/prism/src/prism/Tile.java +++ b/prism/src/prism/Tile.java @@ -117,7 +117,7 @@ public class Tile /** * Returns true if this tile will be changed when {@code point} is added - * to a parent {@link TileList}. If {@updateUpperBounds} is set, then also + * to a parent {@link TileList}. If {@code updateUpperBounds} is set, then also * the information about the tile lying on a pareto curve is updated * * @param updateUpperBounds If true, the new point does not split the tile, and diff --git a/prism/src/prism/UndefinedConstants.java b/prism/src/prism/UndefinedConstants.java index 29887631..8179f7fa 100644 --- a/prism/src/prism/UndefinedConstants.java +++ b/prism/src/prism/UndefinedConstants.java @@ -459,7 +459,6 @@ public class UndefinedConstants * @param sl If sh are ss are null, this is the value to be assigned. Otherwise, it is the lower bound for the range. * @param sh The upper bound for the range. * @param ss The step for the values. Null means 1. - * @param useAll If true, throw an exception if {@code name} is does not need to be defined * * @return True if the constant was defined before. */ @@ -659,7 +658,7 @@ public class UndefinedConstants } /** - * Get the number of ranging constants (constants with range > 1) from the model file. + * Get the number of ranging constants (constants with range greater than 1) from the model file. */ public int getNumModelRangingConstants() { @@ -685,7 +684,7 @@ public class UndefinedConstants } /** - * Get the number of ranging constants (constants with range > 1) from the properties file. + * Get the number of ranging constants (constants with range greater than 1) from the properties file. */ public int getNumPropertyRangingConstants() { @@ -706,7 +705,7 @@ public class UndefinedConstants /** * Get a list of DefinedConstant objects: one for each ranging constant, - * i.e. each constant that has range > 1. + * i.e. each constant that has range greater than 1. */ public Vector getRangingConstants() {