f.java

j2me武林传之刀剑江湖录[中篇]反编译的源代码

				if (D() && !ab())
					super.p[1] += B();
			}
			if (super.e[3] != 5)
				return;
			if (ai && super.p[0] == 4)
			{
				b((short)14);
				return;
			}
			if (t())
				b((short)0);
		}
	}

	public void n()
	{
		G();
		if (t())
		{
			if (super.x == 1)
				b((short)21);
			else
				b((short)0);
			super.x = 0;
			super.w = 0;
		}
	}

	public final void N()
	{
		super.o++;
		if (aa == 11 && !c(4096))
			ai = true;
		if (z())
			a(super.e[14], z.d[super.e[6]].d(super.e[7], super.p[0]), super.j, super.k);
		if (ai && super.p[0] == 5)
		{
			b((short)18);
			return;
		}
		if (t())
		{
			if ((i.a(super.e[8], super.e[9]) & 4) == 4)
			{
				int j;
				if ((j = e(super.j, super.k)) == -1)
				{
					b((short)8);
					super.l = k.m();
				} else
				{
					z z1;
					(z1 = k.u[j]).b((short)1);
					b((short)23);
				}
				return;
			}
			b((short)23);
		}
	}

	public final void O()
	{
		super.o++;
		if (aa == 11 && !c(4096))
			ai = true;
		if (z())
			a(super.e[14], z.d[super.e[6]].d(super.e[7], super.p[0]), super.j, super.k);
		if (ai && super.p[0] == 6)
		{
			b((short)18);
			return;
		}
		if (t())
		{
			if ((i.a(super.e[8], super.e[9]) & 4) == 4)
			{
				int j;
				if ((j = e(super.j, super.k)) == -1)
				{
					b((short)8);
					super.l = k.m();
				} else
				{
					z z1;
					(z1 = k.u[j]).b((short)1);
					b((short)23);
				}
				return;
			}
			b((short)23);
		}
	}

	public final void P()
	{
		short word0 = super.f[2];
		super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
		f(super.e[14]);
		super.f[2] = word0;
		if (t())
			b((short)0);
	}

	public final void Q()
	{
		super.o++;
		super.w = 6;
		if (aa == 9)
		{
			if (!c(4096))
			{
				ai = true;
				return;
			}
		} else
		{
			if (z())
			{
				E();
				if (D() && !ab())
					super.p[1] += B();
			}
			if (super.e[3] != 14)
				return;
			if (ai && super.p[0] == 4)
			{
				b((short)16);
				return;
			}
			if (t())
				b((short)0);
		}
	}

	public final void R()
	{
		super.o++;
		super.w = 6;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 15)
			return;
		if (t())
		{
			aj = 9;
			b((short)0);
		}
	}

	public final void S()
	{
		super.o++;
		super.w = 6;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 16)
			return;
		if (t())
			b((short)0);
	}

	public final void T()
	{
		super.o++;
		super.w = 6;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 17)
			return;
		if (t())
			b((short)0);
	}

	public final void U()
	{
		if (ab != -1 && super.e[14] != ab)
			c(ab);
		if (aa == 8)
		{
			ai = true;
			return;
		}
		f(super.e[14]);
		if (t())
		{
			if (ai)
			{
				b((short)15);
				c(w());
				return;
			}
			b((short)0);
			c(w());
		}
	}

	public void p()
	{
		super.o++;
		if (super.l != -1 && k.j(super.l))
		{
			k.i(super.l);
			super.l = -1;
			b(16);
		}
		if (t())
		{
			b(128);
			a(256);
			b(8);
			super.p[0] = 4;
			super.p[1] = 0;
		}
	}

	public final void V()
	{
		super.o++;
		if (ab != -1 && super.e[14] != ab)
			c(ab);
		if (aa == -1)
		{
			ak--;
			if (ak <= 0)
				b((short)0);
		}
		if (aa == 3)
		{
			if (!c(8192))
				b((short)10);
		} else
		if (aa == 12 && !c(4096))
			b((short)19);
		if (super.e[3] != 12)
		{
			return;
		} else
		{
			int j = super.e[16];
			int i1 = super.f[2];
			super.f[2] = (short)j;
			f(super.e[14]);
			super.f[2] = (short)i1;
			return;
		}
	}

	public final void W()
	{
		super.o++;
		super.w = 3;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 18)
			return;
		if (t())
		{
			if ((i.a(super.e[8], super.e[9]) & 4) == 4)
			{
				b((short)8);
				super.l = k.m();
				return;
			}
			b((short)0);
		}
	}

	public final void X()
	{
		super.o++;
		super.w = 2;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 19)
			return;
		if (t())
			b((short)0);
	}

	public final void Y()
	{
		super.o++;
		super.w = 1;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 20)
			return;
		if (t())
			b((short)0);
	}

	public final void Z()
	{
		super.o++;
		int j = super.f[2];
		super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
		f(super.e[14]);
		super.f[2] = (short)j;
		if (t())
		{
			c(w());
			b((short)0);
		}
	}

	public final int aa()
	{
		short word0 = -1;
		while (super.f[10] >= super.f[24] && super.f[24] > 0) 
		{
			super.f[10] -= super.f[24];
			if ((word0 = super.f[0]) < 70)
			{
				word0++;
				a(0, "升至" + word0 + "级");
			} else
			{
				a(0, "已升至最高70等级");
			}
			a(word0, false);
			ag = true;
		}
		return word0;
	}

	public final void a(short word0, boolean flag)
	{
		boolean flag1 = false;
		boolean flag2 = false;
		if (!flag)
		{
			int j = super.f[7];
			h((short)j);
			f((short)(word0 - 1));
		}
		super.f[0] = word0;
		g(word0);
		super.f[4] = super.f[5];
		super.f[6] = super.f[7];
		i(super.f[7]);
		super.f[24] = (short)(word0 * word0 * 5 + 50);
		super.f[25]++;
		super.f[0] = word0;
		if (flag)
			super.f[25] = 0;
	}

	public final void f(short word0)
	{
		super.f[5] -= (short)(word0 * 40 + 50);
		super.f[7] -= (short)(word0 * 2 + 20);
	}

	public final void g(short word0)
	{
		super.f[5] += (short)(word0 * 40 + 50);
		super.f[7] += (short)(word0 * 2 + 20);
	}

	public final void h(short word0)
	{
		super.f[8] -= word0 * 2;
		super.f[9] -= (word0 * 7) / 10;
	}

	public final void i(short word0)
	{
		super.f[8] += (short)(word0 * 2);
		super.f[9] += (short)((word0 * 7) / 10);
	}

	public final boolean ab()
	{
		boolean flag = false;
		short aword0[] = x();
		Object obj = null;
		for (int j = 0; j < k.v; j++)
		{
			z z1;
			if ((z1 = k.u[k.w[j]]) != null && z1.c(8) && (k.l[z1.e[0]] & 1) == 1 && !z1.c(128) && !z1.c(256) && v.a(aword0, z1.y()) && z1.a(this))
				flag = true;
		}

		return flag;
	}

	public void I()
	{
		aa = -1;
		ab = -1;
		short word0 = super.p[0];
		switch (super.e[3])
		{
		case 0: // '\0'
			if (a.c(16384))
			{
				if (aj < 6)
				{
					aa = 8;
					ab = super.e[14];
				} else
				{
					aa = 6;
					ab = super.e[14];
				}
			} else
			if (a.b(1))
			{
				aa = 1;
				ab = 2;
				ak = 5;
			} else
			if (a.b(2))
			{
				aa = 1;
				ab = 3;
				ak = 5;
			} else
			if (a.b(4))
			{
				aa = 1;
				ab = 0;
				ak = 5;
			} else
			if (a.b(8))
			{
				aa = 1;
				ab = 1;
				ak = 5;
			} else
			if (a.a(1))
			{
				aa = 0;
				ab = 2;
			} else
			if (a.a(2))
			{
				aa = 0;
				ab = 3;
			} else
			if (a.a(4))
			{
				aa = 0;
				ab = 0;
			} else
			if (a.a(8))
			{
				aa = 0;
				ab = 1;
			} else
			if (a.c(1))
				ab = 2;
			else
			if (a.c(2))
				ab = 3;
			else
			if (a.c(4))
				ab = 0;
			else
			if (a.c(8))
				ab = 1;
			else
			if (a.c(64))
			{
				aa = 3;
				ab = super.e[14];
			} else
			if (a.c(32))
			{
				aa = 2;
				ab = w();
			} else
			if (a.c(512))
			{
				if (!c(4096) && super.f[6] >= o.h((byte)1))
				{
					aa = 13;
					ab = super.e[14];
					super.f[6] -= o.h((byte)1);
				} else
				if (super.f[6] < o.h((byte)1))
					p.d();
			} else
			if (a.c(256))
			{
				aa = 10;
				ab = super.e[14];
			}
			break;

		case 1: // '\001'
			if (a.c(64))
			{
				aa = 3;
				ab = super.e[14];
			} else
			if (a.c(128) || a.c(16384))
			{
				aa = 6;
				ab = super.e[14];
			} else
			if (a.a(1))
			{
				aa = 0;
				ab = 2;
			} else
			if (a.a(2))
			{
				aa = 0;
				ab = 3;
			} else
			if (a.a(4))
			{
				aa = 0;
				ab = 0;
			} else
			if (a.a(8))
			{
				aa = 0;
				ab = 1;
			}
			break;

		case 5: // '\005'
			if (a.c(16384) && word0 >= 3 && word0 <= 4)
			{
				aa = 7;
				ab = super.e[14];
			}
			break;

		case 14: // '\016'
			if (a.c(16384) && word0 >= 3 && word0 <= 4)
			{
				aa = 9;
				ab = super.e[14];
			}
			break;

		case 16: // '\020'
			if (a.c(16384))
			{
				aa = 9;
				ab = super.e[14];
			}
			break;

		case 17: // '\021'
			if (a.c(16384))
			{
				aa = 10;
				ab = super.e[14];
			}
			break;

		case 9: // '\t'
			if (a.c(16384) && word0 >= 0 && word0 <= 5)
				if (!c(4096) && super.f[6] >= o.h((byte)3))
				{
					aa = 11;
					ab = super.e[14];
					super.f[6] -= o.h((byte)3);
				} else
				if (super.f[6] < o.h((byte)3))
					p.d();
			break;

		case 10: // '\n'
			if (a.c(16384) && word0 >= 0 && word0 <= 6)
				if (!c(4096) && super.f[6] >= o.h((byte)3))
				{
					aa = 11;
					ab = super.e[14];
					super.f[6] -= o.h((byte)3);
				} else
				if (super.f[6] < o.h((byte)3))
					p.d();
			break;

		case 11: // '\013'
			if (a.c(16384))
			{
				aa = 8;
				ab = super.e[14];
			}
			break;

		case 12: // '\f'
			if (a.c(64))
			{
				aa = 3;
				ab = super.e[14];
			} else
			if (a.c(16384))
			{
				if (!c(4096) && super.f[6] >= o.h((byte)2))
				{
					aa = 12;
					ab = super.e[14];
					super.f[6] -= o.h((byte)2);
				} else
				if (super.f[6] < o.h((byte)2))
					p.d();
			} else
			if (a.a(1))
			{
				if (2 != w())
				{
					aa = 1;
					ab = 2;
					ak = 5;
				} else
				{
					ak = 0;
				}
			} else
			if (a.a(2))
			{
				if (3 != w())
				{
					aa = 1;
					ab = 3;
					ak = 5;
				} else
				{
					ak = 0;
				}
			} else
			if (a.a(4))
			{
				if (0 != w())
				{
					aa = 1;
					ab = 0;
					ak = 5;
				} else
				{
					ak = 0;
				}
			} else
			if (a.a(8))
				if (1 != w())
				{
					aa = 1;
					ab = 1;
					ak = 5;
				} else
				{
					ak = 0;
				}
			break;
		}
		if (a.c(16))
		{
			k.U++;
			if (k.U > 3)
				k.U = 0;
			switch (k.U)
			{
			case 0: // '\0'
				k.V = false;
				k.W = false;
				break;

			case 1: // '\001'
				k.V = false;
				k.W = true;
				break;

			case 2: // '\002'
				k.V = true;
				k.W = true;
				break;

			case 3: // '\003'
				k.V = true;
				k.W = false;
				break;
			}
		}
		int j;
		if (a.c(1024))
			if ((j = Y[0]) > 0)
				v(0);
			else
			if ((j = Y[1]) > 0)
				v(1);
		if (a.c(2048))
			if ((j = Y[6]) > 0)
				v(6);
			else
			if ((j = Y[7]) > 0)
				v(7);
		if (aa == 3)
		{
			ae = super.e[8];
			af = super.e[9];
		}
	}

	public final void d(z z1)
	{
		super.f[10] += z1.f[10];
		aa();
	}

	public byte[][] g()
	{
		return (byte[][])null;
	}

	private void ag()
	{
		for (int j = 0; j < al.length; j++)
			al[j] = -1;

	}

	public final boolean ac()
	{
		switch (super.e[3])
		{
		case 0: // '\0'
		case 1: // '\001'
		case 3: // '\003'
		case 4: // '\004'
		case 12: // '\f'
			return true;

		case 2: // '\002'
		case 5: // '\005'
		case 6: // '\006'
		case 7: // '\007'
		case 8: // '\b'
		case 9: // '\t'
		case 10: // '\n'
		case 11: // '\013'
		default:
			return false;
		}
	}

	public final int e(int j, int i1)
	{
		Object obj = null;
		for (int j1 = 0; j1 < k.v; j1++)
		{
			z z1;
			if ((z1 = k.u[k.w[j1]]) != null && z1.e[0] == 43 && z1.f())
				return z1.e[1];
		}

		return -1;
	}

	public final int ad()
	{
		if (super.w == 6)
			return super.f[8];
		else
			return super.f[8] + o.a(super.w, (byte)0);
	}

}