p.java

j2me武林传之刀剑江湖录[中篇]反编译的源代码

		g1.setColor(0xffffff);
		g1.drawString("剩余技能点:", ai3[1] + ai3[3], ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 24);
		ai3 = ai1[32];
		g1.drawString("" + ((z) (t)).f[25], ai3[1] + ai3[3] / 2, ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 17);
		ai3 = ai1[33];
		g1.setColor(0xf3d385);
		g1.drawString(u[4] + v[4], ai3[1] + ai3[3] / 2, ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 17);
		if (af)
		{
			v.a(g1, 10, 106, 220, 106, 0x80404040);
			g1.setColor(0xffffff);
			g1.drawString("尚未习得该技能", 120, 160, 65);
		}
		if (ag)
		{
			v.a(g1, 10, 106, 220, 106, 0x80404040);
			g1.setColor(0xffffff);
			g1.drawString("技能等级已达到顶峰", 120, 160, 65);
		}
		if (ae)
		{
			int ai2[][] = c(0x20406);
			v.a(g1, ai2[0], c, d, true);
			a(g1, 0x20406);
			g1.setColor(0xffffff);
			int ai4[] = ai2[1];
			g1.drawString(o.u[byte0], ai4[1] + ai4[3] / 2, ai4[2] + (ai4[4] - g1.getFont().getHeight()) / 2, 17);
			ai4 = ai2[2];
			int j1;
			if ((j1 = v.a(g1, o.b(byte0), ai, ai4, 20)) > ai4[4])
			{
				if (ai == 0)
					a(g1, 7, new int[] {
						0, ai4[1] + ai4[3], ai4[2] + ai4[4], 1, 1
					});
				else
				if (ai == ai4[4] - j1)
				{
					a(g1, 8, new int[] {
						0, ai4[1] + ai4[3], ai4[2], 1, 1
					});
				} else
				{
					a(g1, 7, new int[] {
						0, ai4[1] + ai4[3], ai4[2] + ai4[4], 1, 1
					});
					a(g1, 8, new int[] {
						0, ai4[1] + ai4[3], ai4[2], 1, 1
					});
				}
				aj = ai4[4] - j1;
			}
		}
		if (ah)
		{
			v.a(g1, 10, 106, 220, 106, 0x80404040);
			g1.setColor(0xffffff);
			g1.drawString("没有足够的技能点", 120, 160, 65);
		}
	}

	private static final void z()
	{
		Vector vector = new Vector();
		for (int i1 = 0; i1 < 18; i1++)
			if (!k.a(i1, (byte)0))
			{
				Vector vector1;
				(vector1 = new Vector()).addElement(String.valueOf(i1) + " " + o.y[i1 << 1]);
				vector1.addElement(" ");
				String s1 = o.y[(i1 << 1) + 1];
				vector1.addElement(s1);
				vector.addElement(vector1);
			}

		al = b(vector);
		a(ak, al.length);
		ai = 0;
	}

	private static final void A()
	{
		if (am)
		{
			if (a.c(20480) || a.c(8192))
			{
				am = false;
				return;
			}
			if (a.a(2))
			{
				ai -= 8;
				if (ai < aj)
				{
					ai = aj;
					return;
				}
			} else
			if (a.a(1))
			{
				ai += 8;
				if (ai > 0)
					ai = 0;
			}
			return;
		}
		int i1;
		switch (i1 = b(ak))
		{
		case -1: 
			if (ak[2] > 0)
			{
				am = true;
				ai = 0;
				aj = 0;
				return;
			}
			break;

		case -2: 
			f();
			a(3);
			break;
		}
	}

	private static final void i(Graphics g1)
	{
		v.a(g1, new int[] {
			0, 0, 0, 240, 320
		}, c, d, true);
		int ai1[][] = c(0x20300);
		int ai3[] = null;
		a(g1, 0x20300);
		ai3 = ai1[0];
		g1.setColor(0xca993a);
		g1.setFont(h.a);
		g1.drawString("刀剑江湖录", ai3[1] + ai3[3] / 2, ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 17);
		ai3 = ai1[1];
		g1.setColor(0xffffff);
		g1.drawString("任务表", ai3[1] + ai3[3] / 2, ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 17);
		ai3 = ai1[8];
		g1.setColor(0xf3d385);
		g1.drawString(u[4] + v[4], ai3[1] + ai3[3] / 2, ai3[2] + (ai3[4] - g1.getFont().getHeight()) / 2, 17);
		a(g1, ak, al, new int[][] {
			ai1[2], ai1[3], ai1[4], ai1[5], ai1[6]
		}, ai1[7], 0x20301, -1, 3);
		byte byte0 = ak[1];
		byte byte1 = ak[3];
		boolean flag = false;
		for (int i1 = 0; i1 < ak[3]; i1++)
		{
			int ai4[] = ai1[2 + i1];
			int j1;
			if ((j1 = byte1 * byte0 + i1) >= a(ak))
				break;
			if (k.a(a(al[j1][0]), (byte)100))
				a(g1, 0x20303, new int[] {
					0, (ai4[1] + ai4[3]) - 20, ai4[2], 20, ai4[4]
				});
			else
				a(g1, 0x20302, new int[] {
					0, (ai4[1] + ai4[3]) - 20, ai4[2], 20, ai4[4]
				});
		}

		if (am)
		{
			int ai2[][] = c(0x20406);
			v.a(g1, ai2[0], c, d, true);
			a(g1, 0x20406);
			g1.setColor(0xffffff);
			int ai5[] = ai2[1];
			String s1;
			s1 = (s1 = al[d(ak)][0]).substring(s1.indexOf(" ") + 1);
			g1.drawString(s1, ai5[1] + ai5[3] / 2, ai5[2] + (ai5[4] - g1.getFont().getHeight()) / 2, 17);
			ai5 = ai2[2];
			int k1;
			if ((k1 = v.a(g1, al[d(ak)][2], ai, ai5, 17)) > ai5[4])
			{
				if (ai == 0)
					a(g1, 7, new int[] {
						0, ai5[1] + ai5[3], ai5[2] + ai5[4], 1, 1
					});
				else
				if (ai == ai5[4] - k1)
				{
					a(g1, 8, new int[] {
						0, ai5[1] + ai5[3], ai5[2], 1, 1
					});
				} else
				{
					a(g1, 7, new int[] {
						0, ai5[1] + ai5[3], ai5[2] + ai5[4], 1, 1
					});
					a(g1, 8, new int[] {
						0, ai5[1] + ai5[3], ai5[2], 1, 1
					});
				}
				aj = ai5[4] - k1;
			}
		}
	}

	private static final void B()
	{
		C();
	}

	private static void C()
	{
		int i1;
		int j1;
		short word0;
		int k1;
		k.k();
		i1 = 0;
		j1 = 0;
		word0 = 0;
		k1 = 0;
_L3:
		if (k1 >= 2) goto _L2; else goto _L1
_L1:
		ByteArrayInputStream bytearrayinputstream;
		DataInputStream datainputstream;
		if (!k.aN[k1])
			continue; /* Loop/switch isn't completed */
		bytearrayinputstream = null;
		datainputstream = null;
		bytearrayinputstream = new ByteArrayInputStream(k.aM[k1]);
		datainputstream = new DataInputStream(bytearrayinputstream);
		i1 = datainputstream.readInt();
		j1 = datainputstream.readInt();
		datainputstream.readShort();
		word0 = datainputstream.readShort();
		bytearrayinputstream.close();
		break MISSING_BLOCK_LABEL_98;
		JVM INSTR dup ;
		Exception exception;
		exception;
		printStackTrace();
		break MISSING_BLOCK_LABEL_98;
		Exception exception1;
		exception1;
		throw exception1;
		int l1;
		int i2 = (l1 = (i1 * 70) / 1000) / 3600;
		int j2 = (l1 % 3600) / 60;
		int k2 = l1 % 60;
		k[k1] = (new String[] {
			k.ad[j1], "级别:" + String.valueOf(word0), "总时间:" + v.a(i2, 10, 2, '0') + ":" + v.a(j2, 10, 2, '0') + ":" + v.a(k2, 10, 2, '0')
		});
		k1++;
		  goto _L3
_L2:
	}

	private static final void D()
	{
		int i1;
		switch (i1 = e(ao))
		{
		case -1: 
			return;

		case -2: 
			f();
			a(3);
			break;
		}
	}

	private static final void j(Graphics g1)
	{
		v.a(g1, new int[] {
			0, 0, 0, 240, 320
		}, c, d, true);
		int ai1[][] = c(0x20500);
		a(g1, 0x20500);
		int ai2[] = ai1[0];
		g1.setColor(0xca993a);
		g1.setFont(h.a);
		g1.drawString("刀剑江湖录", ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17);
		ai2 = ai1[1];
		v.a(g1, "声音", ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17, 0xffffff, 0);
		b(g1, 3, 237, ai2[2]);
		b(g1, 3, 237, ai2[2] + ai2[4]);
		for (int i1 = 0; i1 < an.length; i1++)
		{
			ai2 = ai1[2 + i1];
			if (i1 == ao[0])
			{
				a(g1, 2, ai2);
				v.a(g1, an[i1], ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17, 0xffffff, 0);
			} else
			{
				g1.setColor(0x9e9795);
				g1.drawString(an[i1], ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17);
			}
		}

		ai2 = ai1[4];
		v.a(g1, "存档", ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17, 0xffffff, 0);
		b(g1, 3, 237, ai2[2]);
		b(g1, 3, 237, ai2[2] + ai2[4]);
		ai2 = ai1[5];
		g1.setColor(0xffffff);
		g1.drawString(k[0][0], ai2[1] + (ai2[3] >> 1), ai2[2], 17);
		g1.drawString(k[0][1], ai2[1] + ai2[3] / 2, ai2[2] + h.d, 17);
		g1.drawString(k[0][2], ai2[1] + ai2[3] / 2, ai2[2] + h.d * 2, 17);
		ai2 = ai1[6];
		g1.setColor(0xf3d385);
		g1.drawString(u[4] + v[4], ai2[1] + ai2[3] / 2, ai2[2] + (ai2[4] - g1.getFont().getHeight()) / 2, 17);
	}

	private static final void E()
	{
		at[0] = 0;
		Vector vector = new Vector();
		switch (ay)
		{
		default:
			break;

		case 0: // '\0'
		case 2: // '\002'
		case 4: // '\004'
			az = false;
			aA = null;
			byte abyte0[] = o.b(ay);
			for (int i1 = 0; i1 < abyte0.length; i1++)
			{
				byte byte0 = abyte0[i1];
				Vector vector1;
				(vector1 = new Vector()).addElement(String.valueOf(byte0) + " " + o.l[byte0][0]);
				vector1.addElement(" " + o.m[byte0]);
				vector1.addElement(o.l[byte0][1]);
				vector.addElement(vector1);
			}

			break;

		case 1: // '\001'
		case 3: // '\003'
		case 5: // '\005'
		case 6: // '\006'
			az = true;
			aA = o.a(ay);
			for (int j1 = 0; j1 < aA.length; j1++)
			{
				o o1 = aA[j1];
				Vector vector2;
				(vector2 = new Vector()).addElement(String.valueOf(j1) + " " + o1.f);
				vector2.addElement(" " + o1.a());
				vector2.addElement(o1.d());
				vector.addElement(vector2);
			}

			break;
		}
		ax[0] = b(vector);
		a(aw[0], ax[0].length);
		F();
	}

	private static final void F()
	{
		Vector vector = new Vector();
		if (az)
		{
			Enumeration enumeration = t.X.keys();
			do
			{
				if (!enumeration.hasMoreElements())
					break;
				String s1;
				int j1;
				if ((j1 = Integer.parseInt(s1 = (String)enumeration.nextElement())) != ((z) (t)).f[26] && j1 != ((z) (t)).f[27] && j1 != ((z) (t)).f[28] && j1 != ((z) (t)).f[29])
				{
					o o1 = (o)t.X.get(s1);
					Vector vector2;
					(vector2 = new Vector()).addElement(s1 + " " + o1.f + "X" + o1.h[18]);
					vector2.addElement(" " + (o1.a() >> 1));
					vector2.addElement(" " + o1.d());
					vector.addElement(vector2);
				}
			} while (true);
		} else
		{
			for (int i1 = 0; i1 < o.l.length; i1++)
				if (t.Y[i1] > 0)
				{
					Vector vector1;
					(vector1 = new Vector()).addElement(String.valueOf(i1) + " " + o.l[i1][0] + "X" + t.Y[i1]);
					vector1.addElement(" " + (o.m[i1] >> 1));
					vector1.addElement(o.l[i1][1]);
					vector.addElement(vector1);
				}

		}
		ax[1] = b(vector);
		a(aw[1], ax[1].length);
		g();
	}

	public static final void a(byte byte0)
	{
		ay = byte0;
	}

	private static final void G()
	{
		boolean flag = false;
		if (aC)
		{
			if (a.c())
				aC = false;
			return;
		}
		if (aH)
		{
			if (a.c())
				aH = false;
			return;
		}
		if (aE)
		{
			if (a.c(20480))
			{
				if (ax[0].length > 0)
				{
					int i2 = a(ax[0][d(aw[0])][0]);
					boolean flag1;
					if (az)
						flag1 = t.a(aA[i2]);
					else
						flag1 = t.a((short)i2, 1);
					if (flag1)
					{
						t.r(t.J() - aB);
						F();
					} else
					{
						aH = true;
					}
				}
				aE = false;
				return;
			}
			if (a.c(8192))
				aE = false;
			return;
		}
		if (aG)
		{
			if (a.c(20480))
			{
				int j2 = a(ax[1][d(aw[1])][0]);
				aG = false;
				aF = false;
				if (az)
					t.X.remove(String.valueOf(j2));
				else
					t.a((short)j2, -1);
				t.q(aB);
				F();
				return;
			}
			if (a.c(8192))
				aG = false;
			return;
		}
		if (aD)
		{
			int i1 = e(au);
			if (a.a(2))
			{
				ai -= 8;
				if (ai < aj)
					ai = aj;
			} else
			if (a.a(1))
			{
				ai += 8;
				if (ai > 0)
					ai = 0;
			}
			switch (i1)
			{
			case -1: 
				if (au[0] == 0)
				{
					aB = Integer.parseInt(ax[0][d(aw[0])][1].trim());
					if (t.J() >= aB)
					{
						aE = true;
						aD = false;
						return;
					} else
					{
						aC = true;
						aD = false;
						return;
					}
				}
				if (au[0] == 1)
				{
					aD = false;
					return;
				}
				break;

			case -2: 
				aD = false;
				break;
			}
			return;
		}
		if (aF)
		{
			int j1 = e(av);
			if (a.a(2))
			{
				ai -= 8;
				if (ai < aj)
					ai = aj;
			} else
			if (a.a(1))
			{
				ai += 8;
				if (ai > 0)
					ai = 0;
			}
			switch (j1)
			{
			case -1: 
				if (av[0] == 0)
				{
					aG = true;
					aF = false;
					return;
				}
				if (av[0] == 1)
				{
					aF = false;
					return;
				}
				break;

			case -2: 
				aF = false;
				break;
			}
			return;
		}
		e(at);
		switch (at[0])
		{
		case 0: // '\0'
			int k1;
			switch (k1 = b(aw[0]))
			{
			default:
				break;

			case -1: 
				if (ax[0].length > 0)
				{
					aD = true;
					ai = 0;
					aj = 0;
				}
				break;

			case -2: 
				f();
				k.a((byte)8);
				break;
			}
			return;