s3m-maplibre 0.0.0-stage → 0.2.3

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,266 @@
-# Temporary Holding Version
+# s3m-maplibre
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+**在 MapLibre GL JS 里原生渲染 SuperMap S3M 三维模型** —— 浏览器直接解析 `.s3mb` 瓦片，不需要预先转成 3D Tiles，也不需要 SuperMap 的 WebGL 客户端。
+
+[![npm](https://img.shields.io/badge/npm-0.1.0-blue)](https://www.npmjs.com/)
+[![license](https://img.shields.io/badge/license-Apache--2.0-green)](./LICENSE)
+[![types](https://img.shields.io/badge/types-included-blue)](./src/index.ts)
+
+---
+
+## 为什么需要它
+
+SuperMap 的 S3M（Spatial 3D Model）是国内 GIS 项目里非常常见的三维格式，iServer 的 `realspace` 服务默认就发布成 S3M。但它和 MapLibre / Mapbox 生态是断开的：
+
+- 官方只有 Cesium 系的 WebGL 客户端；
+- 转 3D Tiles 是离线批处理，数据一更新就得重跑，做不到实时；
+- 转出来的 3D Tiles 还要再丢一次精度。
+
+这个库走的是**第二条路**：在浏览器里直接解析 S3MB 二进制，用 three.js 画在 MapLibre 的自定义图层上。数据更新即时可见，不需要任何预处理。
+
+```
+iServer / 本地目录  →  .scp 配置 + .s3mb 瓦片
+                          ↓  fetch + 解压 + 二进制解析
+                     three.js 几何 + 材质
+                          ↓  ENU → Web Mercator
+                     MapLibre custom layer (3d)
+```
+
+---
+
+## 能力
+
+| 能力 | 状态 | 说明 |
+|---|---|---|
+| S3MB 解析 | ✅ | v1.0 / v2.0 / v3.0，9 个官方样例字节级对齐 |
+| MeshOpt 几何压缩 | ✅ | v3 默认压缩方式，浏览器内 wasm 解码，按需加载 |
+| LOD 渐进加载 | ✅ | 支持 `Distance_From_EyePoint` / `Pixel_Size_OnScreen` |
+| 多数据集叠加 | ✅ | 各数据集独立锚点，自动对齐到统一场景原点 |
+| 白膜 / 单色 | ✅ | |
+| 按高度 / 按楼层着色 | ✅ | 高度范围自动统计 |
+| 按单体着色 | ✅ | 基于 S3M 单体化信息 |
+| 动态扫描 | ✅ | 扫描线沿高度循环 |
+| 透明度 | ✅ | 实时，不重编译着色器 |
+| 选中高亮 + 描边 | ✅ | 单体级 |
+| 全局棱线 | ✅ | 优先用数据自带棱线包，没有才 CPU 现算 |
+| 单体级点选 + 属性 | ✅ | GPU 拾取，代价与面数无关 |
+| 实例化几何 | ✅ | `instanceMode` 16 / 17 |
+| DXT / WebP 纹理 | ✅ | |
+| Draco 压缩几何 | ❌ | 遇到会抛明确错误 |
+| KTX2 / CRN | ❌ | |
+| 骨骼动画 | ❌ | 已解析未驱动 |
+| 地形遮挡 | ❌ | |
+
+---
+
+## 安装
+
+```bash
+npm install s3m-maplibre three
+```
+
+`three` 是 peer 依赖（`>=0.168.0`）。`maplibre-gl` 不是依赖——图层只是一个符合 `CustomLayerInterface` 的普通对象，MapLibre / Mapbox 都能挂。
+
+类型随包发布（`dist/index.d.ts`，由源码直接生成）。three `>=0.168` 自带类型，更老的版本需要自己装 `@types/three`。
+
+---
+
+## 快速开始
+
+```js
+import maplibregl from 'maplibre-gl';
+import { S3MLayer, STYLE } from 's3m-maplibre';
+
+const map = new maplibregl.Map({
+  container: 'map',
+  style: 'https://demotiles.maplibre.org/style.json',
+  center: [121.4739, 31.244],
+  zoom: 16.5,
+  pitch: 60,
+  antialias: true, // 建筑边缘需要抗锯齿
+});
+
+const layer = new S3MLayer({
+  datasets: [
+    {
+      id: 'jingmo',
+      name: '精模',
+      configUrl: 'https://host/iserver/services/svc/rest/realspace/datas/jingmo/data/path/jingmo.scp',
+    },
+  ],
+  style: { mode: STYLE.WHITE, opacity: 0.92 },
+  onPick: (f) => console.log(f?.smid, f?.height, f?.floors),
+});
+
+map.on('load', () => map.addLayer(layer));
+```
+
+### 叠加多个数据集 + 换着色
+
+```js
+const layer = new S3MLayer({
+  datasets: [
+    { id: 'zhoubian', name: '周边底模', configUrl: '.../zhoubian.scp' },
+    { id: 'jingmo', name: '精模', configUrl: '.../jingmo.scp' },
+  ],
+  maxTiles: 48,
+});
+
+await layer.addDataset({ id: 'cheng', name: 'cheng', configUrl: '.../cheng.scp' });
+
+layer.setStyle({ mode: STYLE.HEIGHT, colorA: '#e2e8f0', colorB: '#1d4ed8' });
+layer.setDatasetVisible('zhoubian', false);
+layer.setEdges(true);
+```
+
+### 点选
+
+```js
+map.on('click', (e) => {
+  const f = layer.pickFromEvent(e);
+  if (!f) return layer.select(null);
+  layer.select(f);
+  console.log(`${f.datasetName} · SMID ${f.smid} · ${f.height}m · ${f.floors}层`);
+});
+```
+
+完整接口见 **[docs/API.md](./docs/API.md)**。
+
+---
+
+## 演示
+
+仓库内 `demo/` 是一个完整示例，接了上海某区的真实 iServer 服务（5 个数据集叠加，45 万三角面）：
+
+```bash
+npm run demo     # http://localhost:8123/s3m-maplibre/demo/index.html
+```
+
+演示包含：数据集叠加开关、7 种着色模式、透明度、平面/平滑着色、选中描边、全局棱线、点击属性卡。
+
+---
+
+## 工作原理
+
+### 解析
+
+S3MB 是「文件头 + 压缩段」结构：`float version` → (v3) `uint32 compressedType` → (v2+) `uint32 uncompressedSize` → `uint32 compressedSize` → 压缩载荷。解压后是严格的顺序流：
+
+```
+fileOptions
+GroupNode → PageLOD[] → Geode[]（matrix4d + skeletonNames）
+Skeleton[] → VertexDataPackage + IndexPackage[]
+Textures / Materials
+PickInfo（单体化：SMID → batchId + 顶点区间）
+Extensions（v3）
+```
+
+解析器是纯 TS，**不依赖 three 和 WebGL**，可以在 Node 里跑，用 `bytesRead === bytesTotal` 自检偏移是否正确。
+
+### MeshOpt 压缩几何
+
+iServer 现在默认用 MeshOpt 压几何（`VertexTag = 2`），瓦片里的顶点流是 meshoptimizer 编码过的量化数据。处理方式：
+
+- **解码器**直接内联 [meshoptimizer](https://github.com/zeux/meshoptimizer) 0.17 的 wasm 解码器（MIT，约 22KB），只有真的遇到 MeshOpt 瓦片才动态 `import`；
+- **容器结构**按真实数据逐字节标定（规范里的 `CompressedDataPackage` 已经落后于 v3.01 的实际数据），量化公式用瓦片自带的 OBB 反推验证：
+  ```
+  position = minVerticesValue + uint16 * vertCompressConstant
+  texcoord = minTexCoordValue[i] + uint16 * texCoordCompressConstant[i]
+  normal   = octDecode(int16 / 32767)
+  ```
+- 官方 `ParseMeshOpt.js` **不能直接搬运**：它被混淆过，而且在描述字符串之后多推进 4 字节，遇到现在 iServer 发的 v3.01 数据必然崩在索引包上。
+
+### 索引包类型
+
+一个骨架可以带多个索引包，`primitiveType` 决定怎么画：
+
+| primitiveType | 含义 | 画法 |
+|---|---|---|
+| 4 | 独立三角形 | `Mesh` |
+| 13 | **数据自带的棱线包**（规范里没写，实测就是建筑轮廓线） | `LineSegments` |
+| 其他 | 点 / 线 / 条带 | 跳过 |
+
+把 13 当三角形画，每条棱线都会被连成一根几十上百米的尖刺 —— 这是踩过的坑，写在这里省下一个人一天。
+
+### 坐标
+
+```
+S3M 顶点（数据集局部 ENU，米）
+  → 数据集 Group 偏移（各锚点对齐到场景锚点）
+  → L 矩阵：ENU → Web Mercator 归一化
+  → MapLibre 传入的 mercator→clip
+```
+
+场景原点固定在第一个数据集的锚点，顶点只保留「相对锚点的米」——等价于 3D Tiles 的 `RTC_CENTER`，避免 float32 在大坐标下抖动。
+
+### 着色
+
+所有模式都在同一个 `MeshStandardMaterial` 的片元着色器里用 `uMode` 分支实现，uniform 全局共享。切换样式不重建几何、不重建材质、不重编译着色器。
+
+### 拾取
+
+「物体编号 + batchId」编码成 RGBA 渲到离屏目标，点击时读那一个像素。代价与三角面数无关，深度测试由 GPU 完成，天然只命中最前面的可见面。
+
+---
+
+## 验证情况
+
+- **解析正确性**：9 个官方样例（v1 / v2 / v3）全部 `bytesRead === bytesTotal`；并用官方 `S3ModelParser.js` 在 Node 里做逐段偏移对照。
+- **MeshOpt 解码**：`npm run test:meshopt` 跑 60 个真实瓦片（5 个数据集 × 根瓦片 + 一级子瓦片），逐项校验偏移对齐、索引不越界、三角形索引数是 3 的倍数、法线归一化、顶点包围盒与 OBB 尺寸一致 —— 60/60 通过。
+- **真实服务**：上海某区 iServer `realspace` 服务，S3M 3.01、`epsg:4326`、DXT 纹理压缩、5 个数据集叠加，20 个瓦片 / 45 万三角面稳定 85~90 fps。
+- **拾取正确性**：以射线求交为真值，对 135 个像素采样，有效像素 96/96 一致（其余 39 个是两个数据集几何完全重合的平局）。
+
+---
+
+## 性能
+
+| 项 | 数值 |
+|---|---|
+| 45 万三角面 / 20 瓦片 / 1440×900 | 85~90 fps |
+| 拾取单次 | < 1 ms（与面数无关） |
+| 棱线构建 | 8ms 一帧切片，20 网格约 1.9s 总计，不阻塞交互 |
+
+调优建议见 [docs/API.md#性能调优](./docs/API.md#性能调优)。
+
+---
+
+## 已知限制
+
+- **Draco 压缩几何**未实现。MeshOpt 已支持；遇到 Draco 会抛带说明的错误。
+- **地形遮挡**未实现：MapLibre 的地形深度没进 custom layer 的深度缓冲，建筑不会被地形裁掉。
+- 每个 `indexPackage` 一个 `Mesh`，倾斜摄影大瓦片需要合批。
+- `texmodmatrix`（纹理变换）未应用。
+- 跨城市量级的数据集叠加会重新引入 float32 精度问题。
+
+---
+
+## 目录结构
+
+```
+src/
+  core/      解析层（无 three 依赖，Node 可用）
+    BinaryReader.ts      小端二进制读取
+    S3MBParser.ts        S3MB 结构解析
+    MeshOpt.ts           MeshOpt 几何压缩解码（量化还原 + 八面体法线）
+    FeatureInfo.ts       单体属性反推
+    DXTTextureDecode.ts  DXT 解码（来自 SuperMap/s3m-spec）
+  tileset/   瓦片树 + LOD + 加载调度
+  render/    three 渲染
+    S3MLayer.ts          图层主体（多数据集 / 样式 / 拾取）
+    GeometryBuilder.ts   几何与材质组装
+    StyleMaterial.ts     着色器注入的着色系统
+    Picker.ts            GPU 拾取
+    TextureFactory.ts    纹理解码
+  vendor/    meshoptimizer 解码器（wasm 内联，原样保留）
+demo/        演示
+tools/       自检脚本（解析校验、MeshOpt 回归、静态服务）
+```
+
+---
+
+## 许可
+
+- 本项目 [Apache-2.0](./LICENSE)。
+- `src/core/DXTTextureDecode.ts` 来自 [SuperMap/s3m-spec](https://github.com/supermap/s3m-spec)（Apache-2.0）。
+- `src/vendor/meshopt_decoder.module.js` 是 [meshoptimizer](https://github.com/zeux/meshoptimizer) 官方解码器（MIT，© Arseny Kapoulkine），未做修改。
+- S3M 规范文本遵循 CC BY-ND 4.0，不得修改规范文本后再发布。

package/dist/core/BinaryReader.d.ts

@@ -0,0 +1,38 @@
+/**
+ * S3M 二进制读取器
+ *
+ * 约定全部来自 SuperMap/s3m-spec 的 S3ModelParser.js（Apache-2.0）：
+ *   - 小端字节序
+ *   - String = uint32 字节长度 + UTF-8 字节（无结尾 0）
+ *   - 多处需要按 4 字节对齐，且对齐基准点不同（绝对偏移 / 流起点）
+ */
+import type { BoundingBox, Vec3 } from './types.js';
+export declare class BinaryReader {
+    readonly buffer: ArrayBuffer;
+    readonly base: number;
+    readonly view: DataView;
+    offset: number;
+    private readonly _decoder;
+    constructor(buffer: ArrayBuffer, byteOffset?: number, byteLength?: number);
+    get remaining(): number;
+    u8(): number;
+    u16(): number;
+    u32(): number;
+    i32(): number;
+    f32(): number;
+    f64(): number;
+    /** 返回原始字节视图（不拷贝，生命周期绑定底层 buffer） */
+    bytes(n: number): Uint8Array;
+    /** 返回拷贝，用于纹理等需要脱离源 buffer 的数据 */
+    bytesCopy(n: number): Uint8Array;
+    string(): string;
+    skip(n: number): void;
+    /**
+     * 4 字节对齐。rel 是对齐基准在流中的偏移，默认 0（即整个流起点）。
+     * 纹理流用的是「纹理流起点」而不是文件起点，所以要显式传。
+     */
+    align4(rel?: number): void;
+    vec3f64(): Vec3;
+    boundingBox(): BoundingBox;
+}
+//# sourceMappingURL=BinaryReader.d.ts.map

package/dist/core/BinaryReader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryReader.d.ts","sourceRoot":"","sources":["../../src/core/BinaryReader.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEpD,qBAAa,YAAY;IACvB,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IAEf,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA4B;gBAEzC,MAAM,EAAE,WAAW,EAAE,UAAU,SAAI,EAAE,UAAU,CAAC,EAAE,MAAM;IAWpE,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,EAAE,IAAI,MAAM;IAMZ,GAAG,IAAI,MAAM;IAMb,GAAG,IAAI,MAAM;IAMb,GAAG,IAAI,MAAM;IAMb,GAAG,IAAI,MAAM;IAMb,GAAG,IAAI,MAAM;IAMb,oCAAoC;IACpC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU;IAM5B,iCAAiC;IACjC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU;IAMhC,MAAM,IAAI,MAAM;IAOhB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAIrB;;;OAGG;IACH,MAAM,CAAC,GAAG,SAAI,GAAG,IAAI;IAKrB,OAAO,IAAI,IAAI;IAIf,WAAW,IAAI,WAAW;CAQ3B"}

package/dist/core/BinaryReader.js

@@ -0,0 +1,88 @@
+export class BinaryReader {
+    buffer;
+    base;
+    view;
+    offset;
+    _decoder = new TextDecoder('utf-8');
+    constructor(buffer, byteOffset = 0, byteLength) {
+        this.buffer = buffer;
+        this.base = byteOffset;
+        this.view = new DataView(buffer, byteOffset, byteLength === undefined ? buffer.byteLength - byteOffset : byteLength);
+        this.offset = 0;
+    }
+    get remaining() {
+        return this.view.byteLength - this.offset;
+    }
+    u8() {
+        const v = this.view.getUint8(this.offset);
+        this.offset += 1;
+        return v;
+    }
+    u16() {
+        const v = this.view.getUint16(this.offset, true);
+        this.offset += 2;
+        return v;
+    }
+    u32() {
+        const v = this.view.getUint32(this.offset, true);
+        this.offset += 4;
+        return v;
+    }
+    i32() {
+        const v = this.view.getInt32(this.offset, true);
+        this.offset += 4;
+        return v;
+    }
+    f32() {
+        const v = this.view.getFloat32(this.offset, true);
+        this.offset += 4;
+        return v;
+    }
+    f64() {
+        const v = this.view.getFloat64(this.offset, true);
+        this.offset += 8;
+        return v;
+    }
+    /** 返回原始字节视图（不拷贝，生命周期绑定底层 buffer） */
+    bytes(n) {
+        const a = new Uint8Array(this.buffer, this.base + this.offset, n);
+        this.offset += n;
+        return a;
+    }
+    /** 返回拷贝，用于纹理等需要脱离源 buffer 的数据 */
+    bytesCopy(n) {
+        const a = new Uint8Array(this.buffer, this.base + this.offset, n);
+        this.offset += n;
+        return a.slice();
+    }
+    string() {
+        const len = this.u32();
+        const a = new Uint8Array(this.buffer, this.base + this.offset, len);
+        this.offset += len;
+        return this._decoder.decode(a);
+    }
+    skip(n) {
+        this.offset += n;
+    }
+    /**
+     * 4 字节对齐。rel 是对齐基准在流中的偏移，默认 0（即整个流起点）。
+     * 纹理流用的是「纹理流起点」而不是文件起点，所以要显式传。
+     */
+    align4(rel = 0) {
+        const m = (this.offset - rel) % 4;
+        if (m !== 0)
+            this.skip(4 - m);
+    }
+    vec3f64() {
+        return { x: this.f64(), y: this.f64(), z: this.f64() };
+    }
+    boundingBox() {
+        return {
+            center: this.vec3f64(),
+            xExtent: this.vec3f64(),
+            yExtent: this.vec3f64(),
+            zExtent: this.vec3f64(),
+        };
+    }
+}
+//# sourceMappingURL=BinaryReader.js.map

package/dist/core/BinaryReader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinaryReader.js","sourceRoot":"","sources":["../../src/core/BinaryReader.ts"],"names":[],"mappings":"AAUA,MAAM,OAAO,YAAY;IACd,MAAM,CAAc;IACpB,IAAI,CAAS;IACb,IAAI,CAAW;IACxB,MAAM,CAAS;IAEE,QAAQ,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;IAErD,YAAY,MAAmB,EAAE,UAAU,GAAG,CAAC,EAAE,UAAmB;QAClE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,CACtB,MAAM,EACN,UAAU,EACV,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CACvE,CAAC;QACF,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;IAC5C,CAAC;IAED,EAAE;QACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,oCAAoC;IACpC,KAAK,CAAC,CAAS;QACb,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,iCAAiC;IACjC,SAAS,CAAC,CAAS;QACjB,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IAED,MAAM;QACJ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACpE,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC;QACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,CAAS;QACZ,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,GAAG,GAAG,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,OAAO;QACL,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,WAAW;QACT,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE;YACtB,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE;SACxB,CAAC;IACJ,CAAC;CACF"}

package/dist/core/DXTTextureDecode.d.ts

@@ -0,0 +1,21 @@
+/**
+ * DXT1 / DXT3 / DXT5 纹理解码（squish 算法的 JS 移植）
+ *
+ * 来源：SuperMap iClient3D S3M SDK（Apache-2.0）。
+ * 迁移到 TS 时做了两件事，算法本身未改：
+ *   1. 补齐类型；
+ *   2. 修掉 `DecompressAlphaDxt3` 里把 `block` 误写成未定义全局 `bytes` 的笔误
+ *      （DXT3 纹理此前会直接 ReferenceError）。
+ */
+declare const DXTTextureDecode: {
+    /**
+     * @param out    输出缓冲，长度须为 width*height*4
+     * @param width  像素宽
+     * @param height 像素高
+     * @param block  压缩块
+     * @param format S3M pixelFormat（>11 或 5 走 DXT5，其余走 DXT1）
+     */
+    decode(out: Uint8Array, width: number, height: number, block: Uint8Array, format: number): void;
+};
+export default DXTTextureDecode;
+//# sourceMappingURL=DXTTextureDecode.d.ts.map

package/dist/core/DXTTextureDecode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DXTTextureDecode.d.ts","sourceRoot":"","sources":["../../src/core/DXTTextureDecode.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAoOH,QAAA,MAAM,gBAAgB;IACpB;;;;;;OAMG;gBACS,UAAU,SAAS,MAAM,UAAU,MAAM,SAAS,UAAU,UAAU,MAAM,GAAG,IAAI;CAahG,CAAC;AAEF,eAAe,gBAAgB,CAAC"}