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

    public short a;
    public short b;
    public int a;
    public int b;
    public short c;
    public int c;
    public int d;
    public int e;

    public u()
    {
        super((byte)66);
    }

    public final void a(short word0, short word1, short word2, short word3, short word4, int i)
    {
        super.o = word0;
        p = word1;
        d = i;
        a = word0 << 6;
        b = word1 << 6;
        a = word2;
        b = word3;
        e = aa.a.a.b;
        c = word4;
        c = 0;
    }

    private int a(int i, int j, int ai1[], int k)
    {
        int ai2[] = ai1;
        int l = 0x1869f;
        int i1 = -1;
        int ai3[] = new int[1];
        int j1 = aa.a(i) * j >> 6;
        int k1 = aa.b(i) * j >> 6;
        for(int l1 = 0; l1 < k; l1 += 2)
            if(ai.a(a, b, a + j1, b + k1, aa.a(ai2[l1]) << 6, aa.b(ai2[l1]) << 6, aa.a(ai2[l1 + 1]) << 6, aa.b(ai2[l1 + 1]) << 6, ai3) && ai3[0] < l)
            {
                i1 = l1;
                l = ai3[0];
            }

        if(i1 == -1)
            return i;
        int i2 = -(aa.b(ai1[i1 + 1]) - aa.b(ai1[i1]));
        int j2 = aa.a(ai1[i1 + 1]) - aa.a(ai1[i1]);
        int k2 = i2 * i2 + j2 * j2;
        int l2;
        if((l2 = aa.a(i) * i2 + aa.b(i) * j2) > 0)
        {
            i2 = -i2;
            j2 = -j2;
            l2 = -l2;
        }
        l2 *= 2;
        return i = aa.a((short)(aa.a(i) - (l2 * i2) / k2), (short)(aa.b(i) - (l2 * j2) / k2));
    }

    public final void a(int i)
    {
        if(c > 0)
        {
            c -= i;
            if(c < 0)
                c = 0;
            else
                return;
        }
        o o1 = aa.a.a;
        n n1 = aa.a.a.a;
        if(a(i, ((z) (o1))) && ((q) (o1)).j != 20)
        {
            if(((q) (o1)).j == 19)
                return;
            if(((z) (n1)).a.b == 11)
                o1.a((short)10);
            else
                o1.a(aa.a.a.d);
            c();
            return;
        }
        if(a(i, ((z) (n1))) && ((q) (n1)).j != 6)
        {
            if(((z) (n1)).a.b == 11)
                n1.a((short)10);
            else
                n1.a(aa.a.a.d);
            c();
            return;
        }
        c += i;
        if(c >= aa.a.a.c)
        {
            c();
            return;
        } else
        {
            int j = (e << 6) * i >> 6;
            int k = aa.a(a, b);
            k = a(k, j, ai.a, aa.a.c);
            a = aa.a(k);
            b = aa.b(k);
            a += j * a >> 6;
            b += j * b >> 6;
            super.o = (short)(a >> 6);
            p = (short)(b >> 6);
            return;
        }
    }

    public final boolean a(int i, z z1)
    {
        if(c > 0)
        {
            return false;
        } else
        {
            t t1 = new t();
            z1.a(t1);
            int j = (e << 6) * i >> 6;
            aa.a.h = t1.a << 6;
            aa.a.i = t1.b << 6;
            aa.a.j = t1.c << 6;
            aa.a.k = t1.d << 6;
            return aa.a.a(a, b, a + (j * a >> 6), b + (j * b >> 6), (short)0);
        }
    }

    private void c()
    {
        v v1;
        if((v1 = (v)ai.a(65)) != null)
        {
            aj aj1 = aa.a((byte)d);
            v1.b(super.o, p, aj1.a);
            switch(aj1.a)
            {
            case 5: // '\005'
                v1.a(0, 800, 400, 768, 36, 32767, 26431, 639);
                break;

            case 6: // '\006'
            case 11: // '\013'
                v1.a(0, 800, 400, 768, 36, 32767, 16356, 12064);
                break;

            case 0: // '\0'
                v1.a(100, 500, 0, 400, 36, 32767, 32740, 25952);
                break;

            case 2: // '\002'
                v1.a(100, 500, 0, 400, 36, 32767, 32569, 32352);
                break;

            case 3: // '\003'
                v1.a(0, 800, 400, 768, 36, 32767, 32575, 32383);
                break;

            case 4: // '\004'
                v1.a(0, 800, 400, 768, 36, 32767, 26431, 639);
                break;

            case 7: // '\007'
                v1.a(0, 800, 400, 768, 36, 32767, 32575, 32383);
                break;

            case 8: // '\b'
                v1.a(0, 800, 400, 768, 36, 32767, 16356, 12064);
                break;
            }
        }
        i = false;
    }

    public final void b(e e1)
    {
        if(aa.k != 2)
            return;
        else
            return;
    }

    public final void a(e e1)
    {
        if(aa.k != 2)
            return;
        switch(d)
        {
        case 5: // '\005'
            aa.a(a, b, e1, 4, 32767);
            a(2, e1);
            return;

        case 6: // '\006'
        case 11: // '\013'
            aa.a(a, b, e1, 4, 32767);
            a(4, e1);
            return;

        case 0: // '\0'
            a(1, e1);
            return;

        case 2: // '\002'
            a(0, e1);
            return;

        case 3: // '\003'
            aa.a(a, b, e1, 4, 32767);
            a(3, e1);
            return;

        case 4: // '\004'
            a(2, e1);
            return;

        case 7: // '\007'
            a(3, e1);
            return;

        case 8: // '\b'
            aa.b(a, b, e1, 6, 32767);
            a(4, e1);
            // fall through

        case 1: // '\001'
        case 9: // '\t'
        case 10: // '\n'
        default:
            return;
        }
    }

    private void a(int i, e e1)
    {
        g g1;
        (g1 = aa.a[2]).a(1, 15, super.o - g1.a[1], p - g1.b[1], i, e1);
    }
}