s.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 s
{

    public int a;
    public int b;
    public int c;
    public int d;
    public int e;
    public int f;
    public int a[];
    public int b[];
    public int c[];
    public int d[];
    public int e[];
    public int g;

    public s()
    {
        a = new int[48];
        b = new int[48];
        c = new int[48];
        d = new int[48];
        e = new int[48];
    }

    public final void a()
    {
        b();
        c = 1;
        d = 0;
        a = 0;
    }

    public final void a(int i, int j)
    {
        b();
        c = -160;
        e = i << 6;
        f = j << 6;
        d = 0;
        b = 0;
        a = 0;
    }

    private void a(short word0)
    {
        int i;
        for(i = 0; i < 48 && e[i] > 0; i++);
        if(i == 48)
        {
            return;
        } else
        {
            int j;
            int k = ((j = 600 - aa.b(0, 600)) + 600) - a;
            j = 5 - aa.b(0, 10);
            int l = e + d + (j << 6);
            j = 5 - aa.b(0, 10);
            int i1 = f + (j << 6);
            e[i] = k;
            a[i] = l;
            b[i] = i1;
            c[i] = 0;
            d[i] = -100;
            g = word0;
            return;
        }
    }

    public final void a(short word0, int i)
    {
        if(a > 600)
            return;
        int j;
        j = (j = 6 * i >> 6) * c;
        d += j;
        if(j > 0)
            if(d >= 256 && d < 768)
                f -= j << 1;
            else
                f -= j >> 1;
        if(d > 1280)
        {
            d = 1280;
            c = -160;
        } else
        if(d < 0)
        {
            d = 0;
            c = 110;
        }
        b += i;
        a += i;
        if(b >= 16 && c > 0)
        {
            b = 0;
            a(word0);
        }
    }

    public final void a(int i)
    {
        for(int j = 0; j < 48; j++)
        {
            if(e[j] <= 0)
                continue;
            e[j] -= i;
            if(c[j] != 0)
            {
                int k = c[j] * i >> 6;
                a[j] += k;
            }
            if(d[j] != 0)
            {
                int l = d[j] * i >> 6;
                b[j] += l;
            }
        }

    }

    public final void a(e e1)
    {
        if(aa.k != 2 && aa.k != 18)
            return;
        g g1 = aa.a[2];
        for(int j = 0; j < 48; j++)
        {
            if(e[j] <= 0)
                continue;
            int i;
            if((i = e[j] >> 4) > 12)
                i = 12;
            g1.a(1, i, a[j] >> 6, b[j] >> 6, g, e1);
        }

    }

    public final void b()
    {
        for(int i = 0; i < 48; i++)
            e[i] = 0;

    }

    public final void b(int i)
    {
        d += c;
        if(d > 4)
        {
            d = 4;
            c = -1;
        } else
        if(d < 0)
        {
            d = 0;
            c = 1;
        }
        b += i;
        if(b >= 100)
        {
            b = 0;
            c();
        }
    }

    private void c()
    {
        int i;
        for(i = 0; i < 48 && e[i] > 0; i++);
        if(i == 48)
        {
            return;
        } else
        {
            int j = 350 - aa.b(0, 700);
            e[i] = 700 + j;
            j = 5 - aa.b(0, 10);
            a[i] = ((e + d) - 6) + j << 6;
            j = 5 - aa.b(0, 10);
            b[i] = (f - 13) + j << 6;
            c[i] = 0;
            d[i] = -64;
            g = 0;
            return;
        }
    }

    public final void a(int i, int j, int k, int l, int i1, int j1)
    {
        int k1;
        for(k1 = 0; k1 < 48 && e[k1] > 0; k1++);
        if(k1 == 48)
        {
            return;
        } else
        {
            e[k1] = k;
            a[k1] = i + aa.a.a << 6;
            b[k1] = j + aa.a.b << 6;
            c[k1] = l << 6;
            d[k1] = i1 << 6;
            g = j1;
            return;
        }
    }

    public final void a(int i, int j, int k, int l, int i1, int j1, int k1)
    {
        int i3 = 0;
        for(int l1 = 0; l1 < k; l1++)
        {
            int i2;
            for(i2 = i3; i2 < 48 && e[i2] > 0; i2++);
            if(i2 == 48)
                return;
            i3 = i2 + 1;
            int j2 = (k1 >> 1) - aa.b(0, k1);
            int k2 = (k1 >> 1) - aa.b(0, k1);
            int l2 = (i1 >> 1) - aa.b(0, i1);
            e[i2] = i1 + l2;
            a[i2] = i + j2 + aa.a.a << 6;
            b[i2] = j + k2 + aa.a.b << 6;
            c[i2] = (l >> 1) - aa.b(0, l) << 6;
            d[i2] = (l >> 1) - aa.b(0, l) << 6;
            g = j1;
        }

    }
}