n.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 n extends z
{

	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, 39, 39, 40, 41, 42, 42, 
			43, 44
		}, {
			12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 
			19, 20, 27, 27, 28, 29
		}, {
			9, 9, 10, 11
		}, {
			24, 24, 25, 26
		}, {
			3, 3, 4, 5
		}, {
			30, 30, 31, 32
		}, {
			21, 21, 22, 23
		}, {
			33, 33, 34, 35
		}, {
			48, 48, 49, 50
		}, {
			45, 45, 46, 47
		}, {
			36, 36, 37, 38
		}
	};
	private int b;
	private int c;
	private int V;
	private boolean W;
	private boolean X;
	private int Y;
	private int Z;
	private int aa;

	public n()
	{
		Y = 0;
		Z = 0;
		aa = 0;
	}

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

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

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

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

		case 3: // '\003'
			super.f[15] = super.e[38];
			super.f[16] = -1;
			super.f[17] = -1;
			break;
		}
		V = super.f[4];
		X = true;
	}

	public final boolean b()
	{
		if (b > 0)
			b--;
		if (super.b())
			return true;
		switch (super.e[3])
		{
		case 9: // '\t'
			I();
			return true;

		case 10: // '\n'
			L();
			return true;

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

		case 12: // '\f'
			M();
			return true;

		case 13: // '\r'
			O();
			return true;

		case 14: // '\016'
			P();
			return true;

		case 15: // '\017'
			N();
			return true;
		}
		return false;
	}

	public final void b(short word0)
	{
		if (word0 == 8 && !X)
			word0 = 14;
		super.b(word0);
	}

	public final void c()
	{
		if (super.e[3] == 2)
		{
			aa aa1 = z.d[super.e[6]];
			short word0 = super.e[7];
			byte byte2 = aa1.c[word0];
			super.p[1] = 0;
			super.p[0] = (short)(byte2 - 1);
			return;
		}
		byte byte0 = 0;
		switch (super.e[3])
		{
		case 6: // '\006'
			byte0 = super.x;
			break;

		case 5: // '\005'
			byte0 = super.w;
			break;
		}
		super.d(a[super.e[3]][(byte0 << 2) + super.e[14]]);
		if (super.e[3] == 6 && super.x == 2)
		{
			byte byte1 = 0;
			switch (super.e[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[] = z.b(byte1, super.e[8], super.e[9], z.d(super.e[6], super.e[7]));
			super.j = ai[0];
			super.k = ai[1];
		}
	}

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

	public final void e()
	{
		f(super.e[14]);
		if (R())
		{
			b((short)9);
			return;
		}
		if (t())
		{
			int j = v.b(4);
			c((short)j);
			c = 10;
			b((short)0);
		}
	}

	public final void I()
	{
		super.o++;
		if ((super.o == 1 || t()) && super.A == 0)
		{
			c(c(k.s));
			super.A = (byte)super.f[38];
		}
		f(super.e[14]);
		if (!R())
		{
			c = 15;
			b((short)0);
			return;
		}
		if (v.a(super.e[27]))
			if (v.a(40))
			{
				super.w = 2;
				b((short)5);
				return;
			} else
			{
				b((short)15);
				return;
			}
		if (Q() && b == 0)
		{
			super.w = 0;
			b((short)5);
		}
	}

	public final void m()
	{
		if (z())
		{
			E();
			if (D() && !J())
				super.p[1] += B();
		}
		if (t())
		{
			b = super.f[27];
			b((short)0);
		}
	}

	public final boolean J()
	{
		boolean flag = false;
		for (int j = 0; j < k.q.length; j++)
			if (v.a(x(), k.q[j].y()) && k.q[j].a(this))
				flag = true;

		return flag;
	}

	public final boolean a(z z1)
	{
		if (super.e[3] == 7 || super.e[3] == 2 || super.e[3] == 5 || super.e[3] == 6 && super.z > 0 || super.e[3] == 2 || super.e[3] == 13 || super.e[3] == 10 && z1.w != 3)
			return false;
		int j = 0;
		if (c(k.s) == super.e[14])
			j = super.f[28];
		else
		if (w() == c(k.s))
			j = super.f[28] / 3;
		else
			j = (super.f[28] / 3) * 2;
		if (v.a(j) && super.e[3] != 10 && !super.P[2])
		{
			c(c(z1));
			b((short)7);
			if (z1.w == 6 && z1.e[3] != 22)
				z1.b((short)22);
			return false;
		} else
		{
			return super.a(z1);
		}
	}

	public final void o()
	{
		short word0 = super.f[2];
		super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
		f(w());
		super.f[2] = word0;
		if (t())
		{
			if (v.a(super.f[29]))
			{
				super.w = 0;
				b((short)5);
				return;
			}
			b((short)0);
		}
	}

	public final void n()
	{
		super.o++;
		boolean flag = false;
		switch (super.x)
		{
		case 0: // '\0'
			F();
			break;

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

		case 2: // '\002'
			G();
			if (super.p[0] + 1 >= z.d[super.e[6]].c[super.e[7]] && super.p[1] > 20 && v.a(1, 100))
				flag = true;
			break;
		}
		if (flag || super.o > 1 && t())
		{
			if (V - super.f[4] > super.f[5] / 5 && X && !super.P[2] && !super.P[0] && !super.P[1] && o(super.e[14]) == 1)
			{
				V = super.f[4];
				W = true;
			}
			if (super.x == 2)
				if ((i.a(super.e[8], super.e[9]) & 4) == 4)
				{
					a(128);
					k.s.d(this);
					b((short)8);
					super.l = k.m();
					return;
				} else
				{
					b((short)11);
					return;
				}
			if (super.x == 3)
			{
				b((short)10);
				return;
			}
			if (W)
			{
				c((short)Y);
				b((short)13);
				W = false;
				return;
			}
			c = 10;
			b((short)0);
		}
	}

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

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

	public final void L()
	{
		if (t())
			b((short)12);
	}

	public final void M()
	{
		if (t())
		{
			if (W)
			{
				c((short)Y);
				b((short)13);
				W = false;
				return;
			}
			b((short)0);
		}
	}

	public final void N()
	{
		if (z())
		{
			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 (z.d[super.e[6]].e(super.e[7], super.p[0]) == 2 && v.a(super.f[26]))
			{
				super.w = 1;
				b((short)5);
				return;
			}
		}
		if (t())
		{
			c(c(k.s));
			b((short)0);
		}
	}

	public final void O()
	{
		super.o++;
		if (t())
		{
			n n1;
			(n1 = (n)k.d(this)).a((short)Z, (short)aa);
			((z) (n1)).f[5] = super.f[5];
			((z) (n1)).f[4] = super.f[4];
			((z) (n1)).e[5] = -1;
			((z) (n1)).f[10] = 0;
			n1.X = false;
			b((short)0);
		}
	}

	public final void P()
	{
		super.p();
	}

	private int o(int j)
	{
		for (int l = 0; l < 4; l++)
		{
			switch (l)
			{
			case 2: // '\002'
				Z = super.e[8];
				aa = super.e[9] - 76;
				Y = 2;
				break;

			case 3: // '\003'
				Z = super.e[8];
				aa = super.e[9] + 76;
				Y = 3;
				break;

			case 0: // '\0'
				Z = super.e[8] - 76;
				aa = super.e[9];
				Y = 0;
				break;

			case 1: // '\001'
				Z = super.e[8] + 76;
				aa = super.e[9];
				Y = 1;
				break;
			}
			if (i.a(Z, aa) == 0)
				return 1;
		}

		return 0;
	}

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

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

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

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

		return false;
	}

	public final boolean R()
	{
		return v.a(z.j(super.e[14]), super.e[8], super.e[9], super.f[22], super.f[23], ((z) (k.s)).e[8], ((z) (k.s)).e[9]);
	}

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

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

}