Javadoc fixes

Author: str4d

src/net/i2p/crypto/eddsa/math/Encoding.java

@@ -22,7 +22,7 @@ public void setField(Field f) {
     /**
      * Decode a FieldElement from its (b-1)-bit encoding.
      * The highest bit is masked out.
-     * @param val the (b-1)-bit encoding of a FieldElement.
+     * @param in the (b-1)-bit encoding of a FieldElement.
      * @return the FieldElement represented by 'val'.
      */
     public abstract FieldElement decode(byte[] in);
@@ -33,7 +33,7 @@ public void setField(Field f) {
      * than the (b-1)-bit encoding of -x. If q is an odd prime and the encoding
      * is the little-endian representation of {0, 1,..., q-1} then the negative
      * elements of F_q are {1, 3, 5,..., q-2}.
-     * @return
+     * @return true if negative
      */
     public abstract boolean isNegative(FieldElement x);
 }

src/net/i2p/crypto/eddsa/math/GroupElement.java

@@ -489,7 +489,7 @@ GroupElement cmov(GroupElement u, int b) {
      *
      * @param pos = i/2 for i in {0, 2, 4,..., 62}
      * @param b = r_i
-     * @return
+     * @return the GroupElement
      */
     GroupElement select(int pos, int b) {
         // Is r_i negative?
@@ -522,7 +522,7 @@ GroupElement select(int pos, int b) {
      * Preconditions: (TODO: Check this applies here)
      *   a[31] <= 127
      * @param a = a[0]+256*a[1]+...+256^31 a[31]
-     * @return
+     * @return the GroupElement
      */
     public GroupElement scalarMultiply(byte[] a) {
         GroupElement t;
@@ -603,7 +603,7 @@ static byte[] slide(byte[] a) {
      * @param A in P3 representation.
      * @param a = a[0]+256*a[1]+...+256^31 a[31]
      * @param b = b[0]+256*b[1]+...+256^31 b[31]
-     * @return
+     * @return the GroupElement
      */
     public GroupElement doubleScalarMultiplyVariableTime(GroupElement A, byte[] a, byte[] b) {
         byte[] aslide = slide(a);
@@ -645,7 +645,6 @@ public GroupElement doubleScalarMultiplyVariableTime(GroupElement A, byte[] a, b
 
     /**
      * Verify that a point is on its curve.
-     * @param P The point to check.
      * @return true if the point lies on its curve.
      */
     public boolean isOnCurve() {

src/net/i2p/crypto/eddsa/math/bigint/BigIntegerLittleEndianEncoding.java

@@ -65,7 +65,7 @@ public BigInteger toBigInteger(byte[] in) {
      * than the (b-1)-bit encoding of -x. If q is an odd prime and the encoding
      * is the little-endian representation of {0, 1,..., q-1} then the negative
      * elements of F_q are {1, 3, 5,..., q-2}.
-     * @return
+     * @return true if negative
      */
     public boolean isNegative(FieldElement x) {
         return ((BigIntegerFieldElement)x).bi.testBit(0);