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

	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 V[][] = {
		{
			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]
	};
	public static final short Y[][] = {
		{
			2, 2, 2, 2
		}, {
			1, 1, 1, 1
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}, {
			0, 0, 0, 0
		}, {
			2, 2, 2, 2
		}, {
			2, 2, 2, 2
		}
	};
	private int aa;
	private int ab;
	private int ac;
	private int ad;
	public int Z;
	private byte ae;

	public s(int j)
	{
		ad = j;
	}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

		case 5: // '\005'
			if (f())
			{
				b((short)1);
				return;
			}
			break;

		case 3: // '\003'
		case 4: // '\004'
			if (!f())
				break;
			if (((z) (k.s)).e[8] >= super.e[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 (ad)
		{
		default:
			break;

		case 0: // '\0'
			if (N())
			{
				b((short)5);
				if (ae++ > 10)
				{
					b((short)0);
					ae = 0;
				}
			}
			f(super.e[14]);
			if (M())
			{
				b((short)10);
				return;
			}
			if (t())
			{
				int i1 = v.b(2);
				c((short)i1);
				aa = 15;
				b((short)0);
				return;
			}
			break;

		case 1: // '\001'
			if (M())
			{
				boolean flag4;
				if (!(flag4 = f(super.e[14])))
					c(w());
				int k1 = super.f[2] + 5;
				int l1 = super.f[2];
				super.f[2] = (short)k1;
				super.f[2] = (short)l1;
				if (N())
					b((short)2);
				return;
			}
			f(super.e[14]);
			if (t())
			{
				int j1 = v.b(2);
				c((short)j1);
				aa = 10;
				b((short)0);
				return;
			}
			break;

		case 5: // '\005'
			if (t() && !f())
			{
				b((short)0);
				return;
			}
			break;

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

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

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

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

	public final void I()
	{
		if (N())
		{
			b((short)5);
			if (ae++ > 10)
			{
				b((short)0);
				ae = 0;
				return;
			}
		} else
		{
			short word0 = super.f[2];
			super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
			boolean flag = f(super.e[14]);
			super.f[2] = word0;
			if (!flag)
				c(w());
			if (t())
				b((short)0);
		}
	}

	public final void k()
	{
		if (ad == 1)
		{
			if (t() && !N())
				b((short)0);
			return;
		}
		if (!v.a(super.h, super.i, k.av[0], k.av[1], k.av[2], k.av[3]))
		{
			a(super.h, super.i);
			a(16);
			b((short)0);
		}
	}

	public final void J()
	{
		short word0 = super.f[2];
		super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
		boolean flag = f(super.e[14]);
		super.f[2] = word0;
		if (!flag || ab <= 3)
			c(w());
		if (t())
		{
			if (!M())
			{
				b((short)0);
				return;
			}
			if (ac++ > 5)
			{
				b((short)9);
				ac = 0;
				return;
			}
			b((short)10);
		}
	}

	public final void K()
	{
		short word0 = super.f[2];
		super.f[2] = (short)z.d[super.e[6]].d(super.e[7], super.p[0]);
		boolean flag = f(super.e[14]);
		super.f[2] = word0;
		if (!flag || ab >= 3)
			c(w());
		if (t())
		{
			if (!M())
			{
				b((short)0);
				return;
			}
			if (ac++ > 5)
			{
				b((short)9);
				ac = 0;
				return;
			}
			ab++;
			if (ab >= 3)
			{
				b((short)11);
				ab = 0;
				return;
			}
			if (ab <= 3)
			{
				b((short)10);
				ab = 0;
			}
		}
	}

	public final void m()
	{
		if (ad == 6)
		{
			if (t())
			{
				Z = 30;
				b((short)6);
			}
			return;
		}
		if (ad == 5)
		{
			if (t() && !f())
				b((short)0);
			return;
		}
		if (z())
		{
			E();
			if (D() && !L())
				super.p[1] += B();
		}
		if (t())
			b((short)0);
	}

	public final void n()
	{
		if (ad == 6)
		{
			b(16);
			if (f() && ((z) (k.s)).e[3] == 0)
			{
				k.s.b((short)8);
				k.s.l = k.m();
				k.n();
			}
			Z--;
			if (Z < 0)
			{
				a(16);
				b((short)0);
			}
			return;
		}
		if (t() && ad == 2)
			b((short)0);
	}

	public final boolean a(z z1)
	{
		if (super.e[3] == 7 || super.e[3] == 5 || super.e[3] == 6)
			return false;
		if (ad == 2)
		{
			b((short)6);
			return true;
		} else
		{
			return super.a(z1);
		}
	}

	public final boolean L()
	{
		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 M()
	{
		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 boolean N()
	{
		return v.a(z.j(super.e[14]), super.e[8], super.e[9], super.f[24], super.f[25], ((z) (k.s)).e[8], ((z) (k.s)).e[9]);
	}

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

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

}