@maplat/transform 0.5.0 → 0.5.2

package/dist/maplat_transform.js

@@ -1,227 +1,217 @@
-var at = Object.defineProperty;
-var ct = (t, e, r) => e in t ? at(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var x = (t, e, r) => ct(t, typeof e != "symbol" ? e + "" : e, r);
-function tt(t, e, r = {}) {
+function ot(r, t, e = {}) {
   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;
+  return (e.id === 0 || e.id) && (n.id = e.id), e.bbox && (n.bbox = e.bbox), n.properties = t || {}, n.geometry = r, n;
 }
-function X(t, e, r = {}) {
-  if (!t)
+function X(r, t, e = {}) {
+  if (!r)
     throw new Error("coordinates is required");
-  if (!Array.isArray(t))
+  if (!Array.isArray(r))
     throw new Error("coordinates must be an Array");
-  if (t.length < 2)
+  if (r.length < 2)
     throw new Error("coordinates must be at least 2 numbers long");
-  if (!z(t[0]) || !z(t[1]))
+  if (!j(r[0]) || !j(r[1]))
     throw new Error("coordinates must contain numbers");
-  return tt({
+  return ot({
     type: "Point",
-    coordinates: t
-  }, e, r);
+    coordinates: r
+  }, t, e);
 }
-function et(t, e, r = {}) {
-  for (const c of t) {
-    if (c.length < 4)
+function D(r, t, e = {}) {
+  for (const s of r) {
+    if (s.length < 4)
       throw new Error(
         "Each LinearRing of a Polygon must have 4 or more Positions."
       );
-    if (c[c.length - 1].length !== c[0].length)
+    if (s[s.length - 1].length !== s[0].length)
       throw new Error("First and last Position are not equivalent.");
-    for (let i = 0; i < c[c.length - 1].length; i++)
-      if (c[c.length - 1][i] !== c[0][i])
+    for (let i = 0; i < s[s.length - 1].length; i++)
+      if (s[s.length - 1][i] !== s[0][i])
         throw new Error("First and last Position are not equivalent.");
   }
-  return tt({
+  return ot({
     type: "Polygon",
-    coordinates: t
-  }, e, r);
+    coordinates: r
+  }, t, e);
 }
-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 U(r, t = {}) {
+  const e = { type: "FeatureCollection" };
+  return t.id && (e.id = t.id), t.bbox && (e.bbox = t.bbox), e.features = r, e;
 }
-function z(t) {
-  return !isNaN(t) && t !== null && !Array.isArray(t);
+function j(r) {
+  return !isNaN(r) && r !== null && !Array.isArray(r);
 }
-function ut(t) {
-  if (!t)
+function lt(r) {
+  if (!r)
     throw new Error("coord is required");
-  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(t) && t.length >= 2 && !Array.isArray(t[0]) && !Array.isArray(t[1]))
-    return [...t];
+  if (!Array.isArray(r)) {
+    if (r.type === "Feature" && r.geometry !== null && r.geometry.type === "Point")
+      return [...r.geometry.coordinates];
+    if (r.type === "Point")
+      return [...r.coordinates];
+  }
+  if (Array.isArray(r) && r.length >= 2 && !Array.isArray(r[0]) && !Array.isArray(r[1]))
+    return [...r];
   throw new Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function G(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;
+function J(r) {
+  if (Array.isArray(r))
+    return r;
+  if (r.type === "Feature") {
+    if (r.geometry !== null)
+      return r.geometry.coordinates;
+  } else if (r.coordinates)
+    return r.coordinates;
   throw new Error(
     "coords must be GeoJSON Feature, Geometry Object or an Array"
   );
 }
-function ft(t) {
-  return t.type === "Feature" ? t.geometry : t;
-}
-const R = 11102230246251565e-32, P = 134217729, dt = (3 + 8 * R) * R;
-function V(t, e, r, n, c) {
-  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 && 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; )
-    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) {
-  let r = e[0];
-  for (let n = 1; n < t; n++) r += e[n];
-  return r;
+function dt(r) {
+  return r.type === "Feature" ? r.geometry : r;
+}
+const N = 11102230246251565e-32, E = 134217729, yt = (3 + 8 * N) * N;
+function Y(r, t, e, n, s) {
+  let i, o, u, d, f = t[0], m = n[0], a = 0, l = 0;
+  m > f == m > -f ? (i = f, f = t[++a]) : (i = m, m = n[++l]);
+  let g = 0;
+  if (a < r && l < e)
+    for (m > f == m > -f ? (o = f + i, u = i - (o - f), f = t[++a]) : (o = m + i, u = i - (o - m), m = n[++l]), i = o, u !== 0 && (s[g++] = u); a < r && l < e; )
+      m > f == m > -f ? (o = i + f, d = o - i, u = i - (o - d) + (f - d), f = t[++a]) : (o = i + m, d = o - i, u = i - (o - d) + (m - d), m = n[++l]), i = o, u !== 0 && (s[g++] = u);
+  for (; a < r; )
+    o = i + f, d = o - i, u = i - (o - d) + (f - d), f = t[++a], i = o, u !== 0 && (s[g++] = u);
+  for (; l < e; )
+    o = i + m, d = o - i, u = i - (o - d) + (m - d), m = n[++l], i = o, u !== 0 && (s[g++] = u);
+  return (i !== 0 || g === 0) && (s[g++] = i), g;
+}
+function mt(r, t) {
+  let e = t[0];
+  for (let n = 1; n < r; n++) e += t[n];
+  return 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), 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 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, u, g, h, l, y, o, f = t[0], b = t[1], p = e.length;
-  for (r = 0; r < p; r++) {
+function V(r) {
+  return new Float64Array(r);
+}
+const gt = (3 + 16 * N) * N, bt = (2 + 12 * N) * N, xt = (9 + 64 * N) * N * N, W = V(4), K = V(8), Q = V(12), H = V(16), A = V(4);
+function pt(r, t, e, n, s, i, o) {
+  let u, d, f, m, a, l, g, b, y, h, c, x, w, M, v, p, _, T;
+  const S = r - s, B = e - s, C = t - i, P = n - i;
+  M = S * P, l = E * S, g = l - (l - S), b = S - g, l = E * P, y = l - (l - P), h = P - y, v = b * h - (M - g * y - b * y - g * h), p = C * B, l = E * C, g = l - (l - C), b = C - g, l = E * B, y = l - (l - B), h = B - y, _ = b * h - (p - g * y - b * y - g * h), c = v - _, a = v - c, W[0] = v - (c + a) + (a - _), x = M + c, a = x - M, w = M - (x - a) + (c - a), c = w - p, a = w - c, W[1] = w - (c + a) + (a - p), T = x + c, a = T - x, W[2] = x - (T - a) + (c - a), W[3] = T;
+  let k = mt(4, W), F = bt * o;
+  if (k >= F || -k >= F || (a = r - S, u = r - (S + a) + (a - s), a = e - B, f = e - (B + a) + (a - s), a = t - C, d = t - (C + a) + (a - i), a = n - P, m = n - (P + a) + (a - i), u === 0 && d === 0 && f === 0 && m === 0) || (F = xt * o + yt * Math.abs(k), k += S * m + P * u - (C * f + B * d), k >= F || -k >= F)) return k;
+  M = u * P, l = E * u, g = l - (l - u), b = u - g, l = E * P, y = l - (l - P), h = P - y, v = b * h - (M - g * y - b * y - g * h), p = d * B, l = E * d, g = l - (l - d), b = d - g, l = E * B, y = l - (l - B), h = B - y, _ = b * h - (p - g * y - b * y - g * h), c = v - _, a = v - c, A[0] = v - (c + a) + (a - _), x = M + c, a = x - M, w = M - (x - a) + (c - a), c = w - p, a = w - c, A[1] = w - (c + a) + (a - p), T = x + c, a = T - x, A[2] = x - (T - a) + (c - a), A[3] = T;
+  const ut = Y(4, W, 4, A, K);
+  M = S * m, l = E * S, g = l - (l - S), b = S - g, l = E * m, y = l - (l - m), h = m - y, v = b * h - (M - g * y - b * y - g * h), p = C * f, l = E * C, g = l - (l - C), b = C - g, l = E * f, y = l - (l - f), h = f - y, _ = b * h - (p - g * y - b * y - g * h), c = v - _, a = v - c, A[0] = v - (c + a) + (a - _), x = M + c, a = x - M, w = M - (x - a) + (c - a), c = w - p, a = w - c, A[1] = w - (c + a) + (a - p), T = x + c, a = T - x, A[2] = x - (T - a) + (c - a), A[3] = T;
+  const ft = Y(ut, K, 4, A, Q);
+  M = u * m, l = E * u, g = l - (l - u), b = u - g, l = E * m, y = l - (l - m), h = m - y, v = b * h - (M - g * y - b * y - g * h), p = d * f, l = E * d, g = l - (l - d), b = d - g, l = E * f, y = l - (l - f), h = f - y, _ = b * h - (p - g * y - b * y - g * h), c = v - _, a = v - c, A[0] = v - (c + a) + (a - _), x = M + c, a = x - M, w = M - (x - a) + (c - a), c = w - p, a = w - c, A[1] = w - (c + a) + (a - p), T = x + c, a = T - x, A[2] = x - (T - a) + (c - a), A[3] = T;
+  const ht = Y(ft, Q, 4, A, H);
+  return H[ht - 1];
+}
+function wt(r, t, e, n, s, i) {
+  const o = (t - i) * (e - s), u = (r - s) * (n - i), d = o - u, f = Math.abs(o + u);
+  return Math.abs(d) >= gt * f ? d : -pt(r, t, e, n, s, i, f);
+}
+function Mt(r, t) {
+  var e, n, s = 0, i, o, u, d, f, m, a, l = r[0], g = r[1], b = t.length;
+  for (e = 0; e < b; e++) {
     n = 0;
-    var d = e[r], a = d.length - 1;
-    if (y = d[0], y[0] !== d[a][0] && y[1] !== d[a][1])
+    var y = t[e], h = y.length - 1;
+    if (m = y[0], m[0] !== y[h][0] && m[1] !== y[h][1])
       throw new Error("First and last coordinates in a ring must be the same");
-    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)
+    for (o = m[0] - l, u = m[1] - g, n; n < h; n++) {
+      if (a = y[n + 1], d = a[0] - l, f = a[1] - g, u === 0 && f === 0) {
+        if (d <= 0 && o >= 0 || o <= 0 && d >= 0)
           return 0;
-      } else if (l >= 0 && g <= 0 || l <= 0 && g >= 0) {
-        if (i = mt(u, h, g, l, 0, 0), i === 0)
+      } else if (f >= 0 && u <= 0 || f <= 0 && u >= 0) {
+        if (i = wt(o, d, u, f, 0, 0), i === 0)
           return 0;
-        (i > 0 && l > 0 && g <= 0 || i < 0 && l <= 0 && g > 0) && c++;
+        (i > 0 && f > 0 && u <= 0 || i < 0 && f <= 0 && u > 0) && s++;
       }
-      y = o, g = l, u = h;
+      m = a, u = f, o = d;
     }
   }
-  return c % 2 !== 0;
+  return s % 2 !== 0;
 }
-function $(t, e, r = {}) {
-  if (!t)
+function L(r, t, e = {}) {
+  if (!r)
     throw new Error("point is required");
-  if (!e)
+  if (!t)
     throw new Error("polygon is required");
-  const n = ut(t), c = ft(e), i = c.type, u = e.bbox;
-  let g = c.coordinates;
-  if (u && xt(n, u) === !1)
+  const n = lt(r), s = dt(t), i = s.type, o = t.bbox;
+  let u = s.coordinates;
+  if (o && _t(n, o) === !1)
     return !1;
-  i === "Polygon" && (g = [g]);
-  let h = !1;
-  for (var l = 0; l < g.length; ++l) {
-    const y = wt(n, g[l]);
-    if (y === 0) return !r.ignoreBoundary;
-    y && (h = !0);
-  }
-  return h;
-}
-function xt(t, e) {
-  return e[0] <= t[0] && e[1] <= t[1] && e[2] >= t[0] && e[3] >= t[1];
-}
-function L(t, e) {
-  for (let r = 0; r < e.features.length; 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], 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], 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);
-      v = d / m / (_ / m + w / M), a = a / M / (_ / m + w / M);
+  i === "Polygon" && (u = [u]);
+  let d = !1;
+  for (var f = 0; f < u.length; ++f) {
+    const m = Mt(n, u[f]);
+    if (m === 0) return !e.ignoreBoundary;
+    m && (d = !0);
+  }
+  return d;
+}
+function _t(r, t) {
+  return t[0] <= r[0] && t[1] <= r[1] && t[2] >= r[0] && t[3] >= r[1];
+}
+function $(r, t) {
+  for (let e = 0; e < t.features.length; e++)
+    if (L(r, t.features[e]))
+      return t.features[e];
+}
+function it(r, t, e) {
+  const n = t.geometry.coordinates[0][0], s = t.geometry.coordinates[0][1], i = t.geometry.coordinates[0][2], o = r.geometry.coordinates, u = t.properties.a.geom, d = t.properties.b.geom, f = t.properties.c.geom, m = [s[0] - n[0], s[1] - n[1]], a = [i[0] - n[0], i[1] - n[1]], l = [o[0] - n[0], o[1] - n[1]], g = [d[0] - u[0], d[1] - u[1]], b = [f[0] - u[0], f[1] - u[1]];
+  let y = (a[1] * l[0] - a[0] * l[1]) / (m[0] * a[1] - m[1] * a[0]), h = (m[0] * l[1] - m[1] * l[0]) / (m[0] * a[1] - m[1] * a[0]);
+  if (e) {
+    const c = e[t.properties.a.index], x = e[t.properties.b.index], w = e[t.properties.c.index];
+    let M;
+    if (y < 0 || h < 0 || 1 - y - h < 0) {
+      const v = y / (y + h), p = h / (y + h);
+      M = y / x / (v / x + p / w), h = h / w / (v / x + p / w);
     } else
-      v = d / m / (d / m + a / M + (1 - d - a) / s), a = a / M / (d / m + a / M + (1 - d - a) / s);
-    d = v;
+      M = y / x / (y / x + h / w + (1 - y - h) / c), h = h / w / (y / x + h / w + (1 - y - h) / c);
+    y = M;
   }
   return [
-    d * b[0] + a * p[0] + g[0],
-    d * b[1] + a * p[1] + g[1]
+    y * g[0] + h * b[0] + u[0],
+    y * g[1] + h * b[1] + u[1]
   ];
 }
-function pt(t, e, r, n) {
-  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)
+function vt(r, t, e, n) {
+  const s = r.geometry.coordinates, i = e.geometry.coordinates, o = Math.atan2(s[0] - i[0], s[1] - i[1]), u = Et(o, t[0]);
+  if (u === 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, u, g) {
-  let h;
-  if (u && (h = L(t, F([u]))), !h)
-    if (r) {
-      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);
+  const d = t[1][u];
+  return it(r, d.features[0], n);
+}
+function Tt(r, t, e, n, s, i, o, u) {
+  let d;
+  if (o && (d = $(r, U([o]))), !d)
+    if (e) {
+      const f = r.geometry.coordinates, m = e.gridNum, a = e.xOrigin, l = e.yOrigin, g = e.xUnit, b = e.yUnit, y = e.gridCache, h = O(f[0], a, g, m), c = O(f[1], l, b, m), x = y[h] ? y[h][c] ? y[h][c] : [] : [], w = U(x.map((M) => t.features[M]));
+      d = $(r, w);
     } 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 < 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 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 = 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) => [
-    r.illstNodes,
-    r.mercNodes,
-    r.startEnd
-  ]);
+      d = $(r, t);
+  return u && u(d), d ? it(r, d, i) : vt(r, n, s, i);
+}
+function O(r, t, e, n) {
+  let s = Math.floor((r - t) / e);
+  return s < 0 && (s = 0), s >= n && (s = n - 1), s;
+}
+function Et(r, t) {
+  let e = tt(r - t[0]), n = Math.PI * 2, s;
+  for (let i = 0; i < t.length; i++) {
+    const o = (i + 1) % t.length, u = tt(r - t[o]), d = Math.min(Math.abs(e), Math.abs(u));
+    e * u <= 0 && d < n && (n = d, s = i), e = u;
+  }
+  return s;
+}
+function tt(r, t = !1) {
+  const e = 2 * Math.PI, n = r - Math.floor(r / e) * e;
+  return t ? n : n > Math.PI ? n - e : n;
 }
-function Ft(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] = {
+function Vt(r) {
+  const t = r.features;
+  for (let e = 0; e < t.length; e++) {
+    const n = t[e];
+    `${n.properties.a.index}`.substring(0, 1) === "b" && `${n.properties.b.index}`.substring(0, 1) === "b" ? t[e] = {
       geometry: {
         type: "Polygon",
         coordinates: [
@@ -248,7 +238,7 @@ function Ft(t) {
         }
       },
       type: "Feature"
-    } : `${n.properties.c.index}`.substring(0, 1) === "b" && `${n.properties.a.index}`.substring(0, 1) === "b" && (e[r] = {
+    } : `${n.properties.c.index}`.substring(0, 1) === "b" && `${n.properties.a.index}`.substring(0, 1) === "b" && (t[e] = {
       geometry: {
         type: "Polygon",
         coordinates: [
@@ -277,406 +267,722 @@ function Ft(t) {
       type: "Feature"
     });
   }
-  return t;
+  return r;
 }
-function Wt(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 }
+function Dt(r) {
+  const t = ["a", "b", "c", "a"].map(
+    (i) => r.properties[i].geom
+  ), e = r.geometry.coordinates[0], n = r.properties, s = {
+    a: { geom: e[0], index: n.a.index },
+    b: { geom: e[1], index: n.b.index },
+    c: { geom: e[2], index: n.c.index }
   };
-  return et([e], c);
+  return D([t], s);
 }
-function _t(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] }
+function At(r) {
+  const t = [0, 1, 2, 0].map((n) => r[n][0][0]), e = {
+    a: { geom: r[0][0][1], index: r[0][1] },
+    b: { geom: r[1][0][1], index: r[1][1] },
+    c: { geom: r[2][0][1], index: r[2][1] }
   };
-  return et([e], r);
-}
-function D(t, e, r, n, c, i = !1, u) {
-  const g = t.map(
-    (h) => {
-      (!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])];
+  return D([t], e);
+}
+function G(r, t, e, n, s, i = !1, o) {
+  const u = r.map(
+    (d) => {
+      (!o || o < 2.00703) && (d = at(d));
+      const f = isFinite(d) ? t[d] : d === "c" ? n : (function() {
+        const m = d.match(/^b(\d+)$/);
+        if (m) return s[parseInt(m[1])];
+        const a = d.match(/^e(\d+)$/);
+        if (a) return e[parseInt(a[1])];
         throw new Error("Bad index value for indexesToTri");
       })();
-      return i ? [[l[1], l[0]], h] : [[l[0], l[1]], h];
+      return i ? [[f[1], f[0]], d] : [[f[0], f[1]], d];
     }
   );
-  return _t(g);
+  return At(u);
+}
+function at(r) {
+  return typeof r == "number" ? r : r.replace(/^(c|e|b)(?:ent|dgeNode|box)(\d+)?$/, "$1$2");
 }
-function nt(t) {
-  return typeof t == "number" ? t : t.replace(/^(c|e|b)(?:ent|dgeNode|box)(\d+)?$/, "$1$2");
+function It(r, t) {
+  return t && t >= 2.00703 || Array.isArray(r[0]) ? r : r.map((e) => [
+    e.illstNodes,
+    e.mercNodes,
+    e.startEnd
+  ]);
 }
-const q = 2.00703;
-function Et(t) {
-  return !!(t.version !== void 0 || !t.tins && t.points && t.tins_points);
+const Z = 2.00703;
+function St(r) {
+  return !!(r.version !== void 0 || !r.tins && r.points && r.tins_points);
 }
-function Ot(t) {
+function Bt(r) {
   return {
-    points: t.points,
-    pointsWeightBuffer: St(t),
-    strictStatus: kt(t),
-    verticesParams: Tt(t),
-    centroid: It(t),
-    edges: At(t.edges || []),
-    edgeNodes: t.edgeNodes || [],
-    tins: Nt(t),
-    kinks: Bt(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.xy ?? [0, 0]
+    points: r.points,
+    pointsWeightBuffer: Pt(r),
+    strictStatus: Ot(r),
+    verticesParams: Rt(r),
+    centroid: kt(r),
+    edges: It(r.edges || []),
+    edgeNodes: r.edgeNodes || [],
+    tins: Nt(r),
+    kinks: Xt(r.kinks_points),
+    yaxisMode: r.yaxisMode ?? "invert",
+    strictMode: r.strictMode ?? "auto",
+    vertexMode: r.vertexMode,
+    bounds: r.bounds,
+    boundsPolygon: r.boundsPolygon,
+    wh: r.wh,
+    xy: r.xy ?? [0, 0]
   };
 }
-function Pt(t) {
-  const e = Ct(t), r = e.tins;
+function Ct(r) {
+  const t = Wt(r), e = t.tins;
   return {
-    compiled: e,
-    tins: r,
-    points: Rt(r),
-    strictStatus: e.strict_status,
-    pointsWeightBuffer: e.weight_buffer,
-    verticesParams: e.vertices_params,
-    centroid: e.centroid,
-    kinks: e.kinks
+    compiled: t,
+    tins: e,
+    points: Lt(e),
+    strictStatus: t.strict_status,
+    pointsWeightBuffer: t.weight_buffer,
+    verticesParams: t.vertices_params,
+    centroid: t.centroid,
+    kinks: t.kinks
   };
 }
-function St(t) {
-  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 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 Tt(t) {
-  const e = {
-    forw: [t.vertices_params[0]],
-    bakw: [t.vertices_params[1]]
+function Pt(r) {
+  return !r.version || r.version < Z ? ["forw", "bakw"].reduce((t, e) => {
+    const n = r.weight_buffer[e];
+    return n && (t[e] = Object.keys(n).reduce((s, i) => {
+      const o = at(i);
+      return s[o] = n[i], s;
+    }, {})), t;
+  }, {}) : r.weight_buffer;
+}
+function Ot(r) {
+  return r.strict_status ? r.strict_status : r.kinks_points ? "strict_error" : r.tins_points.length === 2 ? "loose" : "strict";
+}
+function Rt(r) {
+  const t = {
+    forw: [r.vertices_params[0]],
+    bakw: [r.vertices_params[1]]
   };
-  return e.forw[1] = H(t, !1), e.bakw[1] = H(t, !0), e;
-}
-function H(t, e) {
-  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,
-      q
+  return t.forw[1] = rt(r, !1), t.bakw[1] = rt(r, !0), t;
+}
+function rt(r, t) {
+  const e = r.vertices_points.length;
+  return Array.from({ length: e }, (n, s) => {
+    const i = (s + 1) % e, o = G(
+      ["c", `b${s}`, `b${i}`],
+      r.points,
+      r.edgeNodes || [],
+      r.centroid_point,
+      r.vertices_points,
+      t,
+      Z
     );
-    return F([u]);
+    return U([o]);
   });
 }
-function It(t) {
+function kt(r) {
   return {
-    forw: X(t.centroid_point[0], {
+    forw: X(r.centroid_point[0], {
       target: {
-        geom: t.centroid_point[1],
+        geom: r.centroid_point[1],
         index: "c"
       }
     }),
-    bakw: X(t.centroid_point[1], {
+    bakw: X(r.centroid_point[1], {
       target: {
-        geom: t.centroid_point[0],
+        geom: r.centroid_point[0],
         index: "c"
       }
     })
   };
 }
-function Nt(t) {
-  const e = t.tins_points.length === 1 ? 0 : 1;
+function Nt(r) {
+  const t = r.tins_points.length === 1 ? 0 : 1;
   return {
-    forw: F(
-      t.tins_points[0].map(
-        (r) => D(
-          r,
-          t.points,
-          t.edgeNodes || [],
-          t.centroid_point,
-          t.vertices_points,
+    forw: U(
+      r.tins_points[0].map(
+        (e) => G(
+          e,
+          r.points,
+          r.edgeNodes || [],
+          r.centroid_point,
+          r.vertices_points,
           !1,
-          t.version
+          r.version
         )
       )
     ),
-    bakw: F(
-      t.tins_points[e].map(
-        (r) => D(
-          r,
-          t.points,
-          t.edgeNodes || [],
-          t.centroid_point,
-          t.vertices_points,
+    bakw: U(
+      r.tins_points[t].map(
+        (e) => G(
+          e,
+          r.points,
+          r.edgeNodes || [],
+          r.centroid_point,
+          r.vertices_points,
           !0,
-          t.version
+          r.version
         )
       )
     )
   };
 }
-function Bt(t) {
-  if (t)
+function Xt(r) {
+  if (r)
     return {
-      bakw: F(
-        t.map((e) => X(e))
+      bakw: U(
+        r.map((t) => X(t))
       )
     };
 }
-function Ct(t) {
+function Wt(r) {
   return JSON.parse(
-    JSON.stringify(t).replace('"cent"', '"c"').replace(/"bbox(\d+)"/g, '"b$1"')
+    JSON.stringify(r).replace('"cent"', '"c"').replace(/"bbox(\d+)"/g, '"b$1"')
   );
 }
-function Rt(t) {
-  const e = [], r = t.forw.features;
-  for (let n = 0; n < r.length; n++) {
-    const c = r[n];
-    ["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]);
+function Lt(r) {
+  const t = [], e = r.forw.features;
+  for (let n = 0; n < e.length; n++) {
+    const s = e[n];
+    ["a", "b", "c"].forEach((i, o) => {
+      const u = s.geometry.coordinates[0][o], d = s.properties[i].geom, f = s.properties[i].index;
+      typeof f == "number" && (t[f] = [u, d]);
     });
   }
-  return e;
+  return t;
 }
-const Xt = q, E = class E {
+const Yt = Z;
+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;
+  /**
+   * Optional properties for MaplatCore extension
+   * These properties allow consuming applications to extend Transform instances
+   * with additional metadata without requiring Module Augmentation
+   */
+  /** Layer priority for rendering order */
+  priority;
+  /** Layer importance for display decisions */
+  importance;
+  /** Bounds in XY (source) coordinate system */
+  xyBounds;
+  /** Bounds in Mercator (Web Mercator) coordinate system */
+  mercBounds;
   constructor() {
-    x(this, "points", []);
-    x(this, "pointsWeightBuffer");
-    x(this, "strict_status");
-    x(this, "vertices_params");
-    x(this, "centroid");
-    x(this, "edgeNodes");
-    x(this, "edges");
-    x(this, "tins");
-    x(this, "kinks");
-    x(this, "yaxisMode", E.YAXIS_INVERT);
-    x(this, "strictMode", E.MODE_AUTO);
-    x(this, "vertexMode", E.VERTEX_PLAIN);
-    x(this, "bounds");
-    x(this, "boundsPolygon");
-    x(this, "wh");
-    x(this, "xy");
-    x(this, "indexedTins");
-    x(this, "stateFull", !1);
-    x(this, "stateTriangle");
-    x(this, "stateBackward");
-    /**
-     * Optional properties for MaplatCore extension
-     * These properties allow consuming applications to extend Transform instances
-     * with additional metadata without requiring Module Augmentation
-     */
-    /** Layer priority for rendering order */
-    x(this, "priority");
-    /** Layer importance for display decisions */
-    x(this, "importance");
-    /** Bounds in XY (source) coordinate system */
-    x(this, "xyBounds");
-    /** Bounds in Mercator (Web Mercator) coordinate system */
-    x(this, "mercBounds");
   }
   /**
    * コンパイルされた設定を適用します
-   * 
+   *
    * @param compiled - コンパイルされた設定オブジェクト
    * @returns 変換に必要な主要なオブジェクトのセット
-   * 
+   *
    * 以下の処理を行います：
    * 1. バージョンに応じた設定の解釈
    * 2. 各種パラメータの復元
    * 3. TINネットワークの再構築
    * 4. インデックスの作成
    */
-  setCompiled(e) {
-    if (Et(e)) {
-      this.applyModernState(Ot(e));
+  setCompiled(t) {
+    if (St(t)) {
+      this.applyModernState(Bt(t));
       return;
     }
-    this.applyLegacyState(Pt(e));
+    this.applyLegacyState(Ct(t));
   }
-  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));
+  applyModernState(t) {
+    this.points = t.points, this.pointsWeightBuffer = t.pointsWeightBuffer, this.strict_status = t.strictStatus, this.vertices_params = t.verticesParams, this.centroid = t.centroid, this.edges = t.edges, this.edgeNodes = t.edgeNodes || [], this.tins = t.tins, this.addIndexedTin(), this.kinks = t.kinks, this.yaxisMode = t.yaxisMode ?? I.YAXIS_INVERT, this.vertexMode = t.vertexMode ?? I.VERTEX_PLAIN, this.strictMode = t.strictMode ?? I.MODE_AUTO, t.bounds ? (this.bounds = t.bounds, this.boundsPolygon = t.boundsPolygon, this.xy = t.xy, this.wh = t.wh) : (this.bounds = void 0, this.boundsPolygon = void 0, this.xy = t.xy ?? [0, 0], t.wh && (this.wh = t.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;
+  applyLegacyState(t) {
+    this.tins = t.tins, this.addIndexedTin(), this.strict_status = t.strictStatus, this.pointsWeightBuffer = t.pointsWeightBuffer, this.vertices_params = t.verticesParams, this.centroid = t.centroid, this.kinks = t.kinks, this.points = t.points;
   }
   /**
    * TINネットワークのインデックスを作成します
-   * 
+   *
    * インデックスは変換処理を高速化するために使用されます。
    * グリッド形式のインデックスを作成し、各グリッドに
    * 含まれる三角形を記録します。
    */
   addIndexedTin() {
-    const e = this.tins, r = e.forw, n = e.bakw, c = Math.ceil(Math.sqrt(r.features.length));
-    if (c < 3) {
+    const t = this.tins, e = t.forw, n = t.bakw, s = Math.ceil(Math.sqrt(e.features.length));
+    if (s < 3) {
       this.indexedTins = void 0;
       return;
     }
-    let i = [], u = [];
-    const g = r.features.map((d) => {
-      let a = [];
-      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(
-      (d, a, s) => {
-        const m = B(
-          a[0][0],
-          i[0][0],
-          h,
-          c
-        ), M = B(
-          a[1][0],
-          i[0][0],
-          h,
-          c
-        ), v = B(
-          a[0][1],
-          i[0][1],
-          l,
-          c
-        ), _ = B(
-          a[1][1],
-          i[0][1],
-          l,
-          c
-        );
-        for (let w = m; w <= M; w++) {
-          d[w] || (d[w] = []);
-          for (let A = v; A <= _; A++)
-            d[w][A] || (d[w][A] = []), d[w][A].push(s);
+    let i = [], o = [];
+    const u = e.features.map((y) => {
+      let h = [];
+      return J(y)[0].map((c) => {
+        i.length === 0 ? i = [Array.from(c), Array.from(c)] : (c[0] < i[0][0] && (i[0][0] = c[0]), c[0] > i[1][0] && (i[1][0] = c[0]), c[1] < i[0][1] && (i[0][1] = c[1]), c[1] > i[1][1] && (i[1][1] = c[1])), h.length === 0 ? h = [Array.from(c), Array.from(c)] : (c[0] < h[0][0] && (h[0][0] = c[0]), c[0] > h[1][0] && (h[1][0] = c[0]), c[1] < h[0][1] && (h[0][1] = c[1]), c[1] > h[1][1] && (h[1][1] = c[1]));
+      }), h;
+    }), d = (i[1][0] - i[0][0]) / s, f = (i[1][1] - i[0][1]) / s, m = u.reduce(
+      (y, h, c) => {
+        const x = O(h[0][0], i[0][0], d, s), w = O(h[1][0], i[0][0], d, s), M = O(h[0][1], i[0][1], f, s), v = O(h[1][1], i[0][1], f, s);
+        for (let p = x; p <= w; p++) {
+          y[p] || (y[p] = []);
+          for (let _ = M; _ <= v; _++)
+            y[p][_] || (y[p][_] = []), y[p][_].push(c);
         }
-        return d;
+        return y;
       },
       []
-    ), o = n.features.map((d) => {
-      let a = [];
-      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;
-    }), 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],
-          u[0][0],
-          f,
-          c
-        ), M = B(
-          a[1][0],
-          u[0][0],
-          f,
-          c
-        ), v = B(
-          a[0][1],
-          u[0][1],
-          b,
-          c
-        ), _ = B(
-          a[1][1],
-          u[0][1],
-          b,
-          c
-        );
-        for (let w = m; w <= M; w++) {
-          d[w] || (d[w] = []);
-          for (let A = v; A <= _; A++)
-            d[w][A] || (d[w][A] = []), d[w][A].push(s);
+    ), a = n.features.map((y) => {
+      let h = [];
+      return J(y)[0].map((c) => {
+        o.length === 0 ? o = [Array.from(c), Array.from(c)] : (c[0] < o[0][0] && (o[0][0] = c[0]), c[0] > o[1][0] && (o[1][0] = c[0]), c[1] < o[0][1] && (o[0][1] = c[1]), c[1] > o[1][1] && (o[1][1] = c[1])), h.length === 0 ? h = [Array.from(c), Array.from(c)] : (c[0] < h[0][0] && (h[0][0] = c[0]), c[0] > h[1][0] && (h[1][0] = c[0]), c[1] < h[0][1] && (h[0][1] = c[1]), c[1] > h[1][1] && (h[1][1] = c[1]));
+      }), h;
+    }), l = (o[1][0] - o[0][0]) / s, g = (o[1][1] - o[0][1]) / s, b = a.reduce(
+      (y, h, c) => {
+        const x = O(h[0][0], o[0][0], l, s), w = O(h[1][0], o[0][0], l, s), M = O(h[0][1], o[0][1], g, s), v = O(h[1][1], o[0][1], g, s);
+        for (let p = x; p <= w; p++) {
+          y[p] || (y[p] = []);
+          for (let _ = M; _ <= v; _++)
+            y[p][_] || (y[p][_] = []), y[p][_].push(c);
         }
-        return d;
+        return y;
       },
       []
     );
     this.indexedTins = {
       forw: {
-        gridNum: c,
+        gridNum: s,
         xOrigin: i[0][0],
         yOrigin: i[0][1],
-        xUnit: h,
-        yUnit: l,
-        gridCache: y
+        xUnit: d,
+        yUnit: f,
+        gridCache: m
       },
       bakw: {
-        gridNum: c,
-        xOrigin: u[0][0],
-        yOrigin: u[0][1],
-        xUnit: f,
-        yUnit: b,
-        gridCache: p
+        gridNum: s,
+        xOrigin: o[0][0],
+        yOrigin: o[0][1],
+        xUnit: l,
+        yUnit: g,
+        gridCache: b
       }
     };
   }
   /**
    * 座標変換を実行します
-   * 
+   *
    * @param apoint - 変換する座標
    * @param backward - 逆方向の変換かどうか
    * @param ignoreBounds - 境界チェックを無視するかどうか
    * @returns 変換後の座標、または境界外の場合はfalse
-   * 
+   *
    * @throws {Error} 逆方向変換が許可されていない状態での逆変換時
    */
-  transform(e, r, n) {
+  transform(t, e, n) {
     if (!this.tins)
       throw new Error("setCompiled() must be called before transform()");
-    if (r && this.strict_status == E.STATUS_ERROR)
+    if (e && this.strict_status == I.STATUS_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 = X(e);
-    if (this.bounds && !r && !n && !$(c, this.boundsPolygon))
+    this.yaxisMode == I.YAXIS_FOLLOW && e && (t = [t[0], -1 * t[1]]);
+    const s = X(t);
+    if (this.bounds && !e && !n && !L(s, this.boundsPolygon))
       return !1;
-    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;
+    const i = e ? this.tins.bakw : this.tins.forw, o = e ? this.indexedTins.bakw : this.indexedTins.forw, u = e ? this.vertices_params.bakw : this.vertices_params.forw, d = e ? this.centroid.bakw : this.centroid.forw, f = e ? this.pointsWeightBuffer.bakw : this.pointsWeightBuffer.forw;
+    let m, a;
+    this.stateFull && (this.stateBackward == e ? m = this.stateTriangle : (this.stateBackward = e, this.stateTriangle = void 0), a = (g) => {
+      this.stateTriangle = g;
     });
-    let f = vt(
-      c,
+    let l = Tt(
+      s,
       i,
+      o,
       u,
-      g,
-      h,
-      l,
-      y,
-      o
+      d,
+      f,
+      m,
+      a
     );
-    if (this.bounds && r && !n) {
-      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;
+    if (this.bounds && e && !n) {
+      const g = X(l);
+      if (!L(g, this.boundsPolygon)) return !1;
+    } else this.yaxisMode == I.YAXIS_FOLLOW && !e && (l = [l[0], -1 * l[1]]);
+    return l;
   }
-};
-/**
- * 各種モードの定数定義
- * すべてreadonlyで、型安全性を確保
- */
-x(E, "VERTEX_PLAIN", "plain"), x(E, "VERTEX_BIRDEYE", "birdeye"), x(E, "MODE_STRICT", "strict"), x(E, "MODE_AUTO", "auto"), x(E, "MODE_LOOSE", "loose"), x(E, "STATUS_STRICT", "strict"), x(E, "STATUS_ERROR", "strict_error"), x(E, "STATUS_LOOSE", "loose"), x(E, "YAXIS_FOLLOW", "follow"), x(E, "YAXIS_INVERT", "invert");
-let Z = E;
+}
+const R = 20037508342789244e-9, Ut = [
+  [0, 0],
+  [0, 1],
+  [1, 0],
+  [0, -1],
+  [-1, 0]
+];
+function ct(r, t) {
+  return Math.floor(Math.min(r[0], r[1]) / 4) * R / 128 / Math.pow(2, t);
+}
+function Ft(r, t) {
+  const e = [];
+  for (let n = 0; n < r.length; n++) {
+    const s = r[n], i = s[0] * Math.cos(t) - s[1] * Math.sin(t), o = s[0] * Math.sin(t) + s[1] * Math.cos(t);
+    e.push([i, o]);
+  }
+  return e;
+}
+function et(r, t, e, n) {
+  const s = ct(n, t);
+  return Ft(Ut, e).map((u) => [
+    u[0] * s + r[0],
+    u[1] * s + r[1]
+  ]);
+}
+function nt(r, t) {
+  const e = r[0], s = r.slice(1, 5).map((g) => [
+    g[0] - e[0],
+    g[1] - e[1]
+  ]), i = [
+    [0, 1],
+    [1, 0],
+    [0, -1],
+    [-1, 0]
+  ];
+  let o = 0, u = 0, d = 0;
+  for (let g = 0; g < 4; g++) {
+    const b = s[g], y = i[g], h = Math.sqrt(Math.pow(b[0], 2) + Math.pow(b[1], 2));
+    o += h;
+    const c = b[0] * y[1] - b[1] * y[0], x = Math.acos(
+      (b[0] * y[0] + b[1] * y[1]) / h
+    ), w = c > 0 ? -1 * x : x;
+    u += Math.cos(w), d += Math.sin(w);
+  }
+  const f = o / 4, m = Math.atan2(d, u), a = Math.floor(Math.min(t[0], t[1]) / 4), l = Math.log(a * R / 128 / f) / Math.log(2);
+  return { center: e, zoom: l, rotation: m };
+}
+function q(r, t) {
+  const e = r[0] * (2 * R) / t - R, n = -1 * (r[1] * (2 * R) / t - R);
+  return [e, n];
+}
+function st(r, t) {
+  const e = (r[0] + R) * t / (2 * R), n = (-r[1] + R) * t / (2 * R);
+  return [e, n];
+}
+const z = 256;
+class $t {
+  mainTin = null;
+  subTins = [];
+  _maxxy = 0;
+  // ─── 初期化 ────────────────────────────────────────────────────────────────
+  /**
+   * 地図データ（コンパイル済み TIN + sub_maps）をロードする
+   *
+   * @param mapData - メイン TIN と sub_maps の情報
+   */
+  setMapData(t) {
+    const e = new I();
+    if (e.setCompiled(t.compiled), this.mainTin = e, t.maxZoom !== void 0)
+      this._maxxy = Math.pow(2, t.maxZoom) * z;
+    else if (t.compiled.wh) {
+      const n = Math.max(t.compiled.wh[0], t.compiled.wh[1]), s = Math.ceil(Math.log2(n / z));
+      this._maxxy = Math.pow(2, s) * z;
+    }
+    if (this.subTins = [], t.sub_maps)
+      for (const n of t.sub_maps) {
+        const s = new I();
+        s.setCompiled(n.compiled);
+        const i = n.bounds ?? n.compiled.bounds;
+        if (!i)
+          throw new Error(
+            "SubMapData must have bounds or compiled.bounds to create xyBounds polygon"
+          );
+        const o = [...i, i[0]], u = o.map((d) => {
+          const f = s.transform(d, !1);
+          if (!f) throw new Error("Failed to transform sub-map bounds to mercator");
+          return f;
+        });
+        this.subTins.push({
+          tin: s,
+          priority: n.priority,
+          importance: n.importance,
+          xyBounds: D([o]),
+          mercBounds: D([u])
+        });
+      }
+  }
+  // ─── 処理2: submap TIN 選択付き変換 ───────────────────────────────────────
+  /**
+   * ピクセル座標 → メルカトル座標（最適レイヤー選択）
+   *
+   * @param xy - ピクセル座標 [x, y]
+   * @returns メルカトル座標、または範囲外の場合は false
+   */
+  xy2Merc(t) {
+    const e = this.xy2MercWithLayer(t);
+    return e ? e[1] : !1;
+  }
+  /**
+   * メルカトル座標 → ピクセル座標（最適レイヤー選択）
+   *
+   * @param merc - メルカトル座標 [x, y]
+   * @returns ピクセル座標、または範囲外の場合は false
+   */
+  merc2Xy(t) {
+    const e = this.merc2XyWithLayer(t), n = e[0] || e[1];
+    return n ? n[1] : !1;
+  }
+  /**
+   * ピクセル座標 → メルカトル座標（レイヤーID付き）
+   * histmap_tin.ts xy2MercAsync_returnLayer() の同期版
+   *
+   * @param xy - ピクセル座標 [x, y]
+   * @returns [レイヤーインデックス, メルカトル座標] または false
+   */
+  xy2MercWithLayer(t) {
+    this._assertMapData();
+    const e = this._getTinsSortedByPriority();
+    for (let n = 0; n < e.length; n++) {
+      const { index: s, isMain: i } = e[n];
+      if (i || L(X(t), this.subTins[s - 1].xyBounds)) {
+        const o = this._transformByIndex(t, s, !1);
+        if (o === !1) continue;
+        return [s, o];
+      }
+    }
+    return !1;
+  }
+  /**
+   * メルカトル座標 → ピクセル座標（複数レイヤー結果）
+   * histmap_tin.ts merc2XyAsync_returnLayer() の同期版
+   *
+   * 現在は MaplatCore の仕様に合わせ、最大2レイヤーまで返す。
+   * 3レイヤー以上返したい場合は、下記の .slice(0, 2) および .filter(i < 2) の
+   * 上限値を増やすか、引数で上限を指定できるようにすること。
+   *
+   * @param merc - メルカトル座標 [x, y]
+   * @returns 最大2要素の配列。各要素は [レイヤーインデックス, ピクセル座標] または undefined
+   */
+  merc2XyWithLayer(t) {
+    return this._assertMapData(), this._getAllTinsWithIndex().map(({ index: o, tin: u, isMain: d }) => {
+      const f = this._transformByIndex(t, o, !0);
+      return f === !1 ? [u, o] : d || L(X(f), this.subTins[o - 1].xyBounds) ? [u, o, f] : [u, o];
+    }).sort((o, u) => {
+      const d = o[0].priority ?? 0, f = u[0].priority ?? 0;
+      return d < f ? 1 : -1;
+    }).reduce(
+      (o, u, d, f) => {
+        const m = u[0], a = u[1], l = u[2];
+        if (!l) return o;
+        for (let g = 0; g < d; g++) {
+          const b = f[g][1], y = b === 0;
+          if (f[g][2] && (y || L(X(l), this.subTins[b - 1].xyBounds)))
+            if (o.length) {
+              const h = !o[0], c = h ? o[1][2] : o[0][2], x = m.importance ?? 0, w = c.importance ?? 0;
+              return h ? x < w ? o : [void 0, [a, l, m]] : [...o.filter(
+                (p) => p !== void 0
+              ), [a, l, m]].sort(
+                (p, _) => (p[2].importance ?? 0) < (_[2].importance ?? 0) ? 1 : -1
+              ).slice(0, 2);
+            } else
+              return [[a, l, m]];
+        }
+        return !o.length || !o[0] ? [[a, l, m]] : (o.push([a, l, m]), o.sort((g, b) => {
+          const y = g[2].importance ?? 0, h = b[2].importance ?? 0;
+          return y < h ? 1 : -1;
+        }).filter((g, b) => b < 2));
+      },
+      []
+    ).map((o) => {
+      if (o)
+        return [o[0], o[1]];
+    });
+  }
+  /**
+   * メルカトル5点 → システム座標（複数レイヤー）
+   * histmap_tin.ts mercs2SysCoordsAsync_multiLayer() の同期版
+   *
+   * @param mercs - 5点のメルカトル座標配列（中心＋上下左右）
+   * @returns 各レイヤーのシステム座標配列（または undefined）
+   */
+  mercs2SysCoords(t) {
+    this._assertMapData();
+    const e = this.merc2XyWithLayer(t[0]);
+    let n = !1;
+    return e.map((s, i) => {
+      if (!s) {
+        n = !0;
+        return;
+      }
+      const o = s[0], u = s[1];
+      return i !== 0 && !n ? [this.xy2SysCoordInternal(u)] : t.map((f, m) => m === 0 ? u : this._transformByIndex(f, o, !0)).map((f) => this.xy2SysCoordInternal(f));
+    });
+  }
+  // ─── 処理3: ビューポート変換 ───────────────────────────────────────────────
+  /**
+   * ビューポート → TIN 適用後メルカトル5点
+   * histmap_tin.ts viewpoint2MercsAsync() の同期版
+   *
+   * @param viewpoint - ビューポート（center, zoom, rotation）
+   * @param size - 画面サイズ [width, height]
+   * @returns TIN 変換後のメルカトル5点
+   */
+  viewpoint2Mercs(t, e) {
+    this._assertMapData(), this._assertMaxxy();
+    const s = et(t.center, t.zoom, t.rotation, e).map((f) => st(f, this._maxxy)), i = this.xy2MercWithLayer(s[0]);
+    if (!i) throw new Error("viewpoint2Mercs: center point is out of bounds");
+    const o = i[0], u = i[1];
+    return s.map((f, m) => {
+      if (m === 0) return u;
+      const a = this._transformByIndex(f, o, !1);
+      if (a === !1) throw new Error(`viewpoint2Mercs: point ${m} is out of bounds`);
+      return a;
+    });
+  }
+  /**
+   * TIN 適用後メルカトル5点 → ビューポート
+   * histmap_tin.ts mercs2ViewpointAsync() の同期版
+   *
+   * @param mercs - TIN 変換後のメルカトル5点
+   * @param size - 画面サイズ [width, height]
+   * @returns ビューポート（center, zoom, rotation）
+   */
+  mercs2Viewpoint(t, e) {
+    this._assertMapData(), this._assertMaxxy();
+    const n = this.merc2XyWithLayer(t[0]), s = n[0] || n[1];
+    if (!s) throw new Error("mercs2Viewpoint: center point is out of bounds");
+    const i = s[0], o = s[1], d = t.map((f, m) => {
+      if (m === 0) return o;
+      const a = this._transformByIndex(f, i, !0);
+      if (a === !1) throw new Error(`mercs2Viewpoint: point ${m} is out of bounds`);
+      return a;
+    }).map((f) => q(f, this._maxxy));
+    return nt(d, e);
+  }
+  // ─── ユーティリティ（静的メソッド）────────────────────────────────────────
+  /** zoom2Radius の静的ラッパー */
+  static zoom2Radius(t, e) {
+    return ct(t, e);
+  }
+  /** mercViewpoint2Mercs の静的ラッパー */
+  static mercViewpoint2Mercs(t, e, n, s) {
+    return et(t, e, n, s);
+  }
+  /** mercs2MercViewpoint の静的ラッパー */
+  static mercs2MercViewpoint(t, e) {
+    return nt(t, e);
+  }
+  /** xy2SysCoord の静的ラッパー */
+  static xy2SysCoord(t, e) {
+    return q(t, e);
+  }
+  /** sysCoord2Xy の静的ラッパー */
+  static sysCoord2Xy(t, e) {
+    return st(t, e);
+  }
+  // ─── 内部ヘルパー ──────────────────────────────────────────────────────────
+  _assertMapData() {
+    if (!this.mainTin)
+      throw new Error("setMapData() must be called before transformation");
+  }
+  _assertMaxxy() {
+    if (this._maxxy === 0)
+      throw new Error(
+        "MapData.maxZoom or compiled.wh must be set for viewpoint conversion (xy2SysCoord / sysCoord2Xy)"
+      );
+  }
+  /**
+   * レイヤーインデックスに対応する Transform インスタンスを返す（三角網描画などの用途）
+   *
+   * @param idx - 0 = メイン TIN、1以上 = sub_maps[idx-1]
+   * @returns 対応する Transform、または範囲外の場合は null
+   */
+  getLayerTransform(t) {
+    if (t === 0) return this.mainTin;
+    const e = this.subTins[t - 1];
+    return e ? e.tin : null;
+  }
+  /** レイヤー数を返す（メイン + sub 数） */
+  get layerCount() {
+    return 1 + this.subTins.length;
+  }
+  /**
+   * viewpoint 変換に使用する最大ピクセル幅（2^maxZoom × 256）
+   * stateToViewpoint / viewpointToState で zoom ↔ scale 変換に使用する
+   * zoom = log2(scale × maxxy / 256) の関係
+   */
+  get maxxy() {
+    return this._maxxy;
+  }
+  /** priority 降順でソートした [index, tin, isMain] の配列を返す */
+  _getTinsSortedByPriority() {
+    return this._getAllTinsWithIndex().sort((e, n) => {
+      const s = e.tin.priority ?? 0, i = n.tin.priority ?? 0;
+      return s < i ? 1 : -1;
+    });
+  }
+  /** メイン TIN + 全 sub TIN を index 付きで返す */
+  _getAllTinsWithIndex() {
+    const t = [
+      { index: 0, tin: this.mainTin, isMain: !0 }
+    ];
+    return this.subTins.forEach((e, n) => {
+      e.tin.priority = e.priority, e.tin.importance = e.importance, t.push({ index: n + 1, tin: e.tin, isMain: !1 });
+    }), t;
+  }
+  /**
+   * 指定レイヤーインデックスで TIN 変換を実行する
+   * index 0 → mainTin, index 1..n → subTins[index-1]
+   */
+  _transformByIndex(t, e, n) {
+    if (e === 0)
+      return this.mainTin.transform(t, n);
+    const s = this.subTins[e - 1];
+    return s ? s.tin.transform(t, n, !0) : !1;
+  }
+  /** 内部用 xy2SysCoord（_maxxy を使用） */
+  xy2SysCoordInternal(t) {
+    return q(t, this._maxxy);
+  }
+}
 export {
-  Z as Transform,
-  Wt as counterTri,
-  Xt as format_version,
-  At as normalizeEdges,
-  Ft as rotateVerticesTriangle,
-  vt as transformArr
+  Ut as MERC_CROSSMATRIX,
+  R as MERC_MAX,
+  $t as MapTransform,
+  I as Transform,
+  Dt as counterTri,
+  Yt as format_version,
+  et as mercViewpoint2Mercs,
+  nt as mercs2MercViewpoint,
+  It as normalizeEdges,
+  Ft as rotateMatrix,
+  Vt as rotateVerticesTriangle,
+  st as sysCoord2Xy,
+  Tt as transformArr,
+  q as xy2SysCoord,
+  ct as zoom2Radius
 };