mirror of
https://github.com/corda/corda.git
synced 2025-01-06 05:04:20 +00:00
112 lines
2.2 KiB
Java
112 lines
2.2 KiB
Java
package java.lang;
|
|
|
|
public final class Long extends Number {
|
|
public static final Class TYPE = Class.forCanonicalName("J");
|
|
|
|
private final long value;
|
|
|
|
public Long(long value) {
|
|
this.value = value;
|
|
}
|
|
|
|
public boolean equals(Object o) {
|
|
return o instanceof Long && ((Long) o).value == value;
|
|
}
|
|
|
|
public int hashCode() {
|
|
return (int) ((value >> 32) ^ (value & 0xFF));
|
|
}
|
|
|
|
public String toString() {
|
|
return String.valueOf(value);
|
|
}
|
|
|
|
public static String toString(long v, int radix) {
|
|
if (radix < 1 || radix > 36) {
|
|
throw new IllegalArgumentException("radix " + radix + " not in [1,36]");
|
|
}
|
|
|
|
if (v == 0) {
|
|
return "0";
|
|
}
|
|
|
|
int size = (v < 0 ? 1 : 0);
|
|
for (long n = v; n > 0; n /= radix) ++size;
|
|
|
|
char[] array = new char[size];
|
|
|
|
int i = array.length - 1;
|
|
for (long n = v; n > 0; n /= radix) {
|
|
long digit = n % radix;
|
|
if (digit >= 0 && digit <= 9) {
|
|
array[i] = (char) ('0' + digit);
|
|
} else {
|
|
array[i] = (char) ('a' + (digit - 10));
|
|
}
|
|
--i;
|
|
}
|
|
|
|
if (v < 0) {
|
|
array[i] = '-';
|
|
}
|
|
|
|
return new String(array);
|
|
}
|
|
|
|
public static String toString(long v) {
|
|
return toString(v, 10);
|
|
}
|
|
|
|
public byte byteValue() {
|
|
return (byte) value;
|
|
}
|
|
|
|
public short shortValue() {
|
|
return (short) value;
|
|
}
|
|
|
|
public int intValue() {
|
|
return (int) value;
|
|
}
|
|
|
|
public long longValue() {
|
|
return value;
|
|
}
|
|
|
|
public float floatValue() {
|
|
return (float) value;
|
|
}
|
|
|
|
public double doubleValue() {
|
|
return (double) value;
|
|
}
|
|
|
|
private static long pow(long a, long b) {
|
|
long c = 1;
|
|
for (int i = 0; i < b; ++i) c *= a;
|
|
return c;
|
|
}
|
|
|
|
public static long parseLong(String s) {
|
|
return parseLong(s, 10);
|
|
}
|
|
|
|
public static long parseLong(String s, int radix) {
|
|
long number = 0;
|
|
|
|
for (int i = 0; i < s.length(); ++i) {
|
|
char c = s.charAt(i);
|
|
if (((c >= '0') && (c <= '9')) ||
|
|
((c >= 'a') && (c <= 'z'))) {
|
|
long digit = ((c >= '0' && c <= '9') ? (c - '0') : (c - 'a' + 10));
|
|
number += digit * pow(radix, (s.length() - i - 1));
|
|
} else {
|
|
throw new NumberFormatException("invalid character " + c + " code " +
|
|
(int) c);
|
|
}
|
|
}
|
|
|
|
return number;
|
|
}
|
|
}
|