j.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 j extends z
{

    public af a;
    public boolean a;
    public boolean b;
    public boolean c;

    public j()
    {
        super((byte)11);
    }

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

    private void b(int i)
    {
        if(super.a.b == 5)
        {
            return;
        } else
        {
            a(super.a.a, i);
            return;
        }
    }

    private void c(int i)
    {
        if(a(super.a.h, i) && super.a.b == 5)
        {
            int k = o + aa.b(0, 10);
            int i1 = p - aa.b(20, 80);
            v v1;
            if((v1 = (v)ai.a(65)) != null)
            {
                v1.b((short)k, (short)i1, (byte)1);
                v1.a(0, 800, 400, 768, 36, 32767, 32569, 32352);
            }
            k = o - aa.b(0, 10);
            i1 = p - aa.b(30, 80);
            v v2;
            if((v2 = (v)ai.a(65)) != null)
            {
                v2.b((short)k, (short)i1, (byte)1);
                v2.a(0, 800, 400, 768, 36, 32767, 32569, 32352);
            }
            k = o + aa.b(0, 10);
            i1 = p - aa.b(30, 80);
            v v3;
            if((v3 = (v)ai.a(65)) != null)
            {
                v3.b((short)k, (short)i1, (byte)1);
                v3.a(0, 800, 400, 768, 36, 32767, 32569, 32352);
            }
            k = o - aa.b(0, 10);
            i1 = p - aa.b(30, 80);
            v v4;
            if((v4 = (v)ai.a(65)) != null)
            {
                v4.b((short)k, (short)i1, (byte)1);
                v4.a(0, 800, 400, 768, 36, 32767, 32569, 32352);
            }
        }
        if(c())
            super.j = 1;
    }

    private void e(int i)
    {
        if(super.a.b == 5)
            return;
        a(super.a.g, i);
        if(c())
            super.j = 0;
    }

    public final void a(int i)
    {
        switch(super.j)
        {
        case 0: // '\0'
            b(i);
            return;

        case 1: // '\001'
            return;

        case 2: // '\002'
            c(i);
            return;

        case 3: // '\003'
            e(i);
            break;
        }
    }

    public final void a_()
    {
        if(a != null && super.j != 1)
            a.a(aa.a.f, aa.a.g, aa.a.f + 512, aa.a.g + 512);
    }

    public final void b(e e1)
    {
        if(super.j == 0 && super.a.b == 5)
            return;
        super.b(e1);
        if(super.j == 4)
            return;
        if((super.j == 1 || super.a.b == 3 || super.a.b == 3) && c)
        {
            g g1 = aa.a[9];
            t t1 = new t();
            a(t1);
            if(aa.a.m < 128)
            {
                g1.a(16, o - (g1.a[16] >> 1), t1.b - 4 - g1.b[16], 0, e1, 0);
                return;
            }
            g1.a(16, o - (g1.a[16] >> 1), t1.b - 8 - g1.b[16], 0, e1, 0);
        }
    }

    public final void a()
    {
        super.a_ = m;
        super.j = super.l;
        if(super.j == 1)
        {
            d(super.a.h);
            l l1 = super.a.a[super.b];
            super.k = (byte)(l1.a - 1);
            s = -1;
        }
        o = super.q;
        p = r;
        a = null;
        if(d != null)
        {
            for(int i = 0; i < d.length; i++)
            {
                int k;
                int i1 = (k = d[i] & 0xffff) & 0xfff;
                af af1;
                int j1;
                if((j1 = k >> 12) == 7 && (af1 = (af)aa.a.a[j1][i1]).a == 2)
                {
                    a = af1;
                    return;
                }
            }

        }
    }
}