x.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 x extends q
{

    public byte a;
    public byte b;
    public short a;
    public boolean a;
    public boolean b;
    public short b;
    public int a;

    public x()
    {
        super((byte)2);
    }

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

    public final void b(e e1)
    {
        g g1 = aa.a[1];
        switch(a)
        {
        case 0: // '\0'
        case 1: // '\001'
            g1.a(a, b, a, o, p, 0, e1);
            g1.a(a, b, a, o, p + g1.b[a], 2, e1);
            g1.a(a, b, a, o + g1.a[a], p, 1, e1);
            g1.a(a, b, a, o + g1.a[a], p + g1.b[a], 3, e1);
            return;
        }
        g1.a(a, b, a, o, p, a_, e1);
    }

    private void b(int i)
    {
        if(a < 6000)
            a += i;
        if(a >= 6000 && b)
        {
            e e1;
            int j = ((e1 = aa.a.a).a + (e1.i >> 1)) - o;
            int k = (e1.b + (e1.j >> 1)) - p;
            int l;
            if((l = q.a(j) < q.a(k) ? q.a(k) : q.a(j)) < 400)
            {
                if(a < b && ((q) (aa.a.a)).j != 1)
                {
                    if(d != null)
                    {
                        for(int i1 = 0; i1 < d.length; i1++)
                        {
                            int k1;
                            int i2 = (k1 = d[i1] & 0xffff) & 0xfff;
                            int k2;
                            ah ah1;
                            if((k2 = k1 >> 12) == 4 && ((q) (ah1 = (ah)aa.a.a[k2][i2])).j != 0)
                                ah1.j = 2;
                            if(k2 == 2)
                            {
                                x x1;
                                (x1 = (x)aa.a.a[k2][i2]).a = x1.b;
                                x1.j = 0;
                            }
                        }

                    }
                    a = b;
                    ai.b = true;
                    return;
                }
                if(a == b)
                {
                    super.j = 0;
                    return;
                }
            } else
            {
                if(d != null)
                {
                    for(int j1 = 0; j1 < d.length; j1++)
                    {
                        int l1;
                        int j2 = (l1 = d[j1] & 0xffff) & 0xfff;
                        int l2;
                        ah ah2;
                        if((l2 = l1 >> 12) == 4 && ((q) (ah2 = (ah)aa.a.a[l2][j2])).j != 0)
                            ah2.j = 2;
                        if(l2 == 2)
                        {
                            x x2;
                            (x2 = (x)aa.a.a[l2][j2]).a = x2.b;
                            x2.j = 0;
                        }
                    }

                }
                a = b;
                super.j = 0;
            }
        }
    }

    private void c(int i)
    {
        if(a < 10000)
            a += i;
        if(a >= 10000)
        {
            if(a > b)
            {
                a = b;
                ai.b = true;
                return;
            }
            j = 0;
        }
    }

    private void b()
    {
        if(a < 250)
        {
            a = 255;
            ai.b = true;
            return;
        } else
        {
            j = 2;
            a = 0;
            return;
        }
    }

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

        case 3: // '\003'
            b();
            return;

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

    public final void a()
    {
        a = b;
        a = 6000;
        j = 0;
    }

    public final int a(int i, int j, int k, int l, byte byte0)
    {
        if(a == 0)
            return 0;
        g g1 = aa.a[1];
        int i1 = 0;
        int j1 = 0;
        int k1 = g1.a[a];
        int l1 = b << 8;
        short word0 = g1.a[a];
        short word1 = g1.b[a];
        byte byte1 = 1;
        if((byte0 & 0x1) != 0)
        {
            i1 = word0 - 1 - 0;
            byte1 = -1;
        }
        int i2 = word0;
        if((byte0 & 0x2) != 0)
        {
            j1 = word1 - 1 - 0;
            i2 = -word0;
        }
        k1 = k1 + j1 * word0 + i1;
        k -= i;
        l -= j;
        if((k1 += i2 * l + byte1 * k) < g1.a[a] || k1 >= g1.a[a] + word0 * word1)
            return 0;
        short word2 = (short)(g1.a[k1] & 0xff);
        if(a && super.j == 0)
            word2 -= 255 - b;
        else
            word2 -= 255 - a;
        int j2 = 0;
        if(word2 > 1)
        {
            word2 = aa.a[l1 + word2];
            int k2 = 299 * (word2 >> 10 & 0x1f);
            int l2 = 587 * (word2 >> 5 & 0x1f);
            int i3 = 114 * (word2 & 0x1f);
            j2 = (j2 = 0 + k2 + l2 + i3) >> 9;
        }
        return j2;
    }

    public final boolean a()
    {
        g g1 = aa.a[1];
        e e1 = aa.a.a;
        int i = o + (g1.a[a] >> 1);
        int j = p + (g1.b[a] >> 1);
        return e1.a <= i && i < e1.a + e1.i && e1.b <= j && j < e1.b + e1.j;
    }
}