/*
 * Decompiled with CFR 0.152.
 */
public final class mw
extends fs {
    private w[] a;
    private String[] b;

    public mw(int n, int n2, int n3, w[] wArray, String[] stringArray) {
        super(n, n2, n3, 0);
        this.a = wArray;
        this.b = stringArray;
        this.a();
    }

    public final void b(int n, int n2) {
        if (n2 != this.r) {
            this.a();
        }
    }

    private void a() {
        int n = this.r;
        this.j();
        if (this.b != null) {
            int n2;
            int n3 = 0;
            int n4 = 0;
            for (n2 = 0; n2 < this.a.length; ++n2) {
                n4 = Math.max(n4, this.a[n2].l());
                n3 = Math.max(n3, this.a[n2].c());
            }
            int n5 = 0;
            int n6 = -1;
            n2 = 0;
            int n7 = 0;
            int n8 = 0;
            int n9 = 0;
            while (n5 < this.b.length) {
                String[] stringArray = a.a(n, Integer.MAX_VALUE, this.a[n5], this.b[n5], n9, true);
                for (int i = 0; i < stringArray.length; ++i) {
                    n8 = n7 + i * n4 + n3 - this.a[n5].c();
                    hc hc2 = new hc(n9, n8, this.a[n5], stringArray[i]);
                    this.d(hc2);
                    if (n9 == 0) {
                        if (n6 != -1) {
                            this.d(n6, n2 - 1);
                            n6 = n2;
                        } else {
                            n6 = n2;
                        }
                    }
                    ++n2;
                    n8 = i == 0 ? n9 + hc2.r + 4 : hc2.r + 4;
                    n9 = 0;
                }
                n9 = n8;
                ++n5;
                n7 += (stringArray.length - 1) * n4;
            }
            this.d(n6, n2 - 1);
            this.m(n7 + n4);
            return;
        }
        this.m(0);
    }

    private void d(int n, int n2) {
        int n3 = 0;
        gm gm2 = this.h(n2);
        switch (0) {
            case 1: {
                n3 = (this.r - gm2.p - gm2.r) / 2;
                break;
            }
            case 2: {
                n3 = this.r - gm2.p - gm2.r;
            }
        }
        if (n3 != 0) {
            while (n <= n2) {
                gm gm3 = this.h(n);
                gm3.j(gm3.p + n3);
                ++n;
            }
        }
    }
}