d.java

// pica客户端J2ME源码

// pica客户端J2ME源码，100%可运行可修改，J2ME逆向工程经典作品
// 作者：fangji999
// QQ：57979471 Email:[e-mail]
// 博客：http://hi.baidu.com/ccall_net
// QQ群：51719370
// 如用此源码重新改写的软件或转载，请保留本人联系方式,作品原创作者

package pica;

import java.util.Vector;
import javax.microedition.lcdui.*;

// Referenced classes of package pica:
//			aa, Pica, f, g, 
//			k, l, n, o, 
//			v, w, z
//登录主界面
public final class d extends aa
	implements Runnable
{

	public static int a = 3;
	public static int b = 5;
	public static int c;
	public static int d;
	public static int e;
	private int vi;//private int v;
	private int w;
	private int x;
	private int y;
	public Vector f;
	public int gi;//public int g;
	public boolean h;
	private byte z;
	private boolean A;
	public int i;
	public int j;
	Thread k;
	private boolean B;
	private boolean C;
	private boolean D;
	private boolean E;
	private boolean F;
	private boolean G;
	private boolean H;
	private n I;
	private v J;
	l l;

	public d(String s, byte byte0)
	{
		super(Pica.l);
		vi = 0;
		w = 0;
		x = 0;
		y = 0;
		f = null;
		gi = 0;
		h = false;
		k = null;
		B = false;
		C = false;
		D = false;
		E = false;
		F = false;
		G = false;
		H = true;
		I = null;
		z = byte0;
		super.q = s;
		if (byte0 != 0)
		{
			Pica.ad = true;
			super.r = null;
		} else
		{
			super.r = Pica.x;
			super.si = 36;
		}
		c = v.a - 8;
		d = v.b - v.l - 22 - v.j;
	}

	public final void a(v v1)
	{
		J = v1;
		if (z == 0)
		{
			v1.a("后退");
			v1.a("刷新");
			v1.a("全屏显示");
			v1.e = "主页";
			return;
		} else
		{
			pica.w.a(v1, z);
			return;
		}
	}

	public final void a(String s)
	{
		System.gc();
		if (s == "后退")
		{
			t();
			return;
		}
		if (s == "主页")
		{
			Pica.a().a(g.b, (byte)-1);//Pica.a().a(g.b, (byte)-1);
			return;
		}
		if (s == "刷新")
		{
			Pica.a().a(Pica.o.d, (byte)-1);
			return;
		}
		if (s == "全屏显示")
		{
			A = true;
			if (!v())
			{
				i = 5;
				j = 5;
				return;
			} else
			{
				i = (I.u - vi) + 1;
				j = (I.vi - w - I.s) + 1;
				return;
			}
		} else
		{
                        try {
                            pica.w.a(s, z);
                        } catch (Exception ex) {
                            ex.printStackTrace();
                        }
			return;
		}
	}

	public final void a(Graphics g1)
	{
		super.oi = -1;
		if (super.m == null)
			return;
		if (z == 0 && A)
		{
			v.m = 0;
			v.n = 0;
		} else
		{
			v.m = v.l + 22;
			v.n = v.j;
		}
		d = v.b - v.m - v.n;
		if (i())
		{
			G = false;
			a(i, j);
		}
		for (int i1 = 0; i1 < super.m.size(); i1++)
		{
			n n1 = (n)super.m.elementAt(i1);
			if (!i())
			{
				if (i1 == super.p)
					n1.y = true;
				else
					n1.y = false;
			} else
			if (i() && G)
			{
				if (i1 == super.p)
					n1.y = true;
				else
					n1.y = false;
			} else
			if (i() && !G)
				n1.y = false;
			if (n1.vi + (n1.x - 1) * (n1.s + a) <= w || n1.vi >= w + d + n1.s)
				continue;
			if (n1.w)
				super.oi = super.oi != -1 ? super.oi : i1;
			n1.a(g1, vi, w);
		}

		a(g1, 0, v.b - v.n - e, v.a, gi);
		if (x > d)
			b(g1, v.a - 6, v.m);
		if (i())
			a(g1, i, j, G);
	}

	public final void a()
	{
		int i1 = 0;
		int j1 = 0;
		int k1 = b;
		int l1 = a;
		for (int i2 = 0; i2 < super.m.size(); i2++)
		{
			n n1;
			if ((n1 = (n)super.m.elementAt(i2)).z == 5)
			{
				i1++;
				k1 = b;
				l1 += a;
				n1.u = k1;
				n1.vi = l1;
				j1 = 0;
				continue;
			}
			if (k1 != b && k1 + n1.t > c)
			{
				i1++;
				k1 = b;
				n1.u = k1;
				j1 = n1.s;
				l1 = l1 + j1 + a;
				n1.vi = l1;
				n1.r = i1;
				if (n1.w)
				{
					k1 = k1 + n1.t + b;
				} else
				{
					k1 = c;
					l1 += (n1.x - 1) * (n1.s + a);
				}
				continue;
			}
			if (n1.s > j1)
			{
				l1 = (l1 - j1) + n1.s;
				j1 = n1.s;
				n n3;
				for (int j2 = i2 - 1; j2 > 0 && (n3 = (n)super.m.elementAt(j2)).r == i1; j2--)
					n3.vi = l1;

			}
			n1.u = k1;
			n1.vi = l1;
			n1.r = i1;
			if (n1.w)
			{
				k1 = k1 + n1.t + b;
			} else
			{
				k1 = c;
				l1 += (n1.x - 1) * (n1.s + a);
			}
		}

		x = l1;
		if (super.p < 0 || super.p >= q())
			return;
		n n2;
		if ((n2 = (n)super.m.elementAt(super.p)) == null)
			return;
		if (!a(n2))
			super.p = -1;
	}

	public final void b()
	{
		if (super.m == null)
			return;
		if (i())
		{
			E = true;
			k = null;
			k = new Thread(this);
			B = true;
			k.start();
			return;
		}
		n n1 = null;
		if (super.m.size() == 0)
		{
			J.A = true;
			super.p = -1;
			return;
		}
		if (super.p != -1 && (n1 = (n)super.m.elementAt(super.p)).vi - n1.s < w)
		{
			w = w - 20;
			return;
		}
		if (super.p == 0)
		{
			J.A = true;
			return;
		}
		for (int i1 = super.p != -1 ? --super.p : 0; i1 >= 0; i1--)
		{
			n n2;
			if ((n2 = (n)super.m.elementAt(i1)).vi - n2.s < w)
			{
				w = w - 20;
				if (super.p != -1)
					super.p++;
				return;
			}
			if (a(n2))
			{
				super.p = i1;
				return;
			}
		}

		if (super.p != -1)
			super.p++;
	}

	public final void c()
	{
		if (super.m == null)
			return;
		if (i())
		{
			F = true;
			k = null;
			k = new Thread(this);
			B = true;
			k.start();
			return;
		}
		n n1 = null;
		if (super.m.size() == 0)
		{
			super.p = -1;
			J.A = false;
			return;
		}
		if (super.p == 0 && J.A)
		{
			J.A = false;
			return;
		}
		if (super.p != -1 && (n1 = (n)super.m.elementAt(super.p)).vi + (n1.x - 1) * (n1.s + a) > w + d)
		{
			w = w + 20;
			return;
		}
		if (super.p == super.m.size() - 1)
			return;
		for (int i1 = ++super.p; i1 < super.m.size(); i1++)
		{
			n n2;
			if ((n2 = (n)super.m.elementAt(i1)).vi + (n2.x - 1) * (n2.s + a) > w + d)
			{
				w = w + 20;
				super.p--;
				return;
			}
			if (a(n2))
			{
				super.p = i1;
				return;
			}
		}

		super.p--;
	}

	private static boolean a(n n1)
	{
		if (n1.z == 1 || n1.z == 4 || n1.z == 5)
			return false;
		if (n1.z == 3)
			return !((z)n1).c.equals("");
		else
			return true;
	}

	public final void d()
	{
		if (i() && H)
		{
			c(j);
			return;
		}
		if (J.A)
			try
			{
				l.b();
				return;
			}
			catch (Exception  e)
			{
				return;
			}
		n n1;
		if ((n1 = (n)o()) == null)
		{
			return;
		} else
		{
			n1.a();
			return;
		}
	}

	public final void e()
	{
		if (super.m != null && super.m.size() > 0)
		{
			if (f != null)
			{
				f.removeAllElements();
				f = null;
				y = 0;
			}
			f = super.m;
			super.m = null;
			y = x;
			x = 0;
		}
		super.m = new Vector();
		vi = 0;
		w = 0;
		super.p = -1;
		System.gc();
	}

	private void t()
	{
		if (f == null)
		{
			return;
		} else
		{
			m();
			vi = 0;
			w = 0;
			super.m = f;
			f = null;
			x = y;
			y = 0;
			Pica.o.d = Pica.o.c;
			Pica.o.c = null;
			System.gc();
			return;
		}
	}

	private void a(Graphics g1, int i1, int j1, int k1, int l1)
	{
		if (h)
		{
			g1.setColor(250, 250, 210);
			g1.fillRect(i1, j1, k1, e);
			g1.setColor(0, 0, 128);
			g1.fillRect(i1, j1, l1, e);
			g1.setColor(255, 0, 0);
			g1.drawString("请稍候...", v.a / 2, j1 + 2, 17);
		}
	}

	private void b(Graphics g1, int i1, int j1)
	{
		g1.setColor(0xe1e4e5);
		g1.fillRect(i1, j1, 6, d);
		g1.setColor(0xffb0b0b0);
		g1.drawRect(i1, j1, 6, d);
		if (x > d)
		{
			int k1 = (w * d) / x + 1;
			int l1 = (d * d) / x;
			g1.setColor(Pica.l.p[Pica.l.o]);
			g1.fillRect(i1, j1 + k1, 6, l1);
		}
	}

	public final void f()
	{
		if (w - d > 0)
			w = (w - d) + 20;
		else
		if (w == 0)
			J.A = true;
		else
			w = 0;
		int i1 = u();
		if (super.p > i1)
			super.p = i1;
		if (J.A)
			super.p = 0;
	}

	public final void g()
	{
		if (J.A)
			J.A = false;
		if (w + d < x - d)
			w = (w + d) - 20;
		else
			w = x - d;
		int i1 = u();
		if (super.p < i1)
			super.p = i1;
	}

	private int u()
	{
		int i1 = super.m.size();
		for (int j1 = 0; j1 < i1; j1++)
		{
			n n1;
			if ((n1 = (n)super.m.elementAt(j1)).vi - n1.s > w && a(n1))
				return j1;
		}

		return -1;
	}

	public final void h()
	{
	}

	public final boolean i()
	{
		return z == 0 && A;
	}

	public final void a(boolean flag)
	{
		A = flag;
	}

	public final void j()
	{
		C = true;
		k = null;
		k = new Thread(this);
		B = true;
		k.start();
	}

	public final void k()
	{
		D = true;
		k = null;
		k = new Thread(this);
		B = true;
		k.start();
	}

	private static void a(Graphics g1, int i1, int j1, boolean flag)
	{
		g1.setClip(i1, j1, 12, 12);
		if (!flag)
			g1.drawImage(Pica.aU, i1 - 12, j1, 20);
		else
			g1.drawImage(Pica.aU, i1, j1, 20);
		g1.setClip(0, 0, v.a, v.b);
	}

	public final void run()
	{
		while (B) 
		{
			if (C)
			{
				i -= Pica.aT;
				if (i <= 0)
					i = 0;
			} else
			if (D)
			{
				i += Pica.aT;
				if (i >= v.a - 6)
					i = v.a - 6;
			} else
			if (E)
			{
				j -= Pica.aT;
				if (j <= 40)
				{
					w -= 15;
					if (w <= 0)
						w = 0;
					else
						j += Pica.aT;
				}
				if (j <= 0)
					j = 0;
			} else
			if (F)
			{
				j += Pica.aT;
				if (j >= v.b - 40)
				{
					w += 15;
					if (w + d >= x)
						w = x - d;
					else
						j -= Pica.aT;
				}
				if (j >= v.b - 5)
					j = v.b - 5;
			}
			Pica.l.repaint();
			try
			{
				Thread.sleep(150L);
			}
			catch (Exception  e) { }
		}
	}

	private void a(int i1, int j1)
	{
		int k1;
		if ((k1 = super.m.size()) == 0)
		{
			super.p = -1;
			return;
		}
		boolean flag = false;
		for (int l1 = 0; l1 < k1; l1++)
		{
			n n1;
			if ((n1 = (n)super.m.elementAt(l1)) instanceof f)
			{
				boolean flag1;
				f f1;
				int j2;
				int l2;
				int j3;
				int l3;
				if (((n) (f1 = (f)n1)).z == 6 || ((n) (f1)).z == 7)
				{
					j2 = ((n) (f1)).u - vi;
					l2 = ((((n) (f1)).vi - w) + v.m) - ((n) (f1)).s;
					j3 = f1.a;
					l3 = ((n) (f1)).s;
					if (!((n) (f1)).w)
						l2 += ((n) (f1)).s;
					else
					if (f1.b().length() != 0)
						j2 = j2 + Pica.q.stringWidth(f1.b()) + 5;
					flag1 = false;
				} else
				if (((n) (f1)).z == 8)
				{
					j2 = ((n) (f1)).u - vi - 6;
					l2 = ((((n) (f1)).vi - w) + v.m) - ((n) (f1)).s / 2 - 4 - 6;
					j3 = l3 = 22;
					flag1 = false;
				} else
				{
					j2 = ((n) (f1)).u - vi;
					l2 = ((((n) (f1)).vi - w) + v.m) - ((n) (f1)).s;
					j3 = ((n) (f1)).t;
					l3 = ((n) (f1)).s;
					flag1 = true;
				}
				if (!aa.a(i1, j1, j2, l2, j3, l3))
					continue;
				super.p = l1;
				G = true;
				if (flag1)
				{
					super.u = super.p;
					return;
				}
				break;
			}
			if (!(n1 instanceof k))
				continue;
			int i2 = 0;
			int k2 = 0;
			int i3 = 0;
			int k3 = 0;
			if (n1.z == 2)
			{
				i2 = n1.u - vi;
				k2 = ((n1.vi - w) + v.m) - n1.s;
				i3 = n1.t;
				k3 = n1.s;
			}
			if (aa.a(i1, j1, i2, k2, i3, k3))
			{
				super.p = l1;
				G = true;
				super.u = super.p;
			}
		}

	}

	private void c(int i1)
	{
		if (i1 > 5 && i1 < v.b - 20)
		{
			int j1;
			if ((j1 = super.m.size()) == 0)
			{
				super.p = -1;
				return;
			}
			if (!G)
				return;
			H = false;
			d();
			H = true;
		}
	}

	public final void l()
	{
		C = false;
		D = false;
		E = false;
		F = false;
		B = false;
		k = null;
	}

	private boolean v()
	{
		if (super.m == null)
			return false;
		for (int i1 = 0; i1 < super.m.size(); i1++)
		{
			n n1;
			if ((n1 = (n)super.m.elementAt(i1)).vi + (n1.x - 1) * (n1.s + a) <= w || n1.vi >= w + d + n1.s)
				continue;
			if (n1.w)
				super.oi = super.oi != -1 ? super.oi : i1;
			if (n1.y)
			{
				I = n1;
				return true;
			}
		}

		return false;
	}

	static 
	{
		c = v.a - 8;
		d = v.b - v.m - v.n;
		e = Pica.r + 4;
	}
}