x.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 


public final class x extends z
{

	public static final short a[][] = {
		{
			0, 0, 0, 0
		}, new short[0], {
			1, 1, 1, 1
		}, {
			1, 1, 1, 1
		}, new short[0], new short[0], new short[0], new short[0], {
			1, 1, 1, 1
		}
	};
	public static final short b[][] = {
		{
			0, 0, 0, 0
		}, new short[0], new short[0], new short[0], new short[0], new short[0], new short[0], new short[0], {
			1, 1, 1, 1
		}
	};
	private int c;

	public x(int j)
	{
		c = j;
	}

	public final void a()
	{
		super.f = new short[21];
	}

	public final void c()
	{
		switch (c)
		{
		case 0: // '\0'
			super.d(a[super.e[3]][super.e[14]]);
			return;

		case 1: // '\001'
			super.d(b[super.e[3]][super.e[14]]);
			break;
		}
	}

	public final void d()
	{
		if (c == 0)
		{
			short word0 = c(I());
			short word1 = I().e[14];
			if ((word0 != 2 || word1 != 3) && (word0 != 3 || word1 != 2) && (word0 != 1 || word1 != 0) && (word0 != 0 || word1 != 1))
				return;
			int j = Math.abs(super.e[8] - I().e[8]);
			int l = Math.abs(super.e[9] - I().e[9]);
			if (j > i.d() || l > i.e())
				return;
			if (a.c(16384))
			{
				a.a();
				b((short)8);
				a((short)50);
			}
		}
	}

	public final void p()
	{
		super.o++;
		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[15]) && super.e[16] >= 0)
				(u1 = u.a((byte)-1, super.e[16])).a((short)j, (short)l);
			if (v.a(super.e[15]) && super.e[17] > 0)
				(u1 = u.a((byte)2, super.e[17])).a((short)i1, (short)j1);
		}
		if (c == 0)
		{
			b((short)2);
			return;
		} else
		{
			a(128);
			super.p();
			return;
		}
	}

	public final boolean a(z z1)
	{
		if (c == 0)
			return false;
		if (super.e[3] == 8)
		{
			return false;
		} else
		{
			b((short)8);
			return true;
		}
	}

	public final z I()
	{
		return k.s;
	}

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

}