|
47 | 47 | * - If all variables of the ordering have been in both f1 and f2, the two formulas can be ordered arbitrarily.
|
48 | 48 | * <p>
|
49 | 49 | * Example 1:
|
50 |
| - * Given the variable ordering [a, b, c, d], the sorted string representation for a simple conjunction b & d & ~a & ~c |
51 |
| - * would be ~a & b & ~c & d. |
| 50 | + * Given the variable ordering [a, b, c, d], the sorted string representation for a simple conjunction b & d & ~a & ~c |
| 51 | + * would be ~a & b & ~c & d. |
52 | 52 | * <p>
|
53 | 53 | * It is important to note that the first variable that appear in only one of the compared sub-formulas decides their
|
54 | 54 | * ordering. Hence, apart from the deciding variable, the other variables of the sub-formulas might suggest a different
|
|
57 | 57 | * <p>
|
58 | 58 | * Example 2:
|
59 | 59 | * Given the variable ordering [a, b, c, d, e, f], the sorted string representation for the formula
|
60 |
| - * b | c | d <=> a | e | f would be a | e | f <=> b | c | d. |
| 60 | + * b | c | d <=> a | e | f would be a | e | f <=> b | c | d. |
61 | 61 | * <p>
|
62 | 62 | * Furthermore, the fact that implications cannot be ordered should also be kept in mind.
|
63 | 63 | * <p>
|
64 | 64 | * Example 3:
|
65 |
| - * Given the variable ordering [a, b], the sorted string representation for the formula b => a stays b => a. |
| 65 | + * Given the variable ordering [a, b], the sorted string representation for the formula b => a stays b => a. |
66 | 66 | * <p>
|
67 | 67 | * Finally, the user should be aware that any variables of a formula that do not appear in the given ordering will be
|
68 | 68 | * sorted after the variables that do appear in the ordering.
|
69 | 69 | * <p>
|
70 | 70 | * Example 4:
|
71 |
| - * Given the variable ordering [b, c, d], the sorted string representation for the formula a & (c | (d => b)) would be |
72 |
| - * ((d => b) | c) & a. |
| 71 | + * Given the variable ordering [b, c, d], the sorted string representation for the formula a & (c | (d => b)) would be |
| 72 | + * ((d => b) | c) & a. |
73 | 73 | *
|
74 | 74 | * @version 1.5.0
|
75 | 75 | * @since 1.5.0
|
@@ -244,9 +244,9 @@ protected FormulaComparator(final List<Variable> varOrder) {
|
244 | 244 | *
|
245 | 245 | * @param formula1 the first formula
|
246 | 246 | * @param formula2 the second formula
|
247 |
| - * @return -1 iff formula1 < formula2 (when for the first time a variable of the ordering appears in formula1 but not formula2) |
| 247 | + * @return -1 iff formula1 < formula2 (when for the first time a variable of the ordering appears in formula1 but not formula2) |
248 | 248 | * 0 iff formula1 = formula2 (when all variables of the ordering appear (or not appear) in both formula1 and formula2)
|
249 |
| - * 1 iff formula1 > formula2 (when for the first time a variable of the ordering appears in formula2 but not formula1) |
| 249 | + * 1 iff formula1 > formula2 (when for the first time a variable of the ordering appears in formula2 but not formula1) |
250 | 250 | */
|
251 | 251 | @Override
|
252 | 252 | public int compare(final Formula formula1, final Formula formula2) {
|
|
0 commit comments