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

📄 v.java

📁 哈利波特与凤凰令的一个小游戏
💻 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.lcdui.Graphics;

public final class v extends z
{

    public byte a;
    public int a;
    public int b;
    public int a[];
    public int b[];
    public int c;
    public int d;
    public int e;
    public int f;
    public int g;
    public int h;
    public int i;

    public v()
    {
        super((byte)65);
        a = new int[36];
        b = new int[36];
    }

    public final void b(short word0, short word1, byte byte0)
    {
        a = byte0;
        o = word0;
        p = word1;
    }

    public final void a(int j)
    {
        switch(a)
        {
        case 1: // '\001'
        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
            d += j;
            if(d > f)
            {
                super.i = false;
                return;
            }
            for(int k = 0; k < e; k++)
                b[k] += c;

            break;
        }
    }

    public final void a(int j, int k, int l, int i1, int j1, int k1, int l1, 
            int i2)
    {
        e = j1;
        if(e > 36)
            e = 36;
        c = l;
        d = j;
        f = k;
        g = k1;
        h = l1;
        i = i2;
        short word0 = (short)(360 / e);
        short word1 = 0;
        boolean flag = false;
        for(int l2 = 0; l2 < e; l2++)
        {
            int j2 = aa.b(0, 6);
            short word2 = word1;
            int k2 = (i1 << 6) - (i1 << j2);
            if(word1 <= 90)
            {
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                b[l2] = k2 * aa.b[word2 << 1];
            } else
            if(word1 <= 180)
            {
                word2 -= 90;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                a[l2] = -a[l2];
                b[l2] = k2 * aa.b[word2 << 1];
            } else
            if(word1 <= 270)
            {
                word2 -= 180;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                a[l2] = -a[l2];
                b[l2] = k2 * aa.b[word2 << 1];
                b[l2] = -b[l2];
            } else
            {
                word2 -= 270;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                b[l2] = k2 * aa.b[word2 << 1];
                b[l2] = -b[l2];
            }
            word1 += word0;
            a[l2] >>= 16;
            b[l2] >>= 16;
        }

    }

    public final void b(int j, int k, int l, int i1, int j1, int k1, int l1, 
            int i2)
    {
        e = j1;
        if(e > 36)
            e = 36;
        c = l;
        d = j;
        f = k;
        g = k1;
        h = l1;
        i = i2;
        short word0 = (short)(120 / e);
        short word1 = 210;
        boolean flag = false;
        for(int l2 = 0; l2 < e; l2++)
        {
            int j2 = aa.b(0, 6);
            short word2 = word1;
            int k2 = (i1 << 6) - (i1 << j2);
            if(word1 <= 'Z')
            {
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                b[l2] = k2 * aa.b[word2 << 1];
            } else
            if(word1 <= '\264')
            {
                word2 -= 90;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                a[l2] = -a[l2];
                b[l2] = k2 * aa.b[word2 << 1];
            } else
            if(word1 <= '\u010E')
            {
                word2 -= 180;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                a[l2] = -a[l2];
                b[l2] = k2 * aa.b[word2 << 1];
                b[l2] = -b[l2];
            } else
            {
                word2 -= 240;
                a[l2] = k2 * aa.b[(word2 << 1) + 1];
                b[l2] = k2 * aa.b[word2 << 1];
                b[l2] = -b[l2];
            }
            word1 += word0;
            a[l2] >>= 16;
            b[l2] >>= 16;
        }

    }

    private void a(e e1, int j)
    {
        int k = aa.b(0, 12);
        a = a[j] * (d >> 6) >> 6;
        b = b[j] * (d >> 6) >> 6;
        a >>= 6;
        b >>= 6;
        a = (o + a) - e1.a;
        b = (p + b) - e1.b;
        if((a < 0 ? -a : a) > 8 || (b < 0 ? -b : b) > 8)
        {
            aa.a.setColor(i >> 7 & 0xf8, i >> 2 & 0xf8, i << 3 & 0xf8);
            aa.a(a, b);
            if(k > 3)
            {
                aa.a.setColor(h >> 7 & 0xf8, h >> 2 & 0xf8, h << 3 & 0xf8);
                aa.a(a - 1 - (k >> 2), b + 2 + (k >> 2));
                aa.a(a - 1 - (k >> 2), b + 1 + (k >> 2));
            }
            if(k > 6)
            {
                aa.a.setColor(i >> 7 & 0xf8, i >> 2 & 0xf8, i << 3 & 0xf8);
                aa.a(a + 3 + (k >> 2), b + 2 + (k >> 2));
                aa.a(a + 3 + (k >> 2), b + 3 + (k >> 2));
            }
            if(k > 9)
            {
                aa.a.setColor(i >> 7 & 0xf8, i >> 2 & 0xf8, i << 3 & 0xf8);
                aa.a(a - 3 - (k >> 2), b - 3 - (k >> 2));
                aa.a(a - 3 - (k >> 2), b - 1 - (k >> 2));
                return;
            }
        } else
        if((a < 0 ? -a : a) > 4 || (b < 0 ? -b : b) > 4)
        {
            aa.a.setColor(h >> 7 & 0xf8, h >> 2 & 0xf8, h << 3 & 0xf8);
            aa.a(a, b);
            if(k > 3)
            {
                aa.a.setColor(h >> 7 & 0xf8, h >> 2 & 0xf8, h << 3 & 0xf8);
                aa.a(a - 1, b - 2);
            }
            if(k > 6)
            {
                aa.a.setColor(g >> 7 & 0xf8, g >> 2 & 0xf8, g << 3 & 0xf8);
                aa.a(a + 3, b + 1);
            }
            if(k > 9)
            {
                aa.a.setColor(i >> 7 & 0xf8, i >> 2 & 0xf8, i << 3 & 0xf8);
                aa.a(a + 2, b - 3);
                return;
            }
        } else
        if((a < 0 ? -a : a) > 2 || (b < 0 ? -b : b) > 2)
        {
            aa.a.setColor(g >> 7 & 0xf8, g >> 2 & 0xf8, g << 3 & 0xf8);
            aa.a(a, b);
            if(k > 3)
            {
                aa.a.setColor(h >> 7 & 0xf8, h >> 2 & 0xf8, h << 3 & 0xf8);
                aa.a(a - 1, b - 1);
            }
            if(k > 6)
            {
                aa.a.setColor(g >> 7 & 0xf8, g >> 2 & 0xf8, g << 3 & 0xf8);
                aa.a(a + 1, b + 2);
            }
            if(k > 9)
            {
                aa.a.setColor(h >> 7 & 0xf8, h >> 2 & 0xf8, h << 3 & 0xf8);
                aa.a(a - 2, b + 1);
                return;
            }
        } else
        {
            aa.a.setColor(g >> 7 & 0xf8, g >> 2 & 0xf8, g << 3 & 0xf8);
            aa.a(a, b);
        }
    }

    private void c(e e1)
    {
        for(int j = 0; j < e; j++)
            a(e1, j);

    }

    public final void b(e e1)
    {
    }

    public final void a(e e1)
    {
        if(aa.k != 2)
            return;
        switch(a)
        {
        case 1: // '\001'
        case 2: // '\002'
        case 3: // '\003'
        case 4: // '\004'
            c(e1);
            break;
        }
    }
}

⌨️ 快捷键说明

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