x.java
来自「很好的3款手机游戏源码」· Java 代码 · 共 2,135 行 · 第 1/4 页
JAVA
2,135 行
{
case 1: // '\001'
case 50: // '2'
k--;
if (k < 0)
k = 2;
break;
case 6: // '\006'
case 56: // '8'
k++;
if (k > 2)
k = 0;
break;
case 8: // '\b'
case 53: // '5'
switch (k)
{
case 0: // '\0'
o.a(7, 0, a_int_static, b_int_static);
break;
case 1: // '\001'
n.c_boolean_static = !n.c_boolean_static;
n.c();
break;
case 2: // '\002'
n.a(n.f);
if (n.c_boolean_static)
{
if (g.a != null)
g.a.e();
if (a.a != null)
a.a.e();
}
o.a(7, 0, 2, 0);
break;
}
break;
}
switch (n.h)
{
case -7:
c_int_static = 0;
break;
}
}
private static void u()
{
if (_DD6 != _B_B._BB[6])
return;
switch (n.h)
{
case -6:
c_int_static = 1;
break;
case -7:
c_boolean_static = !c_boolean_static;
break;
}
switch (n.i)
{
case 8: // '\b'
case 53: // '5'
switch (m)
{
case 2: // '\002'
case 3: // '\003'
case 4: // '\004'
case 5: // '\005'
case 6: // '\006'
case 12: // '\f'
case 14: // '\016'
case 16: // '\020'
case 17: // '\021'
case 18: // '\022'
default:
break;
case 13: // '\r'
c_int_static = 2;
break;
case 19: // '\023'
c_int_static = 3;
z();
break;
case 1: // '\001'
case 15: // '\017'
c_int_static = 4;
break;
case 7: // '\007'
if (j.b_byte_static > 0)
{
j.n++;
j.j();
j.b_byte_static--;
}
break;
case 9: // '\t'
if (j.b_byte_static > 0)
{
j.r++;
j.j();
j.b_byte_static--;
}
break;
case 8: // '\b'
if (j.b_byte_static > 0)
{
j.p++;
j.j();
j.b_byte_static--;
}
break;
case 10: // '\n'
if (j.b_byte_static > 0)
{
j.t++;
j.j();
j.b_byte_static--;
}
break;
case 11: // '\013'
if (j.b_byte_static > 0)
{
j.v++;
j.j();
j.b_byte_static--;
}
break;
}
break;
}
}
public static void d()
{
if (_DD6 != _B_B._BB[6])
{
return;
} else
{
B();
x();
w();
v();
return;
}
}
private static void v()
{
if (_DD6 != _B_B._BB[6])
return;
if (d_int_static == 2)
if (a_boolean_static)
{
if (z > e.b - 24)
{
y -= 8;
B++;
if (B >= 3)
B = 0;
}
} else
if (b_boolean_static && y < 24)
{
y += 8;
A++;
if (A >= 3)
A = 0;
}
}
private static void w()
{
if (_DD1 != _B_B._BB[1])
return;
U -= 4;
if (U < 0 - T)
U = e.a;
}
private static void x()
{
if (_DD7 != _B_B._BB[7])
return;
if (a_u_static == null)
a_u_static = new u("/cursor.ani");
switch (R)
{
default:
break;
case 1: // '\001'
if (Q >= S)
Q -= S;
break;
case 2: // '\002'
if (Q <= e.b - S)
Q += S;
break;
case 3: // '\003'
if (P >= S)
P -= S;
break;
case 4: // '\004'
if (P <= e.a - S)
P += S;
break;
}
a_u_static.a();
if (a_u_static.a == -1)
a_u_static.a(0, P, Q);
else
a_u_static.a(P, Q);
int i1 = 0;
do
{
if (i1 >= a_f_array1d_static.length)
break;
if (n.a(P, Q, 0, 0, i + a_f_array1d_static[i1].a_byte + r, j + a_f_array1d_static[i1].b + s, a_f_array1d_static[i1].c, a_f_array1d_static[i1].d))
{
if (m != i1)
{
m = i1;
y();
}
break;
}
i1++;
} while (true);
}
private static void y()
{
if (_DD7 != _B_B._BB[7])
return;
StringBuffer stringbuffer = new StringBuffer("status.");
switch (m)
{
case 1: // '\001'
case 15: // '\017'
stringbuffer.append("intro_Heal");
break;
case 7: // '\007'
case 8: // '\b'
case 9: // '\t'
case 10: // '\n'
case 11: // '\013'
stringbuffer.append("intro_Para");
break;
case 12: // '\f'
stringbuffer.append("intro_Point");
break;
case 13: // '\r'
stringbuffer.append("intro_Item");
break;
case 19: // '\023'
stringbuffer.append("intro_Food");
break;
}
a_java_lang_StringBuffer_static = null;
if (stringbuffer.toString().equals("status."))
{
stringbuffer = null;
} else
{
a_java_lang_StringBuffer_static = new StringBuffer(n.a_p_static.a(stringbuffer.toString()));
T = n.a_javax_microedition_lcdui_Font_static.stringWidth(a_java_lang_StringBuffer_static.toString());
U = e.a;
}
}
private static void z()
{
if (_DD4 != _B_B._BB[4])
return;
b_int_array1d_static = new int[6];
c_int_array1d_static = new int[6];
if (c.a_byte_array2d_static[E][1] > 0)
{
b_int_array1d_static[2] = 1;
c_int_array1d_static[2] = 1;
} else
if (c.a_byte_array2d_static[E][1] < 0)
{
b_int_array1d_static[2] = 1;
c_int_array1d_static[2] = -1;
}
if (c.a_byte_array2d_static[E][3] > 0)
{
b_int_array1d_static[0] = 1;
c_int_array1d_static[0] = 1;
b_int_array1d_static[3] = 1;
c_int_array1d_static[3] = 1;
b_int_array1d_static[5] = 1;
c_int_array1d_static[5] = 1;
} else
if (c.a_byte_array2d_static[E][3] < 0)
{
b_int_array1d_static[0] = 1;
c_int_array1d_static[0] = -1;
b_int_array1d_static[3] = 1;
c_int_array1d_static[3] = -1;
b_int_array1d_static[5] = 1;
c_int_array1d_static[5] = -1;
}
if (c.a_byte_array2d_static[E][4] > 0)
{
b_int_array1d_static[4] = 1;
c_int_array1d_static[4] = 1;
} else
if (c.a_byte_array2d_static[E][4] < 0)
{
b_int_array1d_static[4] = 1;
c_int_array1d_static[4] = -1;
}
if (c.a_byte_array2d_static[E][5] > 0)
{
b_int_array1d_static[1] = 1;
c_int_array1d_static[1] = 1;
} else
if (c.a_byte_array2d_static[E][5] < 0)
{
b_int_array1d_static[1] = 1;
c_int_array1d_static[1] = -1;
}
}
private static void A()
{
if (_DD5 != _B_B._BB[5])
return;
d_int_array1d_static = null;
d_int_array1d_static = new int[6];
v v1 = new v();
if (v < 3)
v1 = j.b_v_array1d_static[v];
else
v1 = j.a_v_array1d_static[v - 3];
int i1 = 0;
for (int j1 = 0; j1 < 5; j1++)
if (v1.a_byte_array1d[j1] != 0)
{
d_int_array1d_static[i1] = j1 + 1;
i1++;
}
i1 = 3;
for (int k1 = 5; k1 < 14; k1++)
if (v1.a_byte_array1d[k1] != 0)
{
d_int_array1d_static[i1] = k1 + 1;
i1++;
}
}
private static void B()
{
if (_DD6 != _B_B._BB[6])
return;
if (l < k * 14)
{
int i1 = (k * 14 - l) / 2;
if (i1 < 1)
i1 = 1;
l += i1;
}
if (l > k * 14)
{
int j1 = (l - k * 14) / 2;
if (j1 < 1)
j1 = 1;
l -= j1;
}
if (n < a_f_array1d_static[m].a_byte + r)
{
int k1 = ((a_f_array1d_static[m].a_byte + r) - n) / 2;
if (k1 < 1)
k1 = 1;
n += k1;
}
if (n > a_f_array1d_static[m].a_byte + r)
{
int l1 = (n - a_f_array1d_static[m].a_byte - r) / 2;
if (l1 < 1)
l1 = 1;
n -= l1;
}
if (o < a_f_array1d_static[m].b + s)
{
int i2 = ((a_f_array1d_static[m].b + s) - o) / 2;
if (i2 < 1)
i2 = 1;
o += i2;
}
if (o > a_f_array1d_static[m].b + s)
{
int j2 = (o - a_f_array1d_static[m].b - s) / 2;
if (j2 < 1)
j2 = 1;
o -= j2;
}
if (p < a_f_array1d_static[m].c)
{
int k2 = (a_f_array1d_static[m].c - p) / 2;
if (k2 < 1)
k2 = 1;
p += k2;
}
if (p > a_f_array1d_static[m].c)
{
int l2 = (p - a_f_array1d_static[m].c) / 2;
if (l2 < 1)
l2 = 1;
p -= l2;
}
if (q < a_f_array1d_static[m].d)
{
int i3 = (a_f_array1d_static[m].d - q) / 2;
if (i3 < 1)
i3 = 1;
q += i3;
}
if (q > a_f_array1d_static[m].d)
{
int j3 = (q - a_f_array1d_static[m].d) / 2;
if (j3 < 1)
j3 = 1;
q -= j3;
}
if (t + v * e.d < 50)
t += e.d;
if (t + v * e.d >= 50 + e.d)
t -= e.d;
if (u < t)
{
int k3 = (t - u) / 2;
if (k3 < 1)
k3 = 1;
u += k3;
}
if (u > t)
{
int l3 = (u - t) / 2;
if (l3 < 1)
l3 = 1;
u -= l3;
}
if (C + E * e.d < 46)
C += e.d;
if (C + E * e.d >= 46 + e.d)
C -= e.d;
if (D < C)
{
int i4 = (C - D) / 2;
if (i4 < 1)
i4 = 1;
D += i4;
}
if (D > C)
{
int j4 = (D - C) / 2;
if (j4 < 1)
j4 = 1;
D -= j4;
}
if (x < w * 14)
{
int k4 = (w * 14 - x) / 2;
if (k4 < 1)
k4 = 1;
x += k4;
}
if (x > w * 14)
{
int l4 = (x - w * 14) / 2;
if (l4 < 1)
l4 = 1;
x -= l4;
}
if (G < F * 14)
{
int i5 = (F * 14 - G) / 2;
if (i5 < 1)
i5 = 1;
G += i5;
}
if (G > F * 14)
{
int j5 = (G - F * 14) / 2;
if (j5 < 1)
j5 = 1;
G -= j5;
}
if (I < H * 14)
{
int k5 = (H * 14 - I) / 2;
if (k5 < 1)
k5 = 1;
I += k5;
}
if (I > H * 14)
{
int l5 = (I - H * 14) / 2;
if (l5 < 1)
l5 = 1;
I -= l5;
}
}
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?