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

    public byte a;
    public byte c;

    public c()
    {
        super((byte)8);
    }

    public final void a(short word0, short word1, byte byte0)
    {
        super.a(word0, word1, byte0);
        a = aa.a();
        c = aa.a();
        super.a = aa.a((byte)8, a);
    }

    private static String a(String s1, char c1)
    {
        int i = s1.length();
        for(int j = 0; j < i; j++)
        {
            char c2 = s1.charAt(j);
            if('0' <= c2 && c2 <= '9')
            {
                String s2 = "";
                if(j != 0)
                    s2 = s2 + s1.substring(0, j);
                s2 = s2 + c1;
                if(j != i - 1)
                    s2 = s2 + s1.substring(j + 1, i);
                return s2;
            }
        }

        return s1;
    }

    public final void a(int i)
    {
        o o1 = aa.a.a;
        boolean flag = false;
        t t1;
        (t1 = new t()).a = (short)(((q) (o1)).o + ((z) (o1)).a.a);
        t1.c = (short)(((q) (o1)).o + ((z) (o1)).a.c);
        t1.b = (short)(((q) (o1)).p + ((z) (o1)).a.b);
        t1.d = (short)(((q) (o1)).p + ((z) (o1)).a.d);
        if(t1.a(super.o + super.a.a, p + super.a.b, super.o + super.a.c, p + super.a.d))
            flag = true;
        switch(a)
        {
        default:
            break;

        case 0: // '\0'
            if(flag && j == 0 && ((z) (o1)).E < ((z) (o1)).a.k)
            {
                j = 1;
                o1.j = 27;
                o1.E += c;
                if(((z) (o1)).E > ((z) (o1)).a.k)
                    o1.E = ((z) (o1)).a.k;
            }
            a(0, i);
            if(j == 0 && a(aa.a.a))
            {
                short word0 = (short)(super.o - 4);
                short word1 = (short)(p - 12 - -12);
                aa.a.a.e = word0 - 2;
                aa.a.a.f = word1 + -12;
                aa.a.a.b(i);
                return;
            }
            break;

        case 1: // '\001'
            if(flag && j == 0)
            {
                j = 1;
                if(c == 1)
                {
                    aa.a(1000, 428, 6, 5, -1);
                } else
                {
                    String s1;
                    s1 = a(s1 = aa.a(429), (char)(48 + c));
                    aa.a(429, s1);
                    aa.a(1000, 429, 6, 5, -1);
                }
                o1.j = 27;
                o1.f += c;
                if(((z) (o1)).E > ((z) (o1)).a.k)
                    o1.E = ((z) (o1)).a.k;
            }
            a(super.a.a, i);
            break;
        }
    }

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

    public final void a()
    {
        j = 0;
    }
}