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

    public short a;
    public short a[];
    public short b;
    public short c;
    public short d;
    public short e;
    public short b[];
    public short c[];
    public short d[];
    public boolean a;
    public byte a;

    public ae()
    {
        a = new short[16];
        b = new short[16];
        c = new short[16];
        d = new short[16];
    }

    public final void a()
    {
        aa.i(52 + a);
        aa.d();
        aa.e();
        aa.e();
        a = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        b = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        c = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.e();
        d = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.d();
        aa.e();
        for(int i = 0; i < a; i++)
        {
            aa.d();
            aa.e();
            a[i] = aa.a(aa.a);
        }

        aa.d();
        aa.e();
        aa.d();
        aa.e();
        aa.e();
        a = aa.a(aa.a) == 1;
        aa.d();
        aa.e();
        aa.e();
        e = aa.a(aa.a);
        aa.d();
        aa.e();
        aa.d();
        aa.e();
        for(int j = 0; j < e; j++)
        {
            aa.d();
            aa.e();
            b[j] = aa.a(aa.a);
            aa.e();
            c[j] = aa.a(aa.a);
        }

    }

    private int a(short aword0[], short aword1[], short aword2[])
    {
        int k = 0;
        for(int i = 0; i < e; i++)
            if(aword2[i] < aword1[i])
                k += aword0[i];

        int l = aa.b(0, k - 1);
        int i1 = 0;
        int j;
        for(j = 0; j < e; j++)
        {
            if(aword2[j] >= aword1[j])
                continue;
            short word0 = aword0[j];
            if(l >= i1 && l < i1 + word0)
                break;
            i1 += word0;
        }

        if(j == e)
            j = 0;
        aword2[j]++;
        return j;
    }

    private void a(int i, short word0, short word1, int j, int k)
    {
        u u1 = (u)ai.a(66);
        int l = aa.b(j, k);
        int i1 = 0;
        i1 = aa.a(l, 0);
        if((l & 0x1) != 0)
        {
            u1.a(word0, word1, aa.a(i1), aa.b(i1), a[i], aa.a.a.a);
            return;
        } else
        {
            u1.a(word0, word1, aa.a(i1), aa.b(i1), a[i], aa.a.a.a.f);
            return;
        }
    }

    public final void a(short word0, short word1)
    {
        for(int i = 0; i < e; i++)
            d[i] = 0;

        int k = 360 / e;
        for(int j = 0; j < a; j++)
        {
            int l = j % e;
            if(a)
                l = a(b, c, d);
            int i1 = l * k;
            a(j, word0, word1, i1, i1 + k);
        }

    }
}