aa.java

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

// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 

import javax.microedition.lcdui.Graphics;

public final class aa extends y
{

	public static final short a[][] = {
		{
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			6, 6, 7, 8, 36, 36, 37, 38
		}, {
			12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 
			19, 20
		}, {
			9, 9, 10, 11
		}, {
			24, 24, 25, 26, 27, 27, 28, 29
		}, {
			3, 3, 4, 5
		}, {
			33, 33, 34, 35
		}, {
			30, 30, 31, 32
		}, {
			21, 21, 22, 23
		}
	};
	public static final short b[][] = {
		{
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, {
			6, 6, 7, 8, 21, 21, 21, 21
		}, {
			12, 12, 13, 14, 15, 15, 16, 17
		}, {
			9, 9, 10, 11
		}, {
			18, 18, 19, 20
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, new short[0]
	};
	public static final short c[][] = {
		{
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			6, 6, 7, 8
		}, {
			12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 
			19, 20
		}, {
			9, 9, 10, 11
		}, {
			24, 24, 25, 26, 27, 27, 28, 29
		}, {
			3, 3, 4, 5
		}, {
			33, 33, 34, 35
		}, {
			30, 30, 31, 32
		}, {
			21, 21, 22, 23
		}
	};
	public static final short d[][] = {
		{
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}, {
			0, 0, 1, 2
		}, {
			3, 3, 4, 5
		}, {
			6, 6, 7, 8
		}, {
			12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 
			19, 20
		}, {
			9, 9, 10, 11
		}, {
			24, 24, 25, 26, 27, 27, 28, 29
		}, {
			3, 3, 4, 5
		}, {
			33, 33, 34, 35
		}, {
			30, 30, 31, 32
		}, {
			21, 21, 22, 23
		}
	};
	private int W;
	private int X;
	private int Y;

	public aa(int i)
	{
		W = i;
	}

	public final void a()
	{
		super.g = new short[36];
		super.f[14] = super.f[14];
		super.g[2] = super.f[16];
		super.g[5] = super.f[15];
		super.g[4] = super.f[15];
		super.g[8] = super.f[24];
		super.g[27] = super.f[39];
		super.g[24] = super.f[23];
		super.g[25] = super.f[22];
		super.g[22] = super.f[19];
		super.g[23] = super.f[18];
		super.g[28] = super.f[40];
		super.g[9] = super.f[25];
		super.g[29] = super.f[28];
		super.g[21] = super.f[33];
		super.g[26] = super.f[26];
		super.g[35] = super.f[41];
		super.g[19] = super.f[42];
		super.g[11] = super.f[31];
		super.g[10] = super.f[32];
		super.g[20] = super.f[43];
		switch (super.f[35])
		{
		case 0: // '\0'
			super.g[12] = super.f[34];
			super.g[14] = -1;
			super.g[13] = -1;
			break;

		case 2: // '\002'
			super.g[12] = -1;
			super.g[14] = super.f[34];
			super.g[13] = -1;
			break;

		case 1: // '\001'
			super.g[12] = -1;
			super.g[14] = -1;
			super.g[13] = super.f[34];
			break;
		}
		super.g[18] = super.f[36];
		switch (super.f[37])
		{
		case 5: // '\005'
			super.g[17] = super.f[38];
			super.g[15] = -1;
			super.g[16] = -1;
			return;

		case 4: // '\004'
			super.g[16] = super.f[38];
			super.g[15] = -1;
			super.g[17] = -1;
			return;

		case 3: // '\003'
			super.g[15] = super.f[38];
			super.g[16] = -1;
			super.g[17] = -1;
			break;
		}
	}

	public final boolean b()
	{
		if (X > 0)
			X--;
		if (super.b())
			return true;
		switch (super.f[3])
		{
		case 10: // '\n'
			J();
			return true;

		case 9: // '\t'
			I();
			return true;

		case 11: // '\013'
			K();
			return true;

		case 12: // '\f'
			H();
			return true;
		}
		return false;
	}

	public final void b(short word0)
	{
		super.b(word0);
	}

	public final void c()
	{
		if (super.f[3] == 2)
		{
			super.q[1] = 0;
			super.q[0] = 0;
			return;
		}
		byte byte0 = 0;
		switch (super.f[3])
		{
		case 6: // '\006'
			if (W == 3 && super.y == 2)
				super.y = 1;
			byte0 = super.y;
			break;

		case 5: // '\005'
			byte0 = super.x;
			break;

		case 8: // '\b'
			byte0 = super.z;
			break;
		}
		switch (W)
		{
		case 0: // '\0'
			super.d(a[super.f[3]][(byte0 << 2) + super.f[14]]);
			break;

		case 3: // '\003'
			super.d(b[super.f[3]][(byte0 << 2) + super.f[14]]);
			break;

		case 1: // '\001'
			super.d(c[super.f[3]][(byte0 << 2) + super.f[14]]);
			break;

		case 2: // '\002'
			super.d(d[super.f[3]][(byte0 << 2) + super.f[14]]);
			break;
		}
		if (super.f[3] == 6 && super.y == 2)
		{
			byte byte1 = 0;
			switch (super.f[14])
			{
			case 2: // '\002'
				byte1 = 3;
				break;

			case 3: // '\003'
				byte1 = 2;
				break;

			case 1: // '\001'
				byte1 = 0;
				break;

			case 0: // '\0'
				byte1 = 1;
				break;
			}
			int ai[] = y.b(byte1, super.f[8], super.f[9], y.c(super.f[6], super.f[7]));
			super.k = ai[0];
			super.l = ai[1];
		}
	}

	public final void d()
	{
		if (Y > 0)
		{
			Y--;
			return;
		}
		if (super.Q[2])
			return;
		if (M())
		{
			b((short)9);
			return;
		} else
		{
			b((short)1);
			return;
		}
	}

	public final void e()
	{
		boolean flag;
		if (!(flag = e(super.f[14])))
		{
			c(u());
			Y = 10;
			b((short)0);
		}
		if (M())
		{
			b((short)9);
			return;
		}
		if (s())
		{
			int i = u.b(4);
			c((short)i);
			Y = 10;
			b((short)0);
		}
	}

	public final void n()
	{
		super.p++;
		boolean flag = false;
		switch (super.y)
		{
		case 0: // '\0'
			D();
			break;

		case 1: // '\001'
			E();
			break;

		case 2: // '\002'
			if (x())
			{
				byte byte0 = 0;
				switch (super.f[14])
				{
				case 2: // '\002'
					byte0 = 3;
					break;

				case 3: // '\003'
					byte0 = 2;
					break;

				case 1: // '\001'
					byte0 = 0;
					break;

				case 0: // '\0'
					byte0 = 1;
					break;
				}
				a(byte0, y.e[super.f[6]].d(super.f[7], super.q[0]), super.k, super.l);
			}
			if (super.q[0] + 1 >= y.e[super.f[6]].c[super.f[7]] && super.q[1] > 20 && u.a(1, 100))
				flag = true;
			break;
		}
		if (flag || super.p > 1 && s())
		{
			if (super.y == 2)
				if ((h.a(super.f[8], super.f[9]) & 4) == 4)
				{
					a(128);
					k.s.d(this);
					b((short)8);
					super.m = k.f();
					return;
				} else
				{
					b((short)12);
					return;
				}
			Y = 10;
			b((short)0);
		}
	}

	public final void H()
	{
		if (s())
			b((short)11);
	}

	public final void m()
	{
		if (x())
		{
			C();
			if (B() && !N())
				super.q[1] += z();
		}
		if (s())
		{
			X = super.g[27];
			b((short)0);
		}
	}

	public final void o()
	{
		short word0 = super.g[2];
		super.g[2] = (short)y.e[super.f[6]].d(super.f[7], super.q[0]);
		e(u());
		super.g[2] = word0;
		if (s())
		{
			if (u.a(super.g[29]))
			{
				switch (W)
				{
				case 0: // '\0'
				case 3: // '\003'
					super.x = 0;
					break;

				case 1: // '\001'
				case 2: // '\002'
					super.x = 0;
					break;
				}
				b((short)5);
				return;
			}
			b((short)0);
		}
	}

	public final void p()
	{
		if (super.m != -1 && k.h(super.m))
		{
			k.g(super.m);
			super.m = -1;
			b(16);
		}
		if (s() && h.a(super.f[8], super.f[9]) == 0)
		{
			int i = (super.f[8] / h.d()) * h.d() + 1;
			int j = (super.f[9] / h.e()) * h.e() + 1;
			int l = (i + h.d()) - 2;
			int i1 = (j + h.d()) - 2;
			t t1;
			if (u.a(super.f[29]) && super.f[30] >= 0)
				(t1 = t.a((byte)-1, super.f[30])).a((short)i, (short)j);
			if (u.a(super.f[29]) && super.g[11] > 0)
				(t1 = t.a((byte)2, super.g[11])).a((short)l, (short)i1);
		}
		super.p();
	}

	public final void I()
	{
		super.p++;
		if ((super.p == 1 || s()) && super.B == 0)
		{
			c(c(k.s));
			super.B = (byte)super.g[35];
		}
		boolean flag = e(super.f[14]);
		if (!M() || !flag)
		{
			Y = 15;
			b((short)0);
		}
		if (L() && X == 0)
		{
			if (u.a(super.g[26]) && (W == 0 || W == 3))
			{
				super.x = 1;
				b((short)5);
				return;
			}
			super.x = 0;
			b((short)5);
		}
	}

	public final void J()
	{
		if (s())
			b((short)0);
	}

	public final void K()
	{
		if (s())
			b((short)10);
	}

	public final boolean L()
	{
		int i = 0;
		int j = 0;
		int l = 0;
		int i1 = 0;
		switch (super.f[14])
		{
		case 2: // '\002'
			i = super.f[8] - (super.g[24] >> 1);
			j = super.f[9] - super.g[25];
			l = i + super.g[24];
			i1 = j + super.g[25];
			break;

		case 0: // '\0'
			i = super.f[8] - super.g[25];
			j = super.f[9] - (super.g[24] >> 1);
			l = i + super.g[25];
			i1 = j + super.g[24];
			break;

		case 3: // '\003'
			i = super.f[8] - (super.g[24] >> 1);
			j = super.f[9];
			l = i + super.g[24];
			i1 = j + super.g[25];
			break;

		case 1: // '\001'
			i = super.f[8];
			j = super.f[9] - (super.g[24] >> 1);
			l = i + super.g[25];
			i1 = j + super.g[24];
			break;
		}
		for (int j1 = 0; j1 < k.q.length; j1++)
			if (u.a(((y) (k.q[j1])).f[8], ((y) (k.q[j1])).f[9], i, j, l, i1))
				return true;

		return false;
	}

	public final boolean M()
	{
		return u.a(y.i(super.f[14]), super.f[8], super.f[9], super.g[22], super.g[23], ((y) (k.s)).f[8], ((y) (k.s)).f[9]);
	}

	public final boolean N()
	{
		boolean flag = false;
		for (int i = 0; i < k.q.length; i++)
			if (u.a(v(), k.q[i].w()) && k.q[i].a(this))
				flag = true;

		return flag;
	}

	public final boolean a(y y1)
	{
		if (super.f[3] == 7 || super.f[3] == 2 || super.f[3] == 6 && super.A > 0 || super.f[3] == 11 && y1.x != 3)
			return false;
		int i = 0;
		if (c(k.s) == super.f[14])
			i = super.g[28];
		else
		if (u() == c(k.s))
			i = super.g[28] / 3;
		else
			i = (super.g[28] / 3) * 2;
		if (u.a(i) && super.f[3] != 11)
		{
			c(c(y1));
			b((short)7);
			if (y1.x == 6 && y1.f[3] != 22)
				y1.b((short)22);
			return false;
		}
		if (super.f[3] == 11)
		{
			f(-super.g[4] - 1);
			a(super.g[4], null);
			a(0, "一击必杀");
			if (c(128))
			{
				k.s.d(this);
				super.z = 1;
				b((short)8);
			}
			return true;
		} else
		{
			return super.a(y1);
		}
	}

	public final byte[][] g()
	{
		return (new byte[][] {
			y.M, new byte[0]
		});
	}

	public final void a(Graphics g1, int i, int j)
	{
		if (super.m != -1)
		{
			k.b(g1, super.m, i, j);
			return;
		} else
		{
			super.a(g1, i, j);
			return;
		}
	}

}