d.java

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

// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 


public final class d
{

	private byte a[];
	private short b[];
	private byte c;
	private char d[];
	private short e;
	private int f;

	public d(short word0, byte abyte0[], byte byte0, char ac[])
	{
		e = word0;
		a = abyte0;
		c = byte0;
		d = ac;
		b = new short[abyte0.length];
		for (int i = 1; i < abyte0.length; i++)
			b[i] += b[i - 1] + abyte0[i - 1];

	}

	public final void a(l l1, int i, int j, String s)
	{
		a(l1, i, j, s.toCharArray(), 0, s.length());
	}

	public final void a(l l1, int i, int j, char ac[], int k, int i1)
	{
		int j1 = 0;
		for (int k1 = k; k1 < i1; k1++)
		{
			int i2;
			if ((i2 = b(ac[k1])) != -1)
			{
				l1.c(i + j1, j, a[i2], c);
				l1.a(e, (i + j1) - b[i2], j);
				j1 = (j1 += a[i2]) - f;
			}
		}

		l1.c(0, 0, 96, 65);
	}

	public final void a(l l1, int i, int j, String s, byte byte0)
	{
		a(l1, i, j, s.toCharArray(), 0, s.length(), byte0);
	}

	public final void a(l l1, int i, int j, char ac[], int k, int i1, byte byte0)
	{
		switch (byte0)
		{
		case 1: // '\001'
			i -= a(ac, k, i1) / 2;
			break;

		case 2: // '\002'
			i -= a(ac, k, i1);
			break;
		}
		a(l1, i, j, ac, k, i1);
	}

	private int b(char c1)
	{
		for (int i = 0; i < d.length; i++)
			if (d[i] == c1)
				return i;

		return -1;
	}

	public final int a(char c1)
	{
		int i;
		if ((i = b(c1)) != -1)
			return a[i];
		else
			return -1;
	}

	public final int a(char ac[])
	{
		return a(ac, 0, ac.length);
	}

	public final int a(char ac[], int i, int j)
	{
		int k = 0;
		for (int i1 = i; i1 < j; i1++)
		{
			int j1;
			if ((j1 = a(ac[i1])) != -1)
				k += j1;
		}

		if (ac.length > 0)
			k -= (ac.length - 1) * f;
		return k;
	}

	public final int a(String s)
	{
		return a(s.toCharArray());
	}

	public final int a()
	{
		return c;
	}

	public final String[] a(char ac[], int i)
	{
		int ai[] = new int[ac.length];
		int j = 0;
		int k;
		for (k = 0; k < ac.length;)
		{
			int i1 = 0;
			int j1 = 0;
			int l1;
			for (l1 = k; l1 < ac.length; l1++)
			{
				if (ac[l1] == '\n')
				{
					ac[l1] = ' ';
					ai[j++] = l1 + 1;
					k = l1 + 1;
					break;
				}
				if ((i1 += a(ac[l1]) - f) > i)
				{
					if (j1 > k)
					{
						ai[j++] = j1 + 1;
						k = j1 + 1;
					} else
					{
						ai[j++] = l1;
						k = l1;
					}
					break;
				}
				if (ac[l1] == ' ')
					j1 = l1;
			}

			if (l1 == ac.length)
				break;
		}

		if (k != ac.length)
			ai[j++] = ac.length;
		String as[] = new String[j];
		int k1 = 0;
		for (int i2 = 0; i2 < j; i2++)
		{
			int j2 = ai[i2];
			as[i2] = new String(ac, k1, j2 - k1);
			k1 = j2;
		}

		return as;
	}

	public final void a(int i)
	{
		f = i;
	}
}