@3clear/basegis 0.1.7 → 0.1.8

package/README.md

@@ -4526,8 +4526,10 @@ await rasterContour.loadGrid({
 | `thresholds/levels` | `number[]` | 三选一 | - | 显式等值线级别，仅保留实际值域内的值。 |
 | `interval/contourInterval` | `number` | 三选一 | - | 固定等值距。 |
 | `thresholdCount/levelCount` | `number` | 三选一 | `12` | 自动均分级别数量，范围 1~100。 |
-| `smooth` | `boolean` | 否 | `true` | 是否平滑等值线。 |
+| `smooth` | `boolean` | 否 | `true` | 是否使用 d3 的边上线性插值定位等值点；与高斯滤波、Chaikin 开关独立。 |
 | `smoothingIterations` | `number` | 否 | `0` | Chaikin 补点平滑次数，范围 0~3；气象格点通常取 1~2，次数越高，点数越多。 |
+| `gridSmoothing` | `object` | 否 | 见下表 | 提线前的可分离高斯滤波；默认关闭，保留原始网格与 NoData。 |
+| `wrapLongitude` | `boolean` | 否 | `false` | 对经度跨度为 360°（容差 0.001°）的栅格启用周期取样、补列、完整线拼接和平滑；区域数据不启用。 |
 | `excludeBoundary` | `boolean` | 否 | `true` | 去掉 d3 面边界中贴着栅格四边的伪矩形线。 |
 | `maxCells` | `number` | 否 | `1000000` | 超过该像元数时先等比例抽样，避免大图阻塞页面。 |
 | `minimumLinePoints` | `number` | 否 | `3` | 最短线点数，用于过滤栅格四角的两点补边。 |
@@ -4537,24 +4539,60 @@ await rasterContour.loadGrid({
 
 级别选择优先级为 `thresholds` → `interval` → `thresholdCount`。显式传入 `thresholds` 时，只保留实际值域内的级别。
 
+### 格点平滑与全球接缝
+
+| `gridSmoothing` 参数 | 默认值 | 说明 |
+| --- | --- | --- |
+| `enabled` | `false` | 显式开启格点高斯滤波。 |
+| `radius` | `2` | 邻域半径，以 `maxCells` 降采样后的格点为单位，取整并限制为 0~6；0 跳过滤波。 |
+| `sigma` | `null` | 正数；省略、null 或非正数时自动取 `Math.max(radius / 2, 0.8)`，单位同样为格点。 |
+| `passes` | `1` | 水平和垂直方向各处理一次为一轮，取整并限制为 1~3 轮。 |
+
+```js
+await rasterContour.loadGrid({
+  values, width, height, area,
+  interval: 2,
+  maxCells: 360000,
+  gridSmoothing: { enabled: true, radius: 2, sigma: null, passes: 1 },
+  smooth: true,
+  smoothingIterations: 1,
+  wrapLongitude: true,
+})
+
+// 嵌套参数按字段合并，保留 enabled / passes；sigma 为 null 时随半径自动调整。
+await rasterContour.update({ gridSmoothing: { radius: 3 } })
+// 关闭额外平滑，仍保留等值点线性插值和全球接缝连续性。
+await rasterContour.update({ gridSmoothing: { enabled: false }, smoothingIterations: 0 })
+// 标签、样式和渲染简化更新直接复用已有等值线。
+await rasterContour.update({ showLabel: false, smoothFactor: 0.15 })
+```
+
+处理顺序是原始网格 → 降采样 → 高斯滤波 → 全球补列（可选）→ d3 提线 → 拼接完整周期线（可选）→ Chaikin → 短线过滤 → 裁切和坐标取整。周期线在拼接前保留精度，避免低 `coordinatePrecision` 合并不同接缝端点；只按完整曲线判断 `minimumLinePoints`，切回边界后的片段允许小于该长度。源数据为 0°~360° 且需要左右半幅交换时，继续使用 `isSplit: true`。
+
+滤波跳过无效邻点并重新归一化权重，原始 NoData 中心保持为空。`getRasterData()` 始终返回未经高斯滤波、未经周期补列的标准原始网格，反复调参不会累积平滑。高斯改变用于提线的数值场，Chaikin 调整线形，因此输出是平滑后的近似等值线。H/L 的 `closed-contour` 模式共用降采样和高斯滤波后的标量场；原 `neighborhood` 模式仍独立使用原始网格和 `centerDetection.smoothingIterations`。
+
+`test-page-18` 的“平滑与接缝”“高 / 低值中心”“计算与渲染控制”面板可调整上述参数，滑杆松开时自动应用，并显示当前配置 JSON、中心筛选统计、线点数与耗时。演示数据为 ECMWF 海平面气压灰度图（`2026091015`），值差单位是 hPa；灰度 0~255 对应 950.9156494140625~1040.6756591796875 hPa。计算目前仍在主线程执行；可以通过 `maxCells` 和迭代次数限制开销。
+
 ### 自动检测 H/L 中心
 
-该能力默认关闭。它使用标准化后的数值网格查找局部极大值（H）和局部极小值（L），而不是根据已经生成的线反推。因此只应用于确实存在 H/L 语义的栅格数据。
+该能力默认关闭。它从数值网格查找局部极大值（H）和局部极小值（L），支持原邻域均值模式和闭合值差模式；仅在需要表达高低值中心时开启。下面是全球气压数据的闭合值差配置示例，输入单位为 hPa：
 
 ```js
 await rasterContour.loadGrid({
   values: pressureValues,
   width,
   height,
-  area: [70, 10, 140, 60],
-  interval: 4,
+  area: [-180, -90, 180, 90],
+  wrapLongitude: true,
+  interval: 2,
+  gridSmoothing: { enabled: true, radius: 2, sigma: null, passes: 1 },
   showLabel: true,
   centerDetection: {
     enabled: true,
-    radius: 6,
-    minProminence: 2,
-    minGridDistance: 20,
-    maxCount: 12,
+    method: 'closed-contour',
+    minProminence: 1,
+    minDistanceKm: 250,
+    maxCount: 256,
   },
   centerAnnotation: {
     visible: true,
@@ -4568,15 +4606,23 @@ await rasterContour.loadGrid({
 | `centerDetection` 参数 | 默认值 | 说明 |
 | --- | --- | --- |
 | `enabled` | `false` | 开启 H/L 自动检测。 |
-| `radius` | `6` | 计算局部显著度的网格半径。 |
-| `minProminence` | `2` | 中心值与邻域平均值的最小差异，单位与输入网格一致。 |
-| `minGridDistance` | `20` | 同类中心的最小网格距离，距离过近时合并。 |
-| `maxCount` | `12` | H/L 合计最大输出数。 |
+| `method` | `'neighborhood'` | `'neighborhood'` 保留原邻域均值筛选；`'closed-contour'` 检查闭合值差。 |
+| `minProminence` | `2` | 单位与输入网格一致。闭合模式中是最小闭合值差；邻域模式中是中心与邻域均值的差。 |
+| `minDistanceKm` | `250` | 仅闭合模式：同类中心最小球面距离，单位 km；`0` 关闭距离筛选，距离过近时优先保留更高的 H 或更低的 L。 |
+| `maxCount` | `12` | 全部 H/L 合计最大输出数；全球图建议显式提高并通过诊断计数检查是否触及上限。闭合模式按 H/L 交替取数，各类型内部按更高 H、更低 L 排序。 |
 | `includeHigh/includeLow` | `true/true` | 是否输出 H 或 L。 |
-| `excludeBoundary` | `true` | 排除贴近边界或 NoData 空洞的候选。 |
-| `smoothingIterations` | `1` | 3×3 有效值平滑次数，范围 0~3。 |
+| `radius` | `6` | 仅邻域模式：计算邻域均值的网格半径。 |
+| `minGridDistance` | `20` | 仅邻域模式：同类中心的最小网格距离。 |
+| `excludeBoundary` | `true` | 仅邻域模式：排除贴近边界或 NoData 空洞的候选。闭合模式始终排除开口。 |
+| `smoothingIterations` | `1` | 仅邻域模式：独立的 3×3 有效值平滑次数，范围 0~3。闭合模式共用顶层 `gridSmoothing`，不额外平滑。 |
 
-检测流程会先进行轻量平滑，再按显著度过滤、合并过近的同类中心并限制数量。超过 100 万格时只对候选搜索做块均值抽样，最终仍回到原网格取精确值和坐标。关闭检测后会清理上一次自动中心。
+闭合模式先合并八连通的同值平台，每个平台只保留一个位于平台内部、接近平台中心的代表点，再检查整个边界是否满足局部极值。从 H 向外下降 `minProminence`、从 L 向外上升 `minProminence`，用漫水检查这段值差范围内是否遇到区域边界、缺测区或更强的同类中心。出现开口、或在达到阈值之前并入更强中心则过滤；恰好在阈值处合并允许通过。独立同值极值若在阈值内相连，只保留一个。它检查的是给定值差下的闭合性和合并通路，不输出完整的等值线树或真实鞍点显著度，也不要求当前 `thresholds` 正好绘制出那一条闭合线。
+
+闭合模式与等值线共用 `maxCells` 降采样及高斯滤波后的标量场，中心值取该场的代表格点值，中心位置与 d3 一致采用像元中心坐标。`wrapLongitude: true` 且数据覆盖完整 360° 时，左右邻域周期相接；南北边界不循环。距离筛选用球面公里距离，因此同一经度差在不同纬度不会当作相同距离。最后再应用 `maxCount`。
+
+原邻域模式先独立进行轻量平滑，再按中心与窗口均值的差过滤、合并过近同类中心并限制数量；超过 100 万格时只对候选搜索做块均值抽样，最终回到原网格取值和坐标。两种模式的 `minProminence` 含义不同，调参时不应直接等同。关闭检测后会清理上一次自动中心。
+
+新模式通过 `getState().centerDiagnostics` 返回 `candidates`（极值候选）、`closed`（通过闭合检查）、`rejectedOpen`（边界或缺测开口）、`rejectedWeak`（阈值内合并）、`rejectedDistance`（距离去重）及 `rejectedLimit`（数量上限）。`closed` 包含之后被距离和数量筛掉的点。原模式返回 `null`；`clear/destroy` 清空诊断。`centerCount` 是实际输出中心数，`centerLabelCount` 是经过当前视野和碰撞避让后的可见标注数，两者可以不同。
 
 `RasterContourController` 也可直接传顶层 `centers`。手工数组（包括 `[]`）优先于自动检测；传 `centers: null` 可恢复使用当前 `centerDetection` 的结果。检测只产生中心数据，仍需 `centerAnnotation.visible: true` 才会显示。
 
@@ -4589,12 +4635,14 @@ await rasterContour.loadGrid({
 | `loadGeoTiff(payload, options)` | 从 GeoTIFF 生成。 |
 | `loadGrayImage(payload, options)` | 从灰度图生成。 |
 | `loadGrid(payload, options)` | 从数值网格生成。 |
-| `update(payload)` | 合并配置后重新计算；仅修改等值线或渲染参数时复用已解析网格，修改数据源参数时自动重新加载。 |
+| `update(payload)` | 算法参数变化时从原始网格重算；标签、颜色、线宽、渲染简化等显示参数直接复用等值线；修改数据源参数时重新加载。`gridSmoothing` 支持字段级合并。 |
 | `show/hide/toggle` | 统一控制等值线、线值标签和中心标注显隐。 |
 | `clear/destroy` | 清空或销毁控制器。 |
-| `getState()` | 返回尺寸、值域、级别、线数、`centerCount`、标注数、投影、耗时和底层 contour 状态。 |
+| `getState()` | 返回尺寸、值域、级别、线数、`pointCount`、`centerCount`、标注数、投影、耗时和底层 contour 状态；另含实际 `gridSmoothing`、`wrapLongitude`、`gridSmoothingElapsed`、`contoursReused`、`centerDiagnostics`。 |
 | `getRasterData()` | 返回当前标准栅格，包含 `values/width/height/area`。 |
 
+`gridSmoothingElapsed` 已包含在 `generateElapsed` 中，不能重复相加；显示更新复用几何时，两项均为 0，`contoursReused` 为 true。`renderWidth/renderHeight` 不包含内部周期补列。`clear()` 释放等值线缓存并保留原始网格；`destroy()` 同时释放两者。
+
 ```js
 // clear 只清空当前渲染结果，控制器仍可继续 update/load。
 rasterContour.clear()

package/dist/WindDataGrid-DA9pzsfX.js

@@ -0,0 +1,508 @@
+const C = {
+  OK: "OK",
+  CANCELLED: "CANCELLED",
+  FAILED: "FAILED",
+  NOT_INITIALIZED: "NOT_INITIALIZED",
+  INVALID_CONTAINER: "INVALID_CONTAINER",
+  ENGINE_NOT_REGISTERED: "ENGINE_NOT_REGISTERED",
+  ENGINE_RESOURCE_MISSING: "ENGINE_RESOURCE_MISSING",
+  METHOD_NOT_FOUND: "METHOD_NOT_FOUND",
+  UNSUPPORTED_CAPABILITY: "UNSUPPORTED_CAPABILITY",
+  INVALID_DEM: "INVALID_DEM"
+};
+function v({
+  success: t = !0,
+  message: n = "",
+  data: e = null,
+  code: i = C.OK
+} = {}) {
+  return { success: t, message: n, data: e, code: i };
+}
+function k(t = null, n = "OK", e = C.OK) {
+  return v({ success: !0, message: n, data: t, code: e });
+}
+function U(t = "Operation failed.", n = C.FAILED, e = null) {
+  return v({ success: !1, message: t, data: e, code: n });
+}
+function tt(t, n, e = "") {
+  const i = `${n} adapter does not support "${t}". ${e}`.trim();
+  return console.warn(`[3clear-dt-base] ${i}`), U(i, C.UNSUPPORTED_CAPABILITY, {
+    methodName: t,
+    engineType: n,
+    detail: e
+  });
+}
+function nt(t, n = {}) {
+  var i, s, o, r, l;
+  if (n.currentTime !== void 0 && n.currentTime !== null && !Number.isFinite(n.currentTime))
+    return "currentTime must be a finite timestamp in milliseconds or null.";
+  if (t.times !== void 0) {
+    if (!t.colors || !Array.isArray(t.times) || t.times.length !== ((i = t.positions) == null ? void 0 : i.length))
+      return "line.times requires vertex colors and one timestamp for each position.";
+    for (let a = 0; a < t.times.length; a += 1)
+      if (!Number.isFinite(t.times[a]) || a > 0 && t.times[a] <= t.times[a - 1])
+        return "line.times must contain strictly increasing finite timestamps in milliseconds.";
+  }
+  if (t.colors === void 0) return "";
+  if (!Array.isArray(t.colors) || t.colors.length !== ((s = t.positions) == null ? void 0 : s.length))
+    return "line.colors must have one color for each position.";
+  if (t.colors.some((a) => typeof a != "string" || !/^#[0-9a-f]{6}$/i.test(a)))
+    return "line.colors requires six-digit HEX colors.";
+  const e = { ...n.style, ...t.style };
+  return e.pattern === "dashed" || (r = (o = e.color) == null ? void 0 : o.flow) != null && r.enabled ? "Vertex colors support solid lines only." : (e.clampToGround ?? n.clampToGround) === !0 ? "Vertex colors do not support clampToGround; use false for the thematic overlay." : (l = n.animation) != null && l.enabled && (!n.animation.lineId || String(n.animation.lineId) === String(t.id)) ? "Vertex-colored lines do not support reveal animation." : "";
+}
+const V = {
+  TD: "#e6d64f",
+  TS: "#2f8df4",
+  STS: "#28a46a",
+  TY: "#f59e0b",
+  STY: "#d946ef",
+  SuperTY: "#ef4444"
+}, L = {
+  trackLine: {
+    color: "#ffffff",
+    width: 3,
+    opacity: 0.96,
+    outlineColor: "#08131f",
+    outlineWidth: 1
+  },
+  forecastLine: {
+    color: "#f8fafc",
+    width: 2,
+    opacity: 0.92,
+    dashLength: 12,
+    gapLength: 8
+  },
+  point: {
+    radius: 5,
+    outlineColor: "#07111f",
+    outlineWidth: 1
+  },
+  label: {
+    visible: !0,
+    color: "#ffffff",
+    fontSize: 12,
+    backgroundColor: "rgba(2, 20, 42, 0.82)",
+    offset: [0, -22]
+  },
+  center: {
+    iconUrl: "",
+    iconSize: [36, 36],
+    rotate: !0,
+    rotationDurationMs: 1400,
+    showLabel: !0,
+    labelColor: "#07111f",
+    labelBackgroundColor: "rgba(255, 255, 255, 0.88)",
+    labelOffset: [30, -30]
+  },
+  windCircle: {
+    visible: !0,
+    r7: { color: "#c8c537", fillOpacity: 0.26, outlineOpacity: 0.9 },
+    r10: { color: "#ffaa00", fillOpacity: 0.22, outlineOpacity: 0.9 },
+    r12: { color: "#cc4400", fillOpacity: 0.18, outlineOpacity: 0.95 }
+  },
+  intensityColors: V
+}, R = {
+  enabled: !0,
+  durationMs: 15e3,
+  autoplay: !1,
+  loop: !1,
+  currentIndex: 0
+};
+function c(t) {
+  return !!(t && typeof t == "object" && !Array.isArray(t));
+}
+function y(t, n) {
+  return Object.prototype.hasOwnProperty.call(t || {}, n);
+}
+function f(t, n, e) {
+  return Math.min(Math.max(t, n), e);
+}
+function u(t, n = 0) {
+  const e = Number(t);
+  return Number.isFinite(e) ? e : n;
+}
+function p(t, n) {
+  return {
+    ...c(t) ? t : {},
+    ...c(n) ? n : {}
+  };
+}
+function _(t = {}, n = {}) {
+  const e = c(t) ? t : {}, i = c(n) ? n : {}, s = {
+    ...e,
+    ...i
+  };
+  ["trackLine", "forecastLine", "point", "label", "center", "intensityColors"].forEach((l) => {
+    s[l] = p(e[l], i[l]);
+  });
+  const o = c(e.windCircle) ? e.windCircle : {}, r = c(i.windCircle) ? i.windCircle : {};
+  return s.windCircle = {
+    ...o,
+    ...r,
+    r7: p(o.r7, r.r7),
+    r10: p(o.r10, r.r10),
+    r12: p(o.r12, r.r12)
+  }, s;
+}
+function et(t = {}, n = {}) {
+  const e = c(t) ? t : {}, i = c(n) ? n : {}, s = {
+    ...e,
+    ...i,
+    typhoon: p(e.typhoon, i.typhoon),
+    style: _(e.style, i.style),
+    playback: p(e.playback, i.playback)
+  };
+  return !y(i, "tracks") && y(e, "tracks") && (s.tracks = e.tracks), !y(i, "forecastPaths") && y(e, "forecastPaths") && (s.forecastPaths = e.forecastPaths), s;
+}
+function G(t, n) {
+  if (!Array.isArray(t) || t.length < 2)
+    throw new Error(`${n} must be [longitude, latitude, height?].`);
+  const e = Number(t[0]), i = Number(t[1]), s = t.length > 2 ? Number(t[2]) : 0;
+  if (!Number.isFinite(e) || !Number.isFinite(i) || !Number.isFinite(s) || i < -90 || i > 90)
+    throw new Error(`${n} must contain finite coordinates and latitude must be between -90 and 90.`);
+  return [e, i, s];
+}
+function Y(t, n) {
+  if (t == null) return null;
+  if (!c(t))
+    throw new Error(`${n} must be { ne, se, sw, nw } in kilometres.`);
+  const e = {};
+  for (const i of ["ne", "se", "sw", "nw"]) {
+    const s = Number(t[i]);
+    if (!Number.isFinite(s) || s < 0)
+      throw new Error(`${n}.${i} must be a non-negative number.`);
+    e[i] = s;
+  }
+  return e;
+}
+function W(t, n) {
+  if (t == null) return {};
+  if (!c(t)) throw new Error(`${n} must be an object.`);
+  return ["r7", "r10", "r12"].reduce((e, i) => {
+    const s = Y(t[i], `${n}.${i}`);
+    return s && (e[i] = s), e;
+  }, {});
+}
+function $(t, n, e = "tracks") {
+  if (!c(t)) throw new Error(`${e}[${n}] must be an object.`);
+  const i = t.time ?? "", s = Date.parse(i), o = i == null || String(i) === "" ? `${e}-${n}` : i;
+  return {
+    ...t,
+    id: String(t.id === void 0 || t.id === null || String(t.id) === "" ? o : t.id),
+    time: i,
+    timestamp: Number.isFinite(s) ? s : null,
+    position: G(t.position, `${e}[${n}].position`),
+    level: String(t.level || "TD"),
+    windSpeed: t.windSpeed === void 0 ? null : u(t.windSpeed, null),
+    pressure: t.pressure === void 0 ? null : u(t.pressure, null),
+    windCircles: W(t.windCircles, `${e}[${n}].windCircles`)
+  };
+}
+function j(t, n, e) {
+  if (!c(t)) throw new Error(`forecastPaths[${n}] must be an object.`);
+  if (!Array.isArray(t.points) || t.points.length === 0)
+    throw new Error(`forecastPaths[${n}].points requires at least one point.`);
+  const i = String(t.id ?? `forecast-${n}`), s = t.points.map((o, r) => {
+    const l = $(o, r, `forecastPaths[${n}].points`), a = o == null ? void 0 : o.uncertaintyRadiusKm;
+    return {
+      ...l,
+      uncertaintyRadiusKm: a == null ? 0 : Math.max(u(a, 0), 0)
+    };
+  });
+  return {
+    ...t,
+    id: i,
+    points: s,
+    style: p(e, t.style)
+  };
+}
+function q(t = {}) {
+  const n = _(L, t);
+  return n.trackLine.width = Math.max(u(n.trackLine.width, 3), 0.5), n.trackLine.opacity = f(u(n.trackLine.opacity, 0.96), 0, 1), n.trackLine.outlineWidth = Math.max(u(n.trackLine.outlineWidth, 1), 0), n.forecastLine.width = Math.max(u(n.forecastLine.width, 2), 0.5), n.forecastLine.opacity = f(u(n.forecastLine.opacity, 0.92), 0, 1), n.forecastLine.dashLength = Math.max(u(n.forecastLine.dashLength, 12), 1), n.forecastLine.gapLength = Math.max(u(n.forecastLine.gapLength, 8), 1), n.point.radius = Math.max(u(n.point.radius, 5), 1), n.point.outlineWidth = Math.max(u(n.point.outlineWidth, 1), 0), n.label.fontSize = Math.max(u(n.label.fontSize, 12), 8), n.label.offset = Array.isArray(n.label.offset) ? n.label.offset.slice(0, 2) : [0, -22], n.center.iconSize = Array.isArray(n.center.iconSize) ? n.center.iconSize.slice(0, 2).map((e) => Math.max(u(e, 36), 1)) : [36, 36], n.center.rotationDurationMs = Math.max(u(n.center.rotationDurationMs, 1400), 1), n.center.labelOffset = Array.isArray(n.center.labelOffset) ? n.center.labelOffset.slice(0, 2) : [30, -30], ["r7", "r10", "r12"].forEach((e) => {
+    n.windCircle[e].fillOpacity = f(
+      u(n.windCircle[e].fillOpacity, L.windCircle[e].fillOpacity),
+      0,
+      1
+    ), n.windCircle[e].outlineOpacity = f(
+      u(n.windCircle[e].outlineOpacity, L.windCircle[e].outlineOpacity),
+      0,
+      1
+    );
+  }), n;
+}
+function it(t = {}, n = {}) {
+  const e = c(t) ? t : {}, i = Array.isArray(e.tracks) ? e.tracks.map((l, a) => $(l, a)) : [];
+  if (!n.allowEmpty && i.length === 0)
+    throw new Error("Typhoon path requires a non-empty tracks array.");
+  const s = q(e.style), o = Array.isArray(e.forecastPaths) ? e.forecastPaths.map((l, a) => j(l, a, s.forecastLine)) : [], r = p(R, e.playback);
+  return r.enabled = r.enabled !== !1, r.durationMs = Math.max(u(r.durationMs, R.durationMs), 1), r.autoplay = r.autoplay === !0, r.loop = r.loop === !0, r.currentIndex = i.length ? f(Math.floor(u(r.currentIndex, 0)), 0, i.length - 1) : 0, {
+    ...e,
+    layerId: String(e.typhoonPathLayerId || e.layerId || e.id || "typhoon-path-default"),
+    typhoon: p({}, e.typhoon),
+    tracks: i,
+    forecastPaths: o,
+    style: s,
+    playback: r,
+    visible: e.visible !== !1,
+    onCurrentChange: typeof e.onCurrentChange == "function" ? e.onCurrentChange : null,
+    onPointClick: typeof e.onPointClick == "function" ? e.onPointClick : null
+  };
+}
+function m(t) {
+  return t * Math.PI / 180;
+}
+function N(t) {
+  return t * 180 / Math.PI;
+}
+function K(t, n) {
+  const e = m(t[1]), i = m(n[1]), s = i - e, o = m(n[0] - t[0]), r = Math.sin(s / 2) ** 2 + Math.cos(e) * Math.cos(i) * Math.sin(o / 2) ** 2;
+  return 6371e3 * 2 * Math.atan2(Math.sqrt(r), Math.sqrt(Math.max(1 - r, 0)));
+}
+function F(t) {
+  if (t.length <= 1) return [0];
+  if (t.every(
+    (s, o) => s.timestamp !== null && (o === 0 || s.timestamp > t[o - 1].timestamp)
+  )) {
+    const s = t[0].timestamp, o = t[t.length - 1].timestamp - s;
+    if (o > 0) return t.map((r) => (r.timestamp - s) / o);
+  }
+  const e = [0];
+  for (let s = 1; s < t.length; s += 1) {
+    const o = K(t[s - 1].position, t[s].position), r = t[s].position[2] - t[s - 1].position[2];
+    e.push(e[s - 1] + Math.hypot(o, r));
+  }
+  const i = e[e.length - 1];
+  return i > 0 ? e.map((s) => s / i) : e.map((s, o) => o / (t.length - 1));
+}
+function H(t, n, e) {
+  const i = m(t[1]), s = m(t[0]), o = m(n[1]), r = m(n[0]), l = 2 * Math.asin(Math.sqrt(
+    Math.sin((o - i) / 2) ** 2 + Math.cos(i) * Math.cos(o) * Math.sin((r - s) / 2) ** 2
+  ));
+  if (!Number.isFinite(l) || l < 1e-9)
+    return [t[0], t[1], t[2] + (n[2] - t[2]) * e];
+  const a = Math.sin(l), h = Math.sin((1 - e) * l) / a, d = Math.sin(e * l) / a, M = h * Math.cos(i) * Math.cos(s) + d * Math.cos(o) * Math.cos(r), g = h * Math.cos(i) * Math.sin(s) + d * Math.cos(o) * Math.sin(r), b = h * Math.sin(i) + d * Math.sin(o);
+  return [
+    N(Math.atan2(g, M)),
+    N(Math.atan2(b, Math.hypot(M, g))),
+    t[2] + (n[2] - t[2]) * e
+  ];
+}
+function st(t = [], n = 0) {
+  if (!t.length) return null;
+  const e = f(u(n, 0), 0, 1);
+  if (t.length === 1)
+    return { progress: e, index: 0, nextIndex: 0, segmentProgress: 0, position: [...t[0].position], track: t[0] };
+  const i = F(t);
+  let s = i.length - 2;
+  for (let h = 1; h < i.length; h += 1)
+    if (e < i[h]) {
+      s = h - 1;
+      break;
+    }
+  e >= 1 && (s = t.length - 1);
+  const o = Math.min(s + 1, t.length - 1), r = i[s], l = i[o], a = o === s ? 0 : f((e - r) / Math.max(l - r, Number.EPSILON), 0, 1);
+  return {
+    progress: e,
+    index: s,
+    nextIndex: o,
+    segmentProgress: a,
+    position: H(t[s].position, t[o].position, a),
+    track: t[s]
+  };
+}
+function ot(t = [], n = 0) {
+  if (!t.length) return 0;
+  const e = f(Math.floor(u(n, 0)), 0, t.length - 1);
+  return F(t)[e] || 0;
+}
+function rt(t = [], n) {
+  if (!t.length) return -1;
+  const e = Date.parse(n);
+  return Number.isFinite(e) ? t.reduce((i, s, o) => {
+    if (s.timestamp === null) return i;
+    const r = Math.abs(s.timestamp - e), l = t[i].timestamp === null ? Number.POSITIVE_INFINITY : Math.abs(t[i].timestamp - e);
+    return r < l ? o : i;
+  }, 0) : -1;
+}
+function z(t, n, e, i) {
+  const s = i / 6371, o = m(e), r = m(n), l = m(t), a = Math.asin(
+    Math.sin(r) * Math.cos(s) + Math.cos(r) * Math.sin(s) * Math.cos(o)
+  ), h = l + Math.atan2(
+    Math.sin(o) * Math.sin(s) * Math.cos(r),
+    Math.cos(s) - Math.sin(r) * Math.sin(a)
+  );
+  return [(N(h) + 540) % 360 - 180, N(a)];
+}
+function at(t, n, e, i = 4) {
+  if (!c(e)) return [];
+  const s = [], o = f(Math.floor(u(i, 4)), 1, 30);
+  for (let r = 0; r < 360; r += o) {
+    const l = r < 90 ? e.ne : r < 180 ? e.se : r < 270 ? e.sw : e.nw;
+    s.push(z(t, n, r, u(l, 0)));
+  }
+  return s;
+}
+function lt(t, n, e, i = 6) {
+  const s = [], o = f(Math.floor(u(i, 6)), 1, 30);
+  for (let r = 0; r < 360; r += o)
+    s.push(z(t, n, r, Math.max(u(e, 0), 0)));
+  return s;
+}
+function ut(t = [], n = []) {
+  const e = t.map((i) => i.position);
+  return n.forEach((i) => i.points.forEach((s) => e.push(s.position))), e.length ? e.reduce((i, s) => ({
+    west: Math.min(i.west, s[0]),
+    south: Math.min(i.south, s[1]),
+    east: Math.max(i.east, s[0]),
+    north: Math.max(i.north, s[1])
+  }), { west: 1 / 0, south: 1 / 0, east: -1 / 0, north: -1 / 0 }) : null;
+}
+function ht(t = {}, n = {}) {
+  const e = [t.code, t.name].filter(Boolean).join(" "), i = [n.stage || n.level, n.windSpeed === null ? "" : `${n.windSpeed}m/s`].filter(Boolean).join(" ");
+  return [e, i].filter(Boolean).join(`
+`);
+}
+function Z(t = [-180, 180]) {
+  if (!Array.isArray(t) || t.length !== 2 || !(Number(t[0]) === -180 && Number(t[1]) === 180 || Number(t[0]) === 0 && Number(t[1]) === 360))
+    throw new Error("longitudeRange must be [-180, 180] or [0, 360].");
+  return t.map(Number);
+}
+function B(t, n = -180) {
+  return n + ((t - n) % 360 + 360) % 360;
+}
+function Q(t, n, e) {
+  return t + 360 * Math.round(((n + e) / 2 - t) / 360);
+}
+function X(t, n, e) {
+  const i = n - t, s = i / (e - 1), o = Math.max(1e-5, s * 1e-4);
+  return Math.abs(i - 360) <= o || Math.abs(i + s - 360) <= o ? 360 : 0;
+}
+function J(t, n, e, i = [-180, 180]) {
+  if (e) return { min: i[0], max: i[1] };
+  const s = B(t, i[0]);
+  return { min: s, max: s + n - t };
+}
+function ct(t, n, e, i = 0) {
+  if (i) return { ...t };
+  const s = 360 * Math.round((t.min + t.max - (n + e)) / 720), o = [];
+  for (const a of [s - 360, s, s + 360]) {
+    const h = Math.max(t.min, n + a), d = Math.min(t.max, e + a);
+    h < d && o.push({ min: h, max: d });
+  }
+  if (!o.length) return null;
+  const r = Math.min(...o.map((a) => a.min)), l = Math.max(...o.map((a) => a.max));
+  return e - n < l - r ? { min: n + s, max: e + s } : { min: r, max: l };
+}
+class dt {
+  constructor(n = {}, e = {}) {
+    this.rawData = n, this.bound = Array.isArray(n.Bound) ? n.Bound : [], this.data = Array.isArray(n.DataAry) ? n.DataAry : [], this.valid = !1, this.errorMessage = "", this.lonMin = 0, this.latMin = 0, this.lonMax = 0, this.latMax = 0, this.lonCount = 0, this.latCount = 0, this.lonSpan = 0, this.latSpan = 0, this.lonStep = 0, this.latStep = 0, this.valueScale = 1, this.longitudePeriod = 0, this.longitudeRange = [-180, 180], this.flipY = !1;
+    try {
+      this.longitudeRange = Z(e.longitudeRange);
+    } catch (i) {
+      this.errorMessage = i.message;
+      return;
+    }
+    this.bound.length ? this.parse() : this.parseComponents(e), this.valid && (this.longitudePeriod = X(this.lonMin, this.lonMax, this.lonCount));
+  }
+  parse() {
+    if (this.bound.length < 6) {
+      this.errorMessage = "Wind field Bound must contain at least 6 values.";
+      return;
+    }
+    const [n, e, i, s, o, r, l = 1] = this.bound, a = Number(i) * Number(s) * 2;
+    if (!Number.isFinite(Number(n)) || !Number.isFinite(Number(e)) || Number(i) < 2 || Number(s) < 2 || Number(o) <= 0 || Number(r) <= 0 || this.data.length !== a) {
+      this.errorMessage = `Invalid wind field data. Expected DataAry length ${a}, got ${this.data.length}.`;
+      return;
+    }
+    this.lonMin = Number(n), this.latMin = Number(e), this.lonCount = Number(i), this.latCount = Number(s), this.lonSpan = Number(o), this.latSpan = Number(r), this.valueScale = Number(l) || 1, this.lonMax = this.lonMin + this.lonSpan, this.latMax = this.latMin + this.latSpan, this.lonStep = this.lonSpan / (this.lonCount - 1), this.latStep = this.latSpan / (this.latCount - 1), this.valid = !0;
+  }
+  parseComponents(n) {
+    const { width: e, height: i, bounds: s = {} } = this.rawData, o = this.rawData.u || this.rawData.U, r = this.rawData.v || this.rawData.V;
+    this.u = (o == null ? void 0 : o.array) || o, this.v = (r == null ? void 0 : r.array) || r, this.lonMin = Number(s.west), this.lonMax = Number(s.east), this.latMin = Number(s.south), this.latMax = Number(s.north), this.lonMax < this.lonMin && (this.lonMax += 360), this.lonCount = Number(e), this.latCount = Number(i), this.lonSpan = this.lonMax - this.lonMin, this.latSpan = this.latMax - this.latMin;
+    const l = (a) => Array.isArray(a) || ArrayBuffer.isView(a);
+    if (!Number.isInteger(this.lonCount) || this.lonCount < 2 || !Number.isInteger(this.latCount) || this.latCount < 2 || ![this.lonMin, this.lonMax, this.latMin, this.latMax].every(Number.isFinite) || this.lonSpan <= 0 || this.latSpan <= 0 || !l(this.u) || !l(this.v) || this.u.length !== this.lonCount * this.latCount || this.v.length !== this.u.length) {
+      this.errorMessage = "U/V wind data requires width, height, bounds, u and v.";
+      return;
+    }
+    this.lonStep = this.lonSpan / (this.lonCount - 1), this.latStep = this.latSpan / (this.latCount - 1), this.flipY = n.flipY === !0 || this.rawData.rowOrder === "north-to-south", this.valid = !0;
+  }
+  normalizeLongitude(n) {
+    return this.longitudePeriod ? B(n, this.lonMin) : Q(n, this.lonMin, this.lonMax);
+  }
+  contains(n, e) {
+    const i = this.normalizeLongitude(n);
+    return Number.isFinite(n) && Number.isFinite(e) && (this.longitudePeriod > 0 || i >= this.lonMin && i <= this.lonMax) && e >= this.latMin && e <= this.latMax;
+  }
+  getBounds() {
+    const n = J(
+      this.lonMin,
+      this.lonMax,
+      this.longitudePeriod,
+      this.longitudeRange
+    );
+    return {
+      west: n.min,
+      south: this.latMin,
+      east: n.max,
+      north: this.latMax
+    };
+  }
+  getCenter() {
+    const n = this.getBounds();
+    return {
+      lon: (n.west + n.east) / 2,
+      lat: this.latMin + this.latSpan / 2
+    };
+  }
+  getVector(n, e) {
+    if (this.u) {
+      const o = (this.flipY ? this.latCount - n - 1 : n) * this.lonCount + e;
+      return { u: Number(this.u[o]), v: Number(this.v[o]) };
+    }
+    const i = (n * this.lonCount + e) * 2;
+    return {
+      u: Number(this.data[i]) / this.valueScale,
+      v: Number(this.data[i + 1]) / this.valueScale
+    };
+  }
+  /**
+   * 双线性插值。
+   *
+   * row 始终按从南到北计算；U/V 的北到南行序在 getVector 中换算。
+   * 全球网格跨末列与首列插值，不把 0…359 的最后一度当成无数据区域。
+   */
+  sample(n, e) {
+    if (!this.valid || !this.contains(n, e))
+      return null;
+    const i = (this.normalizeLongitude(n) - this.lonMin) / this.lonStep, s = (e - this.latMin) / this.latStep, o = this.longitudePeriod ? Math.round(this.longitudePeriod / this.lonStep) : this.lonCount, r = Math.max(0, Math.min(Math.floor(i), o - (this.longitudePeriod ? 1 : 2))), l = Math.max(0, Math.min(Math.floor(s), this.latCount - 2)), a = this.longitudePeriod ? (r + 1) % o : r + 1, h = l + 1, d = Math.max(0, Math.min(i - r, 1)), M = Math.max(0, Math.min(s - l, 1)), g = this.getVector(l, r), b = this.getVector(l, a), x = this.getVector(h, r), I = this.getVector(h, a), E = 1 - d, A = 1 - M, T = E * A, O = d * A, P = E * M, D = d * M, S = g.u * T + b.u * O + x.u * P + I.u * D, w = g.v * T + b.v * O + x.v * P + I.v * D;
+    return !Number.isFinite(S) || !Number.isFinite(w) ? null : {
+      u: S,
+      v: w,
+      speed: Math.hypot(S, w)
+    };
+  }
+}
+export {
+  C as R,
+  dt as W,
+  at as a,
+  lt as b,
+  st as c,
+  ut as d,
+  Q as e,
+  ht as f,
+  ot as g,
+  X as h,
+  J as i,
+  ct as j,
+  Z as k,
+  U as l,
+  et as m,
+  it as n,
+  rt as r,
+  k as s,
+  tt as u,
+  nt as v,
+  B as w
+};