Created
June 18, 2020 19:22
-
-
Save riftrsps/46bf46d0f1a1791e4c28801d8f620d78 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// | |
// Decompiled by Procyon v0.5.36 | |
// | |
public class class263 extends class184 | |
{ | |
static boolean lowMemory; | |
static class154 field3346; | |
static class243 field3345; | |
static class154 field3352; | |
static class154 field3348; | |
static class243 field3344; | |
public static class154 field3347; | |
static class130[] field3376; | |
class325 field3369; | |
int field3386; | |
public int field3363; | |
int[] modelIds; | |
int[] field3353; | |
public int[] field3385; | |
public String field3354; | |
int field3387; | |
public int field3350; | |
public int field3371; | |
public int field3351; | |
public int[] field3392; | |
public int field3359; | |
public int field3361; | |
boolean field3374; | |
public int field3372; | |
public int field3360; | |
public boolean field3384; | |
public int field3388; | |
boolean field3365; | |
int field3364; | |
public int field3390; | |
public boolean field3343; | |
int field3357; | |
int field3362; | |
int field3349; | |
public String[] field3368; | |
public int field3366; | |
public int field3367; | |
boolean field3383; | |
public int field3393; | |
int field3377; | |
short[] field3355; | |
public boolean field3375; | |
short[] field3370; | |
short[] field3358; | |
int field3378; | |
short[] field3394; | |
int field3379; | |
public int field3391; | |
int field3380; | |
int field3381; | |
public boolean field3382; | |
static { | |
class263.lowMemory = false; | |
class263.field3346 = new class154(4096); | |
class263.field3347 = new class154(500); | |
class263.field3348 = new class154(30); | |
class263.field3352 = new class154(30); | |
class263.field3376 = new class130[4]; | |
} | |
class263() { | |
this.field3354 = "null"; | |
this.field3359 = 1; | |
this.field3360 = 1; | |
this.field3361 = 2; | |
this.field3384 = true; | |
this.field3363 = -1; | |
this.field3364 = -1; | |
this.field3365 = false; | |
this.field3343 = false; | |
this.field3367 = -1; | |
this.field3393 = 16; | |
this.field3357 = 0; | |
this.field3349 = 0; | |
this.field3368 = new String[5]; | |
this.field3372 = -1; | |
this.field3391 = -1; | |
this.field3374 = false; | |
this.field3375 = true; | |
this.field3362 = 128; | |
this.field3377 = 128; | |
this.field3378 = 128; | |
this.field3379 = 0; | |
this.field3380 = 0; | |
this.field3381 = 0; | |
this.field3382 = false; | |
this.field3383 = false; | |
this.field3371 = -1; | |
this.field3386 = -1; | |
this.field3387 = -1; | |
this.field3350 = -1; | |
this.field3388 = 0; | |
this.field3390 = 0; | |
this.field3366 = 0; | |
} | |
public final class263 method4645(final short n) { | |
int method2197 = -1; | |
if (this.field3386 != -1) { | |
method2197 = class95.method2197(this.field3386, -541616394); | |
} | |
else if (this.field3387 != -1) { | |
method2197 = class221.field2526[this.field3387]; | |
} | |
int n2; | |
if (method2197 >= 0 && method2197 < this.field3385.length - 1) { | |
n2 = this.field3385[method2197]; | |
} | |
else { | |
n2 = this.field3385[this.field3385.length - 1]; | |
} | |
if (n2 != -1) { | |
return class33.method435(n2, 1650295452); | |
} | |
return null; | |
} | |
void readValues(final JagexStream JagexStream, final int n, final int n2) { | |
if (n == 1) { | |
final int method5547 = JagexStream.method5547((byte)120); | |
if (method5547 > 0) { | |
if (this.modelIds == null || class263.lowMemory) { | |
this.field3353 = new int[method5547]; | |
this.modelIds = new int[method5547]; | |
for (int i = 0; i < method5547; ++i) { | |
this.modelIds[i] = JagexStream.method5549((byte)26); | |
this.field3353[i] = JagexStream.method5547((byte)110); | |
} | |
} | |
else { | |
JagexStream.field3710 += 3 * method5547; | |
} | |
} | |
} | |
else if (n == 2) { | |
this.field3354 = JagexStream.method5667(-839497304); | |
} | |
else if (n == 5) { | |
final int method5548 = JagexStream.method5547((byte)102); | |
if (method5548 > 0) { | |
if (this.modelIds == null || class263.lowMemory) { | |
this.field3353 = null; | |
this.modelIds = new int[method5548]; | |
for (int j = 0; j < method5548; ++j) { | |
this.modelIds[j] = JagexStream.method5549((byte)83); | |
} | |
} | |
else { | |
JagexStream.field3710 += method5548 * 2; | |
} | |
} | |
} | |
else if (n == 14) { | |
this.field3359 = JagexStream.method5547((byte)42); | |
} | |
else if (n == 15) { | |
this.field3360 = JagexStream.method5547((byte)52); | |
} | |
else if (n == 17) { | |
this.field3361 = 0; | |
this.field3384 = false; | |
} | |
else if (n == 18) { | |
this.field3384 = false; | |
} | |
else if (n == 19) { | |
this.field3363 = JagexStream.method5547((byte)86); | |
} | |
else if (n == 21) { | |
this.field3364 = 0; | |
} | |
else if (n == 22) { | |
this.field3365 = true; | |
} | |
else if (n == 23) { | |
this.field3343 = true; | |
} | |
else if (n == 24) { | |
this.field3367 = JagexStream.method5549((byte)119); | |
if (this.field3367 == 65535) { | |
this.field3367 = -1; | |
} | |
} | |
else if (n == 27) { | |
this.field3361 = 1; | |
} | |
else if (n == 28) { | |
this.field3393 = JagexStream.method5547((byte)123); | |
} | |
else if (n == 29) { | |
this.field3357 = JagexStream.method5548(155825949); | |
} | |
else if (n == 39) { | |
this.field3349 = JagexStream.method5548(49939394) * 25; | |
} | |
else if (n >= 30 && n < 35) { | |
this.field3368[n - 30] = JagexStream.method5667(-1481112169); | |
if (this.field3368[n - 30].equalsIgnoreCase("Hidden")) { | |
this.field3368[n - 30] = null; | |
} | |
} | |
else if (n == 40) { | |
final int method5549 = JagexStream.method5547((byte)105); | |
this.field3355 = new short[method5549]; | |
this.field3358 = new short[method5549]; | |
for (int k = 0; k < method5549; ++k) { | |
this.field3355[k] = (short) JagexStream.method5549((byte)43); | |
this.field3358[k] = (short) JagexStream.method5549((byte)15); | |
} | |
} | |
else if (n == 41) { | |
final int method5550 = JagexStream.method5547((byte)78); | |
this.field3370 = new short[method5550]; | |
this.field3394 = new short[method5550]; | |
for (int l = 0; l < method5550; ++l) { | |
this.field3370[l] = (short) JagexStream.method5549((byte)101); | |
this.field3394[l] = (short) JagexStream.method5549((byte)79); | |
} | |
} | |
else if (n == 62) { | |
this.field3374 = true; | |
} | |
else if (n == 64) { | |
this.field3375 = false; | |
} | |
else if (n == 65) { | |
this.field3362 = JagexStream.method5549((byte)111); | |
} | |
else if (n == 66) { | |
this.field3377 = JagexStream.method5549((byte)68); | |
} | |
else if (n == 67) { | |
this.field3378 = JagexStream.method5549((byte)111); | |
} | |
else if (n == 68) { | |
this.field3391 = JagexStream.method5549((byte)86); | |
} | |
else if (n == 69) { | |
JagexStream.method5547((byte)88); | |
} | |
else if (n == 70) { | |
this.field3379 = JagexStream.method5550(-707737685); | |
} | |
else if (n == 71) { | |
this.field3380 = JagexStream.method5550(372245151); | |
} | |
else if (n == 72) { | |
this.field3381 = JagexStream.method5550(84164366); | |
} | |
else if (n == 73) { | |
this.field3382 = true; | |
} | |
else if (n == 74) { | |
this.field3383 = true; | |
} | |
else if (n == 75) { | |
this.field3371 = JagexStream.method5547((byte)58); | |
} | |
else if (n != 77 && n != 92) { | |
if (n == 78) { | |
this.field3350 = JagexStream.method5549((byte)84); | |
this.field3388 = JagexStream.method5547((byte)57); | |
} | |
else if (n == 79) { | |
this.field3390 = JagexStream.method5549((byte)83); | |
this.field3366 = JagexStream.method5549((byte)24); | |
this.field3388 = JagexStream.method5547((byte)29); | |
final int method5551 = JagexStream.method5547((byte)61); | |
this.field3392 = new int[method5551]; | |
for (int n3 = 0; n3 < method5551; ++n3) { | |
this.field3392[n3] = JagexStream.method5549((byte)18); | |
} | |
} | |
else if (n == 81) { | |
this.field3364 = JagexStream.method5547((byte)105) * 256; | |
} | |
else if (n == 82) { | |
this.field3372 = JagexStream.method5549((byte)115); | |
} | |
else if (n == 249) { | |
this.field3369 = class246.method4375(JagexStream, this.field3369, -1200596784); | |
} | |
} | |
else { | |
this.field3386 = JagexStream.method5549((byte)124); | |
if (this.field3386 == 65535) { | |
this.field3386 = -1; | |
} | |
this.field3387 = JagexStream.method5549((byte)52); | |
if (this.field3387 == 65535) { | |
this.field3387 = -1; | |
} | |
int method5552 = -1; | |
if (n == 92) { | |
method5552 = JagexStream.method5549((byte)12); | |
if (method5552 == 65535) { | |
method5552 = -1; | |
} | |
} | |
final int method5553 = JagexStream.method5547((byte)17); | |
this.field3385 = new int[method5553 + 2]; | |
for (int n4 = 0; n4 <= method5553; ++n4) { | |
this.field3385[n4] = JagexStream.method5549((byte)67); | |
if (this.field3385[n4] == 65535) { | |
this.field3385[n4] = -1; | |
} | |
} | |
this.field3385[method5553 + 1] = method5552; | |
} | |
} | |
final class130 method4652(final int n, int n2, final int n3) { | |
class130 class130 = null; | |
if (this.field3353 == null) { | |
if (n != 10) { | |
return null; | |
} | |
if (this.modelIds == null) { | |
return null; | |
} | |
boolean field3374 = this.field3374; | |
if (n == 2 && n2 > 3) { | |
field3374 = !field3374; | |
} | |
final int length = this.modelIds.length; | |
for (int i = 0; i < length; ++i) { | |
int n4 = this.modelIds[i]; | |
if (field3374) { | |
n4 += 65536; | |
} | |
class130 = (class130)class263.field3347.method3418(n4); | |
if (class130 == null) { | |
class130 = class130.method2865(class263.field3345, n4 & 0xFFFF, 0); | |
if (class130 == null) { | |
return null; | |
} | |
if (field3374) { | |
class130.method2881(); | |
} | |
class263.field3347.method3424(class130, n4); | |
} | |
if (length > 1) { | |
class263.field3376[i] = class130; | |
} | |
} | |
if (length > 1) { | |
class130 = new class130(class263.field3376, length); | |
} | |
} | |
else { | |
int n5 = -1; | |
for (int j = 0; j < this.field3353.length; ++j) { | |
if (this.field3353[j] == n) { | |
n5 = j; | |
break; | |
} | |
} | |
if (n5 == -1) { | |
return null; | |
} | |
int n6 = this.modelIds[n5]; | |
final boolean b = this.field3374 ^ n2 > 3; | |
if (b) { | |
n6 += 65536; | |
} | |
class130 = (class130)class263.field3347.method3418(n6); | |
if (class130 == null) { | |
class130 = class130.method2865(class263.field3345, n6 & 0xFFFF, 0); | |
if (class130 == null) { | |
return null; | |
} | |
if (b) { | |
class130.method2881(); | |
} | |
class263.field3347.method3424(class130, n6); | |
} | |
} | |
int n7; | |
if (this.field3362 == 128 && this.field3377 == 128 && this.field3378 == 128) { | |
n7 = 0; | |
} | |
else { | |
n7 = 1; | |
} | |
int n8; | |
if (this.field3379 == 0 && this.field3380 == 0 && this.field3381 == 0) { | |
n8 = 0; | |
} | |
else { | |
n8 = 1; | |
} | |
final class130 class131 = new class130(class130, n2 == 0 && n7 == 0 && n8 == 0, this.field3355 == null, this.field3370 == null, true); | |
if (n == 4 && n2 > 3) { | |
class131.method2877(256); | |
class131.method2878(45, 0, -45); | |
} | |
n2 &= 0x3; | |
if (n2 == 1) { | |
class131.method2874(); | |
} | |
else if (n2 == 2) { | |
class131.method2875(); | |
} | |
else if (n2 == 3) { | |
class131.method2896(); | |
} | |
if (this.field3355 != null) { | |
for (int k = 0; k < this.field3355.length; ++k) { | |
class131.method2879(this.field3355[k], this.field3358[k]); | |
} | |
} | |
if (this.field3370 != null) { | |
for (int l = 0; l < this.field3370.length; ++l) { | |
class131.method2931(this.field3370[l], this.field3394[l]); | |
} | |
} | |
if (n7 != 0) { | |
class131.method2882(this.field3362, this.field3377, this.field3378); | |
} | |
if (n8 != 0) { | |
class131.method2878(this.field3379, this.field3380, this.field3381); | |
} | |
return class131; | |
} | |
void method4634(final int n) { | |
if (this.field3363 == -1) { | |
this.field3363 = 0; | |
if (this.modelIds != null && (this.field3353 == null || this.field3353[0] == 10)) { | |
this.field3363 = 1; | |
} | |
for (int i = 0; i < 5; ++i) { | |
if (this.field3368[i] != null) { | |
this.field3363 = 1; | |
} | |
} | |
} | |
if (this.field3371 == -1) { | |
this.field3371 = ((this.field3361 != 0) ? 1 : 0); | |
} | |
} | |
void method4635(final JagexStream JagexStream, final int n) { | |
while (true) { | |
final int method5547 = JagexStream.method5547((byte)56); | |
if (method5547 == 0) { | |
break; | |
} | |
this.readValues(JagexStream, method5547, 1616364474); | |
} | |
} | |
public final class136 method4641(final int n, final int n2, final int[][] array, final int n3, final int n4, final int n5, final class268 class268, final int n6, final short n7) { | |
long n8; | |
if (this.field3353 == null) { | |
n8 = n2 + (this.field3351 << 10); | |
} | |
else { | |
n8 = n2 + (n << 3) + (this.field3351 << 10); | |
} | |
class136 method2886 = (class136)class263.field3352.method3418(n8); | |
if (method2886 == null) { | |
final class130 method2887 = this.method4652(n, n2, -1299581949); | |
if (method2887 == null) { | |
return null; | |
} | |
method2886 = method2887.method2886(this.field3357 + 64, this.field3349 + 768, -50, -10, -50); | |
class263.field3352.method3424(method2886, n8); | |
} | |
if (class268 == null && this.field3364 == -1) { | |
return method2886; | |
} | |
class136 class269; | |
if (class268 != null) { | |
class269 = class268.method4821(method2886, n6, n2, -1535419363); | |
} | |
else { | |
class269 = method2886.method2971(true); | |
} | |
if (this.field3364 >= 0) { | |
class269 = class269.method2985(array, n3, n4, n5, false, this.field3364); | |
} | |
return class269; | |
} | |
public final class136 method4639(final int n, final int n2, final int[][] array, final int n3, final int n4, final int n5, final int n6) { | |
long n7; | |
if (this.field3353 == null) { | |
n7 = n2 + (this.field3351 << 10); | |
} | |
else { | |
n7 = n2 + (n << 3) + (this.field3351 << 10); | |
} | |
class136 class136 = (class136)class263.field3352.method3418(n7); | |
if (class136 == null) { | |
final class130 method4652 = this.method4652(n, n2, 179271223); | |
if (method4652 == null) { | |
return null; | |
} | |
class136 = method4652.method2886(this.field3357 + 64, this.field3349 + 768, -50, -10, -50); | |
class263.field3352.method3424(class136, n7); | |
} | |
if (this.field3364 >= 0) { | |
class136 = class136.method2985(array, n3, n4, n5, true, this.field3364); | |
} | |
return class136; | |
} | |
public final boolean method4637(final int n, final int n2) { | |
if (this.field3353 != null) { | |
for (int i = 0; i < this.field3353.length; ++i) { | |
if (this.field3353[i] == n) { | |
return class263.field3345.method4238(this.modelIds[i] & 0xFFFF, 0, 1429078390); | |
} | |
} | |
return true; | |
} | |
if (this.modelIds == null) { | |
return true; | |
} | |
if (n != 10) { | |
return true; | |
} | |
boolean b = true; | |
for (int j = 0; j < this.modelIds.length; ++j) { | |
b &= class263.field3345.method4238(this.modelIds[j] & 0xFFFF, 0, 1496093991); | |
} | |
return b; | |
} | |
public final boolean method4638(final byte b) { | |
if (this.modelIds == null) { | |
return true; | |
} | |
boolean b2 = true; | |
for (int i = 0; i < this.modelIds.length; ++i) { | |
b2 &= class263.field3345.method4238(this.modelIds[i] & 0xFFFF, 0, 1528445296); | |
} | |
return b2; | |
} | |
public boolean method4646(final int n) { | |
if (this.field3385 == null) { | |
return this.field3350 != -1 || this.field3392 != null; | |
} | |
for (int i = 0; i < this.field3385.length; ++i) { | |
if (this.field3385[i] != -1) { | |
final class263 method435 = class33.method435(this.field3385[i], 1650295452); | |
if (method435.field3350 != -1 || method435.field3392 != null) { | |
return true; | |
} | |
} | |
} | |
return false; | |
} | |
public int method4667(final int n, final int n2, final byte b) { | |
final class325 field3369 = this.field3369; | |
int field3370; | |
if (field3369 == null) { | |
field3370 = n2; | |
} | |
else { | |
final class188 class188 = (class188)field3369.method5968(n); | |
if (class188 == null) { | |
field3370 = n2; | |
} | |
else { | |
field3370 = class188.field2114; | |
} | |
} | |
return field3370; | |
} | |
public String method4680(final int n, final String s, final int n2) { | |
return class9.method122(this.field3369, n, s, (short)171); | |
} | |
public final class144 method4654(final int n, final int n2, final int[][] array, final int n3, final int n4, final int n5, final int n6) { | |
long n7; | |
if (this.field3353 == null) { | |
n7 = n2 + (this.field3351 << 10); | |
} | |
else { | |
n7 = n2 + (n << 3) + (this.field3351 << 10); | |
} | |
class144 class144 = (class144)class263.field3348.method3418(n7); | |
if (class144 == null) { | |
final class130 method4652 = this.method4652(n, n2, 666598976); | |
if (method4652 == null) { | |
return null; | |
} | |
if (!this.field3365) { | |
class144 = method4652.method2886(this.field3357 + 64, this.field3349 + 768, -50, -10, -50); | |
} | |
else { | |
method4652.field1587 = (short)(this.field3357 + 64); | |
method4652.field1593 = (short)(this.field3349 + 768); | |
method4652.method2883(); | |
class144 = method4652; | |
} | |
class263.field3348.method3424(class144, n7); | |
} | |
if (this.field3365) { | |
class144 = ((class130)class144).method2871(); | |
} | |
if (this.field3364 >= 0) { | |
if (class144 instanceof class136) { | |
class144 = ((class136)class144).method2985(array, n3, n4, n5, true, this.field3364); | |
} | |
else if (class144 instanceof class130) { | |
class144 = ((class130)class144).method2872(array, n3, n4, n5, true, this.field3364); | |
} | |
} | |
return class144; | |
} | |
static void method4687(final boolean b, final int n) { | |
class94.field1206 = ""; | |
class94.field1192 = "Enter your username/email & password."; | |
class94.field1208 = ""; | |
class94.field1204 = 2; | |
if (b) { | |
class94.field1210 = ""; | |
} | |
if (class94.field1220 == null || class94.field1220.length() <= 0) { | |
if (class76.field676.field1080 != null) { | |
class94.field1220 = class76.field676.field1080; | |
client.field716 = true; | |
} | |
else { | |
client.field716 = false; | |
} | |
} | |
class301.method5361((byte)79); | |
} | |
static int method4686(final int n, final class101 class101, final boolean b, final int n2) { | |
if (n == 4000) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = class85.field1115[class85.field1117] + class85.field1115[class85.field1117 + 1]; | |
return 1; | |
} | |
if (n == 4001) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = class85.field1115[class85.field1117] - class85.field1115[class85.field1117 + 1]; | |
return 1; | |
} | |
if (n == 4002) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = class85.field1115[class85.field1117] * class85.field1115[class85.field1117 + 1]; | |
return 1; | |
} | |
if (n == 4003) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = class85.field1115[class85.field1117] / class85.field1115[class85.field1117 + 1]; | |
return 1; | |
} | |
if (n == 4004) { | |
class85.field1115[++class85.field1117 - 1] = (int)(Math.random() * class85.field1115[--class85.field1117]); | |
return 1; | |
} | |
if (n == 4005) { | |
class85.field1115[++class85.field1117 - 1] = (int)(Math.random() * (class85.field1115[--class85.field1117] + 1)); | |
return 1; | |
} | |
if (n == 4006) { | |
class85.field1117 -= 5; | |
final int n3 = class85.field1115[class85.field1117]; | |
final int n4 = class85.field1115[class85.field1117 + 1]; | |
final int n5 = class85.field1115[class85.field1117 + 2]; | |
class85.field1115[++class85.field1117 - 1] = n3 + (n4 - n3) * (class85.field1115[class85.field1117 + 4] - n5) / (class85.field1115[class85.field1117 + 3] - n5); | |
return 1; | |
} | |
if (n == 4007) { | |
class85.field1117 -= 2; | |
final int n6 = class85.field1115[class85.field1117]; | |
class85.field1115[++class85.field1117 - 1] = n6 + class85.field1115[class85.field1117 + 1] * n6 / 100; | |
return 1; | |
} | |
if (n == 4008) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = (class85.field1115[class85.field1117] | 1 << class85.field1115[class85.field1117 + 1]); | |
return 1; | |
} | |
if (n == 4009) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = (class85.field1115[class85.field1117] & -1 - (1 << class85.field1115[class85.field1117 + 1])); | |
return 1; | |
} | |
if (n == 4010) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = (((class85.field1115[class85.field1117] & 1 << class85.field1115[class85.field1117 + 1]) != 0x0) ? 1 : 0); | |
return 1; | |
} | |
if (n == 4011) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = class85.field1115[class85.field1117] % class85.field1115[class85.field1117 + 1]; | |
return 1; | |
} | |
if (n == 4012) { | |
class85.field1117 -= 2; | |
final int n7 = class85.field1115[class85.field1117]; | |
final int n8 = class85.field1115[class85.field1117 + 1]; | |
if (n7 == 0) { | |
class85.field1115[++class85.field1117 - 1] = 0; | |
} | |
else { | |
class85.field1115[++class85.field1117 - 1] = (int)Math.pow(n7, n8); | |
} | |
return 1; | |
} | |
if (n == 4013) { | |
class85.field1117 -= 2; | |
final int n9 = class85.field1115[class85.field1117]; | |
final int n10 = class85.field1115[class85.field1117 + 1]; | |
if (n9 == 0) { | |
class85.field1115[++class85.field1117 - 1] = 0; | |
return 1; | |
} | |
switch (n10) { | |
default: { | |
class85.field1115[++class85.field1117 - 1] = (int)Math.pow(n9, 1.0 / n10); | |
break; | |
} | |
case 1: { | |
class85.field1115[++class85.field1117 - 1] = n9; | |
break; | |
} | |
case 4: { | |
class85.field1115[++class85.field1117 - 1] = (int)Math.sqrt(Math.sqrt(n9)); | |
break; | |
} | |
case 0: { | |
class85.field1115[++class85.field1117 - 1] = Integer.MAX_VALUE; | |
break; | |
} | |
case 2: { | |
class85.field1115[++class85.field1117 - 1] = (int)Math.sqrt(n9); | |
break; | |
} | |
case 3: { | |
class85.field1115[++class85.field1117 - 1] = (int)Math.cbrt(n9); | |
break; | |
} | |
} | |
return 1; | |
} | |
else { | |
if (n == 4014) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = (class85.field1115[class85.field1117] & class85.field1115[class85.field1117 + 1]); | |
return 1; | |
} | |
if (n == 4015) { | |
class85.field1117 -= 2; | |
class85.field1115[++class85.field1117 - 1] = (class85.field1115[class85.field1117] | class85.field1115[class85.field1117 + 1]); | |
return 1; | |
} | |
if (n == 4018) { | |
class85.field1117 -= 3; | |
class85.field1115[++class85.field1117 - 1] = (int)(class85.field1115[class85.field1117 + 2] * (long)class85.field1115[class85.field1117] / class85.field1115[class85.field1117 + 1]); | |
return 1; | |
} | |
return 2; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment