g.java

J2ME写的英译汉字典 比较适合新手练手用！！！！！

			}, {
				5, 10, 0, -10
			}, {
				5, 10, -5, -10
			}, {
				5, 10, -5, -20
			}, {
				5, 10, 0, -20
			}
		};
		boolean flag3 = false;
		for (int k2 = d / 20; k2 < i1; k2++)
		{
			if (k2 < 0)
				continue;
			for (int i3 = c / 20; i3 < j1; i3++)
			{
				if (i3 < 0)
					continue;
				for (int k3 = 0; k3 < ai.length; k3++)
				{
					if (aE[k2][i3] != ai[k3][0])
						continue;
					if ((ai[k3][3] == 0 || ai[k3][3] == 2) && k2 > 0)
						if (aE[k2 - 1][i3] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 - 1][i3] != aE[k2][i3])
							l1.a(ai[k3][2], i3 * 20 - c, k2 * 20 - d, ai3[0][0], ai3[0][1], ai3[0][2], ai3[0][3]);
						else
						if (ai[k3][3] == 0)
						{
							boolean flag4 = false;
							if (i3 > 0)
							{
								if (aE[k2][i3 - 1] == aE[k2][i3])
									flag4 = true;
								if (flag4 && (aE[k2 - 1][i3 - 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 - 1][i3 - 1] != aE[k2][i3]))
									l1.a(ai[k3][2], i3 * 20 - c, k2 * 20 - d, ai3[4][0], ai3[4][1], ai3[4][2], ai3[4][3]);
							}
							flag4 = false;
							if (i3 < aE[0].length - 1)
							{
								if (aE[k2][i3 + 1] == aE[k2][i3])
									flag4 = true;
								if (flag4 && (aE[k2 - 1][i3 + 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 - 1][i3 + 1] != aE[k2][i3]))
									l1.a(ai[k3][2], (i3 + 1) * 20 - ai3[5][0] - c, k2 * 20 - d, ai3[5][0], ai3[5][1], ai3[5][2], ai3[5][3]);
							}
						}
					if ((ai[k3][3] == 0 || ai[k3][3] == 1) && k2 < aE.length - 1)
						if (aE[k2 + 1][i3] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 + 1][i3] != aE[k2][i3])
							l1.a(ai[k3][2], i3 * 20 - c, (k2 + 1) * 20 - ai3[2][1] - d, ai3[2][0], ai3[2][1], ai3[2][2], ai3[2][3]);
						else
						if (ai[k3][3] == 0)
						{
							boolean flag5 = false;
							if (i3 > 0)
							{
								if (aE[k2][i3 - 1] == aE[k2][i3])
									flag5 = true;
								if (flag5 && (aE[k2 + 1][i3 - 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 + 1][i3 - 1] != aE[k2][i3]))
									l1.a(ai[k3][2], i3 * 20 - c, (k2 * 20 + ai3[1][1]) - ai3[7][1] - d, ai3[7][0], ai3[7][1], ai3[7][2], ai3[7][3]);
							}
							flag5 = false;
							if (i3 < aE[0].length - 1)
							{
								if (aE[k2][i3 + 1] == aE[k2][i3])
									flag5 = true;
								if (flag5 && (aE[k2 + 1][i3 + 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2 + 1][i3 + 1] != aE[k2][i3]))
									l1.a(ai[k3][2], (i3 + 1) * 20 - ai3[6][0] - c, (k2 * 20 + ai3[1][1]) - ai3[6][1] - d, ai3[6][0], ai3[6][1], ai3[6][2], ai3[6][3]);
							}
						}
					if (ai[k3][3] != 0)
						continue;
					if (i3 > 0 && (aE[k2][i3 - 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2][i3 - 1] != aE[k2][i3]))
						l1.a(ai[k3][2], i3 * 20 - c, k2 * 20 - d, ai3[3][0], ai3[3][1], ai3[3][2], ai3[3][3]);
					if (i3 < aE[0].length - 1 && (aE[k2][i3 + 1] == ai[k3][1] || -1 == ai[k3][1] && aE[k2][i3 + 1] != aE[k2][i3]))
						l1.a(ai[k3][2], (i3 + 1) * 20 - ai3[1][0] - c, k2 * 20 - d, ai3[1][0], ai3[1][1], ai3[1][2], ai3[1][3]);
					if (-1 != ai[k3][1])
						continue;
					if (k2 > 0)
					{
						if (i3 > 0 && aE[k2][i3 - 1] != aE[k2][i3] && aE[k2 - 1][i3] != aE[k2][i3])
							l1.a(ai[k3][2], i3 * 20 - c, k2 * 20 - d, ai3[4][0], ai3[4][1], ai3[4][2], ai3[4][3]);
						if (i3 < aE[0].length - 1 && aE[k2][i3 + 1] != aE[k2][i3] && aE[k2 - 1][i3] != aE[k2][i3])
							l1.a(ai[k3][2], (i3 + 1) * 20 - ai3[5][0] - c, k2 * 20 - d, ai3[5][0], ai3[5][1], ai3[5][2], ai3[5][3]);
					}
					if (k2 >= aE.length - 1)
						continue;
					if (i3 > 0 && aE[k2][i3 - 1] != aE[k2][i3] && aE[k2 + 1][i3] != aE[k2][i3])
						l1.a(ai[k3][2], i3 * 20 - c, (k2 * 20 + ai3[1][1]) - ai3[7][1] - d, ai3[7][0], ai3[7][1], ai3[7][2], ai3[7][3]);
					if (i3 < aE[0].length - 1 && aE[k2][i3 + 1] != aE[k2][i3] && aE[k2 + 1][i3] != aE[k2][i3])
						l1.a(ai[k3][2], (i3 + 1) * 20 - ai3[6][0] - c, (k2 * 20 + ai3[1][1]) - ai3[6][1] - d, ai3[6][0], ai3[6][1], ai3[6][2], ai3[6][3]);
				}

			}

		}

		int l2;
		int j3;
		int l3;
		int i4;
		int k4;
		switch (O)
		{
		case 6: // '\006'
		case 9: // '\t'
		case 12: // '\f'
			switch (j)
			{
			case 4: // '\004'
				a(l1, (byte)1);
				break;

			case 7: // '\007'
			case 11: // '\013'
				a(l1, (byte)3);
				break;
			}
			// fall through

		default:
			l2 = l1.b(3) / ad[0];
			j3 = l1.c(3) / ad[1];
			l3 = l1.c(2) / ad[1];
			i4 = 1980;
			boolean flag6 = false;
			boolean flag7 = false;
			k4 = 0;
			break;
		}
		for (; k4 < 3; k4++)
		{
			switch (k4)
			{
			default:
				break;

			case 0: // '\0'
				ah1 = aH;
				if (O == 6)
					i4 = 1000;
				else
					i4 = 1980;
				break;

			case 1: // '\001'
				ah1 = aI;
				if (O == 12)
					i4 = 1000;
				else
					i4 = 1980;
				break;

			case 2: // '\002'
				ah1 = aJ;
				if (O == 9)
					i4 = 1000;
				else
					i4 = 1980;
				break;
			}
			for (int j5 = 0; j5 < ah1.length; j5++)
			{
				if (ah1[j5].p == 3 && (O == 7 || g - R > 10))
				{
					ah1[j5].p = 4;
					ah1[j5].r = true;
				}
				if ((ah1[j5].b - c) + 20 < 0 || (ah1[j5].c - d) + 20 < 0 || ah1[j5].b - c > e || ah1[j5].c - d > f || ah1[j5].p == 4 || ah1[j5].e == -2 || ah1[j5].e == -1 || ah1[j5].p == 3 && g % 2 == 0)
					continue;
				int j4 = 0;
				if ((j == 8 || j == 12) && I != null)
				{
					for (int k5 = 0; k5 < I.length; k5++)
					{
						if (I[k5] != ah1[j5].s)
							continue;
						byte byte2 = H[k5];
						if (j5 != byte2 || g - v >= 6)
							continue;
						j4 = (((g - v) / 2) % 2) * 2;
						break;
					}

				}
				byte byte4 = ak[ah1[j5].a][1];
				l1.a(2, (ah1[j5].b - c) + j4, (ah1[j5].c - d) + 13, l2, l3, -(byte4 % ad[0]) * l2, -(byte4 / ad[0]) * l3);
				l1.a(3, (ah1[j5].b - c) + j4, (ah1[j5].c - d) + (System.currentTimeMillis() % (long)i4 <= (long)(i4 / 2) ? 0 : 1), l2, j3, -(byte4 % ad[0]) * l2, -(byte4 / ad[0]) * j3);
				if (ah[aE[ah1[j5].c / 20][ah1[j5].b / 20]][3] != -1)
					l1.a(ah[aE[ah1[j5].c / 20][ah1[j5].b / 20]][3], ah1[j5].b - c, (ah1[j5].c - d) + ((20 - l1.c(ah[aE[ah1[j5].c / 20][ah1[j5].b / 20]][3])) + (System.currentTimeMillis() % (long)i4 <= (long)(i4 / 2) ? 0 : 1)));
				if (ah1[j5].n > 0)
					l1.a(ar[12], ah1[j5].b - c, ah1[j5].c - d - (l1.c(ar[12]) - 20) / 2, l1.b(ar[12]) / 2, l1.c(ar[12]), (-l1.b(ar[12]) / 2) * (g % 2), 0);
				if (ah1[j5].p == 2)
					l1.a(5, (ah1[j5].b - c) + 15, (ah1[j5].c - d) + 12);
			}

		}

		if (j != 5 && j != 8 && j != 12 && a.e != 6)
			a(l1, (byte)0);
		ah2 = aI;
		switch (O)
		{
		case 6: // '\006'
			ah1 = aH;
			break;

		case 12: // '\f'
			ah1 = aI;
			ah2 = aH;
			break;

		case 9: // '\t'
			ah1 = aJ;
			break;
		}
		l1.c(0, 0, e, f);
		switch (O)
		{
		case 20: // '\024'
		default:
			break;

		case 3: // '\003'
		case 18: // '\022'
			(new m()).a(l1, (byte)0, this);
			break;

		case 4: // '\004'
		case 5: // '\005'
		case 6: // '\006'
		case 9: // '\t'
		case 12: // '\f'
			byte byte0 = -1;
			byte byte1 = -1;
			if (M[i / 20][h / 20] > -1)
				byte0 = M[i / 20][h / 20];
			if (N[i / 20][h / 20] > -1)
				byte1 = N[i / 20][h / 20];
			int i5;
			switch (j)
			{
			case 0: // '\0'
				if (j != 14)
					if (byte0 > -1 || byte1 > -1)
					{
						if (t == 48)
						{
							int l4 = 0;
							if (byte1 > -1)
							{
								ah2 = aI;
								l4 = byte1;
							} else
							if (byte0 > -1)
								if (byte0 >= 16)
								{
									ah2 = aJ;
									l4 = byte0 - 16;
								} else
								{
									ah2 = aH;
									l4 = byte0;
								}
							if (B == null)
								a(new int[] {
									h / 20, i / 20
								}, (byte)ah2[l4].m[4], (byte)1, ah2[l4].s);
							a(l1, (byte)1);
							a(l1, byte0, ((byte)(byte0 < 16 ? 0 : 2)), byte1, (byte)1);
						} else
						if (a.l == 1 && O == 6 && a.e != 6)
						{
							l1.c(0, 0, e, f);
							(new j()).a(l1, 0, f - 21, 50, 21);
							a.c.a(l1, 7, (f - 21) + 4, "#:CONFIRM");
							a.c.a(l1, 7, (f - 21) + 11, "*:MENU");
						}
					} else
					if (g > w + 14 && a.e != 6)
					{
						byte byte5 = ah[aE[i / 20][h / 20]][1];
						l1.c(0, 0, e, f);
						(new j()).a(l1, 0, f - 19, 45, 19);
						a.c.a(l1, 5, (f - 19) + 3, ag[aE[i / 20][h / 20]]);
						a.c.a(l1, 5, (f - 19) + 10, (byte5 != 0 ? byte5 <= 0 ? "" + byte5 : "+" + byte5 : "@0") + "%");
					} else
					if (a.l == 1 && O == 6 && a.e != 6)
					{
						l1.c(0, 0, e, f);
						(new j()).a(l1, 0, f - 21, 50, 21);
						a.c.a(l1, 7, (f - 21) + 4, "#:CONFIRM");
						a.c.a(l1, 7, (f - 21) + 11, "*:MENU");
					}
				break;

			case 3: // '\003'
			case 6: // '\006'
				if (byte0 > -1 || byte1 > -1)
					a(l1, byte0, ((byte)(byte0 < 16 ? 0 : 2)), byte1, (byte)1);
				if (O == 6)
					(new m()).a(l1, (byte)12, this);
				break;

			case 5: // '\005'
				if ((i5 = g - v) - 1 >= 0 && i5 - 1 < C.length)
				{
					ah1[y].b = C[i5 - 1][0] * 20;
					ah1[y].c = C[i5 - 1][1] * 20;
					a(new int[] {
						ah1[y].b, ah1[y].c
					});
				}
				break;

			case 4: // '\004'
				if (a.l == 1 && O == 6 && a.e != 6)
				{
					l1.c(0, 0, e, f);
					(new j()).a(l1, 0, f - 21, 50, 21);
					a.c.a(l1, 7, (f - 21) + 4, "#:CONFIRM");
					a.c.a(l1, 7, (f - 21) + 11, "0:BACK");
				}
				break;

			case 7: // '\007'
			case 11: // '\013'
				byte byte3 = -1;
				byte byte6 = 0;
				if (ah1[y].s == 1)
				{
					if (M[i / 20][h / 20] != -1)
						byte6 = ((byte)((byte3 = M[i / 20][h / 20]) < 16 ? 0 : 2));
					if (j == 11 && N[i / 20][h / 20] != -1)
					{
						byte3 = N[i / 20][h / 20];
						byte6 = 1;
					}
					a(l1, byte3, byte6, y, ah1[y].s);
				} else
				{
					if (N[i / 20][h / 20] > -1)
					{
						byte3 = N[i / 20][h / 20];
						byte6 = 1;
					}
					if (j == 11 && M[i / 20][h / 20] > -1)
						byte6 = ((byte)((byte3 = M[i / 20][h / 20]) < 16 ? 0 : 2));
					a(l1, y + (ah1[y].s != 2 ? 0 : 16), ah1[y].s, byte3, byte6);
				}
				break;

			case 8: // '\b'
			case 12: // '\f'
				int l5 = 0;
				boolean flag8 = false;
				if (j == 8)
					l5 = am[ak[ah1[y].a][0]][6];
				else
				if (Y != null)
					l5 = at[Y[T]][3];
				for (int j6 = 0; j6 < I.length; j6++)
				{
					switch (I[j6])
					{
					case 1: // '\001'
						ah2 = aI;
						break;

					case 0: // '\0'
						ah2 = aH;
						break;

					case 2: // '\002'
						ah2 = aJ;
						break;
					}
					int i6 = a(l1, l5, ah2[H[j6]].b, ah2[H[j6]].c);
					if (g - v <= i6 + 1)
						continue;
					String s1 = z[j6] <= 0 ? z[j6] >= 0 ? "@0" : "" + z[j6] : "+" + z[j6];
					if (j != 12 || z[j6] != 0)
					{
						l1.c(((ah2[H[j6]].b - c) + 10) - 1 - a.c.a(s1) / 2, ah2[H[j6]].c - d - (g - v - i6) - 1, a.c.a(s1) + 2, a.c.a() + 2);
						l1.f(-2);
						l1.b(((ah2[H[j6]].b - c) + 10) - 1 - a.c.a(s1) / 2, ah2[H[j6]].c - d - (g - v - i6) - 1, a.c.a(s1) + 2, a.c.a() + 2);
						a.c.a(l1, (ah2[H[j6]].b - c) + 10, ah2[H[j6]].c - d - (g - v - i6), s1, (byte)1);
					}
					if (g - v < i6 + 7 && (j != 12 || z[j6] != 0))
						continue;
					if (l5 >= 0)
						b.f().d(ar[l5]);
					a(new int[] {
						ah1[y].b, ah1[y].c
					});
					F = true;
					break;
				}

				if (ah1[y].s == 1)
					a(l1, H[0] + (I[0] != 2 ? 0 : 16), I[0], y, ah1[y].s);
				else
					a(l1, y + (ah1[y].s != 2 ? 0 : 16), ah1[y].s, H[0] + (I[0] != 2 ? 0 : 16), I[0]);
				break;

			case 9: // '\t'
				(new m()).a(l1, (byte)1, this);
				break;

			case 10: // '\n'
				(new m()).a(l1, (byte)2, this);
				break;

			case 13: // '\r'
				b(l1);
				break;

			case 14: // '\016'
				(new j()).a(l1, 0, f - 50, 65, 50);
				for (int k6 = 0; k6 < q.length; k6++)
					a.c.a(l1, 10, (f - 50) + 5 + 7 * k6, q[k6]);

				l1.a(1, 3, ((f - 50) + 5 + 7 * l) - 3, 6, 10, 0, 0);
				break;

			case 15: // '\017'
				(new m()).a(l1, (byte)3, this);
				break;

			case 17: // '\021'
				(new m()).a(l1, (byte)4, this);
				break;

			case 18: // '\022'
				(new m()).a(l1, (byte)5, this);
				break;

			case 19: // '\023'
			case 20: // '\024'
				(new m()).a(l1, (byte)6, this);
				break;
			}
			if (O == 5 || O == 4)
				break;
			// fall through

		case 8: // '\b'
		case 11: // '\013'
		case 14: // '\016'
			if (g - P <= 5 || O == 8 || O == 14 || O == 11)
				(new m()).a(l1, (byte)7, this);
			break;

		case 7: // '\007'
		case 10: // '\n'
		case 13: // '\r'
			(new m()).a(l1, (byte)11, this);
			break;

		case 15: // '\017'
		case 16: // '\020'
		case 17: // '\021'
			(new m()).a(l1, (byte)8, this);
			break;

		case 19: // '\023'
			(new m()).a(l1, (byte)9, this);
			break;

		case 21: // '\025'
			(new m()).a(l1, (byte)13, this);
			break;
		}
		if (a.e == 6)
			(new m()).a(l1, (byte)10, this);
		switch (O)
		{
		case 6: // '\006'
			switch (j)
			{
			case 0: // '\0'
			case 4: // '\004'
			case 7: // '\007'
			case 11: // '\013'
				if ((t | s | u) != 0)
				{
					w = g;
					if (t != 0 && s != 0 && t != s)
						t = s;
					if (t != 0 && u != 0 && t != u)
						u = t;
					if (u != 0 && s != 0 && u != s)
						u = s;
				}
				switch (t | s | u)
				{
				case 0: // '\0'
					if (g - w <= 3)
						break;
					if (h % 20 != 0)
					{
						c = c - h % 20;
						h = h - h % 20;
					}
					if (i % 20 != 0)
					{
						d = d - i % 20;
						i = i - i % 20;
						return;
					}
					break;

				case -1: 
				case 50: // '2'
					if (g - v > 7 && i % 20 == 0)
					{
						i -= 20;
						d -= 20;
					} else
					{
						i -= 10;
						d -= 10;
					}
					if (i < 0)
					{
						d -= i;
						i = 0;
					}
					if (i % 20 == 0)
						u = 0;
					else
						u = t | s | u;
					s = 0;
					return;

				case -2: 
				case 56: // '8'
					if (g - v > 7 && i % 20 == 0)
					{
						i += 20;
						d += 20;
					} else
					{
						i += 10;
						d += 10;
					}
					if (i > (aE.length - 1) * 20)
					{
						d -= i - (aE.length - 1) * 20;
						i = (aE.length - 1) * 20;
					}
					if (i % 20 == 0)
						u = 0;
					else
						u = t | s | u;
					s = 0;
					return;

				case -3: 
				case 52: // '4'
					if (g - v > 7 && h % 20 == 0)
					{
						h -= 20;
						c -= 20;
					} else
					{
						h -= 10;
						c -= 10;
					}
					if (h < 0)
					{
						c -= h;
						h = 0;
					}
					if (h % 20 == 0)
						u = 0;
					else
						u = t | s | u;
					s = 0;
					return;

				case -4: 
				case 54: // '6'
					if (g - v > 7 && h % 20 == 0)
					{
						h += 20;
						c += 20;
					} else
					{
						h += 10;
						c += 10;
					}
					if (h > (aE[0].length - 1) * 20)
					{
						c -= h - (h = (aE[0].length - 1) * 20);
						h = (aE[0].length - 1) * 20;
					}
					if (h % 20 == 0)
						u = 0;
					else
						u = t | s | u;
					s = 0;
					return;

				default:
					s = 0;