g.java

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

							v = g;
							break;

						case 7: // '\007'
							a(new int[] {
								K[0], K[1]
							});
							a((byte)4);
							v = g;
							break;

						case 11: // '\013'
							a(new int[] {
								K[0], K[1]
							});
							a((byte)3);
							v = g;
							break;
						}
					}
			}
			// fall through

		case 6: // '\006'
			if (a.e != 1)
				return;
			if (x >= 120)
			{
				O = 15;
				P = g;
			}
			switch (j)
			{
			case 6: // '\006'
			case 7: // '\007'
			case 10: // '\n'
			case 11: // '\013'
			case 13: // '\r'
			case 14: // '\016'
			case 15: // '\017'
			case 16: // '\020'
			case 17: // '\021'
			case 18: // '\022'
			default:
				break;

			case 5: // '\005'
				if (ah1[y].b == C[C.length - 1][0] * 20 && ah1[y].c == C[C.length - 1][1] * 20)
				{
					d(ah1[y]);
					if (b(ah1[y]) && (am[ak[ah1[y].a][0]][7] == 0 || am[ak[ah1[y].a][0]][7] == -1))
						p = n[3];
					else
						p = n[2];
					l = 0;
					m = 0;
					C = (byte[][])null;
					B = (byte[][])null;
					j = 6;
				}
				break;

			case 8: // '\b'
				if (!F)
					break;
				h ah5[] = aI;
				switch (I[0])
				{
				case 0: // '\0'
					ah5 = aH;
					break;

				case 1: // '\001'
					ah5 = aI;
					break;

				case 2: // '\002'
					ah5 = aJ;
					break;
				}
				int j11 = 0;
				boolean flag23 = false;
				j11 = ah1[y].f;
				for (int k14 = 0; k14 < A.length; k14++)
					A[k14] = 0;

				ah5[H[0]].k += z[0];
				if (ah5[H[0]].k <= 0)
				{
					ah5[H[0]].k = 0;
					ah5[H[0]].p = 3;
					k.b();
					ah5[H[0]].r = true;
					d(ah5[H[0]]);
					R = g;
				} else
				if (ah5[H[0]].s != 1)
				{
					int i12 = ah5[H[0]].f;
					ah5[H[0]].a(10, (-z[0] * 100) / ah5[H[0]].m[0], 0, ah1[y].f / 100);
					if (i12 / 100 != ah5[H[0]].f / 100)
					{
						A[0] = 1;
						a(ah5[H[0]]);
						S = g;
					}
				}
				if (ah1[y].s != 1)
				{
					ah1[y].a(40, (-z[0] * 100) / ah5[H[0]].m[0], ah5[H[0]].k > 0 ? 0 : 10, ah5[H[0]].f / 100);
					if (j11 / 100 != ah1[y].f / 100)
					{
						A[4] = 1;
						a(ah1[y]);
						S = g;
					}
				}
				C = (byte[][])null;
				B = (byte[][])null;
				ah1[y].p = 2;
				j = 0;
				for (int l14 = 0; l14 < A.length; l14++)
					if (A[l14] == 1)
					{
						j = 9;
						S = g;
					}

				if (j != 9)
					e();
				break;

			case 9: // '\t'
				if (g - S > 10)
				{
					A = null;
					H = null;
					I = null;
					System.gc();
					j = 0;
					e();
				}
				break;

			case 12: // '\f'
				if (!F || Y == null)
					break;
				switch (O)
				{
				case 12: // '\f'
					ah1 = aI;
					break;

				case 6: // '\006'
					ah1 = aH;
					break;

				case 9: // '\t'
					ah1 = aJ;
					break;
				}
				int k9 = 0;
				boolean flag22 = false;
				k9 = ah1[y].f;
				for (int j12 = 0; j12 < A.length; j12++)
					A[j12] = 0;

				for (int k12 = 0; k12 < H.length; k12++)
				{
					switch (I[k12])
					{
					case 1: // '\001'
						ah2 = aI;
						break;

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

					case 2: // '\002'
						ah2 = aJ;
						break;
					}
					int k11 = ah2[H[k12]].f;
					a(ah2[H[k12]], ah1[y], at[Y[T]], true);
					if (ah2[H[k12]].k > 0 && k11 / 100 != ah2[H[k12]].f / 100)
					{
						A[k12] = 1;
						a(ah2[H[k12]]);
						S = g;
					}
				}

				if (k9 / 100 != ah1[y].f / 100)
				{
					A[4] = 1;
					a(ah1[y]);
					S = g;
				} else
				{
					ah1[y].l -= (ah1[y].m[1] * at[Y[T]][0]) / 100;
				}
				Y = null;
				C = (byte[][])null;
				B = (byte[][])null;
				ah1[y].p = 2;
				j = 0;
				for (int l12 = 0; l12 < A.length; l12++)
					if (A[l12] == 1)
					{
						j = 9;
						S = g;
					}

				if (j != 9)
					e();
				break;

			case 19: // '\023'
				b((byte)2);
				j = 20;
				break;
			}
			return;

		case 8: // '\b'
		case 11: // '\013'
		case 14: // '\016'
			P = g;
			b((byte)1);
			switch (O)
			{
			default:
				break;

			case 11: // '\013'
				k.a();
				ah4 = aJ;
				ah1 = aI;
				ah2 = aH;
				abyte0 = N;
				abyte1 = M;
				k.a(2, true);
				break;

			case 8: // '\b'
				if (aJ.length == 0)
				{
					k.a();
					ah1 = aI;
					ah2 = aH;
					abyte0 = N;
					abyte1 = M;
					k.a(2, true);
				} else
				{
					ah1 = aJ;
					ah2 = aI;
					abyte0 = M;
					abyte1 = N;
				}
				ah4 = aH;
				break;

			case 14: // '\016'
				k.a();
				ah4 = aI;
				ah1 = aH;
				break;
			}
			for (int l9 = 0; l9 < ah4.length; l9++)
			{
				if (ah4[l9].p == 3 || ah4[l9].p == 4 || ah4[l9].e == -2 || ah4[l9].e == -1)
					continue;
				if (aE[ah4[l9].c / 20][ah4[l9].b / 20] == 10 || aE[ah4[l9].c / 20][ah4[l9].b / 20] == 11)
				{
					ah4[l9].k += (ah4[l9].m[0] * 20) / 100;
					ah4[l9].l += (ah4[l9].m[1] * 15) / 100;
				}
				ah4[l9].l += (ah4[l9].m[1] * 10) / 100;
				if (ah4[l9].k > ah4[l9].m[0])
					ah4[l9].k = ah4[l9].m[0];
				if (ah4[l9].l > ah4[l9].m[1])
					ah4[l9].l = ah4[l9].m[1];
				if (ah4[l9].n > 0)
					ah4[l9].n--;
				if (ah4[l9].o <= 0)
					continue;
				ah4[l9].o--;
				if (ah4[l9].o == 0)
					ah4[l9].m = a(ah4[l9].a, ah4[l9].f / 100);
			}

			if (O != 14)
			{
				boolean flag15 = false;
				boolean flag20 = false;
				Object obj = null;
				Object obj1 = null;
				for (int i13 = 0; i13 < ah1.length; i13++)
				{
					ah1[i13].q = 0;
					if (ah1[i13].p == 3 || ah1[i13].p == 4)
						continue;
					if (ah1[i13].n > 0)
						ah1[i13].q = 2;
					else
					if (ah1[i13].h >= 0 && ah1[i13].i >= 0 && ah1[i13].g > x && ah1[i13].k == ah1[i13].m[0])
						ah1[i13].q = 3;
					else
					if (am[ak[ah1[i13].a][0]][7] == -3)
						ah1[i13].q = 1;
					else
					if (ah1[i13].k != ah1[i13].m[0] && ah1[i13].k + a(ah1[i13], ah2[0], a(ah2[0], new int[] {
	ah1[i13].b / 20, ah1[i13].c / 20
})) <= 0)
					{
						boolean flag16 = false;
						byte byte3 = a(ah1[i13], (byte)0);
						if (-1 != byte3 && ah1[i13].l >= (at[byte3][0] * ah1[i13].m[1]) / 100)
							flag16 = true;
						if (flag16)
							ah1[i13].q = 5;
						else
						if (aE[ah1[i13].c / 20][ah1[i13].b / 20] == 10 || aE[ah1[i13].c / 20][ah1[i13].b / 20] == 11)
							ah1[i13].q = 4;
						else
							ah1[i13].q = 6;
					}
					byte abyte4[] = new byte[ah1[i13].w.length];
					int k5 = 0;
					a(new int[] {
						ah1[i13].b / 20, ah1[i13].c / 20
					}, c(ah1[i13]), (byte)3, ah1[i13].s);
					if (B != null)
					{
						for (int j15 = 0; j15 < B.length; j15++)
						{
							for (int l15 = 0; l15 < B[0].length; l15++)
								if (B[j15][l15] != -100 && abyte1[j15 + E][l15 + D] != -1)
									abyte4[k5++] = abyte1[j15 + E][l15 + D];

						}

					}
					a(new int[] {
						ah1[i13].b / 20, ah1[i13].c / 20
					}, (byte)ah1[i13].m[4], (byte)1, ah1[i13].s);
					byte abyte5[][] = B;
					int i16 = D;
					int j16 = E;
					if (abyte5 != null)
					{
						for (int l16 = 0; l16 < abyte5.length; l16++)
						{
label0:
							for (int l17 = 0; l17 < abyte5[l16].length; l17++)
							{
								if (abyte5[l16][l17] == -100 || abyte0[l16 + j16][l17 + i16] != -1)
									continue;
								a(new int[] {
									l17 + i16, l16 + j16
								}, c(ah1[i13]), (byte)3, ah1[i13].s);
								if (B == null)
									continue;
								int l18 = 0;
								do
								{
									if (l18 >= B.length)
										continue label0;
									for (int l19 = 0; l19 < B[l18].length; l19++)
									{
										if (B[l18][l19] == -100 || abyte1[l18 + E][l19 + D] == -1)
											continue;
										boolean flag17 = false;
										int i20 = 0;
										do
										{
											if (i20 >= abyte4.length || i20 >= k5)
												break;
											if (abyte4[i20] == abyte1[l18 + E][l19 + D])
											{
												flag17 = true;
												break;
											}
											i20++;
										} while (true);
										if (!flag17)
											abyte4[k5++] = abyte1[l18 + E][l19 + D];
									}

									l18++;
								} while (true);
							}

						}

					}
					byte abyte2[] = new byte[k5];
					System.arraycopy(abyte4, 0, abyte2, 0, k5);
					byte abyte3[] = new byte[0];
					byte byte4;
					if ((byte4 = a(ah1[i13], (byte)2)) != -1)
					{
						a(new int[] {
							ah1[i13].b / 20, ah1[i13].c / 20
						}, (byte)4, (byte)4, ah1[i13].s);
						if (B != null)
						{
							int l5 = 0;
							for (int i17 = 0; i17 < B.length; i17++)
							{
								for (int i18 = 0; i18 < B[0].length; i18++)
								{
									if (B[i17][i18] < 0 || abyte1[i17 + E][i18 + D] < 0)
										continue;
									boolean flag18 = false;
									int i19 = 0;
									do
									{
										if (i19 >= abyte2.length)
											break;
										if (abyte2[i19] == abyte1[i17 + E][i18 + D])
										{
											flag18 = true;
											break;
										}
										i19++;
									} while (true);
									if (!flag18)
										l5++;
								}

							}

							abyte3 = new byte[l5];
							if (l5 > 0)
							{
								int i6 = 0;
								for (int j17 = 0; j17 < B.length; j17++)
								{
									for (int j18 = 0; j18 < B[0].length; j18++)
									{
										if (B[j17][j18] < 0 || abyte1[j17 + E][j18 + D] < 0)
											continue;
										boolean flag19 = false;
										int j19 = 0;
										do
										{
											if (j19 >= abyte2.length)
												break;
											if (abyte2[j19] == abyte1[j17 + E][j18 + D])
											{
												flag19 = true;
												break;
											}
											j19++;
										} while (true);
										if (!flag19)
											abyte3[i6++] = abyte1[j17 + E][j18 + D];
									}

								}

							}
						}
					}
					ah1[i13].x = new byte[abyte2.length + abyte3.length];
					System.arraycopy(abyte2, 0, ah1[i13].x, 0, abyte2.length);
					System.arraycopy(abyte3, 0, ah1[i13].x, abyte2.length, abyte3.length);
					B = (byte[][])null;
				}

			}
			y = -1;
			for (int i10 = 0; i10 < ah4.length; i10++)
				if (ah4[i10].p == 2 || ah4[i10].p == 1)
					ah4[i10].p = 0;

			for (int j10 = 0; j10 < ah1.length; j10++)
			{
				if (ah1[j10].p == 3 || ah1[j10].p == 4 || ah1[j10].e == -2 || ah1[j10].e == -1)
					continue;
				if (y == -1)
					y = j10;
				if (ah1[j10].p == 0)
					ah1[j10].p = 1;
			}

			if (y == -1)
				y = 0;
			j = 0;
			P = g;
			switch (O)
			{
			default:
				break;

			case 11: // '\013'
				k.a();
				O = 12;
				k.a(2, true);
				break;

			case 8: // '\b'
				if (aJ.length == 0)
				{
					k.a();
					O = 12;
					k.a(2, true);
				} else
				{
					O = 9;
				}
				break;

			case 14: // '\016'
				k.a();
				if (x <= r.length && a.m == 0 && a.l == 1)
					O = 21;
				else
					O = 6;
				k.a(1, true);
				a(new int[] {
					ah1[y].b, ah1[y].c
				});
				break;
			}
			e();
			return;

		case 16: // '\020'
			if (g - P <= 6)
				break;
			b((byte)1);
			try
			{
				DataInputStream datainputstream;
				(datainputstream = e.c("/" + a.l)).readUTF();
				av = datainputstream.readUTF();
			}
			catch (Exception ) { }
			O = 18;
			return;

		case 15: // '\017'
		case 17: // '\021'
			if (g - P <= 6)
				break;
			O = 19;
			for (int k10 = 0; k10 < aH.length; k10++)
				aH[k10].r = false;

			b((byte)1);
			break;
		}
	}

	public final void a(int i1)
	{
		t = 0;
		if (j == 0)
			B = (byte[][])null;
	}

	public final void b(int i1)
	{
		if (O != 19 && O != 17 && O != 15 && O != 16)
			switch (i1)
			{
			case -6: 
				if (O != 6)
					break;
				if (a.e == 1)
				{
					if (j == 14)
						j = 0;
					a.e = 7;
					b.f().a();
					System.gc();
					a.d = 0;
					W = O;
					k.a();
					b.a((byte)4);
					break;
				}
				if (a.e == 6)
					b(35);
				break;

			case -7: 
				if (O != 6)
					break;
				if (a.e == 1)
				{
					if (j == 14)
						j = 0;
					a.e = 6;
					k.a();
					W = 0;
					break;
				}
				if (a.e == 6)
					b(48);
				break;