b.java

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

            f(6);
            if(d() + h() <= -6 || f() >= 186)
                i = false;
            break;

        case 4: // '\004'
            h(0);
            f(18);
            if(b.j)
                return;
            if(!H && d() < 160)
                H = true;
            if(H && i() % 50 > 45)
            {
                f(19);
                int l1 = b.t.d();
                int j2 = b.t.f();
                if(d() > l1 - 10 && d() < l1 + 35)
                {
                    byte0 = 0;
                    if(f() >= j2)
                        byte1 = -5;
                    else
                        byte1 = 5;
                } else
                if(f() > j2 - 35 && f() < j2 + 5)
                {
                    byte1 = 0;
                    if(d() >= l1)
                        byte0 = -5;
                    else
                        byte0 = 5;
                } else
                if(d() >= l1 + 35)
                {
                    if(f() > j2)
                    {
                        int l2 = Math.abs(l1 - d());
                        int i4 = Math.abs(j2 - f());
                        if(l2 == i4 || l2 > i4 - 2 && l2 < i4 + 2)
                        {
                            byte0 = -5;
                            byte1 = -5;
                        } else
                        if(l2 > i4 + 2)
                        {
                            byte0 = -5;
                            byte1 = -3;
                        } else
                        if(l2 < i4 - 2)
                        {
                            byte0 = -3;
                            byte1 = -5;
                        }
                    } else
                    if(f() <= j2)
                    {
                        int i3 = Math.abs(l1 - d());
                        int j4 = Math.abs(j2 - f());
                        if(i3 == j4 || i3 > j4 - 2 && i3 < j4 + 2)
                        {
                            byte0 = -5;
                            byte1 = 5;
                        } else
                        if(i3 > j4 + 2)
                        {
                            byte0 = -5;
                            byte1 = 3;
                        } else
                        if(i3 < j4 - 2)
                        {
                            byte0 = -3;
                            byte1 = 5;
                        }
                    }
                } else
                if(d() <= l1 - 5)
                {
                    if(f() > j2)
                    {
                        int j3 = Math.abs(l1 - d());
                        int k4 = Math.abs(j2 - f());
                        if(j3 == k4 || j3 > k4 - 2 && j3 < k4 + 2)
                        {
                            byte0 = 5;
                            byte1 = -5;
                        } else
                        if(j3 > k4 + 2)
                        {
                            byte0 = 5;
                            byte1 = -3;
                        } else
                        if(j3 < k4 - 2)
                        {
                            byte0 = 3;
                            byte1 = -5;
                        }
                    } else
                    if(f() <= j2)
                    {
                        int k3 = Math.abs(l1 - d());
                        int l4 = Math.abs(j2 - f());
                        if(k3 == l4 || k3 > l4 - 2 && k3 < l4 + 2)
                        {
                            byte0 = 5;
                            byte1 = 5;
                        } else
                        if(k3 > l4 + 2)
                        {
                            byte0 = 5;
                            byte1 = 3;
                        } else
                        if(k3 < l4 - 2)
                        {
                            byte0 = 3;
                            byte1 = 5;
                        }
                    }
                } else
                {
                    byte1 = 5;
                }
                b.a(d() + 5, f() + 8, byte0, byte1, 5, 0);
            }
            if(d() + h() <= -6 || f() >= 186)
                i = false;
            break;

        case 5: // '\005'
            if(b.j)
                return;
            k = k != 0 ? 0 : 1;
            if(m() == 0)
            {
                if(d() >= 84 && d() <= 90 && i() % 50 > 15)
                    b.a(d() + 6, f() - 20, -8, 1, 2, 1);
                a(d() - 1);
                if(d() <= 80)
                    h(1);
            } else
            if(m() == 1)
            {
                w++;
                if(d() >= 100 && w == 5)
                    b.a(d() + 6, f() + 20, -6, 0, 2, 0);
                if(w >= 10)
                    w = 0;
                a(d() + 1);
                if(d() >= 170)
                    h(0);
            }
            if(d() >= 124 && d() <= 140 && i() % 50 > 15)
                b.a(d() + 6, f() - 20, -8, 1, 2, 1);
            if(!b.t.x && b.t.d() > d() - 5 && b.t.d() < d() + h.getWidth())
                b.t.a();
            b.a(g1, h, d() - 6, f() + k, 0, 0, 95, 43, 20);
            b.a(g1, b.f, d() + 10, (f() + k) - 19, 23, 88, 21, 21, 20);
            if(D <= 2)
            {
                b.F = b.a("loe");
                b.t.s();
                b.B = 4;
                return;
            }
            if(b.t.d() >= 100)
                b.t.a(100);
            if(k == 0)
                b.a(g1, h, d() - 7, f() + k + 33, 0, 43, 95, 10, 20);
            break;

        case 6: // '\006'
            if(b.j)
                return;
            w++;
            if(w >= 4)
                w = 0;
            if(m() == 0)
            {
                a(d() - 3);
                if(d() <= 10)
                    h(1);
            } else
            if(m() == 1)
            {
                a(d() + 3);
                if(d() >= 160)
                    h(0);
            }
            int i5 = i() % 50;
            if(i5 > 44)
                if(i5 % 2 == 1)
                {
                    for(int j5 = 0; j5 < 5; j5++)
                    {
                        int l5 = j5 % 2 != 0 ? -(j5 + 1) / 2 : (j5 + 1) / 2;
                        b.a(d() + 2, f() + 5, l5 * 3, 6, 4, 0);
                    }

                } else
                {
                    for(int k5 = 0; k5 < 6; k5++)
                        b.a(d() + 2, f() + 5, -5, i() % 2 != 0 ? 1 : -1, 5, 1);

                }
            if(D <= 1)
            {
                b.F = b.a("loe");
                b.t.s();
                b.B = 4;
                return;
            }
            if(b.t.d() >= 160)
                b.t.a(160);
            b.a(g1, h, d() + 2, f() + 5, w * 17, 0, 17, 17, 20);
            break;

        case 8: // '\b'
            if(!b.i)
                return;
            w++;
            if(w == 5)
            {
                q();
                b.a(d() - 2, f() + 8, -8, 1, 3, 1);
            }
            if(w >= 10)
                w = 0;
            break;

        case 9: // '\t'
            g1.drawImage(h, d() - 40, f() - 34, 20);
            if(b.t.d() >= 98)
                b.t.a(98);
            if(D <= 1)
            {
                b.F = b.a("loe");
                b.t.s();
                b.B = 4;
                return;
            }
            break;
        }
        if(d(g1))
        {
            a();
            return;
        } else
        {
            return;
        }
    }

    public boolean e()
    {
        return d() + h() < 0 || d() > 176;
    }

    protected boolean d(Graphics g1)
    {
        for(int j = 0; j < b.y.length; j++)
            if(b.y[j].i && !x && b.y[j].h + 3 > d() && b.y[j].h + 3 < d() + h() && b.y[j].f + 3 > (f() - r()) + 15 && b.y[j].f + 3 < f() + 15)
            {
                b.y[j].i = false;
                b.a(g1, b.e, b.y[j].h, b.y[j].f, 19, 0, 19, 21, 20);
                D--;
                if(D <= 0)
                    return true;
            }

        if(b.t.I || r == 2 || r == 3 || r == 5 || b.t.h || b.t.x)
            return false;
        int l = b.t.f();
        int i1 = 0;
        if(b.t.j)
        {
            l = (l - b.t.g[b.t.o()][3]) + 18;
            i1 = b.t.g[b.t.o()][3];
        } else
        if(b.t.A)
        {
            l = (l - b.t.g[b.t.o()][3]) + 10;
            i1 = b.t.g[b.t.o()][3] + 9;
        } else
        if(b.t.e)
        {
            l -= b.t.g[b.t.o()][3];
            i1 = b.t.g[b.t.o()][3];
        } else
        {
            l -= b.t.g[b.t.o()][3];
            i1 = b.t.g[b.t.o()][3] + 17;
        }
        if(r != 2 && r != 3 && r != 5 && (!b.t.h || !b.t.x) && (d() > b.t.d() + 2 && d() < (b.t.d() + b.t.g[b.t.o()][2]) - 2 || d() + h() > b.t.d() + 4 && d() + h() < (b.t.d() + b.t.g[b.t.o()][2]) - 4) && ((f() - r()) + 17 >= l && (f() - r()) + 17 <= (l + i1) - 5 || f() + 17 > l + 5 && f() + 17 <= l + i1))
        {
            b.t.a();
            return true;
        } else
        {
            return false;
        }
    }

    protected void k()
    {
        switch(i() % 3)
        {
        case 0: // '\0'
        case 2: // '\002'
            a(true);
            f(2);
            s = 0;
            u = 0;
            break;

        case 1: // '\001'
            h(m() != 0 ? 0 : 1);
            break;
        }
    }

    public boolean p()
    {
        a(d() - j());
        return true;
    }

    public boolean c()
    {
        a(d() + j());
        return true;
    }

    public boolean b(int j)
    {
        if(f() <= 0)
            return false;
        if(b.b(this))
        {
            return false;
        } else
        {
            g(f() + j);
            return true;
        }
    }

    public void a()
    {
        x = true;
        s = 0;
    }
}