r.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 r extends y
{

	public static final short a[][] = {
		{
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			3, 3, 3, 3
		}, new short[0], {
			0, 0, 0, 0
		}, new short[0], {
			1, 1, 1, 1
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}
	};
	public static final short b[][] = {
		{
			0, 0, 0, 0
		}, {
			2, 2, 2, 2
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			2, 2, 2, 2
		}, {
			1, 1, 1, 1
		}, new short[0], new short[0]
	};
	public static final short c[][] = {
		{
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}, new short[0]
	};
	public static final short d[][] = {
		{
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, new short[0], new short[0], new short[0]
	};
	public static final short W[][] = {
		{
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, new short[0], new short[0], new short[0]
	};
	public static final short X[][] = {
		{
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			0, 0, 0, 0
		}, {
			0, 0, 0, 0
		}, {
			1, 1, 1, 1
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}, new short[0]
	};
	private int Z;
	private int aa;
	private int ab;
	private int ac;
	public int Y;
	private byte ad;

	public r(int i)
	{
		ac = i;
	}

	public final void a()
	{
		super.g = new short[26];
		super.f[14] = super.f[14];
		super.g[2] = super.f[15];
		super.g[22] = super.f[17];
		super.g[23] = super.f[16];
		super.g[24] = super.f[19];
		super.g[25] = super.f[18];
		super.g[8] = super.f[20];
	}

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

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

		case 9: // '\t'
			H();
			return true;
		}
		return false;
	}

	public final void c()
	{
		byte byte0 = 0;
		switch (super.f[3])
		{
		case 5: // '\005'
			byte0 = super.x;
			break;
		}
		switch (ac)
		{
		case 0: // '\0'
			super.d(a[super.f[3]][(byte0 << 2) + super.f[14]]);
			return;

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

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

		case 4: // '\004'
		case 5: // '\005'
			super.d(d[super.f[3]][(byte0 << 2) + super.f[14]]);
			return;

		case 6: // '\006'
			super.d(X[super.f[3]][(byte0 << 2) + super.f[14]]);
			return;

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

	public final void d()
	{
		if (Z > 0)
		{
			Z--;
			return;
		}
		switch (ac)
		{
		case 6: // '\006'
		default:
			break;

		case 2: // '\002'
			int i = Math.abs(((y) (k.s)).f[8] / h.d() - super.f[8] / h.d());
			int j = Math.abs(((y) (k.s)).f[9] / h.e() - super.f[9] / h.e());
			if (i <= 1 && j <= 1 && ((y) (k.s)).f[3] != 0)
			{
				b((short)1);
				return;
			}
			break;

		case 0: // '\0'
		case 1: // '\001'
			b((short)1);
			return;

		case 3: // '\003'
		case 4: // '\004'
		case 5: // '\005'
			if (!f())
				break;
			if (((y) (k.s)).f[8] >= super.f[8])
				c((short)0);
			else
				c((short)1);
			b((short)1);
			break;
		}
	}

	public final void e()
	{
		boolean flag = false;
		boolean flag1 = false;
		boolean flag2 = false;
		boolean flag3 = false;
		switch (ac)
		{
		default:
			break;

		case 0: // '\0'
			if (M())
			{
				b((short)5);
				if (ad++ > 10)
				{
					b((short)0);
					ad = 0;
				}
			}
			e(super.f[14]);
			if (L())
			{
				b((short)10);
				return;
			}
			if (s())
			{
				int l = u.b(2);
				c((short)l);
				Z = 15;
				b((short)0);
				return;
			}
			break;

		case 1: // '\001'
			if (L())
			{
				boolean flag4;
				if (!(flag4 = e(super.f[14])))
					c(u());
				int j1 = super.g[2] + 5;
				int k1 = super.g[2];
				super.g[2] = (short)j1;
				super.g[2] = (short)k1;
				if (M())
					b((short)2);
				return;
			}
			e(super.f[14]);
			if (s())
			{
				int i1 = u.b(2);
				c((short)i1);
				Z = 10;
				b((short)0);
				return;
			}
			break;

		case 4: // '\004'
		case 5: // '\005'
			if (s())
			{
				b((short)2);
				b(16);
				return;
			}
			break;

		case 2: // '\002'
			Math.abs(((y) (k.s)).f[8] / h.d() - super.f[8] / h.d());
			Math.abs(((y) (k.s)).f[9] / h.e() - super.f[9] / h.e());
			if (s())
			{
				b((short)0);
				return;
			}
			break;

		case 6: // '\006'
			if (f())
			{
				if (s())
				{
					b((short)5);
					return;
				}
			} else
			{
				b((short)0);
				return;
			}
			break;

		case 3: // '\003'
			int i = 0;
			int j = 0;
			if (super.f[14] == 1)
			{
				i = super.f[8] + super.g[2];
				j = super.f[9] - super.g[2];
			} else
			if (super.f[14] == 0)
			{
				i = super.f[8] - super.g[2];
				j = super.f[9] - super.g[2];
			}
			if (super.f[8] < 0 || super.f[8] >= h.b() || super.f[9] < 0 || super.f[9] >= h.c())
			{
				b(16);
				b((short)2);
				return;
			}
			a((short)i, (short)j);
			break;
		}
	}

	public final void H()
	{
		if (M())
		{
			b((short)5);
			if (ad++ > 10)
			{
				b((short)0);
				ad = 0;
				return;
			}
		} else
		{
			short word0 = super.g[2];
			super.g[2] = (short)y.e[super.f[6]].d(super.f[7], super.q[0]);
			boolean flag = e(super.f[14]);
			super.g[2] = word0;
			if (!flag)
				c(u());
			if (s())
				b((short)0);
		}
	}

	public final void k()
	{
		if (ac == 1)
		{
			if (s() && !M())
				b((short)0);
			return;
		}
		if (!u.a(super.i, super.j, k.aq[0], k.aq[1], k.aq[2], k.aq[3]))
		{
			a(super.i, super.j);
			a(16);
			b((short)0);
		}
	}

	public final void I()
	{
		short word0 = super.g[2];
		super.g[2] = (short)y.e[super.f[6]].d(super.f[7], super.q[0]);
		boolean flag = e(super.f[14]);
		super.g[2] = word0;
		if (!flag || aa <= 3)
			c(u());
		if (s())
		{
			if (!L())
			{
				b((short)0);
				return;
			}
			if (ab++ > 5)
			{
				b((short)9);
				ab = 0;
				return;
			}
			b((short)10);
		}
	}

	public final void J()
	{
		short word0 = super.g[2];
		super.g[2] = (short)y.e[super.f[6]].d(super.f[7], super.q[0]);
		boolean flag = e(super.f[14]);
		super.g[2] = word0;
		if (!flag || aa >= 3)
			c(u());
		if (s())
		{
			if (!L())
			{
				b((short)0);
				return;
			}
			if (ab++ > 5)
			{
				b((short)9);
				ab = 0;
				return;
			}
			aa++;
			if (aa >= 3)
			{
				b((short)11);
				aa = 0;
				return;
			}
			if (aa <= 3)
			{
				b((short)10);
				aa = 0;
			}
		}
	}

	public final void m()
	{
		if (ac == 6)
		{
			if (s())
			{
				Y = 30;
				b((short)6);
			}
			return;
		}
		if (x())
		{
			C();
			if (B() && !K())
				super.q[1] += z();
		}
		if (s())
			b((short)0);
	}

	public final void n()
	{
		if (ac == 6)
		{
			b(16);
			if (f() && ((y) (k.s)).f[3] == 0)
			{
				k.s.b((short)8);
				k.s.m = k.f();
				k.g();
			}
			Y--;
			if (Y < 0)
			{
				a(16);
				b((short)0);
			}
			return;
		}
		if (s() && ac == 2)
			b((short)0);
	}

	public final boolean a(y y1)
	{
		if (super.f[3] == 7 || super.f[3] == 5 || super.f[3] == 6)
			return false;
		if (ac == 2)
		{
			b((short)6);
			return true;
		} else
		{
			return super.a(y1);
		}
	}

	public final boolean K()
	{
		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 L()
	{
		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 M()
	{
		return u.a(y.i(super.f[14]), super.f[8], super.f[9], super.g[24], super.g[25], ((y) (k.s)).f[8], ((y) (k.s)).f[9]);
	}

	public final boolean f()
	{
		short aword0[] = i();
		return u.a(((y) (k.s)).f[8], ((y) (k.s)).f[9], aword0[0], aword0[1], aword0[2], aword0[3]);
	}

	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;
		}
	}

}