@maplat/transform 0.2.2 → 0.3.0

package/dist/maplat_transform.js

@@ -1,352 +1,505 @@
-var ot = Object.defineProperty;
-var at = (e, t, s) => t in e ? ot(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s;
-var _ = (e, t, s) => at(e, typeof t != "symbol" ? t + "" : t, s);
-const R = 11102230246251565e-32, I = 134217729, ft = (3 + 8 * R) * R;
-function V(e, t, s, r, a) {
-  let n, c, d, g, l = t[0], y = r[0], o = 0, u = 0;
-  y > l == y > -l ? (n = l, l = t[++o]) : (n = y, y = r[++u]);
+const C = 11102230246251565e-32, E = 134217729, st = (3 + 8 * C) * C;
+function Y(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 b = 0;
-  if (o < e && u < s)
-    for (y > l == y > -l ? (c = l + n, d = n - (c - l), l = t[++o]) : (c = y + n, d = n - (c - y), y = r[++u]), n = c, d !== 0 && (a[b++] = d); o < e && u < s; )
-      y > l == y > -l ? (c = n + l, g = c - n, d = n - (c - g) + (l - g), l = t[++o]) : (c = n + y, g = c - n, d = n - (c - g) + (y - g), y = r[++u]), n = c, d !== 0 && (a[b++] = d);
-  for (; o < e; )
-    c = n + l, g = c - n, d = n - (c - g) + (l - g), l = t[++o], n = c, d !== 0 && (a[b++] = d);
-  for (; u < s; )
-    c = n + y, g = c - n, d = n - (c - g) + (y - g), y = r[++u], n = c, d !== 0 && (a[b++] = d);
-  return (n !== 0 || b === 0) && (a[b++] = n), b;
-}
-function ct(e, t) {
-  let s = t[0];
-  for (let r = 1; r < e; r++) s += t[r];
-  return s;
-}
-function $(e) {
-  return new Float64Array(e);
-}
-const ut = (3 + 16 * R) * R, ht = (2 + 12 * R) * R, gt = (9 + 64 * R) * R * R, F = $(4), q = $(8), L = $(12), G = $(16), P = $(4);
-function dt(e, t, s, r, a, n, c) {
-  let d, g, l, y, o, u, b, x, h, f, i, w, A, v, E, m, M, T;
-  const S = e - a, p = s - a, k = t - n, N = r - n;
-  v = S * N, u = I * S, b = u - (u - S), x = S - b, u = I * N, h = u - (u - N), f = N - h, E = x * f - (v - b * h - x * h - b * f), m = k * p, u = I * k, b = u - (u - k), x = k - b, u = I * p, h = u - (u - p), f = p - h, M = x * f - (m - b * h - x * h - b * f), i = E - M, o = E - i, F[0] = E - (i + o) + (o - M), w = v + i, o = w - v, A = v - (w - o) + (i - o), i = A - m, o = A - i, F[1] = A - (i + o) + (o - m), T = w + i, o = T - w, F[2] = w - (T - o) + (i - o), F[3] = T;
-  let U = ct(4, F), X = ht * c;
-  if (U >= X || -U >= X || (o = e - S, d = e - (S + o) + (o - a), o = s - p, l = s - (p + o) + (o - a), o = t - k, g = t - (k + o) + (o - n), o = r - N, y = r - (N + o) + (o - n), d === 0 && g === 0 && l === 0 && y === 0) || (X = gt * c + ft * Math.abs(U), U += S * y + N * d - (k * l + p * g), U >= X || -U >= X)) return U;
-  v = d * N, u = I * d, b = u - (u - d), x = d - b, u = I * N, h = u - (u - N), f = N - h, E = x * f - (v - b * h - x * h - b * f), m = g * p, u = I * g, b = u - (u - g), x = g - b, u = I * p, h = u - (u - p), f = p - h, M = x * f - (m - b * h - x * h - b * f), i = E - M, o = E - i, P[0] = E - (i + o) + (o - M), w = v + i, o = w - v, A = v - (w - o) + (i - o), i = A - m, o = A - i, P[1] = A - (i + o) + (o - m), T = w + i, o = T - w, P[2] = w - (T - o) + (i - o), P[3] = T;
-  const st = V(4, F, 4, P, q);
-  v = S * y, u = I * S, b = u - (u - S), x = S - b, u = I * y, h = u - (u - y), f = y - h, E = x * f - (v - b * h - x * h - b * f), m = k * l, u = I * k, b = u - (u - k), x = k - b, u = I * l, h = u - (u - l), f = l - h, M = x * f - (m - b * h - x * h - b * f), i = E - M, o = E - i, P[0] = E - (i + o) + (o - M), w = v + i, o = w - v, A = v - (w - o) + (i - o), i = A - m, o = A - i, P[1] = A - (i + o) + (o - m), T = w + i, o = T - w, P[2] = w - (T - o) + (i - o), P[3] = T;
-  const nt = V(st, q, 4, P, L);
-  v = d * y, u = I * d, b = u - (u - d), x = d - b, u = I * y, h = u - (u - y), f = y - h, E = x * f - (v - b * h - x * h - b * f), m = g * l, u = I * g, b = u - (u - g), x = g - b, u = I * l, h = u - (u - l), f = l - h, M = x * f - (m - b * h - x * h - b * f), i = E - M, o = E - i, P[0] = E - (i + o) + (o - M), w = v + i, o = w - v, A = v - (w - o) + (i - o), i = A - m, o = A - i, P[1] = A - (i + o) + (o - m), T = w + i, o = T - w, P[2] = w - (T - o) + (i - o), P[3] = T;
-  const it = V(nt, L, 4, P, G);
-  return G[it - 1];
-}
-function lt(e, t, s, r, a, n) {
-  const c = (t - n) * (s - a), d = (e - a) * (r - n), g = c - d, l = Math.abs(c + d);
-  return Math.abs(g) >= ut * l ? g : -dt(e, t, s, r, a, n, l);
-}
-function yt(e, t) {
-  var s, r, a = 0, n, c, d, g, l, y, o, u = e[0], b = e[1], x = t.length;
-  for (s = 0; s < x; s++) {
-    r = 0;
-    var h = t[s], f = h.length - 1;
-    if (y = h[0], y[0] !== h[f][0] && y[1] !== h[f][1])
+  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);
+  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);
+  return (i !== 0 || b === 0) && (c[b++] = i), b;
+}
+function ot(t, e) {
+  let r = e[0];
+  for (let n = 1; n < t; n++) r += e[n];
+  return r;
+}
+function W(t) {
+  return new Float64Array(t);
+}
+const at = (3 + 16 * C) * C, ct = (2 + 12 * C) * C, ut = (9 + 64 * C) * C * C, R = W(4), D = W(8), q = W(12), z = W(16), P = W(4);
+function ft(t, e, r, n, c, i, f) {
+  let g, h, l, y, o, u, b, x, d, a, s, m, _, p, M, w, v, A;
+  const O = t - c, S = r - c, k = e - i, T = n - i;
+  p = O * T, u = E * O, b = u - (u - O), x = O - b, u = E * T, d = u - (u - T), a = T - d, M = x * a - (p - b * d - x * d - b * a), w = k * S, u = E * k, b = u - (u - k), x = k - b, u = E * S, d = u - (u - S), a = S - d, v = x * a - (w - b * d - x * d - b * a), s = M - v, o = M - s, R[0] = M - (s + o) + (o - v), m = p + s, o = m - p, _ = p - (m - o) + (s - o), s = _ - w, o = _ - s, R[1] = _ - (s + o) + (o - w), A = m + s, o = A - m, R[2] = m - (A - o) + (s - o), R[3] = A;
+  let B = ot(4, R), F = ct * f;
+  if (B >= F || -B >= F || (o = t - O, g = t - (O + o) + (o - c), o = r - S, l = r - (S + o) + (o - c), o = e - k, h = e - (k + o) + (o - i), o = n - T, y = n - (T + o) + (o - i), g === 0 && h === 0 && l === 0 && y === 0) || (F = ut * f + st * Math.abs(B), B += O * y + T * g - (k * l + S * h), B >= F || -B >= F)) return B;
+  p = g * T, u = E * g, b = u - (u - g), x = g - b, u = E * T, d = u - (u - T), a = T - d, M = x * a - (p - b * d - x * d - b * a), w = h * S, u = E * h, b = u - (u - h), x = h - b, u = E * S, d = u - (u - S), a = S - d, v = x * a - (w - b * d - x * d - b * a), s = M - v, o = M - s, P[0] = M - (s + o) + (o - v), m = p + s, o = m - p, _ = p - (m - o) + (s - o), s = _ - w, o = _ - s, P[1] = _ - (s + o) + (o - w), A = m + s, o = A - m, P[2] = m - (A - o) + (s - o), P[3] = A;
+  const rt = Y(4, R, 4, P, D);
+  p = O * y, u = E * O, b = u - (u - O), x = O - b, u = E * y, d = u - (u - y), a = y - d, M = x * a - (p - b * d - x * d - b * a), w = k * l, u = E * k, b = u - (u - k), x = k - b, u = E * l, d = u - (u - l), a = l - d, v = x * a - (w - b * d - x * d - b * a), s = M - v, o = M - s, P[0] = M - (s + o) + (o - v), m = p + s, o = m - p, _ = p - (m - o) + (s - o), s = _ - w, o = _ - s, P[1] = _ - (s + o) + (o - w), A = m + s, o = A - m, P[2] = m - (A - o) + (s - o), P[3] = A;
+  const nt = Y(rt, D, 4, P, q);
+  p = g * y, u = E * g, b = u - (u - g), x = g - b, u = E * y, d = u - (u - y), a = y - d, M = x * a - (p - b * d - x * d - b * a), w = h * l, u = E * h, b = u - (u - h), x = h - b, u = E * l, d = u - (u - l), a = l - d, v = x * a - (w - b * d - x * d - b * a), s = M - v, o = M - s, P[0] = M - (s + o) + (o - v), m = p + s, o = m - p, _ = p - (m - o) + (s - o), s = _ - w, o = _ - s, P[1] = _ - (s + o) + (o - w), A = m + s, o = A - m, P[2] = m - (A - o) + (s - o), P[3] = A;
+  const it = Y(nt, q, 4, P, z);
+  return z[it - 1];
+}
+function dt(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);
+  return Math.abs(h) >= at * l ? h : -ft(t, e, r, n, c, i, l);
+}
+function ht(t, e) {
+  var r, n, c = 0, i, f, g, h, l, y, o, u = t[0], b = t[1], x = e.length;
+  for (r = 0; r < x; 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 (c = y[0] - u, d = y[1] - b, r; r < f; r++) {
-      if (o = h[r + 1], g = o[0] - u, l = o[1] - b, d === 0 && l === 0) {
-        if (g <= 0 && c >= 0 || c <= 0 && g >= 0)
+    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)
           return 0;
-      } else if (l >= 0 && d <= 0 || l <= 0 && d >= 0) {
-        if (n = lt(c, g, d, l, 0, 0), n === 0)
+      } else if (l >= 0 && g <= 0 || l <= 0 && g >= 0) {
+        if (i = dt(f, h, g, l, 0, 0), i === 0)
           return 0;
-        (n > 0 && l > 0 && d <= 0 || n < 0 && l <= 0 && d > 0) && a++;
+        (i > 0 && l > 0 && g <= 0 || i < 0 && l <= 0 && g > 0) && c++;
       }
-      y = o, d = l, c = g;
+      y = o, g = l, f = h;
     }
   }
