Skip to content

Commit bb9eb88

Browse files
committed
Fixed Javadoc
1 parent 9d22757 commit bb9eb88

File tree

1 file changed

+8
-8
lines changed

1 file changed

+8
-8
lines changed

src/main/java/org/logicng/formulas/printer/SortedStringRepresentation.java

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -47,8 +47,8 @@
4747
* - If all variables of the ordering have been in both f1 and f2, the two formulas can be ordered arbitrarily.
4848
* <p>
4949
* 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 &amp; d &amp; ~a &amp; ~c
51+
* would be ~a &amp; b &amp; ~c &amp; d.
5252
* <p>
5353
* It is important to note that the first variable that appear in only one of the compared sub-formulas decides their
5454
* ordering. Hence, apart from the deciding variable, the other variables of the sub-formulas might suggest a different
@@ -57,19 +57,19 @@
5757
* <p>
5858
* Example 2:
5959
* 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 &lt;=&gt; a | e | f would be a | e | f &lt;=&gt; b | c | d.
6161
* <p>
6262
* Furthermore, the fact that implications cannot be ordered should also be kept in mind.
6363
* <p>
6464
* 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 =&gt; a stays b =&gt; a.
6666
* <p>
6767
* Finally, the user should be aware that any variables of a formula that do not appear in the given ordering will be
6868
* sorted after the variables that do appear in the ordering.
6969
* <p>
7070
* 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 &amp; (c | (d =&gt; b)) would be
72+
* ((d =&gt; b) | c) &amp; a.
7373
*
7474
* @version 1.5.0
7575
* @since 1.5.0
@@ -244,9 +244,9 @@ protected FormulaComparator(final List<Variable> varOrder) {
244244
*
245245
* @param formula1 the first formula
246246
* @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 &lt; formula2 (when for the first time a variable of the ordering appears in formula1 but not formula2)
248248
* 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 &gt; formula2 (when for the first time a variable of the ordering appears in formula2 but not formula1)
250250
*/
251251
@Override
252252
public int compare(final Formula formula1, final Formula formula2) {

0 commit comments

Comments
 (0)