/*
 * Decompiled with CFR 0.152.
 */
import java.util.Hashtable;

public final class on {
    private static final on g;
    private static final String[] h;
    private static final Hashtable i;
    private static final Hashtable j;
    private static final Hashtable k;
    private static final Hashtable l;
    private static final Object[] n;
    private static final String[] u;
    public static final Integer a;
    public static final int[] b;
    private static w[] m;
    private long o;
    private int[] p = new int[17];
    private byte[] q = new byte[17];
    private int r = 54;
    private int s;
    private w t;
    public le[] c;
    public int d;
    public int e;
    public int[] f = b;

    public final void a(no no2, String string) {
        this.a(new az(no2, no2.z, string));
    }

    public final boolean a(int n, boolean bl2) {
        switch (this.e(n)) {
            case 0: 
            case 2: 
            case 3: 
            case 4: 
            case 5: 
            case 6: 
            case 7: 
            case 8: 
            case 9: {
                return true;
            }
            case 1: {
                return bl2;
            }
        }
        return false;
    }

    /*
     * Enabled force condition propagation
     * Lifted jumps to return sites
     */
    public final int a(int n, int n2, int n3) {
        switch (this.e(n)) {
            case 16: {
                switch (this.d(n)) {
                    case 1103: {
                        n = 50;
                        return (n2 - n3) * n / 100;
                    }
                    default: {
                        return 0;
                    }
                    case 32: 
                    case 48: {
                        n = 100;
                        return (n2 - n3) * n / 100;
                    }
                }
            }
            case 1: {
                n = this.d(n) / 1000;
                return (n2 - n3) * n / 100;
            }
        }
        return this.b(n);
    }

    public final int c(int n) {
        if (this.e(n) == 16) {
            return this.d(n);
        }
        return 1004;
    }

    private int e(int n) {
        if (this.a(n)) {
            return this.q[n];
        }
        switch (n) {
            case 17: 
            case 18: {
                return 1;
            }
            case 7: {
                return 0;
            }
            case 0: 
            case 4: {
                return 17;
            }
        }
        return 16;
    }

    /*
     * Enabled aggressive block sorting
     */
    public final int d(int n) {
        if (!this.a(n)) {
            switch (n) {
                case 32: 
                case 36: 
                case 37: 
                case 48: 
                case 49: 
                case 50: 
                case 52: {
                    return 1001;
                }
                case 47: {
                    return 1125;
                }
                case 24: 
                case 25: 
                case 26: 
                case 27: {
                    return 1109;
                }
                case 10: {
                    return 1303;
                }
                case 7: {
                    return 400000;
                }
                case 5: {
                    return 1201;
                }
                case 4: {
                    return -16777216;
                }
                default: {
                    return 0;
                }
            }
        }
        if (n == 36 && this.q[n] == 1) return 1001;
        return this.p[n];
    }

    public final int a(int n, int n2) {
        if (this.a(n) && this.q[n] == 1) {
            return n2 * this.p[n] / 100000;
        }
        return this.b(n);
    }

    private static void a(String string, int n) {
        Integer n2 = new Integer(n);
        i.put(string, n2);
        j.put(n2, string);
    }

    private static void a(String string, int n, byte by2) {
        k.put(string, new Long((long)by2 << 32 | (long)n & 0xFFFFFFFFL));
        if (by2 == 16) {
            l.put(new Integer(n), string);
        }
    }

    public final boolean a(int n) {
        return (this.o & 1L << n) != 0L;
    }

    public final boolean a(boolean bl2) {
        int n = this.c(5);
        return n == 1202 || n == 1206 || n == 1205 || !bl2 && (this.c != null || this.c(5) != 1201 || this.b(26) != 0 || this.b(27) != 0 || this.b(25) != 0 || this.b(24) != 0 || this.c(47) == 1100 || this.a(36, true) || this.a(52, true));
    }

