w.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 w
{

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

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

	public static final void a()
	{
		for (int j = 0; j < 40; j++)
			if (c[j].a[0] >= 0)
				c[j].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--;
		i.a((byte)3, a[6], a[7], (byte)0);
	}

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

	private void f()
	{
		aa aa1;
		(aa1 = z.d[a[3]]).a((short)a[4], b);
	}

	public final void a(Graphics g, int j, int l)
	{
		aa aa1 = null;
		(aa1 = z.d[a[3]]).a(g, a[4], b[0], j, l, (a[2] & 0x20) == 32);
	}

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

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

			}
			if ((w1.a[2] & 0x40) == 64 && w1.e())
				flag = true;
			if (!flag)
			{
				if ((w1.a[2] & 0x100) == 256)
				{
					int k1 = ((z) (k.s)).e[8] - w1.a[6];
					int i2 = ((z) (k.s)).e[9] - w1.a[7];
					int j2;
					j2 = j2 = v.c(k1, i2);
					w1.a[15] = w1.a[14] = j2;
					int k2 = w1.a[9];
					int l2 = w1.a[8];
					w1.a[12] = v.d(k2, j2);
					w1.a[13] = v.e(k2, j2);
					w1.a[10] = v.d(l2, j2);
					w1.a[11] = v.e(l2, j2);
				}
				int j = w1.a[6];
				int l = w1.a[7];
				j += w1.a[10];
				l += w1.a[11];
				w1.a[10] += w1.a[12];
				w1.a[11] += w1.a[13];
				if (v.a(j, l, k.av[0], k.av[1], k.av[2], k.av[3]))
				{
					if ((w1.a[2] & 1) == 1 || (w1.a[2] & 2) == 2 && i.a(j, l) == 0)
					{
						i.a((byte)3, w1.a[6], w1.a[7], (byte)0);
						w1.a[6] = j;
						w1.a[7] = l;
						i.a((byte)3, w1.a[6], w1.a[7], (byte)(-127 + w1.a[0]));
					} else
					{
						w1.b();
					}
				} else
				{
					w1.b();
				}
			} else
			{
				w1.b();
			}
		}

	}

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

	}
}