See the JSON-RPC 2.0 * specification for more information or write to the * user group if * you have questions. diff --git a/apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java b/apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java index 9e1effdf98..a13c6ad89a 100644 --- a/apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java +++ b/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: *
*
- * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
*
+ * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
*
* To check whether a plaintext password matches one that has been * hashed previously, use the checkpw method: *
*
- * if (BCrypt.checkpw(candidate_password, stored_hash))
*
- * System.out.println("It matches");
- * else
- * System.out.println("It does not match");
+ * if (BCrypt.checkpw(candidate_password, stored_hash))
+ * System.out.println("It matches");
+ * else
+ * System.out.println("It does not match");
*
* The gensalt() method takes an optional parameter (log_rounds) * that determines the computational complexity of the hashing: *
*
- * String strong_salt = BCrypt.gensalt(10)
*
- * String stronger_salt = BCrypt.gensalt(12)
+ * String strong_salt = BCrypt.gensalt(10)
+ * String stronger_salt = BCrypt.gensalt(12)
*
* The amount of work increases exponentially (2**log_rounds), so