public final class oadd.org.apache.curator.shaded.com.google.common.math.IntMath extends java.lang.Object
{
static final int MAX_SIGNED_POWER_OF_TWO;
static final int MAX_POWER_OF_SQRT2_UNSIGNED;
static final byte[] maxLog10ForLeadingZeros;
static final int[] powersOf;
static final int[] halfPowersOf;
static final int FLOOR_SQRT_MAX_INT;
private static final int[] factorials;
static int[] biggestBinomials;
public static int ceilingPowerOfTwo(int)
{
int v, v, v, v, v;
java.lang.ArithmeticException v;
java.lang.String v;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkPositive(java.lang.String,int)>("x", v);
if v <= 1073741824 goto label;
v = new java.lang.ArithmeticException;
v = dynamicinvoke "makeConcatWithConstants" <java.lang.String (int)>(v) <java.lang.invoke.StringConcatFactory: java.lang.invoke.CallSite makeConcatWithConstants(java.lang.invoke.MethodHandles$Lookup,java.lang.String,java.lang.invoke.MethodType,java.lang.String,java.lang.Object[])>("ceilingPowerOfTwo(\u) not representable as an int");
specialinvoke v.<java.lang.ArithmeticException: void <init>(java.lang.String)>(v);
throw v;
label:
v = v - 1;
v = staticinvoke <java.lang.Integer: int numberOfLeadingZeros(int)>(v);
v = neg v;
v = 1 << v;
return v;
}
public static int floorPowerOfTwo(int)
{
int v, v;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkPositive(java.lang.String,int)>("x", v);
v = staticinvoke <java.lang.Integer: int highestOneBit(int)>(v);
return v;
}
public static boolean isPowerOfTwo(int)
{
int v, v, v;
boolean v, v, v;
v := @parameter: int;
if v <= 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v - 1;
v = v & v;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v & v;
return v;
}
static int lessThanBranchFree(int, int)
{
int v, v, v, v, v, v, v, v;
v := @parameter: int;
v := @parameter: int;
v = v - v;
v = (int) -1;
v = v ^ v;
v = (int) -1;
v = v ^ v;
v = v >>> 31;
return v;
}
public static int log2(int, java.math.RoundingMode)
{
java.lang.AssertionError v;
int[] v;
int v, v, v, v, v, v, v, v, v, v, v, v, v;
boolean v;
java.math.RoundingMode v;
v := @parameter: int;
v := @parameter: java.math.RoundingMode;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkPositive(java.lang.String,int)>("x", v);
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath$1: int[] $SwitchMap$java$math$RoundingMode>;
v = virtualinvoke v.<java.math.RoundingMode: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
case 4: goto label;
case 5: goto label;
case 6: goto label;
case 7: goto label;
case 8: goto label;
default: goto label;
};
label:
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: boolean isPowerOfTwo(int)>(v);
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkRoundingUnnecessary(boolean)>(v);
label:
v = staticinvoke <java.lang.Integer: int numberOfLeadingZeros(int)>(v);
v = 31 - v;
return v;
label:
v = v - 1;
v = staticinvoke <java.lang.Integer: int numberOfLeadingZeros(int)>(v);
v = 32 - v;
return v;
label:
v = staticinvoke <java.lang.Integer: int numberOfLeadingZeros(int)>(v);
v = -1257966797 >>> v;
v = 31 - v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v + v;
return v;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
}
public static int log10(int, java.math.RoundingMode)
{
java.lang.AssertionError v;
int[] v, v, v;
int v, v, v, v, v, v, v, v, v, v;
boolean v;
java.math.RoundingMode v;
v := @parameter: int;
v := @parameter: java.math.RoundingMode;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkPositive(java.lang.String,int)>("x", v);
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int log10Floor(int)>(v);
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] powersOf10>;
v = v[v];
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath$1: int[] $SwitchMap$java$math$RoundingMode>;
v = virtualinvoke v.<java.math.RoundingMode: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
case 4: goto label;
case 5: goto label;
case 6: goto label;
case 7: goto label;
case 8: goto label;
default: goto label;
};
label:
if v != v goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkRoundingUnnecessary(boolean)>(v);
label:
return v;
label:
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v + v;
return v;
label:
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] halfPowersOf10>;
v = v[v];
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v + v;
return v;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
}
private static int log10Floor(int)
{
byte[] v;
byte v;
int[] v;
int v, v, v, v, v;
v := @parameter: int;
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: byte[] maxLog10ForLeadingZeros>;
v = staticinvoke <java.lang.Integer: int numberOfLeadingZeros(int)>(v);
v = v[v];
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] powersOf10>;
v = v[v];
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v - v;
return v;
}
public static int pow(int, int)
{
byte v, v;
int v, v, v, v, v, v, v, v, v, v, v, v;
v := @parameter: int;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("exponent", v);
tableswitch(v)
{
case -2: goto label;
case -1: goto label;
case 0: goto label;
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
label:
return 1;
label:
v = v & 1;
if v != 0 goto label;
v = 1;
goto label;
label:
v = -1;
label:
return v;
label:
if v >= 32 goto label;
v = 1 << v;
goto label;
label:
v = 0;
label:
return v;
label:
if v >= 32 goto label;
v = v & 1;
if v != 0 goto label;
v = 1 << v;
goto label;
label:
v = 1 << v;
v = neg v;
label:
return v;
label:
return 0;
label:
v = 1;
label:
lookupswitch(v)
{
case 0: goto label;
case 1: goto label;
default: goto label;
};
label:
return v;
label:
v = v * v;
return v;
label:
v = v;
v = v & 1;
if v != 0 goto label;
v = 1;
goto label;
label:
v = v;
label:
v = v * v;
v = v * v;
v = v >> 1;
goto label;
}
public static int sqrt(int, java.math.RoundingMode)
{
java.lang.AssertionError v;
int[] v;
int v, v, v, v, v, v, v, v, v, v, v, v;
boolean v;
java.math.RoundingMode v;
v := @parameter: int;
v := @parameter: java.math.RoundingMode;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("x", v);
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int sqrtFloor(int)>(v);
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath$1: int[] $SwitchMap$java$math$RoundingMode>;
v = virtualinvoke v.<java.math.RoundingMode: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
case 4: goto label;
case 5: goto label;
case 6: goto label;
case 7: goto label;
case 8: goto label;
default: goto label;
};
label:
v = v * v;
if v != v goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkRoundingUnnecessary(boolean)>(v);
label:
return v;
label:
v = v * v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v + v;
return v;
label:
v = v * v;
v = v + v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int lessThanBranchFree(int,int)>(v, v);
v = v + v;
return v;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
}
private static int sqrtFloor(int)
{
int v;
double v;
v := @parameter: int;
v = staticinvoke <java.lang.Math: double sqrt(double)>(v);
return v;
}
public static int divide(int, int, java.math.RoundingMode)
{
java.lang.AssertionError v;
int[] v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
java.lang.ArithmeticException v;
boolean v, v, v, v, v, v, v, v, v;
java.math.RoundingMode v, v, v;
v := @parameter: int;
v := @parameter: int;
v := @parameter: java.math.RoundingMode;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: java.lang.Object checkNotNull(java.lang.Object)>(v);
if v != 0 goto label;
v = new java.lang.ArithmeticException;
specialinvoke v.<java.lang.ArithmeticException: void <init>(java.lang.String)>("/ by zero");
throw v;
label:
v = v / v;
v = v * v;
v = v - v;
if v != 0 goto label;
return v;
label:
v = v ^ v;
v = v >> 31;
v = 1 | v;
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath$1: int[] $SwitchMap$java$math$RoundingMode>;
v = virtualinvoke v.<java.math.RoundingMode: int ordinal()>();
v = v[v];
tableswitch(v)
{
case 1: goto label;
case 2: goto label;
case 3: goto label;
case 4: goto label;
case 5: goto label;
case 6: goto label;
case 7: goto label;
case 8: goto label;
default: goto label;
};
label:
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkRoundingUnnecessary(boolean)>(v);
label:
v = 0;
goto label;
label:
v = 1;
goto label;
label:
if v <= 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v;
goto label;
label:
if v >= 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v;
goto label;
label:
v = staticinvoke <java.lang.Math: int abs(int)>(v);
v = staticinvoke <java.lang.Math: int abs(int)>(v);
v = v - v;
v = v - v;
if v != 0 goto label;
v = <java.math.RoundingMode: java.math.RoundingMode HALF_UP>;
if v == v goto label;
v = <java.math.RoundingMode: java.math.RoundingMode HALF_EVEN>;
if v != v goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v & 1;
if v == 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v & v;
if v == 0 goto label;
label:
v = 1;
goto label;
label:
v = 0;
label:
v = v;
goto label;
label:
if v <= 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v;
goto label;
label:
v = new java.lang.AssertionError;
specialinvoke v.<java.lang.AssertionError: void <init>()>();
throw v;
label:
if v == 0 goto label;
v = v + v;
goto label;
label:
v = v;
label:
return v;
}
public static int mod(int, int)
{
int v, v, v, v;
java.lang.ArithmeticException v;
java.lang.String v;
v := @parameter: int;
v := @parameter: int;
if v > 0 goto label;
v = new java.lang.ArithmeticException;
v = dynamicinvoke "makeConcatWithConstants" <java.lang.String (int)>(v) <java.lang.invoke.StringConcatFactory: java.lang.invoke.CallSite makeConcatWithConstants(java.lang.invoke.MethodHandles$Lookup,java.lang.String,java.lang.invoke.MethodType,java.lang.String,java.lang.Object[])>("Modulus \u must be > 0");
specialinvoke v.<java.lang.ArithmeticException: void <init>(java.lang.String)>(v);
throw v;
label:
v = v % v;
if v < 0 goto label;
v = v;
goto label;
label:
v = v + v;
label:
return v;
}
public static int gcd(int, int)
{
int v, v, v, v, v, v, v, v, v, v, v, v, v, v;
v := @parameter: int;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("a", v);
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("b", v);
if v != 0 goto label;
return v;
label:
if v != 0 goto label;
return v;
label:
v = staticinvoke <java.lang.Integer: int numberOfTrailingZeros(int)>(v);
v = v >> v;
v = staticinvoke <java.lang.Integer: int numberOfTrailingZeros(int)>(v);
v = v >> v;
label:
if v == v goto label;
v = v - v;
v = v >> 31;
v = v & v;
v = v - v;
v = v - v;
v = v + v;
v = staticinvoke <java.lang.Integer: int numberOfTrailingZeros(int)>(v);
v = v >> v;
goto label;
label:
v = staticinvoke <java.lang.Math: int min(int,int)>(v, v);
v = v << v;
return v;
}
public static int checkedAdd(int, int)
{
byte v;
int v, v, v;
long v;
boolean v;
v := @parameter: int;
v := @parameter: int;
v = v + v;
v = v cmp v;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedAdd", v, v);
return v;
}
public static int checkedSubtract(int, int)
{
byte v;
int v, v, v;
long v;
boolean v;
v := @parameter: int;
v := @parameter: int;
v = v - v;
v = v cmp v;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedSubtract", v, v);
return v;
}
public static int checkedMultiply(int, int)
{
byte v;
int v, v, v;
long v;
boolean v;
v := @parameter: int;
v := @parameter: int;
v = v * v;
v = v cmp v;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedMultiply", v, v);
return v;
}
public static int checkedPow(int, int)
{
byte v, v;
int v, v, v, v, v, v, v, v, v, v, v;
boolean v, v, v, v, v;
v := @parameter: int;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("exponent", v);
tableswitch(v)
{
case -2: goto label;
case -1: goto label;
case 0: goto label;
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
label:
return 1;
label:
v = v & 1;
if v != 0 goto label;
v = 1;
goto label;
label:
v = -1;
label:
return v;
label:
if v >= 31 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedPow", v, v);
v = 1 << v;
return v;
label:
if v >= 32 goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedPow", v, v);
v = v & 1;
if v != 0 goto label;
v = 1 << v;
goto label;
label:
v = (int) -1;
v = v << v;
label:
return v;
label:
v = 1;
label:
lookupswitch(v)
{
case 0: goto label;
case 1: goto label;
default: goto label;
};
label:
return v;
label:
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int checkedMultiply(int,int)>(v, v);
return v;
label:
v = v & 1;
if v == 0 goto label;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int checkedMultiply(int,int)>(v, v);
label:
v = v >> 1;
if v <= 0 goto label;
if -46340 > v goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = (int) 46340;
if v > v goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v & v;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: void checkNoOverflow(boolean,java.lang.String,int,int)>(v, "checkedPow", v, v);
v = v * v;
goto label;
}
public static int saturatedAdd(int, int)
{
int v, v, v;
long v;
v := @parameter: int;
v := @parameter: int;
v = v + v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.Ints: int saturatedCast(long)>(v);
return v;
}
public static int saturatedSubtract(int, int)
{
int v, v, v;
long v;
v := @parameter: int;
v := @parameter: int;
v = v - v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.Ints: int saturatedCast(long)>(v);
return v;
}
public static int saturatedMultiply(int, int)
{
int v, v, v;
long v;
v := @parameter: int;
v := @parameter: int;
v = v * v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.Ints: int saturatedCast(long)>(v);
return v;
}
public static int saturatedPow(int, int)
{
byte v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
boolean v, v, v;
v := @parameter: int;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("exponent", v);
tableswitch(v)
{
case -2: goto label;
case -1: goto label;
case 0: goto label;
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
label:
return 1;
label:
v = v & 1;
if v != 0 goto label;
v = 1;
goto label;
label:
v = -1;
label:
return v;
label:
if v < 31 goto label;
return 2147483647;
label:
v = 1 << v;
return v;
label:
if v < 32 goto label;
v = v & 1;
v = 2147483647 + v;
return v;
label:
v = v & 1;
if v != 0 goto label;
v = 1 << v;
goto label;
label:
v = (int) -1;
v = v << v;
label:
return v;
label:
v = 1;
v = v >>> 31;
v = v & 1;
v = v & v;
v = 2147483647 + v;
label:
lookupswitch(v)
{
case 0: goto label;
case 1: goto label;
default: goto label;
};
label:
return v;
label:
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int saturatedMultiply(int,int)>(v, v);
return v;
label:
v = v & 1;
if v == 0 goto label;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int saturatedMultiply(int,int)>(v, v);
label:
v = v >> 1;
if v <= 0 goto label;
if -46340 <= v goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = (int) 46340;
if v <= v goto label;
v = 1;
goto label;
label:
v = 0;
label:
v = v | v;
if v == 0 goto label;
return v;
label:
v = v * v;
goto label;
}
public static int factorial(int)
{
int[] v, v;
int v, v, v;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("n", v);
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] factorials>;
v = lengthof v;
if v >= v goto label;
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] factorials>;
v = v[v];
goto label;
label:
v = 2147483647;
label:
return v;
}
public static int binomial(int, int)
{
long v, v;
int[] v, v;
int v, v, v, v, v, v, v, v;
boolean v;
v := @parameter: int;
v := @parameter: int;
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("n", v);
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.MathPreconditions: int checkNonNegative(java.lang.String,int)>("k", v);
if v > v goto label;
v = 1;
goto label;
label:
v = 0;
label:
staticinvoke <oadd.org.apache.curator.shaded.com.google.common.base.Preconditions: void checkArgument(boolean,java.lang.String,int,int)>(v, "k (%s) > n (%s)", v, v);
v = v >> 1;
if v <= v goto label;
v = v - v;
label:
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] biggestBinomials>;
v = lengthof v;
if v >= v goto label;
v = <oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] biggestBinomials>;
v = v[v];
if v <= v goto label;
label:
return 2147483647;
label:
lookupswitch(v)
{
case 0: goto label;
case 1: goto label;
default: goto label;
};
label:
return 1;
label:
return v;
label:
v = 1L;
v = 0;
label:
if v >= v goto label;
v = v - v;
v = v * v;
v = v + 1;
v = v / v;
v = v + 1;
goto label;
label:
return v;
}
public static int mean(int, int)
{
int v, v, v, v, v, v;
v := @parameter: int;
v := @parameter: int;
v = v & v;
v = v ^ v;
v = v >> 1;
v = v + v;
return v;
}
public static boolean isPrime(int)
{
int v;
boolean v;
v := @parameter: int;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.math.LongMath: boolean isPrime(long)>(v);
return v;
}
private void <init>()
{
oadd.org.apache.curator.shaded.com.google.common.math.IntMath v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.IntMath;
specialinvoke v.<java.lang.Object: void <init>()>();
return;
}
static void <clinit>()
{
byte[] v;
int[] v, v, v, v;
int v;
v = newarray (byte)[33];
v[0] = 9;
v[1] = 9;
v[2] = 9;
v[3] = 8;
v[4] = 8;
v[5] = 8;
v[6] = 7;
v[7] = 7;
v[8] = 7;
v[9] = 6;
v[10] = 6;
v[11] = 6;
v[12] = 6;
v[13] = 5;
v[14] = 5;
v[15] = 5;
v[16] = 4;
v[17] = 4;
v[18] = 4;
v[19] = 3;
v[20] = 3;
v[21] = 3;
v[22] = 3;
v[23] = 2;
v[24] = 2;
v[25] = 2;
v[26] = 1;
v[27] = 1;
v[28] = 1;
v[29] = 0;
v[30] = 0;
v[31] = 0;
v[32] = 0;
<oadd.org.apache.curator.shaded.com.google.common.math.IntMath: byte[] maxLog10ForLeadingZeros> = v;
v = newarray (int)[10];
v[0] = 1;
v[1] = 10;
v[2] = 100;
v[3] = 1000;
v[4] = 10000;
v[5] = 100000;
v[6] = 1000000;
v[7] = 10000000;
v[8] = 100000000;
v[9] = 1000000000;
<oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] powersOf10> = v;
v = newarray (int)[10];
v[0] = 3;
v[1] = 31;
v[2] = 316;
v[3] = 3162;
v[4] = 31622;
v[5] = 316227;
v[6] = 3162277;
v[7] = 31622776;
v[8] = 316227766;
v[9] = 2147483647;
<oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] halfPowersOf10> = v;
v = newarray (int)[13];
v[0] = 1;
v[1] = 1;
v[2] = 2;
v[3] = 6;
v[4] = 24;
v[5] = 120;
v[6] = 720;
v[7] = 5040;
v = (int) 40320;
v[8] = v;
v[9] = 362880;
v[10] = 3628800;
v[11] = 39916800;
v[12] = 479001600;
<oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] factorials> = v;
v = newarray (int)[17];
v[0] = 2147483647;
v[1] = 2147483647;
v[2] = 65536;
v[3] = 2345;
v[4] = 477;
v[5] = 193;
v[6] = 110;
v[7] = 75;
v[8] = 58;
v[9] = 49;
v[10] = 43;
v[11] = 39;
v[12] = 37;
v[13] = 35;
v[14] = 34;
v[15] = 34;
v[16] = 33;
<oadd.org.apache.curator.shaded.com.google.common.math.IntMath: int[] biggestBinomials> = v;
return;
}
}