mirror of
https://github.com/openjdk/jdk.git
synced 2025-08-28 15:24:43 +02:00
8260596: Comment cleanup in BigInteger
Reviewed-by: bpb
This commit is contained in:
parent
1de3c55447
commit
2b166d816a
1 changed files with 5 additions and 5 deletions
|
@ -465,7 +465,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
||||||
* consists of an optional minus or plus sign followed by a
|
* consists of an optional minus or plus sign followed by a
|
||||||
* sequence of one or more digits in the specified radix. The
|
* sequence of one or more digits in the specified radix. The
|
||||||
* character-to-digit mapping is provided by {@link
|
* character-to-digit mapping is provided by {@link
|
||||||
* Character#digit(char, char) Character.digit}. The String may
|
* Character#digit(char, int) Character.digit}. The String may
|
||||||
* not contain any extraneous characters (whitespace, for
|
* not contain any extraneous characters (whitespace, for
|
||||||
* example).
|
* example).
|
||||||
*
|
*
|
||||||
|
@ -662,7 +662,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
||||||
* into a BigInteger. The String representation consists of an
|
* into a BigInteger. The String representation consists of an
|
||||||
* optional minus or plus sign followed by a sequence of one or
|
* optional minus or plus sign followed by a sequence of one or
|
||||||
* more decimal digits. The character-to-digit mapping is
|
* more decimal digits. The character-to-digit mapping is
|
||||||
* provided by {@link Character#digit(char, char)
|
* provided by {@link Character#digit(char, int)
|
||||||
* Character.digit}. The String may not contain any extraneous
|
* Character.digit}. The String may not contain any extraneous
|
||||||
* characters (whitespace, for example).
|
* characters (whitespace, for example).
|
||||||
*
|
*
|
||||||
|
@ -3974,7 +3974,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
||||||
* If {@code numZeros > 0}, appends that many zeros to the
|
* If {@code numZeros > 0}, appends that many zeros to the
|
||||||
* specified StringBuilder; otherwise, does nothing.
|
* specified StringBuilder; otherwise, does nothing.
|
||||||
*
|
*
|
||||||
* @param sb The StringBuilder that will be appended to.
|
* @param buf The StringBuilder that will be appended to.
|
||||||
* @param numZeros The number of zeros to append.
|
* @param numZeros The number of zeros to append.
|
||||||
*/
|
*/
|
||||||
private static void padWithZeros(StringBuilder buf, int numZeros) {
|
private static void padWithZeros(StringBuilder buf, int numZeros) {
|
||||||
|
@ -3993,7 +3993,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
||||||
* (pre-pending with zeros) will be effected.
|
* (pre-pending with zeros) will be effected.
|
||||||
*
|
*
|
||||||
* @param radix The base to convert to.
|
* @param radix The base to convert to.
|
||||||
* @param sb The StringBuilder that will be appended to in place.
|
* @param buf The StringBuilder that will be appended to in place.
|
||||||
* @param digits The minimum number of digits to pad to.
|
* @param digits The minimum number of digits to pad to.
|
||||||
*/
|
*/
|
||||||
private void smallToString(int radix, StringBuilder buf, int digits) {
|
private void smallToString(int radix, StringBuilder buf, int digits) {
|
||||||
|
@ -4626,7 +4626,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
||||||
* least significant). If the magnitude is zero, return value is undefined.
|
* least significant). If the magnitude is zero, return value is undefined.
|
||||||
*
|
*
|
||||||
* <p>Note: never used for a BigInteger with a magnitude of zero.
|
* <p>Note: never used for a BigInteger with a magnitude of zero.
|
||||||
* @see #getInt.
|
* @see #getInt
|
||||||
*/
|
*/
|
||||||
private int firstNonzeroIntNum() {
|
private int firstNonzeroIntNum() {
|
||||||
int fn = firstNonzeroIntNumPlusTwo - 2;
|
int fn = firstNonzeroIntNumPlusTwo - 2;
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue