w.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 

import javax.microedition.rms.RecordEnumeration;
import javax.microedition.rms.RecordStore;

public final class w
{

    public static int a;
    public static byte a[];
    public static byte b[] = new byte[4096];
    private static byte j[] = new byte[4096];
    public static boolean a;
    public static boolean b;
    public static boolean c;
    public static short a = -1;
    public static int b;
    public static int c;
    public static byte a;
    public static int d;
    public static byte b;
    public static byte c;
    public static boolean d;
    public static boolean e;
    public static boolean f;
    public static boolean g;
    public static byte c[];
    private static byte k[];
    public static byte d[];
    public static byte e[];
    public static byte f[] = new byte[8];
    public static short a[];
    public static short b[];
    public static int a[];
    public static boolean a[];
    public static short c[];
    public static byte g[];
    public static boolean b[] = new boolean[3];
    public static int b[];
    public static byte d;
    public static boolean h;
    public static byte h[];
    public static byte i[];
    public static int c[];
    private static h a;

    public w()
    {
    }

    public static void a()
    {
        h = false;
        h = new byte[20];
        i = new byte[20];
        c = new int[8];
        b = new int[10];
        e = new byte[3];
        c = new byte[61];
        k = new byte[61];
        d = new byte[59];
        a = new short[73];
        b = new short[73];
        a = new int[73];
        a = new boolean[73];
        c = new short[73];
        g = new byte[73];
        a = new byte[4096];
        b = 0;
        c = 0;
        a = 0;
        b = 0;
        c = 0;
        d = false;
        e = true;
        for(int i1 = 0; i1 < 10; i1++)
            b[i1] = 0;

        a = true;
        c = true;
        b = true;
        d = 1;
        for(int j1 = 0; j1 < 20; j1++)
        {
            h[j1] = 0;
            i[j1] = 0;
        }

        h();
        a = 0;
    }

    private static void h()
    {
        for(int i1 = 0; i1 < 8; i1++)
            c[i1] = 0;

    }

    public static void b()
    {
        if(aa.k == 11 || aa.k == 13 || aa.k == 10 || aa.k == 12 || aa.k == 9)
        {
            a = b;
            k();
        }
        o o1 = aa.a.a;
        a = aa.a;
        b = o1.a;
        c = o1.b;
        a = ((q) (o1)).a_;
        d = ((z) (o1)).E;
        b = o1.f;
        c = o1.g;
        d = o1.g;
        e = o1.h;
        f = o1.b;
        g = o1.c;
        a(c, 5);
        a(k);
        a(d, 4);
        a(e, 11);
        a(f, 8);
        q aq[] = aa.a.a[1];
        for(int i1 = 0; i1 < aa.a.c[1]; i1++)
        {
            a[i1] = aq[i1].o;
            b[i1] = aq[i1].p;
            a[i1] = ((z)aq[i1]).E;
            a[i1] = ((h)aq[i1]).b;
            c[i1] = ((h)aq[i1]).a;
        }

        if(aa.k == 9 || aa.k == 11 || aa.k == 12 || aa.k == 13)
            c(g);
        else
            d(g);
        i();
        for(int j1 = 0; j1 < 10; j1++)
            b[j1] = aa.a.b[j1];

        if(aa.k == 11 || aa.k == 13 || aa.k == 10 || aa.k == 12 || aa.k == 9)
        {
            a = j;
            k();
            a = b;
            l();
        }
        e();
    }

    public static void c()
    {
        if(h)
        {
            h = false;
            a = j;
            l();
            a = b;
        }
        if(a == aa.a)
        {
            o o1;
            (o1 = aa.a.a).a = b;
            o1.b = c;
            o1.a_ = a;
            o1.o = (short)(o1.a >> 6);
            o1.p = (short)(o1.b >> 6);
            o1.E = d;
            o1.f = b;
            o1.g = c;
            o1.g = d;
            o1.h = e;
            o1.b = f;
            o1.c = g;
            b(c, 5);
            b(k);
            b(d, 4);
            b(e, 11);
            b(f, 8);
            q aq[] = (q[])aa.a.a[4];
            for(int i1 = 0; i1 < aa.a.c[4]; i1++)
            {
                ah ah1;
                if((ah1 = (ah)aq[i1]).a == 3)
                    ah1.j = 0;
            }

            q aq1[] = aa.a.a[1];
            for(int j1 = 0; j1 < aa.a.c[1]; j1++)
            {
                aq1[j1].o = a[j1];
                aq1[j1].p = b[j1];
                ((z)aq1[j1]).E = a[j1];
                ((h)aq1[j1]).b = a[j1];
                ((h)aq1[j1]).a = c[j1];
            }

            b(g, 1);
            j();
        }
    }