    static {
        a = new Integer(4660);
        g = new on();
        h = new String[]{"", "%", "cm", "em", "ex", "in", "mm", "pc", "pt", "px"};
        n = new Object[4];
        b = new int[0];
        u = new String[]{"-top", "-right", "-bottom", "-left"};
        i = new Hashtable();
        j = new Hashtable();
        k = new Hashtable();
        l = new Hashtable();
        on.a("background", 4096);
        on.a("background-color", 0);
        on.a("background-position", 4097);
        on.a("background-repeat", 19);
        on.a("border", 196608);
        on.a("border-collapse", 1);
        on.a("border-color", 65556);
        on.a("border-style", 65564);
        on.a("border-width", 65560);
        on.a("bottom", 32);
        on.a("caption-side", 3);
        on.a("clear", 33);
        on.a("clip", 34);
        on.a("color", 4);
        on.a("display", 5);
        on.a("empty-cells", 6);
        on.a("float", 35);
        on.a("font", 4098);
        on.a("font-weight", 7);
        on.a("font-size", 8);
        on.a("height", 36);
        on.a("left", 37);
        on.a("list-style", 4099);
        on.a("list-style-postion", 9);
        on.a("list-style-type", 10);
        on.a("margin", 65574);
        on.a("overflow", 42);
        on.a("padding", 65579);
        on.a("position", 47);
        on.a("right", 48);
        on.a("table-layout", 49);
        on.a("text-align", 11);
        on.a("text-decoration", 12);
        on.a("text-indent", 13);
        on.a("text-transform", 14);
        on.a("top", 50);
        on.a("vertical-align", 51);
        on.a("visibility", 15);
        on.a("white-space", 16);
        on.a("width", 52);
        on.a("z-index", 53);
        for (int i = 0; i < 4; ++i) {
            on.a("border" + u[i] + "-color", 20 + i);
            on.a("border" + u[i] + "-style", 28 + i);
            on.a("border" + u[i] + "-width", 24 + i);
            on.a("border" + u[i], 0x20000 | i);
            on.a("margin" + u[i], 38 + i);
            on.a("padding" + u[i], 43 + i);
        }
        on.a("auto", 1001, (byte)16);
        on.a("none", 0, (byte)16);
        on.a("hidden", 1003, (byte)16);
        on.a("inherit", 1002, (byte)16);
        on.a("lighter", 500000, (byte)0);
        on.a("normal", 500000, (byte)0);
        on.a("bold", 700000, (byte)0);
        on.a("bolder", 700000, (byte)0);
        on.a("inline", 1201, (byte)16);
        on.a("inline-block", 1204, (byte)16);
        on.a("block", 1202, (byte)16);
        on.a("list-item", 1205, (byte)16);
        on.a("table", 1206, (byte)16);
        on.a("inline-table", 1207, (byte)16);
        on.a("table-row", 1208, (byte)16);
        on.a("table-tow-group", 1209, (byte)16);
        on.a("table-header-group", 1210, (byte)16);
        on.a("table-footer-group", 1211, (byte)16);
        on.a("table-column", 1212, (byte)16);
        on.a("table-column-group", 1213, (byte)16);
        on.a("table-cell", 1214, (byte)16);
        on.a("table-caption", 1215, (byte)16);
        on.a("absolute", 1100, (byte)16);
        on.a("baseline", 1101, (byte)16);
        on.a("both", 1102, (byte)16);
        on.a("bottom", 32, (byte)16);
        on.a("center", 1103, (byte)16);
        on.a("capitalize", 1104, (byte)16);
        on.a("fixed", 1105, (byte)16);
        on.a("hide", 1106, (byte)16);
        on.a("inside", 1107, (byte)16);
        on.a("justify", 1108, (byte)16);
        on.a("medium", 1109, (byte)16);
        on.a("middle", 1110, (byte)16);
        on.a("no-repeat", 1111, (byte)16);
        on.a("nowrap", 1112, (byte)16);
        on.a("outside", 1113, (byte)16);
        on.a("pre", 1114, (byte)16);
        on.a("pre-wrap", 1115, (byte)16);
        on.a("pre-line", 1116, (byte)16);
        on.a("relative", 1117, (byte)16);
        on.a("scroll", 1121, (byte)16);
        on.a("sub", 1122, (byte)16);
        on.a("super", 1123, (byte)16);
        on.a("show", 1124, (byte)16);
        on.a("static", 1125, (byte)16);
        on.a("top", 50, (byte)16);
        on.a("text-top", 1126, (byte)16);
        on.a("text-bottom", 1127, (byte)16);
        on.a("thick", 1128, (byte)16);
        on.a("thin", 1129, (byte)16);
        on.a("underline", 1130, (byte)16);
        on.a("uppercase", 1131, (byte)16);
        on.a("repeat", 1118, (byte)16);
        on.a("repeat-x", 1119, (byte)16);
        on.a("repeat-y", 1120, (byte)16);
        on.a("square", 1301, (byte)16);
        on.a("circle", 1302, (byte)16);
        on.a("disc", 1303, (byte)16);
        on.a("decimal", 1304, (byte)16);
        on.a("dotted", 1401, (byte)16);
        on.a("dashed", 1402, (byte)16);
        on.a("solid", 1403, (byte)16);
        on.a("double", 1404, (byte)16);
        on.a("groove", 1405, (byte)16);
        on.a("rdige", 1406, (byte)16);
        on.a("inset", 1407, (byte)16);
        on.a("outset", 1408, (byte)16);
        on.a("left", 37, (byte)16);
        on.a("right", 48, (byte)16);
        on.a("transparent", 0, (byte)17);
        on.a("maroon", -8388608, (byte)17);
        on.a("red", -65536, (byte)17);
        on.a("orange", -23296, (byte)17);
        on.a("yellow", -256, (byte)17);
        on.a("olive", -8355840, (byte)17);
        on.a("purple", -8388480, (byte)17);
        on.a("fuchsia", -65281, (byte)17);
        on.a("white", -1, (byte)17);
        on.a("lime", -16711936, (byte)17);
        on.a("green", -16744448, (byte)17);
        on.a("navy", -16777088, (byte)17);
        on.a("blue", -16776961, (byte)17);
        on.a("aqua", -16711681, (byte)17);
        on.a("teal", -16744320, (byte)17);
        on.a("black", -16777216, (byte)17);
        on.a("silver", -4144960, (byte)17);
        on.a("gray", -8355712, (byte)17);
    }

