📄 i.java
字号:
// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi
package kof;
import java.io.PrintStream;
// Referenced classes of package kof:
// Z, C, Kof
class I extends Z
{
I(C c)
{
super(c);
X = 1;
Y = 16;
i = 14;
z = 15;
W = (new int[][] {
new int[] {
-6, -50, 12, 14, 17, 35, -1, -1, -1, -1
}, new int[] {
0, -50, 12, 17, 18, 32, 36, 25, 12, 10
}, new int[] {
-6, -50, 10, 20, 23, 29, -1, -1, -1, -1
}, new int[] {
0, -50, 6, 11, 14, 20, -1, -1, -1, -1
}, new int[] {
-9, -50, 14, 4, 19, 37, -1, -1, -1, -1
}, new int[] {
-9, -50, 14, 4, 19, 37, -1, -1, -1, -1
}, new int[] {
-9, -50, 14, 4, 19, 37, -1, -1, -1, -1
}, new int[] {
-9, -50, 7, 20, 27, 27, 27, 40, 21, 9
}, new int[] {
-8, -50, 16, 10, 17, 39, -1, -1, -1, -1
}, new int[] {
0, -50, 8, 8, 10, 20, -1, -1, -1, -1
}, new int[] {
-6, -50, 7, 14, 14, 17, -1, -1, -1, -1
}, new int[] {
0, -50, 6, 11, 14, 20, -1, -1, -1, -1
}, new int[] {
0, -50, 2, 20, 26, 10, -1, -1, -1, -1
}, new int[] {
-5, -50, 5, 6, 28, 39, 25, 31, 23, 14
}, new int[] {
-5, -50, 15, 9, 22, 38, 3, 9, 26, 22
}, new int[] {
-5, -50, 13, 6, 19, 40, 26, 0, 15, 22
}, new int[] {
-5, -50, 6, 9, 14, 22, -1, -1, -1, -1
}
});
}
final void I()
{
E;
JVM INSTR lookupswitch 2: default 295
// 5: 32
// 12: 32;
goto _L1 _L2 _L2
_L1:
break MISSING_BLOCK_LABEL_295;
_L2:
if(G != 0)
break MISSING_BLOCK_LABEL_295;
if(N != 1) goto _L4; else goto _L3
_L3:
if(U > 0 && super.I.D() && super.I.I(0) == 0)
{
super.I.K = System.currentTimeMillis() + 1000L;
U--;
I(16);
E = 0;
R = true;
return;
}
if(super.I.B() && super.I.I(0) == 0)
{
I(14);
E = 0;
return;
}
if(super.I.J())
{
I(15);
E = 0;
return;
}
break MISSING_BLOCK_LABEL_295;
_L4:
if(U > 0 && super.I.F() && super.I.I(0) == 0)
{
super.I.K = System.currentTimeMillis() + 1000L;
U--;
I(16);
E = 0;
R = true;
return;
}
if(super.I.J() && super.I.I(0) == 0)
{
I(14);
E = 0;
return;
}
if(super.I.B())
{
I(15);
E = 0;
return;
}
try
{
super.I();
}
catch(Throwable throwable) { }
return;
}
final void I(int i)
{
if(G == i)
return;
try
{
H = i;
G = i;
S = 0;
A = 0;
P = false;
super.B = 0;
super.D = 0;
switch(G)
{
case 0: // '\0'
K = true;
O = 0;
E = 0;
R = false;
break;
case 1: // '\001'
case 7: // '\007'
case 13: // '\r'
P = true;
break;
case 4: // '\004'
super.D = -13;
V = super.I.C() + 500L;
break;
case 6: // '\006'
super.B = -5;
super.D = -13;
break;
case 5: // '\005'
super.B = 5;
super.D = -13;
break;
case 2: // '\002'
super.F = 51;
J = 46;
break;
case 12: // '\f'
super.B = N * -3;
break;
case 15: // '\017'
super.B = 2 * N;
super.D = -13;
P = true;
break;
case 16: // '\020'
super.I.I;
Kof.I("kof.mid.powerup", 0);
break;
}
}
catch(Throwable throwable)
{
System.out.println("Athena Set state: " + throwable);
}
return;
}
final boolean Z()
{
if(G == 15)
return true;
else
return super.Z();
}
final void C()
{
try
{
if(G == 14)
{
if(++A > 1)
{
if(++S >= 2)
I(0);
if(S == 1)
{
super.I.I(R, Q, 2, N, x + S() + E() / 2, y + A());
if(R)
{
super.I.I(R, Q, 2, N, (x + S() + E() / 2) - 2, y + A());
super.I.I(R, Q, 2, N, (x + S() + E() / 2) - 4, y + A());
super.I.I(R, Q, 2, N, (x + S() + E() / 2) - 6, y + A());
R = false;
}
}
A = 0;
}
} else
if(G == 15)
{
if(++A > 2)
{
if(++S >= 2)
S = 1;
A = 0;
}
} else
if(G == 16)
{
if(++S >= 2)
S = 0;
A = 0;
} else
{
super.C();
}
}
catch(Throwable throwable)
{
System.out.println("Ahtena Update animation " + throwable);
}
}
final boolean B()
{
return G == 16;
}
final void D()
{
try
{
if(Q)
{
C _tmp = super.I;
if(C.C == 7)
L();
}
if(G == 15)
{
super.D += M;
if(y + super.D > super.I.i)
{
y = super.I.i;
if(G != 12)
I(0);
super.D = 0;
}
} else
if(G == 16 && super.I.K < System.currentTimeMillis() + 100L)
{
super.I.K = 0L;
I(14);
super.I.X = true;
}
}
catch(Throwable throwable)
{
System.out.println("Arthena Exception e: " + throwable);
}
super.D();
}
final int F()
{
int i = 0;
try
{
i = super.F();
}
catch(Throwable throwable)
{
System.out.println("getSQuare: " + throwable);
}
if(i == 0)
{
if(G == 14)
if(N == 1)
return 18 + S;
else
return 18 + S + 0;
if(G == 15)
if(N == 1)
return 16 + S;
else
return 16 + S + 0;
if(G == 16)
{
if(N == 1)
return 12 + S;
else
return 12 + S + 0;
} else
{
return 0;
}
} else
{
return i;
}
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -