| 15982 | return t < 0 ? Math.ceil(-t) : 0; |
| 15983 | } |
| 15984 | function Xx(t, e, n) { |
| 15985 | var r, |
| 15986 | i, |
| 15987 | o, |
| 15988 | a, |
| 15989 | s, |
| 15990 | u, |
| 15991 | l, |
| 15992 | c, |
| 15993 | f, |
| 15994 | h, |
| 15995 | d, |
| 15996 | p = !n.nodirty, |
| 15997 | g = n.bounds === wx ? Hx : Yx, |
| 15998 | m = Lx.set(0, 0, 0, 0), |
| 15999 | y = Gx(n.align, kx), |
| 16000 | v = Gx(n.align, Ax), |
| 16001 | _ = Gx(n.padding, kx), |
| 16002 | x = Gx(n.padding, Ax), |
| 16003 | b = n.columns || e.length, |
| 16004 | w = b <= 0 ? 1 : Math.ceil(e.length / b), |
| 16005 | k = e.length, |
| 16006 | A = Array(k), |
| 16007 | M = Array(b), |
| 16008 | E = 0, |
| 16009 | D = Array(k), |
| 16010 | C = Array(w), |
| 16011 | F = 0, |
| 16012 | S = Array(k), |
| 16013 | $ = Array(k), |
| 16014 | T = Array(k); |
| 16015 | for (i = 0; i < b; ++i) M[i] = 0; |
| 16016 | for (i = 0; i < w; ++i) C[i] = 0; |
| 16017 | for (i = 0; i < k; ++i) |
| 16018 | ((u = e[i]), |
| 16019 | (s = T[i] = g(u)), |
| 16020 | (u.x = u.x || 0), |
| 16021 | (S[i] = 0), |
| 16022 | (u.y = u.y || 0), |
| 16023 | ($[i] = 0), |
| 16024 | (o = i % b), |
| 16025 | (a = ~~(i / b)), |
| 16026 | (E = Math.max(E, (l = Math.ceil(s.x2)))), |
| 16027 | (F = Math.max(F, (c = Math.ceil(s.y2)))), |
| 16028 | (M[o] = Math.max(M[o], l)), |
| 16029 | (C[a] = Math.max(C[a], c)), |
| 16030 | (A[i] = _ + Vx(s.x1)), |
| 16031 | (D[i] = x + Vx(s.y1)), |
| 16032 | p && t.dirty(e[i])); |
| 16033 | for (i = 0; i < k; ++i) (i % b == 0 && (A[i] = 0), i < b && (D[i] = 0)); |
| 16034 | if (y === bx) |
| 16035 | for (o = 1; o < b; ++o) { |
| 16036 | for (d = 0, i = o; i < k; i += b) d < A[i] && (d = A[i]); |
| 16037 | for (i = o; i < k; i += b) A[i] = d + M[o - 1]; |
| 16038 | } |
| 16039 | else if (y === xx) { |
| 16040 | for (d = 0, i = 0; i < k; ++i) i % b && d < A[i] && (d = A[i]); |
| 16041 | for (i = 0; i < k; ++i) i % b && (A[i] = d + E); |