g.java

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

			case -5: 
			case 35: // '#'
			case 53: // '5'
				if (a.e != 6)
					break;
				switch (W)
				{
				case 0: // '\0'
					a.e = 1;
					if (O == 6 || O == 9)
					{
						k.a(1, true);
						return;
					}
					if (O == 12)
					{
						k.a(2, true);
						return;
					}
					break;

				case 1: // '\001'
					b.f().a();
					System.gc();
					W = O;
					b.a((byte)5);
					return;

				case 2: // '\002'
					a.e = 7;
					a.d = 0;
					W = O;
					b.a((byte)4);
					break;
				}
				return;

			case 48: // '0'
				if (a.e != 6)
					break;
				a.e = 1;
				if (O == 6 || O == 9)
				{
					k.a(1, true);
					return;
				}
				if (O == 12)
					k.a(2, true);
				return;

			case -1: 
			case 50: // '2'
				if (a.e != 6)
					break;
				if (W > 0)
					W--;
				return;

			case -2: 
			case 56: // '8'
				if (a.e != 6)
					break;
				if (W < 2)
					W++;
				return;

			default:
				if (a.e == 6)
					return;
				break;
			}
		h ah1[] = aH;
		Object obj = null;
		switch (O)
		{
		case 12: // '\f'
			ah1 = aI;
			break;

		case 9: // '\t'
			ah1 = aJ;
			break;
		}
		if (j != 5 && j != 8 && j != 12 && O != 13 && O != 7 && O != 10)
		{
			w = g;
			if (m == 0)
				v = g;
		}
