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

    public int a;
    public int b;
    public o a;
    public p a;
    public int c;
    public int d;
    public int e;
    public int f;
    public int g;
    public int h;
    public short a;
    public short b;
    public int i;
    public short a[];
    public short c;
    public short b[];
    public short d;
    public short c[];
    public int j;
    public short e;
    public short f;
    public short g;
    public short h;
    public short i;
    public short j;
    public short k;
    public short l;
    public short m;
    public int k;

    public n()
    {
        super((byte)6);
    }

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

        case 5: // '\005'
            e(i1);
            return;

        case 1: // '\001'
            f(i1);
            return;

        case 2: // '\002'
            g(i1);
            return;

        case 3: // '\003'
            h(i1);
            return;

        case 4: // '\004'
            i(i1);
            return;

        case 7: // '\007'
            j(i1);
            return;

        case 6: // '\006'
            k(i1);
            return;

        case 8: // '\b'
            l(i1);
            break;
        }
    }

    public final void a()
    {
        k();
        super.j = 5;
        E = super.a.k;
        a = aa.a.a;
        super.o = super.q;
        super.p = r;
        d(super.a.a + a());
        e = -1;
        m = 0;
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        if(aa.b == 18 || aa.b == 17)
        {
            aa.a();
            super.a = aa.a((byte)6, (byte)aa.x);
        } else
        {
            super.a = aa.a((byte)6, aa.a());
        }
        a = aa.a();
        b = aa.a();
        E = super.a.k;
    }

    public final void c()
    {
        a = 0;
        super.j = 0;
        f();
        aa.i();
    }

    private void f()
    {
        e++;
        if(e >= d)
            e = 0;
        f = (byte)c[e];
        a = 0;
        b = 8;
    }

    public final void a(short word0)
    {
        E -= word0;
        if(E <= 0)
        {
            E = 0;
            aa.i();
            ai.b(64);
            ai.b(65);
            ai.b(66);
            a.j = 15;
            a.c(0);
            if(super.d != null && super.d.length > 0)
            {
                for(int i1 = 0; i1 < super.d.length; i1++)
                {
                    int k1;
                    int l1 = (k1 = super.d[i1] & 0xffff) & 0xfff;
                    int i2;
                    if((i2 = k1 >> 12) == 5)
                    {
                        ((a)aa.a.a[i2][l1]).b();
                        aa.d(2);
                    }
                }

                if(aa.b == 18 || aa.b == 17)
                    aa.h = false;
            } else
            if(aa.b == 18 || aa.b == 17)
            {
                aa.a = aa.b;
                aa.b = -1;
                aa.h = true;
                aa.a.h();
            } else
            {
                aa.h();
                aa.d(8);
            }
            if(b != -1)
            {
                int j1 = aa.k;
                aa.h(b);
                aa.l = j1;
            }
            return;
        }
        if(super.j == 8 || super.j == 4)
            return;
        if(super.j == 7)
        {
            super.j = 8;
            return;
        } else
        {
            super.j = 4;
            return;
        }
    }

    private void c(int i1)
    {
        a(super.a.a + a(), i1);
        if(aa.a.l == 0)
            super.j = 1;
    }

    private void e(int i1)
    {
        a(super.a.a + a(), i1);
    }

    private void i()
    {
        a++;
        if(a >= b)
        {
            super.j = 2;
            a = 0;
        }
    }

    private void j()
    {
        a--;
        if(a < 0)
            a = 0;
    }

    private void f(int i1)
    {
        a(super.a.a + a(), i1);
    }

    public final void b(int i1)
    {
        if(super.j != 1)
            return;
        if(i1 != 2)
        {
            if(k == 1)
            {
                k = 0;
                i();
                return;
            }
            if(k == -1)
            {
                k = 0;
                j();
                return;
            }
        }
        int j3 = aa.a.a.o - aa.a.a.n;
        int k3 = b - a;
        switch(i1)
        {
        default:
            break;

        case 0: // '\0'
            int j1 = e + (k3 - j3) * f;
            int j2;
            if((j2 = aa.b(0, 1000)) / 10 < j1)
            {
                i();
                return;
            }
            break;

        case 1: // '\001'
            int k1 = e + (k3 - j3) * f;
            int k2;
            if((k2 = aa.b(0, 1000)) / 10 < k1)
                i();
            if(a < b && (k2 = aa.b(0, 1000)) / 10 < k1)
            {
                i();
                return;
            }
            break;

        case 2: // '\002'
            if(k != 0)
                return;
            int l1;
            if(j3 - 3 > k3)
                l1 = g + (j3 - k3) * h;
            else
                l1 = g + (k3 - j3) * h;
            int l2;
            if((l2 = aa.b(0, 1000)) / 10 < l1)
            {
                k = 1;
                return;
            }
            l1 = i + (j3 - k3) * j;
            if((l2 = aa.b(0, 1000)) / 10 < l1)
            {
                k = -1;
                return;
            }
            break;

        case 3: // '\003'
            int i2 = k + (k3 - j3) * l;
            int i3;
            if((i3 = aa.b(0, 1000)) / 10 < i2)
                i();
            break;
        }
    }

    private void g(int i1)
    {
        a(super.a.d + a(), i1);
        if(c())
        {
            h = 0;
            g = 0;
            super.j = 3;
            t t1 = new t();
            b(t1);
        }
    }

    private void h(int i1)
    {
        a(super.a.d + a(), i1);
        if(c())
        {
            h += i1;
            if(h < 720)
            {
                g = h / 60;
                return;
            }
            a = (p)ai.a(64);
            if(a != null)
            {
                a.o += a.p;
                a.p += a.q;
                if(super.a.b == 11 && !a.a())
                {
                    a.A++;
                    z z1;
                    if((z1 = a.a()) != null)
                    {
                        a.j = 33;
                        a.B = 0;
                        a.a((short)(super.o + c), (short)(super.p + d), a, this, aa.a((byte)11), (short)-1, (short)-1);
                        a.a = z1;
                        a.a = a;
                    } else
                    {
                        a.a((short)(super.o + c), (short)(super.p + d), a, this, aa.a((byte)f), (short)-1, (short)-1);
                    }
                } else
                {
                    a.a((short)(super.o + c), (short)(super.p + d), a, this, aa.a((byte)f), (short)-1, (short)-1);
                }
                a.o -= a.p;
                a.p -= a.q;
                d(super.a.a + a());
                super.j = 5;
            }
        }
    }

    private void i(int i1)
    {
        a(super.a.j + a(), i1);
        if(c())
        {
            if(super.a.b == 11 && aa.a == 7)
            {
                aa.a(16, 317 + m, 68, 3, 1);
                m = (short)((m + 1) % 4);
            }
            aa.a.f();
        }
    }

    public final void d()
    {
        super.j = 7;
    }

    private boolean a(int i1)
    {
        u u1;
        if((u1 = aa.a.a(this, i1)) == null)
            return false;
        int j1;
        if((j1 = aa.b(0, 100)) < super.a.c)
        {
            a(aa.a);
            super.j = 6;
            return true;
        } else
        {
            return false;
        }
    }

    private void j(int i1)
    {
        a(super.a.a + a(), i1);
        a(i1);
    }

    private void k(int i1)
    {
        a(super.a.f, i1);
        if(c() && !a(i1))
            super.j = 7;
        if(super.j == 6)
            a(aa.a);
    }

    private void l(int i1)
    {
        a(super.a.j, i1);
        if(c())
            super.j = 7;
    }

    public final void a(t t1)
    {
        switch(super.a.b)
        {
        case 11: // '\013'
            t1.a = (short)(super.o - 14);
            t1.b = (short)(super.p - 56);
            t1.c = (short)(super.o + 10);
            t1.d = (short)(super.p + 9);
            return;
        }
        t1.a = (short)(super.o - 10);
        t1.b = (short)(super.p - 32);
        t1.c = (short)(super.o + 10);
        t1.d = (short)(super.p + 12);
    }

    public final void a(e e1)
    {
        if(super.j == 3)
        {
            k();
            g g1 = aa.a[2];
            aj aj1;
            switch((aj1 = aa.a((byte)f)).a)
            {
            case 1: // '\001'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 0, e1);
                break;

            case 0: // '\0'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 0, e1);
                break;

            case 2: // '\002'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 0, e1);
                break;

            case 5: // '\005'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 2, e1);
                break;

            case 3: // '\003'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 3, e1);
                break;

            case 4: // '\004'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 2, e1);
                break;

            case 6: // '\006'
            case 8: // '\b'
                g1.a(0, g, (super.o + c) - g1.a[0], (super.p + d) - g1.b[0], 4, e1);
                break;
            }
        }
        if(aa.b() && aa.ab == super.a.b)
            aa.a(this);
    }

    private void k()
    {
        switch(super.a.b)
        {
        case 0: // '\0'
        case 1: // '\001'
        case 2: // '\002'
        case 7: // '\007'
            switch(a_)
            {
            case 2: // '\002'
                c = 9;
                d = -31;
                break;

            case 3: // '\003'
                c = 8;
                d = -20;
                break;

            case 0: // '\0'
                c = 24;
                d = -27;
                break;

            case 1: // '\001'
                c = -24;
                d = -27;
                // fall through

            default:
                return;
            }
            break;

        case 3: // '\003'
        case 4: // '\004'
        case 5: // '\005'
        case 6: // '\006'
            c = -16;
            d = -12;
            return;

        case 8: // '\b'
            c = 30;
            d = -36;
            return;

        case 9: // '\t'
            c = -25;
            d = -30;
            return;

        case 10: // '\n'
            c = -25;
            d = -30;
            return;

        case 11: // '\013'
            c = -35;
            d = -51;
            break;
        }
    }

    public final int b()
    {
        switch(super.a.b)
        {
        case 1: // '\001'
            return 10;

        case 0: // '\0'
            return 7;

        case 4: // '\004'
            return 9;

        case 5: // '\005'
            return 2;

        case 6: // '\006'
            return 3;

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

        case 7: // '\007'
            return 5;

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

        case 8: // '\b'
            return 6;

        case 9: // '\t'
            return 13;

        case 10: // '\n'
            return 15;

        case 11: // '\013'
            return 8;
        }
        return 7;
    }

    public final int a()
    {
        switch(super.a.b)
        {
        case 3: // '\003'
        case 4: // '\004'
        case 5: // '\005'
        case 6: // '\006'
        case 7: // '\007'
        case 8: // '\b'
        case 9: // '\t'
        case 11: // '\013'
            return 0;

        case 10: // '\n'
        default:
            return super.a();
        }
    }

    public final void e()
    {
        aa.i(57 + super.a.b);
        aa.d();
        aa.e();
        aa.e();
        i = aa.a(aa.a);
        if(i != 0)
            a = new short[i];
        aa.d();
        aa.e();
        for(int i1 = 0; i1 < i; i1++)
        {
            aa.e();
            a[i1] = aa.a(aa.a);
        }

        aa.d();
        aa.e();
        aa.e();
        c = aa.a(aa.a);
        if(c != 0)
            b = new short[c];
        aa.d();
        aa.e();
        for(int j1 = 0; j1 < c; j1++)
        {
            aa.e();
            b[j1] = aa.a(aa.a);
        }

        aa.d();
        aa.e();
        aa.e();
        d = aa.a(aa.a);
        if(d != 0)
            c = new short[d];
        aa.d();
        aa.e();
        for(int k1 = 0; k1 < d; k1++)
        {
            aa.e();
            c[k1] = aa.a(aa.a);
        }

        aa.d();
        aa.e();
        aa.e();
        j = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        e = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        f = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        g = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        h = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        i = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        j = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        k = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        l = aa.a(aa.a);
        if(aa.b == 17 || aa.b == 18)
        {
            a = -1;
            b = -1;
        }
    }
}