⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 aa.java

📁 哈利波特与凤凰令的一个小游戏
💻 JAVA
📖 第 1 页 / 共 5 页
字号:
// 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 java.io.InputStream;
import java.io.PrintStream;
import java.util.Random;
import javax.microedition.lcdui.*;
import javax.microedition.lcdui.game.GameCanvas;
import javax.microedition.media.Player;
import javax.microedition.media.PlayerListener;
import javax.microedition.midlet.MIDlet;

public final class aa extends GameCanvas
    implements Runnable, PlayerListener
{

    public static final String a[] = {
        "challenge1.bin", "challenge2.bin", "challenge3.bin", "challenge4a.bin", "challenge5a.bin", "challenge6.bin", "challenge7.bin", "challenge8.bin", "challenge4b.bin", "challenge5b.bin", 
        "outro_c8.bin", "potions.bin", "duel_malfoy.bin", "duel_neville.bin", "duel_ron.bin", "duel_hermione.bin", "combat_survival.bin"
    };
    public static final byte a[] = {
        2, 2, 2, 2, 2, 0, 0, 1, 2, 2, 
        2, 4, 1, 1, 1, 1, 5
    };
    public static final byte b[] = {
        0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 
        0, 0, 0, 0, 0, 0, 1
    };
    public static int a[] = {
        0xff0000, 0xffaf00, 0x55a0ff, 0xc000ff, 0x55ff00
    };
    public static int a[][];
    public static int a;
    public static int b;
    public static boolean a = false;
    public static boolean b;
    public static boolean c = false;
    public static boolean d = false;
    public static int c = 0;
    public static boolean e = false;
    public static int d = 0;
    public static int e;
    public static boolean f = false;
    public static int f = -1;
    public static int g;
    public static int h;
    public static int i;
    public static int j;
    public static boolean g = false;
    public static int k;
    public static int l;
    public static int m;
    public static int n;
    public static int o;
    public static int p;
    public static byte c[];
    public static short a[];
    public static short a = 0;
    public static short b[];
    public static int b[];
    public static g a[];
    public static l a[][];
    public static ai a;
    public static byte a;
    public static byte b;
    public static int q;
    public static ad a[];
    public static int r;
    public static aj a[];
    public static e a;
    public static w a;
    public static Random a;
    public static int s;
    public static int t;
    public static int u;
    public static byte d[];
    public static short c[];
    public static int v;
    public static int w;
    public static byte c;
    private static byte g;
    private static byte h;
    public static int x;
    public static int y = 0;
    public static int z;
    public static int A;
    private static byte h[];
    private static l a[];
    public static short b;
    public static short d[];
    public static boolean h;
    public static int B;
    public static k a[];
    public static int C;
    public static int D;
    private static Image b;
    private static Image c;
    public static byte d;
    public static boolean i = false;
    public static ae a[];
    public static int E = 0;
    public static String a = null;
    public static boolean j = false;
    private static int ai = 0;
    public static Graphics a;
    public static Image a = null;
    public static int F = 0;
    public static long a = 0L;
    public static int G;
    public static boolean k = false;
    private static InputStream a = null;
    public static boolean l = false;
    public static int H = 0;
    public static String b = "";
    public static int I = -1;
    public static short a[][] = new short[18][15];
    public static int c[] = new int[18];
    public static int J;
    public static int K;
    public static int L;
    public static int d[] = new int[6];
    public static int e[] = new int[6];
    public static int M = -1;
    public static int N;
    public static d a;
    public static k a;
    public static s a;
    public static n a;
    public static int O;
    public static boolean m;
    public static int P;
    public static int Q;
    public static int R;
    public static int f[] = {
        447, 446, 451, 453, 450, 455, 456, 458
    };
    public static int g[] = {
        0, 1, 2, 3, 6, 9, 10, 11
    };
    public static byte e[] = {
        12, 13, 13, 15, 15, 12, 12, 12
    };
    public static final byte f[] = {
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, 64, 68, 77, -1, -1, 73, 69, 
        70, 71, 76, -1, 62, 72, 63, 78, 61, 52, 
        53, 54, 55, 56, 57, 58, 59, 60, 66, 67, 
        -1, -1, -1, 65, 74, 26, 27, 28, 29, 30, 
        31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 
        41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 
        51, -1, -1, -1, -1, -1, -1, 0, 1, 2, 
        3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 
        13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 
        23, 24, 25, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, 81, -1, -1, -1, -1, -1, -1, -1, 75, 
        -1, -1, -1, -1, 124, -1, -1, -1, 79, 80, 
        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 
        -1, 80, 103, 102, 104, -1, 105, -1, -1, -1, 
        107, 106, 108, -1, 110, 109, 111, 112, -1, 120, 
        114, 113, 115, -1, 122, -1, 0, 117, 116, 118, 
        119, -1, -1, 121, 83, 82, 84, -1, 85, -1, 
        -1, 123, 87, 86, 88, -1, 89, 90, 91, 92, 
        -1, 101, 94, 93, 95, -1, 96, -1, -1, 98, 
        97, 99, 100, -1, -1, -1
    };
    public static g a;
    public static int S;
    public static byte e;
    public static int T;
    public static int U;
    public static byte f = 0;
    public static int V;
    public static short e[];
    public static i a[][];
    public static i a = null;
    public static i a[] = new i[5];
    public static int W;
    public static int X;
    public static int Y;
    public static i b;
    public static int Z;
    public static int aa;
    public static int ab;
    public static int ac;
    public static int ad;
    public static int ae;
    public static char a;
    public static char a[] = new char[256];
    public static int af;
    public static byte g[];
    public static int ag;
    public static int ah;

    private static int a(String s1)
    {
        if(s1.compareTo("en") == 0)
            return 0;
        if(s1.compareTo("fr") == 0)
            return 1;
        if(s1.compareTo("it") == 0)
            return 2;
        if(s1.compareTo("de") == 0)
            return 3;
        return s1.compareTo("es") != 0 ? -1 : 4;
    }

    public aa(HarryMidlet harrymidlet)
    {
        super(false);
        a = getGraphics();
        o = 352;
        p = 416;
        a = -1;
        a = new Random(a());
        String s1 = System.getProperty("microedition.locale");
        String s2;
        if((s2 = HarryMidlet.a.getAppProperty("Force-Locale")) != null)
            if(s2.compareTo("menu") == 0)
                f = -5;
            else
            if(s2.startsWith("auto"))
            {
                int i1 = s2.length();
                String s4 = s2.substring(i1 - 2, i1);
                if(a(s1) == -1)
                    s1 = s4;
            } else
            if(s2.length() > 1 && a(s2) != -1)
                s1 = s2;
            else
                s2 = null;
        if(s1 == null || s1.length() < 2 || f == -5)
            s1 = "xx";
        String s3 = s1.substring(0, 2);
        if(s2 != null || f == -1)
            f = a(s3);
        if(s2 != null && f != -1)
            j = true;
        else
            j = false;
        String s5 = harrymidlet.getAppProperty("MoreGames_Impl");
        a = harrymidlet.getAppProperty("MoreGames_WAP_URI");
        if(s5 == null)
            s5 = "off";
        if((s5 = s5.toLowerCase()).equals("wap"))
            if(a == null || a.trim().length() == 0)
                s5 = "off";
            else
                s5 = "wap";
        if(s5.equals("wapstatic"))
            if(a == null || a.trim().length() == 0)
                s5 = "static";
            else
                s5 = "wap";
        if(s5.equals("wap"))
        {
            E = 2;
            return;
        }
        if(s5.equals("static"))
        {
            E = 1;
            return;
        } else
        {
            E = 0;
            return;
        }
    }

    public final void showNotify()
    {
        f = false;
    }

    public final void hideNotify()
    {
        f = true;
        i = true;
        e();
        a();
        if(k == 2)
        {
            K = -1;
            e(5);
            d(18);
            m = 2;
            a.b();
        }
    }

    private static void a(int i1, int j1, int k1, int l1)
    {
        int i2 = i1 << 8;
        for(int j2 = 0; j2 < 256; j2++)
        {
            int k2 = (j1 * j2 * 31) / 65025;
            int l2 = (k1 * j2 * 31) / 65025;
            int i3 = (l1 * j2 * 31) / 65025;
            a[i2 + j2] = (short)(k2 << 10 | l2 << 5 | i3);
        }

    }

    private static int c(int i1, int j1)
    {
        if((i1 += (i1 * 3) / 4) > j1)
            i1 = j1;
        return i1;
    }

    private static void k()
    {
        c = new byte[1024];
        for(int i1 = 0; i1 < 32; i1++)
        {
            for(int j1 = 0; j1 < 32; j1++)
            {
                int k1 = (i1 << 5) + j1;
                c[k1] = (byte)((i1 * j1) / 31);
                c[k1] = (byte)c(c[k1], 31);
            }

        }

    }

    private static void l()
    {
        i(89);
        int i1;
        for(i1 = 0; d(); i1++)
        {
            e();
            e();
            e();
            e();
        }

        a = new short[256 * i1];
        Z();
        for(int j1 = 0; d(); j1++)
        {
            e();
            e();
            short word0 = a(a);
            e();
            short word1 = a(a);
            e();
            short word2 = a(a);
            a(j1, word0, word1, word2);
        }

    }

    private static void m()
    {
        b = new int[182];
        i(90);
        for(int i1 = 0; i1 <= 90; i1++)
        {
            d();
            e();
            b[i1 << 1] = a(a);
            e();
            b[(i1 << 1) + 1] = a(a);
        }

    }

    public static int a(int i1, int j1)
    {
        int k1 = 0;
        int l1 = 0;
        if(i1 <= 90)
        {
            k1 = b[(i1 << 1) + 1];
            l1 = -(l1 = b[i1 << 1]);
        } else
        if(i1 <= 180)
        {
            i1 -= 90;
            k1 = -(k1 = b[i1 << 1]);
            l1 = -(l1 = b[(i1 << 1) + 1]);
        } else
        if(i1 <= 270)
        {
            i1 -= 180;
            k1 = -(k1 = b[(i1 << 1) + 1]);
            l1 = -(l1 = -(l1 = b[i1 << 1]));
        } else
        {
            i1 -= 270;
            k1 = b[i1 << 1];
            l1 = -(l1 = -(l1 = b[(i1 << 1) + 1]));
        }
        return j1 = a((short)(k1 >> 10), (short)(l1 >> 10));
    }

    private static void c(int i1, int j1, int k1)
    {
        a[q++] = new ad(i1, j1, k1);
    }

    public static ad a(byte byte0, byte byte1)
    {
        for(int i1 = 0; i1 < q; i1++)
        {
            ad ad1;
            if((ad1 = a[i1]).a == byte0 && ad1.b == byte1)
                return ad1;
        }

        return null;
    }

    private static void b(int i1, int j1)
    {
        a[r++] = new aj((short)i1, j1);
    }

    public static aj a(byte byte0)
    {
        for(int i1 = 0; i1 < r; i1++)
        {
            aj aj1;
            if((aj1 = a[i1]).a == byte0)
                return aj1;
        }

        return null;
    }

    private static void n()
    {
        switch(ai)
        {
        case 0: // '\0'
            a = new ai();
            a.a = new q[14][];
            a.a[0] = new q[2];
            break;

        case 1: // '\001'
            a.a[1] = new q[73];
            break;

        case 2: // '\002'
            a.a[2] = new q[550];
            break;

        case 4: // '\004'
            a.a[4] = new q[59];
            break;

        case 5: // '\005'
            a.a[5] = new q[61];
            break;

        case 6: // '\006'
            a.a[6] = new q[2];
            break;

        case 7: // '\007'
            a.a[7] = new q[150];
            break;

        case 8: // '\b'
            a.a[8] = new q[8];
            break;

        case 9: // '\t'
            a.a[9] = new q[3];
            break;

        case 10: // '\n'
            a.a[10] = new q[13];
            break;

        case 11: // '\013'
            a.a[11] = new q[3];
            break;

        case 12: // '\f'
            a.a[12] = new q[1];
            break;

        case 13: // '\r'
            a.a[13] = new q[4];
            break;
        }
        if(a.a[ai] != null)
        {
            for(int i1 = 0; i1 < a.a[ai].length; i1++)
                switch(ai)
                {
                case 0: // '\0'
                    a.a[ai][i1] = new o();
                    break;

                case 2: // '\002'
                    a.a[ai][i1] = new x();
                    break;

                case 4: // '\004'
                    a.a[ai][i1] = new ah();
                    break;

                case 5: // '\005'
                    a.a[ai][i1] = new a();
                    break;

                case 6: // '\006'
                    a.a[ai][i1] = new n();
                    break;

                case 1: // '\001'
                    a.a[ai][i1] = new h();
                    break;

                case 8: // '\b'
                    a.a[ai][i1] = new c();
                    break;

                case 9: // '\t'
                    a.a[ai][i1] = new ab();
                    break;

                case 10: // '\n'
                    a.a[ai][i1] = new y();
                    break;

                case 11: // '\013'
                    a.a[ai][i1] = new j();
                    break;

                case 12: // '\f'
                    a.a[ai][i1] = new r();
                    break;

                case 13: // '\r'
                    a.a[ai][i1] = new b();
                    break;

                case 7: // '\007'
                    a.a[ai][i1] = new af();
                    break;
                }

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -