/* * Decompiled with CFR 0.152. */ import java.util.Vector; /* * Duplicate member names - consider using --renamedupmembers true */ public class a extends fs { public final boolean a; private static int a; private static String a; private static int b; private static int[][] b; private static int[] c; private static int[][] d; private static int[][] e; private static int[] f; private static int[][] g; private static int[] h; private static int[][] i; private static int[][] j; private static int[] k; public pv b; public boolean c; public boolean d; public int e; public int f; public int g; public int h; public int i; public int j; public int k; public int l; public int m; public Vector n = new Vector(); public le o; public static int a(int n, int n2, int n3) { long l = n; long l2 = n2; long l3 = Math.min(1000, n3); if (l != l2) { l3 = (l3 << 15) / (long)13312; n = l >= l2 ? 0 : 1; l += (l2 - l) * l3 >> 9; if (n == 0 ? l < l2 : l > l2) { l = l2; } if (Math.abs(l2 - l) < (long)512) { l = l2; } } return (int)l; } private static int b(int n, int n2, int n3) { int n4 = 256 - n3; return (n & 0xFF0000) * n4 + (n2 & 0xFF0000) * n3 >>> 8 & 0xFF0000 | (n & 0xFF00) * n4 + (n2 & 0xFF00) * n3 >>> 8 & 0xFF00 | (n & 0xFF) * n4 + (n2 & 0xFF) * n3 >>> 8; } public static String a() { return a; } public static void c(int n, int n2) { a = n; b = n2; } static { a = "..."; b = new int[][]{{0xFFFFFF, 0xF7FBFF, 0xF0F3FF}, {0xF7FBFF, 13098487, 7775706}, {15463421, 7775706, 11719662}}; c = new int[]{0xE7EFFF, 6394567, 15396851}; d = new int[][]{{14937083, 14936059}, {6394567, 2906514}, {14937079, 11719662}}; e = new int[][]{{15200251, 4748716, 8760544}, {0xF3F3FB, 11717864, 4748716}, {0xFBFBFF, 0xEBEFFB, 14147571}}; f = new int[]{11982067, 2906514, 13883379}; g = new int[][]{{0xFFFFFF, 0xFFFFFF, 0xFFFFFF}, {0xFFFFFF, 0xEEEEEE, 0xAAAAAA}, {0xFFFFFF, 0xAAAAAA, 0xE1E1E1}}; h = new int[]{0xEEEEEE, 0x979797, 0xEEEEEE}; i = new int[][]{{0xFFFFFF, 0xFFFFFF}, {0xAAAAAA, 0xAAAAAA}, {0xE1E1E1, 0xE1E1E1}}; j = new int[][]{{0xFFFFFF, 0xAAAAAA, 0xE1E1E1}, {0xFFFFFF, 0xEEEEEE, 0xAAAAAA}, {0xFFFFFF, 0xFFFFFF, 0xFFFFFF}}; k = new int[]{0xEEEEEE, 0x979797, 0xEEEEEE}; a = 0xF7FBFF; b = 13098487; } /* * Enabled aggressive block sorting */ public a(pv pv2, boolean[] blArray) { this(pv2, blArray[0]); blArray[0] = false; if (!pv2.c.equals("img")) { this.b(pv2, blArray); return; } else { String string = pv2.d("src"); if (string == null) return; Object object = pv2.a.a(string, 2, this); if (object instanceof le) { this.o = (le)object; } blArray[1] = true; return; } } public a(pv pv2, boolean bl2) { this.b = pv2; this.a = bl2; if (bl2) { pv2.b(); } } public static void a(StringBuffer stringBuffer) { if (stringBuffer.length() > 0 && stringBuffer.charAt(stringBuffer.length() - 1) == ' ') { stringBuffer.setLength(stringBuffer.length() - 1); } } public final boolean a_() { if (!this.b.d.a(36, false)) { if (this.b.d.a(36, true) && this.v instanceof a) { return ((a)this.v).a_(); } return false; } return true; } public final void a() { if (this.v instanceof a) { ((a)this.v).a(); } this.c = false; this.d = false; this.t(); } public final int b(int n) { if (!this.d) { this.e(n); } return this.l; } public final int c(int n) { if (!this.d) { this.e(n); } return this.m; } public final void a(boolean bl2) { if (this.a && bl2) { this.b.b(); } this.y().t(); } public final void a(int n) { int n2; switch (this.b.d.c(51)) { default: { n2 = 1; break; } case 50: { n2 = 0; break; } case 32: { n2 = 2; } } n = n2 * n / 2; if (n > 0) { for (n2 = 0; n2 < this.m(); ++n2) { gm gm2 = this.h(n2); gm2.k(gm2.q + n); } } } public final int d(int n) { on on2 = this.b.d; return on2.a(52, n) + on2.b(27) + on2.b(25) + on2.b(41) + on2.b(39) + on2.b(46) + on2.b(44); } public static int a(int n) { return n << 8; } public static int e(int n) { return n >> 8; } public final boolean b() { return this.a; } public static void a(String string) { a = string; } public static void a(ht ht2, int n, int n2, gm gm2) { a.d(ht2, n, n2, gm2.r, gm2.s); } public static String a(String string, w w2, int n, boolean bl2) { return a.a(string, w2, n, bl2, a); } private static String[] a(w w2, String string, int n, int n2, boolean bl2) { return bk.a(w2, string, n, n2, null, bl2); } public static void b(ht ht2, int n, int n2, int n3, int n4) { a.a(ht2, n, n2, n3, n4, b, c, d, e, f); } public static void c(ht ht2, int n, int n2, int n3, int n4) { a.a(ht2, n, n2, n3, n4, g, h, i, j, k); } public static void d(ht ht2, int n, int n2, int n3, int n4) { a.b(ht2, n, n2, n3, n4); a.a(ht2, a, b, n + 3, n2 + 3, n3 - 6, n4 - 6); } public static void f(ht ht2, int n, int n2, int n3, int n4) { ht2.a(-11103760); ht2.d(n, n2, n3, n4); ht2.a(-8278800); ht2.d(n - 1, n2 - 1, n3 + 2, n4 + 2); ht2.a(-8278800); ht2.d(n - 2, n2 - 2, n3 + 4, n4 + 4); } public static void a(ht ht2, int n, int n2, int n3, int n4, int n5, int n6, int n7, int n8) { a.a(ht2, n - 2, n2 - 2, n3 + 4, n4 + 4, n7, n8, 1); n7 = --n5 * 2; a.a(ht2, n + n5, n2 + n5, n3 - n7, n4 - n7, -1, n6, 1); } private static void a(ht ht2, int n, int n2, int n3, int n4, int n5, int n6, int n7) { int n8 = n3 - n7 * 2; ht2.a(n6); ht2.a(n, n2, n3, n4, n3, n4); ht2.a(n5); int n9 = n4 - n7 * 2; ht2.a(n + n7, n2 + n7, n8, n9, n8, n9); } private static void g(ht ht2, int n, int n2, int n3, int n4) { int n5 = -n3 / 8; int n6 = -n3 / 4; int n7 = n2 + n3; int n8 = n + n3 / 2; ht2.e(n8 + n5, n7 + n6 - n4, n + n3 + n5, n2 + n3 / 2 + n6 - n4); ht2.e(n8 + n5, n7 + n6 - n4, n + n3 / 4 + n5, n2 + n3 * 3 / 4 + n6 - n4); } public static void e(ht ht2, int n, int n2, int n3, int n4) { ht2.c(n + 1, n2 + 1, n3 - 2, n4 - 2); ht2.d(n + 1, n2 + 1, n3 - 3, n4 - 3); ht2.c(n, n2 + 2, 1, n4 - 4); ht2.c(n + n3 - 1, n2 + 2, 1, n4 - 4); ht2.c(n + 2, n2, n3 - 4, 1); ht2.c(n + 2, n2 + n4 - 1, n3 - 4, 1); } public static void a(ht ht2, int n, int n2, int n3, int n4) { ht2.d(n + 1, n2 + 1, n3 - 3, n4 - 3); ht2.c(n, n2 + 2, 1, n4 - 4); ht2.c(n + n3 - 1, n2 + 2, 1, n4 - 4); ht2.c(n + 2, n2, n3 - 4, 1); ht2.c(n + 2, n2 + n4 - 1, n3 - 4, 1); } public static void a(Vector vector, fw fw2) { if (vector.size() >= 2) { int n = 1; do { int n2; Object e = vector.elementAt(n); for (n2 = n - 1; n2 >= 0 && fw2.a(vector.elementAt(n2), e) > 0; --n2) { vector.setElementAt(vector.elementAt(n2), n2 + 1); } if (n == ++n2) continue; vector.setElementAt(e, n2); } while (++n < vector.size()); } } public static void a(Vector vector, ek ek2) { if (vector.size() >= 2) { int n = 1; do { int n2; Object e = vector.elementAt(n); long l = ek2.a(n); for (n2 = n - 1; n2 >= 0 && ek2.a(n2) > l; --n2) { vector.setElementAt(vector.elementAt(n2), n2 + 1); ek2.a(ek2.a(n2), n2 + 1); } if (n == ++n2) continue; vector.setElementAt(e, n2); ek2.a(l, n2); } while (++n < vector.size()); } } public final void a(int n, int n2, az az2) { int n3 = az2.j; int n4 = az2.e(az2.g(n3)); while (n < n2) { gm gm2 = this.h(n); if (gm2 instanceof ix && ((ix)gm2).a() > 1) { ((ix)gm2).a(n4, n3, az2); } else { gm2.j(gm2.p + n4); gm2.k(az2.f(n3 - gm2.s) + gm2.q); } ++n; } } public void b(ht ht2, int n, int n2) { if (this.b.d.c(42) == 1003) { int n3 = ht2.g(); int n4 = ht2.f(); int n5 = ht2.h(); int n6 = ht2.d(); ht2.b(n, n2, this.r, this.s); this.a_(ht2, n, n2); super.b(ht2, n, n2); this.c(ht2, n, n2); ht2.a(n3, n4, n5, n6); return; } this.a_(ht2, n, n2); super.b(ht2, n, n2); this.c(ht2, n, n2); } public void a_(ht ht2, int n, int n2) { int n3; int n4 = n + this.h; n = n2 + this.i; on on2 = this.b.d; n2 = n + on2.a(38, this.e); int n5 = on2.a(40, this.e); int n6 = on2.a(24, this.e); int n7 = on2.a(25, this.e); int n8 = on2.a(26, this.e); int n9 = on2.a(27, this.e); int n10 = n4 + this.f + n9 - 1; int n11 = n4 + this.j - this.g - n7; n5 = n + this.k - n5 - n8; n = on2.d(0); int n12 = n2 + n6 - 1; if ((n & 0xFF000000) != 0) { ht2.a(n); ht2.c(n10 + 1, n12 + 1, n11 - n10 - 1, n5 - n12 - 1); } if (on2.c != null && on2.c[0] != null) { le le2 = on2.c[0]; n3 = ht2.g(); int n13 = ht2.f(); int n14 = ht2.h(); int n15 = ht2.d(); int n16 = on2.c(19); n2 = n16 != 1119 && n16 != 1118 ? on2.a(17, n11 - n10 - 1, le2.a()) : 0; n = n16 != 1120 && n16 != 1118 ? on2.a(18, n5 - n12 - 1, le2.b()) : 0; ht2.b(n10 + 1, n12 + 1, n11 - n10 - 1, n5 - n12 - 1); if (n16 != 1120 && n16 != 1118) { if (n16 != 1119) { ht2.a(le2, n10 + 1 + n2, n12 + 1 + n); } else { do { ht2.a(le2, n10 + 1 + n2, n12 + 1 + n); } while ((n2 += le2.a()) < n11 - n10); } } else { do { if (n16 != 1118) { ht2.a(le2, n10 + 1 + n2, n12 + 1 + n); continue; } do { ht2.a(le2, n10 + 1 + n2, n12 + 1 + n); } while ((n2 += le2.a()) < n11 - n10); n2 = 0; } while ((n += le2.b()) < n5 - n12); } ht2.a(n3, n13, n14, n15); } if (n6 > 0) { ht2.a(on2.d(20)); n2 = (n9 << 8) / n6; n3 = (n7 << 8) / n6; for (n = 0; n < n6; ++n) { ht2.e(n10 - (n * n2 >> 8), n12 - n, n11 + (n * n3 >> 8), n12 - n); } } if (n7 > 0) { ht2.a(on2.d(21)); n2 = (n6 << 8) / n7; n3 = (n8 << 8) / n7; for (n = 0; n < n7; ++n) { ht2.e(n11 + n, n12 - (n * n2 >> 8), n11 + n, n5 + (n * n3 >> 8)); } } if (n8 > 0) { ht2.a(on2.d(22)); n2 = (n9 << 8) / n8; n7 = (n7 << 8) / n8; for (n = 0; n < n8; ++n) { ht2.e(n10 - (n * n2 >> 8), n5 + n, n11 + (n * n7 >> 8), n5 + n); } } if (n9 > 0) { ht2.a(on2.d(23)); n2 = (n6 << 8) / n9; n6 = (n8 << 8) / n9; for (n = 0; n < n9; ++n) { ht2.e(n10 - n, n12 - (n * n2 >> 8), n10 - n, n5 + (n * n6 >> 8)); } } if (on2.c(5) == 1205) { ht2.a(on2.d(4)); w w2 = on2.a(); n = w2.l() / 2; n2 = (w2.l() + 2) / 3; n5 = n12 + 1 + on2.a(43, this.e); switch (on2.d(10)) { case 1304: { String string = this.v.g(this) + 1 + ". "; w2.a(ht2, string, n4 - w2.a(string), n5); break; } case 1303: { ht2.a(n4 - n2 - n, n5 + n2, n2, n2, n2 / 2, n2 / 2); break; } case 1302: { ht2.b(n4 - n2 - n, n5 + n2, n2, n2, n2 / 2, n2 / 2); break; } case 1301: { ht2.c(n4 - n2 - n, n5 + n2, n2, n2); } } } if (this.o != null) { ht2.a(this.o, n10, n12); } } public void c(ht ht2, int n, int n2) { if (this.t_() && this.a) { ht2.a(-4860423); ht2.d(n, n2, this.r - 1, this.s - 1); ht2.d(n + 1, n2 + 1, this.r - 3, this.s - 3); } if (null == this) { ht2.a(0x8888FF); ht2.d(n, n2, this.r - 1, this.s - 1); on on2 = this.b.d; int n3 = n + this.r - 1; int n4 = n2 + this.s - 1; for (int i = 0; i < 3; ++i) { int n5; if (i != 0) { if (i != 1) { n5 = 43; ht2.a(65535); } else { n5 = 24; ht2.a(0xFF0000); } } else { ht2.a(0x8888FF); n5 = 38; } if (i != 0) { n += on2.a(n5 + 3, this.e); n3 -= on2.a(n5 + 1, this.e); } else { n += this.f; n3 -= this.g; } ht2.d(n, n2 += on2.a(n5, this.e), n3 - n, (n4 -= on2.a(n5 + 2, this.e)) - n2); } } } public static void a(ht ht2, int n, int n2, int n3, int n4, int[][] nArray, int[] nArray2, int[][] nArray3, int[][] nArray4, int[] nArray5) { int n5; if (nArray == null) { nArray = b; } if (nArray2 == null) { nArray2 = c; } if (nArray3 == null) { nArray3 = d; } if (nArray4 == null) { nArray4 = e; } if (nArray5 == null) { nArray5 = f; } for (n5 = 0; n5 < 3; ++n5) { for (int i = 0; i < 3; ++i) { ht2.a(nArray[n5][i]); ht2.c(n + i, n2 + n5, 1, 1); ht2.c(n + n3 - (i + 1), n2 + n5, 1, 1); ht2.a(nArray4[n5][i]); ht2.c(n + i, n2 + n5 + (n4 - 3), 1, 1); ht2.c(n + n3 - (i + 1), n2 + n5 + (n4 - 3), 1, 1); } ht2.a(nArray2[n5]); ht2.c(n + 3, n2 + n5, n3 - 6, 1); ht2.a(nArray5[n5]); ht2.c(n + 3, n2 + n5 + (n4 - 3), n3 - 6, 1); } for (n5 = 0; n5 < 3; ++n5) { a.a(ht2, nArray3[n5][0], nArray3[n5][1], n + n5, n2 + 3, 1, n4 - 6); a.a(ht2, nArray3[n5][0], nArray3[n5][1], n + n3 - (n5 + 1), n2 + 3, 1, n4 - 6); } } public static void b(ht ht2, int n, int n2, int n3, int n4, int n5, int n6) { int n7; int n8 = n3 + n5; int n9 = ht2.g(); int n10 = n9 + ht2.h(); if (n3 < n10 && n8 > n9 && n4 < (n7 = ht2.f()) + ht2.d() && n4 + n6 > n7) { int n11 = n5 << 8; if (n3 >= n9) { n7 = 0; } else { n7 = n9 - n3; n3 = n9; } n5 = n8 <= n10 ? n8 : n10; while (true) { n8 = n7 + 1; ht2.a(a.b(n, n2, (n7 << 16) / n11)); ht2.e(n3, n4, n3, n4 + n6 - 1); if (++n3 >= n5) break; n7 = n8; } } } public static void a(ht ht2, int n, int n2, int n3, int n4, int n5, int n6) { int n7; int n8 = ht2.f(); int n9 = n8 + ht2.d(); int n10 = n4 + n6; if (n4 < n9 && n10 > n8 && n3 < (n7 = ht2.g()) + ht2.h() && n3 + n5 > n7) { n7 = n6 << 8; if (n4 >= n8) { n6 = 0; n8 = n4; } else { n6 = n8 - n4; } n4 = n10 <= n9 ? n10 : n9; do { ht2.a(a.b(n, n2, (n6++ << 16) / n7)); ht2.e(n3, n8, n3 + n5 - 1, n8); } while (++n8 < n4); } } public static void a(ht ht2, int n, int n2, int n3, boolean bl2, boolean bl3) { int n4; int n5; ht2.a(-1); ht2.c(n, n2, n3, n3); int n6 = n3 * 3 / 2; for (n5 = 0; n5 < n6; ++n5) { n4 = 33 * n5 / n6 + -16776994 & 0xFF; ht2.a(n4 << 16 | n4 << 8 | n4); int n7 = n5 > n3 ? n5 - n3 : 0; n4 = n5 > n3 ? n3 : n5; ht2.e(n + n7, n2 + n4, n + n4, n2 + n7); } if (bl2) { n5 = bl3 ? -12885085 : -7566196; ht2.a(n5); n4 = n3 < 20 ? 1 : 2; for (n5 = 0; n5 <= n3 / 6; ++n5) { a.g(ht2, n + n4, n2 + n4, n3 - 2 * n4 - 1, n5); if (n5 <= 0) continue; a.g(ht2, n + n4, n2 + n4, n3 - 2 * n4 - 1, -n5); } } ht2.a(-5000269); ht2.e(n, n2 + n3, n + n3, n2 + n3); ht2.e(n + n3, n2, n + n3, n2 + n3); ht2.a(-8355712); ht2.e(n, n2, n + n3, n2); ht2.e(n, n2, n, n2 + n3); } public static String a(String string, w w2, int n, boolean bl2, String string2) { if (string.length() != 0 && n != 0 && w2.a(string) > n) { int n2 = string.length(); if (string2.length() > string.length()) { string2 = string2.substring(0, string.length()); } boolean bl3 = false; int n3 = n - w2.a(string2); StringBuffer stringBuffer = new StringBuffer(""); for (n = 0; n < n2 - 1; ++n) { char c = string.charAt(n); if (bl2) { if (c == ' ') { if (!bl3) { bl3 = true; stringBuffer.append(' '); } } else { bl3 = false; stringBuffer.append(c); } } else { stringBuffer.append(c); } if (w2.a(stringBuffer.toString()) <= n3) { continue; } stringBuffer.deleteCharAt(stringBuffer.length() - 1); break; } return stringBuffer.append(string2).toString(); } return string; } public static String[] a(int n, int n2, w w2, String string, int n3, boolean bl2) { if (string.length() != 0) { String[] stringArray; String[] stringArray2; String string2; int n4; int n5; if (n3 > 0) { n5 = string.indexOf(32); n5 = n5 > 0 ? w2.a(string.substring(0, n5)) : w2.a(string); for (n4 = 0; n4 < string.length(); ++n4) { n5 = Math.max(n5, w2.d(string.charAt(n4))); } string2 = ""; if (n - n3 > n5 && (stringArray2 = a.a(w2, string, n - n3, 1, true)).length > 0) { string2 = stringArray2[0]; } String[] stringArray3 = a.a(w2, string.substring(string2.length()), n, Integer.MAX_VALUE, true); stringArray2 = new String[stringArray3.length + 1]; stringArray = stringArray3; stringArray2[0] = string2; System.arraycopy(stringArray, 0, stringArray2, 1, stringArray.length); } else { stringArray2 = a.a(w2, string, n, -1, true); } if (stringArray2.length > n2) { stringArray = new String[n2]; System.arraycopy(stringArray2, 0, stringArray, 0, n2 - 1); stringArray[n2 - 1] = a.a(stringArray2[n2 - 1] + " " + stringArray2[n2], w2, n, false); } else { stringArray = stringArray2; } if (bl2) { for (n5 = 0; n5 < stringArray.length; ++n5) { string2 = stringArray[n5]; if (string2 != null && !string2.equals("")) { n = 0; n2 = string2.length(); for (n4 = 0; n4 < n2 && string2.charAt(n4) == ' '; ++n4) { ++n; } if (n != n2) { for (n4 = n2 - 1; n4 >= 0 && string2.charAt(n4) == ' '; --n4) { --n2; } string2 = string2.substring(n, n2); } else { string2 = ""; } } stringArray[n5] = string2; } } return stringArray; } return new String[]{string}; } /* * Unable to fully structure code * Could not resolve type clashes */ public final void b(pv var1_1, boolean[] var2_2) { var10_3 = var1_1.d; var4_4 = new StringBuffer(); var14_5 = var10_3.a(true); var5_6 = var2_2[1] != false && var14_5 == false; var13_7 = var10_3.c(16) == 1114; block4: for (var8_8 = 0; var8_8 < var1_1.a(); ++var8_8) { switch (var1_1.a(var8_8)) { case 1: { var3_9 = var1_1.b(var8_8); if (!"br".equals(var3_9.c)) { var7_11 = var3_9.d.a(true) == false && "li".equals(var3_9.c) == false ? 0 : 1; if (!var13_7 && var7_11 != 0) { a.a(var4_4); } if (var4_4.length() > 0) { var12_14 /* !! */ = new ix(var1_1, var4_4.toString(), var2_2[0]); var2_2[0] = false; this.n.addElement(var12_14 /* !! */ ); var5_6 = var4_4.charAt(var4_4.length() - 1) > ' '; var4_4.setLength(0); } var2_2[1] = var5_6; var3_9 = var1_1.b(var8_8); var5_6 = var2_2[0]; var9_12 = var3_9.d(); var2_2[0] = var2_2[0] | var9_12; var10_3 = var3_9.d; var6_10 = var3_9.c; var11_13 = this.n.size(); var15_15 = var10_3.c(5); if (var15_15 != 0) { if (var15_15 != 1206 && var15_15 != 1207 && !"table".equals(var3_9.c)) { if (!var6_10.equals("input")) { if (!("select".equals(var6_10) && !var3_9.c("multiple") || "option".equals(var6_10) || "textarea".equals(var6_10))) { if (var10_3.a(false)) { this.n.addElement(new a(var3_9, var2_2)); } else { this.b(var3_9, var2_2); } } else { this.n.addElement(new mp(var3_9)); } } else if (!"hidden".equals(var3_9.d("type"))) { this.n.addElement(new mp(var3_9)); } } else { this.n.addElement(new jd(var3_9)); } } if ((var6_10 = var3_9.d("id")) == null) { var6_10 = var3_9.d("name"); } if (var6_10 != null) { var16_16 = var3_9.a.A; var12_14 /* !! */ = this.n.size() != 0 ? this.n.elementAt(Math.min(this.n.size() - 1, var11_13)) : this; var16_16.put(var6_10, var12_14 /* !! */ ); } if ((var6_10 = var3_9.d("accesskey")) != null && var6_10.length() == 1) { var3_9.a.B.put(new Character(var6_10.charAt(0)), var3_9); } var5_6 = var9_12 != false && var5_6 != false; var2_2[0] = var5_6; if (var2_2[1] && var7_11 == 0) { var5_6 = true; continue block4; } var5_6 = false; continue block4; } a.a(var4_4); var4_4.append("\n"); ** GOTO lbl88 } case 2: { if (!var13_7) { var6_10 = var1_1.c(var8_8); if (var6_10 != null) { var9_12 = var5_6 == false; for (var7_11 = 0; var7_11 < var6_10.length(); ++var7_11) { var11_13 = var6_10.charAt(var7_11); if (var11_13 == 13) continue; if (var11_13 <= 32) { if (var9_12) continue; var9_12 = true; var4_4.append(' '); continue; } var4_4.append((char)var11_13); var9_12 = false; } } if (var4_4.length() <= 0) continue block4; if (var4_4.charAt(var4_4.length() - 1) > ' ') { var5_6 = true; continue block4; } else { ** GOTO lbl88 } } ** GOTO lbl90 lbl88: // 3 sources var5_6 = false; continue block4; lbl90: // 1 sources var4_4.append(var1_1.c(var8_8)); } } } if (var14_5) { a.a(var4_4); } if (var4_4.length() > 0) { this.n.addElement(new ix(var1_1, var4_4.toString(), var2_2[0])); var2_2[0] = false; var5_6 = var14_5 == false && var4_4.charAt(var4_4.length() - 1) > ' '; } var2_2[1] = var5_6; } public void e(int n) { on on2 = this.b.d; int n2 = on2.b(27) + on2.b(25) + on2.b(41) + on2.b(39) + on2.b(46) + on2.b(44); int n3 = on2.c(5); int n4 = on2.b(52); int n5 = 0; if (n3 != 1214 && on2.a(52, false)) { n = n4 = on2.a(52, n); } else if (this.o == null) { int n6 = n3 == 1214 ? on2.a(52, n) + n2 : n - n2; n = n4; for (n3 = 0; n3 < this.n.size(); ++n3) { int n7; Object object = (gm)this.n.elementAt(n3); if (object instanceof ix) { int n8 = 0; int n9 = 160; ix ix2 = (ix)object; int[] nArray = ix2.a.d.b(); object = ix2.d(); String string = ix2.c; int n10 = 0; while (true) { n7 = n9; if (n10 >= string.length()) break; n9 = string.charAt(n10); if (oz.a((char)n7, (char)n9)) { n4 = Math.max(n4, n8); n5 += n8; if (n7 == 10) { n = Math.max(n, n5); n5 = 0; } n8 = 0; } n7 = n9 < nArray.length ? nArray[n9] : object.d((char)n9); n8 += n7; ++n10; } if (n7 == 10) { n = Math.max(n, n5); n5 = 0; } n5 += n8; n4 = Math.max(n4, n8); continue; } a a2 = (a)object; on on3 = a2.b.d; n7 = on3.c(5); if (on3.c(35) == 0 && (n7 == 1202 || n7 == 1205)) { n = Math.max(Math.max(n, n5), a2.c(n6)); n5 = 0; } else { n5 += a2.c(n6); } n4 = Math.max(n4, a2.b(n6)); } } else { n = n4 = this.o.a(); } n = Math.max(n, n5) + n2; this.l = n4 + n2; this.m = n; this.d = true; } public void a(int n, az az2, boolean n2) { this.c = true; this.e = n; this.j(); on on2 = this.b.d; int n3 = on2.c(5); this.f = on2.a(41, this.e); this.g = on2.a(39, this.e); int n4 = on2.a(38, this.e); int n5 = on2.a(40, this.e); int n6 = on2.a(27, this.e); int n7 = on2.a(24, this.e); int n8 = on2.a(26, this.e); int n9 = on2.a(25, this.e); int n10 = on2.a(46, this.e); int n11 = n4 + n7 + on2.a(43, this.e); int n12 = n5 + n8 + on2.a(45, this.e); a a2 = null; int n13 = on2.a(44, this.e); int n14 = this.f + n6 + n10; n10 = this.g + n9 + n13; if (n2 == 0) { if (n3 != 1214 && on2.a(52, true)) { n2 = this.e - on2.a(52, this.e) - n14 - n10; if (on2.c(41) == 1001) { if (on2.c(39) == 1001) { this.f = this.g = n2 / 2; n14 += this.f; n10 += this.g; } else { this.f = n2; n14 += this.f; } } else { n10 += n2; this.g += n2; } } } else { n = on2.a(52, true) ? on2.a(52, n) + n14 + n10 : Math.min(n, this.c(this.e)); } this.j = n; boolean bl2 = this.a_(); if (bl2) { this.k = n11 + on2.a(36, this.v.s) + n12; } if (this.o == null) { gm gm2; n13 = 0; n3 = 0; n2 = -1; int n15 = n - n14 - n10; az az3 = new az(n15, on2, az2, n14, n11); for (int i = 0; i < this.n.size(); ++i) { int n16; gm2 = (gm)this.n.elementAt(i); if (!(gm2 instanceof ix)) { n2 = -1; a a3 = (a)gm2; on2 = a3.b.d; n16 = on2.c(5); n10 = on2.c(47); int n17 = on2.c(35); if (n10 != 1100 && n10 != 1105) { if (n17 != 37 && n17 != 48) { if (n16 != 1202 && n16 != 1205) { this.a(a3, n13); a2 = null; n16 = n16 == 1206 ? 0 : 1; a3.a(n15, (az)null, n16 != 0); if (az3.g(a3.k) < a3.j) { this.a(n3, n13, az3); n3 = n13; az3.b(az3.j); az3.a(a3.j, a3.k, 0, 0); az3.b(az3.b - az3.e); az3.j = a3.k; } else { az3.a(a3.j, a3.k, 0, 0); } a3.j(n14 + az3.g - a3.h); a3.k(n11 + az3.e - a3.i); ++n13; } else { if (az3.j > 0) { if (n3 != n13) { this.a(n3, n13, az3); } az3.b(az3.j); a2 = null; } if (n10 == 1117) { n3 = n13; this.d(a3); } else { n3 = n13 + 1; this.a(a3, n13); } if (az3.c(on2.c(33))) { a2 = null; } if (a2 != null) { n13 = a2.b.d.a(40, n); n16 = on2.a(38, n); n13 = n13 >= 0 ? (n16 >= 0 ? -Math.min(n13, n16) : -n16) : (n16 < 0 ? -(n13 + n16) : -n13); az3.b(n13); } n16 = n11 + az3.e; a3.a(n15, az3, false); n13 = n3; a2 = a3; a3.j(n14 - a3.h); a3.k(n16 - a3.i); } } else { this.d(a3); a3.a(n15, (az)null, true); az3.a(a3.j, a3.k, n17, on2.c(33)); a3.j(n14 + az3.g - a3.h); a3.k(n11 + az3.b - a3.i); } } else { this.d(a3); a3.a(n15, (az)null, true); n16 = this.f + n6; n17 = this.g + n9; int n18 = this.j - n16 - n17; int n19 = n4 + n7; int n20 = n5 + n8; if (on2.c(48) == 1001) { if (on2.c(37) != 1001) { a3.j(n16 + on2.a(37, n18) - a3.h); } else { a3.j(n16 - a3.h); } } else { a3.j(this.j - a3.h - n17 - a3.j - on2.a(48, n18)); } if (on2.c(50) == 1001) { if (on2.c(32) != 1001) { a3.k(n19 - a3.i + this.k - on2.a(50, this.s - n19 - n20)); } else { a3.k(n11 + az3.e - a3.i); } } else { a3.k(n19 - a3.i + on2.a(50, this.s - n19 - n20)); } } n16 = a3.j; } else { ix ix2 = (ix)gm2; this.a(ix2, n13); on2 = ix2.a.d; n10 = on2.c(47); ix2.j(n14); ix2.k(n11 + az3.e); ix2.l(n15); n2 = ix2.a(i, az3, n2, n3, n13); if (ix2.a() > 1) { n3 = n13; } ++n13; n16 = ix2.r; } if (n10 != 1117) continue; if (on2.a(48)) { gm2.j(gm2.p + this.j - n16 - on2.a(48, this.r)); } else { gm2.j(gm2.p + on2.a(37, this.r)); } gm2.k(gm2.q + on2.a(50, this.s)); } if (n3 != n13 && az3.j != 0) { this.a(n3, n13, az3); } az3.b(az3.j); if (az2 == null) { az3.c(1102); } if (!bl2) { this.k = n11 + az3.e + n12; } if (az2 != null) { az2.d(az3.e); az2.b(this.k - az3.e - n11); } n14 = this.j; n10 = this.k; on2 = this.b.d; n13 = 0; n2 = 0; if (!(this instanceof no) && on2.c(42) != 1003) { for (n3 = 0; n3 < this.m(); ++n3) { n2 = Math.min(n2, this.h((int)n3).p); n13 = Math.min(n13, gm2.q); n14 = Math.max(n14, gm2.p + gm2.r); n10 = Math.max(n10, gm2.q + gm2.s); } this.h = -n2; this.i = -n13; if (n2 < 0 || n13 < 0) { for (n3 = 0; n3 < this.m(); ++n3) { gm2 = this.h(n3); gm2.j(gm2.p - n2); gm2.k(gm2.q - n13); } } } this.d(this.p - this.h, this.q - this.i, n14 - n2, n10 - n13); return; } n = on2.a(52, true) ? 1 : 0; if (bl2 && n != 0) { n = on2.a(52, this.e); n2 = on2.a(36, this.e); if (n != this.o.a() || n2 != this.o.b()) { this.o = fo.a(this.o, 0, 0, this.o.a(), this.o.b(), n, n2, 3); } this.j = n + n14 + n10; } else { this.j = this.o.a() + n14 + n10; this.k = this.o.b() + n11 + n12; } this.l(this.j); this.m(this.k); if (az2 != null) { az2.b(this.k); } } }