    /*
     * Enabled force condition propagation
     * Lifted jumps to return sites
     */
    public final int c(on on2) {
        int n;
        if (this.d > on2.d) return 1;
        if (this.d < on2.d) return -1;
        int n2 = Math.min(this.f.length, on2.f.length);
        for (n = 0; n < n2; ++n) {
            if (this.f[n] > on2.f[n]) return 1;
            if (this.f[n] < on2.f[n]) return -1;
        }
        int n3 = n2 + 1 < this.f.length ? this.f[n2 + 1] : this.e;
        n = n2 + 1 < on2.f.length ? on2.f[n2 + 1] : on2.e;
        return n3 - n;
    }

    public final void b(on on2) {
        if (on2 != null) {
            for (int i = on2.r; i <= on2.s; ++i) {
                if (!on2.a(i)) continue;
                this.a(i, on2.p[i], on2.q[i]);
            }
            if (on2.c != null) {
                this.c = on2.c;
            }
        }
    }

    public final void a(on on2) {
        if (on2 == null) {
            on2 = g;
        }
        int n = Math.max(this.s, on2.s);
        for (int i = Math.min(this.r, on2.r); i <= n; ++i) {
            boolean bl2 = this.a(i);
            if ((!bl2 || this.p[i] != 1002 || this.q[i] != 16) && (bl2 || i >= 17 || i == 0 || i == 5 || !on2.a(i))) continue;
            this.a(i, on2.p[i], on2.q[i]);
        }
    }

    public final on a(int n, int n2, byte by2) {
        if (n != 4660) {
            if (n >= this.p.length) {
                int[] nArray = new int[54];
                byte[] byArray = new byte[54];
                System.arraycopy(this.p, 0, nArray, 0, this.p.length);
                System.arraycopy(this.q, 0, byArray, 0, this.q.length);
                this.p = nArray;
                this.q = byArray;
            }
            this.p[n] = n2;
            this.q[n] = by2;
            this.o |= 1L << n;
            this.r = Math.min(this.r, n);
            this.s = Math.max(this.s, n);
        }
        return this;
    }

