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

    public int a;
    public byte a;
    public byte a_;
    public int b;
    public int c;
    public byte c;

    public ah()
    {
        super((byte)4);
    }

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

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

        case 3: // '\003'
            e(i);
            // fall through

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

    public final void c()
    {
        j = 1;
    }

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

    private void c(int i)
    {
        a(11, i);
        if(c())
            j = 0;
    }

    private void e(int i)
    {
        a(12, i);
        if(c())
            j = 4;
    }

    public final void d()
    {
        if(j == 1)
        {
            j = 0;
            return;
        }
        if(j == 0)
            j = 1;
    }

    public final void b(e e1)
    {
        if(j == 1)
            return;
        if(j == 4)
            return;
        g g1 = aa.a[9];
        t t1 = new t();
        switch(a)
        {
        case 2: // '\002'
            return;

        case 4: // '\004'
            super.b(e1);
            b(t1);
            if(aa.a.m < 128)
            {
                g1.a(16, t1.a + t1.c >> 1, t1.b - 4 - g1.b[16], 0, e1, 0);
                return;
            } else
            {
                g1.a(16, t1.a + t1.c >> 1, t1.b - 8 - g1.b[16], 0, e1, 0);
                return;
            }
        }
        super.b(e1);
    }

    public final void a(e e1)
    {
        if(j == 1)
            return;
        g g1 = aa.a[2];
        l l1;
        byte byte0 = (byte)((l1 = super.a.a[super.b]).a[k][0] >> 16 & 0xff);
        switch(a)
        {
        case 2: // '\002'
            super.b(e1);
            if((k & 0x1) == 0)
            {
                g1.a(0, 10, o - 18, (p + byte0) - (g1.b[0] >> 1) - 10, 1, e1);
                return;
            }
            g1.a(0, 8, o - 18, (p + byte0) - (g1.b[0] >> 1) - 10, 1, e1);
            break;
        }
    }

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

    public final void a()
    {
        super.j = c;
        if(a == 3 || a == 2)
        {
            a(a, 0);
            l l1 = super.a.a[super.b];
            super.k = (byte)aa.b(0, l1.a);
            b();
            return;
        }
        d(a);
        if(super.d == null || super.d.length == 0)
        {
            return;
        } else
        {
            int i;
            int j = (i = super.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]);
            b = o << 6;
            c = p << 6;
            a = 0;
            a_ = 1;
            return;
        }
    }
}