h.java

魂斗罗游戏的原码(j2me) 是学习j2me很好的方法

// 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 

package mdigi;

import javax.microedition.lcdui.Graphics;
import javax.microedition.lcdui.Image;

// Referenced classes of package mdigi:
//            i, a, f

public class h extends i
{

    a b;
    public Image k;
    public boolean h;
    public int s;
    public int w;
    private int r;
    public int g[][] = {
        {
            0, 0, 22, 14
        }, {
            22, 0, 24, 14
        }, {
            0, 14, 22, 17
        }, {
            22, 14, 17, 17
        }, {
            39, 14, 21, 17
        }, {
            60, 14, 22, 17
        }, {
            82, 0, 19, 25
        }, {
            82, 25, 19, 23
        }, {
            82, 48, 19, 18
        }, {
            48, 0, 36, 14
        }, {
            42, 31, 16, 17
        }, {
            58, 31, 15, 19
        }, {
            38, 48, 17, 18
        }, {
            55, 49, 15, 17
        }, {
            0, 31, 19, 23
        }, {
            19, 31, 23, 23
        }, {
            0, 54, 38, 12
        }
    };

    public h(a a1)
    {
        super(a1);
        h = false;
        s = 1;
        w = 2;
        r = 0;
        b = a1;
    }

    public void k()
    {
        s();
        h = true;
        f(10);
        a(28);
        g(16);
        d(4);
    }

    public void a(Graphics g1)
    {
        byte byte0 = 0;
        byte0 = o() != 7 ? o() != 9 ? 0 : 18 : 12;
        b.a(g1, b.w, d(), (f() - g[o()][3]) + byte0 + 3, g[o()][0], g[o()][1] + m() * 66, g[o()][2], g[o()][3], 20);
        if(h || x || j && b.b(this))
            return;
        if(!e && (o() == 0 || A || l || a || q || p || F || n))
            b.a(g1, b.w, d() + (m() != 0 ? 5 : -5), f() + 3, g[w + g()][0], g[w + g()][1] + m() * 66, g[w + g()][2], g[w + g()][3], 20);
        if(I)
            g1.drawImage(k, d() - 5, (f() - g[o()][3]) + byte0, 20);
    }

    protected boolean u()
    {
        if(x)
            return true;
        if(I)
            return false;
        int j = f();
        int l = 0;
        if(this.j)
        {
            j = (j - g[o()][3]) + 18;
            l = g[o()][3];
        } else
        if(F || n)
        {
            j = (j - g[o()][3]) + 12;
            l = 20;
        } else
        if(e)
        {
            j -= g[o()][3];
            l = g[o()][3];
        } else
        {
            j -= g[o()][3];
            l = g[o()][3] + 17;
        }
        for(int i1 = 0; i1 < b.u.length; i1++)
            if(b.u[i1].i && (!h || !x) && b.u[i1].h + 6 > d() + 3 + (this.j ? -5 : 0) && b.u[i1].h < ((d() + h()) - 3) + (this.j ? 10 : 0) && (b.u[i1].f > j && b.u[i1].f + 6 < j + l))
            {
                a = false;
                b.u[i1].i = false;
                return true;
            }

        return false;
    }