    /*
     * Loose catch block
     */
    public final void a(int n, String string, int n2) {
        block5: {
            long l;
            if (string.length() > 0 && string.charAt(0) == '#') {
                int n3 = Integer.parseInt(string.substring(1), 16);
                if (string.length() == 4) {
                    n3 = n3 & 0xF | (n3 & 0xFF) << 4 | (n3 & 0xFF0) << 8 | (n3 & 0xF00) << 12;
                }
                this.a(n, 0xFF000000 | n3, (byte)17, n2);
                return;
            }
            Long l2 = (Long)k.get(string.toLowerCase());
            if (l2 != null && (l = l2.longValue()) >>> 32 == (long)17) {
                this.a(n, (int)l, (byte)17, n2);
                return;
            }
            break block5;
            catch (NumberFormatException numberFormatException) {}
        }
    }

    /*
     * Handled duff style switch with additional control
     * Enabled aggressive block sorting
     */
    public final void a(az az2) {
        while (az2.d != -1 && az2.d != 125) {
            if (az2.d == -2) {
                String string = az2.b;
                Integer n = (Integer)i.get(string);
                if (n == null) {
                    az2.a("unrecognized property");
                    n = a;
                }
                az2.a(false);
                if (az2.d != 58) continue;
                az2.a(false);
                int n2 = 0;
                block10: while (true) {
                    int n3 = 0;
                    block11: do {
                        switch (n3 == 0 ? az2.d : n3) {
                            case -10: {
                                if (n != 4096) {
                                    n3 = -4;
                                    if (!"background-image".equals(string)) continue block11;
                                }
                                this.c = new le[1];
                                this.c[0] = (le)az2.d.a(az2.b, 2, this.c);
                                n3 = -4;
                                continue block11;
                            }
                            case -2: {
                                Long l = (Long)k.get(az2.b);
                                if (l != null) {
                                    this.a(n, (int)l.longValue(), (byte)(l >>> 32), n2);
                                    n3 = -4;
                                    continue block11;
                                }
                                n3 = -4;
                                if (n == a) continue block11;
                                az2.a("Unrecognized value");
                                n3 = -4;
                                continue block11;
                            }
                            case -6: {
                                this.a((int)n, '#' + az2.b, n2);
                                n3 = -4;
                                continue block11;
                            }
                            case -7: {
                                this.a(n, az2.b, (byte)0, n2);
                                n3 = -4;
                                continue block11;
                            }
                            case -8: {
                                this.a(n, az2.b, (byte)1, n2);
                                n3 = -4;
                                continue block11;
                            }
                            case -9: {
                                this.a(n, az2.b, (byte)jv.a(h, az2.b.toLowerCase()), n2);
                            }
                            case -4: 
                            case 44: {
                                ++n2;
                                az2.a(false);
                                continue block10;
                            }
                        }
                        break block10;
                    } while (true);
                    break;
                }
            }
            if (az2.d == 33) {
                az2.a(false);
                if (az2.d == -2 && "important".equals(az2.b)) {
                    az2.a(false);
                }
            }
            while (az2.d != -1 && az2.d != 59 && az2.d != 125) {
                az2.a("skipping");
                az2.a(false);
            }
            while (az2.d == 59) {
                az2.a(false);
            }
        }
    }

    /*
     * Enabled aggressive block sorting
     */
    public final int b(int n) {
        int n2;
        if (n >= 24 && n <= 27) {
            if (this.d(n - 24 + 28) == 0) return 0;
            if (this.e(n) == 16) {
                switch (this.d(n)) {
                    case 1128: {
                        return 3;
                    }
                    case 1129: {
                        return 1;
                    }
                }
                return 2;
            }
        }
        if ((n2 = this.d(n)) < 0) {
            switch (n) {
                case 24: 
                case 25: 
                case 26: 
                case 27: {
                    return 0;
                }
            }
        }
        if (n2 == 0) return 0;
        switch (this.e(n)) {
            default: {
                return 0;
            }
            case 4: {
                return n2 * this.a().l() / 2000;
            }
            case 9: {
                return n2 / 1000;
            }
            case 8: {
                return n2 * 100 / 72 / 1000;
            }
            case 7: {
                return n2 * 100 / 6 / 1000;
            }
            case 6: {
                return n2 * 100 * 10 / 254 / 1000;
            }
            case 5: {
                return n2 * 100 / 1000;
            }
            case 3: {
                return n2 * this.a().l() / 1000;
            }
            case 2: 
        }
        return n2 * 100 * 100 / 254 / 1000;
    }

