#18 <tt>...</tt> to {@code ...}.

Author: dhendriks

src/main/java/com/github/javabdd/BDD.java

@@ -456,7 +456,7 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDDVarSet support();
 
     /**
-     * Returns the result of applying the binary operator <tt>opr</tt> to the two BDDs.
+     * Returns the result of applying the binary operator {@code opr} to the two BDDs.
      *
      * <p>
      * Compare to bdd_apply.
@@ -469,7 +469,7 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDD apply(BDD that, BDDFactory.BDDOp opr);
 
     /**
-     * Makes this BDD be the result of the binary operator <tt>opr</tt> of two BDDs. The "that" BDD is consumed, and can
+     * Makes this BDD be the result of the binary operator {@code opr} of two BDDs. The "that" BDD is consumed, and can
      * no longer be used. Attempting to use the passed in BDD again will result in an exception being thrown.
      *
      * <p>
@@ -482,8 +482,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDD applyWith(BDD that, BDDFactory.BDDOp opr);
 
     /**
-     * Applies the binary operator <tt>opr</tt> to two BDDs and then performs a universal quantification of the
-     * variables from the variable set <tt>var</tt>.
+     * Applies the binary operator {@code opr} to two BDDs and then performs a universal quantification of the
+     * variables from the variable set {@code var}.
      *
      * <p>
      * Compare to bdd_appall.
@@ -498,8 +498,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDD applyAll(BDD that, BDDFactory.BDDOp opr, BDDVarSet var);
 
     /**
-     * Applies the binary operator <tt>opr</tt> to two BDDs and then performs an existential quantification of the
-     * variables from the variable set <tt>var</tt>.
+     * Applies the binary operator {@code opr} to two BDDs and then performs an existential quantification of the
+     * variables from the variable set {@code var}.
      *
      * <p>
      * Compare to bdd_appex.
@@ -514,8 +514,8 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDD applyEx(BDD that, BDDFactory.BDDOp opr, BDDVarSet var);
 
     /**
-     * Applies the binary operator <tt>opr</tt> to two BDDs and then performs a unique quantification of the variables
-     * from the variable set <tt>var</tt>.
+     * Applies the binary operator {@code opr} to two BDDs and then performs a unique quantification of the variables
+     * from the variable set {@code var}.
      *
      * <p>
      * Compare to bdd_appuni.
@@ -554,9 +554,9 @@ public BDD relprod(BDD that, BDDVarSet var) {
     public abstract BDD fullSatOne();
 
     /**
-     * Finds one satisfying variable assignment. Finds a minterm in this BDD. The <tt>var</tt> argument is a set of
+     * Finds one satisfying variable assignment. Finds a minterm in this BDD. The {@code var} argument is a set of
      * variables that must be mentioned in the result. The polarity of these variables in the result - in case they are
-     * undefined in this BDD - are defined by the <tt>pol</tt> parameter. If <tt>pol</tt> is false, then all variables
+     * undefined in this BDD - are defined by the {@code pol} parameter. If {@code pol} is false, then all variables
      * will be in negative form. Otherwise they will be in positive form.
      *
      * <p>
@@ -723,7 +723,7 @@ public void remove() {
     }
 
     /**
-     * Finds one satisfying assignment of the domain <tt>d</tt> in this BDD and returns that value.
+     * Finds one satisfying assignment of the domain {@code d} in this BDD and returns that value.
      *
      * <p>
      * Compare to fdd_scanvar.
@@ -818,7 +818,7 @@ public BigInteger[] scanAllVar() {
 
     /**
      * Returns an iteration of the satisfying assignments of this BDD. Returns an iteration of minterms. The
-     * <tt>var</tt> argument is the set of variables that will be mentioned in the result.
+     * {@code var} argument is the set of variables that will be mentioned in the result.
      *
      * @param var set of variables to mention in result
      * @return an iteration of minterms
@@ -1053,7 +1053,7 @@ public void remove() {
         }
 
         /**
-         * Returns true if the given BDD variable number is a dont-care. <tt>var</tt> must be a variable in the
+         * Returns true if the given BDD variable number is a dont-care. {@code var} must be a variable in the
          * iteration set.
          *
          * @param var variable number to check
@@ -1116,7 +1116,7 @@ public void fastForward(int[] vars) {
         }
 
         /**
-         * Assuming <tt>d</tt> is a dont-care, skip to the end of the iteration for <tt>d</tt>.
+         * Assuming {@code d} is a dont-care, skip to the end of the iteration for {@code d}.
          *
          * @param d BDD domain to fast-forward past
          */

