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

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

    public af()
    {
        super((byte)7);
        a = 0;
        a = null;
    }

    public final void b()
    {
        super.a((short)0, (short)0, (byte)0);
        a = aa.a();
        a = aa.a();
        a = aa.a();
        a = new int[a];
        for(int i = 0; i < a; i++)
        {
            short word0 = aa.a();
            short word2 = aa.a();
            a[i] = aa.a(word0, word2);
        }

        if(a == 0)
            return;
        a = aa.a(a[0]);
        b = aa.b(a[0]);
        c = aa.a(a[0]);
        d = aa.b(a[0]);
        for(int j = 0; j < a; j++)
        {
            short word1 = aa.a(a[j]);
            short word3 = aa.b(a[j]);
            if(a > word1)
                a = word1;
            if(c < word1)
                c = word1;
            if(b > word3)
                b = word3;
            if(d < word3)
                d = word3;
        }

    }

    public final void a(int i, int j, int k, int l)
    {
        for(int i1 = 0; i1 < a - 1; i1++)
            a(i, k, j, l, aa.a(a[i1]), aa.b(a[i1]), aa.a(a[i1 + 1]), aa.b(a[i1 + 1]));

        if(a)
            a(i, k, j, l, aa.a(a[a - 1]), aa.b(a[a - 1]), aa.a(a[0]), aa.b(a[0]));
    }

    private static void a(int i, int j, int k, int l, short word0, short word1, short word2, short word3)
    {
        int ai1[] = ai.a;
        short word4 = aa.a.c;
        short word5 = word0;
        short word6 = word1;
        short word7 = word2;
        short word8 = word3;
        if(word5 > word7)
        {
            short word9 = word5;
            word5 = word7;
            word7 = word9;
        }
        if(word6 > word8)
        {
            short word10 = word6;
            word6 = word8;
            word8 = word10;
        }
        if(word7 < i || word5 > j || word8 < k || word6 > l)
            return;
        if(word4 >= 399)
        {
            return;
        } else
        {
            ai1[word4] = aa.a(word0, word1);
            ai1[word4 + 1] = aa.a(word2, word3);
            word4 += 2;
            aa.a.c = word4;
            return;
        }
    }
}