Datasets:
JoaoJunior
/
formatted-java-code-APR

Dataset card Data Studio Files
xet
 Community
1
bugged
stringlengths
6
599k
fixed
stringlengths
6
40.8M
__index_level_0__
int64
0
3.24M
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
2,238
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
2,239
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
public static double asin(double x) { boolean negative = x < 0; if (negative) x = -x; if (!(x <= 1)) return Double.NaN; if (x == 1) return negative ? -PI / 2 : PI / 2; if (x < 0.5) { if (x < 1 / TWO_27) return negative ? -x : x; double t = x * x; double p = t * (PS0 + t * (PS1 + t * (PS2 + t * (PS3...
2,240
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,241
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (! (x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x ...
2,242
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (! (x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x ...
2,243
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,244
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,245
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,246
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,247
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
public static double atan(double x) { double lo; double hi; boolean negative = x < 0; if (negative) x = -x; if (x >= TWO_66) return negative ? -PI / 2 : PI / 2; if (!(x >= 0.4375)) // |x|<7/16, or NaN. { if (!(x >= 1 / TWO_29)) // Small, or NaN. return negative ? -x : x; lo = hi = 0; } else if (x <...
2,248
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
2,249
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
2,250
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
2,251
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
2,252
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
public static double atan2(double y, double x) { if (x != x || y != y) return Double.NaN; if (x == 1) return atan(y); if (x == Double.POSITIVE_INFINITY) { if (y == Double.POSITIVE_INFINITY) return PI / 4; if (y == Double.NEGATIVE_INFINITY) return -PI / 4; return 0 * y; } if (x == Double.NEGATIVE_I...
2,253
public static double ceil(double a) { return -floor(-a); }
public static double ceil(double a) { return -floor(-a); }
2,254
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
2,255
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
2,256
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
2,257
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
2,258
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
public static double cos(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return cos(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return cos(y[0], y[1]); ca...
2,259
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
2,260
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
2,261
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
2,262
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
2,263
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
public static double exp(double x) { if (x != x) return x; if (x > EXP_LIMIT_H) return Double.POSITIVE_INFINITY; if (x < EXP_LIMIT_L) return 0; // Argument reduction. double hi; double lo; int k; double t = abs(x); if (t > 0.5 * LN2) { if (t < 1.5 * LN2) { hi = t - LN2_H; lo = LN2_L; k = 1; ...
2,264
public static double floor(double a) { double x = abs(a); if (!(x < TWO_52) || (long) a == a) return a; // No fraction bits; includes NaN and infinity. if (x < 1) return a >= 0 ? 0 * a : -1; // Worry about signed zero. return a < 0 ? (long) a - 1.0 : (long) a; // Cast to long truncates. }
public static double floor(double a) { double x = abs(a); if (!(x < TWO_52) || (long) a == a) return a; // No fraction bits; includes NaN and infinity. if (x < 1) return a >= 0 ? 0 * a : -1; // Worry about signed zero. return a < 0 ? (long) a - 1.0 : (long) a; // Cast to long truncates. }
2,265
public static double floor(double a) { double x = abs(a); if (!(x < TWO_52) || (long) a == a) return a; // No fraction bits; includes NaN and infinity. if (x < 1) return a >= 0 ? 0 * a : -1; // Worry about signed zero. return a < 0 ? (long) a - 1.0 : (long) a; // Cast to long truncates. }
public static double floor(double a) { double x = abs(a); if (!(x < TWO_52) || (long) a == a) return a; // No fraction bits; includes NaN and infinity. if (x < 1) return a >= 0 ? 0 * a : -1; // Worry about signed zero. return a < 0 ? (long) a - 1.0 : (long) a; // Cast to long truncates. }
2,266
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
2,267
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
2,268
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
2,269
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
2,270
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
public static double log(double x) { if (x == 0) return Double.NEGATIVE_INFINITY; if (x < 0) return Double.NaN; if (!(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Dou...
2,271
public static int max(int a, int b) { return (a > b) ? a : b; }
public static int max(int a, int b) { return (a > b) ? a : b; }
2,272
public static int min(int a, int b) { return (a < b) ? a : b; }
public static int min(int a, int b) { return (a < b) ? a : b; }
2,273
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,274
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,275
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,276
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,277
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,278
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,279
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,280
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,281
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,282
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
public static double pow(double x, double y) { // Special cases first. if (y == 0) return 1; if (y == 1) return x; if (y == -1) return 1 / x; if (x != x || y != y) return Double.NaN; // When x < 0, yisint tells if y is not an integer (0), even(1), // or odd (2). int yisint = 0; if (x < 0 && floor(y) =...
2,283
public static synchronized double random() { if (rand == null) rand = new Random(); return rand.nextDouble(); }
public static synchronized double random() { if (rand == null) rand = new Random(); return rand.nextDouble(); }
2,284
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,285
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,286
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,287
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,288
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,289
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,290
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
private static int remPiOver2(double x, double[] y) { boolean negative = x < 0; x = abs(x); double z; int n; if (x < 3 * PI / 4) // If |x| is small. { z = x - PIO2_1; if ((float) x != (float) (PI / 2)) // 33+53 bit pi is good enough. { y[0] = z - PIO2_1L; y[1] = z - y[0] - PIO2_1L; } else // Near...
2,291
public static double rint(double a) { double x = abs(a); if (!(x < TWO_52)) return a; // No fraction bits; includes NaN and infinity. if (x <= 0.5) return 0 * a; // Worry about signed zero. if (x % 2 <= 0.5) return (long) a; // Catch round down to even. return (long) (a + (a < 0 ? -0.5 : 0.5)); // Cast to l...
public static double rint(double a) { double x = abs(a); if (!(x < TWO_52)) return a; // No fraction bits; includes NaN and infinity. if (x <= 0.5) return 0 * a; // Worry about signed zero. if (x % 2 <= 0.5) return (long) a; // Catch round down to even. return (long) (a + (a < 0 ? -0.5 : 0.5)); // Cast to l...
2,292
public static double rint(double a) { double x = abs(a); if (!(x < TWO_52)) return a; // No fraction bits; includes NaN and infinity. if (x <= 0.5) return 0 * a; // Worry about signed zero. if (x % 2 <= 0.5) return (long) a; // Catch round down to even. return (long) (a + (a < 0 ? -0.5 : 0.5)); // Cast to l...
public static double rint(double a) { double x = abs(a); if (!(x < TWO_52)) return a; // No fraction bits; includes NaN and infinity. if (x <= 0.5) return 0 * a; // Worry about signed zero. if (x % 2 <= 0.5) return (long) a; // Catch round down to even. return (long) (a + (a < 0 ? -0.5 : 0.5)); // Cast to l...
2,293
public static int round(float f) { return (int) floor(f + 0.5f); }
public static int round(float f) { return (int) floor(f + 0.5f); }
2,294
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
2,295
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
2,296
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
private static double scale(double x, int n) { if (x == 0 || x == Double.NEGATIVE_INFINITY || !(x < Double.POSITIVE_INFINITY) || n == 0) return x; long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52) & 0x7ff; if (exp == 0) // Subnormal x. { x *= TWO_54; exp = ((int) (Double.doubleToLongBits...
2,297
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
2,298
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
2,299
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
2,300
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
2,301
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
public static double sin(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return sin(a, 0); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); switch (n & 3) { case 0 : return sin(y[0], y[1]); ca...
2,302
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
2,303
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
2,304
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
2,305
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
public static double sqrt(double x) { if (x < 0) return Double.NaN; if (x == 0 || !(x < Double.POSITIVE_INFINITY)) return x; // Normalize x. long bits = Double.doubleToLongBits(x); int exp = (int) (bits >> 52); if (exp == 0) // Subnormal x. { x *= TWO_54; bits = Double.doubleToLongBits(x); exp = (int...
2,306
public static double tan(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return tan(a, 0, false); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); return tan(y[0], y[1], (n & 1) == 1); }
public static double tan(double a) { if (a == Double.NEGATIVE_INFINITY || !(a < Double.POSITIVE_INFINITY)) return Double.NaN; if (abs(a) <= PI / 4) return tan(a, 0, false); // Argument reduction needed. double[] y = new double[2]; int n = remPiOver2(a, y); return tan(y[0], y[1], (n & 1) == 1); }
2,307
public static double toDegrees(double rads) { return rads * (180 / PI); }
public static double toDegrees(double rads) { return rads * (180 / PI); }
2,308
public static double toRadians(double degrees) { return degrees * (PI / 180); }
public static double toRadians(double degrees) { return degrees * (PI / 180); }
2,309
String generateName () { return "frame" + getUniqueLong (); }
String generateName() { return "frame" + getUniqueLong (); }
2,310
String generateName () { return "frame" + getUniqueLong (); }
String generateName () { return "frame" + getUniqueLong(); }
2,311
getCursorType(){ return(getCursor().getType());}
getCursorType(){ return(getCursor().getType());}
2,312
public int getExtendedState () { return state; }
public int getExtendedState() { return state; }
2,313
public static Frame[] getFrames(){ int n = 0; synchronized (weakFrames) { Iterator i = weakFrames.iterator(); while (i.hasNext()) { WeakReference wr = (WeakReference) i.next(); if (wr.get() != null) ++n; } if (n == 0) return new Frame[0]; else ...
public static Frame[] getFrames(){ int n = 0; synchronized (weakFrames) { Iterator i = weakFrames.iterator(); while (i.hasNext()) { WeakReference wr = (WeakReference) i.next(); if (wr.get() != null) ++n; } if (n == 0) return new Frame[0]; else ...
2,314
public static Frame[] getFrames(){ int n = 0; synchronized (weakFrames) { Iterator i = weakFrames.iterator(); while (i.hasNext()) { WeakReference wr = (WeakReference) i.next(); if (wr.get() != null) ++n; } if (n == 0) return new Frame[0]; else ...
public static Frame[] getFrames(){ int n = 0; synchronized (weakFrames) { Iterator i = weakFrames.iterator(); while (i.hasNext()) { WeakReference wr = (WeakReference) i.next(); if (wr.get() != null) ++n; } if (n == 0) return new Frame[0]; else ...
2,315
public Rectangle getMaximizedBounds () { return maximizedBounds; }
public Rectangle getMaximizedBounds() { return maximizedBounds; }
2,316
private static synchronized long getUniqueLong () { return next_frame_number++; }
private static synchronized long getUniqueLong() { return next_frame_number++; }
2,317
public boolean isUndecorated () { return undecorated; }
public boolean isUndecorated() { return undecorated; }
2,318
private static void noteFrame(Frame f){ weakFrames.add(new WeakReference(f));}
private static void noteFrame(Frame f){ weakFrames.add(new WeakReference(f));}
2,319
private static void noteFrame(Frame f){ weakFrames.add(new WeakReference(f));}
private static void noteFrame(Frame f){ weakFrames.add(new WeakReference(f));}
2,320
remove(MenuComponent menu){ menuBar.remove(menu);}
remove(MenuComponent menu){ menuBar.remove(menu);}
2,321
remove(MenuComponent menu){ menuBar.remove(menu);}
remove(MenuComponent menu){ menuBar.remove(menu);}
2,322
public void removeNotify(){ if (menuBar != null) menuBar.removeNotify(); super.removeNotify();}
public void removeNotify(){ if (menuBar != null) menuBar.removeNotify(); super.removeNotify();}
2,323
public void removeNotify(){ if (menuBar != null) menuBar.removeNotify(); super.removeNotify();}
public void removeNotify(){ if (menuBar != null) menuBar.removeNotify(); super.removeNotify();}
2,324
setCursor(int type){ setCursor(new Cursor(type));}
setCursor(int type){ setCursor(new Cursor(type));}
2,325
setCursor(int type){ setCursor(new Cursor(type));}
setCursor(int type){ setCursor(new Cursor(type));}
2,326
public void setExtendedState (int state) { this.state = state; }
public void setExtendedState(int state) { this.state = state; }
2,327
public void setMaximizedBounds (Rectangle maximizedBounds) { this.maximizedBounds = maximizedBounds; }
public void setMaximizedBounds(Rectangle maximizedBounds) { this.maximizedBounds = maximizedBounds; }
2,328
setMenuBar(MenuBar menuBar){ if (peer != null) { if (this.menuBar != null) this.menuBar.removeNotify(); if (menuBar != null) menuBar.addNotify(); invalidateTree (); ((FramePeer) peer).setMenuBar(menuBar); } this.menuBar = menuBar;}
setMenuBar(MenuBar menuBar){ if (peer != null) { if (this.menuBar != null) this.menuBar.removeNotify(); if (menuBar != null) menuBar.addNotify(); invalidateTree (); ((FramePeer) peer).setMenuBar(menuBar); } this.menuBar = menuBar;}
2,329
setMenuBar(MenuBar menuBar){ if (peer != null) { if (this.menuBar != null) this.menuBar.removeNotify(); if (menuBar != null) menuBar.addNotify(); invalidateTree (); ((FramePeer) peer).setMenuBar(menuBar); } this.menuBar = menuBar;}
setMenuBar(MenuBar menuBar){ if (peer != null) { if (this.menuBar != null) this.menuBar.removeNotify(); if (menuBar != null) menuBar.addNotify(); invalidateTree (); ((FramePeer) peer).setMenuBar(menuBar); } this.menuBar = menuBar;}
2,330
setResizable(boolean resizable){ this.resizable = resizable; if (peer != null) ((FramePeer) peer).setResizable(resizable);}
setResizable(boolean resizable){ this.resizable = resizable; if (peer != null) ((FramePeer) peer).setResizable(resizable);}
2,331
setResizable(boolean resizable){ this.resizable = resizable; if (peer != null) ((FramePeer) peer).setResizable(resizable);}
setResizable(boolean resizable){ this.resizable = resizable; if (peer != null) ((FramePeer) peer).setResizable(resizable);}
2,332
public void setState (int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState (current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState (current_state & ~ICONI...
public void setState(int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState (current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState (current_state & ~ICONIF...
2,333
public void setState (int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState (current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState (current_state & ~ICONI...
public void setState (int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState(current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState (current_state & ~ICONIF...
2,334
public void setState (int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState (current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState (current_state & ~ICONI...
public void setState (int state) { int current_state = getExtendedState (); if (state == NORMAL && (current_state & ICONIFIED) != 0) setExtendedState (current_state | ICONIFIED); if (state == ICONIFIED && (current_state & ~ICONIFIED) == 0) setExtendedState(current_state & ~ICONIF...
2,335
public void setUndecorated (boolean undecorated) { if (isDisplayable ()) throw new IllegalComponentStateException (); this.undecorated = undecorated; }
public void setUndecorated(boolean undecorated) { if (isDisplayable ()) throw new IllegalComponentStateException (); this.undecorated = undecorated; }
2,336
public void setUndecorated (boolean undecorated) { if (isDisplayable ()) throw new IllegalComponentStateException (); this.undecorated = undecorated; }
public void setUndecorated (boolean undecorated) { if (isDisplayable ()) throw new IllegalComponentStateException (); this.undecorated = undecorated; }
2,337