g.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 g extends f
{

	private int aj;

	public g(int i)
	{
		aj = i;
	}

	public final boolean b()
	{
		if (!c(128) && !c(256))
		{
			K();
			super.aa = -1;
			if ((super.e[2] & 0x800) != 2048 && !super.P[2])
				I();
		}
		r();
		switch (super.e[3])
		{
		case 0: // '\0'
			d();
			return true;

		case 1: // '\001'
			e();
			return true;

		case 5: // '\005'
			m();
			return true;

		case 6: // '\006'
			n();
			return true;

		case 8: // '\b'
			p();
			return true;

		case 2: // '\002'
		case 3: // '\003'
		case 4: // '\004'
		case 7: // '\007'
		default:
			return false;
		}
	}

	public final void c()
	{
		byte byte0 = 0;
		switch (super.e[3])
		{
		case 6: // '\006'
			byte0 = super.x;
			break;

		case 5: // '\005'
			byte0 = super.w;
			break;
		}
		switch (aj)
		{
		case 6: // '\006'
			super.d(e.a[super.e[3]][(byte0 << 2) + super.e[14]]);
			return;

		case 7: // '\007'
			super.d(l.a[super.e[3]][(byte0 << 2) + super.e[14]]);
			return;

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

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

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

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

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

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

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

	public final void a()
	{
		super.a();
		super.f[2] = 6;
		super.f[8] = 20;
		super.f[9] = 20;
		super.f[5] = super.f[4] = 10;
		super.f[7] = super.f[6] = 10;
	}

	public final void o(int i)
	{
		aj = i;
		switch (i)
		{
		case 6: // '\006'
			super.e[6] = k.j[14];
			return;

		case 7: // '\007'
			super.e[6] = k.j[15];
			return;

		case 8: // '\b'
			super.e[6] = k.j[16];
			return;

		case 4: // '\004'
			super.e[6] = k.j[7];
			return;

		case 5: // '\005'
			super.e[6] = k.j[8];
			return;

		case 0: // '\0'
			super.e[6] = k.j[6];
			return;

		case 1: // '\001'
			super.e[6] = k.j[9];
			return;

		case 2: // '\002'
			super.e[6] = k.j[11];
			return;

		case 3: // '\003'
			super.e[6] = k.j[12];
			break;
		}
	}

	public final void I()
	{
		super.aa = -1;
		super.ab = -1;
		boolean flag = false;
		switch (super.e[3])
		{
		case 0: // '\0'
			if (a.c(16384))
			{
				super.aa = 6;
				super.ab = super.e[14];
			} else
			if (a.b(1))
			{
				super.aa = 1;
				super.ab = 2;
			} else
			if (a.b(2))
			{
				super.aa = 1;
				super.ab = 3;
			} else
			if (a.b(4))
			{
				super.aa = 1;
				super.ab = 0;
			} else
			if (a.b(8))
			{
				super.aa = 1;
				super.ab = 1;
			} else
			if (a.a(1))
			{
				super.aa = 0;
				super.ab = 2;
			} else
			if (a.a(2))
			{
				super.aa = 0;
				super.ab = 3;
			} else
			if (a.a(4))
			{
				super.aa = 0;
				super.ab = 0;
			} else
			if (a.a(8))
			{
				super.aa = 0;
				super.ab = 1;
			} else
			if (a.c(1))
				super.ab = 2;
			else
			if (a.c(2))
				super.ab = 3;
			else
			if (a.c(4))
				super.ab = 0;
			else
			if (a.c(8))
				super.ab = 1;
			else
			if (a.c(512) && !c(4096))
			{
				super.aa = 11;
				super.ab = super.e[14];
			}
			break;

		case 1: // '\001'
			if (a.a(1))
			{
				super.aa = 0;
				super.ab = 2;
			} else
			if (a.a(2))
			{
				super.aa = 0;
				super.ab = 3;
			} else
			if (a.a(4))
			{
				super.aa = 0;
				super.ab = 0;
			} else
			if (a.a(8))
			{
				super.aa = 0;
				super.ab = 1;
			}
			break;
		}
		if (a.c(16))
		{
			k.U++;
			if (k.U > 3)
				k.U = 0;
			switch (k.U)
			{
			case 0: // '\0'
				k.V = false;
				k.W = false;
				break;

			case 1: // '\001'
				k.V = false;
				k.W = true;
				break;

			case 2: // '\002'
				k.V = true;
				k.W = true;
				break;

			case 3: // '\003'
				k.V = true;
				k.W = false;
				break;
			}
		}
		int i;
		if (a.c(1024))
			if ((i = super.Y[0]) > 0)
				v(0);
			else
			if ((i = super.Y[1]) > 0)
				v(1);
		if (a.c(2048))
		{
			int j;
			if ((j = super.Y[6]) > 0)
			{
				v(6);
				return;
			}
			if ((j = super.Y[7]) > 0)
				v(7);
		}
	}

	public final void d()
	{
		if (super.ab != -1 && super.e[14] != super.ab)
			c(super.ab);
		switch (super.aa)
		{
		default:
			break;

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

		case 6: // '\006'
			if (!c(4096))
			{
				super.w = 0;
				b((short)5);
				return;
			}
			break;

		case 11: // '\013'
			if (aj == 1 || aj == 2)
				break;
			if (aj == 8)
				super.w = 2;
			else
				super.w = 1;
			b((short)5);
			break;
		}
	}

	public final void e()
	{
		switch (super.aa)
		{
		case -1: 
			b((short)0);
			break;
		}
		if (super.e[3] != 1)
			return;
		if (super.ab != -1 && super.e[14] != super.ab)
			c(super.ab);
		f(super.e[14]);
	}

	public final void m()
	{
		super.o++;
		if (z())
		{
			E();
			if (D() && !ab())
				super.p[1] += B();
		}
		if (super.e[3] != 5)
			return;
		if (t())
			b((short)0);
	}

	public final void n()
	{
		G();
		if (t())
		{
			if (super.x == 1)
				b((short)21);
			else
				b((short)0);
			super.x = 0;
			super.w = 0;
		}
	}

	public final void p()
	{
		if (t())
		{
			b(128);
			a(256);
			b(8);
			super.p[0] = 4;
			super.p[1] = 0;
		}
	}

	public final byte[][] g()
	{
		return (byte[][])null;
	}
}