Index: gnu/java/io/decode/Decoder.java =================================================================== RCS file: /cvsroot/classpath/classpath/gnu/java/io/decode/Decoder.java,v retrieving revision 1.5 diff -u -r1.5 Decoder.java --- gnu/java/io/decode/Decoder.java 23 Apr 2004 22:36:45 -0000 1.5 +++ gnu/java/io/decode/Decoder.java 7 May 2004 15:29:47 -0000 @@ -174,7 +174,7 @@ /*************************************************************************/ /** - * This method converts len bytes from a specified array to + * This method converts len bytes from a specified array to * characters starting at index offset into the array. The * results are returned in a newly allocated char array. * Index: gnu/java/io/encode/Encoder.java =================================================================== RCS file: /cvsroot/classpath/classpath/gnu/java/io/encode/Encoder.java,v retrieving revision 1.5 diff -u -r1.5 Encoder.java --- gnu/java/io/encode/Encoder.java 23 Apr 2004 22:36:45 -0000 1.5 +++ gnu/java/io/encode/Encoder.java 7 May 2004 15:29:47 -0000 @@ -195,7 +195,7 @@ /*************************************************************************/ /** - * This method converts len chars from a specified array to + * This method converts len chars from a specified array to * bytes starting at index offset into the array. The * results are returned in a newly allocated byte array. * Index: gnu/java/math/MPN.java =================================================================== RCS file: /cvsroot/classpath/classpath/gnu/java/math/MPN.java,v retrieving revision 1.2 diff -u -r1.2 MPN.java --- gnu/java/math/MPN.java 22 Jan 2002 22:26:57 -0000 1.2 +++ gnu/java/math/MPN.java 7 May 2004 15:29:48 -0000 @@ -1,5 +1,5 @@ /* gnu.java.math.MPN - Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc. + Copyright (C) 1999, 2000, 2001, 2004 Free Software Foundation, Inc. This file is part of GNU Classpath. @@ -482,7 +482,7 @@ } /** Compare x[0:size-1] with y[0:size-1], treating them as unsigned integers. - * @result -1, 0, or 1 depending on if xy. + * @result -1, 0, or 1 depending on if x<y, x==y, or x>y. * This is basically the same as gmp's mpn_cmp function. */ public static int cmp (int[] x, int[] y, int size) @@ -502,22 +502,24 @@ return 0; } - /** Compare x[0:xlen-1] with y[0:ylen-1], treating them as unsigned integers. - * @result -1, 0, or 1 depending on if xy. + /** + * Compare x[0:xlen-1] with y[0:ylen-1], treating them as unsigned integers. + * + * @return -1, 0, or 1 depending on if x<y, x==y, or x>y. */ public static int cmp (int[] x, int xlen, int[] y, int ylen) { return xlen > ylen ? 1 : xlen < ylen ? -1 : cmp (x, y, xlen); } - /* Shift x[x_start:x_start+len-1] count bits to the "right" + /** + * Shift x[x_start:x_start+len-1] count bits to the "right" * (i.e. divide by 2**count). * Store the len least significant words of the result at dest. * The bits shifted out to the right are returned. * OK if dest==x. - * Assumes: 0 < count < 32 + * Assumes: 0 < count < 32 */ - public static int rshift (int[] dest, int[] x, int x_start, int len, int count) { @@ -535,11 +537,12 @@ return retval; } - /* Shift x[x_start:x_start+len-1] count bits to the "right" + /** + * Shift x[x_start:x_start+len-1] count bits to the "right" * (i.e. divide by 2**count). * Store the len least significant words of the result at dest. * OK if dest==x. - * Assumes: 0 <= count < 32 + * Assumes: 0 <= count < 32 * Same as rshift, but handles count==0 (and has no return value). */ public static void rshift0 (int[] dest, int[] x, int x_start, @@ -556,7 +559,7 @@ * @param x a two's-complement "bignum" * @param len the number of significant words in x * @param count the shift count - * @return (long)(x[0..len-1] >> count). + * @return (long)(x[0..len-1] >> count). */ public static long rshift_long (int[] x, int len, int count) { @@ -579,7 +582,7 @@ /* Shift x[0:len-1] left by count bits, and store the len least * significant words of the result in dest[d_offset:d_offset+len-1]. * Return the bits shifted out from the most significant digit. - * Assumes 0 < count < 32. + * Assumes 0 < count < 32. * OK if dest==x. */ @@ -601,7 +604,7 @@ return retval; } - /** Return least i such that word&(1< . + * <compiler name and arguments> <optional destination> <filename>. * This method builds an argument array out that. It should be used * to define computeArguments for those compilers that follow the * argument convention described above. Index: java/awt/geom/Arc2D.java =================================================================== RCS file: /cvsroot/classpath/classpath/java/awt/geom/Arc2D.java,v retrieving revision 1.4 diff -u -r1.4 Arc2D.java --- java/awt/geom/Arc2D.java 17 Sep 2003 19:44:26 -0000 1.4 +++ java/awt/geom/Arc2D.java 7 May 2004 15:29:58 -0000 @@ -50,7 +50,7 @@ * and while the angle can be any value, the path iterator only traverses the * first 360 degrees. Storage is up to the subclasses. * - * @author Eric Blake + * @author Eric Blake (address@hidden) * @since 1.2 * @status updated to 1.4, but still missing functionality */ @@ -527,7 +527,7 @@ * This class is used to iterate over an arc. Since ellipses are a subclass * of arcs, this is used by Ellipse2D as well. * - * @author Eric Blake + * @author Eric Blake (address@hidden) */ static final class ArcIterator implements PathIterator { @@ -766,7 +766,7 @@ /** * This class implements an arc in double precision. * - * @author Eric Blake