-  return a % 2 !== 0;
+  return c % 2 !== 0;
 }
-function Z(e, t, s = {}) {
-  const r = { type: "Feature" };
-  return (s.id === 0 || s.id) && (r.id = s.id), s.bbox && (r.bbox = s.bbox), r.properties = t || {}, r.geometry = e, r;
+function H(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 Y(e, t, s = {}) {
-  if (!e)
+function X(t, e, r = {}) {
+  if (!t)
     throw new Error("coordinates is required");
-  if (!Array.isArray(e))
+  if (!Array.isArray(t))
     throw new Error("coordinates must be an Array");
-  if (e.length < 2)
+  if (t.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!j(e[0]) || !j(e[1]))
+  if (!G(t[0]) || !G(t[1]))
     throw new Error("coordinates must contain numbers");
-  return Z({
+  return H({
     type: "Point",
-    coordinates: e
-  }, t, s);
+    coordinates: t
+  }, e, r);
 }
-function tt(e, t, s = {}) {
-  for (const a of e) {
-    if (a.length < 4)
+function Z(t, e, r = {}) {
+  for (const c of t) {
+    if (c.length < 4)
       throw new Error(
         "Each LinearRing of a Polygon must have 4 or more Positions."
       );
-    if (a[a.length - 1].length !== a[0].length)
+    if (c[c.length - 1].length !== c[0].length)
       throw new Error("First and last Position are not equivalent.");
-    for (let n = 0; n < a[a.length - 1].length; n++)
-      if (a[a.length - 1][n] !== a[0][n])
+    for (let i = 0; i < c[c.length - 1].length; i++)
+      if (c[c.length - 1][i] !== c[0][i])
         throw new Error("First and last Position are not equivalent.");
   }
-  return Z({
+  return H({
     type: "Polygon",
-    coordinates: e
-  }, t, s);
+    coordinates: t
+  }, e, r);
 }
-function B(e, t = {}) {
-  const s = { type: "FeatureCollection" };
-  return t.id && (s.id = t.id), t.bbox && (s.bbox = t.bbox), s.features = e, s;
+function U(t, e = {}) {
+  const r = { type: "FeatureCollection" };
+  return e.id && (r.id = e.id), e.bbox && (r.bbox = e.bbox), r.features = t, r;
 }
-function j(e) {
-  return !isNaN(e) && e !== null && !Array.isArray(e);
+function G(t) {
+  return !isNaN(t) && t !== null && !Array.isArray(t);
 }
-function bt(e) {
-  if (!e)
+function gt(t) {
+  if (!t)
     throw new Error("coord is required");
-  if (!Array.isArray(e)) {
-    if (e.type === "Feature" && e.geometry !== null && e.geometry.type === "Point")
-      return [...e.geometry.coordinates];
-    if (e.type === "Point")
-      return [...e.coordinates];
+  if (!Array.isArray(t)) {
+    if (t.type === "Feature" && t.geometry !== null && t.geometry.type === "Point")
+      return [...t.geometry.coordinates];
+    if (t.type === "Point")
+      return [...t.coordinates];
   }
-  if (Array.isArray(e) && e.length >= 2 && !Array.isArray(e[0]) && !Array.isArray(e[1]))
-    return [...e];
+  if (Array.isArray(t) && t.length >= 2 && !Array.isArray(t[0]) && !Array.isArray(t[1]))
+    return [...t];
   throw new Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function J(e) {
-  if (Array.isArray(e))
-    return e;
-  if (e.type === "Feature") {
-    if (e.geometry !== null)
-      return e.geometry.coordinates;
-  } else if (e.coordinates)
-    return e.coordinates;
+function j(t) {
+  if (Array.isArray(t))
+    return t;
+  if (t.type === "Feature") {
+    if (t.geometry !== null)
+      return t.geometry.coordinates;
+  } else if (t.coordinates)
+    return t.coordinates;
   throw new Error(
     "coords must be GeoJSON Feature, Geometry Object or an Array"
   );
 }
-function wt(e) {
-  return e.type === "Feature" ? e.geometry : e;
+function lt(t) {
+  return t.type === "Feature" ? t.geometry : t;
 }
-function mt(e, t, s = {}) {
-  if (!e)
-    throw new Error("point is required");
+function yt(t, e, r = {}) {
   if (!t)
+    throw new Error("point is required");
+  if (!e)
     throw new Error("polygon is required");
-  const r = bt(e), a = wt(t), n = a.type, c = t.bbox;
-  let d = a.coordinates;
-  if (c && xt(r, c) === !1)
+  const n = gt(t), c = lt(e), i = c.type, f = e.bbox;
+  let g = c.coordinates;
+  if (f && bt(n, f) === !1)
     return !1;
-  n === "Polygon" && (d = [d]);
-  let g = !1;
-  for (var l = 0; l < d.length; ++l) {
-    const y = yt(r, d[l]);
-    if (y === 0) return !s.ignoreBoundary;
-    y && (g = !0);
+  i === "Polygon" && (g = [g]);
+  let h = !1;
+  for (var l = 0; l < g.length; ++l) {
+    const y = ht(n, g[l]);
+    if (y === 0) return !r.ignoreBoundary;
+    y && (h = !0);
+  }
+  return h;
+}
+function bt(t, e) {
+  return e[0] <= t[0] && e[1] <= t[1] && e[2] >= t[0] && e[3] >= t[1];
+}
+var V = yt;
+function J(t, e) {
+  for (let r = 0; r < e.features.length; r++)
+    if (V(t, e.features[r]))
+      return e.features[r];
+}
+function tt(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]], x = [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]);
+  if (r) {
+    const s = r[e.properties.a.index], m = r[e.properties.b.index], _ = r[e.properties.c.index];
+    let p;
+    if (d < 0 || a < 0 || 1 - d - a < 0) {
+      const M = d / (d + a), w = a / (d + a);
+      p = d / m / (M / m + w / _), a = a / _ / (M / m + w / _);
+    } else
+      p = d / m / (d / m + a / _ + (1 - d - a) / s), a = a / _ / (d / m + a / _ + (1 - d - a) / s);
+    d = p;
+  }
+  return [
+    d * b[0] + a * x[0] + g[0],
+    d * b[1] + a * x[1] + g[1]
+  ];
+}
+function mt(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 = xt(f, e[0]);
+  if (g === void 0)
+    throw new Error("Unable to determine vertex index");
+  const h = e[1][g];
+  return tt(t, h.features[0], n);
+}
+function wt(t, e, r, n, c, i, f, g) {
+  let h;
+  if (f && (h = J(t, U([f]))), !h) {
+    if (r) {
+      const l = t.geometry.coordinates, y = r.gridNum, o = r.xOrigin, u = r.yOrigin, b = r.xUnit, x = r.yUnit, d = r.gridCache, a = N(l[0], o, b, y), s = N(l[1], u, x, y), m = d[a] ? d[a][s] ? d[a][s] : [] : [];
+      e = U(m.map((_) => e.features[_]));
+    }
+    h = J(t, e);
   }
-  return g;
+  return g && g(h), h ? tt(t, h, i) : mt(t, n, c, i);
 }
-function xt(e, t) {
-  return t[0] <= e[0] && t[1] <= e[1] && t[2] >= e[0] && t[3] >= e[1];
+function N(t, e, r, n) {
+  let c = Math.floor((t - e) / r);
+  return c >= n && (c = n - 1), c;
 }
-var D = mt;
-function Tt(e) {
-  const t = e.features;
-  for (let s = 0; s < t.length; s++) {
-    const r = t[s];
-    `${r.properties.a.index}`.substring(0, 1) === "b" && `${r.properties.b.index}`.substring(0, 1) === "b" ? t[s] = {
+function xt(t, e) {
+  let r = K(t - e[0]), n = Math.PI * 2, c;
+  for (let i = 0; i < e.length; i++) {
+    const f = (i + 1) % e.length, g = K(t - e[f]), h = Math.min(Math.abs(r), Math.abs(g));
+    r * g <= 0 && h < n && (n = h, c = i), r = g;
+  }
+  return c;
+}
+function K(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;
+}
+function _t(t, e) {
+  return e && e >= 2.00703 || Array.isArray(t[0]) ? t : t.map((r) => [
+    r.illstNodes,
+    r.mercNodes,
+    r.startEnd
+  ]);
+}
+function Bt(t) {
+  const e = t.features;
+  for (let r = 0; r < e.length; r++) {
+    const n = e[r];
+    `${n.properties.a.index}`.substring(0, 1) === "b" && `${n.properties.b.index}`.substring(0, 1) === "b" ? e[r] = {
       geometry: {
         type: "Polygon",
         coordinates: [
           [
-            r.geometry.coordinates[0][2],
-            r.geometry.coordinates[0][0],
-            r.geometry.coordinates[0][1],
-            r.geometry.coordinates[0][2]
+            n.geometry.coordinates[0][2],
+            n.geometry.coordinates[0][0],
+            n.geometry.coordinates[0][1],
+            n.geometry.coordinates[0][2]
           ]
         ]
       },
       properties: {
         a: {
-          geom: r.properties.c.geom,
-          index: r.properties.c.index
+          geom: n.properties.c.geom,
+          index: n.properties.c.index
         },
         b: {
-          geom: r.properties.a.geom,
-          index: r.properties.a.index
+          geom: n.properties.a.geom,
+          index: n.properties.a.index
         },
         c: {
-          geom: r.properties.b.geom,
-          index: r.properties.b.index
+          geom: n.properties.b.geom,
+          index: n.properties.b.index
         }
       },
       type: "Feature"
-    } : `${r.properties.c.index}`.substring(0, 1) === "b" && `${r.properties.a.index}`.substring(0, 1) === "b" && (t[s] = {
+    } : `${n.properties.c.index}`.substring(0, 1) === "b" && `${n.properties.a.index}`.substring(0, 1) === "b" && (e[r] = {
       geometry: {
         type: "Polygon",
         coordinates: [
           [
-            r.geometry.coordinates[0][1],
-            r.geometry.coordinates[0][2],
-            r.geometry.coordinates[0][0],
-            r.geometry.coordinates[0][1]
+            n.geometry.coordinates[0][1],
+            n.geometry.coordinates[0][2],
+            n.geometry.coordinates[0][0],
+            n.geometry.coordinates[0][1]
           ]
         ]
       },
       properties: {
         a: {
-          geom: r.properties.b.geom,
-          index: r.properties.b.index
+          geom: n.properties.b.geom,
+          index: n.properties.b.index
         },
         b: {
-          geom: r.properties.c.geom,
-          index: r.properties.c.index
+          geom: n.properties.c.geom,
+          index: n.properties.c.index
         },
         c: {
-          geom: r.properties.a.geom,
-          index: r.properties.a.index
+          geom: n.properties.a.geom,
+          index: n.properties.a.index
         }
       },
       type: "Feature"
     });
   }
-  return e;
+  return t;
 }
-function It(e) {
-  const t = ["a", "b", "c", "a"].map(
-    (n) => e.properties[n].geom
-  ), s = e.geometry.coordinates[0], r = e.properties, a = {
-    a: { geom: s[0], index: r.a.index },
-    b: { geom: s[1], index: r.b.index },
-    c: { geom: s[2], index: r.c.index }
+function Ct(t) {
+  const e = ["a", "b", "c", "a"].map(
+    (i) => t.properties[i].geom
+  ), r = t.geometry.coordinates[0], n = t.properties, c = {
+    a: { geom: r[0], index: n.a.index },
+    b: { geom: r[1], index: n.b.index },
+    c: { geom: r[2], index: n.c.index }
   };
-  return tt([t], a);
+  return Z([e], c);
 }
-function _t(e) {
-  const t = [0, 1, 2, 0].map((r) => e[r][0][0]), s = {
-    a: { geom: e[0][0][1], index: e[0][1] },
-    b: { geom: e[1][0][1], index: e[1][1] },
-    c: { geom: e[2][0][1], index: e[2][1] }
+function pt(t) {
+  const e = [0, 1, 2, 0].map((n) => t[n][0][0]), r = {
+    a: { geom: t[0][0][1], index: t[0][1] },
+    b: { geom: t[1][0][1], index: t[1][1] },
+    c: { geom: t[2][0][1], index: t[2][1] }
   };
-  return tt([t], s);
-}
-function W(e, t, s, r, a, n = !1, c) {
-  const d = e.map(
-    (g) => {
-      (!c || c < 2.00703) && (g = et(g));
-      const l = isFinite(g) ? t[g] : g === "c" ? r : g === "b0" ? a[0] : g === "b1" ? a[1] : g === "b2" ? a[2] : g === "b3" ? a[3] : function() {
-        const y = g.match(/e(\d+)/);
+  return Z([e], r);
+}
+function L(t, e, r, n, c, i = !1, f) {
+  const g = t.map(
+    (h) => {
+      (!f || f < 2.00703) && (h = et(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 s[o];
+          return r[o];
         }
         throw "Bad index value for indexesToTri";
       }();
-      return n ? [[l[1], l[0]], g] : [[l[0], l[1]], g];
+      return i ? [[l[1], l[0]], h] : [[l[0], l[1]], h];
     }
   );
-  return _t(d);
+  return pt(g);
 }
-function et(e) {
-  return typeof e == "number" ? e : e.replace(/^(c|e|b)(?:ent|dgeNode|box)(\d+)?$/, "$1$2");
+function et(t) {
+  return typeof t == "number" ? t : t.replace(/^(c|e|b)(?:ent|dgeNode|box)(\d+)?$/, "$1$2");
 }
-function At(e, t) {
-  return t && t >= 2.00703 || Array.isArray(e[0]) ? e : e.map((s) => [
-    s.illstNodes,
-    s.mercNodes,
-    s.startEnd
-  ]);
+const $ = 2.00703;
+function vt(t) {
+  return !!(t.version || !t.tins && t.points && t.tins_points);
 }
-function z(e, t) {
-  for (let s = 0; s < t.features.length; s++)
-    if (D(e, t.features[s]))
-      return t.features[s];
-}
-function rt(e, t, s) {
-  const r = t.geometry.coordinates[0][0], a = t.geometry.coordinates[0][1], n = t.geometry.coordinates[0][2], c = e.geometry.coordinates, d = t.properties.a.geom, g = t.properties.b.geom, l = t.properties.c.geom, y = [a[0] - r[0], a[1] - r[1]], o = [n[0] - r[0], n[1] - r[1]], u = [c[0] - r[0], c[1] - r[1]], b = [g[0] - d[0], g[1] - d[1]], x = [l[0] - d[0], l[1] - d[1]];
-  let h = (o[1] * u[0] - o[0] * u[1]) / (y[0] * o[1] - y[1] * o[0]), f = (y[0] * u[1] - y[1] * u[0]) / (y[0] * o[1] - y[1] * o[0]);
-  if (s) {
-    const i = s[t.properties.a.index], w = s[t.properties.b.index], A = s[t.properties.c.index];
-    let v;
-    if (h < 0 || f < 0 || 1 - h - f < 0) {
-      const E = h / (h + f), m = f / (h + f);
-      v = h / w / (E / w + m / A), f = f / A / (E / w + m / A);
-    } else
-      v = h / w / (h / w + f / A + (1 - h - f) / i), f = f / A / (h / w + f / A + (1 - h - f) / i);
-    h = v;
-  }
-  return [
-    h * b[0] + f * x[0] + d[0],
-    h * b[1] + f * x[1] + d[1]
-  ];
+function Mt(t) {
+  return {
+    points: t.points,
+    pointsWeightBuffer: Et(t),
+    strictStatus: Pt(t),
+    verticesParams: Ot(t),
+    centroid: St(t),
+    edges: _t(t.edges || []),
+    edgeNodes: t.edgeNodes || [],
+    tins: kt(t),
+    kinks: Tt(t.kinks_points),
+    yaxisMode: t.yaxisMode ?? "invert",
+    strictMode: t.strictMode ?? "auto",
+    vertexMode: t.vertexMode,
+    bounds: t.bounds,
+    boundsPolygon: t.boundsPolygon,
+    wh: t.wh,
+    xy: t.bounds ? t.xy : [0, 0]
+  };
 }
-function vt(e, t, s, r) {
-  const a = e.geometry.coordinates, n = s.geometry.coordinates, c = Math.atan2(a[0] - n[0], a[1] - n[1]), d = Et(c, t[0]);
-  if (d === void 0)
-    throw new Error("Unable to determine vertex index");
-  const g = t[1][d];
-  return rt(e, g.features[0], r);
-}
-function Mt(e, t, s, r, a, n, c, d) {
-  let g;
-  if (c && (g = z(e, B([c]))), !g) {
-    if (s) {
-      const l = e.geometry.coordinates, y = s.gridNum, o = s.xOrigin, u = s.yOrigin, b = s.xUnit, x = s.yUnit, h = s.gridCache, f = C(l[0], o, b, y), i = C(l[1], u, x, y), w = h[f] ? h[f][i] ? h[f][i] : [] : [];
-      t = B(w.map((A) => t.features[A]));
-    }
-    g = z(e, t);
-  }
-  return d && d(g), g ? rt(e, g, n) : vt(e, r, a, n);
+function At(t) {
+  const e = It(t), r = e.tins;
+  return {
+    compiled: e,
+    tins: r,
+    points: Nt(r),
+    strictStatus: e.strict_status,
+    pointsWeightBuffer: e.weight_buffer,
+    verticesParams: e.vertices_params,
+    centroid: e.centroid,
+    kinks: e.kinks
+  };
 }
-function C(e, t, s, r) {
-  let a = Math.floor((e - t) / s);
-  return a >= r && (a = r - 1), a;
+function Et(t) {
+  return !t.version || t.version < $ ? ["forw", "bakw"].reduce((e, r) => {
+    const n = t.weight_buffer[r];
+    return n && (e[r] = Object.keys(n).reduce((c, i) => {
+      const f = et(i);
+      return c[f] = n[i], c;
+    }, {})), e;
+  }, {}) : t.weight_buffer;
 }
-function Et(e, t) {
-  let s = K(e - t[0]), r = Math.PI * 2, a;
-  for (let n = 0; n < t.length; n++) {
-    const c = (n + 1) % t.length, d = K(e - t[c]), g = Math.min(Math.abs(s), Math.abs(d));
-    s * d <= 0 && g < r && (r = g, a = n), s = d;
-  }
-  return a;
+function Pt(t) {
+  return t.strict_status ? t.strict_status : t.kinks_points ? "strict_error" : t.tins_points.length === 2 ? "loose" : "strict";
 }
-function K(e, t = !1) {
-  const s = t ? function(r) {
-    return !(r >= 0 && r < Math.PI * 2);
-  } : function(r) {
-    return !(r > -1 * Math.PI && r <= Math.PI);
+function Ot(t) {
+  const e = {
+    forw: [t.vertices_params[0]],
+    bakw: [t.vertices_params[1]]
   };
-  for (; s(e); )
-    e = e + 2 * Math.PI * (e > 0 ? -1 : 1);
+  return e.forw[1] = Q(t, !1), e.bakw[1] = Q(t, !0), e;
+}
+function Q(t, e) {
+  return [0, 1, 2, 3].map((r) => {
+    const n = (r + 1) % 4, c = L(
+      ["c", `b${r}`, `b${n}`],
+      t.points,
+      t.edgeNodes || [],
+      t.centroid_point,
+      t.vertices_points,
+      e,
+      $
+    );
+    return U([c]);
+  });
+}
+function St(t) {
+  return {
+    forw: X(t.centroid_point[0], {
+      target: {
+        geom: t.centroid_point[1],
+        index: "c"
+      }
+    }),
+    bakw: X(t.centroid_point[1], {
+      target: {
+        geom: t.centroid_point[0],
+        index: "c"
+      }
+    })
+  };
+}
+function kt(t) {
+  const e = t.tins_points.length === 1 ? 0 : 1;
+  return {
+    forw: U(
+      t.tins_points[0].map(
+        (r) => L(
+          r,
+          t.points,
+          t.edgeNodes || [],
+          t.centroid_point,
+          t.vertices_points,
+          !1,
+          t.version
+        )
+      )
+    ),
+    bakw: U(
+      t.tins_points[e].map(
+        (r) => L(
+          r,
+          t.points,
+          t.edgeNodes || [],
+          t.centroid_point,
+          t.vertices_points,
+          !0,
+          t.version
+        )
+      )
+    )
+  };
+}
+function Tt(t) {
+  if (t)
+    return {
+      bakw: U(
+        t.map((e) => X(e))
+      )
+    };
+}
+function It(t) {
+  return JSON.parse(
+    JSON.stringify(t).replace('"cent"', '"c"').replace(/"bbox(\d+)"/g, '"b$1"')
+  );
+}
+function Nt(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;
+      typeof l == "number" && (e[l] = [g, h]);
+    });
+  }
   return e;
 }
-const Q = 2.00703, O = class O {
+const Rt = $;
+class I {
+  /**
+   * 各種モードの定数定義
+   * すべてreadonlyで、型安全性を確保
+   */
+  static VERTEX_PLAIN = "plain";
+  static VERTEX_BIRDEYE = "birdeye";
+  static MODE_STRICT = "strict";
+  static MODE_AUTO = "auto";
+  static MODE_LOOSE = "loose";
+  static STATUS_STRICT = "strict";
+  static STATUS_ERROR = "strict_error";
+  static STATUS_LOOSE = "loose";
+  static YAXIS_FOLLOW = "follow";
+  static YAXIS_INVERT = "invert";
+  points = [];
+  pointsWeightBuffer;
+  strict_status;
+  vertices_params;
+  centroid;
+  edgeNodes;
+  edges;
+  tins;
+  kinks;
+  yaxisMode = I.YAXIS_INVERT;
+  strictMode = I.MODE_AUTO;
+  vertexMode = I.VERTEX_PLAIN;
+  bounds;
+  boundsPolygon;
+  wh;
+  xy;
+  indexedTins;
+  stateFull = !1;
+  stateTriangle;
+  stateBackward;
   constructor() {
-    _(this, "points", []);
-    _(this, "pointsWeightBuffer");
-    _(this, "strict_status");
-    _(this, "vertices_params");
-    _(this, "centroid");
-    _(this, "edgeNodes");
-    _(this, "edges");
-    _(this, "tins");
-    _(this, "kinks");
-    _(this, "yaxisMode", O.YAXIS_INVERT);
-    _(this, "strictMode", O.MODE_AUTO);
-    _(this, "vertexMode", O.VERTEX_PLAIN);
-    _(this, "bounds");
-    _(this, "boundsPolygon");
-    _(this, "wh");
-    _(this, "xy");
-    _(this, "indexedTins");
-    _(this, "stateFull", !1);
-    _(this, "stateTriangle");
-    _(this, "stateBackward");
   }
   /**
    * コンパイルされた設定を適用します
@@ -360,100 +513,18 @@ const Q = 2.00703, O = class O {
    * 3. TINネットワークの再構築
    * 4. インデックスの作成
    */
-  setCompiled(t) {
-    if (t.version || !t.tins && t.points && t.tins_points) {
-      this.points = t.points, this.pointsWeightBuffer = !t.version || t.version < 2.00703 ? ["forw", "bakw"].reduce((r, a) => {
-        const n = t.weight_buffer[a];
-        return n && (r[a] = Object.keys(n).reduce((c, d) => {
-          const g = et(d);
-          return c[g] = n[d], c;
-        }, {})), r;
-      }, {}) : t.weight_buffer, t.strict_status ? this.strict_status = t.strict_status : t.kinks_points ? this.strict_status = O.STATUS_ERROR : t.tins_points.length == 2 ? this.strict_status = O.STATUS_LOOSE : this.strict_status = O.STATUS_STRICT, this.vertices_params = {
-        forw: [t.vertices_params[0]],
-        bakw: [t.vertices_params[1]]
-      }, this.vertices_params.forw[1] = [0, 1, 2, 3].map((r) => {
-        const a = (r + 1) % 4, n = W(
-          ["c", `b${r}`, `b${a}`],
-          t.points,
-          t.edgeNodes || [],
-          t.centroid_point,
-          t.vertices_points,
-          !1,
-          Q
-        );
-        return B([n]);
-      }), this.vertices_params.bakw[1] = [0, 1, 2, 3].map((r) => {
-        const a = (r + 1) % 4, n = W(
-          ["c", `b${r}`, `b${a}`],
-          t.points,
-          t.edgeNodes || [],
-          t.centroid_point,
-          t.vertices_points,
-          !0,
-          Q
-        );
-        return B([n]);
-      }), this.centroid = {
-        forw: Y(t.centroid_point[0], {
-          target: {
-            geom: t.centroid_point[1],
-            index: "c"
-          }
-        }),
-        bakw: Y(t.centroid_point[1], {
-          target: {
-            geom: t.centroid_point[0],
-            index: "c"
-          }
-        })
-      }, this.edges = At(t.edges || []), this.edgeNodes = t.edgeNodes || [];
-      const s = t.tins_points.length == 1 ? 0 : 1;
-      this.tins = {
-        forw: B(
-          t.tins_points[0].map(
-            (r) => W(
-              r,
-              t.points,
-              t.edgeNodes || [],
-              t.centroid_point,
-              t.vertices_points,
-              !1,
-              t.version
-            )
-          )
-        ),
-        bakw: B(
-          t.tins_points[s].map(
-            (r) => W(
-              r,
-              t.points,
-              t.edgeNodes || [],
-              t.centroid_point,
-              t.vertices_points,
-              !0,
-              t.version
-            )
-          )
-        )
-      }, this.addIndexedTin(), t.kinks_points && (this.kinks = {
-        bakw: B(
-          t.kinks_points.map((r) => Y(r))
-        )
-      }), t.yaxisMode ? this.yaxisMode = t.yaxisMode : this.yaxisMode = O.YAXIS_INVERT, t.vertexMode && (this.vertexMode = t.vertexMode), t.strictMode && (this.strictMode = t.strictMode), t.bounds ? (this.bounds = t.bounds, this.boundsPolygon = t.boundsPolygon, this.xy = t.xy, this.wh = t.wh) : (this.xy = [0, 0], t.wh && (this.wh = t.wh), this.bounds = void 0, this.boundsPolygon = void 0);
-    } else {
-      t = JSON.parse(
-        JSON.stringify(t).replace('"cent"', '"c"').replace(/"bbox(\d+)"/g, '"b$1"')
-      ), this.tins = t.tins, this.addIndexedTin(), this.strict_status = t.strict_status, this.pointsWeightBuffer = t.weight_buffer, this.vertices_params = t.vertices_params, this.centroid = t.centroid, this.kinks = t.kinks;
-      const s = [];
-      for (let r = 0; r < this.tins.forw.features.length; r++) {
-        const a = this.tins.forw.features[r];
-        ["a", "b", "c"].map((n, c) => {
-          const d = a.geometry.coordinates[0][c], g = a.properties[n].geom, l = a.properties[n].index;
-          typeof l == "number" && (s[l] = [d, g]);
-        });
-      }
-      this.points = s;
+  setCompiled(e) {
+    if (vt(e)) {
+      this.applyModernState(Mt(e));
+      return;
     }
+    this.applyLegacyState(At(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 ?? I.YAXIS_INVERT, this.vertexMode = e.vertexMode ?? I.VERTEX_PLAIN, this.strictMode = e.strictMode ?? I.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));
+  }
+  applyLegacyState(e) {
+    this.tins = e.tins, this.addIndexedTin(), this.strict_status = e.strictStatus, this.pointsWeightBuffer = e.pointsWeightBuffer, this.vertices_params = e.verticesParams, this.centroid = e.centroid, this.kinks = e.kinks, this.points = e.points;
   }
   /**
    * TINネットワークのインデックスを作成します
@@ -463,98 +534,98 @@ const Q = 2.00703, O = class O {
    * 含まれる三角形を記録します。
    */
   addIndexedTin() {
-    const t = this.tins, s = t.forw, r = t.bakw, a = Math.ceil(Math.sqrt(s.features.length));
-    if (a < 3) {
+    const e = this.tins, r = e.forw, n = e.bakw, c = Math.ceil(Math.sqrt(r.features.length));
+    if (c < 3) {
       this.indexedTins = void 0;
       return;
     }
-    let n = [], c = [];
-    const d = s.features.map((h) => {
-      let f = [];
-      return J(h)[0].map((i) => {
-        n.length === 0 ? n = [Array.from(i), Array.from(i)] : (i[0] < n[0][0] && (n[0][0] = i[0]), i[0] > n[1][0] && (n[1][0] = i[0]), i[1] < n[0][1] && (n[0][1] = i[1]), i[1] > n[1][1] && (n[1][1] = i[1])), f.length === 0 ? f = [Array.from(i), Array.from(i)] : (i[0] < f[0][0] && (f[0][0] = i[0]), i[0] > f[1][0] && (f[1][0] = i[0]), i[1] < f[0][1] && (f[0][1] = i[1]), i[1] > f[1][1] && (f[1][1] = i[1]));
-      }), f;
-    }), g = (n[1][0] - n[0][0]) / a, l = (n[1][1] - n[0][1]) / a, y = d.reduce(
-      (h, f, i) => {
-        const w = C(
-          f[0][0],
-          n[0][0],
-          g,
-          a
-        ), A = C(
-          f[1][0],
-          n[0][0],
-          g,
-          a
-        ), v = C(
-          f[0][1],
-          n[0][1],
+    let i = [], f = [];
+    const g = r.features.map((d) => {
+      let a = [];
+      return j(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(
+      (d, a, s) => {
+        const m = N(
+          a[0][0],
+          i[0][0],
+          h,
+          c
+        ), _ = N(
+          a[1][0],
+          i[0][0],
+          h,
+          c
+        ), p = N(
+          a[0][1],
+          i[0][1],
           l,
-          a
-        ), E = C(
-          f[1][1],
-          n[0][1],
+          c
+        ), M = N(
+          a[1][1],
+          i[0][1],
           l,
-          a
+          c
         );
-        for (let m = w; m <= A; m++) {
-          h[m] || (h[m] = []);
-          for (let M = v; M <= E; M++)
-            h[m][M] || (h[m][M] = []), h[m][M].push(i);
+        for (let w = m; w <= _; w++) {
+          d[w] || (d[w] = []);
+          for (let v = p; v <= M; v++)
+            d[w][v] || (d[w][v] = []), d[w][v].push(s);
         }
-        return h;
+        return d;
       },
       []
-    ), o = r.features.map((h) => {
-      let f = [];
-      return J(h)[0].map((i) => {
-        c.length === 0 ? c = [Array.from(i), Array.from(i)] : (i[0] < c[0][0] && (c[0][0] = i[0]), i[0] > c[1][0] && (c[1][0] = i[0]), i[1] < c[0][1] && (c[0][1] = i[1]), i[1] > c[1][1] && (c[1][1] = i[1])), f.length === 0 ? f = [Array.from(i), Array.from(i)] : (i[0] < f[0][0] && (f[0][0] = i[0]), i[0] > f[1][0] && (f[1][0] = i[0]), i[1] < f[0][1] && (f[0][1] = i[1]), i[1] > f[1][1] && (f[1][1] = i[1]));
-      }), f;
-    }), u = (c[1][0] - c[0][0]) / a, b = (c[1][1] - c[0][1]) / a, x = o.reduce(
-      (h, f, i) => {
-        const w = C(
+    ), o = n.features.map((d) => {
+      let a = [];
+      return j(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]));
+      }), a;
+    }), u = (f[1][0] - f[0][0]) / c, b = (f[1][1] - f[0][1]) / c, x = o.reduce(
+      (d, a, s) => {
+        const m = N(
+          a[0][0],
           f[0][0],
-          c[0][0],
           u,
-          a
-        ), A = C(
-          f[1][0],
-          c[0][0],
+          c
+        ), _ = N(
+          a[1][0],
+          f[0][0],
           u,
-          a
-        ), v = C(
+          c
+        ), p = N(
+          a[0][1],
           f[0][1],
-          c[0][1],
           b,
-          a
-        ), E = C(
-          f[1][1],
-          c[0][1],
+          c
+        ), M = N(
+          a[1][1],
+          f[0][1],
           b,
-          a
+          c
         );
-        for (let m = w; m <= A; m++) {
-          h[m] || (h[m] = []);
-          for (let M = v; M <= E; M++)
-            h[m][M] || (h[m][M] = []), h[m][M].push(i);
+        for (let w = m; w <= _; w++) {
+          d[w] || (d[w] = []);
+          for (let v = p; v <= M; v++)
+            d[w][v] || (d[w][v] = []), d[w][v].push(s);
         }
-        return h;
+        return d;
       },
       []
     );
     this.indexedTins = {
       forw: {
-        gridNum: a,
-        xOrigin: n[0][0],
-        yOrigin: n[0][1],
-        xUnit: g,
+        gridNum: c,
+        xOrigin: i[0][0],
+        yOrigin: i[0][1],
+        xUnit: h,
         yUnit: l,
         gridCache: y
       },
       bakw: {
-        gridNum: a,
-        xOrigin: c[0][0],
-        yOrigin: c[0][1],
+        gridNum: c,
+        xOrigin: f[0][0],
+        yOrigin: f[0][1],
         xUnit: u,
         yUnit: b,
         gridCache: x
@@ -571,46 +642,40 @@ const Q = 2.00703, O = class O {
    * 
    * @throws {Error} 逆方向変換が許可されていない状態での逆変換時
    */
-  transform(t, s, r) {
-    if (s && this.strict_status == O.STATUS_ERROR)
+  transform(e, r, n) {
+    if (r && this.strict_status == I.STATUS_ERROR)
       throw 'Backward transform is not allowed if strict_status == "strict_error"';
-    this.yaxisMode == O.YAXIS_FOLLOW && s && (t = [t[0], -1 * t[1]]);
-    const a = Y(t);
-    if (this.bounds && !s && !r && !D(a, this.boundsPolygon))
+    this.yaxisMode == I.YAXIS_FOLLOW && r && (e = [e[0], -1 * e[1]]);
+    const c = X(e);
+    if (this.bounds && !r && !n && !V(c, this.boundsPolygon))
       return !1;
-    const n = s ? this.tins.bakw : this.tins.forw, c = s ? this.indexedTins.bakw : this.indexedTins.forw, d = s ? this.vertices_params.bakw : this.vertices_params.forw, g = s ? this.centroid.bakw : this.centroid.forw, l = s ? this.pointsWeightBuffer.bakw : this.pointsWeightBuffer.forw;
+    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;
     let y, o;
-    this.stateFull && (this.stateBackward == s ? y = this.stateTriangle : (this.stateBackward = s, this.stateTriangle = void 0), o = (b) => {
+    this.stateFull && (this.stateBackward == r ? y = this.stateTriangle : (this.stateBackward = r, this.stateTriangle = void 0), o = (b) => {
       this.stateTriangle = b;
     });
-    let u = Mt(
-      a,
-      n,
+    let u = wt(
       c,
-      d,
+      i,
+      f,
       g,
+      h,
       l,
       y,
       o
     );
-    if (this.bounds && s && !r) {
-      const b = Y(u);
-      if (!D(b, this.boundsPolygon)) return !1;
-    } else this.yaxisMode == O.YAXIS_FOLLOW && !s && (u = [u[0], -1 * u[1]]);
+    if (this.bounds && r && !n) {
+      const b = X(u);
+      if (!V(b, this.boundsPolygon)) return !1;
+    } else this.yaxisMode == I.YAXIS_FOLLOW && !r && (u = [u[0], -1 * u[1]]);
     return u;
   }
-};
-/**
- * 各種モードの定数定義
- * すべてreadonlyで、型安全性を確保
- */
-_(O, "VERTEX_PLAIN", "plain"), _(O, "VERTEX_BIRDEYE", "birdeye"), _(O, "MODE_STRICT", "strict"), _(O, "MODE_AUTO", "auto"), _(O, "MODE_LOOSE", "loose"), _(O, "STATUS_STRICT", "strict"), _(O, "STATUS_ERROR", "strict_error"), _(O, "STATUS_LOOSE", "loose"), _(O, "YAXIS_FOLLOW", "follow"), _(O, "YAXIS_INVERT", "invert");
-let H = O;
+}
 export {
-  H as Transform,
-  It as counterTri,
-  Q as format_version,
-  At as normalizeEdges,
-  Tt as rotateVerticesTriangle,
-  Mt as transformArr
+  I as Transform,
+  Ct as counterTri,
+  Rt as format_version,
+  _t as normalizeEdges,
+  Bt as rotateVerticesTriangle,
+  wt as transformArr
 };