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

    public byte a;
    public byte a_;
    public int a;
    public int b;
    public h a;

    public b()
    {
        super((byte)13);
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        super.a = aa.a((byte)13, aa.a());
    }

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

        case 1: // '\001'
            c(i);
            return;

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

        case 3: // '\003'
            f(i);
            return;

        case 4: // '\004'
            g(i);
            // fall through

        case 5: // '\005'
        default:
            return;
        }
    }

    private void b(int i)
    {
        a(super.a.a + a(), i);
    }

    private void c(int i)
    {
        e e1;
        (e1 = aa.a.a).a(this, false);
        a(super.a.a + a(), i);
    }

    private void e(int i)
    {
        e e1;
        (e1 = aa.a.a).a(this, false);
        a(super.a.b + a(), i);
        if(d == null || d.length == 0)
            return;
        int j;
        int k = (j = d[0] & 0xffff) & 0xfff;
        int l = j >> 12;
        af af1;
        int i1 = (af1 = (af)aa.a.a[l][k]).a[a];
        int j1;
        int k1 = aa.a(j1 = af1.a[a + 1]) - aa.a(i1);
        int l1 = aa.b(j1) - aa.b(i1);
        if(q.a(k1) >= q.a(l1))
        {
            l1 = (l1 << 6) / q.a(k1);
            if(k1 > 0)
                k1 = 64;
            else
                k1 = -64;
        } else
        {
            k1 = (k1 << 6) / q.a(l1);
            if(l1 > 0)
                l1 = 64;
            else
                l1 = -64;
        }
        int i2 = (super.a.q << 6) * i >> 6;
        a += k1 * i2 >> 6;
        b += l1 * i2 >> 6;
        o = (short)(a >> 6);
        p = (short)(b >> 6);
        a = null;
        a = a();
        if(a != null)
        {
            super.j = 3;
            return;
        }
        int j2 = q.a(aa.a(j1) - aa.a(i1)) + q.a(aa.b(j1) - aa.b(i1));
        int k2;
        if((k2 = q.a(o - aa.a(i1)) + q.a(p - aa.b(i1))) >= j2)
        {
            a++;
            o = aa.a(j1);
            p = aa.b(j1);
            a = o << 6;
            b = p << 6;
            if(a == af1.a - 1)
            {
                a = null;
                super.j = 3;
            }
        }
    }

    private void f(int i)
    {
        e e1;
        (e1 = aa.a.a).a(this, false);
        if(super.b == super.a.b + a() && a != null)
        {
            a.a(super.a.r);
            if(((z) (a)).E > 0)
            {
                a.j = 19;
                a.g = 0;
            }
        }
        v v1;
        if((v1 = (v)ai.a(65)) != null)
        {
            v1.b(o, p, (byte)2);
            v1.a(100, 500, 0, 400, 36, 32767, 32569, 32352);
        }
        a(super.a.d + a(), i);
        if(c())
            j = 4;
    }

    private void g(int i)
    {
        a(super.a.d + a(), i);
        if(c())
            j = 5;
    }

    public final boolean a()
    {
        if(d == null || d.length == 0)
            return false;
        ai ai1;
        q aq[] = (ai1 = aa.a).a[1];
        short word0 = ai1.c[1];
        t t1 = new t();
        int i;
        int j = (i = d[0] & 0xffff) & 0xfff;
        int k = i >> 12;
        af af1 = (af)aa.a.a[k][j];
        for(int l = 0; l < word0; l++)
        {
            h h1;
            if(((z) (h1 = (h)aq[l])).a.b != 21 || h1.a)
                continue;
            h1.a(t1);
            if(t1.a(aa.a(af1.a[0]), aa.b(af1.a[0]), aa.a(af1.a[af1.a - 1]) + 1, aa.b(af1.a[af1.a - 1]) + 1))
                return true;
        }

        return false;
    }

    private h a()
    {
        ai ai1;
        q aq[] = (ai1 = aa.a).a[1];
        short word0 = ai1.c[1];
        t t1 = new t();
        t t2 = new t();
        b(t2);
        for(int i = 0; i < word0; i++)
        {
            h h1;
            if(((z) (h1 = (h)aq[i])).a.b != 21 || h1.a)
                continue;
            h1.a(t1);
            if(t1.a(t2.a, t2.b, t2.c, t2.d))
                return h1;
        }

        return null;
    }

    public final void b(e e1)
    {
        if(j != 5)
            super.b(e1);
    }

    public final void a(short word0)
    {
        if(j != 3 && j != 4 && j != 5)
            j = 2;
    }

    public final void a()
    {
        super.j = 0;
        a = null;
        E = super.a.k;
        if(d == null || d.length == 0)
        {
            return;
        } else
        {
            int i;
            int j = (i = d[0] & 0xffff) & 0xfff;
            int k = i >> 12;
            af af1 = (af)aa.a.a[k][j];
            o = aa.a(af1.a[0]);
            p = aa.b(af1.a[0]);
            a = o << 6;
            b = p << 6;
            a = 0;
            return;
        }
    }

    public final int a()
    {
        switch(a_)
        {
        case 0: // '\0'
            return 1;

        case 2: // '\002'
            return 0;

        case 3: // '\003'
            return 1;

        case 1: // '\001'
            return 1;
        }
        return 0;
    }
}