/* * Decompiled with CFR 0.152. */ import java.io.DataInput; import java.io.DataOutput; import java.io.OutputStream; /* * Duplicate member names - consider using --renamedupmembers true */ public final class oz implements jf, gl, lc, Runnable, fb, pz, w { public volatile boolean a; private static final int[] a = new int[2]; private static final byte[] c; private final lh a; private final gc b; private final w c; private static boolean d; private static int e; public static char[] a; public static byte[] b; private lc a; private lc b; private gu f; private gu[] h; public int a; public byte[] a; public gu a; public jc b; public int b; public int[] b; public int c; public int[] c; public iv c; public int[] d; public oz d; public int d; public String e; public int[] e; public int f; public int g; public int h; public oz i; public int i; public oz j; public void a(int[] nArray, int[] nArray2, int n) { this.a(nArray, nArray2, n, n); } public void a(ny ny2, int n, int n2, int n3, int n4) { int n5 = n3 - n2; n3 = n2 + this.d; boolean cfr_ignored_0 = ny2.v; block0 : switch (0) { case 0: { n2 = ny2.s; n4 = n2 >>> 24 & 0xFF; if (n4 != 255) { n = n * n4 >> 8; } if (n != 255) { if (n == 0) break; while (n5 > 0) { n4 = this.e[n3]; if (n4 != 0) { int n6 = n4 >> 16 & 0xFF; int n7 = n4 >> 8 & 0xFF; int n8 = n4 & 0xFF; this.e[n3] = -16777216 + (n6 + (((n2 >> 16 & 0xFF) - n6) * n + 128 >> 8) << 16) + (n7 + (((n2 >> 8 & 0xFF) - n7) * n + 128 >> 8) << 8) + (n8 + (((n2 & 0xFF) - n8) * n + 128 >> 8)); } else { this.e[n3] = (n << 24) + (n2 & 0xFFFFFF); } ++n3; --n5; } break; } while (true) { n = n3; n4 = n5 - 1; if (n5 <= 0) break block0; n3 = n + 1; this.e[n] = n2; n5 = n4; } } case 3: case 4: { gu gu2 = this.f; this.f.b = 0; gu2.c = 0; gu2 = ny2.D; if (n5 <= 0) break; this.f.c = n2 + 0 << 8; this.f.b = n4 << 8; gu2.a(this.f); int cfr_ignored_1 = this.f.c; int cfr_ignored_2 = this.f.b; if (0 != 3) { // empty if block } int cfr_ignored_3 = (null).length; return; } case 2: { gu gu3 = this.f; this.f.b = 0; gu3.c = 0; if (n5 <= 0) break; this.f.c = n2 + 0 << 8; this.f.b = n4 << 8; ny2.u.a(this.f); ny2.b(this.f.c, this.f.b); int cfr_ignored_4 = (null).length; return; } case 1: { gu gu4 = this.f; this.f.b = 0; gu4.c = 0; if (n5 <= 0) break; this.f.c = n2 + 0 << 8; this.f.b = n4 << 8; ny2.u.a(this.f); ny2.a(this.f.c, this.f.b); int cfr_ignored_5 = (null).length; } } } public boolean a(DataInput object) { lk lk2 = ar.a(la.aZ, (DataInput)object); this.a = lk2.d(1); switch (this.a) { case 0: { int n = lk2.i(2); this.h = new gu[n]; for (int i = 0; i < n; ++i) { lk lk3 = lk2.e(2, i); int n2 = lk3.f(1).d(1); object = ar.a(2, 0, lk3); String string = ar.a(2, 1, lk3); this.h[i] = object = new gu(n2, new String[]{object, string}); } break; } } this.a = true; if (this.b != null) { this.b.l(); } return true; } public void b(int n) { if (n >= 0 && n <= this.d - 1) { int n2 = this.b[n]; int n3 = this.c[n]; int n4 = this.f - n2 - n3; if (n4 > 0) { System.arraycopy(this.e, n2 + n3, this.e, n2, n4); System.arraycopy(this.d, n2 + n3, this.d, n2, n4); } this.f -= n3; for (n2 = n + 1; n2 < this.d; ++n2) { this.b[n2] = this.b[n2] - n3; } n2 = this.d - n - 1; if (n2 > 0) { System.arraycopy(this.b, n + 1, this.b, n, n2); System.arraycopy(this.c, n + 1, this.c, n, n2); } --this.d; } } public void a(int n, int[] nArray, int[] nArray2, int n2) { int n3 = this.d - 1; int n4 = this.c[n3]; if (n >= n4 - 1) { n = n4 - 1; } int n5 = n + this.b[n3]; n = n4 - n - 1; System.arraycopy(this.e, n5 + 1, this.e, n5 + 1 + n2, n); System.arraycopy(this.d, n5 + 1, this.d, n5 + 1 + n2, n); for (int i = 0; i < n2; ++i) { this.e[n5 + 1 + i] = nArray[i]; this.d[n5 + 1 + i] = nArray2[i]; } this.c[n3] = this.c[n3] + n2; } public void a(int n, ny ny2) { int n2 = ny2.q - ny2.s; int n3 = ny2.t - ny2.l; int n4 = ny2.l * this.i; int[] nArray = this.e; while (n3-- > 0) { int n5 = n2; int n6 = ny2.s + n4; while (true) { int n7 = n5 - 1; int n8 = n6; if (n5 <= 0) break; n6 = n8 + 1; n5 = n7; nArray[n8] = n; } n4 += this.i; } } private static synchronized void a() { if (!d) { a = new char[1664]; b = new byte[1664]; int n = 0; int n2 = 0; while (n2 < c.length) { int n3; int n4 = c[n2] & 0xFFFFFFC0; if (n4 != 0) { if (n4 != 64) { if (n4 != -128) { n3 = 0; oz.b[n] = (byte)(c[n2] & 0x3F); ++n2; int n5 = 0; do { n3 = (char)(n3 + ((c[n2] & 0x7F) << n5)); n5 += 7; n4 = (c[n2] & 0xFFFFFF80) != 0 ? 1 : 0; ++n2; } while (n4 != 0); oz.a[n] = n3; ++n; continue; } oz.a[n] = 2; oz.b[n] = (byte)(c[n2] & 0x3F); ++n2; ++n; continue; } oz.a[n] = '\u0001'; oz.b[n] = (byte)(c[n2] & 0x3F); ++n2; ++n; continue; } n3 = c[n2] & 0x3F; n4 = 0; while (n4 < n3) { ++n4; oz.a[n] = a[n - n3]; oz.b[n] = b[n - n3]; ++n; } ++n2; } for (n = 1; n < a.length; ++n) { a[n] = (char)(a[n] + a[n - 1]); } d = true; } } static { int n = "\u04d0\u00bf\u0000\u00be\tBC\u00fb@\u00ba\u0012FGHIJHGKLHIMNMOP\u00b2\n\u00f7\u00b9\u0003H\u00b4\u001bILH\u00b4\u001dALH@\u00ae\u0006@\u00ad\u001aKJI\u00b7\u0003S\u00f7SGHAH\u00f5IS\u00ebHS\u00b8\u0005S\u00b4\u0003H\u00ac\u0017H\u00ac\u001fH\u00ac\u00b0\u0003TS\u00ab\u0003SH\u00ecH\u00ac\u0007\u00b7\u0004SHTH\u00bf \u00adO@\u00ad\f\u00bf\u0007\u00b7\r\u00b2\u000e\u00b7\u0006\u00bf\u0080\u0001\u00b7\u0007\u00b2\u0080\u0001A\u00bf\u0007\u00be-@H@\u00f7@\u00f9@\u00b7\t\u00b59\u00b2\u0003\u00f7\u00ff\u00b9\u000b\u00b7\u0006\u00bf*\u00af\u0015\u00b5\nP\u00f7\u00bf\u0003H\u00b9cH@\u00b7\u0007\u0002\u00ff\u00f7@\u00b7\u0004\u00ef\u00b7\n\u00bf\u0017H\u00bf\u001e\u00b7\u001d\u00bfY\u00b7\u000b\u00af\u000f\u00b7\n\u00bf!\u00b7\t\u00b2\u0004FH\u00bf\u00f8\u0002\u00b7\u0003\u00bf8H@\u00b7\u0012@\u00b7\u0007\u00bf\n\u00fe\u00ef\u00b7\n\u00bf\u0011\u00b7\u0004\u00bf7H@\u00b7\u0010\u00bf\t\u00b7\u0005\u00bf\u0006\u00af\u0004\u00b7\n\u00f6\u00f7\u00bf\r\u00b7\u0004\u00bf7\u00b7\u001d\u00af\r\u00bf\n\u00f7\u00bf\u0003\u00b7\u0010\u00bf7H@\u00b7\u0012\u00bf\u0012\u00af\u0004\u00b6\u000b\u00bf\u0010\u00b7\u0004\u00bf7H@\u00b7\u001e\u00af\n\u00b7\n\u00bf\u0012H\u00bf;\u00b7\u0012\u00bf\u0007\u00af\u000f\u00b7\n\u00b6\tH\u00bf\u0007\u00b7\u0004\u00bf9\u00b7\u001a\u00bf\n\u00af\u0004\u00b7\u0012\u00bf\n\u00b7\u0003\u00bf7H@\u00b7 \u00bf\u0004\u00af\u0004\u00b7\u000b\u00bf\u0011\u00b7\u0003\u00bf9\u00b7\"\u00ff\u00af\u0004\u00b7\n\u00b5\t\u00bf\t\u00b7\u0003\u00bfE\u00b7*\u00aa\r\u00b6>U\u00b7\u000fP\u00be\n\u00aa'\u00afO\u00aa\f\u00b7$T\u00b7\u0004T\u00edT\u00feRF\u00ad\u0005HFH\u00bf\u0003\u00f7\u00af\u0006\u00b7\n\u00be\n@H\u0002@KL\u0002@\u00f7\u00bf1\u00be\u000e@\u00be\u0005@\u00f7\u00bf\b\u00be.\u00f7\u00bf\u0006H\u00ab\t\u00feTH\u00aa,\u00af@\u00be\n\u00f7\u00aa\u0004\u00b7P\u00a9`\u00a8`\u00a7H\u00b7X\u00bf\u00a0\u0002HAH\u00be\u00e1\u0006H\u00b4\u001aL\u00b7\u0004\u00beK\u00b7\u0003\u00bf$\u00b7\u000e\u00bf\u0012\u00be\u0003\u00b7\u000b\u00bf\u0012\u00b7\u000e\u00bf\u0012\u00aa\u000e\u00beT\u00e6UAHAIU\u00af\u0004\u00b7\u0010\u00b9\u0012\u00fe\u00ebHF\u00f7@\u00ad\u0003\u00ef\u00b7\u0010\u00bf\u00f6\u0001H\u00bfv\u00b7 \u00b9\u0004\u00ef\u00aa\n\u00af\u00ff\u0001\u00aa\u000e\u00f7\u00bf7\u00b7\u0007\u00bf\u009d\u0001\u00b7\u0005\u00bf/\u00b7\u0011\u00af\u000b\u00be\n\u00b7\u0007\u00bf\n\u00b7\t\u00bf\f\u00b7\u0003\u00bf\u001e\u00b7\r\u00ef\u00b7P\u00bf$\u00be\u0017\u00af\u0005\u00b7\r\u00af\u0003\u00b7\n\u00be$\u00b7\u00fd\u0001\u00bf\u00bf\u0001\u00b7@\u00ab\u0082\u0003H\u00fe\u00ad\u0007A\u00a5\u0003@\u00be\u0004RA\u00e4S\u00f7G\u00f4G\u00b4\u0003GS\u00f7\u00e3\u00be\u0003C\u00ff\u00ad\u0005J\u00b7\bG\u00ecY\u00f7\u00b2\u0006KLY\u00b7\u0003\u00be\fHA\u00b7\u0004A\u00a2\u0003H\u00bf\t\u00b7\u0006\u00ac\u0004H\u00b4\bLSHS\u00b7\u0004\u00b4\bL\u00f7\u00b6\u0010\u00b5\u0007I\u00bf(\u00b70\u00b5\u0003HSH\u00b5\u0003H\u00ac\tH\u00f6H\u00ac\n\u00f7\u00ac\bH\u00ac(\u00f7\u00ac\u0005H\u00ecHS\u00b7\f\u00ac\u0004\u00b7\n\u00ac\u0016\u00b7\n\u00ac8HSH\u00ac+HS\u00f7\u00ac\u0003\u00f7\u00ecH\u00ac\u0003HSI\u00f7SH\u00ac\u0004H\u00ec\u00b7\u0004\u00ecHS\u0002\u00b7\u0006SH\u00ac\u0005\u00b7\u0004\u00ac\u0004\u00f7\u00ac\nH\u00ac\u0003H\u00ac\u0005H\u00ac\r\u00f7\u00ec\u00b7\u0004\u00ec\u00f7\u0002\u00ac\u0012\u00f7\u00ec\u00f7\u00ac\rH\u00ac\u0003H\u00ac\u000bH\u00ac\u0019H\u00acRH\u00b4\u0016LH\u00ac\u00ca\u0002\u00b7\u00e0\u0001S\u00b7L\u00ac\u0004\u00b7%\u00ac\u000b\u00b7\u0010\u00ec\u00b7\u0004\u00ac\n\u00f7S\u00b7\u0007\u00ac\b\u00f7\u00ec\u00f7\u00ac\u0004\u0004\u00b7\u0003\u00ecH\u00ec\u00b7\u0004\u00ac\u0010\u00b7\u0004\u00ac\tH\u00ac\u0015\u00f7\u00ecH\u00ac\u0004\u00f7\u00ac\u0004\u00b7\u0004\u00ac\u0004HSH\u00ac!HSH\u00ac\u001d\u00f7S\u00b7\u0003S\u00b7\u0004S\u00f7SH\u00b8\u0094\u0001\u00b7\u0006F\u00f7\u00b4\u0004LK\u0002\u0004\u0004LS\u00b7\u001e\u00b41LH\u00b4\u001fLK\u0002\u0002L\u00b7\u0003\u00b4\u00ec\u0003LK\u0002\u0004\b\u0004LH\u00b4?LKLH\u00b4 LH\u00b9\u0084\u0005A\u00b7\u0003FAH\u00b8\u00ff\u0002\u00be\u000e\u00b7\bAK\u00b8\u0004\u00a1d\u00b3\u00fe\u0003\u00e1\u00e6^\u00f4LK\u0002\u0004L^\u00f4LK\u0002\u0002LYKL\u00e1\u00bf\n\u00a1\u0006\u00a6\u000b\u00e1\u00a6\u0004^Y\u0002\u0004^\u00a6\u0019^\u00a6\u001f^Y\u0002^\u00a6\u0006\u0002\u00bf\u0004\u00e6\u00a1\u0004Y\u00e1Y^\u0002\u0004\u00a6\u0019^\u00a6\u001f^Y\u0002^\u00a6\u0006\u0002\u00e1\u00a6\u0004\u00a1\u0004\u00a6\u008e\u0001\u00a1\u0010\u00b7\u00bf7\u00a1@\u00a6\u00ea\u00db\u0001^\u00b7\u0095\t\u00b9\u00f3\u0002AFAH\u00af\u0010\u00b7\n\u00bf\u00a7\u0003H\u00bf\u0003H\u00bf\u0004H\u00bf\u0017\u00b7\u0005\u00abL\u00f9\u00bf\n\u00f7\u00bf2\u00be\u001a\u00ef\u00b7:\u00bf\u001c\u00be\b\u00f7\u00bf\u0017\u00b7\u0018\u00a0\u00de\u0005`\u00a0\u001b\u0002\u0004\b\u0010 >>>>>>>>>>>2`\u009ew\u009d\u00ff\u0010\u00a1\u00ff2\u00b7\u00ff\u0004\u00bf\u001eH\u00b4\u00e0\u0004L\u00b7\u0011\u00b5\u00d3\u0001H\u00bf\u0003\u00b2\u0010L\u00f2\u00f9\u00f4L\\\u00bf\u0007\u00a1\u0010\u00b4\u0005LK\u0002\u0004\u0006L^\u00f4L^\u00b3\u0007^L\u00e6\u00f9\u00e1KL\u0002\u0002^\u00b6\nJ^\u00b7\u0005\u00a2\u00f0\u0001\u00f9^\u00f6J^\u00f4L^\u00f3^L^\u00a6\u000b\u00e1\u00b9\u0003^\u00b4\u001b^L^\u00b4\u001d^L^KL\u00f4L\u00e6HY\u00b7\n\u00a6-\u00f7\u00b5@I^\u00b6\u0003\u00b7\u0003\u00bf\u0011\u009c\u0003S".charAt(0); byte[] byArray = new byte[n]; int n2 = 0 + 1; for (int i = 0; i < n; ++i) { int n3 = "\u04d0\u00bf\u0000\u00be\tBC\u00fb@\u00ba\u0012FGHIJHGKLHIMNMOP\u00b2\n\u00f7\u00b9\u0003H\u00b4\u001bILH\u00b4\u001dALH@\u00ae\u0006@\u00ad\u001aKJI\u00b7\u0003S\u00f7SGHAH\u00f5IS\u00ebHS\u00b8\u0005S\u00b4\u0003H\u00ac\u0017H\u00ac\u001fH\u00ac\u00b0\u0003TS\u00ab\u0003SH\u00ecH\u00ac\u0007\u00b7\u0004SHTH\u00bf \u00adO@\u00ad\f\u00bf\u0007\u00b7\r\u00b2\u000e\u00b7\u0006\u00bf\u0080\u0001\u00b7\u0007\u00b2\u0080\u0001A\u00bf\u0007\u00be-@H@\u00f7@\u00f9@\u00b7\t\u00b59\u00b2\u0003\u00f7\u00ff\u00b9\u000b\u00b7\u0006\u00bf*\u00af\u0015\u00b5\nP\u00f7\u00bf\u0003H\u00b9cH@\u00b7\u0007\u0002\u00ff\u00f7@\u00b7\u0004\u00ef\u00b7\n\u00bf\u0017H\u00bf\u001e\u00b7\u001d\u00bfY\u00b7\u000b\u00af\u000f\u00b7\n\u00bf!\u00b7\t\u00b2\u0004FH\u00bf\u00f8\u0002\u00b7\u0003\u00bf8H@\u00b7\u0012@\u00b7\u0007\u00bf\n\u00fe\u00ef\u00b7\n\u00bf\u0011\u00b7\u0004\u00bf7H@\u00b7\u0010\u00bf\t\u00b7\u0005\u00bf\u0006\u00af\u0004\u00b7\n\u00f6\u00f7\u00bf\r\u00b7\u0004\u00bf7\u00b7\u001d\u00af\r\u00bf\n\u00f7\u00bf\u0003\u00b7\u0010\u00bf7H@\u00b7\u0012\u00bf\u0012\u00af\u0004\u00b6\u000b\u00bf\u0010\u00b7\u0004\u00bf7H@\u00b7\u001e\u00af\n\u00b7\n\u00bf\u0012H\u00bf;\u00b7\u0012\u00bf\u0007\u00af\u000f\u00b7\n\u00b6\tH\u00bf\u0007\u00b7\u0004\u00bf9\u00b7\u001a\u00bf\n\u00af\u0004\u00b7\u0012\u00bf\n\u00b7\u0003\u00bf7H@\u00b7 \u00bf\u0004\u00af\u0004\u00b7\u000b\u00bf\u0011\u00b7\u0003\u00bf9\u00b7\"\u00ff\u00af\u0004\u00b7\n\u00b5\t\u00bf\t\u00b7\u0003\u00bfE\u00b7*\u00aa\r\u00b6>U\u00b7\u000fP\u00be\n\u00aa'\u00afO\u00aa\f\u00b7$T\u00b7\u0004T\u00edT\u00feRF\u00ad\u0005HFH\u00bf\u0003\u00f7\u00af\u0006\u00b7\n\u00be\n@H\u0002@KL\u0002@\u00f7\u00bf1\u00be\u000e@\u00be\u0005@\u00f7\u00bf\b\u00be.\u00f7\u00bf\u0006H\u00ab\t\u00feTH\u00aa,\u00af@\u00be\n\u00f7\u00aa\u0004\u00b7P\u00a9`\u00a8`\u00a7H\u00b7X\u00bf\u00a0\u0002HAH\u00be\u00e1\u0006H\u00b4\u001aL\u00b7\u0004\u00beK\u00b7\u0003\u00bf$\u00b7\u000e\u00bf\u0012\u00be\u0003\u00b7\u000b\u00bf\u0012\u00b7\u000e\u00bf\u0012\u00aa\u000e\u00beT\u00e6UAHAIU\u00af\u0004\u00b7\u0010\u00b9\u0012\u00fe\u00ebHF\u00f7@\u00ad\u0003\u00ef\u00b7\u0010\u00bf\u00f6\u0001H\u00bfv\u00b7 \u00b9\u0004\u00ef\u00aa\n\u00af\u00ff\u0001\u00aa\u000e\u00f7\u00bf7\u00b7\u0007\u00bf\u009d\u0001\u00b7\u0005\u00bf/\u00b7\u0011\u00af\u000b\u00be\n\u00b7\u0007\u00bf\n\u00b7\t\u00bf\f\u00b7\u0003\u00bf\u001e\u00b7\r\u00ef\u00b7P\u00bf$\u00be\u0017\u00af\u0005\u00b7\r\u00af\u0003\u00b7\n\u00be$\u00b7\u00fd\u0001\u00bf\u00bf\u0001\u00b7@\u00ab\u0082\u0003H\u00fe\u00ad\u0007A\u00a5\u0003@\u00be\u0004RA\u00e4S\u00f7G\u00f4G\u00b4\u0003GS\u00f7\u00e3\u00be\u0003C\u00ff\u00ad\u0005J\u00b7\bG\u00ecY\u00f7\u00b2\u0006KLY\u00b7\u0003\u00be\fHA\u00b7\u0004A\u00a2\u0003H\u00bf\t\u00b7\u0006\u00ac\u0004H\u00b4\bLSHS\u00b7\u0004\u00b4\bL\u00f7\u00b6\u0010\u00b5\u0007I\u00bf(\u00b70\u00b5\u0003HSH\u00b5\u0003H\u00ac\tH\u00f6H\u00ac\n\u00f7\u00ac\bH\u00ac(\u00f7\u00ac\u0005H\u00ecHS\u00b7\f\u00ac\u0004\u00b7\n\u00ac\u0016\u00b7\n\u00ac8HSH\u00ac+HS\u00f7\u00ac\u0003\u00f7\u00ecH\u00ac\u0003HSI\u00f7SH\u00ac\u0004H\u00ec\u00b7\u0004\u00ecHS\u0002\u00b7\u0006SH\u00ac\u0005\u00b7\u0004\u00ac\u0004\u00f7\u00ac\nH\u00ac\u0003H\u00ac\u0005H\u00ac\r\u00f7\u00ec\u00b7\u0004\u00ec\u00f7\u0002\u00ac\u0012\u00f7\u00ec\u00f7\u00ac\rH\u00ac\u0003H\u00ac\u000bH\u00ac\u0019H\u00acRH\u00b4\u0016LH\u00ac\u00ca\u0002\u00b7\u00e0\u0001S\u00b7L\u00ac\u0004\u00b7%\u00ac\u000b\u00b7\u0010\u00ec\u00b7\u0004\u00ac\n\u00f7S\u00b7\u0007\u00ac\b\u00f7\u00ec\u00f7\u00ac\u0004\u0004\u00b7\u0003\u00ecH\u00ec\u00b7\u0004\u00ac\u0010\u00b7\u0004\u00ac\tH\u00ac\u0015\u00f7\u00ecH\u00ac\u0004\u00f7\u00ac\u0004\u00b7\u0004\u00ac\u0004HSH\u00ac!HSH\u00ac\u001d\u00f7S\u00b7\u0003S\u00b7\u0004S\u00f7SH\u00b8\u0094\u0001\u00b7\u0006F\u00f7\u00b4\u0004LK\u0002\u0004\u0004LS\u00b7\u001e\u00b41LH\u00b4\u001fLK\u0002\u0002L\u00b7\u0003\u00b4\u00ec\u0003LK\u0002\u0004\b\u0004LH\u00b4?LKLH\u00b4 LH\u00b9\u0084\u0005A\u00b7\u0003FAH\u00b8\u00ff\u0002\u00be\u000e\u00b7\bAK\u00b8\u0004\u00a1d\u00b3\u00fe\u0003\u00e1\u00e6^\u00f4LK\u0002\u0004L^\u00f4LK\u0002\u0002LYKL\u00e1\u00bf\n\u00a1\u0006\u00a6\u000b\u00e1\u00a6\u0004^Y\u0002\u0004^\u00a6\u0019^\u00a6\u001f^Y\u0002^\u00a6\u0006\u0002\u00bf\u0004\u00e6\u00a1\u0004Y\u00e1Y^\u0002\u0004\u00a6\u0019^\u00a6\u001f^Y\u0002^\u00a6\u0006\u0002\u00e1\u00a6\u0004\u00a1\u0004\u00a6\u008e\u0001\u00a1\u0010\u00b7\u00bf7\u00a1@\u00a6\u00ea\u00db\u0001^\u00b7\u0095\t\u00b9\u00f3\u0002AFAH\u00af\u0010\u00b7\n\u00bf\u00a7\u0003H\u00bf\u0003H\u00bf\u0004H\u00bf\u0017\u00b7\u0005\u00abL\u00f9\u00bf\n\u00f7\u00bf2\u00be\u001a\u00ef\u00b7:\u00bf\u001c\u00be\b\u00f7\u00bf\u0017\u00b7\u0018\u00a0\u00de\u0005`\u00a0\u001b\u0002\u0004\b\u0010 >>>>>>>>>>>2`\u009ew\u009d\u00ff\u0010\u00a1\u00ff2\u00b7\u00ff\u0004\u00bf\u001eH\u00b4\u00e0\u0004L\u00b7\u0011\u00b5\u00d3\u0001H\u00bf\u0003\u00b2\u0010L\u00f2\u00f9\u00f4L\\\u00bf\u0007\u00a1\u0010\u00b4\u0005LK\u0002\u0004\u0006L^\u00f4L^\u00b3\u0007^L\u00e6\u00f9\u00e1KL\u0002\u0002^\u00b6\nJ^\u00b7\u0005\u00a2\u00f0\u0001\u00f9^\u00f6J^\u00f4L^\u00f3^L^\u00a6\u000b\u00e1\u00b9\u0003^\u00b4\u001b^L^\u00b4\u001d^L^KL\u00f4L\u00e6HY\u00b7\n\u00a6-\u00f7\u00b5@I^\u00b6\u0003\u00b7\u0003\u00bf\u0011\u009c\u0003S".charAt(n2); ++n2; if (n3 > 127) { n3 = 127 - n3; } byArray[i] = (byte)n3; } c = byArray; } private static int a(char c) { int n; byte[] byArray = b; char[] cArray = a; int n2 = cArray.length; int n3 = 0; while ((n = n2) - n3 > 1) { n2 = n3 + (n - n3) / 2; if (c < cArray[n2]) continue; n3 = n2; n2 = n; } if (cArray.length == 0 || c < cArray[n3]) { n3 = -1; } if ((n2 = byArray[n3]) != 19) { if (n2 != 35) { if (n2 != 21) { if (n2 != 33) { if (n2 == 34) { n2 = 8; } } else { n2 = 8; } } else { n2 = 8; } } else { n2 = 30; } } else { n2 = 8; } if (c >= '\u3033' && c <= '\u3035') { return 28; } return n2; } public void a(int n, int n2, byte by2) { if (this.f == this.a.length - 1) { int n3 = this.a.length + 16; int[] nArray = new int[n3]; int[] nArray2 = new int[n3]; byte[] byArray = new byte[n3]; System.arraycopy(this.b, 0, nArray, 0, this.f); System.arraycopy(this.c, 0, nArray2, 0, this.f); System.arraycopy(this.a, 0, byArray, 0, this.f); this.b = nArray; this.c = nArray2; this.a = byArray; } this.b[this.f] = n; this.c[this.f] = n2; this.a[this.f] = by2; ++this.f; } public void a(int[] nArray, int[] nArray2, int n, int n2) { int n3 = this.d; if (this.d + 1 > this.b.length) { int n4 = ov.a(1, 16); int[] nArray3 = new int[this.d + n4]; System.arraycopy(this.b, 0, nArray3, 0, this.d); this.b = nArray3; nArray3 = new int[this.d + n4]; System.arraycopy(this.c, 0, nArray3, 0, this.d); this.c = nArray3; } this.b[n3] = this.f; this.c[n3] = n; ++this.d; this.c(n2); this.f += n2; System.arraycopy(nArray, 0, this.e, this.b[n3], this.c[n3]); System.arraycopy(nArray2, 0, this.d, this.b[n3], this.c[n3]); } public void d(int n, int n2) { if (this.f + 1 > this.c.length) { int n3 = ov.a(1, 16); int[] nArray = new int[this.f + n3]; System.arraycopy(this.c, 0, nArray, 0, this.f); this.c = nArray; nArray = new int[this.f + n3]; System.arraycopy(this.b, 0, nArray, 0, this.f); this.b = nArray; } this.c[this.f] = n; this.b[this.f] = n2; ++this.f; } public void c(int n, int n2) { this.c(1); this.e[this.f] = n; this.d[this.f] = n2; ++this.f; int n3 = this.d - 1; this.c[n3] = this.c[n3] + 1; } public void a(int n, int n2, int n3) { int n4 = n + this.b[this.d - 1]; this.e[n4] = n2; this.d[n4] = n3; } public boolean a(int n) { return this.c[n] > 1 && this.e[this.b[n] + this.c[n] - 1] == this.e[this.b[n]] && this.d[this.b[n] + this.c[n] - 1] == this.d[this.b[n]]; } public boolean c() { return this.f > 1 && this.c[this.f - 1] == this.c[0] && this.b[this.f - 1] == this.b[0]; } public boolean f() { return this.b != null && this.h() != null && this.b.d && this.h().length > 0; } public boolean k() { return this.a != 0 && !this.a && this.b(); } public boolean d() { return this.b == 2; } public boolean j() { return this.b == 1; } public boolean i() { return this.b == 4; } public boolean g() { return this.b == 3; } public boolean e() { return this.b == 0; } public boolean h() { return !ed.b(this.e); } public boolean a(char c) { return this.a.a(c) || this.b.a(c); } public int c(char c) { if (!this.a.a(c)) { return this.b.c(c); } return this.a.c(c); } public int b(char c) { if (!this.a.a(c)) { return this.b.b(c); } return this.a.b(c); } public boolean a(lc lc2) { String string = lc2.h(); if (!this.a.h().equals(string)) { if (!this.b.h().equals(string)) { boolean bl2 = false; if (this.a instanceof oz) { bl2 = ((oz)this.a).a(lc2); } if (!bl2) { } return bl2; } this.b = lc2; return true; } this.a = lc2; return true; } public int a(String string) { int[] nArray = a; synchronized (nArray) { bk.a(null, this.c, string, 0, 0, a, this.b); int n = a[0]; return n; } } public int a(String string, int n, int n2) { int[] nArray = a; synchronized (nArray) { bk.a(null, this.c, string, n, n2, 0, 0, a, this.b); n = a[0]; return n; } } public void a(ht ht2, String string, int n, int n2, int n3, int n4) { w w2 = ht2.f(); try { bk.a(ht2, this.c, string, n, n2, n3, n4, null, this.b); return; } finally { ht2.a(w2); } } public void a(ht ht2, String string, int n, int n2) { w w2 = ht2.f(); try { bk.a(ht2, this.c, string, n, n2, null, this.b); return; } finally { ht2.a(w2); } } public static oz b(int n, int n2, int n3, int n4) { int n5 = n3 / 2; int n6 = n4 / 2; oz oz2 = new oz(18); n5 = ov.b(n3 / 2, n5); n3 = n + n3; int n7 = n2 + n4; n4 = ov.b(n4 / 2, n6); if (n5 != 0 && n4 != 0) { n6 = ov.c(29341, n5); int n8 = ov.c(29341, n4); oz2.b(n3 - n5, n2); oz2.a(n3 - n6, n2, n3, n2 + n8, n3, n2 + n4); oz2.a(n3, n7 - n4); oz2.a(n3, n7 - n8, n3 - n6, n7, n3 - n5, n7); oz2.a(n + n5, n7); oz2.a(n + n6, n7, n, n7 - n8, n, n7 - n4); oz2.a(n, n2 + n4); oz2.a(n, n2 + n8, n + n6, n2, n + n5, n2); oz2.g(); return oz2; } oz2.b(n, n2); oz2.a(n3, n2); oz2.a(n3, n7); oz2.a(n, n7); oz2.g(); return oz2; } public ny b() { int n = Integer.MIN_VALUE; int n2 = Integer.MAX_VALUE; int n3 = Integer.MAX_VALUE; int n4 = Integer.MIN_VALUE; block3: for (int i = 0; i < this.f; ++i) { switch (this.a[i]) { case 1: case 2: case 3: case 4: { if (this.b[i] < n2) { n2 = this.b[i]; } if (this.b[i] > n) { n = this.b[i]; } if (this.c[i] < n3) { n3 = this.c[i]; } if (this.c[i] <= n4) continue block3; n4 = this.c[i]; } } } return new ny(n2, n3, n, n4); } public void run() { ej ej2 = ej.c(); ji ji2 = ji.a(); if (ej2.e() || ji2.b() || this.a != null) { ck.e().a(new px(this.c, this.i, this.f, ej2, ji2, this.a, this.e, this.b, this.a, null)); } } public void e(int n) { this.g = (this.b - this.d << 16) / (this.a - this.f); this.c = this.d << 16; if ((n -= this.f) != 0) { this.c += this.g * n; } this.h = this.c + 32768 >> 16; } public void e() { this.c += this.g; this.h = this.c + 32768 >> 16; } public void b() { if (!this.c() && this.f > 1) { this.d(this.c[0], this.b[0]); } } public void g() { if (this.f <= 0 || this.a[this.f - 1] != 5) { this.a(0, 0, (byte)5); } } public void d() { if (this.e.length - 1024 > 64) { this.e = new int[1024]; this.d = new int[1024]; } if (this.e.length - 128 > 16) { this.b = new int[128]; this.c = new int[128]; } this.f = 0; this.d = 0; } public oz(boolean bl2, boolean bl3) { this.e = new int[1024]; this.d = new int[1024]; this.b = new int[128]; this.c = new int[128]; } public oz(int n, boolean bl2) { this.c = new int[n]; this.b = new int[n]; } public oz(int n) { this.b = new int[n]; this.c = new int[n]; this.a = new byte[n]; } public oz(gc gc2, int n, int n2, int n3) { this.b = gc2; this.b = n; this.i = n2; this.f = n3; } public oz(iv iv2, int n, int n2, int n3) { this.c = iv2; this.i = n; this.f = n2; this.b = n3; } public oz(gu gu2, int n, int n2, int n3, iv iv2, String string) { this.a = gu2; this.f = n; this.b = n2; this.i = n3; this.c = iv2; this.e = string; } public oz(lh lh2, iv iv2, int n, int n2, String string, int n3, boolean bl2) { this.a = lh2; this.c = iv2; this.i = n; this.f = n2; this.e = string; this.b = n3; this.a = bl2; } public oz(int n, int n2) { this.f = new gu(false, false, false, false, false, false, false, false, false, false, false, false, false, false, false); this.i = n; this.f = n2; this.b = n * n2; this.e = new int[this.b]; } public oz(int[] nArray, int[] nArray2, int n, int n2) { this.f = n; this.c = new int[n2]; this.b = new int[n2]; System.arraycopy(nArray, 0, this.c, 0, this.f); System.arraycopy(nArray2, 0, this.b, 0, this.f); } private void c(int n) { if (this.f + n > this.e.length) { n = ov.a(n, 64); int[] nArray = new int[this.f + n]; System.arraycopy(this.e, 0, nArray, 0, this.f); this.e = nArray; nArray = new int[this.f + n]; System.arraycopy(this.d, 0, nArray, 0, this.f); this.d = nArray; } } public int e() { if (this.h != null) { return this.h.length; } return 0; } public boolean b() { return this.a.p() == 2; } public static int a(boolean bl2) { if (bl2) { return 1; } return 0; } public static int b(boolean bl2) { if (bl2) { return -1475408113; } return -1476374273; } public int d(char c) { if (c != '\u0001') { return this.c.d(c); } return 0; } public gu a(int n) { if (n >= 0 && n < this.h.length) { return this.h[n]; } return null; } public int a(cn cn2) { if (cn2.b > 11) { return 5; } return 4; } public static boolean a(char c, char c2) { block7: { block6: { int n; if (!d) { oz.a(); } n = ((n = e) & 0xFFFF) == c ? (n >>= 16) : oz.a(c); int n2 = oz.a(c2); e = c2 | n2 << 16; if (n == 3) break block6; if (n == 4 && n2 == 2) break block7; if (n == 4 || n == 2 || n == 17) break block6; if (n2 == 3 || n2 == 4 || n2 == 2 || n2 == 17 || n2 == 5 || n2 == 26) break block7; if (n == 26) break block6; if (n == 0) { n = 8; } if (n2 == 0) { n2 = 8; } if (n2 == 29 || n == 29 || n != 5 && n2 == 18 || n == 18 || n2 == 12 || n2 == 6 || n2 == 13 || n2 == 15 || n == 11 || n == 7 && n2 == 11 || n == 12 && n2 == 25 || n == 27 && n2 == 27 || n != 5 && (n2 == 7 || n == 7 || n2 != 35 && n != 35 && (n2 == 1 || n2 == 14 || n2 == 25 || n == 20 || (n == 8 || n == 30 || n == 28 || n == 16) && n2 == 28 || n == 30 && n2 == 10 || n == 8 && n2 == 16 || n == 16 && n2 == 8 || n == 9 && (n2 == 30 || n2 == 8) || n == 10 && n2 == 8 || (n == 12 || n == 16) && (n2 == 10 || n2 == 9) || (n == 10 || n == 9) && (n2 == 11 || n2 == 16) || (n == 14 || n == 13 || n == 16 || n == 15) && n2 == 16 || n == 22 && (n2 == 22 || n2 == 23 || n2 == 31 || n2 == 32) || (n == 23 || n == 31) && (n2 == 23 || n2 == 24) || (n == 24 || n == 32) && n2 == 24 || (n == 22 || n == 23 || n == 24 || n == 31 || n == 32) && (n2 == 28 || n2 == 10) || n == 9 && (n2 == 22 || n2 == 23 || n2 == 24 || n2 == 31 || n2 == 32) || n == 8 && n2 == 8 || n == 13 && n2 == 8 || (n != 12 || n2 != 8 || c != '\u3001' && c != '\u3002') && ((n == 8 || n == 16) && n2 == 11 || n == 12 && (n2 == 8 || n2 == 16))))) break block7; } return true; } return false; } public boolean a(char c, ht ht2, int n, int n2) { return this.a.a(c, ht2, n, n2) || this.b.a(c, ht2, n, n2); } public int a(int n) { if (n != 0) { if (n != this.j().length - 1) { return -16384; } return -65536; } return -16711936; } public void a(DataOutput dataOutput) { lk lk2 = new lk(la.aY); lk2.b(1, gu.c(this.c)); lk2.b(3, gu.a(this.c, this.i, this.f, this.b)); lk2.a(4, false); dataOutput.writeInt(lk2.b()); lk2.a((OutputStream)((Object)dataOutput)); } public void i(int n) { this.c.i(n); } public oz(boolean bl2) { this.i = 1; } public oz(lc lc2, lc lc3) { this.a = lc2; this.b = lc3; } public oz(w w2, lc lc2) { this.c = w2; this.b = lc2; } public oz() { } public int b() { return this.a; } public int i() { return this.b; } public iv a() { return this.c; } public iv[][] n() { return null; } public int c() { return this.c.c(); } public int l() { return this.c.l(); } public int t() { return this.c.t(); } public int g() { return this.b.x(); } public iv[] j() { return this.b.F(); } public iv[] h() { return this.b.a(this.i, this.f); } public String h() { return this.a.h() + this.b.h(); } public void j() { this.a = false; } public void i() { this.a = true; } public void c() { this.f = 0; } public byte l() { return 3; } public boolean l() { return false; } public boolean A_() { return false; } public boolean y_() { return true; } public boolean z_() { return true; } public int m() { return -1; } public int k() { return -16777216; } public int z() { return 50; } public static oz a(int n, int n2, int n3, int n4) { oz oz2 = new oz(6); oz2.b(n, n2); oz2.a(n3, n2); oz2.a(n3, n4); oz2.a(n, n4); oz2.g(); return oz2; } public void a(int n, int n2) { this.a(n, n2, (byte)2); } public void b(int n, int n2) { this.a(n, n2, (byte)1); } private void a(int n, int n2, int n3, int n4, int n5, int n6) { this.a(n, n2, (byte)4); this.a(n3, n4, (byte)4); this.a(n5, n6, (byte)4); } }