m.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 m 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
		}, {
			0, 0, 1, 2
		}, new short[0], new short[0], {
			6, 6, 6, 6
		}, {
			3, 3, 4, 5
		}, {
			0, 0, 1, 2
		}
	};
	public int b;

	public m()
	{
	}

	public final void a()
	{
		super.f = new short[27];
		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[26] = super.e[24];
		super.f[19] = super.e[22];
		super.f[20] = super.e[23];
	}

	public final void c()
	{
		if (super.e[3] == 2)
		{
			aa aa1 = z.d[super.e[6]];
			short word0 = super.e[7];
			byte byte0 = aa1.c[word0];
			super.p[1] = 0;
			super.p[0] = (short)(byte0 - 1);
			return;
		} else
		{
			boolean flag = false;
			super.d(a[super.e[3]][0 + super.e[14]]);
			return;
		}
	}

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

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

		case 10: // '\n'
			J();
			return true;
		}
		return false;
	}

	public final void d()
	{
		if (b > 0)
		{
			b--;
			return;
		}
		if (super.f[26] != -1)
		{
			b((short)9);
			return;
		} else
		{
			b((short)1);
			k.an[50] = 3;
			return;
		}
	}

	public final void e()
	{
		f(super.e[14]);
		if (t())
		{
			int i = v.b(4);
			c((short)i);
			b = 15;
			b((short)0);
		}
	}

	public final void m()
	{
		super.o++;
		if (super.o > 30)
		{
			if (!K())
			{
				b((short)0);
				return;
			}
			b((short)0);
			k.an[50] = 1;
		}
	}

	public final void I()
	{
		short word0 = super.e[8];
		short word1 = super.e[9];
		short word2 = k.e(super.f[26]).e[8];
		short word3 = k.e(super.f[26]).e[9];
		if (v.a(word0, word1, word2, word3))
		{
			short word4 = k.e(super.f[26]).e[16];
			super.f[26] = k.e(super.f[26]).e[14];
			switch (word4)
			{
			case 0: // '\0'
				b((short)0);
				break;

			case 1: // '\001'
				b((short)10);
				break;

			case 2: // '\002'
				b = 15;
				b((short)0);
				break;
			}
			return;
		}
		short word5;
		if ((word5 = c(k.e(super.f[26]))) != super.e[14])
			c(word5);
		f(super.e[14]);
	}

	public final void J()
	{
		super.o++;
		switch (super.o)
		{
		case 20: // '\024'
			c(w());
			break;

		case 40: // '('
			switch (super.e[14])
			{
			case 2: // '\002'
			case 3: // '\003'
				c((short)1);
				break;

			case 0: // '\0'
			case 1: // '\001'
				c((short)2);
				break;
			}
			break;

		case 60: // '<'
			c(w());
			break;

		case 80: // 'P'
			b = 3;
			b((short)0);
			break;
		}
		if (K())
			b((short)5);
	}

	public final boolean K()
	{
		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 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 void a(Graphics g1, int i, int j)
	{
		super.a(g1, i, j);
		if (super.e[3] == 5 && super.o % 5 == 0)
		{
			g1.setColor(0xff0000);
			g1.fillRect(i - 2, j - 70, 4, 10);
			g1.fillRect(i - 2, (j - 70) + 10 + 2, 4, 4);
		}
	}

}