    /*
     * Enabled aggressive block sorting
     */
    public final on a(int n, int n2, byte by2, int n3) {
        if ((n & 0x20000) == 0) {
            if ((n & 0x10000) == 0) {
                switch (n) {
                    case 4096: {
                        if (by2 == 16 && n2 == 1002 && n3 == 0) {
                            this.a(0, 1002, (byte)16);
                            this.a(19, 1002, (byte)16);
                            this.a(17, 1002, (byte)16);
                            this.a(18, 1002, (byte)16);
                            return this;
                        }
                        if (by2 == 17) {
                            this.a(0, n2, (byte)17);
                            return this;
                        }
                        if (by2 != 16 || n2 != 1111 && n2 != 1118 && n2 != 1119 && n2 != 1120) {
                            if (by2 == 16) {
                                if (n2 == 1121) return this;
                                if (n2 == 1105) return this;
                            }
                            if (!this.a(17)) {
                                this.a(17, n2, by2);
                                this.a(18, n2, by2);
                                return this;
                            }
                            this.a(18, n2, by2);
                            return this;
                        }
                        this.a(19, n2, (byte)16);
                        return this;
                    }
                    case 4099: {
                        if (n3 == 0 && by2 == 16 && n2 == 1002) {
                            this.a(9, 1002, (byte)16);
                            this.a(10, 1002, (byte)16);
                            return this;
                        }
                        if (by2 == 16 && (n2 == 1107 || n2 == 1113)) {
                            this.a(9, n2, (byte)16);
                            return this;
                        }
                        this.a(10, n2, by2);
                        return this;
                    }
                    case 4098: {
                        if (by2 != 0) return this;
                        this.a(7, n2, by2);
                        return this;
                    }
                    case 4097: {
                        if (n3 == 0) {
                            this.a(17, n2, by2);
                        }
                        if (n3 != 0) {
                            if (n3 != 1) return this;
                        }
                        this.a(18, n2, by2);
                        return this;
                    }
                }
                this.a(n, n2, by2);
                return this;
            }
            n -= 65536;
            switch (n3) {
                default: {
                    return this;
                }
                case 3: {
                    this.a(n + 3, n2, by2);
                    return this;
                }
                case 2: {
                    this.a(n + 2, n2, by2);
                    return this;
                }
                case 1: {
                    this.a(n + 1, n2, by2);
                    this.a(n + 3, n2, by2);
                    return this;
                }
                case 0: 
            }
            this.a(n, n2, by2);
            this.a(n + 1, n2, by2);
            this.a(n + 2, n2, by2);
            this.a(n + 3, n2, by2);
            return this;
        }
        n -= 131072;
        block12 : switch (by2) {
            case 16: {
                switch (n2) {
                    default: {
                        n += 28;
                        break block12;
                    }
                    case 1109: 
                    case 1128: 
                    case 1129: 
                }
                n += 24;
                break;
            }
            case 17: {
                n += 20;
                break;
            }
            default: {
                n += 24;
            }
        }
        this.a(n, n2, by2, 0);
        return this;
    }

    public final w a() {
        if (this.t == null) {
            if (m == null) {
                ob ob2 = lh.k().h();
                m = new w[]{ob2.a(1, false, false, 0, false), ob2.a(1, true, false, 0, false), ob2.a(1, false, true, 0, false), ob2.a(1, true, true, 0, false)};
            }
            int n = this.d(7) <= 600000 ? 0 : 1;
            int n2 = this.c(12) == 1130 ? 2 : 0;
            this.t = m[n | n2];
        }
        return this.t;
    }

    public final int[] b() {
        int n = this.d(7) > 600000 ? 1 : 0;
        int n2 = this.c(12) == 1130 ? 2 : 0;
        int[] nArray = (int[])on.n[n2 = n | n2];
        if (nArray == null) {
            nArray = new int[128];
            for (n = 0; n < 128; ++n) {
                nArray[n] = this.a().d((char)n);
            }
            on.n[n2] = nArray;
        }
        return nArray;
    }
}