k.java

webviwer,一个基于j2me的浏览器

// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi 

import java.util.Vector;
import javax.microedition.lcdui.Display;
import javax.microedition.lcdui.Displayable;

class k extends d
{

    private w f;
    private u d;
    private u c;
    private int b;
    private int a;
    private int e;

    k(w w1, u u1, u u2)
    {
        b = -1;
        a = 0;
        e = 100;
        f = w1;
        d = u1;
        c = u2;
    }

    void b(int i)
    {
        e = i;
    }

    void a(o o1, Vector vector, boolean flag)
    {
        if(a > 0)
        {
            int i = -1;
            int j = -1;
            int i1 = 0;
            int j1 = 0;
            b b1 = null;
            try
            {
                for(int k1 = 0; k1 < a; k1++)
                {
                    b b2 = (b)vector.elementAt(b + k1);
                    if(k1 == 0)
                    {
                        i = b2.a;
                        j = b2.e;
                    } else
                    if(b2.e < j)
                        j = b2.e;
                    if(k1 != 0 && b2.e > b1.e)
                    {
                        int l1 = (b1.a + b1.a()) - i;
                        if(l1 > i1)
                            i1 = l1;
                        j1 = (b2.e + b2.b()) - j;
                    }
                    if(k1 == a - 1)
                    {
                        int i2 = (b2.a + b2.a()) - i;
                        if(i2 > i1)
                            i1 = i2;
                    }
                    int j2 = (b2.e + b2.b()) - j;
                    if(j2 > j1)
                        j1 = j2;
                    b1 = b2;
                }

                o1.b(0);
                if(c == null)
                {
                    o1.c(i, j, i1, j1);
                    o1.e((i + i1) - 1, j, (i + i1) - 1, (j + j1) - 1);
                    o1.e(i, (j + j1) - 1, (i + i1) - 1, (j + j1) - 1);
                }
            }
            catch(ArrayIndexOutOfBoundsException arrayindexoutofboundsexception) { }
        }
    }

    void a(l l1, Display display, Displayable displayable, int i, int j, boolean flag)
    {
        if(f != null)
            if(d != null)
            {
                d.f = true;
                if(c != null)
                {
                    d.a(String.valueOf((i * 100) / e));
                    c.a(String.valueOf((j * 100) / e));
                    c.f = true;
                }
                f.a(l1);
                d.f = false;
                if(c != null)
                    c.f = false;
            } else
            {
                f.a();
            }
    }

    int a()
    {
        return b;
    }

    int b()
    {
        return a;
    }

    void a(int i)
    {
        if(a++ == 0)
            b = i;
    }
}