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

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

    public ak()
    {
        super((byte)0);
        super.a = new ad();
        super.a.a = aa.a[13];
        super.a.a = aa.a[8];
        ad ad1 = aa.a((byte)0, (byte)0);
        super.a.a = ad1.a;
        super.a.b = ad1.b;
        super.a.c = ad1.c;
        super.a.d = ad1.d;
        a = false;
    }

    public final void a(int i, int j)
    {
        E = 1;
        c = a = i << 6;
        d = b = j << 6;
        super.o = (short)(a >> 6);
        p = (short)(b >> 6);
        aa.a.a.h = true;
    }

    public final void a()
    {
        E = 1;
    }

    public final boolean a(int i, int j, int k)
    {
        k -= 3584;
        int l = j - c;
        int i1 = k - d;
        int j1 = q.a(l);
        int k1 = q.a(i1);
        int l1 = j1 <= k1 ? k1 : j1;
        boolean flag = false;
        if(l1 >> 6 != 0)
        {
            l /= l1 >> 6;
            i1 /= l1 >> 6;
            a(i, l, i1, false);
            int i2 = (j - c) * (j - c) + (k - d) * (k - d);
            int j2;
            flag = (j2 = (a - c) * (a - c) + (b - d) * (b - d)) >= i2;
        } else
        {
            flag = true;
        }
        if(flag)
        {
            a = j;
            b = k;
            super.o = (short)(a >> 6);
            p = (short)(b >> 6);
            return true;
        } else
        {
            return false;
        }
    }

    public final void a(int i, int j, int k, boolean flag)
    {
        int l = 0;
        int i1 = 384 * i >> 6;
        if(flag)
            l = aa.a.a(a, b, super.a.a << 6, super.a.b + 56 << 6, super.a.c << 6, super.a.d + 56 << 6, j, k, i1, 0);
        else
            l = aa.a((short)(j * i1 >> 6), (short)(k * i1 >> 6));
        a += aa.a(l);
        b += aa.b(l);
        super.o = (short)(a >> 6);
        p = (short)(b >> 6);
        e = z.a((short)j, (short)k);
        b(i);
    }

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

        case 1: // '\001'
            a(4, i);
            return;

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

        case 3: // '\003'
            a(3, i);
            break;
        }
    }

    public final void b(e e1)
    {
        if(E == 0)
        {
            return;
        } else
        {
            super.b(e1);
            return;
        }
    }

    public final void c(e e1)
    {
        g g1;
        (g1 = aa.a[3]).a(0, super.o - (g1.a[0] >> 1), p + 56, 0, e1, 0);
        g1.a(0, super.o - (g1.a[0] >> 1), p + (g1.b[0] >> 1) + 56, 0, e1, 0);
        g1.a(0, super.o, p + 56, 0, e1, 0);
        g1.a(0, super.o, p + (g1.b[0] >> 1) + 56, 0, e1, 0);
    }

    public final void a(short word0)
    {
        if(aa.a)
            return;
        if(E == 0)
        {
            return;
        } else
        {
            E = 0;
            c = super.o << 6;
            d = p << 6;
            aa.a.a.j = 24;
            aa.f();
            ai.b(64);
            ai.b(65);
            aa.a.b[5]++;
            return;
        }
    }

    public final void a(short word0, short word1, short word2, short word3, int i, int j, int k)
    {
        super.o = (short)(word0 + ((word2 - word0) * i) / j);
        p = (short)(word1 + ((word3 - word1) * i) / j);
        e = z.a((short)(word2 - word0), (short)(word3 - word1));
        b((k * 3) / 4);
    }
}