// 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 a extends d
{

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

    a(a a1, String s, byte byte0, int ai[])
    {
        a = null;
        f = a1;
        c = s;
        b = byte0;
        e = ai;
        d = -1;
    }

    void a(o o1, Vector vector, boolean flag)
    {
        if(flag)
        {
            o1.b(1);
            try
            {
                b b1 = (b)vector.elementAt(d);
                int i = b1.a;
                int j = b1.e;
                switch(b)
                {
                default:
                    break;

                case 0: // '\0'
                    o1.c(i + e[0], j + e[1], e[2] - e[0], e[3] - e[1]);
                    break;

                case 1: // '\001'
                    o1.b((i + e[0]) - e[2], (j + e[1]) - e[2], 2 * e[2], 2 * e[2], 0, 360);
                    break;

                case 2: // '\002'
                    for(int k = 0; k + 3 < e.length; k += 2)
                        o1.e(i + e[k], j + e[k + 1], i + e[k + 2], j + e[k + 3]);

                    break;

                case 3: // '\003'
                    o1.c(i - 1, j - 1, b1.a() + 1, b1.b() + 1);
                    break;
                }
            }
            catch(ArrayIndexOutOfBoundsException arrayindexoutofboundsexception) { }
        }
    }

    private int c(int i)
    {
        return i * i;
    }

    boolean a(int i, int j)
    {
        switch(b)
        {
        case 0: // '\0'
            return i >= e[0] && i <= e[2] && j >= e[1] && j <= e[3];

        case 1: // '\001'
            return c(e[0] - i) + c(e[1] - j) <= c(e[2]);

        case 2: // '\002'
            boolean flag = false;
            int k = 0;
            for(int i1 = e.length / 2 - 1; k < e.length / 2; i1 = k++)
                if((e[k * 2 + 1] <= j && j < e[i1 * 2 + 1] || e[i1 * 2 + 1] <= j && j < e[k * 2 + 1]) && i < ((e[i1 * 2] - e[k * 2]) * (j - e[k * 2 + 1])) / (e[i1 * 2 + 1] - e[k * 2 + 1]) + e[k * 2])
                    flag = !flag;

            return flag;

        case 3: // '\003'
            return true;
        }
        return false;
    }

    void a(l l1, Display display, Displayable displayable, int i, int j, boolean flag)
    {
        if(flag)
        {
            for(a a1 = f != null ? f : this; a1 != null; a1 = a1.a)
            {
                if(!a1.a(i, j))
                    continue;
                a1.a(l1, display, displayable, i, j, false);
                break;
            }

        } else
        if(c != null)
        {
            l1.g();
            l1.b(c);
        }
    }

    int a()
    {
        return d;
    }

    int b()
    {
        return 1;
    }

    void a(int i)
    {
        d = i;
    }
}