    public void v()
    {
        i(g[o()][2]);
        e(g[o()][3]);
        if(f() >= 178)
        {
            k();
            b.v--;
            s = 1;
            return;
        }
        if(h)
        {
            q();
            f(g() < 3 ? o() + g() : 10);
            b();
            b();
            b();
            if(a)
                a(d() + j());
            if(l && d() > 0)
                a(d() - j());
            if(b.b(this))
            {
                f(0);
                I = true;
                k = b.a("bp");
                h = false;
            }
            return;
        }
        if(I)
        {
            B++;
            if(B >= 30)
            {
                B = 0;
                I = false;
                k = null;
            }
        }
        if(!x)
            break MISSING_BLOCK_LABEL_456;
        a = false;
        if(r > 2)
            break MISSING_BLOCK_LABEL_371;
        r++;
        if(f() <= 4)
            return;
        int j = 0;
          goto _L1
_L3:
        j(-2);
        if(d() <= 0 || m() == 1 && d() + h() > 80)
            return;
        if(m() <= 0)
            a(d() - j());
        else
            a(d() + j());
        j++;
_L1:
        if(j < 3) goto _L3; else goto _L2
_L2:
        break MISSING_BLOCK_LABEL_455;
        f(16);
        b();
        b();
        b();
        b();
        if(b.b(this))
        {
            r++;
            if(r >= 16)
            {
                k();
                f(10);
                b.v--;
                s = 1;
            }
        }
        return;
        if(u())
        {
            a();
            return;
        }
        if(b.j)
            return;
        if(b.m)
        {
            b.o++;
            if(b.o > 3)
            {
                b.o = 0;
                b.f();
            }
        }
        if(this.j && b.b(this))
        {
            f(9);
            if(e)
            {
                g(f() + 4);
                e = false;
                this.j = false;
            }
            return;
        }
        if(!e) goto _L5; else goto _L4
_L4:
        f(g() < 3 ? o() + g() : 10);
        if(r > 8) goto _L7; else goto _L6
_L6:
        r++;
        if(f() <= 4)
            return;
        j(-2);
        j(-2);
          goto _L5
_L7:
        j = 0;
          goto _L8
_L9:
        if(b.b(this))
        {
            r = 0;
            e = false;
            return;
        }
        j(2);
        j++;
_L8:
        if(j < 3) goto _L9; else goto _L5
_L5:
        if(!a)
            break MISSING_BLOCK_LABEL_732;
        l();
        if(e)
            return;
        d = 4;
        f(0);
        break MISSING_BLOCK_LABEL_943;
        if(!l)
            break MISSING_BLOCK_LABEL_765;
        n();
        if(e)
            return;
        d = 4;
        f(0);
        break MISSING_BLOCK_LABEL_943;
        if(!A)
            break MISSING_BLOCK_LABEL_803;
        if(e)
        {
            q();
            return;
        }
        f(6);
        u = 0;
        w = 2;
        break MISSING_BLOCK_LABEL_943;
        if(!q)
            break MISSING_BLOCK_LABEL_837;
        c();
        if(e)
            return;
        f(8);
        d = 4;
        break MISSING_BLOCK_LABEL_943;
        if(!F)
            break MISSING_BLOCK_LABEL_871;
        e();
        if(e)
            return;
        f(7);
        d = 4;
        break MISSING_BLOCK_LABEL_943;
        if(!p)
            break MISSING_BLOCK_LABEL_905;
        w();
        if(e)
            return;
        f(8);
        d = 4;
        break MISSING_BLOCK_LABEL_943;
        if(!n)
            break MISSING_BLOCK_LABEL_939;
        p();
        if(e)
            return;
        f(7);
        d = 4;
        break MISSING_BLOCK_LABEL_943;
        t();
        if(!e && !b.b(this))
        {
            b();
            b();
        }
        break MISSING_BLOCK_LABEL_1034;
        Exception exception;
        exception;
        q();
        a(d() + 2);
        if(f() >= 180 || d() >= 180)
        {
            k();
            b.v--;
            s = 1;
        }
    }

    public void t()
    {
        if(e)
        {
            q();
            return;
        } else
        {
            f(0);
            u = 0;
            w = 2;
            return;
        }
    }

    protected boolean c()
    {
        h(1);
        q();
        if(b.c(this))
            return false;
        if(d() <= 0)
        {
            return false;
        } else
        {
            a(d() - j());
            return true;
        }
    }

    protected boolean e()
    {
        h(1);
        q();
        if(b.c(this))
            return false;
        if(d() <= 0)
        {
            return false;
        } else
        {
            a(d() - j());
            return true;
        }
    }

    protected boolean w()
    {
        h(0);
        q();
        if(b.c(this))
            return false;
        if(!b.c() && d() >= 80 || d() + h() >= 175)
        {
            return false;
        } else
        {
            a(d() + j());
            return true;
        }
    }

    protected boolean p()
    {
        h(0);
        q();
        if(b.c(this))
            return false;
        if(!b.c() && d() >= 80 || d() + h() >= 175)
        {
            return false;
        } else
        {
            a(d() + j());
            return true;
        }
    }

    public void a()
    {
        x = true;
        f(14);
        e = false;
        a = false;
        r = 0;
    }

    public void s()
    {
        f(0);
        h(0);
        x = false;
        i = true;
        u = 0;
        d = 4;
        j = false;
        e = false;
        a = false;
        A = false;
        l = false;
        F = false;
        q = false;
        n = false;
        p = false;
        r = 0;
        w = 2;
        B = 0;
        I = false;
    }
}