y.java

哈利波特与凤凰令的一个小游戏

// 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 


public final class y extends q
{

    public byte a;
    public byte b;
    public byte c;
    public byte j;
    public long a;
    public short a;
    public short a[];
    public short b[];
    public short c[];
    public short e[];
    public short f[];
    public long b;
    public short b;

    public y()
    {
        super((byte)5);
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        a = aa.a();
        b = aa.a();
        c = aa.a();
        b = aa.a();
        j = c;
        b = 0;
    }

    public final void b()
    {
        aa.i(26 + b);
        a = (short)aa.d();
        a = new short[a];
        b = new short[a];
        c = new short[a];
        e = new short[a];
        f = new short[a];
        for(int i = 0; i < a; i++)
        {
            aa.d();
            aa.e();
            a[i] = aa.a(aa.a);
            aa.e();
            b[i] = aa.a(aa.a);
            aa.e();
            c[i] = aa.a(aa.a);
            aa.e();
            e[i] = aa.a(aa.a);
            aa.e();
            f[i] = aa.a(aa.a);
        }

        a = 0L;
    }

    public final void a()
    {
        j = c;
        a = b;
    }

    public final void a(int i)
    {
        if(j == 1)
            return;
        long l1 = a;
        a += i;
label0:
        switch(a)
        {
        default:
            break;

        case 0: // '\0'
            return;

        case 1: // '\001'
            for(int k = 0; k < a; k++)
                if(a >= (long)a[k] && a < (long)b[k])
                {
                    if(d != null && c[k] < d.length)
                    {
                        h h1 = (h)aa.a.a[1][d[c[k]] & 0xfff];
                        if(e[k] != f[k])
                        {
                            int j1 = h1.a.a[e[k]];
                            int j2 = h1.a.a[f[k]];
                            h1.o = (short)(int)((long)aa.a(j1) + ((a - (long)a[k]) * (long)(aa.a(j2) - aa.a(j1))) / (long)(b[k] - a[k]));
                            h1.p = (short)(int)((long)aa.b(j1) + ((a - (long)a[k]) * (long)(aa.b(j2) - aa.b(j1))) / (long)(b[k] - a[k]));
                            h1.c = ((q) (h1)).o << 6;
                            h1.d = ((q) (h1)).p << 6;
                        } else
                        {
                            int k1 = h1.a.a[e[k]];
                            h1.o = aa.a(k1);
                            h1.p = aa.b(k1);
                            h1.c = ((q) (h1)).o << 6;
                            h1.d = ((q) (h1)).p << 6;
                        }
                        if(h1.b())
                            aa.a.a.a((short)100);
                    }
                } else
                if(a >= (long)a[k] && b[k] == -1)
                    a = c[k];

            break;

        case 2: // '\002'
            int l = 0;
            do
            {
                if(l >= a)
                    break label0;
                if(l1 <= (long)a[l] && (long)a[l] < a)
                {
                    if(b[l] == -1)
                    {
                        a = c[l];
                        return;
                    }
                    h h2;
                    (h2 = (h)aa.a.a[1][d[c[l]] & 0xfff]).j = 11;
                    h2.b = aa.a.a;
                }
                l++;
            } while(true);

        case 3: // '\003'
            return;

        case 4: // '\004'
            return;

        case 5: // '\005'
            if(a < (long)b[0])
                break;
            q aq[];
            b b1;
            if(d != null && d.length > 0 && ((q) (b1 = (b)(aq = aa.a.a[13])[d[0] & 0xfff])).j == 5)
            {
                j = 1;
                return;
            }
            short word0 = a[0];
            b = (short)aa.b(0, 360);
            a = 0L;
            int i1;
            int i2;
            int k2;
            if((k2 = b) >= 270)
            {
                k2 = 360 - k2;
                i1 = word0 * aa.b[(k2 << 1) + 1] >> 16;
                i2 = -(word0 * aa.b[k2 << 1]) >> 17;
            } else
            if(k2 >= 180)
            {
                k2 -= 180;
                i1 = -(word0 * aa.b[(k2 << 1) + 1]) >> 16;
                i2 = -(word0 * aa.b[k2 << 1]) >> 17;
            } else
            if(k2 >= 90)
            {
                k2 = 180 - k2;
                i1 = -(word0 * aa.b[(k2 << 1) + 1]) >> 16;
                i2 = word0 * aa.b[k2 << 1] >> 17;
            } else
            {
                i1 = word0 * aa.b[(k2 << 1) + 1] >> 16;
                i2 = word0 * aa.b[k2 << 1] >> 17;
            }
            i2 = -i2;
            aa.a.a.a((i1 + super.o) - aa.a.a.a, (i2 + p) - aa.a.a.b, 400, c[0], e[0], 0);
            i1 = -i1;
            i2 = -i2;
            aa.a.a.a((i1 + super.o) - aa.a.a.a, (i2 + p) - aa.a.a.b, 400, c[0], e[0], 0);
            break;
        }
    }
}