    public static void d()
    {
        if(a == aa.a)
        {
            for(int i1 = 0; i1 < 10; i1++)
                aa.a.b[i1] = b[i1];

        }
    }

    private static void a(byte abyte0[], int i1)
    {
        short word0 = aa.a.c[i1];
        q aq[] = aa.a.a[i1];
        for(int j1 = 0; j1 < word0; j1++)
            abyte0[j1] = aq[j1].j;

    }

    private static void a(byte abyte0[])
    {
        short word0 = aa.a.c[5];
        q aq[] = aa.a.a[5];
        for(int i1 = 0; i1 < word0; i1++)
            abyte0[i1] = ((a)aq[i1]).d;

    }

    private static void b(byte abyte0[])
    {
        short word0 = aa.a.c[5];
        q aq[] = aa.a.a[5];
        for(int i1 = 0; i1 < word0; i1++)
            ((a)aq[i1]).d = abyte0[i1];

    }

    private static void c(byte abyte0[])
    {
        short word0 = aa.a.c[1];
        q aq[] = aa.a.a[1];
        for(int i1 = 0; i1 < word0; i1++)
        {
            h h1 = (h)aq[i1];
            abyte0[i1] = ((q) (h1)).j;
            if(h1.b == aa.a.a)
                a = h1;
        }

    }

    private static void d(byte abyte0[])
    {
        short word0 = aa.a.c[1];
        q aq[] = aa.a.a[1];
        for(int i1 = 0; i1 < word0; i1++)
        {
            h h1;
            switch(((q) (h1 = (h)aq[i1])).j)
            {
            case 5: // '\005'
            case 7: // '\007'
            case 8: // '\b'
            case 9: // '\t'
            case 11: // '\013'
            case 12: // '\f'
            case 15: // '\017'
            case 16: // '\020'
            case 19: // '\023'
                if(h1.a != null && h1.a == null)
                    abyte0[i1] = 6;
                else
                    abyte0[i1] = 2;
                break;

            case 10: // '\n'
                abyte0[i1] = 1;
                break;

            case 6: // '\006'
            case 13: // '\r'
            case 14: // '\016'
            case 17: // '\021'
            case 18: // '\022'
            default:
                abyte0[i1] = ((q) (h1)).j;
                break;
            }
        }

    }

    private static void b(byte abyte0[], int i1)
    {
        short word0 = aa.a.c[i1];
        q aq[] = aa.a.a[i1];
        for(int j1 = 0; j1 < word0; j1++)
        {
            aq[j1].j = abyte0[j1];
            if(aq[j1] == a)
                ((h)aq[j1]).b = aa.a.a;
        }

    }

    private static void i()
    {
        short word0 = aa.a.c[9];
        q aq[] = aa.a.a[9];
        for(int i1 = 0; i1 < word0; i1++)
            b[i1] = ((ab)aq[i1]).a;

    }

    private static void j()
    {
        short word0 = aa.a.c[9];
        q aq[] = aa.a.a[9];
        for(int i1 = 0; i1 < word0; i1++)
        {
            ((ab)aq[i1]).a = b[i1];
            if(((ab)aq[i1]).a)
                ((ab)aq[i1]).f();
        }

    }

    private static void a(byte byte0)
    {
        a[a++] = byte0;
    }

    private static void a(boolean flag)
    {
        a((byte)(flag ? 1 : 0));
    }

    private static void a(short word0)
    {
        a((byte)(word0 & 0xff));
        a((byte)(word0 >> 8 & 0xff));
    }

    private static void a(int i1)
    {
        a((byte)(i1 & 0xff));
        a((byte)(i1 >> 8 & 0xff));
        a((byte)(i1 >> 16 & 0xff));
        a((byte)(i1 >> 24 & 0xff));
    }

