@maplat/transform 0.4.1 → 0.5.0

package/dist/maplat_transform.js

@@ -5,14 +5,14 @@ function tt(t, e, r = {}) {
   const n = { type: "Feature" };
   return (r.id === 0 || r.id) && (n.id = r.id), r.bbox && (n.bbox = r.bbox), n.properties = e || {}, n.geometry = t, n;
 }
-function W(t, e, r = {}) {
+function X(t, e, r = {}) {
   if (!t)
     throw new Error("coordinates is required");
   if (!Array.isArray(t))
     throw new Error("coordinates must be an Array");
   if (t.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!q(t[0]) || !q(t[1]))
+  if (!z(t[0]) || !z(t[1]))
     throw new Error("coordinates must contain numbers");
   return tt({
     type: "Point",
@@ -40,7 +40,7 @@ function F(t, e = {}) {
   const r = { type: "FeatureCollection" };
   return e.id && (r.id = e.id), e.bbox && (r.bbox = e.bbox), r.features = t, r;
 }
-function q(t) {
+function z(t) {
   return !isNaN(t) && t !== null && !Array.isArray(t);
 }
 function ut(t) {
@@ -56,7 +56,7 @@ function ut(t) {
     return [...t];
   throw new Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function z(t) {
+function G(t) {
   if (Array.isArray(t))
     return t;
   if (t.type === "Feature") {
@@ -71,18 +71,18 @@ function z(t) {
 function ft(t) {
   return t.type === "Feature" ? t.geometry : t;
 }
-const R = 11102230246251565e-32, O = 134217729, dt = (3 + 8 * R) * R;
+const R = 11102230246251565e-32, P = 134217729, dt = (3 + 8 * R) * R;
 function V(t, e, r, n, c) {
-  let i, f, g, h, l = e[0], y = n[0], o = 0, u = 0;
-  y > l == y > -l ? (i = l, l = e[++o]) : (i = y, y = n[++u]);
+  let i, u, g, h, l = e[0], y = n[0], o = 0, f = 0;
+  y > l == y > -l ? (i = l, l = e[++o]) : (i = y, y = n[++f]);
   let b = 0;
-  if (o < t && u < r)
-    for (y > l == y > -l ? (f = l + i, g = i - (f - l), l = e[++o]) : (f = y + i, g = i - (f - y), y = n[++u]), i = f, g !== 0 && (c[b++] = g); o < t && u < r; )
-      y > l == y > -l ? (f = i + l, h = f - i, g = i - (f - h) + (l - h), l = e[++o]) : (f = i + y, h = f - i, g = i - (f - h) + (y - h), y = n[++u]), i = f, g !== 0 && (c[b++] = g);
+  if (o < t && f < r)
+    for (y > l == y > -l ? (u = l + i, g = i - (u - l), l = e[++o]) : (u = y + i, g = i - (u - y), y = n[++f]), i = u, g !== 0 && (c[b++] = g); o < t && f < r; )
+      y > l == y > -l ? (u = i + l, h = u - i, g = i - (u - h) + (l - h), l = e[++o]) : (u = i + y, h = u - i, g = i - (u - h) + (y - h), y = n[++f]), i = u, g !== 0 && (c[b++] = g);
   for (; o < t; )
-    f = i + l, h = f - i, g = i - (f - h) + (l - h), l = e[++o], i = f, g !== 0 && (c[b++] = g);
-  for (; u < r; )
-    f = i + y, h = f - i, g = i - (f - h) + (y - h), y = n[++u], i = f, g !== 0 && (c[b++] = g);
+    u = i + l, h = u - i, g = i - (u - h) + (l - h), l = e[++o], i = u, g !== 0 && (c[b++] = g);
+  for (; f < r; )
+    u = i + y, h = u - i, g = i - (u - h) + (y - h), y = n[++f], i = u, g !== 0 && (c[b++] = g);
   return (i !== 0 || b === 0) && (c[b++] = i), b;
 }
 function ht(t, e) {
@@ -93,54 +93,54 @@ function ht(t, e) {
 function Y(t) {
   return new Float64Array(t);
 }
-const gt = (3 + 16 * R) * R, lt = (2 + 12 * R) * R, yt = (9 + 64 * R) * R * R, U = Y(4), G = Y(8), j = Y(12), J = Y(16), S = Y(4);
-function bt(t, e, r, n, c, i, f) {
-  let g, h, l, y, o, u, b, p, d, a, s, m, v, M, _, w, A, P;
-  const k = t - c, I = r - c, T = e - i, N = n - i;
-  M = k * N, u = O * k, b = u - (u - k), p = k - b, u = O * N, d = u - (u - N), a = N - d, _ = p * a - (M - b * d - p * d - b * a), w = T * I, u = O * T, b = u - (u - T), p = T - b, u = O * I, d = u - (u - I), a = I - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, U[0] = _ - (s + o) + (o - A), m = M + s, o = m - M, v = M - (m - o) + (s - o), s = v - w, o = v - s, U[1] = v - (s + o) + (o - w), P = m + s, o = P - m, U[2] = m - (P - o) + (s - o), U[3] = P;
-  let C = ht(4, U), X = lt * f;
-  if (C >= X || -C >= X || (o = t - k, g = t - (k + o) + (o - c), o = r - I, l = r - (I + o) + (o - c), o = e - T, h = e - (T + o) + (o - i), o = n - N, y = n - (N + o) + (o - i), g === 0 && h === 0 && l === 0 && y === 0) || (X = yt * f + dt * Math.abs(C), C += k * y + N * g - (T * l + I * h), C >= X || -C >= X)) return C;
-  M = g * N, u = O * g, b = u - (u - g), p = g - b, u = O * N, d = u - (u - N), a = N - d, _ = p * a - (M - b * d - p * d - b * a), w = h * I, u = O * h, b = u - (u - h), p = h - b, u = O * I, d = u - (u - I), a = I - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = M + s, o = m - M, v = M - (m - o) + (s - o), s = v - w, o = v - s, S[1] = v - (s + o) + (o - w), P = m + s, o = P - m, S[2] = m - (P - o) + (s - o), S[3] = P;
-  const it = V(4, U, 4, S, G);
-  M = k * y, u = O * k, b = u - (u - k), p = k - b, u = O * y, d = u - (u - y), a = y - d, _ = p * a - (M - b * d - p * d - b * a), w = T * l, u = O * T, b = u - (u - T), p = T - b, u = O * l, d = u - (u - l), a = l - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = M + s, o = m - M, v = M - (m - o) + (s - o), s = v - w, o = v - s, S[1] = v - (s + o) + (o - w), P = m + s, o = P - m, S[2] = m - (P - o) + (s - o), S[3] = P;
-  const st = V(it, G, 4, S, j);
-  M = g * y, u = O * g, b = u - (u - g), p = g - b, u = O * y, d = u - (u - y), a = y - d, _ = p * a - (M - b * d - p * d - b * a), w = h * l, u = O * h, b = u - (u - h), p = h - b, u = O * l, d = u - (u - l), a = l - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = M + s, o = m - M, v = M - (m - o) + (s - o), s = v - w, o = v - s, S[1] = v - (s + o) + (o - w), P = m + s, o = P - m, S[2] = m - (P - o) + (s - o), S[3] = P;
-  const ot = V(st, j, 4, S, J);
-  return J[ot - 1];
+const gt = (3 + 16 * R) * R, lt = (2 + 12 * R) * R, yt = (9 + 64 * R) * R * R, U = Y(4), j = Y(8), J = Y(12), K = Y(16), S = Y(4);
+function bt(t, e, r, n, c, i, u) {
+  let g, h, l, y, o, f, b, p, d, a, s, m, M, v, _, w, A, O;
+  const k = t - c, T = r - c, I = e - i, N = n - i;
+  v = k * N, f = P * k, b = f - (f - k), p = k - b, f = P * N, d = f - (f - N), a = N - d, _ = p * a - (v - b * d - p * d - b * a), w = I * T, f = P * I, b = f - (f - I), p = I - b, f = P * T, d = f - (f - T), a = T - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, U[0] = _ - (s + o) + (o - A), m = v + s, o = m - v, M = v - (m - o) + (s - o), s = M - w, o = M - s, U[1] = M - (s + o) + (o - w), O = m + s, o = O - m, U[2] = m - (O - o) + (s - o), U[3] = O;
+  let C = ht(4, U), W = lt * u;
+  if (C >= W || -C >= W || (o = t - k, g = t - (k + o) + (o - c), o = r - T, l = r - (T + o) + (o - c), o = e - I, h = e - (I + o) + (o - i), o = n - N, y = n - (N + o) + (o - i), g === 0 && h === 0 && l === 0 && y === 0) || (W = yt * u + dt * Math.abs(C), C += k * y + N * g - (I * l + T * h), C >= W || -C >= W)) return C;
+  v = g * N, f = P * g, b = f - (f - g), p = g - b, f = P * N, d = f - (f - N), a = N - d, _ = p * a - (v - b * d - p * d - b * a), w = h * T, f = P * h, b = f - (f - h), p = h - b, f = P * T, d = f - (f - T), a = T - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = v + s, o = m - v, M = v - (m - o) + (s - o), s = M - w, o = M - s, S[1] = M - (s + o) + (o - w), O = m + s, o = O - m, S[2] = m - (O - o) + (s - o), S[3] = O;
+  const it = V(4, U, 4, S, j);
+  v = k * y, f = P * k, b = f - (f - k), p = k - b, f = P * y, d = f - (f - y), a = y - d, _ = p * a - (v - b * d - p * d - b * a), w = I * l, f = P * I, b = f - (f - I), p = I - b, f = P * l, d = f - (f - l), a = l - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = v + s, o = m - v, M = v - (m - o) + (s - o), s = M - w, o = M - s, S[1] = M - (s + o) + (o - w), O = m + s, o = O - m, S[2] = m - (O - o) + (s - o), S[3] = O;
+  const st = V(it, j, 4, S, J);
+  v = g * y, f = P * g, b = f - (f - g), p = g - b, f = P * y, d = f - (f - y), a = y - d, _ = p * a - (v - b * d - p * d - b * a), w = h * l, f = P * h, b = f - (f - h), p = h - b, f = P * l, d = f - (f - l), a = l - d, A = p * a - (w - b * d - p * d - b * a), s = _ - A, o = _ - s, S[0] = _ - (s + o) + (o - A), m = v + s, o = m - v, M = v - (m - o) + (s - o), s = M - w, o = M - s, S[1] = M - (s + o) + (o - w), O = m + s, o = O - m, S[2] = m - (O - o) + (s - o), S[3] = O;
+  const ot = V(st, J, 4, S, K);
+  return K[ot - 1];
 }
 function mt(t, e, r, n, c, i) {
-  const f = (e - i) * (r - c), g = (t - c) * (n - i), h = f - g, l = Math.abs(f + g);
+  const u = (e - i) * (r - c), g = (t - c) * (n - i), h = u - g, l = Math.abs(u + g);
   return Math.abs(h) >= gt * l ? h : -bt(t, e, r, n, c, i, l);
 }
 function wt(t, e) {
-  var r, n, c = 0, i, f, g, h, l, y, o, u = t[0], b = t[1], p = e.length;
+  var r, n, c = 0, i, u, g, h, l, y, o, f = t[0], b = t[1], p = e.length;
   for (r = 0; r < p; r++) {
     n = 0;
     var d = e[r], a = d.length - 1;
     if (y = d[0], y[0] !== d[a][0] && y[1] !== d[a][1])
       throw new Error("First and last coordinates in a ring must be the same");
-    for (f = y[0] - u, g = y[1] - b, n; n < a; n++) {
-      if (o = d[n + 1], h = o[0] - u, l = o[1] - b, g === 0 && l === 0) {
-        if (h <= 0 && f >= 0 || f <= 0 && h >= 0)
+    for (u = y[0] - f, g = y[1] - b, n; n < a; n++) {
+      if (o = d[n + 1], h = o[0] - f, l = o[1] - b, g === 0 && l === 0) {
+        if (h <= 0 && u >= 0 || u <= 0 && h >= 0)
           return 0;
       } else if (l >= 0 && g <= 0 || l <= 0 && g >= 0) {
-        if (i = mt(f, h, g, l, 0, 0), i === 0)
+        if (i = mt(u, h, g, l, 0, 0), i === 0)
           return 0;
         (i > 0 && l > 0 && g <= 0 || i < 0 && l <= 0 && g > 0) && c++;
       }
-      y = o, g = l, f = h;
+      y = o, g = l, u = h;
     }
   }
   return c % 2 !== 0;
 }
-function L(t, e, r = {}) {
+function $(t, e, r = {}) {
   if (!t)
     throw new Error("point is required");
   if (!e)
     throw new Error("polygon is required");
-  const n = ut(t), c = ft(e), i = c.type, f = e.bbox;
+  const n = ut(t), c = ft(e), i = c.type, u = e.bbox;
   let g = c.coordinates;
-  if (f && xt(n, f) === !1)
+  if (u && xt(n, u) === !1)
     return !1;
   i === "Polygon" && (g = [g]);
   let h = !1;
@@ -154,23 +154,23 @@ function L(t, e, r = {}) {
 function xt(t, e) {
   return e[0] <= t[0] && e[1] <= t[1] && e[2] >= t[0] && e[3] >= t[1];
 }
-function K(t, e) {
+function L(t, e) {
   for (let r = 0; r < e.features.length; r++)
-    if (L(t, e.features[r]))
+    if ($(t, e.features[r]))
       return e.features[r];
 }
 function rt(t, e, r) {
-  const n = e.geometry.coordinates[0][0], c = e.geometry.coordinates[0][1], i = e.geometry.coordinates[0][2], f = t.geometry.coordinates, g = e.properties.a.geom, h = e.properties.b.geom, l = e.properties.c.geom, y = [c[0] - n[0], c[1] - n[1]], o = [i[0] - n[0], i[1] - n[1]], u = [f[0] - n[0], f[1] - n[1]], b = [h[0] - g[0], h[1] - g[1]], p = [l[0] - g[0], l[1] - g[1]];
-  let d = (o[1] * u[0] - o[0] * u[1]) / (y[0] * o[1] - y[1] * o[0]), a = (y[0] * u[1] - y[1] * u[0]) / (y[0] * o[1] - y[1] * o[0]);
+  const n = e.geometry.coordinates[0][0], c = e.geometry.coordinates[0][1], i = e.geometry.coordinates[0][2], u = t.geometry.coordinates, g = e.properties.a.geom, h = e.properties.b.geom, l = e.properties.c.geom, y = [c[0] - n[0], c[1] - n[1]], o = [i[0] - n[0], i[1] - n[1]], f = [u[0] - n[0], u[1] - n[1]], b = [h[0] - g[0], h[1] - g[1]], p = [l[0] - g[0], l[1] - g[1]];
+  let d = (o[1] * f[0] - o[0] * f[1]) / (y[0] * o[1] - y[1] * o[0]), a = (y[0] * f[1] - y[1] * f[0]) / (y[0] * o[1] - y[1] * o[0]);
   if (r) {
-    const s = r[e.properties.a.index], m = r[e.properties.b.index], v = r[e.properties.c.index];
-    let M;
+    const s = r[e.properties.a.index], m = r[e.properties.b.index], M = r[e.properties.c.index];
+    let v;
     if (d < 0 || a < 0 || 1 - d - a < 0) {
       const _ = d / (d + a), w = a / (d + a);
-      M = d / m / (_ / m + w / v), a = a / v / (_ / m + w / v);
+      v = d / m / (_ / m + w / M), a = a / M / (_ / m + w / M);
     } else
-      M = d / m / (d / m + a / v + (1 - d - a) / s), a = a / v / (d / m + a / v + (1 - d - a) / s);
-    d = M;
+      v = d / m / (d / m + a / M + (1 - d - a) / s), a = a / M / (d / m + a / M + (1 - d - a) / s);
+    d = v;
   }
   return [
     d * b[0] + a * p[0] + g[0],
@@ -178,44 +178,37 @@ function rt(t, e, r) {
   ];
 }
 function pt(t, e, r, n) {
-  const c = t.geometry.coordinates, i = r.geometry.coordinates, f = Math.atan2(c[0] - i[0], c[1] - i[1]), g = Mt(f, e[0]);
+  const c = t.geometry.coordinates, i = r.geometry.coordinates, u = Math.atan2(c[0] - i[0], c[1] - i[1]), g = Mt(u, e[0]);
   if (g === void 0)
     throw new Error("Unable to determine vertex index");
   const h = e[1][g];
   return rt(t, h.features[0], n);
 }
-function vt(t, e, r, n, c, i, f, g) {
+function vt(t, e, r, n, c, i, u, g) {
   let h;
-  if (f && (h = K(t, F([f]))), !h) {
+  if (u && (h = L(t, F([u]))), !h)
     if (r) {
-      const l = t.geometry.coordinates, y = r.gridNum, o = r.xOrigin, u = r.yOrigin, b = r.xUnit, p = r.yUnit, d = r.gridCache, a = B(l[0], o, b, y), s = B(l[1], u, p, y), m = d[a] ? d[a][s] ? d[a][s] : [] : [];
-      e = F(m.map((v) => e.features[v]));
-    }
-    h = K(t, e);
-  }
+      const l = t.geometry.coordinates, y = r.gridNum, o = r.xOrigin, f = r.yOrigin, b = r.xUnit, p = r.yUnit, d = r.gridCache, a = B(l[0], o, b, y), s = B(l[1], f, p, y), m = d[a] ? d[a][s] ? d[a][s] : [] : [], M = F(m.map((v) => e.features[v]));
+      h = L(t, M);
+    } else
+      h = L(t, e);
   return g && g(h), h ? rt(t, h, i) : pt(t, n, c, i);
 }
 function B(t, e, r, n) {
   let c = Math.floor((t - e) / r);
-  return c >= n && (c = n - 1), c;
+  return c < 0 && (c = 0), c >= n && (c = n - 1), c;
 }
 function Mt(t, e) {
   let r = Q(t - e[0]), n = Math.PI * 2, c;
   for (let i = 0; i < e.length; i++) {
-    const f = (i + 1) % e.length, g = Q(t - e[f]), h = Math.min(Math.abs(r), Math.abs(g));
+    const u = (i + 1) % e.length, g = Q(t - e[u]), h = Math.min(Math.abs(r), Math.abs(g));
     r * g <= 0 && h < n && (n = h, c = i), r = g;
   }
   return c;
 }
 function Q(t, e = !1) {
-  const r = e ? function(n) {
-    return !(n >= 0 && n < Math.PI * 2);
-  } : function(n) {
-    return !(n > -1 * Math.PI && n <= Math.PI);
-  };
-  for (; r(t); )
-    t = t + 2 * Math.PI * (t > 0 ? -1 : 1);
-  return t;
+  const r = 2 * Math.PI, n = t - Math.floor(t / r) * r;
+  return e ? n : n > Math.PI ? n - r : n;
 }
 function At(t, e) {
   return e && e >= 2.00703 || Array.isArray(t[0]) ? t : t.map((r) => [
@@ -286,7 +279,7 @@ function Ft(t) {
   }
   return t;
 }
-function Xt(t) {
+function Wt(t) {
   const e = ["a", "b", "c", "a"].map(
     (i) => t.properties[i].geom
   ), r = t.geometry.coordinates[0], n = t.properties, c = {
@@ -304,17 +297,16 @@ function _t(t) {
   };
   return et([e], r);
 }
-function $(t, e, r, n, c, i = !1, f) {
+function D(t, e, r, n, c, i = !1, u) {
   const g = t.map(
     (h) => {
-      (!f || f < 2.00703) && (h = nt(h));
-      const l = isFinite(h) ? e[h] : h === "c" ? n : h === "b0" ? c[0] : h === "b1" ? c[1] : h === "b2" ? c[2] : h === "b3" ? c[3] : (function() {
-        const y = h.match(/e(\d+)/);
-        if (y) {
-          const o = parseInt(y[1]);
-          return r[o];
-        }
-        throw "Bad index value for indexesToTri";
+      (!u || u < 2.00703) && (h = nt(h));
+      const l = isFinite(h) ? e[h] : h === "c" ? n : (function() {
+        const y = h.match(/^b(\d+)$/);
+        if (y) return c[parseInt(y[1])];
+        const o = h.match(/^e(\d+)$/);
+        if (o) return r[parseInt(o[1])];
+        throw new Error("Bad index value for indexesToTri");
       })();
       return i ? [[l[1], l[0]], h] : [[l[0], l[1]], h];
     }
@@ -324,17 +316,17 @@ function $(t, e, r, n, c, i = !1, f) {
 function nt(t) {
   return typeof t == "number" ? t : t.replace(/^(c|e|b)(?:ent|dgeNode|box)(\d+)?$/, "$1$2");
 }
-const D = 2.00703;
+const q = 2.00703;
 function Et(t) {
-  return !!(t.version || !t.tins && t.points && t.tins_points);
+  return !!(t.version !== void 0 || !t.tins && t.points && t.tins_points);
 }
-function Pt(t) {
+function Ot(t) {
   return {
     points: t.points,
     pointsWeightBuffer: St(t),
     strictStatus: kt(t),
-    verticesParams: It(t),
-    centroid: Tt(t),
+    verticesParams: Tt(t),
+    centroid: It(t),
     edges: At(t.edges || []),
     edgeNodes: t.edgeNodes || [],
     tins: Nt(t),
@@ -345,10 +337,10 @@ function Pt(t) {
     bounds: t.bounds,
     boundsPolygon: t.boundsPolygon,
     wh: t.wh,
-    xy: t.bounds ? t.xy : [0, 0]
+    xy: t.xy ?? [0, 0]
   };
 }
-function Ot(t) {
+function Pt(t) {
   const e = Ct(t), r = e.tins;
   return {
     compiled: e,
@@ -362,18 +354,18 @@ function Ot(t) {
   };
 }
 function St(t) {
-  return !t.version || t.version < D ? ["forw", "bakw"].reduce((e, r) => {
+  return !t.version || t.version < q ? ["forw", "bakw"].reduce((e, r) => {
     const n = t.weight_buffer[r];
     return n && (e[r] = Object.keys(n).reduce((c, i) => {
-      const f = nt(i);
-      return c[f] = n[i], c;
+      const u = nt(i);
+      return c[u] = n[i], c;
     }, {})), e;
   }, {}) : t.weight_buffer;
 }
 function kt(t) {
   return t.strict_status ? t.strict_status : t.kinks_points ? "strict_error" : t.tins_points.length === 2 ? "loose" : "strict";
 }
-function It(t) {
+function Tt(t) {
   const e = {
     forw: [t.vertices_params[0]],
     bakw: [t.vertices_params[1]]
@@ -381,28 +373,29 @@ function It(t) {
   return e.forw[1] = H(t, !1), e.bakw[1] = H(t, !0), e;
 }
 function H(t, e) {
-  return [0, 1, 2, 3].map((r) => {
-    const n = (r + 1) % 4, c = $(
-      ["c", `b${r}`, `b${n}`],
+  const r = t.vertices_points.length;
+  return Array.from({ length: r }, (n, c) => {
+    const i = (c + 1) % r, u = D(
+      ["c", `b${c}`, `b${i}`],
       t.points,
       t.edgeNodes || [],
       t.centroid_point,
       t.vertices_points,
       e,
-      D
+      q
     );
-    return F([c]);
+    return F([u]);
   });
 }
-function Tt(t) {
+function It(t) {
   return {
-    forw: W(t.centroid_point[0], {
+    forw: X(t.centroid_point[0], {
       target: {
         geom: t.centroid_point[1],
         index: "c"
       }
     }),
-    bakw: W(t.centroid_point[1], {
+    bakw: X(t.centroid_point[1], {
       target: {
         geom: t.centroid_point[0],
         index: "c"
@@ -415,7 +408,7 @@ function Nt(t) {
   return {
     forw: F(
       t.tins_points[0].map(
-        (r) => $(
+        (r) => D(
           r,
           t.points,
           t.edgeNodes || [],
@@ -428,7 +421,7 @@ function Nt(t) {
     ),
     bakw: F(
       t.tins_points[e].map(
-        (r) => $(
+        (r) => D(
           r,
           t.points,
           t.edgeNodes || [],
@@ -445,7 +438,7 @@ function Bt(t) {
   if (t)
     return {
       bakw: F(
-        t.map((e) => W(e))
+        t.map((e) => X(e))
       )
     };
 }
@@ -458,14 +451,14 @@ function Rt(t) {
   const e = [], r = t.forw.features;
   for (let n = 0; n < r.length; n++) {
     const c = r[n];
-    ["a", "b", "c"].map((i, f) => {
-      const g = c.geometry.coordinates[0][f], h = c.properties[i].geom, l = c.properties[i].index;
+    ["a", "b", "c"].forEach((i, u) => {
+      const g = c.geometry.coordinates[0][u], h = c.properties[i].geom, l = c.properties[i].index;
       typeof l == "number" && (e[l] = [g, h]);
     });
   }
   return e;
 }
-const Wt = D, E = class E {
+const Xt = q, E = class E {
   constructor() {
     x(this, "points", []);
     x(this, "pointsWeightBuffer");
@@ -515,10 +508,10 @@ const Wt = D, E = class E {
    */
   setCompiled(e) {
     if (Et(e)) {
-      this.applyModernState(Pt(e));
+      this.applyModernState(Ot(e));
       return;
     }
-    this.applyLegacyState(Ot(e));
+    this.applyLegacyState(Pt(e));
   }
   applyModernState(e) {
     this.points = e.points, this.pointsWeightBuffer = e.pointsWeightBuffer, this.strict_status = e.strictStatus, this.vertices_params = e.verticesParams, this.centroid = e.centroid, this.edges = e.edges, this.edgeNodes = e.edgeNodes || [], this.tins = e.tins, this.addIndexedTin(), this.kinks = e.kinks, this.yaxisMode = e.yaxisMode ?? E.YAXIS_INVERT, this.vertexMode = e.vertexMode ?? E.VERTEX_PLAIN, this.strictMode = e.strictMode ?? E.MODE_AUTO, e.bounds ? (this.bounds = e.bounds, this.boundsPolygon = e.boundsPolygon, this.xy = e.xy, this.wh = e.wh) : (this.bounds = void 0, this.boundsPolygon = void 0, this.xy = e.xy ?? [0, 0], e.wh && (this.wh = e.wh));
@@ -539,10 +532,10 @@ const Wt = D, E = class E {
       this.indexedTins = void 0;
       return;
     }
-    let i = [], f = [];
+    let i = [], u = [];
     const g = r.features.map((d) => {
       let a = [];
-      return z(d)[0].map((s) => {
+      return G(d)[0].map((s) => {
         i.length === 0 ? i = [Array.from(s), Array.from(s)] : (s[0] < i[0][0] && (i[0][0] = s[0]), s[0] > i[1][0] && (i[1][0] = s[0]), s[1] < i[0][1] && (i[0][1] = s[1]), s[1] > i[1][1] && (i[1][1] = s[1])), a.length === 0 ? a = [Array.from(s), Array.from(s)] : (s[0] < a[0][0] && (a[0][0] = s[0]), s[0] > a[1][0] && (a[1][0] = s[0]), s[1] < a[0][1] && (a[0][1] = s[1]), s[1] > a[1][1] && (a[1][1] = s[1]));
       }), a;
     }), h = (i[1][0] - i[0][0]) / c, l = (i[1][1] - i[0][1]) / c, y = g.reduce(
@@ -552,12 +545,12 @@ const Wt = D, E = class E {
           i[0][0],
           h,
           c
-        ), v = B(
+        ), M = B(
           a[1][0],
           i[0][0],
           h,
           c
-        ), M = B(
+        ), v = B(
           a[0][1],
           i[0][1],
           l,
@@ -568,9 +561,9 @@ const Wt = D, E = class E {
           l,
           c
         );
-        for (let w = m; w <= v; w++) {
+        for (let w = m; w <= M; w++) {
           d[w] || (d[w] = []);
-          for (let A = M; A <= _; A++)
+          for (let A = v; A <= _; A++)
             d[w][A] || (d[w][A] = []), d[w][A].push(s);
         }
         return d;
@@ -578,35 +571,35 @@ const Wt = D, E = class E {
       []
     ), o = n.features.map((d) => {
       let a = [];
-      return z(d)[0].map((s) => {
-        f.length === 0 ? f = [Array.from(s), Array.from(s)] : (s[0] < f[0][0] && (f[0][0] = s[0]), s[0] > f[1][0] && (f[1][0] = s[0]), s[1] < f[0][1] && (f[0][1] = s[1]), s[1] > f[1][1] && (f[1][1] = s[1])), a.length === 0 ? a = [Array.from(s), Array.from(s)] : (s[0] < a[0][0] && (a[0][0] = s[0]), s[0] > a[1][0] && (a[1][0] = s[0]), s[1] < a[0][1] && (a[0][1] = s[1]), s[1] > a[1][1] && (a[1][1] = s[1]));
+      return G(d)[0].map((s) => {
+        u.length === 0 ? u = [Array.from(s), Array.from(s)] : (s[0] < u[0][0] && (u[0][0] = s[0]), s[0] > u[1][0] && (u[1][0] = s[0]), s[1] < u[0][1] && (u[0][1] = s[1]), s[1] > u[1][1] && (u[1][1] = s[1])), a.length === 0 ? a = [Array.from(s), Array.from(s)] : (s[0] < a[0][0] && (a[0][0] = s[0]), s[0] > a[1][0] && (a[1][0] = s[0]), s[1] < a[0][1] && (a[0][1] = s[1]), s[1] > a[1][1] && (a[1][1] = s[1]));
       }), a;
-    }), u = (f[1][0] - f[0][0]) / c, b = (f[1][1] - f[0][1]) / c, p = o.reduce(
+    }), f = (u[1][0] - u[0][0]) / c, b = (u[1][1] - u[0][1]) / c, p = o.reduce(
       (d, a, s) => {
         const m = B(
           a[0][0],
-          f[0][0],
-          u,
+          u[0][0],
+          f,
           c
-        ), v = B(
+        ), M = B(
           a[1][0],
-          f[0][0],
-          u,
+          u[0][0],
+          f,
           c
-        ), M = B(
+        ), v = B(
           a[0][1],
-          f[0][1],
+          u[0][1],
           b,
           c
         ), _ = B(
           a[1][1],
-          f[0][1],
+          u[0][1],
           b,
           c
         );
-        for (let w = m; w <= v; w++) {
+        for (let w = m; w <= M; w++) {
           d[w] || (d[w] = []);
-          for (let A = M; A <= _; A++)
+          for (let A = v; A <= _; A++)
             d[w][A] || (d[w][A] = []), d[w][A].push(s);
         }
         return d;
@@ -624,9 +617,9 @@ const Wt = D, E = class E {
       },
       bakw: {
         gridNum: c,
-        xOrigin: f[0][0],
-        yOrigin: f[0][1],
-        xUnit: u,
+        xOrigin: u[0][0],
+        yOrigin: u[0][1],
+        xUnit: f,
         yUnit: b,
         gridCache: p
       }
@@ -643,21 +636,23 @@ const Wt = D, E = class E {
    * @throws {Error} 逆方向変換が許可されていない状態での逆変換時
    */
   transform(e, r, n) {
+    if (!this.tins)
+      throw new Error("setCompiled() must be called before transform()");
     if (r && this.strict_status == E.STATUS_ERROR)
-      throw 'Backward transform is not allowed if strict_status == "strict_error"';
+      throw new Error('Backward transform is not allowed if strict_status == "strict_error"');
     this.yaxisMode == E.YAXIS_FOLLOW && r && (e = [e[0], -1 * e[1]]);
-    const c = W(e);
-    if (this.bounds && !r && !n && !L(c, this.boundsPolygon))
+    const c = X(e);
+    if (this.bounds && !r && !n && !$(c, this.boundsPolygon))
       return !1;
-    const i = r ? this.tins.bakw : this.tins.forw, f = r ? this.indexedTins.bakw : this.indexedTins.forw, g = r ? this.vertices_params.bakw : this.vertices_params.forw, h = r ? this.centroid.bakw : this.centroid.forw, l = r ? this.pointsWeightBuffer.bakw : this.pointsWeightBuffer.forw;
+    const i = r ? this.tins.bakw : this.tins.forw, u = r ? this.indexedTins.bakw : this.indexedTins.forw, g = r ? this.vertices_params.bakw : this.vertices_params.forw, h = r ? this.centroid.bakw : this.centroid.forw, l = r ? this.pointsWeightBuffer.bakw : this.pointsWeightBuffer.forw;
     let y, o;
     this.stateFull && (this.stateBackward == r ? y = this.stateTriangle : (this.stateBackward = r, this.stateTriangle = void 0), o = (b) => {
       this.stateTriangle = b;
     });
-    let u = vt(
+    let f = vt(
       c,
       i,
-      f,
+      u,
       g,
       h,
       l,
@@ -665,10 +660,10 @@ const Wt = D, E = class E {
       o
     );
     if (this.bounds && r && !n) {
-      const b = W(u);
-      if (!L(b, this.boundsPolygon)) return !1;
-    } else this.yaxisMode == E.YAXIS_FOLLOW && !r && (u = [u[0], -1 * u[1]]);
-    return u;
+      const b = X(f);
+      if (!$(b, this.boundsPolygon)) return !1;
+    } else this.yaxisMode == E.YAXIS_FOLLOW && !r && (f = [f[0], -1 * f[1]]);
+    return f;
   }
 };
 /**
@@ -679,8 +674,8 @@ x(E, "VERTEX_PLAIN", "plain"), x(E, "VERTEX_BIRDEYE", "birdeye"), x(E, "MODE_STR
 let Z = E;
 export {
   Z as Transform,
-  Xt as counterTri,
-  Wt as format_version,
+  Wt as counterTri,
+  Xt as format_version,
   At as normalizeEdges,
   Ft as rotateVerticesTriangle,
   vt as transformArr