aa.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.Graphics;
import javax.microedition.lcdui.Image;

// Referenced classes of package pica:
//			Pica, o, v
//消息界面抽像类
public abstract class aa
{

	protected Vector m;
	public int n;
	public int oi;//public int o;
	public int p;
	public String q;
	public Image r;
	public int si;//public int s;
	public int t;
	private int a;
	public int u;

	public aa(v v1)
	{
		a = v.a - 4;
		u = -1;
		n = ((v.b - v.l - 22 - v.j) + 4) / o.e;
		oi = 0;
		p = -1;
		m = new Vector();
	}

	public void a(Graphics g1)
	{
		int i = v.l + 22;
		int l = n;
		if (m.size() == 0)
			return;
		for (int i1 = oi; i1 < m.size(); i1++)
		{
			o o1 = (o)m.elementAt(i1);
			if (p == i1)
				a(g1, i, o.e);
			if (l > 0)
			{
				a(o1, g1, i + o.e / 2);
				l--;
			}
			i += o.e;
		}

	}

	public static void a(o o1, Graphics g1, int i)
	{
		o1.a(g1, i);
	}

	public final void a(Object obj)
	{
		m.addElement(obj);
		if (p < 0)
			p = 0;
	}

	public final void a(int i)
	{
		if (i >= m.size() || i < 0)
		{
			return;
		} else
		{
			m.removeElementAt(i);
			return;
		}
	}

	public final void b(Object obj)
	{
		//System.out.println("删除："+m.contains(obj));
                if (m.contains(obj))
			m.removeElement(obj);
	}

	public final void m()
	{
		m.removeAllElements();
		oi = 0;
		p = -1;
	}

	public void b()
	{
		if (m.size() == 0)
		{
			p = -1;
			return;
		}
		p--;
		if (p < oi)
			oi--;
		if (p < 0)
		{
			p = m.size() - 1;
			oi = m.size() - n;
			if (oi < 0)
				oi = 0;
		}
	}

	public void c()
	{
		if (m.size() == 0)
		{
			p = -1;
			return;
		}
		p++;
		if (p >= oi + n)
			oi++;
		if (p >= m.size())
		{
			p = 0;
			oi = 0;
		}
	}

	public void f()
	{
		if (m.size() == 0)
			return;
		oi = (oi - n) + 1;
		if (oi < 0)
		{
			oi = 0;
			p = oi;
			return;
		} else
		{
			p = (oi + n) - 1;
			return;
		}
	}

	public void g()
	{
		if (m.size() == 0)
			return;
		if (oi + n < m.size())
		{
			oi = (oi + n) - 1;
			p = oi;
			return;
		} else
		{
			p = m.size() - 1;
			return;
		}
	}

	public final void n()
	{
		p = m.size() - 1;
		if (m.size() >= n)
			oi = (p - n) + 1;
	}

	public final Object o()
	{
		if (p >= 0 && p < m.size())
			return m.elementAt(p);
		else
			return null;
	}

	public final Object b(int i)
	{
		if (i >= 0 && i < m.size())
			return m.elementAt(i);
		else
			return null;
	}

	public final Vector p()
	{
		return m;
	}

	public final int q()
	{
		return m.size();
	}

	public final void a(Graphics g1, int i, int l)
	{
		g1.setColor(Pica.l.r[Pica.l.o]);
		g1.fillRect(4, i + 3, a - 4, l - 6);
		g1.setColor(132, 149, 202);
		g1.drawRect(2, i, a, l - 1);
		g1.setColor(0, 0, 0);
	}

	public void r()
	{
	}

	public void s()
	{
	}

	public void d()
	{
	}

	public void j()
	{
	}

	public void k()
	{
	}

	public abstract void a(v v1);

	public abstract void a(String s1);

	public abstract void h();

	public static boolean a(int i, int l, int i1, int j1, int k1, int l1)
	{
		return i >= i1 && i <= i1 + k1 && l >= j1 && l <= j1 + l1;
	}

}