[CODE=Java] protected final void b() { if(n) return; label0: switch(d) { case 6: // '\006' case 11: // '\013' case 14: // '\016' case 15: // '\017' default: break; case 0: // '\0' m = 0; h = 0; switch(g) { case 0: // '\0' default: break; case 1: // '\001' if(k >= r + s) e = true; else if(k <= r) e = false; i = 0; a(2, 0); break label0; case 2: // '\002' if(k <= r + s && !e) { k += o; j += t; e _tmp = u; e _tmp1 = u; e _tmp2 = u; e _tmp3 = u; if(d.a(k - (l >> 1), j - p, l, p, u.e.j - (24 >> 1), u.e.i - 40, 24, 40)) u.e.j += o; break label0; } if(k >= r && e) { k -= o; j += t; e _tmp4 = u; e _tmp5 = u; e _tmp6 = u; e _tmp7 = u; if(d.a(k - (l >> 1), j - p, l, p, u.e.j - (24 >> 1), u.e.i - 40, 24, 40)) u.e.j -= o; break label0; } if(++i != 2) break label0; e _tmp8 = u; e _tmp9 = u; e _tmp10 = u; e _tmp11 = u; if(d.a(k - (l >> 1), j - p, l, p, u.e.j - (24 >> 1), u.e.i - 40, 24, 40)) { u.e.b = e; u.e.l = 6; e _tmp12 = u; u.e.a(16); } break; } break; case 1: // '\001' m = 0; h = 0; switch(g) { case 0: // '\0' default: break; case 1: // '\001' if(++i <= 5) break label0; j += 6; if(!d.a(k, j)) n = true; break; } break; case 2: // '\002' m = 0; h = 0; if(e) k -= o; else k += o; if(++i >= 5) j += t; if(!b.a(k, j)) n = true; break; case 3: // '\003' m = 0; b(-1, 0); break; case 4: // '\004' if(e) k -= o; else k += o; m = 0; h = 0; d(); break; case 5: // '\005' switch(g) { case 2: // '\002' case 3: // '\003' default: break; case 0: // '\0' m = 0; h = 0; if(Math.abs(k - u.e.j) < 128 && Math.abs(j - u.e.i) < 128) a(1, 0); break label0; case 1: // '\001' m = 0; b(-1, 0); if(e) k -= o; else k += o; j += t; a(3); break label0; case 4: // '\004' m = 0; b(-1, 0); if(e) k -= o; else k += o; j += t; if(!d.a(k, j)) n = true; break; } break; case 7: // '\007' switch(g) { case 0: // '\0' i++; m = 0; b(-1, 0); break; case 1: // '\001' i = 0; m = 1; b(0, 0); break; } break; case 8: // '\b' switch(g) { default: break; case 0: // '\0' m = 0; h = 0; if(Math.abs(k - u.e.j) >= 96 || Math.abs(j - u.e.i) >= p) break label0; e _tmp13 = u; if(u.e.f == 21) { e = k - u.e.j > 0; a(1, 0); } break label0; case 1: // '\001' m = 0; b(-100, 0); if(h >= 3) { k += e ? ((short) (-o)) : ((short) (o)); } else { k += e ? 2 : -2; j -= 2; } if(!d.a(k, j)) n = true; break; } break; case 9: // '\t' k = u.e.j; j = (short)(u.e.i + 10); break; case 10: // '\n' c(); k += o; j += t; if(!d.a(k, j)) n = true; break; case 12: // '\f' switch(g) { default: break; case 0: // '\0' if(k - u.e.j > 0 && k - u.e.j < 100 && u.e.i - j > 0 && u.e.i - j < 148) { a(1, 0); o = (byte)((Math.abs(k - u.e.j) - 48) / 8); t = (byte)(Math.abs(u.e.i - j) / 8); } m = 0; break label0; case 1: // '\001' j += t; k -= o; if(++i >= 7) { a(2, 0); i = 0; } m = 0; break label0; case 2: // '\002' if(b.a(k, j + t)) { j += t; } else { j = (short)(((j + t) / 16) * 16); a(3, 0); } m = 0; break label0; case 3: // '\003' m = 0; a(); break label0; case 4: // '\004' m = 1; b(-100, 0); if(++i > 5) n = true; break; } break; case 13: // '\r' case 17: // '\021' switch(g) { default: break; case 0: // '\0' if(Math.abs(k - u.e.j) < 128 && u.e.i - j > 0 && u.e.i - j < 128) a(1, 0); break label0; case 1: // '\001' if(e) k -= o; else k += o; if(!d.a(k, j)) n = true; break; } break; case 16: // '\020' m = 0; h = 0; if(e) k -= o; else k += o; j += t; if(!b.a(k, j)) { n = true; break; } e _tmp14 = u; e _tmp15 = u; e _tmp16 = u; e _tmp17 = u; if(d.a(k - (l >> 1), j - p, l, p, u.e.j - (24 >> 1), u.e.i - 40, 24, 40)) { u.e.a(11); u.e.j += e ? -5 : 5; } break; } } [/CODE]