k.java

来自「很好的3款手机游戏源码」· Java 代码 · 共 981 行 · 第 1/2 页

				dz--;
				if (dz - dD < 0)
					dD--;
			} else
			if (i == 1 && dz < dR - 1)
			{
				dz++;
				if (dz - dD >= 5)
					dD++;
			}
	}

	private void I()
	{
		dI = 0;
		c.long(50);
		dd = 1;
		dx = true;
		if (dh == 2)
			dg.if((byte)1);
		else
			c.aB = 0;
		O();
	}

	public boolean C(int i)
	{
label0:
		switch (i)
		{
		case -5: 
		case -4: 
		case -3: 
		case -2: 
		case -1: 
		case 0: // '\0'
		case 3: // '\003'
		case 4: // '\004'
		case 7: // '\007'
		default:
			break;

		case 1: // '\001'
			x(-1);
			break;

		case 6: // '\006'
			x(1);
			break;

		case 2: // '\002'
			x(-2);
			break;

		case 5: // '\005'
			x(2);
			break;

		case -6: 
		case 8: // '\b'
			if (dd == 1)
			{
				switch (df)
				{
				default:
					break label0;

				case 0: // '\0'
					dc = -1;
					dM = -1;
					dd = 2;
					ds = 0;
					c5 = 0;
					break label0;

				case 1: // '\001'
					dd = 4;
					dC = c.aw.a(c.aw.ad, 0, 6);
					dR = dC.length;
					dz = 0;
					dD = 0;
					break label0;

				case 2: // '\002'
					dd = 5;
					dC = c.aw.a(c.aw.L, 20, c.aw.L.length);
					dR = dC.length;
					dz = 0;
					dD = 0;
					break label0;

				case 3: // '\003'
					break;
				}
				if (dU)
					A(3);
				break;
			}
			if (dd == 4)
			{
				if (dn[1] >= c.bu.new[dC[dz]])
				{
					dc = dC[dz];
					dM = dB[dc];
					ds = 0;
					dd = 2;
				}
				break;
			}
			if (dd == 5)
			{
				if (dz < dC.length)
				{
					c.aw.try(dC[dz]);
					dd = 3;
					ds = -10;
				}
				break;
			}
			if (dd == 6 && dI > 10)
				I();
			break;

		case -7: 
			if (dd == 4 || dd == 5)
				dd = 1;
			break;
		}
		return true;
	}

	public void L()
	{
		c6 = 1;
		dl = 0;
		dn = new int[7];
		dx = true;
		H();
		K();
		M();
	}

	public void K()
	{
		dn[0] = dn[2];
	}

	public void M()
	{
		dn[1] = dn[3];
	}

	private void t(int i)
	{
		for (int l = 0; l < 5; l++)
			dn[l + 2] = dS[l][0] + i * dS[l][1];

		du = dq[c6 - 1];
	}

	public void null(int i, int l)
	{
		dn[0 + i] += l;
		if (dn[0 + i] > dn[2 + i])
			dn[0 + i] = dn[2 + i];
		dV = 6;
		dO = l;
		dF = dw[0][0];
		dE = dw[0][1] - 55;
	}

	public int G()
	{
		return (dl * 100) / du;
	}

	public int y(int i)
	{
		int l = (dn[0 + i] * 100) / dn[2 + i];
		if (l < 0)
			return 0;
		else
			return l;
	}

	public void H()
	{
		t(c6);
		for (int i = 0; i < 4; i++)
			if (c.aw.S[i] >= 0)
			{
				for (int l = 0; l < 5; l++)
					dn[l + 2] += c.aw.for(c.aw.S[i], l);

			}

		for (int i1 = 0; i1 < 5; i1++)
		{
			if (dn[i1 + 2] > dj[i1][1])
				dn[i1 + 2] = dj[i1][1];
			if (dn[i1 + 2] < dj[i1][0])
				dn[i1 + 2] = dj[i1][0];
		}

	}

	private void P()
	{
		c6++;
		dl -= du;
		du = dq[c6 - 1];
		H();
		K();
		M();
	}

	private void do(Graphics g, int i, int l, int i1)
	{
		if (i1 < 8)
		{
			int j1 = dM >= 0 ? 0 : 1;
			if (i1 == 0)
			{
				c3.D(0);
				c3.D(1);
			}
			if (i1 >= 2 && i1 <= 6 && j1 == 1)
				c3.new(g, i - 50, l - 15, j1);
			else
				c3.new(g, i, l, j1);
			c3.F(j1);
		}
	}

	private void byte(Graphics g, int i, int l)
	{
		c3.D(0);
		if (dx)
			if (dn[0] <= 0)
				c3.try(g, i + (dN > 0 ? dN : 0), l, 3);
			else
				c3.new(g, i + (dN > 0 ? dN : 0), l, 0);
		if (dN > 0)
			dN--;
		if (dd == 6 && dh == 2)
			c3.try(g, i - 2, l, 3);
	}

	private void w(int i)
	{
		int l = 0;
		dy = i;
		l = c.new(dn[6] / 2, dn[6]);
		if (l > i)
			l = i;
		dy -= l;
		if (dy < 0)
			dy = 0;
		dn[0] -= dy;
		if (dy > 0)
			dN = 1;
		if (j.cU && da)
		{
			dV = 6;
			dO = 0;
			dF = dw[2][0];
			dE = dw[2][1] - 50;
		} else
		{
			dV = 6;
			dO = -dy;
			dF = dw[0][0];
			dE = dw[0][1] - 50;
			if (dn[0] <= 0)
				if (j.cU)
				{
					da = true;
					J();
				} else
				{
					dx = false;
				}
		}
	}

	private boolean B(int i)
	{
		if (c6 < 20)
			dl += i;
		if (dl >= du)
		{
			P();
			return true;
		} else
		{
			return false;
		}
	}

	private void v(int i)
	{
		c.bN += i;
		if (c.bN > 0x1869f)
			c.bN = 0x1869f;
	}

	private int z(int i)
	{
		int l = 0;
		int i1 = 0;
		if (i >= 0)
		{
			l = c.bu.new[i];
			i1 = c.bu.for[i];
		}
		if (i >= 0 && dn[1] >= l)
		{
			dn[1] -= l;
			return dn[4] + (dn[5] * (i1 + 100)) / 100;
		} else
		{
			return dn[4];
		}
	}

	private void s(int i)
	{
		dr = i;
		db[0] = db[2] = e.else[i][0];
		db[4] = e.else[i][1];
		db[6] = e.else[i][2];
		dH = e.else[i][3];
		k  = this;
		if (b.K)
			dH = dH * 2;
		dP = true;
	}

	private void n(Graphics g)
	{
		if (!dU)
			dT.try(g, 95, 5, dX - 1);
		g.setClip(0, 0, 176, 220);
		g.setColor(0xb6b6a1);
		g.fillRect(40, 20, 40, 9);
		g.setColor(0);
		g.drawRect(42, 21, 36, 6);
		g.setColor(0xff0000);
		g.fillRect(43, 22, (((db[0] * 100) / db[2]) * 35) / 100, 5);
		dg.a(g, db[2], 65, 10, 0, 0);
		dg.a(g, db[0], 35, 10, 0, 0);
		g.setColor(65280);
		g.drawString("|", 60, 5, 20);
	}

	private void try(Graphics g, int i, int l)
	{
		dY.D(0);
		if (dP)
			dY.new(g, i - (c9 > 0 ? c9 : 0), l, 0);
		if (c9 > 0)
			c9--;
		if (dd == 6 && dh == 1)
			dY.try(g, i - 2, l, 2);
	}

	private void int(Graphics g, int i, int l, int i1)
	{
		if (i1 == 0)
		{
			dY.D(0);
			if (dp)
				c7.D(0);
		}
		if (i1 >= 2 && i1 <= 6)
		{
			if (dp)
			{
				dY.new(g, i, l, 0);
				if (j.cU && da)
					c7.new(g, dw[2][0], dw[2][1], 0);
				else
					c7.new(g, dw[0][0], dw[0][1], 0);
			} else
			{
				dY.new(g, i + 30, l + 15, 0);
			}
		} else
		{
			dY.new(g, i, l, 0);
		}
		dY.F(0);
		if (dp)
			c7.F(0);
	}

	private void o(Graphics g)
	{
		if (dV > 0)
		{
			if (dO == 0)
			{
				g.setColor(0xff0000);
				g.drawString("躲避", dF, dE + dV, 0);
			} else
			if (dO > 0)
				dg.a(g, dO, dF + 5, dE + dV, 0, 1);
			else
				dg.a(g, dO, dF + 5, dE + dV, 0, 0);
			dV--;
		}
	}

	private void u(int i)
	{
		int l = i - c.d(db[6]);
		if (l < 0)
			l = 0;
		db[0] = db[0] - l;
		dV = 6;
		dO = -l;
		dF = dw[1][0] - 15;
		dE = (-15 + dw[1][1]) - dm[dr][1];
		if (l > 0)
			c9 = 1;
		if (db[0] <= 0)
		{
			db[0] = 0;
			if (j.cU)
			{
				j.cU = false;
				da = false;
				c.long(50);
				dd = 1;
				dx = true;
				K();
				M();
				c.aB = 0;
				O();
			}
			dP = false;
		}
	}

	private int F()
	{
		return dL[2];
	}

	private void new(Graphics g, int i, int l)
	{
		if (di)
			if (dk > 1)
				dk = 0;
			else
				dk++;
		di = !di;
		if (da)
			dJ.try(g, i, l, 1 + dk);
	}

	private void for(Graphics g, int i, int l, int i1)
	{
		if (i1 == 0)
			dv.D(0);
		if (i1 >= 3 && i1 <= 6)
		{
			dJ.try(g, i - 50, l - 15, 5);
			dv.new(g, dw[1][0], dw[1][1], 0);
		} else
		{
			dJ.try(g, i, l, 2);
		}
		dv.F(0);
	}

	private void O()
	{
		k  = this;
		c.aq = false;
		dK = null;
		dY = null;
		c7 = null;
		dT = null;
		dJ = null;
		dv = null;
	}

}