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

    public int a;
    public int b;
    public int c;
    public int d;
    public short a;
    public int e;
    public int f;
    public h a;
    public byte a;
    public int g;
    public int h;
    public int i;
    public int j;
    public boolean a;
    public int k;
    public int l;
    public int m;
    public short b;
    public short c;
    public short d;
    public short e;
    public ak a;
    public n a;
    public z a;
    public int n;
    public int o;
    public int p;
    public int q;
    public int r;
    public int s;
    public x a;
    public short f;
    public ab a;
    public z b;
    public byte c;
    public byte d;
    public byte e;
    public byte f;
    public byte g;
    public int t;
    public boolean b;
    public boolean c;
    public boolean d;
    public byte h;
    public int u;
    public boolean e;
    public boolean f;
    public boolean g;
    public boolean h;
    public int v;
    public int w;
    public int x;
    public int y;
    public int z;
    public d a;
    public int A;
    public int B;
    public p a;
    public int C;
    public short g;

    public o()
    {
        super((byte)0);
        a = null;
        a = new ak();
        a = null;
        a = new d();
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        a = word0 << 6;
        b = word1 << 6;
        super.a = aa.a((byte)0, aa.a());
        h = aa.a();
        d = aa.a();
        e = aa.a();
    }

    public final void a(int i1)
    {
        d = b();
        if(e)
        {
            aa.a();
            return;
        }
        f();
        switch(super.j)
        {
        case 0: // '\0'
            e(i1);
            break;

        case 1: // '\001'
            g(i1);
            break;

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

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

        case 2: // '\002'
            j(i1);
            break;

        case 14: // '\016'
            s(i1);
            break;

        case 15: // '\017'
            c(i1);
            break;

        case 16: // '\020'
            t(i1);
            break;

        case 17: // '\021'
            u(i1);
            break;

        case 18: // '\022'
            k(i1);
            break;

        case 19: // '\023'
            l(i1);
            break;

        case 20: // '\024'
            n(i1);
            break;

        case 21: // '\025'
            o(i1);
            break;

        case 36: // '$'
            m(i1);
            break;

        case 33: // '!'
            p(i1);
            break;

        case 34: // '"'
            q(i1);
            break;

        case 22: // '\026'
            w(i1);
            break;

        case 23: // '\027'
            x(i1);
            break;

        case 24: // '\030'
            k();
            break;

        case 25: // '\031'
            z(i1);
            break;

        case 32: // ' '
            y(i1);
            break;

        case 26: // '\032'
            B(i1);
            break;

        case 27: // '\033'
            A(i1);
            break;

        case 28: // '\034'
            f(i1);
            break;

        case 29: // '\035'
            v(i1);
            break;

        case 35: // '#'
            r(i1);
            break;
        }
        if(aa.a.p == 1 && super.j == 16 || super.j == 29 && a.c)
            a.a(i1);
        switch(aa.a.p)
        {
        case 2: // '\002'
            a = false;
            int j1 = 0;
            if((j1 = aa.a.a(super.o, super.p - 5)) > 7)
                a = true;
            if(super.j == 3 || super.j == 22)
                a = true;
            if(a)
            {
                if(k < 520)
                {
                    k += i1;
                    if(k > 520)
                    {
                        k = 520;
                        return;
                    }
                }
            } else
            {
                k = 0;
            }
            break;
        }
    }

    public final void a()
    {
        a_ = super.m;
        f = d;
        g = e;
        a = null;
        b = null;
        E = super.a.k;
        g = (short)aa.b(0, 5);
        if(aa.a != 16 && aa.b == 18 && aa.h && aa.A >= 0)
            E = aa.A;
        i = 0;
        j = 0;
        b = false;
        c = true;
        a = null;
        a = false;
        k = 0;
        t = -1;
        f = false;
        e = false;
        d = true;
        b = 315;
        c = 135;
        d = 20;
        e = 200;
        C = -1;
        switch(aa.a.p)
        {
        case 0: // '\0'
        case 2: // '\002'
        case 5: // '\005'
            super.j = 0;
            a = 2;
            l = 64;
            a = null;
            c = 67;
            a.a();
            break;

        case 1: // '\001'
            a = 2;
            super.j = 15;
            break;
        }
        super.o = super.q;
        super.p = super.r;
        a = super.o << 6;
        b = super.p << 6;
        d(super.a.a + a());
        g = false;
        h = true;
        A = -1;
    }

    private boolean b()
    {
        e e1 = aa.a.a;
        t t1 = new t();
        b(t1);
        return t1.a(e1.a, e1.b, e1.a + e1.i, e1.b + e1.j);
    }

    private void a(int i1, short word0, int j1, int k1)
    {
        e = j1;
        f = k1;
        boolean flag = false;
        if(aa.a.p == 2)
        {
            if(j1 != 0)
                if(j1 < 0)
                {
                    if(m != 200)
                    {
                        m = 200;
                        l = 0;
                        a_ = a(j1, k1);
                        int l1 = aa.a(m, 0);
                        i = aa.a(l1);
                        j = aa.b(l1);
                        h = q.a(j1);
                        return;
                    }
                } else
                if(m != 20)
                {
                    m = 20;
                    l = 0;
                    a_ = a(j1, k1);
                    int i2 = aa.a(m, 0);
                    i = aa.a(i2);
                    j = aa.b(i2);
                    h = q.a(j1);
                    return;
                }
            if(k1 != 0)
                if(k1 > 0)
                {
                    if(m != 315)
                    {
                        m = 315;
                        l = 0;
                        a_ = a(j1, k1);
                        int j2 = aa.a(m, 0);
                        i = aa.a(j2);
                        j = aa.b(j2);
                        h = q.a(k1);
                        return;
                    }
                } else
                if(m != 135)
                {
                    m = 135;
                    l = 0;
                    a_ = a(j1, k1);
                    int k2 = aa.a(m, 0);
                    i = aa.a(k2);
                    j = aa.b(k2);
                    h = q.a(k1);
                    return;
                }
        }
        if(l < 64)
        {
            l += i1;
            return;
        }
        a = word0;
        if(aa.a.p == 2)
            a = null;
        super.j = 1;
    }

    public final void a(boolean flag, int i1, int j1)
    {
        super.j = 23;
        a.a(i1, j1);
        f = flag;
    }

    public final void b(short word0, short word1, byte byte0)
    {
        super.o = word0;
        super.p = word1;
        a = word0 << 6;
        b = word1 << 6;
        a_ = byte0;
        a = null;
        a = null;
        a = null;
        e();
        aa.a.a.d = a_;
        aa.a.a.a(this, true);
        aa.a.b();
    }

    private void e(int i1)
    {
        i = 0;
        j = 0;
        a(super.a.a + a(), i1);
        if(aa.a(16) && g)
        {
            aa.b(16);
            b = true;
            return;
        }
        if(aa.a.p == 2)
        {
            i();
            h();
            f();
            if(aa.a(16))
            {
                if(a != null)
                {
                    g g1 = aa.a[1];
                    a_ = a((((q) (a)).o + (g1.a[a.a] >> 1)) - super.o, (((q) (a)).p + (g1.b[a.a] >> 1)) - (super.p - 18));
                    m = c(a_);
                    super.j = 22;
                    b = null;
                    r = 0;
                    f = 250;
                    return;
                }
                if(b != null)
                {
                    super.j = 27;
                    a = b;
                    return;
                }
                if(g())
                    return;
            }
            if(aa.a(16384) && h && super.a.b == 0)
            {
                aa.b(16384);
                e e1 = aa.a.a;
                a(false, e1.a - 70, e1.b + e1.j + 70);
                return;
            }
        }
        if(aa.a(4))
        {
            a(i1, (short)4, -h, 0);
            a(super.a.a + a(), i1);
            return;
        }
        if(aa.a(8))
        {
            a(i1, (short)8, h, 0);
            a(super.a.a + a(), i1);
            return;
        }
        if(aa.a(1))
        {
            a(i1, (short)1, 0, -h);
            a(super.a.a + a(), i1);
            return;
        }
        if(aa.a(2))
        {
            a(i1, (short)2, 0, h);
            a(super.a.a + a(), i1);
            return;
        }
        if(aa.a.p == 0 || aa.a.p == 5)
            i();
        if(a != null || a != null && ((q) (a)).i == 13 && ((q) (a)).j == 1)
        {
            if(a != null)
                a = a;
            super.j = 2;
            return;
        } else
        {
            return;
        }
    }

    public final void a(short word0, short word1, int i1)
    {
        v = a;
        w = b;
        x = word0 << 6;
        y = word1 << 6;
        super.j = 28;
        z = i1;
    }

    private void f(int i1)
    {
        int j1 = (h << 6) * i1 >> 6;
        int k1 = x - v;
        int l1 = y - w;
        a_ = z.a((short)(k1 >> 6), (short)(l1 >> 6));
        int i2 = q.a(k1);
        int j2 = q.a(l1);
        int k2 = i2 <= j2 ? j2 : i2;
        k1 = (k1 << 6) / k2;
        l1 = (l1 << 6) / k2;
        c = k1 * j1 >> 6;
        d = l1 * j1 >> 6;
        a += c;
        b += d;
        super.o = (short)(a >> 6);
        super.p = (short)(b >> 6);
        int l2 = (x - v) * (x - v) + (y - w) * (y - w);
        int i3 = (a - v) * (a - v) + (b - w) * (b - w);
        a(super.a.b + a(), i1);
        if(i3 >= l2)
        {
            a = x;
            b = y;
            super.o = (short)(a >> 6);
            super.p = (short)(b >> 6);
            if(z != -1)
                a_ = (byte)z;
            i = 0;
            j = 0;
            super.j = 0;
            d(super.a.a + a());
        }
    }

    private void g(int i1)
    {
        int j1 = 0;
        if(!aa.a(a))
        {
            super.j = 0;
            i = 0;
            j = 0;
            return;
        }
        if(e != 0)
        {
            m = d;
            if(e < 0)
                m = e;
            j1 = aa.a(m, 0);
            i = aa.a(j1);
            j = aa.b(j1);
            h = q.a(e);
        }
        if(f != 0)
        {
            m = c;
            if(f > 0)
                m = b;
            j1 = aa.a(m, j1);
            i = aa.a(j1);
            j = aa.b(j1);
            h = q.a(f);
        }
        if(!b(i, j, h, i1))
        {
            a(super.a.a + a(), i1);
            i = 0;
            j = 0;
            super.j = 0;
            return;
        } else
        {
            h();
            f();
            return;
        }
    }

    private boolean b(int i1, int j1, int k1, int l1)
    {
        int i2 = (k1 << 6) * l1 >> 6;
        int j2 = 0;
        j2 = aa.a.a(a, b, super.a.a << 6, super.a.b << 6, super.a.c << 6, super.a.d << 6, i1, j1, i2, 0);
        c = aa.a(j2);
        d = aa.b(j2);
        a_ = a(e, f);
        if(c == 0 && d == 0)
            return false;
        short word0 = (short)(a + c + 32 >> 6);
        short word1 = (short)(b + d + 32 >> 6);
        if(aa.a.a(word0 + super.a.a, word1 + super.a.b, word0 + super.a.c, word1 + super.a.d) != null)
        {
            return false;
        } else
        {
            a(super.a.b + a(), l1);
            a += c;
            b += d;
            super.o = word0;
            super.p = word1;
            return true;
        }
    }

    private void i()
    {
        int k1 = aa.a.d;
        q aq[] = ai.a;
        a = null;