    private static void c(byte abyte0[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
        {
            byte byte0;
            a(byte0 = abyte0[j1]);
        }

    }

    private static void a(boolean aflag[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
        {
            byte byte0;
            a(byte0 = (byte)(aflag[j1] ? 1 : 0));
        }

    }

    private static void a(short aword0[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
        {
            short word0;
            a((byte)((word0 = aword0[j1]) & 0xff));
            a((byte)(word0 >> 8));
        }

    }

    private static void a(int ai1[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
        {
            int k1;
            a(k1 = ai1[j1]);
        }

    }

    private static byte a()
    {
        return a[a++];
    }

    private static boolean b()
    {
        return a() == 1;
    }

    private static short a()
    {
        int i1 = a() & 0xff;
        int j1;
        short word0;
        return word0 = (short)((j1 = a() & 0xff) << 8 | i1);
    }

    private static int a()
    {
        int i1 = a() & 0xff;
        int j1 = a() & 0xff;
        int k1 = a() & 0xff;
        int l1;
        int i2;
        return i2 = (l1 = a() & 0xff) << 24 | k1 << 16 | j1 << 8 | i1;
    }

    private static void d(byte abyte0[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
            abyte0[j1] = a();

    }

    private static void b(boolean aflag[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
            aflag[j1] = a() == 1;

    }

    private static void b(int ai1[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
            ai1[j1] = a();

    }

    private static void b(short aword0[], int i1)
    {
        for(int j1 = 0; j1 < i1; j1++)
        {
            int k1 = a() & 0xff;
            int l1 = a() & 0xff;
            aword0[j1] = (short)(l1 << 8 | k1);
        }

    }

    private static void k()
    {
        a = 0;
        a(aa.f);
        a(a);
        a(b);
        a(c);
        a(d);
        c(i, 20);
        c(h, 20);
        a(c, 8);
        a(a);
        a(b);
        a(c);
        a(a);
        a(d);
        a(b);
        a(c);
        a(d);
        a(e);
        a(f);
        a(g);
        c(c, 61);
        c(d, 59);
        c(f, 8);
        a(a, 73);
        a(b, 73);
        a(a, 73);
        a(a, 73);
        c(g, 73);
        a(b, 3);
        a(b, 10);
    }

    public static void e()
    {
        k();
        try
        {
            RecordStore recordstore;
            RecordEnumeration recordenumeration;
            if((recordenumeration = (recordstore = RecordStore.openRecordStore("hpdata", true)).enumerateRecords(null, null, false)).hasNextElement())
            {
                int i1 = recordenumeration.nextRecordId();
                recordstore.setRecord(i1, a, 0, a.length);
            } else
            {
                recordstore.addRecord(a, 0, a.length);
            }
            recordenumeration.destroy();
            recordstore.closeRecordStore();
            return;
        }
        catch(Exception _ex)
        {
            return;
        }
    }

    private static void l()
    {
        a = 0;
        int i1 = a();
        if(!aa.j)
            aa.f = i1;
        a = b();
        b = b();
        c = b();
        d = a();
        d(i, 20);
        d(h, 20);
        b(c, 8);
        a = a();
        b = a();
        c = a();
        a = a();
        d = a();
        b = a();
        c = a();
        d = b();
        e = b();
        f = b();
        g = b();
        d(c, 61);
        d(d, 59);
        d(f, 8);
        b(a, 73);
        b(b, 73);
        b(a, 73);
        b(a, 73);
        d(g, 73);
        b(b, 3);
        b(b, 10);
    }

    public static void f()
    {
        boolean flag = true;
        RecordStore recordstore;
        RecordEnumeration recordenumeration;
        try
        {
            if((recordenumeration = (recordstore = RecordStore.openRecordStore("hpdata", true)).enumerateRecords(null, null, false)).hasNextElement())
            {
                int i1 = recordenumeration.nextRecordId();
                a = recordstore.getRecord(i1);
                recordenumeration.destroy();
                recordstore.closeRecordStore();
            } else
            {
                flag = false;
            }
        }
        catch(Exception _ex)
        {
            flag = false;
        }
        if(!flag)
        {
            return;
        } else
        {
            l();
            return;
        }
    }

    public static void g()
    {
        a = -1;
    }

    public static boolean a()
    {
        for(int i1 = 0; i1 < 8; i1++)
            if(c[i1] > 0)
                return true;

        return false;
    }

    public static int a(int i1)
    {
        for(int j1 = 0; j1 < aa.g.length; j1++)
            if(i1 == aa.g[j1])
                return j1;

        return 0;
    }

    public static int b(int i1)
    {
        for(int j1 = 1; i1 + j1 < aa.g.length; j1++)
            if(h[aa.g[i1 + j1]] == 1)
                return i1 + j1;

        return -1;
    }

    public static int c(int i1)
    {
        for(int j1 = -1; i1 + j1 >= 0; j1--)
            if(h[aa.g[i1 + j1]] == 1)
                return i1 + j1;

        return -1;
    }

}