a.java

来自「很好的3款手机游戏源码」· Java 代码 · 共 145 行

// 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;
import javax.microedition.lcdui.Image;

public class a
	implements d
{

	public int ea;
	private static int d8;
	private static int d7;
	private int eb;
	private int d0;
	private byte d5[][];
	private int d6[];
	private int d4;
	private int d9;
	private byte d2[];
	private int dZ;
	private int ee;
	private Image d3;
	private int ed;
	private int d1;
	c ec;

	public a(Image image, int i, int j)
	{
		this(i, j);
		a(image);
	}

	public a(int i, int j)
	{
		ea = 0;
		d4 = 0;
		d9 = 0;
		dZ = 0;
		ee = 0;
		eb = i;
		d0 = j;
		d5 = new byte[10][];
		d6 = new int[10];
		d2 = new byte[10];
	}

	public void a(Image image)
	{
		if (d3 != null)
			d3 = null;
		d3 = image;
		ed = d3.getWidth() / eb;
		d1 = d3.getHeight() / d0;
	}

	public void if(Graphics g, int i, int j, int k, int l)
	{
		g.setClip(i, j, eb, d0);
		if (ea == 1)
			g.clipRect(76, 56, 24, 42);
		g.drawImage(d3, i - k * eb, j - l * d0, 20);
		g.setClip(0, 0, 176, 208);
	}

	public void try(Graphics g, int i, int j, int k)
	{
		if(g, i - dZ, j - ee, k % ed, k / ed);
	}

	public void q(Graphics g)
	{
		byte byte0;
		if (!c.bi)
			byte0 = d5[d9][d6[d9] / d2[d9]];
		else
			byte0 = 0;
		if(g, d8, d7, byte0 % ed, byte0 / ed);
	}

	public void a(byte abyte0[][], byte abyte1[])
	{
		d2 = abyte1;
		d5 = abyte0;
		d4 = abyte0.length;
	}

	public void a(byte abyte0[], byte byte0)
	{
		d2[d4] = byte0;
		d5[d4] = abyte0;
		d6[d4] = 0;
		d4++;
	}

	public void new(Graphics g, int i, int j, int k)
	{
		try(g, i, j, d5[k][d6[k] / d2[k]]);
	}

	public void void(int i, int j)
	{
		dZ = i;
		ee = j;
	}

	public void b(int i, int j)
	{
		d8 = i - dZ;
		d7 = j - ee;
	}

	public void D(int i)
	{
		d6[i] = 0;
	}

	public void F(int i)
	{
label0:
		{
			a  = this;
			if (!c.a7)
			{
				a 1 = this;
				if (!c.aq)
					break label0;
			}
			d6[i] = (d6[i] + 1) % (d5[i].length * d2[i]);
		}
	}

	public void G(int i)
	{
		d9 = i;
		F(d9);
	}

	public void E(int i)
	{
		d6[d9] = i;
	}
}