v.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 java.io.PrintStream;
import javax.microedition.lcdui.Graphics;

public final class v
{

	public int a[];
	private y e;
	public short b[];
	public static v c[];
	private static int f = 0;
	public static int d = 0;

	public v()
	{
		a = new int[18];
		b = new short[2];
	}

	public static final void a()
	{
		for (int i = 0; i < 40; i++)
			if (c[i].a[0] >= 0)
				c[i].d();

	}

	public final void b()
	{
		if (a[5] == -1)
		{
			d();
			return;
		} else
		{
			a[4] = a[5];
			a[1] = 1;
			return;
		}
	}

	private void d()
	{
		if (a[0] < f)
		{
			f = a[0];
			if (a[0] < 0)
				System.out.println("destroy(): error!");
		}
		a[0] = -1;
		e = null;
		d--;
		h.a((byte)3, a[6], a[7], (byte)0);
	}

	private boolean e()
	{
		return b[0] == 0 && b[1] == 0;
	}

	private void f()
	{
		z z1;
		(z1 = y.e[a[3]]).a((short)a[4], b);
	}

	public final void a(Graphics g, int i, int j)
	{
		z z1 = null;
		(z1 = y.e[a[3]]).a(g, a[4], b[0], i, j, (a[2] & 0x20) == 32);
	}

	public static final void c()
	{
		boolean flag = false;
		boolean flag1 = false;
		boolean flag2 = false;
		Object obj = null;
		for (int l = 39; l >= 0; l--)
		{
			if (c[l].a[0] < 0)
				continue;
			v v1;
			(v1 = c[l]).f();
			if (v1.a[1] == 1)
			{
				if (v1.e())
					v1.d();
				continue;
			}
			short aword2[];
			u.a(aword2 = y.e[v1.a[3]].a((byte)2, v1.a[4], v1.b[0]), v1.a[6], v1.a[7]);
			if ((v1.a[2] & 4) == 4)
			{
				for (int i1 = 0; i1 < k.q.length; i1++)
				{
					short aword0[] = k.q[i1].w();
					if (u.a(aword2, aword0) && k.q[i1].a(v1.e) && (v1.a[2] & 0x40) != 64)
						flag = true;
				}

			}
			if ((v1.a[2] & 8) == 8 || (v1.a[2] & 0x10) == 16)
			{
				Object obj1 = null;
				for (int k1 = 0; k1 < k.x; k1++)
				{
					y y1;
					if ((y1 = k.u[k.y[k1]]) == null || y1.c(128) && y1.c(256) || (k.l[y1.f[0]] & 1) != 1 || y1.c(128))
						continue;
					short aword1[] = y1.w();
					if (!u.a(aword2, aword1) || !y1.a(v1.e) || (v1.a[2] & 0x40) == 64)
						continue;
					flag = true;
					break;
				}

			}
			if ((v1.a[2] & 0x40) == 64 && v1.e())
				flag = true;
			if (!flag)
			{
				if ((v1.a[2] & 0x100) == 256)
				{
					int j1 = ((y) (k.s)).f[8] - v1.a[6];
					int l1 = ((y) (k.s)).f[9] - v1.a[7];
					int i2;
					i2 = i2 = u.c(j1, l1);
					v1.a[15] = v1.a[14] = i2;
					int j2 = v1.a[9];
					int k2 = v1.a[8];
					v1.a[12] = u.d(j2, i2);
					v1.a[13] = u.e(j2, i2);
					v1.a[10] = u.d(k2, i2);
					v1.a[11] = u.e(k2, i2);
				}
				int i = v1.a[6];
				int j = v1.a[7];
				i += v1.a[10];
				j += v1.a[11];
				v1.a[10] += v1.a[12];
				v1.a[11] += v1.a[13];
				if (u.a(i, j, k.aq[0], k.aq[1], k.aq[2], k.aq[3]))
				{
					if ((v1.a[2] & 1) == 1 || (v1.a[2] & 2) == 2 && h.a(i, j) == 0)
					{
						h.a((byte)3, v1.a[6], v1.a[7], (byte)0);
						v1.a[6] = i;
						v1.a[7] = j;
						h.a((byte)3, v1.a[6], v1.a[7], (byte)(-127 + v1.a[0]));
					} else
					{
						v1.b();
					}
				} else
				{
					v1.b();
				}
			} else
			{
				v1.b();
			}
		}

	}

	static 
	{
		c = new v[40];
		for (int i = 0; i < 40; i++)
		{
			c[i] = new v();
			c[i].a[0] = -1;
		}

	}
}