j.java

很好的3款手机游戏源码

// 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.*;

public class j
	implements d
{

	static byte cW[];
	byte cV[];
	static byte cT[];
	c c2;
	int cX[];
	int cZ;
	static int cY = 0;
	static boolean cU = false;
	int c0;
	int c1;

	public j(c c3)
	{
		cZ = 0;
		c1 = 217;
		c2 = c3;
	}

	public void E()
	{
		cW = null;
		cV = null;
		cT = null;
		cW = int("byte_quests");
		cV = int("byte_qConditions");
		c0 = cV.length / 4;
		cT = int("byte_qResults");
		c1 = cT.length / 4;
	}

	byte[] int(String s)
	{
		byte abyte0[] = new byte[4];
		a("/data/" + s + ".dat", abyte0, 0, 2);
		byte abyte1[] = new byte[abyte0[0] * 128 + abyte0[1]];
		a("/data/" + s + ".dat", abyte1, 2, abyte1.length);
		return abyte1;
	}

	void a(String s, byte abyte0[], int i, int l)
	{
		try
		{
			DataInputStream datainputstream = new DataInputStream(getClass().getResourceAsStream(s));
			datainputstream.skipBytes(i);
			datainputstream.read(abyte0, 0, l);
			datainputstream.close();
		}
		catch (IOException ioexception)
		{
			Object obj = null;
			System.out.println("Error");
		}
	}

	public boolean if(int i, int l, int i1)
	{
		int j1 = a(i, l, i1);
		if (j1 > 0)
		{
			c.aL = true;
			cY = j1;
			int k1 = 0;
			for (int l1 = 0; l1 < c1; l1++)
				if (cT[l1 * 4] == cY)
					k1++;

			cX = new int[k1];
			k1 = 0;
			for (int i2 = 0; i2 < c1; i2++)
				if (cT[i2 * 4] == cY)
				{
					cX[k1] = i2;
					k1++;
				}

			cZ = 0;
			return true;
		} else
		{
			return false;
		}
	}

	private int a(int i, int l, int i1)
	{
		for (int j1 = 0; j1 < c0; j1++)
			if (cV[j1 * 4 + 1] == i1 && cV[j1 * 4 + 2] == i && cV[j1 * 4 + 3] == l && goto(cV[j1 * 4], 1) && (!goto(cV[j1 * 4], 2)) | goto(cV[j1 * 4], 3) && q(cV[j1 * 4]))
				return cV[j1 * 4];

		return 0;
	}

	private boolean q(int i)
	{
		for (int l = 0; l < c0; l++)
			if (cV[l * 4] == i && cV[l * 4 + 1] == 0 && c.aw.L[cV[l * 4 + 2]] < cV[l * 4 + 3])
				return false;

		return true;
	}

	private boolean long(int i, int l)
	{
		for (int i1 = 0; i1 < c0; i1++)
			if (cV[4 * i1] == i && cV[4 * i1 + 2] == l)
				return true;

		return false;
	}

	private boolean goto(int i, int l)
	{
		return i != 0 && cW[(i - 1) * 4 + l] != 0;
	}

	public void r(int i)
	{
		if (cZ == cX.length)
		{
			c.aL = false;
			j  = this;
			c.ao = false;
			j 1 = this;
			c.aG = true;
			if (!goto(i, 3))
			{
				cW[(i - 1) * 4 + 1] = 0;
				cW[(i - 1) * 4 + 2] = 1;
			}
			return;
		} else
		{
			int l = cX[cZ];
			a(i, cT[l * 4 + 1], cT[l * 4 + 2], cT[l * 4 + 3], false);
			cZ++;
			return;
		}
	}

	public void D()
	{
		for (int i = 0; i < c1; i++)
			if (goto(cT[i * 4], 2) && (cT[i * 4 + 1] == 1 || cT[i * 4 + 1] == 4))
				a(cT[i * 4], cT[i * 4 + 1], cT[i * 4 + 2], cT[i * 4 + 3], true);

	}

	private void a(int i, int l, byte byte0, byte byte1, boolean flag)
	{
		switch (l)
		{
		case 10: // '\n'
		case 13: // '\r'
		case 15: // '\017'
		default:
			break;

		case 1: // '\001'
			if (c.bI != byte0 - 1)
				break;
			f.ca[c.bo[(byte1 - 1) * 3 + 1]][c.bo[(byte1 - 1) * 3 + 2]] = 0;
			f.b3 = true;
			if (!flag)
				c2.c(30);
			break;

		case 2: // '\002'
			c2.a5 = byte0;
			break;

		case 3: // '\003'
			c.aw.if(byte0, byte1);
			break;

		case 4: // '\004'
			if (!long(i, c.bI + 1))
				break;
			f.ca[c.bo[(byte0 - 1) * 3 + 1]][c.bo[(byte0 - 1) * 3 + 2]] = byte1;
			f.b3 = true;
			if (i == 49 && byte1 == 10)
				c2.c(50);
			if (!flag)
				c2.c(30);
			break;

		case 5: // '\005'
			c2.int(byte0, byte1);
			j  = this;
			if (!c.ao)
			{
				j 1 = this;
				c.ao = true;
			}
			break;

		case 6: // '\006'
			b.ab = true;
			b.ah = true;
			j 2 = this;
			c.ax = 0;
			break;

		case 7: // '\007'
			if (byte0 != 0)
				cW[(byte0 - 1) * 4 + 1] = byte1;
			break;

		case 8: // '\b'
			if (i == 38 || i == 46)
			{
				j 3 = this;
				c.ao = true;
			}
			j 4 = this;
			if (c.ao)
				c2.a(byte0);
			break;

		case 9: // '\t'
			c2.r();
			break;

		case 11: // '\013'
			c2.h();
			break;

		case 12: // '\f'
			if (i == 29)
				cU = true;
			j 5 = this;
			c.bB.a(new byte[] {
				byte0
			}, false, byte1);
			break;

		case 14: // '\016'
			j 6 = this;
			c.aM = byte1;
			j 7 = this;
			c.bI = byte0 - 1;
			j 8 = this;
			c.bq = true;
			c2.if((byte)5);
			break;

		case 16: // '\020'
			c2.byte();
			break;

		case 17: // '\021'
			b.aa = byte0;
			j 9 = this;
			c.bQ = true;
			break;

		case 18: // '\022'
			j 10 = this;
			k.da = true;
			break;

		case 19: // '\023'
			c2.q();
			break;

		case 20: // '\024'
			j 11 = this;
			if (b.R || i != 63)
			{
				j 12 = this;
				if (b.P || i != 64)
					break;
			}
			j 13 = this;
			c.aB = 2;
			j 14 = this;
			c.aw.aj = 5;
			j 15 = this;
			b.W = true;
			j 16 = this;
			b.Z = byte0 + 1;
			j 17 = this;
			c2.a(b.T[byte0 + 1], 150, 5);
			break;
		}
	}

}