Javadoc fixes from FreeBSD ports

https://svnweb.freebsd.org/ports?view=revision&revision=501144

apps/i2pcontrol/java/com/thetransactioncompany/jsonrpc2/package-info.java

@@ -13,7 +13,7 @@
  * exception of <i>batching / multicall</i>. This feature is deliberately left
  * out as it tends to confuse users (judging by posts in the JSON-RPC forum).
  *
- * <p>See the <a href="http://www.jsonrpc.org/specification"></a>JSON-RPC 2.0
+ * <p>See the <a href="http://www.jsonrpc.org/specification">JSON-RPC 2.0
  * specification</a> for more information or write to the
  * <a href="https://groups.google.com/forum/#!forum/json-rpc">user group</a> if
  * you have questions.

apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java

@@ -32,25 +32,25 @@ import java.security.SecureRandom;
  * call the hashpw method with a random salt, like this:
  * <p>
  * <code>
- * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); <br />
+ * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
  * </code>
  * <p>
  * To check whether a plaintext password matches one that has been
  * hashed previously, use the checkpw method:
  * <p>
  * <code>
- * if (BCrypt.checkpw(candidate_password, stored_hash))<br />
- * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");<br />
- * else<br />
- * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");<br />
+ * if (BCrypt.checkpw(candidate_password, stored_hash))
+ * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");
+ * else
+ * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");
  * </code>
  * <p>
  * The gensalt() method takes an optional parameter (log_rounds)
  * that determines the computational complexity of the hashing:
  * <p>
  * <code>
- * String strong_salt = BCrypt.gensalt(10)<br />
- * String stronger_salt = BCrypt.gensalt(12)<br />
+ * String strong_salt = BCrypt.gensalt(10)
+ * String stronger_salt = BCrypt.gensalt(12)
  * </code>
  * <p>
  * The amount of work increases exponentially (2**log_rounds), so