@@ -456,7 +456,7 @@ public BDD relprod(BDD that, BDDVarSet var) {
456
456
public abstract BDDVarSet support ();
457
457
458
458
/**
459
- * Returns the result of applying the binary operator <tt> opr</tt> to the two BDDs.
459
+ * Returns the result of applying the binary operator {@code opr} to the two BDDs.
460
460
*
461
461
* <p>
462
462
* Compare to bdd_apply.
@@ -469,7 +469,7 @@ public BDD relprod(BDD that, BDDVarSet var) {
469
469
public abstract BDD apply (BDD that , BDDFactory .BDDOp opr );
470
470
471
471
/**
472
- * Makes this BDD be the result of the binary operator <tt> opr</tt> of two BDDs. The "that" BDD is consumed, and can
472
+ * Makes this BDD be the result of the binary operator {@code opr} of two BDDs. The "that" BDD is consumed, and can
473
473
* no longer be used. Attempting to use the passed in BDD again will result in an exception being thrown.
474
474
*
475
475
* <p>
@@ -482,8 +482,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
482
482
public abstract BDD applyWith (BDD that , BDDFactory .BDDOp opr );
483
483
484
484
/**
485
- * Applies the binary operator <tt> opr</tt> to two BDDs and then performs a universal quantification of the
486
- * variables from the variable set <tt> var</tt> .
485
+ * Applies the binary operator {@code opr} to two BDDs and then performs a universal quantification of the
486
+ * variables from the variable set {@code var} .
487
487
*
488
488
* <p>
489
489
* Compare to bdd_appall.
@@ -498,8 +498,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
498
498
public abstract BDD applyAll (BDD that , BDDFactory .BDDOp opr , BDDVarSet var );
499
499
500
500
/**
501
- * Applies the binary operator <tt> opr</tt> to two BDDs and then performs an existential quantification of the
502
- * variables from the variable set <tt> var</tt> .
501
+ * Applies the binary operator {@code opr} to two BDDs and then performs an existential quantification of the
502
+ * variables from the variable set {@code var} .
503
503
*
504
504
* <p>
505
505
* Compare to bdd_appex.
@@ -514,8 +514,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
514
514
public abstract BDD applyEx (BDD that , BDDFactory .BDDOp opr , BDDVarSet var );
515
515
516
516
/**
517
- * Applies the binary operator <tt> opr</tt> to two BDDs and then performs a unique quantification of the variables
518
- * from the variable set <tt> var</tt> .
517
+ * Applies the binary operator {@code opr} to two BDDs and then performs a unique quantification of the variables
518
+ * from the variable set {@code var} .
519
519
*
520
520
* <p>
521
521
* Compare to bdd_appuni.
@@ -554,9 +554,9 @@ public BDD relprod(BDD that, BDDVarSet var) {
554
554
public abstract BDD fullSatOne ();
555
555
556
556
/**
557
- * Finds one satisfying variable assignment. Finds a minterm in this BDD. The <tt> var</tt> argument is a set of
557
+ * Finds one satisfying variable assignment. Finds a minterm in this BDD. The {@code var} argument is a set of
558
558
* variables that must be mentioned in the result. The polarity of these variables in the result - in case they are
559
- * undefined in this BDD - are defined by the <tt> pol</tt> parameter. If <tt> pol</tt> is false, then all variables
559
+ * undefined in this BDD - are defined by the {@code pol} parameter. If {@code pol} is false, then all variables
560
560
* will be in negative form. Otherwise they will be in positive form.
561
561
*
562
562
* <p>
@@ -723,7 +723,7 @@ public void remove() {
723
723
}
724
724
725
725
/**
726
- * Finds one satisfying assignment of the domain <tt>d</tt> in this BDD and returns that value.
726
+ * Finds one satisfying assignment of the domain {@code d} in this BDD and returns that value.
727
727
*
728
728
* <p>
729
729
* Compare to fdd_scanvar.
@@ -818,7 +818,7 @@ public BigInteger[] scanAllVar() {
818
818
819
819
/**
820
820
* Returns an iteration of the satisfying assignments of this BDD. Returns an iteration of minterms. The
821
- * <tt> var</tt> argument is the set of variables that will be mentioned in the result.
821
+ * {@code var} argument is the set of variables that will be mentioned in the result.
822
822
*
823
823
* @param var set of variables to mention in result
824
824
* @return an iteration of minterms
@@ -1053,7 +1053,7 @@ public void remove() {
1053
1053
}
1054
1054
1055
1055
/**
1056
- * Returns true if the given BDD variable number is a dont-care. <tt> var</tt> must be a variable in the
1056
+ * Returns true if the given BDD variable number is a dont-care. {@code var} must be a variable in the
1057
1057
* iteration set.
1058
1058
*
1059
1059
* @param var variable number to check
@@ -1116,7 +1116,7 @@ public void fastForward(int[] vars) {
1116
1116
}
1117
1117
1118
1118
/**
1119
- * Assuming <tt>d</tt> is a dont-care, skip to the end of the iteration for <tt>d</tt> .
1119
+ * Assuming {@code d} is a dont-care, skip to the end of the iteration for {@code d} .
1120
1120
*
1121
1121
* @param d BDD domain to fast-forward past
1122
1122
*/
0 commit comments