src/main/java/com/github/javabdd/BDDDomain.java

@@ -17,7 +17,7 @@
  * </p>
  *
  * <p>
- * Use <tt>BDDFactory.extDomain()</tt> to create one or more domains with a specified list of sizes.
+ * Use {@code BDDFactory.extDomain()} to create one or more domains with a specified list of sizes.
  * </p>
  *
  * @see com.github.javabdd.BDDFactory#extDomain(int[])

src/main/java/com/github/javabdd/BDDFactory.java

@@ -266,7 +266,7 @@ public BDD buildCube(int value, int[] variables) {
     }
 
     /**
-     * Builds a BDD variable set from an integer array. The integer array <tt>varset</tt> holds the variable numbers.
+     * Builds a BDD variable set from an integer array. The integer array {@code varset} holds the variable numbers.
      * The BDD variable set is represented by a conjunction of all the variables in their positive form.
      *
      * <p>
@@ -380,7 +380,7 @@ public void reset() {
 
     /**
      * Set factor by which to increase node table after a garbage collection. The amount of growth is still limited by
-     * <tt>setMaxIncrease()</tt>.
+     * {@code setMaxIncrease()}.
      *
      * @param x factor by which to increase node table after GC
      * @return old value
@@ -459,7 +459,7 @@ public int extVarNum(int num) {
 
     /**
      * Returns a BDD representing the I'th variable. (One node with the children true and false.) The requested variable
-     * must be in the (zero-indexed) range defined by <tt>setVarNum</tt>.
+     * must be in the (zero-indexed) range defined by {@code setVarNum}.
      *
      * <p>
      * Compare to bdd_ithvar.
@@ -472,7 +472,7 @@ public int extVarNum(int num) {
 
     /**
      * Returns a BDD representing the negation of the I'th variable. (One node with the children false and true.) The
-     * requested variable must be in the (zero-indexed) range defined by <tt>setVarNum</tt>.
+     * requested variable must be in the (zero-indexed) range defined by {@code setVarNum}.
      *
      * <p>
      * Compare to bdd_nithvar.
@@ -1731,7 +1731,7 @@ public BDDDomain getDomain(int i) {
     // TODO: fdd_file_hook, fdd_strm_hook
 
     /**
-     * Creates a variable ordering from a string. The resulting order can be passed into <tt>setVarOrder()</tt>.
+     * Creates a variable ordering from a string. The resulting order can be passed into {@code setVarOrder()}.
      * Example: in the order "A_BxC_DxExF", the bits for A are first, followed by the bits for B and C interleaved,
      * followed by the bits for D, E, and F interleaved.
      *

src/main/java/com/github/javabdd/BDDVarSet.java

@@ -5,8 +5,8 @@
 package com.github.javabdd;
 
 /**
- * Some BDD methods, namely <tt>exist()</tt>, <tt>forall()</tt>, <tt>unique()</tt>, <tt>relprod()</tt>,
- * <tt>applyAll()</tt>, <tt>applyEx()</tt>, <tt>applyUni()</tt>, and <tt>satCount()</tt> take a BDDVarSet argument.
+ * Some BDD methods, namely {@code exist()}, {@code forall()}, {@code unique()}, {@code relprod()},
+ * {@code applyAll()}, {@code applyEx()}, {@code applyUni()}, and {@code satCount()} take a BDDVarSet argument.
  */
 public abstract class BDDVarSet {
     /**