label0:
		switch (O)
		{
		case 7: // '\007'
		case 8: // '\b'
		case 9: // '\t'
		case 10: // '\n'
		case 11: // '\013'
		case 12: // '\f'
		case 13: // '\r'
		case 14: // '\016'
		case 15: // '\017'
		case 16: // '\020'
		case 17: // '\021'
		case 20: // '\024'
		default:
			break;

		case 3: // '\003'
			if (i1 == -5 || i1 == 53 || i1 == 35)
			{
				O = 4;
				j = 15;
				T = 0;
				return;
			}
			break;

		case 4: // '\004'
			switch (i1)
			{
			case -1: 
			case 50: // '2'
				if (T < 0)
				{
					T = 0;
					return;
				}
				break label0;

			case -2: 
			case 56: // '8'
				if (T > f - (aE.length * 3 + 8))
				{
					T = f - (aE.length * 3 + 8);
					return;
				}
				break;

			default:
				O = 5;
				j = 17;
				return;
			}
			break;

		case 5: // '\005'
			j = 0;
			P = g;
			if (a.m == 0 && a.l == 1 && x <= r.length)
			{
				O = 21;
				return;
			} else
			{
				O = 6;
				return;
			}

		case 21: // '\025'
			if (i1 == -5 || i1 == 53 || i1 == 35)
			{
				P = g;
				O = 6;
				return;
			}
			break;

		case 6: // '\006'
			if (g - P <= 5)
				return;
label1:
			switch (j)
			{
			case 1: // '\001'
			case 2: // '\002'
			case 5: // '\005'
			case 8: // '\b'
			case 9: // '\t'
			case 12: // '\f'
			case 16: // '\020'
			case 19: // '\023'
			default:
				break;

			case 0: // '\0'
				t = s = i1;
				k = j;
				switch (i1)
				{
				case -5: 
				case 35: // '#'
				case 53: // '5'
					m = 0;
					if (h % 20 == 0 && i % 20 == 0)
						a((byte)0);
					break;

				case 42: // '*'
					j = 14;
					l = 0;
					break;

				case 57: // '9'
					int j1 = 0;
					if (M[i / 20][h / 20] != -1 && M[i / 20][h / 20] < 16)
						j1 = M[i / 20][h / 20];
					do
						if (++j1 == ah1.length)
							j1 = 0;
					while (ah1[j1].p == 2 || ah1[j1].p == 4 || ah1[j1].p == 3 || ah1[j1].e == -2 || ah1[j1].e == -1);
					a(new int[] {
						ah1[j1].b, ah1[j1].c
					});
					break;
				}
				break;

			case 3: // '\003'
			case 6: // '\006'
				switch (i1)
				{
				default:
					break;

				case -5: 
				case 35: // '#'
				case 53: // '5'
					a((byte)1);
					m = 0;
					break label1;

				case 48: // '0'
					if (j == 6)
					{
						ah1[y].b = Z;
						ah1[y].c = aa;
						a(new int[] {
							ah1[y].b / 20, ah1[y].c / 20
						}, (byte)ah1[y].m[4], (byte)1, ah1[y].s);
						d(ah1[y]);
						a(new int[] {
							ah1[y].b, ah1[y].c
						});
						l = 0;
						j = 4;
					} else
					{
						j = 0;
					}
					break label1;

				case -3: 
				case 52: // '4'
					if (m == 0)
						m = -3;
					break label1;

				case -4: 
				case 54: // '6'
					if (m == 0)
						m = -4;
					break;
				}
				break;

			case 4: // '\004'
				t = s = i1;
				switch (i1)
				{
				default:
					break;

				case -5: 
				case 35: // '#'
				case 53: // '5'
					a((byte)2);
					break label1;

				case 48: // '0'
					a(new int[] {
						ah1[y].b, ah1[y].c
					});
					if (b(ah1[y]))
						p = n[1];
					else
						p = n[0];
					l = 0;
					j = 3;
					break;
				}
				break;

			case 11: // '\013'
				t = s = i1;
				switch (i1)
				{
				case -5: 
				case 35: // '#'
				case 53: // '5'
					a((byte)3);
					break;

				case 48: // '0'
					j = 10;
					a(new int[] {
						ah1[y].b, ah1[y].c
					});
					l = 0;
					break;
				}
				break;

			case 7: // '\007'
				t = s = i1;
				switch (i1)
				{
				case -5: 
				case 35: // '#'
				case 53: // '5'
					a((byte)4);
					break;

				case 48: // '0'
					j = k;
					a(new int[] {
						ah1[y].b, ah1[y].c
					});
					l = 0;
					break;
				}
				break;

			case 10: // '\n'
				X = -1;
				switch (i1)
				{
				default:
					break;

				case -1: 
				case 50: // '2'
					if (T > 0)
						T--;
					if (U > 0)
						U--;
					break label1;

				case -2: 
				case 56: // '8'
					if (T < V - 1)
						T++;
					if (U < 2 && U < V - 1)
						U++;
					break;

				case -5: 
				case 35: // '#'
				case 53: // '5'
					a((byte)5);
					break;

				case 48: // '0'
					l = 0;
					j = 3;
					Y = null;
					break;
				}
				break;

			case 13: // '\r'
				switch (i1)
				{
				default:
					break;

				case -3: 
				case 52: // '4'
					if (X == 1 && T > 0)
						T--;
					break label1;

				case -4: 
				case 54: // '6'
					if (X == 1 && T < (V - 1) / 4)
						T++;
					break;

				case -1: 
				case 50: // '2'
					X = 0;
					break;

				case -2: 
				case 56: // '8'
					X = 1;
					break;

				case -5: 
				case 35: // '#'
				case 48: // '0'
				case 53: // '5'
					j = k;
					H = null;
					I = null;
					l = 0;
					break;
				}
				break;

			case 14: // '\016'
				switch (i1)
				{
				default:
					break;

				case -5: 
				case 35: // '#'
				case 53: // '5'
					m = 0;
					a((byte)6);
					break label1;

				case 48: // '0'
					j = 0;
					l = 0;
					break label1;

				case -1: 
				case 50: // '2'
					l--;
					if (l < 0)
						l = (byte)(q.length - 1);
					break label1;

				case -2: 
				case 56: // '8'
					l++;
					if (l > q.length - 1)
						l = 0;
					break;
				}
				break;

			case 15: // '\017'
			case 17: // '\021'
			case 20: // '\024'
				switch (i1)
				{
				default:
					break;

				case -5: 
				case 35: // '#'
				case 48: // '0'
				case 53: // '5'
					j = 14;
					l = 0;
					break label1;

				case -1: 
				case 50: // '2'
					if (T < 0)
						T = 0;
					break label1;

				case -2: 
				case 56: // '8'
					if (T > f - (aE.length * 3 + 8))
						T = f - (aE.length * 3 + 8);
					break;
				}
				break;

			case 18: // '\022'
				switch (i1)
				{
				case -5: 
				case 35: // '#'
				case 53: // '5'
					O = 15;
					P = g;
					break;

				case 48: // '0'
					j = 14;
					l = 0;
					break;
				}
				break;
			}
			return;

		case 18: // '\022'
			if (i1 != -5 && i1 != 53 && i1 != 35)
				break;
			b((byte)1);
			if (a.m == 0)
			{
				if (a.l < ac)
				{
					a.l++;
					j = 0;
					O = 0;
					P = g;
					Q = -1;
					return;
				} else
				{
					a.e = 0;
					a.i++;
					b((byte)1);
					b.a((byte)9);
					return;
				}
			} else
			{
				a.e = 0;
				b.a((byte)4);
				return;
			}

		case 19: // '\023'
			switch (i1)
			{
			case -5: 
			case 35: // '#'
			case 53: // '5'
				O = 1;
				T = 0;
				return;

			case 48: // '0'
				a.d = 0;
				b.a((byte)4);
				break;
			}
			break;
		}
	}

	public final void a(l l1)
	{
		h ah1[] = aH;
		h ah2[] = null;
		boolean flag = false;
		boolean flag1 = false;
		boolean flag2 = false;
		if (a.e == 1)
			g++;
		b.e().a(false, 0);
		l1.c(0, 0, e, f);
		l1.f(0xff714a03);
		l1.b(0, 0, e, f);
		int i1;
		int j1;
		int i2;
		switch (O)
		{
		case 0: // '\0'
			return;

		case 1: // '\001'
		case 2: // '\002'
			int ai1[] = {
				7, 14, 14, 7, 0, 0
			};
			int ai2[] = {
				0, 4, 12, 16, 12, 4
			};
			l1.f(0xff493100);
			for (int k1 = 0; k1 < 6; k1++)
				l1.a((e - 21) / 2 + ai1[k1], ((f - 23) / 2 - 4) + ai2[k1], 7, 7, 0, 360);

			l1.f(-2);
			l1.a((e - 21) / 2 + ai1[T % 6], (((f - 23) / 2 - 4) + ai2[T % 6]) - 2, 7, 7, 0, 360);
			l1.b((e - a.c.a("LOADING")) / 2, (f - a.c.a()) / 2 + 2 + 11, a.c.a("LOADING") + 2, a.c.a() + 2);
			a.c.a(l1, e / 2, f / 2 + 12, "LOADING", (byte)1);
			T++;
			return;

		default:
			i1 = aE.length - 1 <= (d + f) / 20 ? aE.length : (d + f) / 20 + 1;
			j1 = aE[0].length - 1 <= (c + e) / 20 ? aE[0].length : (c + e) / 20 + 1;
			i2 = c / 20;
			break;
		}
		for (; i2 < j1; i2++)
		{
			if (i2 < 0)
				continue;
			l1.c(i2 * 20 - c, 0, 20, f);
			for (int j2 = d / 20; j2 < i1; j2++)
				if (j2 >= 0)
					l1.a(16, i2 * 20 - c - 20 * (ah[aE[j2][i2]][2] % ae[0]), j2 * 20 - d);

		}

		int ai3[][] = {
			{
				20, 5, 0, -5
			}, {
				5, 20, -10, -10
			}, {
				20, 5, 0, 0
			}, {
				5, 20, -15, -10