marek/i2p.i2p
1
0
Fork 0
forked from I2P_Developers/i2p.i2p
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Javadoc fixes from FreeBSD ports

Browse Source 
https://svnweb.freebsd.org/ports?view=revision&revision=501144
This commit is contained in:
zzz
2019-05-18 14:14:08 +00:00
parent a6e6d29d33
commit 11b391bc35
2 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/i2pcontrol/java/com/thetransactioncompany/jsonrpc2/package-info.java
View File

@ -13,7 +13,7 @@
* exception of <i>batching / multicall</i>. This feature is deliberately left * 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). * 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 * specification</a> for more information or write to the
* <a href="https://groups.google.com/forum/#!forum/json-rpc">user group</a> if * <a href="https://groups.google.com/forum/#!forum/json-rpc">user group</a> if
* you have questions. * you have questions.

14
apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java
View File

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