minidraco 0.6.0 → 0.7.0

package/dist/three.js

@@ -11,37 +11,22 @@ import {
 } from "three";
 
 // src/decoder/core/DracoTypes.ts
-var DataType = {
-  INVALID: 0,
-  INT8: 1,
-  UINT8: 2,
-  INT16: 3,
-  UINT16: 4,
-  INT32: 5,
-  UINT32: 6,
-  INT64: 7,
-  UINT64: 8,
-  FLOAT32: 9,
-  FLOAT64: 10,
-  BOOL: 11,
-  TYPES_COUNT: 12
-};
 function dataTypeLength(dt) {
   switch (dt) {
-    case DataType.INT8:
-    case DataType.UINT8:
-    case DataType.BOOL:
+    case 1 /* INT8 */:
+    case 2 /* UINT8 */:
+    case 11 /* BOOL */:
       return 1;
-    case DataType.INT16:
-    case DataType.UINT16:
+    case 3 /* INT16 */:
+    case 4 /* UINT16 */:
       return 2;
-    case DataType.INT32:
-    case DataType.UINT32:
-    case DataType.FLOAT32:
+    case 5 /* INT32 */:
+    case 6 /* UINT32 */:
+    case 9 /* FLOAT32 */:
       return 4;
-    case DataType.INT64:
-    case DataType.UINT64:
-    case DataType.FLOAT64:
+    case 7 /* INT64 */:
+    case 8 /* UINT64 */:
+    case 10 /* FLOAT64 */:
       return 8;
     default:
       return -1;
@@ -59,73 +44,73 @@ var Type = {
   NAMED_ATTRIBUTES_COUNT: 5
 };
 var GeometryAttribute = class {
-  e = null;
-  E = 1;
-  Y = DataType.FLOAT32;
-  Qa = false;
-  O = 0;
-  P = 0;
-  Ca = Type.INVALID;
-  Da = 0;
+  d = null;
+  z = 1;
+  P = 9 /* FLOAT32 */;
+  _a = false;
+  Q = 0;
+  R = 0;
+  Ja = Type.INVALID;
+  Ka = 0;
   init(attributeType, buffer, numComponents, dataType, normalized, byteStride, byteOffset) {
-    this.e = buffer;
-    this.E = numComponents;
-    this.Y = dataType;
-    this.Qa = normalized;
-    this.O = byteStride;
-    this.P = byteOffset;
-    this.Ca = attributeType;
+    this.d = buffer;
+    this.z = numComponents;
+    this.P = dataType;
+    this._a = normalized;
+    this.Q = byteStride;
+    this.R = byteOffset;
+    this.Ja = attributeType;
   }
   resetBuffer(buffer, byteStride, byteOffset) {
-    this.e = buffer;
-    this.O = byteStride;
-    this.P = byteOffset;
+    this.d = buffer;
+    this.Q = byteStride;
+    this.R = byteOffset;
   }
   get attributeType() {
-    return this.Ca;
+    return this.Ja;
   }
   get dataType() {
-    return this.Y;
+    return this.P;
   }
   get numComponents() {
-    return this.E;
+    return this.z;
   }
   get buffer() {
-    return this.e;
+    return this.d;
   }
   get byteStride() {
-    return this.O;
+    return this.Q;
   }
   get byteOffset() {
-    return this.P;
+    return this.R;
   }
   get uniqueId() {
-    return this.Da;
+    return this.Ka;
   }
   set uniqueId(id) {
-    this.Da = id;
+    this.Ka = id;
   }
 };
 
 // src/decoder/point_cloud/PointCloud.ts
 var NAMED_ATTRIBUTES_COUNT = 8;
 var PointCloud = class {
-  num_points_ = 0;
+  wb = 0;
   attributes_ = [];
   // named_attribute_index_[type] = [att_id, ...], one list per named type.
-  named_attribute_index_ = [[], [], [], [], [], [], [], []];
+  $a = [[], [], [], [], [], [], [], []];
   numNamedAttributes(type) {
     if (type < 0 || type >= NAMED_ATTRIBUTES_COUNT) {
       return 0;
     }
-    return this.named_attribute_index_[type].length;
+    return this.$a[type].length;
   }
   getNamedAttributeId(type, i) {
     if (i === void 0) i = 0;
     if (this.numNamedAttributes(type) <= i) {
       return -1;
     }
-    return this.named_attribute_index_[type][i];
+    return this.$a[type][i];
   }
   getNamedAttribute(type, i) {
     if (i === void 0) i = 0;
@@ -165,31 +150,26 @@ var PointCloud = class {
       this.attributes_.push(null);
     }
     if (pa.attributeType < NAMED_ATTRIBUTES_COUNT) {
-      this.named_attribute_index_[pa.attributeType].push(attId);
+      this.$a[pa.attributeType].push(attId);
     }
     pa.uniqueId = attId;
     this.attributes_[attId] = pa;
   }
   numPoints() {
-    return this.num_points_;
+    return this.wb;
   }
   setNumPoints(num) {
-    this.num_points_ = num;
+    this.wb = num;
   }
 };
 
 // src/decoder/mesh/Mesh.ts
-var MeshAttributeElementType = {
-  MESH_VERTEX_ATTRIBUTE: 0,
-  MESH_CORNER_ATTRIBUTE: 1,
-  MESH_FACE_ATTRIBUTE: 2
-};
 var Mesh = class extends PointCloud {
   // Flat Int32Array, 3 point indices per face, for cache locality and to avoid
   // a per-face allocation. faces_[3*f + c] is corner c of face f; corner index
   // ci maps directly to faces_[ci].
   faces_ = new Int32Array(0);
-  numFaces_ = 0;
+  xb = 0;
   // Sizes faces_ to hold numFaces faces. Called once per decode, before any
   // face index is written (edgebreaker: _assignPointsToCorners; sequential:
   // decodeConnectivity), so the buffer is allocated exactly here — the
@@ -201,10 +181,42 @@ var Mesh = class extends PointCloud {
       grown.set(this.faces_);
       this.faces_ = grown;
     }
-    this.numFaces_ = numFaces;
+    this.xb = numFaces;
   }
   numFaces() {
-    return this.numFaces_;
+    return this.xb;
+  }
+};
+
+// src/decoder/core/DataBuffer.ts
+var DataBuffer = class {
+  p = new Uint8Array(0);
+  // Resizes to `size` bytes (contents preserved); when `data` is given, grows
+  // as needed and copies its first `size` bytes in.
+  update(data, size) {
+    if (data === null) {
+      this.yb(size);
+      return;
+    }
+    if (size > this.p.length) {
+      this.yb(size);
+    }
+    this.p.set(data.length === size ? data : data.subarray(0, size));
+  }
+  // The caller passes a Uint8Array of exactly dataSize bytes in the common
+  // case; avoid allocating a wrapper view per value (dominates storage time /
+  // GC pressure).
+  write(bytePos, inArray, dataSize) {
+    this.p.set(inArray.length === dataSize ? inArray : inArray.subarray(0, dataSize), bytePos);
+  }
+  get data() {
+    return this.p;
+  }
+  yb(newSize) {
+    if (newSize === this.p.length) return;
+    const newData = new Uint8Array(newSize);
+    newData.set(this.p.subarray(0, Math.min(this.p.length, newSize)));
+    this.p = newData;
   }
 };
 
@@ -289,155 +301,140 @@ var releaseScratch = () => {
   borrowedUint8.length = 0;
 };
 
-// src/decoder/core/DataBuffer.ts
-var DataBuffer = class {
-  n = new Uint8Array(0);
-  // Resizes to `size` bytes (contents preserved); when `data` is given, grows
-  // as needed and copies its first `size` bytes in.
-  update(data, size) {
-    if (data === null) {
-      this.lb(size);
-      return;
-    }
-    if (size > this.n.length) {
-      this.lb(size);
-    }
-    this.n.set(data.length === size ? data : data.subarray(0, size));
-  }
-  // Replaces the contents with a decode-scoped scratch buffer of exactly
-  // `size` bytes; the previous contents are dropped and the new ones are
-  // arbitrary, so every byte must be written before it is read. Only for
-  // buffers that never outlive the decode (see ScratchArena) — the portable
-  // attributes the integer decoders build and discard per attribute are the
-  // one caller, and their per-primitive allocation showed up in profiles.
-  adoptScratch(size) {
-    this.n = scratchUint8(size);
-  }
-  // The caller passes a Uint8Array of exactly dataSize bytes in the common
-  // case; avoid allocating a wrapper view per value (dominates storage time /
-  // GC pressure).
-  write(bytePos, inArray, dataSize) {
-    this.n.set(inArray.length === dataSize ? inArray : inArray.subarray(0, dataSize), bytePos);
-  }
-  get data() {
-    return this.n;
-  }
-  lb(newSize) {
-    if (newSize === this.n.length) return;
-    const newData = new Uint8Array(newSize);
-    newData.set(this.n.subarray(0, Math.min(this.n.length, newSize)));
-    this.n = newData;
-  }
-};
-
 // src/decoder/attributes/PointAttribute.ts
 function viewCtorFor(dt) {
   switch (dt) {
-    case DataType.INT8:
+    case 1 /* INT8 */:
       return Int8Array;
-    case DataType.UINT8:
+    case 2 /* UINT8 */:
       return Uint8Array;
-    case DataType.INT16:
+    case 3 /* INT16 */:
       return Int16Array;
-    case DataType.UINT16:
+    case 4 /* UINT16 */:
       return Uint16Array;
-    case DataType.INT32:
+    case 5 /* INT32 */:
       return Int32Array;
-    case DataType.UINT32:
+    case 6 /* UINT32 */:
       return Uint32Array;
-    case DataType.FLOAT32:
+    case 9 /* FLOAT32 */:
       return Float32Array;
-    case DataType.FLOAT64:
+    case 10 /* FLOAT64 */:
       return Float64Array;
     default:
       return null;
   }
 }
+var LAZY_NONE = 0;
+var LAZY_INTEGER = 1;
+var LAZY_QUANTIZED = 2;
+var LAZY_OCTAHEDRON = 3;
 var PointAttribute = class extends GeometryAttribute {
-  K = false;
-  Ra = 0;
-  L = [];
-  y = null;
-  Pb = null;
+  E = false;
+  ab = 0;
+  F = [];
+  $ = null;
   // Lazily-created cached typed-array view over the attribute buffer, keyed
   // on (constructor, underlying ArrayBuffer). An attribute only ever reads
   // through the one view type its data type dictates.
-  mb = null;
-  nb = null;
-  ob = null;
+  zb = null;
+  Ab = null;
+  Bb = null;
+  // Deferred inverse transform. The integer attribute decoders leave their
+  // decoded values here as int32 -- quantized floats, octahedral normals or
+  // plain integers -- with the transform's parameters, and extractTo applies
+  // the transform while gathering the values into point order: one pass over
+  // the points instead of an inverse-transform pass into a per-value buffer
+  // followed by a gather from it, and no such buffer at all.
+  La = LAZY_NONE;
+  aa = null;
+  Cb = [];
+  Ma = 0;
   constructor(geometryAttribute) {
     super();
     if (geometryAttribute instanceof GeometryAttribute) {
-      this.e = geometryAttribute.e;
-      this.E = geometryAttribute.E;
-      this.Y = geometryAttribute.Y;
-      this.Qa = geometryAttribute.Qa;
-      this.O = geometryAttribute.O;
+      this.d = geometryAttribute.d;
+      this.z = geometryAttribute.z;
       this.P = geometryAttribute.P;
-      this.Ca = geometryAttribute.Ca;
-      this.Da = geometryAttribute.Da;
+      this._a = geometryAttribute._a;
+      this.Q = geometryAttribute.Q;
+      this.R = geometryAttribute.R;
+      this.Ja = geometryAttribute.Ja;
+      this.Ka = geometryAttribute.Ka;
     }
   }
   // Intentionally shadows GeometryAttribute.init with a different signature (matches draco.js / C++ source).
   // @ts-expect-error -- signature intentionally differs from the base class, as in the source.
   init(attributeType, numComponents, dataType, normalized, numAttributeValues) {
-    this.y = new DataBuffer();
+    this.$ = new DataBuffer();
     const byteStride = dataTypeLength(dataType) * numComponents;
-    super.init(attributeType, this.y, numComponents, dataType, normalized, byteStride, 0);
+    super.init(attributeType, this.$, numComponents, dataType, normalized, byteStride, 0);
     this.reset(numAttributeValues);
     this.setIdentityMapping();
   }
   reset(numAttributeValues) {
-    if (this.y === null) {
-      this.y = new DataBuffer();
+    if (this.$ === null) {
+      this.$ = new DataBuffer();
     }
     const entrySize = dataTypeLength(this.dataType) * this.numComponents;
-    this.y.update(null, numAttributeValues * entrySize);
-    this.resetBuffer(this.y, entrySize, 0);
-    this.Ra = numAttributeValues;
+    this.$.update(null, numAttributeValues * entrySize);
+    this.resetBuffer(this.$, entrySize, 0);
+    this.ab = numAttributeValues;
     return true;
   }
-  // Like reset(), but backs the attribute with decode-scoped scratch memory.
-  // Only valid for attributes that never escape the decode and whose every
-  // byte is written before it is read (see DataBuffer.adoptScratch).
-  resetScratch(numAttributeValues) {
-    if (this.y === null) {
-      this.y = new DataBuffer();
-    }
-    const entrySize = dataTypeLength(this.dataType) * this.numComponents;
-    this.y.adoptScratch(numAttributeValues * entrySize);
-    this.resetBuffer(this.y, entrySize, 0);
-    this.Ra = numAttributeValues;
-    return true;
+  // Sizes the attribute without allocating storage, for the deferred
+  // transforms below (the values live in the decoder's portable attribute).
+  resetLazy(numAttributeValues) {
+    this.ab = numAttributeValues;
+  }
+  // numValues decoded integers of the attribute's own integer type, stored as
+  // int32; extractTo converts them to the requested output type.
+  setLazyInteger(values) {
+    this.La = LAZY_INTEGER;
+    this.aa = values;
+  }
+  // Quantized float values: value * delta + min per component (float32
+  // arithmetic, see _extractQuantized), as the C++ Dequantizer computes them.
+  setLazyQuantized(values, minValues, delta) {
+    this.La = LAZY_QUANTIZED;
+    this.aa = values;
+    this.Cb = minValues;
+    this.Ma = delta;
+  }
+  // Octahedral normals: two quantized coordinates per value, dequantized by
+  // `scale` and turned into unit vectors (see _extractOctahedron).
+  setLazyOctahedron(values, scale) {
+    this.La = LAZY_OCTAHEDRON;
+    this.aa = values;
+    this.Ma = scale;
   }
   get size() {
-    return this.Ra;
+    return this.ab;
   }
   mappedIndex(pointIndex) {
-    if (this.K) {
+    if (this.E) {
       return pointIndex;
     }
-    return this.L[pointIndex];
+    return this.F[pointIndex];
   }
   get isMappingIdentity() {
-    return this.K;
+    return this.E;
   }
   get indicesMapSize() {
-    if (this.K) {
+    if (this.E) {
       return 0;
     }
-    return this.L.length;
+    return this.F.length;
   }
   // Direct access to the explicit point->value index map (a Uint32Array after
   // any of the setExplicitMapping* calls). Lets hot mapping loops write
   // entries without a per-entry dispatch.
   get indicesMap() {
-    return this.L;
+    return this.F;
   }
   // Implicit mapping: point index equals attribute entry index.
   setIdentityMapping() {
-    this.K = true;
-    this.L = [];
+    this.E = true;
+    this.F = [];
   }
   // Explicit mapping without an invalid-index fill. Only for callers that
   // provably write every entry right away (the fill was ~4% of decode time on
@@ -447,80 +444,76 @@ var PointAttribute = class extends GeometryAttribute {
   // and avoids boxed-number storage; it is read once per point per attribute.
   // Must be UNSIGNED so the 0xFFFFFFFF invalid sentinel round-trips intact.
   setExplicitMappingUnfilled(numPoints) {
-    this.K = false;
-    this.L = new Uint32Array(numPoints);
+    this.E = false;
+    this.F = new Uint32Array(numPoints);
   }
   // Adopts an already-computed map, shared with other attributes of the same
   // mesh. The map must be treated as read-only from here on (reads go through
   // mappedIndex/extractTo).
   setExplicitMappingShared(map) {
-    this.K = false;
-    this.L = map;
+    this.E = false;
+    this.F = map;
   }
   // Like setExplicitMappingUnfilled, but from decode-scoped scratch. Only for
   // attributes that never escape the decode (see ScratchArena) -- the portable
   // attributes the sequential decoders build and discard.
   setExplicitMappingScratch(numPoints) {
-    this.K = false;
-    this.L = scratchUint32(numPoints);
-  }
-  setAttributeTransformData(transformData) {
-    this.Pb = transformData;
+    this.E = false;
+    this.F = scratchUint32(numPoints);
   }
   // Cached typed-array view of the given type over the attribute buffer.
-  Sa(Ctor, bufData) {
-    if (this.mb !== Ctor || this.nb !== bufData.buffer) {
-      this.mb = Ctor;
-      this.nb = bufData.buffer;
-      this.ob = new Ctor(bufData.buffer);
-    }
-    return this.ob;
-  }
-  // Mirrors C++ PointAttribute::ConvertValue<T>(). Attribute buffers start at
-  // byteOffset 0 and entries are naturally aligned, so every type reads
-  // through a typed-array view instead of a per-component DataView dispatch.
+  Db(Ctor, bufData) {
+    if (this.zb !== Ctor || this.Ab !== bufData.buffer) {
+      this.zb = Ctor;
+      this.Ab = bufData.buffer;
+      this.Bb = new Ctor(bufData.buffer);
+    }
+    return this.Bb;
+  }
+  // Mirrors C++ PointAttribute::ConvertValue<T>() for buffer-backed
+  // attributes. Attribute buffers start at byteOffset 0 and entries are
+  // naturally aligned, so every type reads through a typed-array view instead
+  // of a per-component DataView dispatch.
   convertValue(attIndex, outVal) {
-    const bytePos = this.P + this.O * attIndex;
-    const bufData = this.e.data;
-    const dt = this.Y;
-    const nc = this.E;
-    if (dt === DataType.INT32) {
-      const view2 = this.Sa(Int32Array, bufData);
-      const baseIndex2 = bufData.byteOffset + bytePos >> 2;
-      for (let i = 0; i < nc; ++i) {
-        outVal[i] = view2[baseIndex2 + i];
-      }
-      return;
-    }
-    const Ctor = viewCtorFor(dt);
+    const bufData = this.d.data;
+    const nc = this.z;
+    const Ctor = viewCtorFor(this.P);
     if (Ctor === null) {
-      for (let i = 0; i < nc; ++i) {
-        outVal[i] = 0;
-      }
+      for (let i = 0; i < nc; ++i) outVal[i] = 0;
       return;
     }
-    const view = this.Sa(Ctor, bufData);
-    const baseIndex = (bufData.byteOffset + bytePos) / Ctor.BYTES_PER_ELEMENT;
-    for (let i = 0; i < nc; ++i) {
-      outVal[i] = view[baseIndex + i];
-    }
+    const view = this.Db(Ctor, bufData);
+    const baseIndex = (bufData.byteOffset + this.R + this.Q * attIndex) / Ctor.BYTES_PER_ELEMENT;
+    for (let i = 0; i < nc; ++i) outVal[i] = view[baseIndex + i];
   }
-  // Flat-array extraction of all values into one output typed array (avoids the
-  // per-point temp-array copy via cached typed-array views over the buffer).
+  // Flat-array extraction of all values into one output typed array, in point
+  // order (applying the deferred transform, if any, on the way).
   extractTo(OutputTypedArray, numPoints) {
-    const numComponents = this.E;
+    const numComponents = this.z;
     const array = new OutputTypedArray(numPoints * numComponents);
-    const Ctor = viewCtorFor(this.Y);
-    if (this.e === null || numPoints === 0 || Ctor === null) {
+    if (numPoints === 0) {
       return array;
     }
-    const bufData = this.e.data;
-    const isIdentity = this.K;
-    const indicesMap = this.L;
-    const srcView = this.Sa(Ctor, bufData);
+    const kind = this.La;
+    if (kind !== LAZY_NONE) {
+      if (this.aa !== null) {
+        if (kind === LAZY_QUANTIZED) this.gc(array, numPoints);
+        else if (kind === LAZY_OCTAHEDRON) this.hc(array, numPoints);
+        else this.ic(array, numPoints);
+      }
+      return array;
+    }
+    const Ctor = viewCtorFor(this.P);
+    if (this.d === null || Ctor === null) {
+      return array;
+    }
+    const bufData = this.d.data;
+    const isIdentity = this.E;
+    const indicesMap = this.F;
+    const srcView = this.Db(Ctor, bufData);
     const shift = 31 - Math.clz32(Ctor.BYTES_PER_ELEMENT);
-    const srcStart = bufData.byteOffset + this.P >> shift;
-    const strideElements = this.O >> shift;
+    const srcStart = bufData.byteOffset + this.R >> shift;
+    const strideElements = this.Q >> shift;
     if (isIdentity && strideElements === numComponents) {
       const srcEnd = srcStart + numPoints * numComponents;
       if (srcView.constructor === OutputTypedArray) {
@@ -528,59 +521,130 @@ var PointAttribute = class extends GeometryAttribute {
         return array;
       }
     }
-    if (isIdentity) {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        const srcOffset = srcStart + i * strideElements;
-        for (let j = 0; j < numComponents; j++) {
-          array[dst + j] = srcView[srcOffset + j];
-        }
-        dst += numComponents;
-      }
-    } else if (numComponents === 3) {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        const srcOffset = srcStart + indicesMap[i] * strideElements;
-        array[dst] = srcView[srcOffset];
-        array[dst + 1] = srcView[srcOffset + 1];
-        array[dst + 2] = srcView[srcOffset + 2];
-        dst += 3;
-      }
-    } else if (numComponents === 2) {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        const srcOffset = srcStart + indicesMap[i] * strideElements;
-        array[dst] = srcView[srcOffset];
-        array[dst + 1] = srcView[srcOffset + 1];
-        dst += 2;
-      }
-    } else if (numComponents === 4) {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        const srcOffset = srcStart + indicesMap[i] * strideElements;
-        array[dst] = srcView[srcOffset];
-        array[dst + 1] = srcView[srcOffset + 1];
-        array[dst + 2] = srcView[srcOffset + 2];
-        array[dst + 3] = srcView[srcOffset + 3];
-        dst += 4;
-      }
-    } else if (numComponents === 1) {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        array[dst++] = srcView[srcStart + indicesMap[i] * strideElements];
-      }
-    } else {
-      let dst = 0;
-      for (let i = 0; i < numPoints; i++) {
-        const srcOffset = srcStart + indicesMap[i] * strideElements;
-        for (let j = 0; j < numComponents; j++) {
-          array[dst + j] = srcView[srcOffset + j];
-        }
-        dst += numComponents;
+    let dst = 0;
+    for (let i = 0; i < numPoints; i++) {
+      const srcOffset = srcStart + (isIdentity ? i : indicesMap[i]) * strideElements;
+      for (let j = 0; j < numComponents; j++) {
+        array[dst + j] = srcView[srcOffset + j];
       }
+      dst += numComponents;
     }
     return array;
   }
+  // The deferred transforms, each fused with the point-order gather. One
+  // function per transform so the engine tiers each up on its own complete
+  // type feedback (a single body for all three deoptimized once per newly
+  // seen kind, which made the first decodes of a session measurably slower).
+  // Every float step is rounded to float32 exactly where the C++ decoder's
+  // float arithmetic rounds (Dequantizer, OctahedronToolBox), so the values
+  // are bit-identical to the reference decoder whatever the output array type.
+  // Point -> value index; the identity mapping (sequential meshes) gets a
+  // plain iota so the loops carry no per-point branch.
+  bb(numPoints) {
+    if (!this.E) return this.F;
+    const map = new Uint32Array(numPoints);
+    for (let p = 0; p < numPoints; ++p) map[p] = p;
+    return map;
+  }
+  // The C++ starts from static_cast<float>(value). An integer below 2^24 is
+  // exact as a float32 and its product with a float32 is exact as a double,
+  // so for such values `fround(value * scale)` is that float32 product
+  // without the (measurably costly) int-to-float32-to-double round trip per
+  // component. Larger values (quantization above 24 bits, never seen in
+  // practice) are rounded in place once here, after which the same holds.
+  Eb() {
+    const values = this.aa;
+    for (let i = 0; i < values.length; ++i) {
+      if (values[i] >= 16777216 || values[i] <= -16777216) {
+        for (let j = 0; j < values.length; ++j) values[j] = Math.fround(values[j]);
+        break;
+      }
+    }
+    return values;
+  }
+  // C++ Dequantizer: float(value) * delta + min, all in float32.
+  gc(out, numPoints) {
+    const values = this.Eb();
+    const map = this.bb(numPoints);
+    const numComponents = this.z;
+    const fround = Math.fround;
+    const delta = this.Ma;
+    const min = this.Cb;
+    if (numComponents === 3) {
+      const m0 = min[0];
+      const m1 = min[1];
+      const m2 = min[2];
+      for (let p = 0, d = 0; p < numPoints; ++p, d += 3) {
+        const s = map[p] * 3;
+        out[d] = fround(fround(values[s] * delta) + m0);
+        out[d + 1] = fround(fround(values[s + 1] * delta) + m1);
+        out[d + 2] = fround(fround(values[s + 2] * delta) + m2);
+      }
+      return;
+    }
+    if (numComponents === 2) {
+      const m0 = min[0];
+      const m1 = min[1];
+      for (let p = 0, d = 0; p < numPoints; ++p, d += 2) {
+        const s = map[p] * 2;
+        out[d] = fround(fround(values[s] * delta) + m0);
+        out[d + 1] = fround(fround(values[s + 1] * delta) + m1);
+      }
+      return;
+    }
+    for (let p = 0, d = 0; p < numPoints; ++p) {
+      const s = map[p] * numComponents;
+      for (let c = 0; c < numComponents; ++c) {
+        out[d++] = fround(fround(values[s + c] * delta) + min[c]);
+      }
+    }
+  }
+  // OctahedronToolBox.QuantizedOctahedralCoordsToUnitVector, two quantized
+  // coordinates per value to one unit vector per point.
+  hc(out, numPoints) {
+    const values = this.Eb();
+    const map = this.bb(numPoints);
+    const fround = Math.fround;
+    const scale = this.Ma;
+    for (let p = 0, d = 0; p < numPoints; ++p, d += 3) {
+      const s = map[p] * 2;
+      let y = fround(fround(values[s] * scale) - 1);
+      let z = fround(fround(values[s + 1] * scale) - 1);
+      const x = fround(fround(1 - Math.abs(y)) - Math.abs(z));
+      let xOffset = -x;
+      if (xOffset < 0) xOffset = 0;
+      y = fround(y + (y < 0 ? xOffset : -xOffset));
+      z = fround(z + (z < 0 ? xOffset : -xOffset));
+      const normSquared = fround(fround(fround(x * x) + fround(y * y)) + fround(z * z));
+      if (normSquared < 1e-6) {
+        out[d] = 0;
+        out[d + 1] = 0;
+        out[d + 2] = 0;
+      } else {
+        const k = fround(1 / fround(Math.sqrt(normSquared)));
+        out[d] = fround(x * k);
+        out[d + 1] = fround(y * k);
+        out[d + 2] = fround(z * k);
+      }
+    }
+  }
+  // The int32 values wrap to the attribute's own integer type (as storing
+  // them into it would) before the output store converts them.
+  ic(out, numPoints) {
+    const values = this.aa;
+    const map = this.bb(numPoints);
+    const numComponents = this.z;
+    const dt = this.P;
+    const shift = 32 - 8 * dataTypeLength(dt);
+    const signed = dt === 1 /* INT8 */ || dt === 3 /* INT16 */ || dt === 5 /* INT32 */;
+    for (let p = 0, d = 0; p < numPoints; ++p) {
+      const s = map[p] * numComponents;
+      for (let c = 0; c < numComponents; ++c) {
+        const v = values[s + c] << shift;
+        out[d++] = signed ? v >> shift : v >>> shift;
+      }
+    }
+  }
 };
 
 // src/decoder/core/VarintDecoding.ts
@@ -602,21 +666,21 @@ function decodeVarint(buffer) {
 
 // src/decoder/core/DecoderBuffer.ts
 var BitDecoder = class {
-  Ea = null;
+  Na = null;
   q = 0;
-  ka = 0;
+  ra = 0;
   reset(uint8Array, byteLength) {
-    this.Ea = uint8Array;
-    this.ka = byteLength;
+    this.Na = uint8Array;
+    this.ra = byteLength;
     this.q = 0;
   }
   getBits(nbits) {
     if (nbits > 32) return void 0;
-    const buf = this.Ea;
+    const buf = this.Na;
     let off = this.q;
     const byteOffset = off >> 3;
     const bitShift = off & 7;
-    if (byteOffset + 4 < this.ka) {
+    if (byteOffset + 4 < this.ra) {
       const val = (buf[byteOffset] | buf[byteOffset + 1] << 8 | buf[byteOffset + 2] << 16 | buf[byteOffset + 3] << 24) >>> 0;
       let result;
       if (nbits > 32 - bitShift) {
@@ -635,7 +699,7 @@ var BitDecoder = class {
     let currOff = off;
     while (bitsRead < nbits) {
       const bOff = currOff >> 3;
-      if (bOff >= this.ka) return void 0;
+      if (bOff >= this.ra) return void 0;
       const bShift = currOff & 7;
       const bitsAvail = 8 - bShift;
       const bitsNeeded = nbits - bitsRead;
@@ -650,61 +714,49 @@ var BitDecoder = class {
   }
 };
 var DecoderBuffer = class {
-  n = null;
-  la = null;
-  z = 0;
-  d = 0;
-  ma = new BitDecoder();
-  Fa = false;
+  p = null;
+  Oa = null;
+  M = 0;
+  e = 0;
+  sa = new BitDecoder();
+  Pa = false;
   init(data, dataSize = data.length) {
-    this.n = data;
-    this.la = new DataView(data.buffer, data.byteOffset, data.byteLength);
-    this.z = dataSize;
-    this.d = 0;
+    this.p = data;
+    this.Oa = new DataView(data.buffer, data.byteOffset, data.byteLength);
+    this.M = dataSize;
+    this.e = 0;
   }
   // Typed little-endian reads.
   decodeUint8() {
-    if (this.d + 1 > this.z) return void 0;
-    const val = this.n[this.d];
-    this.d += 1;
-    return val;
-  }
-  decodeInt8() {
-    if (this.d + 1 > this.z) return void 0;
-    const val = this.la.getInt8(this.d);
-    this.d += 1;
+    if (this.e + 1 > this.M) return void 0;
+    const val = this.p[this.e];
+    this.e += 1;
     return val;
   }
   decodeUint16() {
-    if (this.d + 2 > this.z) return void 0;
-    const val = this.la.getUint16(this.d, true);
-    this.d += 2;
+    if (this.e + 2 > this.M) return void 0;
+    const val = this.Oa.getUint16(this.e, true);
+    this.e += 2;
     return val;
   }
   decodeInt32() {
-    if (this.d + 4 > this.z) return void 0;
-    const val = this.la.getInt32(this.d, true);
-    this.d += 4;
+    if (this.e + 4 > this.M) return void 0;
+    const val = this.Oa.getInt32(this.e, true);
+    this.e += 4;
     return val;
   }
   decodeFloat32() {
-    if (this.d + 4 > this.z) return void 0;
-    const val = this.la.getFloat32(this.d, true);
-    this.d += 4;
+    if (this.e + 4 > this.M) return void 0;
+    const val = this.Oa.getFloat32(this.e, true);
+    this.e += 4;
     return val;
   }
-  decodeBytes(size) {
-    if (this.d + size > this.z) return void 0;
-    const result = this.n.slice(this.d, this.d + size);
-    this.d += size;
-    return result;
-  }
-  // Zero-copy variant of decodeBytes: a view into the stream, only valid until
-  // the caller's next chance to mutate the buffer — copy out before keeping it.
+  // A view into the stream (no copy), only valid until the caller's next
+  // chance to mutate the buffer — copy out before keeping it.
   decodeBytesView(size) {
-    if (this.d + size > this.z) return void 0;
-    const result = this.n.subarray(this.d, this.d + size);
-    this.d += size;
+    if (this.e + size > this.M) return void 0;
+    const result = this.p.subarray(this.e, this.e + size);
+    this.e += size;
     return result;
   }
   // Only the 2.2+ layout (varint size prefix): older bitstreams are rejected
@@ -716,80 +768,39 @@ var DecoderBuffer = class {
       if (size === void 0) return void 0;
       outSize = size;
     }
-    this.Fa = true;
-    this.ma.reset(this.n.subarray(this.d), this.z - this.d);
+    this.Pa = true;
+    this.sa.reset(this.p.subarray(this.e), this.M - this.e);
     return outSize;
   }
   endBitDecoding() {
-    this.Fa = false;
-    this.d += Math.ceil(this.ma.q / 8);
+    this.Pa = false;
+    this.e += Math.ceil(this.sa.q / 8);
   }
   decodeLeastSignificantBits32(nbits) {
-    if (!this.Fa) return void 0;
-    return this.ma.getBits(nbits);
+    if (!this.Pa) return void 0;
+    return this.sa.getBits(nbits);
   }
   advance(bytes) {
-    this.d += bytes;
+    this.e += bytes;
   }
   get data() {
-    return this.n;
+    return this.p;
   }
   get dataHead() {
-    return this.n.subarray(this.d);
+    return this.p.subarray(this.e);
   }
   get remainingSize() {
-    return this.z - this.d;
+    return this.M - this.e;
   }
   get decodedSize() {
-    return this.d;
+    return this.e;
   }
   get bitDecoderActive() {
-    return this.Fa;
+    return this.Pa;
   }
 };
 
 // src/decoder/compression/config/CompressionShared.ts
-var EncodedGeometryType = {
-  POINT_CLOUD: 0,
-  TRIANGULAR_MESH: 1
-};
-var MeshEncoderMethod = {
-  MESH_SEQUENTIAL_ENCODING: 0,
-  MESH_EDGEBREAKER_ENCODING: 1
-};
-var SequentialAttributeEncoderType = {
-  SEQUENTIAL_ATTRIBUTE_ENCODER_GENERIC: 0,
-  SEQUENTIAL_ATTRIBUTE_ENCODER_INTEGER: 1,
-  SEQUENTIAL_ATTRIBUTE_ENCODER_QUANTIZATION: 2,
-  SEQUENTIAL_ATTRIBUTE_ENCODER_NORMALS: 3
-};
-var PredictionSchemeMethod = {
-  PREDICTION_NONE: -2,
-  MESH_PREDICTION_PARALLELOGRAM: 1,
-  MESH_PREDICTION_MULTI_PARALLELOGRAM: 2,
-  MESH_PREDICTION_CONSTRAINED_MULTI_PARALLELOGRAM: 4,
-  MESH_PREDICTION_TEX_COORDS_PORTABLE: 5,
-  MESH_PREDICTION_GEOMETRIC_NORMAL: 6,
-  NUM_PREDICTION_SCHEMES: 7
-};
-var PredictionSchemeTransformType = {
-  PREDICTION_TRANSFORM_NONE: -1,
-  PREDICTION_TRANSFORM_WRAP: 1,
-  PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON: 2,
-  PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED: 3,
-  NUM_PREDICTION_SCHEME_TRANSFORM_TYPES: 4
-};
-var MeshTraversalMethod = {
-  MESH_TRAVERSAL_DEPTH_FIRST: 0,
-  MESH_TRAVERSAL_PREDICTION_DEGREE: 1,
-  NUM_TRAVERSAL_METHODS: 2
-};
-var MeshEdgebreakerConnectivityEncodingMethod = {
-  MESH_EDGEBREAKER_STANDARD_ENCODING: 0,
-  MESH_EDGEBREAKER_PREDICTIVE_ENCODING: 1,
-  // Deprecated.
-  MESH_EDGEBREAKER_VALENCE_ENCODING: 2
-};
 var DracoHeader = class {
   versionMajor = 0;
   versionMinor = 0;
@@ -797,76 +808,72 @@ var DracoHeader = class {
   encoderMethod = 0;
   flags = 0;
 };
-var SymbolCodingMethod = {
-  SYMBOL_CODING_TAGGED: 0,
-  SYMBOL_CODING_RAW: 1
-};
 var METADATA_FLAG_MASK = 32768;
 
 // src/decoder/metadata/MetadataDecoder.ts
 var kMaxSubmetadataLevel = 1e3;
 var MetadataDecoder = class {
   constructor(buffer_) {
-    this.buffer_ = buffer_;
+    this.G = buffer_;
   }
   buffer_;
   // Skips per-attribute metadata followed by the geometry-level metadata.
   skipGeometryMetadata() {
-    const numAttMetadata = decodeVarint(this.buffer_);
+    const numAttMetadata = decodeVarint(this.G);
     if (numAttMetadata === void 0) {
       return false;
     }
     for (let i = 0; i < numAttMetadata; ++i) {
-      if (decodeVarint(this.buffer_) === void 0) {
+      if (decodeVarint(this.G) === void 0) {
         return false;
       }
-      if (!this.Ta(0)) {
+      if (!this.cb(0)) {
         return false;
       }
     }
-    return this.Ta(0);
+    return this.cb(0);
   }
   // Discards one metadata block (key-value entries plus nested sub-metadata).
   // Sub-blocks read depth-first in stream order, matching the C++ stack traversal.
-  Ta(level) {
+  cb(level) {
     if (level > kMaxSubmetadataLevel) {
       return false;
     }
-    const numEntries = decodeVarint(this.buffer_);
+    const numEntries = decodeVarint(this.G);
     if (numEntries === void 0) {
       return false;
     }
     for (let i = 0; i < numEntries; ++i) {
-      const nameSkipped = this.pb();
-      const dataSize = nameSkipped ? decodeVarint(this.buffer_) : void 0;
-      if (dataSize === void 0 || dataSize === 0 || !this.qb(dataSize)) {
+      const nameSkipped = this.Fb();
+      const dataSize = nameSkipped ? decodeVarint(this.G) : void 0;
+      if (dataSize === void 0 || dataSize === 0 || !this.Gb(dataSize)) {
         return false;
       }
     }
-    const numSubMetadata = decodeVarint(this.buffer_);
-    if (numSubMetadata === void 0 || numSubMetadata > this.buffer_.remainingSize) {
+    const numSubMetadata = decodeVarint(this.G);
+    if (numSubMetadata === void 0 || numSubMetadata > this.G.remainingSize) {
       return false;
     }
     for (let i = 0; i < numSubMetadata; ++i) {
-      if (!this.pb() || !this.Ta(level + 1)) {
+      if (!this.Fb() || !this.cb(level + 1)) {
         return false;
       }
     }
     return true;
   }
   // Skips a name (uint8 length prefix followed by that many bytes).
-  pb() {
-    const nameLen = this.buffer_.decodeUint8();
+  Fb() {
+    const nameLen = this.G.decodeUint8();
     if (nameLen === void 0) {
       return false;
     }
-    return this.qb(nameLen);
+    return this.Gb(nameLen);
   }
-  qb(size) {
-    if (size > this.buffer_.remainingSize) {
+  Gb(size) {
+    if (size > this.G.remainingSize) {
       return false;
     }
-    this.buffer_.advance(size);
+    this.G.advance(size);
     return true;
   }
 };
@@ -936,12 +943,13 @@ var RAnsDecoder = class {
   // flat
   cumProbTable = null;
   // flat
-  // Short-stream mode (see ransBuildLookUpTable): no full-precision lut; a
+  // Coarse mode (see ransBuildLookUpTable): no full-precision lut; a
   // 256-entry bucket table narrows each lookup to a symbol range that a short
   // cumProb scan finishes. cumProbTable then carries one extra trailing entry
   // (== ransPrecision) so the scan needs no bounds check.
   coarse = false;
   bucketShift = 0;
+  // Uint16 unless the alphabet needs wider ids, so real streams keep one table type.
   bucketTable = null;
   // Stream state inlined (not a nested AnsDecoder) so the ransRead() hot loop
   // touches own props; initialized by ansReadInit.
@@ -1001,47 +1009,14 @@ var RAnsDecoder = class {
   }
   // Batch ransRead() into out[0..count): all fields hoisted to locals, state
   // written back once. Removes per-symbol property reads and call indirection.
-  // lutTable's element type varies per decoder (Uint8/16/32 by symbol count),
-  // which would make the hot lutTable[rem] access site polymorphic — dispatch
-  // once here so each loop body stays monomorphic on its concrete type. The
-  // three bodies are intentionally identical copies.
   decodeSymbols(out, count) {
     if (this.coarse) {
-      this.Qb(out, count);
+      this.jc(out, count);
       return;
     }
-    const lutTable = this.lutTable;
-    if (lutTable instanceof Uint8Array) {
-      this.Rb(out, count, lutTable);
-    } else if (lutTable instanceof Uint16Array) {
-      this.Sb(out, count, lutTable);
-    } else {
-      this.Tb(out, count, lutTable);
-    }
-  }
-  Rb(out, count, lutTable) {
-    const buf = this.buf;
-    const lRansBase = this.lRansBase;
-    const ransPrecisionBits = this.ransPrecisionBits;
-    const ransPrecisionMask = this.ransPrecisionMask;
-    const probTable = this.probTable;
-    const cumProbTable = this.cumProbTable;
-    let state = this.state;
-    let bufOffset = this.bufOffset;
-    const bufStart = this.bufStart;
-    for (let i = 0; i < count; ++i) {
-      while (state < lRansBase && bufOffset > bufStart) {
-        state = state << 8 | buf[--bufOffset];
-      }
-      const rem = state & ransPrecisionMask;
-      const symbol = lutTable[rem];
-      out[i] = symbol;
-      state = (state >>> ransPrecisionBits) * probTable[symbol] + rem - cumProbTable[symbol];
-    }
-    this.state = state;
-    this.bufOffset = bufOffset;
+    this.kc(out, count, this.lutTable);
   }
-  Sb(out, count, lutTable) {
+  kc(out, count, lutTable) {
     const buf = this.buf;
     const lRansBase = this.lRansBase;
     const ransPrecisionBits = this.ransPrecisionBits;
@@ -1065,7 +1040,7 @@ var RAnsDecoder = class {
   }
   // Short-stream loop: bucket table + cumProb scan instead of the full lut.
   // Same state arithmetic as the lut loops, so the output is identical.
-  Qb(out, count) {
+  jc(out, count) {
     const buf = this.buf;
     const lRansBase = this.lRansBase;
     const ransPrecisionBits = this.ransPrecisionBits;
@@ -1090,28 +1065,6 @@ var RAnsDecoder = class {
     this.state = state;
     this.bufOffset = bufOffset;
   }
-  Tb(out, count, lutTable) {
-    const buf = this.buf;
-    const lRansBase = this.lRansBase;
-    const ransPrecisionBits = this.ransPrecisionBits;
-    const ransPrecisionMask = this.ransPrecisionMask;
-    const probTable = this.probTable;
-    const cumProbTable = this.cumProbTable;
-    let state = this.state;
-    let bufOffset = this.bufOffset;
-    const bufStart = this.bufStart;
-    for (let i = 0; i < count; ++i) {
-      while (state < lRansBase && bufOffset > bufStart) {
-        state = state << 8 | buf[--bufOffset];
-      }
-      const rem = state & ransPrecisionMask;
-      const symbol = lutTable[rem];
-      out[i] = symbol;
-      state = (state >>> ransPrecisionBits) * probTable[symbol] + rem - cumProbTable[symbol];
-    }
-    this.state = state;
-    this.bufOffset = bufOffset;
-  }
   // Builds the decoding tables. Returns false on bad input data.
   //
   // expectedCount is how many symbols the caller will decode from this stream.
@@ -1121,10 +1074,13 @@ var RAnsDecoder = class {
   // get a coarse 256-entry bucket table (symbol at the start of each
   // precision/256-wide bucket) and finish each lookup with a scan of the
   // cumulative probabilities; long streams keep the exact lut, whose per-symbol
-  // cost is lower.
+  // cost is lower. The coarse tables also serve an alphabet wider than a
+  // Uint16 lut entry (raw symbol coding allows 2^18 symbols; no real file
+  // has been seen past 2^14), rather than keeping a Uint32 copy of every
+  // lut loop for it.
   ransBuildLookUpTable(tokenProbs, numSymbols, expectedCount = 2147483647) {
     const ransPrecision = this.ransPrecision;
-    const coarse = numSymbols <= 65535 && expectedCount * COARSE_STREAM_FACTOR < ransPrecision;
+    const coarse = numSymbols > 65536 || expectedCount * COARSE_STREAM_FACTOR < ransPrecision;
     this.coarse = coarse;
     const probTable = acquirePooled(Uint32Array, numSymbols);
     const cumProbTable = acquirePooled(Uint32Array, numSymbols + 1);
@@ -1147,7 +1103,7 @@ var RAnsDecoder = class {
       }
       cumProbTable[numSymbols] = ransPrecision;
       const bucketShift = this.ransPrecisionBits - COARSE_BUCKET_BITS;
-      const bucketTable = acquirePooled(Uint16Array, 1 << COARSE_BUCKET_BITS);
+      const bucketTable = numSymbols > 65536 ? acquirePooled(Uint32Array, 1 << COARSE_BUCKET_BITS) : acquirePooled(Uint16Array, 1 << COARSE_BUCKET_BITS);
       this.bucketShift = bucketShift;
       this.bucketTable = bucketTable;
       let symbol = 0;
@@ -1158,8 +1114,7 @@ var RAnsDecoder = class {
       }
       return true;
     }
-    const LutArray = numSymbols <= 256 ? Uint8Array : numSymbols <= 65536 ? Uint16Array : Uint32Array;
-    const lutTable = acquirePooled(LutArray, ransPrecision);
+    const lutTable = acquirePooled(Uint16Array, ransPrecision);
     this.lutTable = lutTable;
     let actProb = 0;
     for (let i = 0; i < numSymbols; ++i) {
@@ -1186,66 +1141,9 @@ var RAnsDecoder = class {
     return true;
   }
 };
-function ransDecodeSymbolsPairU8(a, outA, countA, b, outB, countB) {
-  const lutA = a.lutTable;
-  const lutB = b.lutTable;
-  const bufA = a.buf;
-  const bufB = b.buf;
-  const probA = a.probTable;
-  const probB = b.probTable;
-  const cumA = a.cumProbTable;
-  const cumB = b.cumProbTable;
-  const lBaseA = a.lRansBase;
-  const lBaseB = b.lRansBase;
-  const bitsA = a.ransPrecisionBits;
-  const bitsB = b.ransPrecisionBits;
-  const maskA = a.ransPrecisionMask;
-  const maskB = b.ransPrecisionMask;
-  const startA = a.bufStart;
-  const startB = b.bufStart;
-  let stateA = a.state;
-  let stateB = b.state;
-  let offA = a.bufOffset;
-  let offB = b.bufOffset;
-  const shared = countA < countB ? countA : countB;
-  for (let i = 0; i < shared; ++i) {
-    while (stateA < lBaseA && offA > startA) {
-      stateA = stateA << 8 | bufA[--offA];
-    }
-    while (stateB < lBaseB && offB > startB) {
-      stateB = stateB << 8 | bufB[--offB];
-    }
-    const remA = stateA & maskA;
-    const remB = stateB & maskB;
-    const symA = lutA[remA];
-    const symB = lutB[remB];
-    outA[i] = symA;
-    outB[i] = symB;
-    stateA = (stateA >>> bitsA) * probA[symA] + remA - cumA[symA];
-    stateB = (stateB >>> bitsB) * probB[symB] + remB - cumB[symB];
-  }
-  a.state = stateA;
-  a.bufOffset = offA;
-  b.state = stateB;
-  b.bufOffset = offB;
-  if (shared < countA) {
-    a.decodeSymbols(outA.subarray(shared), countA - shared);
-  }
-  if (shared < countB) {
-    b.decodeSymbols(outB.subarray(shared), countB - shared);
-  }
-}
 function ransDecodeSymbolsPair(a, outA, countA, b, outB, countB) {
-  const lutA = a.lutTable;
-  const lutB = b.lutTable;
-  if (lutA instanceof Uint8Array && lutB instanceof Uint8Array) {
-    ransDecodeSymbolsPairU8(a, outA, countA, b, outB, countB);
-  } else if (lutA instanceof Uint16Array && lutB instanceof Uint16Array) {
+  if (!a.coarse && !b.coarse) {
     ransDecodeSymbolsPairU16(a, outA, countA, b, outB, countB);
-  } else if (lutA instanceof Uint8Array && lutB instanceof Uint16Array) {
-    ransDecodeSymbolsPairU8U16(a, outA, countA, b, outB, countB);
-  } else if (lutA instanceof Uint16Array && lutB instanceof Uint8Array) {
-    ransDecodeSymbolsPairU8U16(b, outB, countB, a, outA, countA);
   } else {
     a.decodeSymbols(outA, countA);
     b.decodeSymbols(outB, countB);
@@ -1300,56 +1198,7 @@ function ransDecodeSymbolsPairU16(a, outA, countA, b, outB, countB) {
     b.decodeSymbols(outB.subarray(shared), countB - shared);
   }
 }
-function ransDecodeSymbolsPairU8U16(a, outA, countA, b, outB, countB) {
-  const lutA = a.lutTable;
-  const lutB = b.lutTable;
-  const bufA = a.buf;
-  const bufB = b.buf;
-  const probA = a.probTable;
-  const probB = b.probTable;
-  const cumA = a.cumProbTable;
-  const cumB = b.cumProbTable;
-  const lBaseA = a.lRansBase;
-  const lBaseB = b.lRansBase;
-  const bitsA = a.ransPrecisionBits;
-  const bitsB = b.ransPrecisionBits;
-  const maskA = a.ransPrecisionMask;
-  const maskB = b.ransPrecisionMask;
-  const startA = a.bufStart;
-  const startB = b.bufStart;
-  let stateA = a.state;
-  let stateB = b.state;
-  let offA = a.bufOffset;
-  let offB = b.bufOffset;
-  const shared = countA < countB ? countA : countB;
-  for (let i = 0; i < shared; ++i) {
-    while (stateA < lBaseA && offA > startA) {
-      stateA = stateA << 8 | bufA[--offA];
-    }
-    while (stateB < lBaseB && offB > startB) {
-      stateB = stateB << 8 | bufB[--offB];
-    }
-    const remA = stateA & maskA;
-    const remB = stateB & maskB;
-    const symA = lutA[remA];
-    const symB = lutB[remB];
-    outA[i] = symA;
-    outB[i] = symB;
-    stateA = (stateA >>> bitsA) * probA[symA] + remA - cumA[symA];
-    stateB = (stateB >>> bitsB) * probB[symB] + remB - cumB[symB];
-  }
-  a.state = stateA;
-  a.bufOffset = offA;
-  b.state = stateB;
-  b.bufOffset = offB;
-  if (shared < countA) {
-    a.decodeSymbols(outA.subarray(shared), countA - shared);
-  }
-  if (shared < countB) {
-    b.decodeSymbols(outB.subarray(shared), countB - shared);
-  }
-}
-function ransDecodeSymbolsTrioU8(a, outA, countA, b, outB, countB, c, outC, countC) {
+function ransDecodeSymbolsTrioU16(a, outA, countA, b, outB, countB, c, outC, countC) {
   const lutA = a.lutTable;
   const lutB = b.lutTable;
   const lutC = c.lutTable;
@@ -1419,7 +1268,7 @@ function ransDecodeSymbolsTrioU8(a, outA, countA, b, outB, countB, c, outC, coun
   if (restB > 0) tails.push([b, outB.subarray(shared), restB]);
   if (restC > 0) tails.push([c, outC.subarray(shared), restC]);
   if (tails.length === 2) {
-    ransDecodeSymbolsPairU8(tails[0][0], tails[0][1], tails[0][2], tails[1][0], tails[1][1], tails[1][2]);
+    ransDecodeSymbolsPairU16(tails[0][0], tails[0][1], tails[0][2], tails[1][0], tails[1][1], tails[1][2]);
   } else {
     for (const [decoder, out, count] of tails) {
       decoder.decodeSymbols(out, count);
@@ -1429,14 +1278,14 @@ function ransDecodeSymbolsTrioU8(a, outA, countA, b, outB, countB, c, outC, coun
 
 // src/decoder/compression/point_cloud/PointCloudDecoder.ts
 var PointCloudDecoder = class {
-  Q = null;
-  e = null;
-  u = [];
-  Ga = [];
+  S = null;
+  d = null;
+  v = [];
+  Qa = [];
   // Returns an error message, or '' on success (outHeader is then populated).
   static decodeHeader(buffer, outHeader) {
     const kIoErrorMsg = "Failed to parse Draco header.";
-    const bytes = buffer.decodeBytes(5);
+    const bytes = buffer.decodeBytesView(5);
     if (bytes === void 0) {
       return kIoErrorMsg;
     }
@@ -1461,12 +1310,12 @@ var PointCloudDecoder = class {
   }
   // Main entry point, given the already-parsed header (see Decode.ts).
   decode(header, inBuffer, outPointCloud) {
-    this.e = inBuffer;
-    this.Q = outPointCloud;
+    this.d = inBuffer;
+    this.S = outPointCloud;
     if (header.versionMajor !== 2 || header.versionMinor !== 2) {
       return "Unsupported bitstream version (Draco 2.2 meshes only).";
     }
-    if (header.flags & METADATA_FLAG_MASK && !new MetadataDecoder(this.e).skipGeometryMetadata()) {
+    if (header.flags & METADATA_FLAG_MASK && !new MetadataDecoder(this.d).skipGeometryMetadata()) {
       return "Failed to decode metadata.";
     }
     if (!this.initializeDecoder()) {
@@ -1484,30 +1333,30 @@ var PointCloudDecoder = class {
     if (attDecoderId < 0) {
       return false;
     }
-    while (this.u.length <= attDecoderId) {
-      this.u.push(null);
+    while (this.v.length <= attDecoderId) {
+      this.v.push(null);
     }
-    this.u[attDecoderId] = decoder;
+    this.v[attDecoderId] = decoder;
     return true;
   }
   getPortableAttribute(parentAttId) {
-    if (parentAttId < 0 || parentAttId >= this.Q.numAttributes()) {
+    if (parentAttId < 0 || parentAttId >= this.S.numAttributes()) {
       return null;
     }
-    const parentAttDecoderId = this.Ga[parentAttId];
-    return this.u[parentAttDecoderId].getPortableAttribute(parentAttId);
+    const parentAttDecoderId = this.Qa[parentAttId];
+    return this.v[parentAttDecoderId].getPortableAttribute(parentAttId);
   }
   attributesDecoder(decId) {
-    return this.u[decId];
+    return this.v[decId];
   }
   numAttributesDecoders() {
-    return this.u.length;
+    return this.v.length;
   }
   pointCloud() {
-    return this.Q;
+    return this.S;
   }
   buffer() {
-    return this.e;
+    return this.d;
   }
   // -- Protected virtual methods (override in subclasses) --
   initializeDecoder() {
@@ -1521,7 +1370,7 @@ var PointCloudDecoder = class {
     return true;
   }
   decodePointAttributes() {
-    const numAttributesDecoders = this.e.decodeUint8();
+    const numAttributesDecoders = this.d.decodeUint8();
     if (numAttributesDecoders === void 0) {
       return false;
     }
@@ -1530,32 +1379,32 @@ var PointCloudDecoder = class {
         return false;
       }
     }
-    for (let i = 0; i < this.u.length; ++i) {
-      if (!this.u[i].init(this, this.Q)) {
+    for (let i = 0; i < this.v.length; ++i) {
+      if (!this.v[i].init(this, this.S)) {
         return false;
       }
     }
     for (let i = 0; i < numAttributesDecoders; ++i) {
-      if (!this.u[i].decodeAttributesDecoderData(this.e)) {
+      if (!this.v[i].decodeAttributesDecoderData(this.d)) {
         return false;
       }
     }
     for (let i = 0; i < numAttributesDecoders; ++i) {
-      const numAttributes = this.u[i].getNumAttributes();
+      const numAttributes = this.v[i].getNumAttributes();
       for (let j = 0; j < numAttributes; ++j) {
-        const attId = this.u[i].getAttributeId(j);
-        while (this.Ga.length <= attId) {
-          this.Ga.push(0);
+        const attId = this.v[i].getAttributeId(j);
+        while (this.Qa.length <= attId) {
+          this.Qa.push(0);
         }
-        this.Ga[attId] = i;
+        this.Qa[attId] = i;
       }
     }
     return this.decodeAllAttributes();
   }
   decodeAllAttributes() {
-    const decoders = this.u;
+    const decoders = this.v;
     for (let i2 = 0; i2 < decoders.length; i2++) {
-      if (!decoders[i2].decodeAttributesParse(this.e)) {
+      if (!decoders[i2].decodeAttributesParse(this.d)) {
         return false;
       }
     }
@@ -1587,10 +1436,10 @@ var PointCloudDecoder = class {
 
 // src/decoder/compression/mesh/MeshDecoder.ts
 var MeshDecoder = class extends PointCloudDecoder {
-  F = null;
+  H = null;
   // Returns an error message, or '' on success.
   decodeMesh(header, inBuffer, outMesh) {
-    this.F = outMesh;
+    this.H = outMesh;
     return this.decode(header, inBuffer, outMesh);
   }
   // Connectivity accessors used by the mesh prediction schemes; the sequential
@@ -1605,7 +1454,7 @@ var MeshDecoder = class extends PointCloudDecoder {
     return null;
   }
   mesh() {
-    return this.F;
+    return this.H;
   }
   decodeGeometryData() {
     return this.decodeConnectivity() && super.decodeGeometryData();
@@ -1616,60 +1465,60 @@ var MeshDecoder = class extends PointCloudDecoder {
 var kInvalidCornerIndex = -1;
 var kInvalidVertexIndex = -1;
 var MeshAttributeCornerTable = class {
-  is_edge_on_seam_ = [];
-  is_vertex_on_seam_ = [];
-  corner_to_vertex_map_ = [];
-  vertex_to_left_most_corner_map_ = [];
+  ba = [];
+  ta = [];
+  ca = [];
+  ua = [];
   // Attribute-vertex count. C++ keeps a vertex -> attribute-entry map here, but
   // the decoder only ever reads its size, so track the count directly instead
   // of allocating an Int32Array per attribute corner table.
-  num_attribute_vertices_ = 0;
-  corner_table_ = null;
+  va = 0;
+  w = null;
   // Lazily built; see oppositeCornerArray.
-  R = null;
+  T = null;
   // Every corner passed to addSeamEdge (may contain duplicates); lets
   // oppositeCornerArray patch seams without scanning every corner's flag.
   // Preallocated to its exact upper bound (2 per seam edge) by the caller via
   // reserveSeamEdges -- a plain array grown by push() was measurable on
   // seam-heavy files.
-  Z = [];
-  S = 0;
+  da = [];
+  U = 0;
   initEmpty(table) {
     if (table === null) {
       return false;
     }
-    this.is_edge_on_seam_ = scratchUint8Zeroed(table.numCorners());
-    this.is_vertex_on_seam_ = scratchUint8Zeroed(table.numVertices());
-    this.corner_to_vertex_map_ = scratchInt32Filled(table.numCorners(), kInvalidVertexIndex);
-    this.num_attribute_vertices_ = 0;
-    this.vertex_to_left_most_corner_map_ = [];
-    this.R = null;
-    this.Z = [];
-    this.S = 0;
-    this.corner_table_ = table;
+    this.ba = scratchUint8Zeroed(table.numCorners());
+    this.ta = scratchUint8Zeroed(table.numVertices());
+    this.ca = scratchInt32Filled(table.numCorners(), kInvalidVertexIndex);
+    this.va = 0;
+    this.ua = [];
+    this.T = null;
+    this.da = [];
+    this.U = 0;
+    this.w = table;
     return true;
   }
   // Sizes the seam-corner list for numSeamEdges upcoming addSeamEdge calls
   // (each adds at most two corners). Decode-scoped scratch.
   reserveSeamEdges(numSeamEdges) {
-    this.Z = scratchInt32(numSeamEdges * 2);
-    this.S = 0;
+    this.da = scratchInt32(numSeamEdges * 2);
+    this.U = 0;
   }
   addSeamEdge(c) {
-    const cornerToVertex = this.corner_table_.cornerToVertexArray();
-    const oppositeCorners = this.corner_table_.oppositeCornerArray();
-    const isEdge = this.is_edge_on_seam_;
-    const isVert = this.is_vertex_on_seam_;
-    const seamCorners = this.Z;
+    const cornerToVertex = this.w.cornerToVertexArray();
+    const oppositeCorners = this.w.oppositeCornerArray();
+    const isEdge = this.ba;
+    const isVert = this.ta;
+    const seamCorners = this.da;
     isEdge[c] = 1;
-    seamCorners[this.S++] = c;
+    seamCorners[this.U++] = c;
     let rem = c - (c / 3 | 0) * 3;
     isVert[cornerToVertex[rem === 2 ? c - 2 : c + 1]] = 1;
     isVert[cornerToVertex[rem === 0 ? c + 2 : c - 1]] = 1;
     const oppCorner = oppositeCorners[c];
     if (oppCorner !== kInvalidCornerIndex) {
       isEdge[oppCorner] = 1;
-      seamCorners[this.S++] = oppCorner;
+      seamCorners[this.U++] = oppCorner;
       rem = oppCorner - (oppCorner / 3 | 0) * 3;
       isVert[cornerToVertex[rem === 2 ? oppCorner - 2 : oppCorner + 1]] = 1;
       isVert[cornerToVertex[rem === 0 ? oppCorner + 2 : oppCorner - 1]] = 1;
@@ -1680,23 +1529,23 @@ var MeshAttributeCornerTable = class {
   // over the per-vertex left-most corners here). leftMostMap is decode-scoped
   // scratch sized for at least numNewVertices entries.
   setRecomputedVertices(leftMostMap, numNewVertices) {
-    this.num_attribute_vertices_ = numNewVertices;
-    this.vertex_to_left_most_corner_map_ = leftMostMap.length === numNewVertices ? leftMostMap : leftMostMap.subarray(0, numNewVertices);
+    this.va = numNewVertices;
+    this.ua = leftMostMap.length === numNewVertices ? leftMostMap : leftMostMap.subarray(0, numNewVertices);
   }
   isCornerOppositeToSeamEdge(corner) {
-    return this.is_edge_on_seam_[corner];
+    return this.ba[corner];
   }
   opposite(corner) {
     if (corner === kInvalidCornerIndex || this.isCornerOppositeToSeamEdge(corner)) {
       return kInvalidCornerIndex;
     }
-    return this.corner_table_.opposite(corner);
+    return this.w.opposite(corner);
   }
   next(corner) {
-    return this.corner_table_.next(corner);
+    return this.w.next(corner);
   }
   previous(corner) {
-    return this.corner_table_.previous(corner);
+    return this.w.previous(corner);
   }
   swingRight(corner) {
     return this.previous(this.opposite(this.previous(corner)));
@@ -1705,68 +1554,68 @@ var MeshAttributeCornerTable = class {
     return this.next(this.opposite(this.next(corner)));
   }
   numVertices() {
-    return this.num_attribute_vertices_;
+    return this.va;
   }
   numFaces() {
-    return this.corner_table_.numFaces();
+    return this.w.numFaces();
   }
   numCorners() {
-    return this.corner_table_.numCorners();
+    return this.w.numCorners();
   }
   // --- Flat-array accessors: let DepthFirstTraverser avoid per-corner dispatch. ---
   cornerToVertexArray() {
-    return this.corner_to_vertex_map_;
+    return this.ca;
   }
   // Seam-aware opposite corners (seam edges -> -1), matching opposite(). Cached on
   // first use; seams and connectivity are finalized before traversal, so it's stable.
   oppositeCornerArray() {
-    if (this.R === null) {
-      const nc = this.corner_table_.numCorners();
-      const base = this.corner_table_.oppositeCornerArray();
-      const seamCorners = this.Z;
-      const numSeamCorners = this.S;
+    if (this.T === null) {
+      const nc = this.w.numCorners();
+      const base = this.w.oppositeCornerArray();
+      const seamCorners = this.da;
+      const numSeamCorners = this.U;
       if (numSeamCorners === 0) {
-        this.R = base;
+        this.T = base;
       } else {
         const eff = scratchInt32(nc);
         eff.set(base.length === nc ? base : base.subarray(0, nc));
         for (let i = 0; i < numSeamCorners; ++i) {
           eff[seamCorners[i]] = kInvalidCornerIndex;
         }
-        this.R = eff;
+        this.T = eff;
       }
     }
-    return this.R;
+    return this.T;
   }
   vertexLeftmostCornerArray() {
-    return this.vertex_to_left_most_corner_map_;
+    return this.ua;
   }
   // Takes over another table's state wholesale. Only valid when both tables
   // were built from the same corner table and the same seam edges, in which
   // case every one of these is identical and read-only from here on.
   adoptFrom(other) {
-    this.corner_table_ = other.corner_table_;
-    this.is_edge_on_seam_ = other.is_edge_on_seam_;
-    this.is_vertex_on_seam_ = other.is_vertex_on_seam_;
-    this.corner_to_vertex_map_ = other.corner_to_vertex_map_;
-    this.num_attribute_vertices_ = other.num_attribute_vertices_;
-    this.vertex_to_left_most_corner_map_ = other.vertex_to_left_most_corner_map_;
-    this.R = other.R;
-    this.Z = other.Z;
-    this.S = other.S;
+    this.w = other.w;
+    this.ba = other.ba;
+    this.ta = other.ta;
+    this.ca = other.ca;
+    this.va = other.va;
+    this.ua = other.ua;
+    this.T = other.T;
+    this.da = other.da;
+    this.U = other.U;
   }
 };
 
 // src/decoder/compression/attributes/AttributesDecoder.ts
 var AttributesDecoder = class {
-  Ha = [];
+  Ra = [];
   // Inverse of _pointAttributeIds: point attribute id -> local id.
-  na = [];
-  rb = null;
-  Q = null;
+  wa = [];
+  Hb = null;
+  S = null;
   init(decoder, pointCloud) {
-    this.rb = decoder;
-    this.Q = pointCloud;
+    this.Hb = decoder;
+    this.S = pointCloud;
     return true;
   }
   decodeAttributesDecoderData(buffer) {
@@ -1774,8 +1623,8 @@ var AttributesDecoder = class {
     if (numAttributes === void 0 || numAttributes === 0 || numAttributes > 5 * buffer.remainingSize) {
       return false;
     }
-    this.Ha.length = numAttributes;
-    const pc = this.Q;
+    this.Ra.length = numAttributes;
+    const pc = this.S;
     for (let i = 0; i < numAttributes; i++) {
       const attType = buffer.decodeUint8();
       if (attType === void 0) return false;
@@ -1788,7 +1637,7 @@ var AttributesDecoder = class {
       if (attType >= Type.NAMED_ATTRIBUTES_COUNT) {
         return false;
       }
-      if (dataType === DataType.INVALID || dataType >= DataType.TYPES_COUNT) {
+      if (dataType === 0 /* INVALID */ || dataType >= 12 /* TYPES_COUNT */) {
         return false;
       }
       if (numComponents === 0) {
@@ -1801,42 +1650,42 @@ var AttributesDecoder = class {
       ga.uniqueId = uniqueId;
       const attId = pc.addAttribute(new PointAttribute(ga));
       pc.attribute(attId).uniqueId = uniqueId;
-      this.Ha[i] = attId;
-      while (this.na.length <= attId) {
-        this.na.push(-1);
+      this.Ra[i] = attId;
+      while (this.wa.length <= attId) {
+        this.wa.push(-1);
       }
-      this.na[attId] = i;
+      this.wa[attId] = i;
     }
     return true;
   }
   getAttributeId(i) {
-    return this.Ha[i];
+    return this.Ra[i];
   }
   getNumAttributes() {
-    return this.Ha.length;
+    return this.Ra.length;
   }
   getDecoder() {
-    return this.rb;
+    return this.Hb;
   }
   getLocalIdForPointAttribute(pointAttributeId) {
-    if (pointAttributeId >= this.na.length) {
+    if (pointAttributeId >= this.wa.length) {
       return -1;
     }
-    return this.na[pointAttributeId];
+    return this.wa[pointAttributeId];
   }
 };
 
 // src/decoder/compression/attributes/SequentialAttributeDecoder.ts
 var SequentialAttributeDecoder = class {
-  o = null;
-  G = null;
-  sb = -1;
+  n = null;
+  I = null;
+  Ib = -1;
   // Decoded portable attribute (after lossless decoding).
-  M = null;
+  ea = null;
   init(decoder, attributeId) {
-    this.o = decoder;
-    this.G = decoder.pointCloud().attribute(attributeId);
-    this.sb = attributeId;
+    this.n = decoder;
+    this.I = decoder.pointCloud().attribute(attributeId);
+    this.Ib = attributeId;
     return true;
   }
   // --- Two-phase decode ---
@@ -1847,14 +1696,20 @@ var SequentialAttributeDecoder = class {
   // stream simply do the whole decode in Parse (decodeValues); the defaults
   // below are theirs.
   decodePortableAttributeParse(pointIds, buffer) {
-    if (this.G.numComponents <= 0) {
+    if (this.I.numComponents <= 0) {
       return false;
     }
-    if (!this.G.reset(pointIds.length)) {
+    if (!this.Jb(pointIds.length)) {
       return false;
     }
     return this.decodeValues(pointIds, buffer);
   }
+  // Sizes (and here allocates) the attribute's storage for numValues values;
+  // the integer decoders override it to skip the allocation, their values
+  // staying in the portable attribute (see PointAttribute.setLazyInteger).
+  Jb(numValues) {
+    return this.I.reset(numValues);
+  }
   pendingSymbolStream() {
     return null;
   }
@@ -1870,35 +1725,35 @@ var SequentialAttributeDecoder = class {
     return true;
   }
   getPortableAttribute() {
-    if (!this.G.isMappingIdentity && this.M && this.M.isMappingIdentity) {
-      const size = this.G.indicesMapSize;
-      this.M.setExplicitMappingScratch(size);
-      const src = this.G.indicesMap;
-      const dst = this.M.indicesMap;
+    if (!this.I.isMappingIdentity && this.ea && this.ea.isMappingIdentity) {
+      const size = this.I.indicesMapSize;
+      this.ea.setExplicitMappingScratch(size);
+      const src = this.I.indicesMap;
+      const dst = this.ea.indicesMap;
       if (src.length === size) {
         dst.set(src);
       } else {
         dst.set(src.subarray(0, size));
       }
     }
-    return this.M;
+    return this.ea;
   }
   get attribute() {
-    return this.G;
+    return this.I;
   }
   get attributeId() {
-    return this.sb;
+    return this.Ib;
   }
   get decoder() {
-    return this.o;
+    return this.n;
   }
   initPredictionScheme(ps) {
     for (let i = 0; i < ps.getNumParentAttributes(); i++) {
-      const attId = this.o.pointCloud().getNamedAttributeId(ps.getParentAttributeType(i));
+      const attId = this.n.pointCloud().getNamedAttributeId(ps.getParentAttributeType(i));
       if (attId === -1) {
         return false;
       }
-      const pa = this.o.getPortableAttribute(attId);
+      const pa = this.n.getPortableAttribute(attId);
       if (pa === null || !ps.setParentAttribute(pa)) {
         return false;
       }
@@ -1908,13 +1763,13 @@ var SequentialAttributeDecoder = class {
   // Decodes raw attribute values in their original format.
   decodeValues(pointIds, buffer) {
     const numValues = pointIds.length;
-    const entrySize = this.G.byteStride;
+    const entrySize = this.I.byteStride;
     const totalSize = numValues * entrySize;
     const valueData = buffer.decodeBytesView(totalSize);
     if (valueData === void 0) {
       return false;
     }
-    this.G.buffer.write(0, valueData, totalSize);
+    this.I.buffer.write(0, valueData, totalSize);
     return true;
   }
 };
@@ -1929,14 +1784,14 @@ function convertSymbolsToSignedInts(input, count, output) {
 
 // src/decoder/compression/entropy/RAnsSymbolDecoder.ts
 var RAnsSymbolDecoder = class {
-  numSymbols_ = 0;
-  ans_;
+  Kb = 0;
+  o;
   constructor(uniqueSymbolsBitLength) {
     const unclamped = Math.trunc(3 * uniqueSymbolsBitLength / 2);
-    this.ans_ = new RAnsDecoder(unclamped < 12 ? 12 : unclamped > 20 ? 20 : unclamped);
+    this.o = new RAnsDecoder(unclamped < 12 ? 12 : unclamped > 20 ? 20 : unclamped);
   }
   get numSymbols() {
-    return this.numSymbols_;
+    return this.Kb;
   }
   // Initialize the decoder and decode the probability table. expectedCount is
   // the number of symbols the caller will decode (lets short streams skip the
@@ -1944,7 +1799,7 @@ var RAnsSymbolDecoder = class {
   create(buffer, expectedCount = 2147483647) {
     const numSymbols = decodeVarint(buffer);
     if (numSymbols === void 0) return false;
-    this.numSymbols_ = numSymbols;
+    this.Kb = numSymbols;
     if (Math.trunc(numSymbols / 64) > buffer.remainingSize) {
       return false;
     }
@@ -1977,7 +1832,7 @@ var RAnsSymbolDecoder = class {
       }
     }
     buffer.advance(pos - startPos);
-    return this.ans_.ransBuildLookUpTable(probabilityTable, numSymbols, expectedCount);
+    return this.o.ransBuildLookUpTable(probabilityTable, numSymbols, expectedCount);
   }
   // Starts decoding, advancing buffer past the encoded data.
   startDecoding(buffer) {
@@ -1988,10 +1843,10 @@ var RAnsSymbolDecoder = class {
     }
     const base = buffer.decodedSize;
     buffer.advance(Number(bytesEncoded));
-    return ansReadInit(this.ans_, buffer.data, base + Number(bytesEncoded), base, this.ans_.lRansBase, 4);
+    return ansReadInit(this.o, buffer.data, base + Number(bytesEncoded), base, this.o.lRansBase, 4);
   }
   endDecoding() {
-    this.ans_.readEnd();
+    this.o.readEnd();
   }
 };
 
@@ -2001,9 +1856,9 @@ function decodeSymbols(numValues, numComponents, srcBuffer, outValues) {
     return true;
   }
   const scheme = srcBuffer.decodeUint8();
-  if (scheme === SymbolCodingMethod.SYMBOL_CODING_TAGGED) {
+  if (scheme === 0 /* SYMBOL_CODING_TAGGED */) {
     return decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues);
-  } else if (scheme === SymbolCodingMethod.SYMBOL_CODING_RAW) {
+  } else if (scheme === 1 /* SYMBOL_CODING_RAW */) {
     return decodeRawSymbols(numValues, srcBuffer, outValues);
   }
   return false;
@@ -2019,11 +1874,11 @@ function decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues) {
   if (numValues > 0 && tagDecoder.numSymbols === 0) {
     return false;
   }
-  const tagAns = tagDecoder.ans_;
+  const tagAns = tagDecoder.o;
   srcBuffer.startBitDecoding(false);
-  const bd = srcBuffer.ma;
-  const buf = bd.Ea;
-  const byteLength = bd.ka;
+  const bd = srcBuffer.sa;
+  const buf = bd.Na;
+  const byteLength = bd.ra;
   let bitOffset = bd.q;
   let valueId = 0;
   for (let i = 0; i < numValues; i += numComponents) {
@@ -2091,15 +1946,15 @@ function decodeRawSymbols(numValues, srcBuffer, outValues) {
   if (decoder === null) {
     return false;
   }
-  decoder.ans_.decodeSymbols(outValues, numValues);
+  decoder.o.decodeSymbols(outValues, numValues);
   decoder.endDecoding();
   return true;
 }
 
 // src/decoder/compression/bit_coders/RAnsBitDecoder.ts
 var RAnsBitDecoder = class {
-  ansDecoder_ = new AnsDecoder();
-  p_ = 0;
+  db = new AnsDecoder();
+  eb = 0;
   // ANS_P8_PRECISION - probZero, precomputed
   // Returns false when the data is invalid.
   startDecoding(sourceBuffer) {
@@ -2107,21 +1962,21 @@ var RAnsBitDecoder = class {
     if (probZero === void 0) {
       return false;
     }
-    this.p_ = ANS_P8_PRECISION - probZero;
+    this.eb = ANS_P8_PRECISION - probZero;
     const sizeInBytes = decodeVarint(sourceBuffer);
     if (sizeInBytes === void 0 || sizeInBytes > sourceBuffer.remainingSize) {
       return false;
     }
     const base = sourceBuffer.decodedSize;
-    if (!ansReadInit(this.ansDecoder_, sourceBuffer.data, base + sizeInBytes, base, ANS_L_BASE, 3)) {
+    if (!ansReadInit(this.db, sourceBuffer.data, base + sizeInBytes, base, ANS_L_BASE, 3)) {
       return false;
     }
     sourceBuffer.advance(sizeInBytes);
     return true;
   }
   decodeNextBit() {
-    const ans = this.ansDecoder_;
-    const p = this.p_;
+    const ans = this.db;
+    const p = this.eb;
     if (ans.state < ANS_L_BASE && ans.bufOffset > ans.bufStart) {
       ans.state = ans.state << 8 | ans.buf[--ans.bufOffset];
     }
@@ -2217,18 +2072,18 @@ var MAX_NUM_PARALLELOGRAMS = 4;
 var MeshPredictionSchemeConstrainedMultiParallelogramDecoder = class extends MeshPredictionSchemeDecoder {
   // Crease edges stored per context (number of available parallelograms),
   // one list per context up to MAX_NUM_PARALLELOGRAMS.
-  Ia = [[], [], [], []];
+  Sa = [[], [], [], []];
   decodePredictionData(buffer) {
     for (let i = 0; i < MAX_NUM_PARALLELOGRAMS; ++i) {
       const numFlags = decodeVarint(buffer);
       if (numFlags === void 0) return false;
       if (numFlags > this.c.cornerTable.numCorners()) return false;
       if (numFlags > 0) {
-        this.Ia[i] = new Array(numFlags);
+        this.Sa[i] = new Array(numFlags);
         const decoder = new RAnsBitDecoder();
         if (!decoder.startDecoding(buffer)) return false;
         for (let j = 0; j < numFlags; ++j) {
-          this.Ia[i][j] = decoder.decodeNextBit();
+          this.Sa[i][j] = decoder.decodeNextBit();
         }
         decoder.endDecoding();
       }
@@ -2287,8 +2142,8 @@ var MeshPredictionSchemeConstrainedMultiParallelogramDecoder = class extends Mes
         for (let i = 0; i < numParallelograms; ++i) {
           const context = numParallelograms - 1;
           const pos = isCreaseEdgePos[context]++;
-          if (this.Ia[context].length <= pos) return false;
-          const isCrease = this.Ia[context][pos];
+          if (this.Sa[context].length <= pos) return false;
+          const isCrease = this.Sa[context][pos];
           if (!isCrease) {
             ++numUsedParallelograms;
             for (let j = 0; j < numComponents; ++j) {
@@ -2326,23 +2181,23 @@ var MeshPredictionSchemeData = class {
 
 // src/decoder/compression/attributes/NormalCompressionUtils.ts
 var OctahedronToolBox = class {
-  A = -1;
-  oa = -1;
+  N = -1;
+  xa = -1;
   m = -1;
-  tb = 1;
+  lc = 1;
   f = -1;
   // q: quantization bits, valid range 2..30.
   setQuantizationBits(q) {
     if (q < 2 || q > 30) return false;
-    this.A = q;
-    this.oa = (1 << q) - 1;
-    this.m = this.oa - 1;
-    this.tb = Math.fround(2 / Math.fround(this.m));
+    this.N = q;
+    this.xa = (1 << q) - 1;
+    this.m = this.xa - 1;
+    this.lc = Math.fround(2 / Math.fround(this.m));
     this.f = this.m / 2 | 0;
     return true;
   }
   quantizationBits() {
-    return this.A;
+    return this.N;
   }
   // Canonicalizes edge points into consistent quadrants. Writes result into
   // out[0], out[1] (caller-owned reusable 2-element array).
@@ -2399,14 +2254,14 @@ var OctahedronToolBox = class {
     }
   }
   // The octahedral -> unit vector direction (quantizedOctahedralCoordsToUnitVector
-  // in the source) lives inlined in AttributeOctahedronTransform.inverseTransformAttribute.
+  // in the source) lives inlined in PointAttribute._extractOctahedron.
 };
 
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeGeometricNormalPredictorArea.ts
 var UPPER_BOUND = 1 << 29;
 function fillInt32PositionCache(cache, att, map, numEntries, tempPos) {
   const bufData = att.buffer && att.buffer.data;
-  if (att.dataType === DataType.INT32 && att.numComponents === 3 && bufData) {
+  if (att.dataType === 5 /* INT32 */ && att.numComponents === 3 && bufData) {
     const src = new Int32Array(bufData.buffer);
     const srcStart = bufData.byteOffset + att.byteOffset >> 2;
     const stride = att.byteStride >> 2;
@@ -2440,31 +2295,31 @@ function fillInt32PositionCache(cache, att, map, numEntries, tempPos) {
   }
 }
 var MeshPredictionSchemeGeometricNormalPredictorArea = class {
-  pa = null;
-  qa = null;
+  ya = null;
+  za = null;
   c;
-  Ua = new Array(3);
-  ra = null;
+  fb = new Array(3);
+  Aa = null;
   // flat Int32 positions, indexed by data id
-  p = null;
-  ub = null;
+  s = null;
+  Lb = null;
   // corner -> posCache offset, precomputed
   constructor(meshData) {
     this.c = meshData;
   }
   setPositionAttribute(positionAttribute) {
-    this.pa = positionAttribute;
+    this.ya = positionAttribute;
   }
   setEntryToPointIdMap(map) {
-    this.qa = map;
+    this.za = map;
   }
   buildPositionCache(numEntries) {
     const posCache = scratchInt32(numEntries * 3);
-    fillInt32PositionCache(posCache, this.pa, this.qa, numEntries, this.Ua);
-    this.ra = posCache;
+    fillInt32PositionCache(posCache, this.ya, this.za, numEntries, this.fb);
+    this.Aa = posCache;
     const table = this.c.cornerTable;
     const cornerToVertex = table.cornerToVertexArray();
-    this.p = table.oppositeCornerArray();
+    this.s = table.oppositeCornerArray();
     const vertexToDataMap = this.c.vertexToDataMap;
     const nc = cornerToVertex.length;
     const c2o = scratchInt32(nc);
@@ -2472,12 +2327,12 @@ var MeshPredictionSchemeGeometricNormalPredictorArea = class {
       const v = cornerToVertex[c];
       c2o[c] = v < 0 ? -1 : vertexToDataMap[v] * 3;
     }
-    this.ub = c2o;
+    this.Lb = c2o;
   }
   computePredictedValue(cornerId, prediction) {
-    const oppositeCorners = this.p;
-    const cornerToOffset = this.ub;
-    const posCache = this.ra;
+    const oppositeCorners = this.s;
+    const cornerToOffset = this.Lb;
+    const posCache = this.Aa;
     const centerOffset = cornerToOffset[cornerId];
     const centX = posCache[centerOffset];
     const centY = posCache[centerOffset + 1];
@@ -2554,12 +2409,12 @@ var MeshPredictionSchemeGeometricNormalPredictorArea = class {
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeGeometricNormalDecoder.ts
 var GEOMETRY_ATTRIBUTE_POSITION = 0;
 var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSchemeDecoder {
-  s;
+  t;
   B = new OctahedronToolBox();
-  Va = new RAnsBitDecoder();
+  gb = new RAnsBitDecoder();
   constructor(transform, meshData) {
     super(transform, meshData);
-    this.s = new MeshPredictionSchemeGeometricNormalPredictorArea(meshData);
+    this.t = new MeshPredictionSchemeGeometricNormalPredictorArea(meshData);
   }
   getNumParentAttributes() {
     return 1;
@@ -2570,25 +2425,25 @@ var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSch
   setParentAttribute(att) {
     if (att.attributeType !== GEOMETRY_ATTRIBUTE_POSITION) return false;
     if (att.numComponents !== 3) return false;
-    this.s.setPositionAttribute(att);
+    this.t.setPositionAttribute(att);
     return true;
   }
   decodePredictionData(buffer) {
     if (!this.h.decodeTransformData(buffer)) return false;
-    return this.Va.startDecoding(buffer);
+    return this.gb.startDecoding(buffer);
   }
   computeOriginalValues(inCorr, outData, _size, _numComponents, entryToPointIdMap) {
     this.B.setQuantizationBits(this.h.quantizationBits());
-    this.s.setEntryToPointIdMap(entryToPointIdMap);
+    this.t.setEntryToPointIdMap(entryToPointIdMap);
     const cornerMapSize = this.c.dataToCornerMap.length;
-    this.s.buildPositionCache(cornerMapSize);
+    this.t.buildPositionCache(cornerMapSize);
     const predNormal3D = new Int32Array(3);
     const predNormalOct = new Int32Array(2);
     for (let dataId = 0; dataId < cornerMapSize; ++dataId) {
       const cornerId = this.c.dataToCornerMap[dataId];
-      this.s.computePredictedValue(cornerId, predNormal3D);
+      this.t.computePredictedValue(cornerId, predNormal3D);
       this.B.canonicalizeIntegerVector(predNormal3D);
-      if (this.Va.decodeNextBit()) {
+      if (this.gb.decodeNextBit()) {
         predNormal3D[0] = -predNormal3D[0];
         predNormal3D[1] = -predNormal3D[1];
         predNormal3D[2] = -predNormal3D[2];
@@ -2597,7 +2452,7 @@ var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSch
       const dataOffset = dataId * 2;
       this.h.computeOriginalValue(predNormalOct, 0, inCorr, dataOffset, outData, dataOffset);
     }
-    this.Va.endDecoding();
+    this.gb.endDecoding();
     return true;
   }
 };
@@ -2664,7 +2519,7 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   // zigzag form, unpacking each one inline.
   computeOriginalValuesZigzag(inCorr, outData, _size, numComponents, _entryToPointIdMap) {
     this.h.init(numComponents);
-    return this.Ub(inCorr, outData, numComponents, true);
+    return this.mc(inCorr, outData, numComponents, true);
   }
   // The wrap transform's corrections are zigzag-coded; with `zigzag` set the
   // decode folds the (val >>> 1) ^ -(val & 1) unpacking into each correction
@@ -2672,15 +2527,15 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   // whole array (see computeOriginalValuesZigzag). Every correction is read
   // exactly once before its slot is overwritten, so the in-place aliasing of
   // inCorr and outData is preserved.
-  Ub(inCorr, outData, numComponents, zigzag) {
+  mc(inCorr, outData, numComponents, zigzag) {
     if (numComponents === 2) {
-      return this.Vb(inCorr, outData, zigzag);
+      return this.nc(inCorr, outData, zigzag);
     }
     if (numComponents === 3) {
-      return this.Wb(inCorr, outData, zigzag);
+      return this.oc(inCorr, outData, zigzag);
     }
     if (numComponents === 4) {
-      return this.Xb(inCorr, outData, zigzag);
+      return this.pc(inCorr, outData, zigzag);
     }
     const table = this.c.cornerTable;
     const vertexToDataMap = this.c.vertexToDataMap;
@@ -2688,9 +2543,9 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
     const cornerToVertex = table.cornerToVertexArray();
     const dataToCornerMap = this.c.dataToCornerMap;
     const transform = this.h;
-    const minValue = transform._;
+    const minValue = transform.fa;
     const maxValue = transform.m;
-    const maxDif = transform.$;
+    const maxDif = transform.ga;
     for (let c = 0; c < numComponents; ++c) {
       let pred = 0;
       if (pred > maxValue) {
@@ -2769,16 +2624,16 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
     }
     return true;
   }
-  Vb(inCorr, outData, zigzag) {
+  nc(inCorr, outData, zigzag) {
     const table = this.c.cornerTable;
     const vertexToDataMap = this.c.vertexToDataMap;
     const oppositeCorners = table.oppositeCornerArray();
     const cornerToVertex = table.cornerToVertexArray();
     const dataToCornerMap = this.c.dataToCornerMap;
     const transform = this.h;
-    const minValue = transform._;
+    const minValue = transform.fa;
     const maxValue = transform.m;
-    const maxDif = transform.$;
+    const maxDif = transform.ga;
     let pred0 = 0;
     let pred1 = 0;
     if (pred0 > maxValue) {
@@ -2867,16 +2722,16 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
     }
     return true;
   }
-  Wb(inCorr, outData, zigzag) {
+  oc(inCorr, outData, zigzag) {
     const table = this.c.cornerTable;
     const vertexToDataMap = this.c.vertexToDataMap;
     const oppositeCorners = table.oppositeCornerArray();
     const cornerToVertex = table.cornerToVertexArray();
     const dataToCornerMap = this.c.dataToCornerMap;
     const transform = this.h;
-    const minValue = transform._;
+    const minValue = transform.fa;
     const maxValue = transform.m;
-    const maxDif = transform.$;
+    const maxDif = transform.ga;
     let pred0 = 0;
     let pred1 = 0;
     let pred2 = 0;
@@ -2996,16 +2851,16 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   }
   // Four components: tangents, RGBA colors, skin joints/weights. Same
   // structure as the 2/3-component loops.
-  Xb(inCorr, outData, zigzag) {
+  pc(inCorr, outData, zigzag) {
     const table = this.c.cornerTable;
     const vertexToDataMap = this.c.vertexToDataMap;
     const oppositeCorners = table.oppositeCornerArray();
     const cornerToVertex = table.cornerToVertexArray();
     const dataToCornerMap = this.c.dataToCornerMap;
     const transform = this.h;
-    const minValue = transform._;
+    const minValue = transform.fa;
     const maxValue = transform.m;
-    const maxDif = transform.$;
+    const maxDif = transform.ga;
     let pred0 = 0;
     if (pred0 > maxValue) {
       pred0 = maxValue;
@@ -3124,39 +2979,39 @@ function bigIntSqrt(value) {
   return x;
 }
 var MeshPredictionSchemeTexCoordsPortablePredictor = class {
-  pa = null;
-  qa = null;
-  t = new Int32Array(2);
-  Ja = new Uint8Array(0);
-  sa = 0;
+  ya = null;
+  za = null;
+  u = new Int32Array(2);
+  Ta = new Uint8Array(0);
+  Ba = 0;
   c;
-  Ua = new Array(3);
+  fb = new Array(3);
   // Flat Int32 position cache so fetches are array reads, not convertValue calls.
-  ra = null;
+  Aa = null;
   j = null;
   constructor(meshData) {
     this.c = meshData;
   }
   setPositionAttribute(positionAttribute) {
-    this.pa = positionAttribute;
+    this.ya = positionAttribute;
   }
   setEntryToPointIdMap(map) {
-    this.qa = map;
+    this.za = map;
   }
   get predictedValue() {
-    return this.t;
+    return this.u;
   }
   resizeOrientations(numOrientations) {
-    this.Ja = new Uint8Array(numOrientations);
-    this.sa = numOrientations;
+    this.Ta = new Uint8Array(numOrientations);
+    this.Ba = numOrientations;
   }
   setOrientation(i, v) {
-    this.Ja[i] = v ? 1 : 0;
+    this.Ta[i] = v ? 1 : 0;
   }
   buildPositionCache(numEntries) {
     const posCache = new Int32Array(numEntries * 3);
-    fillInt32PositionCache(posCache, this.pa, this.qa, numEntries, this.Ua);
-    this.ra = posCache;
+    fillInt32PositionCache(posCache, this.ya, this.za, numEntries, this.fb);
+    this.Aa = posCache;
     this.j = this.c.cornerTable.cornerToVertexArray();
   }
   computePredictedValue(cornerId, data, dataId) {
@@ -3175,11 +3030,11 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       const nUV0 = data[nDataOff], nUV1 = data[nDataOff + 1];
       const pUV0 = data[pDataOff], pUV1 = data[pDataOff + 1];
       if (pUV0 === nUV0 && pUV1 === nUV1) {
-        this.t[0] = pUV0;
-        this.t[1] = pUV1;
+        this.u[0] = pUV0;
+        this.u[1] = pUV1;
         return true;
       }
-      const posCache = this.ra;
+      const posCache = this.Aa;
       let posOffset = dataId * 3;
       const tip0 = posCache[posOffset];
       const tip1 = posCache[posOffset + 1];
@@ -3216,7 +3071,7 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
         const pnAbsMaxG = Math.max(Math.abs(pn0), Math.abs(pn1), Math.abs(pn2));
         const cnDotPnAbs = Math.abs(cnDotPn);
         if (cnNorm2 > SAFE_PRODUCT / pnNorm2Squared || nUVAbsMax > SAFE_PRODUCT / pnNorm2Squared || pnUVAbsMax > 0 && cnDotPnAbs > SAFE_PRODUCT / pnUVAbsMax || pnAbsMaxG > 0 && cnDotPnAbs > SAFE_PRODUCT / pnAbsMaxG) {
-          return this.Yb(
+          return this.qc(
             tip0,
             tip1,
             tip2,
@@ -3248,16 +3103,16 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
         const normSquared = Math.floor(Math.sqrt(cxNorm2Squared * pnNorm2Squared));
         const cxUV0 = pnUV1 * normSquared;
         const cxUV1 = -pnUV0 * normSquared;
-        if (this.sa === 0) {
+        if (this.Ba === 0) {
           return false;
         }
-        const orientation = this.Ja[--this.sa];
+        const orientation = this.Ta[--this.Ba];
         if (orientation) {
-          this.t[0] = Math.trunc((xUV0 + cxUV0) / pnNorm2Squared);
-          this.t[1] = Math.trunc((xUV1 + cxUV1) / pnNorm2Squared);
+          this.u[0] = Math.trunc((xUV0 + cxUV0) / pnNorm2Squared);
+          this.u[1] = Math.trunc((xUV1 + cxUV1) / pnNorm2Squared);
         } else {
-          this.t[0] = Math.trunc((xUV0 - cxUV0) / pnNorm2Squared);
-          this.t[1] = Math.trunc((xUV1 - cxUV1) / pnNorm2Squared);
+          this.u[0] = Math.trunc((xUV0 - cxUV0) / pnNorm2Squared);
+          this.u[1] = Math.trunc((xUV1 - cxUV1) / pnNorm2Squared);
         }
         return true;
       }
@@ -3272,13 +3127,13 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       if (dataId > 0) {
         dataOffset = (dataId - 1) * 2;
       } else {
-        this.t[0] = 0;
-        this.t[1] = 0;
+        this.u[0] = 0;
+        this.u[1] = 0;
         return true;
       }
     }
-    this.t[0] = data[dataOffset];
-    this.t[1] = data[dataOffset + 1];
+    this.u[0] = data[dataOffset];
+    this.u[1] = data[dataOffset + 1];
     return true;
   }
   // 64-bit-exact projection prediction, used when the double path would lose
@@ -3286,7 +3141,7 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
   // <uint64_t>, including the uint64 wraparound in IntSqrt(cxNorm2*pnNorm2) and
   // the unsigned add/sub forming the final UV. Returns false in the same
   // overflow cases as the double path so encoder and decoder agree on fallback.
-  Yb(tip0, tip1, tip2, next0, next1, next2, pn0, pn1, pn2, nUV0, nUV1, pUV0, pUV1, pnNorm2SquaredNum) {
+  qc(tip0, tip1, tip2, next0, next1, next2, pn0, pn1, pn2, nUV0, nUV1, pUV0, pUV1, pnNorm2SquaredNum) {
     const B = BigInt;
     const tip = [B(tip0), B(tip1), B(tip2)];
     const nxt = [B(next0), B(next1), B(next2)];
@@ -3320,8 +3175,8 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
     const normSquared = bigIntSqrt(cxNorm2 * pnN2 & MASK64);
     const cxUV0 = B.asIntN(64, pnUV1 * normSquared);
     const cxUV1 = B.asIntN(64, -pnUV0 * normSquared);
-    if (this.sa === 0) return false;
-    const orientation = this.Ja[--this.sa];
+    if (this.Ba === 0) return false;
+    const orientation = this.Ta[--this.Ba];
     let s0, s1;
     if (orientation) {
       s0 = B.asUintN(64, B.asUintN(64, xUV0) + B.asUintN(64, cxUV0));
@@ -3330,8 +3185,8 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       s0 = B.asUintN(64, B.asUintN(64, xUV0) - B.asUintN(64, cxUV0));
       s1 = B.asUintN(64, B.asUintN(64, xUV1) - B.asUintN(64, cxUV1));
     }
-    this.t[0] = Number(B.asIntN(32, B.asIntN(64, s0) / pnN2));
-    this.t[1] = Number(B.asIntN(32, B.asIntN(64, s1) / pnN2));
+    this.u[0] = Number(B.asIntN(32, B.asIntN(64, s0) / pnN2));
+    this.u[1] = Number(B.asIntN(32, B.asIntN(64, s1) / pnN2));
     return true;
   }
 };
@@ -3339,10 +3194,10 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeTexCoordsPortableDecoder.ts
 var GEOMETRY_ATTRIBUTE_POSITION2 = 0;
 var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionSchemeDecoder {
-  s;
+  t;
   constructor(transform, meshData) {
     super(transform, meshData);
-    this.s = new MeshPredictionSchemeTexCoordsPortablePredictor(meshData);
+    this.t = new MeshPredictionSchemeTexCoordsPortablePredictor(meshData);
   }
   getNumParentAttributes() {
     return 1;
@@ -3353,13 +3208,13 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
   setParentAttribute(att) {
     if (att.attributeType !== GEOMETRY_ATTRIBUTE_POSITION2) return false;
     if (att.numComponents !== 3) return false;
-    this.s.setPositionAttribute(att);
+    this.t.setPositionAttribute(att);
     return true;
   }
   decodePredictionData(buffer) {
     const numOrientations = buffer.decodeInt32();
     if (numOrientations === void 0 || numOrientations < 0) return false;
-    this.s.resizeOrientations(numOrientations);
+    this.t.resizeOrientations(numOrientations);
     let lastOrientation = true;
     const decoder = new RAnsBitDecoder();
     if (!decoder.startDecoding(buffer)) return false;
@@ -3367,7 +3222,7 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
       if (!decoder.decodeNextBit()) {
         lastOrientation = !lastOrientation;
       }
-      this.s.setOrientation(i, lastOrientation);
+      this.t.setOrientation(i, lastOrientation);
     }
     decoder.endDecoding();
     return super.decodePredictionData(buffer);
@@ -3376,17 +3231,17 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
     if (numComponents !== 2) {
       return false;
     }
-    this.s.setEntryToPointIdMap(entryToPointIdMap);
+    this.t.setEntryToPointIdMap(entryToPointIdMap);
     this.h.init(numComponents);
     const cornerMapSize = this.c.dataToCornerMap.length;
-    this.s.buildPositionCache(cornerMapSize);
+    this.t.buildPositionCache(cornerMapSize);
     for (let p = 0; p < cornerMapSize; ++p) {
       const cornerId = this.c.dataToCornerMap[p];
-      if (!this.s.computePredictedValue(cornerId, outData, p)) {
+      if (!this.t.computePredictedValue(cornerId, outData, p)) {
         return false;
       }
       const dstOffset = p * numComponents;
-      this.h.computeOriginalValue(this.s.predictedValue, 0, inCorr, dstOffset, outData, dstOffset);
+      this.h.computeOriginalValue(this.t.predictedValue, 0, inCorr, dstOffset, outData, dstOffset);
     }
     return true;
   }
@@ -3413,27 +3268,27 @@ var PredictionSchemeDeltaDecoder = class extends PredictionSchemeDecoder {
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeDecoderFactory.ts
 function createMeshPredictionSchemeDecoder(method, transform, meshData) {
   const transformType = transform.getType();
-  if (transformType === PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED || transformType === PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON) {
-    if (method === PredictionSchemeMethod.MESH_PREDICTION_GEOMETRIC_NORMAL) {
+  if (transformType === 3 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED */ || transformType === 2 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON */) {
+    if (method === 6 /* MESH_PREDICTION_GEOMETRIC_NORMAL */) {
       return new MeshPredictionSchemeGeometricNormalDecoder(transform, meshData);
     }
     return null;
   }
   switch (method) {
-    case PredictionSchemeMethod.MESH_PREDICTION_PARALLELOGRAM:
+    case 1 /* MESH_PREDICTION_PARALLELOGRAM */:
       return new MeshPredictionSchemeParallelogramDecoder(transform, meshData);
-    case PredictionSchemeMethod.MESH_PREDICTION_MULTI_PARALLELOGRAM:
+    case 2 /* MESH_PREDICTION_MULTI_PARALLELOGRAM */:
       return new MeshPredictionSchemeMultiParallelogramDecoder(transform, meshData);
-    case PredictionSchemeMethod.MESH_PREDICTION_CONSTRAINED_MULTI_PARALLELOGRAM:
+    case 4 /* MESH_PREDICTION_CONSTRAINED_MULTI_PARALLELOGRAM */:
       return new MeshPredictionSchemeConstrainedMultiParallelogramDecoder(transform, meshData);
-    case PredictionSchemeMethod.MESH_PREDICTION_TEX_COORDS_PORTABLE:
+    case 5 /* MESH_PREDICTION_TEX_COORDS_PORTABLE */:
       return new MeshPredictionSchemeTexCoordsPortableDecoder(transform, meshData);
     default:
       return null;
   }
 }
 function createPredictionSchemeForDecoder(method, attId, decoder, transform) {
-  if (method === PredictionSchemeMethod.PREDICTION_NONE) {
+  if (method === -2 /* PREDICTION_NONE */) {
     return null;
   }
   const meshDecoder = decoder;
@@ -3454,24 +3309,24 @@ function createPredictionSchemeForDecoder(method, attId, decoder, transform) {
 
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeWrapDecodingTransform.ts
 var PredictionSchemeWrapDecodingTransform = class {
-  E = 0;
-  _ = 0;
+  z = 0;
+  fa = 0;
   m = 0;
-  $ = 0;
+  ga = 0;
   getType() {
-    return PredictionSchemeTransformType.PREDICTION_TRANSFORM_WRAP;
+    return 1 /* PREDICTION_TRANSFORM_WRAP */;
   }
   init(numComponents) {
-    this.E = numComponents;
+    this.z = numComponents;
   }
   areCorrectionsPositive() {
     return false;
   }
   computeOriginalValue(predictedVals, predictedOffset, corrVals, corrOffset, outOriginalVals, outOffset) {
-    const nc = this.E;
-    const minValue = this._;
+    const nc = this.z;
+    const minValue = this.fa;
     const maxValue = this.m;
-    const maxDif = this.$;
+    const maxDif = this.ga;
     for (let i = 0; i < nc; ++i) {
       let pred = predictedVals[predictedOffset + i];
       if (pred > maxValue) {
@@ -3495,63 +3350,65 @@ var PredictionSchemeWrapDecodingTransform = class {
     if (maxValue === void 0) return false;
     const dif = maxValue - minValue;
     if (dif < 0 || dif >= 2147483647) return false;
-    this._ = minValue;
+    this.fa = minValue;
     this.m = maxValue;
-    this.$ = 1 + dif;
+    this.ga = 1 + dif;
     return true;
   }
 };
 
 // src/decoder/compression/attributes/SequentialIntegerAttributeDecoder.ts
 var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder {
-  aa = null;
+  ha = null;
   // Two-phase decode state (see SequentialAttributeDecoder): the parse phase
   // stashes the primed raw-symbol stream here so the controller can batch and
   // pair several attributes' decodes; the finish phase consumes it.
-  ba = null;
-  Wa = 0;
-  vb = null;
+  ia = null;
+  hb = 0;
+  Mb = null;
   // Int32 view over the portable attribute's storage (see preparePortableAttribute).
-  ta = null;
+  V = null;
   // --- Two-phase decode (parse headers / batch symbol decode / finish) ---
   pendingSymbolStream() {
-    if (this.ba === null) {
+    if (this.ia === null) {
       return null;
     }
-    const portableData = this.ta;
+    const portableData = this.V;
     return {
-      ans: this.ba.ans_,
-      out: new Uint32Array(portableData.buffer, portableData.byteOffset, this.Wa),
-      count: this.Wa
+      ans: this.ia.o,
+      out: new Uint32Array(portableData.buffer, portableData.byteOffset, this.hb),
+      count: this.hb
     };
   }
   decodePortableAttributeFinish() {
-    if (this.ba !== null) {
-      this.ba.endDecoding();
-      this.ba = null;
+    if (this.ia !== null) {
+      this.ia.endDecoding();
+      this.ia = null;
     }
-    return this.Zb(this.vb);
+    return this.rc(this.Mb);
   }
   // The parse phase of the integer decode: prediction scheme, portable
   // attribute, the symbol stream (raw streams are deferred to the finish
   // phase) and the prediction data.
   decodeValues(pointIds, buffer) {
-    this.vb = pointIds;
-    const predictionSchemeMethod = buffer.decodeInt8();
+    this.Mb = pointIds;
+    let predictionSchemeMethod = buffer.decodeUint8();
+    if (predictionSchemeMethod !== void 0) predictionSchemeMethod = predictionSchemeMethod << 24 >> 24;
     if (predictionSchemeMethod === void 0) return false;
-    if (predictionSchemeMethod < PredictionSchemeMethod.PREDICTION_NONE || predictionSchemeMethod >= PredictionSchemeMethod.NUM_PREDICTION_SCHEMES) {
+    if (predictionSchemeMethod < -2 /* PREDICTION_NONE */ || predictionSchemeMethod >= 7 /* NUM_PREDICTION_SCHEMES */) {
       return false;
     }
-    if (predictionSchemeMethod !== PredictionSchemeMethod.PREDICTION_NONE) {
-      const predictionTransformType = buffer.decodeInt8();
+    if (predictionSchemeMethod !== -2 /* PREDICTION_NONE */) {
+      let predictionTransformType = buffer.decodeUint8();
+      if (predictionTransformType !== void 0) predictionTransformType = predictionTransformType << 24 >> 24;
       if (predictionTransformType === void 0) return false;
-      if (predictionTransformType < PredictionSchemeTransformType.PREDICTION_TRANSFORM_NONE || predictionTransformType >= PredictionSchemeTransformType.NUM_PREDICTION_SCHEME_TRANSFORM_TYPES) {
+      if (predictionTransformType < -1 /* PREDICTION_TRANSFORM_NONE */ || predictionTransformType >= 4 /* NUM_PREDICTION_SCHEME_TRANSFORM_TYPES */) {
         return false;
       }
-      this.aa = this.createIntPredictionScheme(predictionSchemeMethod, predictionTransformType);
+      this.ha = this.createIntPredictionScheme(predictionSchemeMethod, predictionTransformType);
     }
-    if (this.aa) {
-      if (!this.initPredictionScheme(this.aa)) {
+    if (this.ha) {
+      if (!this.initPredictionScheme(this.ha)) {
         return false;
       }
     }
@@ -3562,7 +3419,7 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
     const numEntries = pointIds.length;
     const numValues = numEntries * numComponents;
     this.preparePortableAttribute(numEntries, numComponents);
-    const portableAttributeData = this.ta;
+    const portableAttributeData = this.V;
     if (portableAttributeData === null) {
       return false;
     }
@@ -3571,14 +3428,14 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
     if (compressed > 0) {
       if (numValues > 0) {
         const scheme = buffer.decodeUint8();
-        if (scheme === SymbolCodingMethod.SYMBOL_CODING_RAW) {
+        if (scheme === 1 /* SYMBOL_CODING_RAW */) {
           const decoder = parseRawSymbolStream(numValues, buffer);
           if (decoder === null) {
             return false;
           }
-          this.ba = decoder;
-          this.Wa = numValues;
-        } else if (scheme === SymbolCodingMethod.SYMBOL_CODING_TAGGED) {
+          this.ia = decoder;
+          this.hb = numValues;
+        } else if (scheme === 0 /* SYMBOL_CODING_TAGGED */) {
           const outUint32 = new Uint32Array(portableAttributeData.buffer, portableAttributeData.byteOffset, numValues);
           if (!decodeTaggedSymbols(numValues, numComponents, buffer, outUint32)) {
             return false;
@@ -3601,25 +3458,25 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
         portableAttributeData[i] = val;
       }
     }
-    if (this.aa) {
-      if (!this.aa.decodePredictionData(buffer)) {
+    if (this.ha) {
+      if (!this.ha.decodePredictionData(buffer)) {
         return false;
       }
     }
     return true;
   }
   // The post-symbol tail of the decode: zigzag unpacking and prediction.
-  Zb(pointIds) {
+  rc(pointIds) {
     const numComponents = this.getNumValueComponents();
     const numValues = pointIds.length * numComponents;
-    const data = this.ta;
+    const data = this.V;
     if (data === null) {
       return false;
     }
     if (numValues === 0) {
       return true;
     }
-    const ps = this.aa;
+    const ps = this.ha;
     if (ps === null) {
       convertSymbolsToSignedInts(new Uint32Array(data.buffer, data.byteOffset, numValues), numValues, data);
       return true;
@@ -3634,11 +3491,11 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
     return ps.computeOriginalValues(data, data, numValues, numComponents, pointIds);
   }
   transformAttributeToOriginalFormat(pointIds) {
-    return this.Xa(pointIds.length);
+    return this.ib(pointIds.length);
   }
   // Prediction scheme for decoding integer values; subclasses override for others.
   createIntPredictionScheme(method, transformType) {
-    if (transformType !== PredictionSchemeTransformType.PREDICTION_TRANSFORM_WRAP) {
+    if (transformType !== 1 /* PREDICTION_TRANSFORM_WRAP */) {
       return null;
     }
     const transform = new PredictionSchemeWrapDecodingTransform();
@@ -3647,19 +3504,21 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
   getNumValueComponents() {
     return this.attribute.numComponents;
   }
-  // Stores decoded integer values into the attribute.
-  Xa(numValues) {
-    const attribute = this.attribute;
-    const dt = attribute.dataType;
-    const IntArray = dt === DataType.UINT8 ? Uint8Array : dt === DataType.INT8 ? Int8Array : dt === DataType.UINT16 ? Uint16Array : dt === DataType.INT16 ? Int16Array : dt === DataType.UINT32 ? Uint32Array : dt === DataType.INT32 ? Int32Array : null;
-    if (IntArray === null) {
+  // The decoded values stay in the portable attribute; the final attribute
+  // only takes its size (see PointAttribute.setLazyInteger and the overrides
+  // in the quantization / normal decoders).
+  Jb(numValues) {
+    this.attribute.resetLazy(numValues);
+    return true;
+  }
+  // Hands the decoded integer values to the attribute, converted to its
+  // integer type on extraction.
+  ib(_numValues) {
+    const dt = this.attribute.dataType;
+    if (dt < 1 /* INT8 */ || dt > 6 /* UINT32 */) {
       return false;
     }
-    const total = numValues * attribute.numComponents;
-    if (total > 0) {
-      const dstData = attribute.buffer.data;
-      new IntArray(dstData.buffer, dstData.byteOffset + attribute.byteOffset, total).set(this.ta);
-    }
+    this.attribute.setLazyInteger(this.V);
     return true;
   }
   preparePortableAttribute(numEntries, numComponents) {
@@ -3668,107 +3527,18 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
       this.attribute.attributeType,
       null,
       numComponents,
-      DataType.INT32,
+      5 /* INT32 */,
       false,
-      numComponents * dataTypeLength(DataType.INT32),
+      numComponents * dataTypeLength(5 /* INT32 */),
       0
     );
     const portAtt = new PointAttribute(ga);
     portAtt.setIdentityMapping();
-    portAtt.resetScratch(numEntries);
+    portAtt.reset(numEntries);
     portAtt.uniqueId = this.attribute.uniqueId;
-    this.M = portAtt;
+    this.ea = portAtt;
     const data = portAtt.buffer.data;
-    this.ta = numEntries === 0 ? null : new Int32Array(data.buffer, data.byteOffset + portAtt.byteOffset, numEntries * numComponents);
-  }
-};
-
-// src/decoder/attributes/AttributeTransformType.ts
-var AttributeTransformType = {
-  INVALID: -1,
-  NO_TRANSFORM: 0,
-  QUANTIZATION_TRANSFORM: 1,
-  OCTAHEDRON_TRANSFORM: 2
-};
-
-// src/decoder/attributes/AttributeTransformData.ts
-var AttributeTransformData = class {
-  transformType = AttributeTransformType.INVALID;
-  _b = [];
-  $b = [];
-  appendParameterValue(value, type) {
-    this._b.push(value);
-    this.$b.push(type);
-  }
-};
-
-// src/decoder/attributes/AttributeTransform.ts
-var AttributeTransform = class {
-  transferToAttribute(attribute) {
-    const transformData = new AttributeTransformData();
-    this.copyToAttributeTransformData(transformData);
-    attribute.setAttributeTransformData(transformData);
-    return true;
-  }
-};
-
-// src/decoder/attributes/AttributeOctahedronTransform.ts
-var AttributeOctahedronTransform = class extends AttributeTransform {
-  A = -1;
-  copyToAttributeTransformData(outData) {
-    outData.transformType = AttributeTransformType.OCTAHEDRON_TRANSFORM;
-    outData.appendParameterValue(this.A, "int32");
-  }
-  decodeParameters(attribute, decoderBuffer) {
-    const qBits = decoderBuffer.decodeUint8();
-    if (qBits === void 0) return false;
-    this.A = qBits;
-    return true;
-  }
-  inverseTransformAttribute(attribute, targetAttribute) {
-    if (targetAttribute.dataType !== DataType.FLOAT32) {
-      return false;
-    }
-    const numPoints = targetAttribute.size;
-    const numComponents = targetAttribute.numComponents;
-    if (numComponents !== 3) {
-      return false;
-    }
-    const toolBox = new OctahedronToolBox();
-    if (!toolBox.setQuantizationBits(this.A)) {
-      return false;
-    }
-    const srcData = attribute.buffer.data;
-    const srcI32 = new Int32Array(srcData.buffer, srcData.byteOffset + attribute.byteOffset, numPoints * 2);
-    const dstData = targetAttribute.buffer.data;
-    const dstF32 = new Float32Array(dstData.buffer, dstData.byteOffset + targetAttribute.byteOffset, numPoints * 3);
-    const fround = Math.fround;
-    const scale = toolBox.tb;
-    let si = 0;
-    let di = 0;
-    for (let i = 0; i < numPoints; i++) {
-      let y = fround(fround(fround(srcI32[si]) * scale) - 1);
-      let z = fround(fround(fround(srcI32[si + 1]) * scale) - 1);
-      si += 2;
-      const x = fround(fround(1 - Math.abs(y)) - Math.abs(z));
-      let xOffset = -x;
-      if (xOffset < 0) xOffset = 0;
-      y = fround(y + (y < 0 ? xOffset : -xOffset));
-      z = fround(z + (z < 0 ? xOffset : -xOffset));
-      const normSquared = fround(fround(fround(x * x) + fround(y * y)) + fround(z * z));
-      if (normSquared < 1e-6) {
-        dstF32[di] = 0;
-        dstF32[di + 1] = 0;
-        dstF32[di + 2] = 0;
-      } else {
-        const d = fround(1 / fround(Math.sqrt(normSquared)));
-        dstF32[di] = fround(x * d);
-        dstF32[di + 1] = fround(y * d);
-        dstF32[di + 2] = fround(z * d);
-      }
-      di += 3;
-    }
-    return true;
+    this.V = numEntries === 0 ? null : new Int32Array(data.buffer, data.byteOffset + portAtt.byteOffset, numEntries * numComponents);
   }
 };
 
@@ -3784,7 +3554,7 @@ var PredictionSchemeNormalOctahedronTransformBase = class {
   quantizationBits() {
     return this.B.quantizationBits();
   }
-  wb(maxQuantizedValue) {
+  Nb(maxQuantizedValue) {
     if (maxQuantizedValue % 2 === 0) return false;
     let q = 0;
     let v = maxQuantizedValue;
@@ -3799,21 +3569,21 @@ var PredictionSchemeNormalOctahedronTransformBase = class {
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform.ts
 var PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform = class extends PredictionSchemeNormalOctahedronTransformBase {
   getType() {
-    return PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED;
+    return 3 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED */;
   }
   decodeTransformData(buffer) {
     const maxQuantizedValue = buffer.decodeInt32();
     if (maxQuantizedValue === void 0) return false;
     const centerValue = buffer.decodeInt32();
     if (centerValue === void 0) return false;
-    if (!this.wb(maxQuantizedValue)) return false;
+    if (!this.Nb(maxQuantizedValue)) return false;
     const q = this.B.quantizationBits();
     return q >= 2 && q <= 30;
   }
   computeOriginalValue(predVals, predOffset, corrVals, corrOffset, outOrigVals, outOffset) {
     const toolBox = this.B;
     const center = toolBox.f;
-    const maxQuantizedValue = toolBox.oa;
+    const maxQuantizedValue = toolBox.xa;
     const corrS = corrVals[corrOffset];
     const corrT = corrVals[corrOffset + 1];
     let predS = predVals[predOffset] - center;
@@ -3941,7 +3711,7 @@ var PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform = class exten
   computeOriginalValuesDelta(inCorr, outData, size, numComponents) {
     const toolBox = this.B;
     const center = toolBox.f;
-    const maxQuantizedValue = toolBox.oa;
+    const maxQuantizedValue = toolBox.xa;
     let prevS = 0;
     let prevT = 0;
     for (let i = 0; i < size; i += numComponents) {
@@ -4070,17 +3840,17 @@ var PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform = class exten
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeNormalOctahedronDecodingTransform.ts
 var PredictionSchemeNormalOctahedronDecodingTransform = class extends PredictionSchemeNormalOctahedronTransformBase {
   getType() {
-    return PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON;
+    return 2 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON */;
   }
   decodeTransformData(buffer) {
     const maxQuantizedValue = buffer.decodeInt32();
     if (maxQuantizedValue === void 0) return false;
-    return this.wb(maxQuantizedValue);
+    return this.Nb(maxQuantizedValue);
   }
   computeOriginalValue(predVals, predOffset, corrVals, corrOffset, outOrigVals, outOffset) {
     const toolBox = this.B;
     const center = toolBox.f;
-    const maxQuantizedValue = toolBox.oa;
+    const maxQuantizedValue = toolBox.xa;
     const predS = predVals[predOffset] - center;
     const predT = predVals[predOffset + 1] - center;
     const corrS = corrVals[corrOffset];
@@ -4159,28 +3929,34 @@ var PredictionSchemeNormalOctahedronDecodingTransform = class extends Prediction
 
 // src/decoder/compression/attributes/SequentialNormalAttributeDecoder.ts
 var SequentialNormalAttributeDecoder = class extends SequentialIntegerAttributeDecoder {
-  Ya = new AttributeOctahedronTransform();
+  N = -1;
   init(decoder, attributeId) {
     if (!super.init(decoder, attributeId)) {
       return false;
     }
-    return this.attribute.numComponents === 3 && this.attribute.dataType === DataType.FLOAT32;
+    return this.attribute.numComponents === 3 && this.attribute.dataType === 9 /* FLOAT32 */;
   }
   // Normals quantize into two octahedral components.
   getNumValueComponents() {
     return 2;
   }
+  // The octahedral quantization bits (AttributeOctahedronTransform::DecodeParameters).
   decodeDataNeededByPortableTransform(_pointIds, buffer) {
-    if (!this.Ya.decodeParameters(this.getPortableAttribute(), buffer)) {
-      return false;
-    }
-    return this.Ya.transferToAttribute(this.M);
+    const qBits = buffer.decodeUint8();
+    if (qBits === void 0) return false;
+    this.N = qBits;
+    return true;
   }
-  Xa(_numPoints) {
-    return this.Ya.inverseTransformAttribute(this.getPortableAttribute(), this.attribute);
+  // The octahedral-to-unit-vector transform is deferred to extractTo (see
+  // PointAttribute.setLazyOctahedron).
+  ib(_numPoints) {
+    const q = this.N;
+    if (q < 2 || q > 30) return false;
+    this.attribute.setLazyOctahedron(this.V, Math.fround(2 / Math.fround((1 << q) - 2)));
+    return true;
   }
   createIntPredictionScheme(method, transformType) {
-    const transform = transformType === PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON ? new PredictionSchemeNormalOctahedronDecodingTransform() : transformType === PredictionSchemeTransformType.PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED ? new PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform() : null;
+    const transform = transformType === 2 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON */ ? new PredictionSchemeNormalOctahedronDecodingTransform() : transformType === 3 /* PREDICTION_TRANSFORM_NORMAL_OCTAHEDRON_CANONICALIZED */ ? new PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform() : null;
     if (transform === null) {
       return null;
     }
@@ -4188,110 +3964,53 @@ var SequentialNormalAttributeDecoder = class extends SequentialIntegerAttributeD
   }
 };
 
-// src/decoder/attributes/AttributeQuantizationTransform.ts
-var AttributeQuantizationTransform = class extends AttributeTransform {
-  A = -1;
-  ua = [];
-  Za = 0;
-  copyToAttributeTransformData(outData) {
-    outData.transformType = AttributeTransformType.QUANTIZATION_TRANSFORM;
-    outData.appendParameterValue(this.A, "int32");
-    for (let i = 0; i < this.ua.length; i++) {
-      outData.appendParameterValue(this.ua[i], "float32");
-    }
-    outData.appendParameterValue(this.Za, "float32");
-  }
-  decodeParameters(attribute, decoderBuffer) {
-    const numComponents = attribute.numComponents;
-    this.ua = new Array(numComponents);
-    for (let i = 0; i < numComponents; i++) {
-      const val = decoderBuffer.decodeFloat32();
-      if (val === void 0) return false;
-      this.ua[i] = val;
-    }
-    const range = decoderBuffer.decodeFloat32();
-    if (range === void 0) return false;
-    this.Za = range;
-    const qBits = decoderBuffer.decodeUint8();
-    if (qBits === void 0 || qBits < 1 || qBits > 30) return false;
-    this.A = qBits;
-    return true;
-  }
-  inverseTransformAttribute(attribute, targetAttribute) {
-    if (targetAttribute.dataType !== DataType.FLOAT32) {
-      return false;
-    }
-    const maxQuantizedValue = (1 << this.A >>> 0) - 1;
-    if (maxQuantizedValue <= 0) return false;
-    const delta = Math.fround(this.Za / Math.fround(maxQuantizedValue));
-    const numComponents = targetAttribute.numComponents;
-    const numValues = targetAttribute.size;
-    const total = numValues * numComponents;
-    const minValues = this.ua;
-    const srcData = attribute.buffer.data;
-    const srcI32 = new Int32Array(srcData.buffer, srcData.byteOffset + attribute.byteOffset, total);
-    const dstData = targetAttribute.buffer.data;
-    const dstF32 = new Float32Array(dstData.buffer, dstData.byteOffset + targetAttribute.byteOffset, total);
-    const fround = Math.fround;
-    if (numComponents === 3) {
-      const m0 = minValues[0], m1 = minValues[1], m2 = minValues[2];
-      for (let o2 = 0; o2 < total; o2 += 3) {
-        dstF32[o2] = fround(fround(srcI32[o2]) * delta) + m0;
-        dstF32[o2 + 1] = fround(fround(srcI32[o2 + 1]) * delta) + m1;
-        dstF32[o2 + 2] = fround(fround(srcI32[o2 + 2]) * delta) + m2;
-      }
-      return true;
-    }
-    if (numComponents === 2) {
-      const m0 = minValues[0], m1 = minValues[1];
-      for (let o2 = 0; o2 < total; o2 += 2) {
-        dstF32[o2] = fround(fround(srcI32[o2]) * delta) + m0;
-        dstF32[o2 + 1] = fround(fround(srcI32[o2 + 1]) * delta) + m1;
-      }
-      return true;
-    }
-    let o = 0;
-    for (let i = 0; i < numValues; i++) {
-      for (let c = 0; c < numComponents; c++) {
-        dstF32[o] = fround(fround(srcI32[o]) * delta) + minValues[c];
-        o++;
-      }
-    }
-    return true;
-  }
-};
-
 // src/decoder/compression/attributes/SequentialQuantizationAttributeDecoder.ts
 var SequentialQuantizationAttributeDecoder = class extends SequentialIntegerAttributeDecoder {
-  _a = new AttributeQuantizationTransform();
+  N = -1;
+  jb = [];
+  Ob = 0;
   init(decoder, attributeId) {
     if (!super.init(decoder, attributeId)) {
       return false;
     }
-    return this.attribute.dataType === DataType.FLOAT32;
+    return this.attribute.dataType === 9 /* FLOAT32 */;
   }
+  // The quantization parameters (AttributeQuantizationTransform::DecodeParameters).
   decodeDataNeededByPortableTransform(_pointIds, buffer) {
-    const att = this.getPortableAttribute() ?? this.attribute;
-    if (!this._a.decodeParameters(att, buffer)) {
-      return false;
+    const numComponents = this.attribute.numComponents;
+    this.jb = new Array(numComponents);
+    for (let i = 0; i < numComponents; i++) {
+      const val = buffer.decodeFloat32();
+      if (val === void 0) return false;
+      this.jb[i] = val;
     }
-    return this._a.transferToAttribute(this.M);
+    const range = buffer.decodeFloat32();
+    if (range === void 0) return false;
+    this.Ob = range;
+    const qBits = buffer.decodeUint8();
+    if (qBits === void 0 || qBits < 1 || qBits > 30) return false;
+    this.N = qBits;
+    return true;
   }
-  // Dequantize the values instead of a generic integer store.
-  Xa(_numValues) {
-    return this._a.inverseTransformAttribute(this.getPortableAttribute(), this.attribute);
+  // Dequantization is deferred to extractTo (see PointAttribute.setLazyQuantized).
+  ib(_numValues) {
+    const maxQuantizedValue = (1 << this.N >>> 0) - 1;
+    if (maxQuantizedValue <= 0) return false;
+    const delta = Math.fround(this.Ob / Math.fround(maxQuantizedValue));
+    this.attribute.setLazyQuantized(this.V, this.jb, delta);
+    return true;
   }
 };
 
 // src/decoder/compression/attributes/SequentialAttributeDecodersController.ts
 var SequentialAttributeDecodersController = class extends AttributesDecoder {
-  va = [];
+  Ca = [];
   // Replaced by the sequencer's output in _prepareSequence.
-  Ka = new Int32Array(0);
-  T;
+  Ua = new Int32Array(0);
+  W;
   constructor(sequencer) {
     super();
-    this.T = sequencer;
+    this.W = sequencer;
   }
   decodeAttributesDecoderData(buffer) {
     if (!super.decodeAttributesDecoderData(buffer)) {
@@ -4305,19 +4024,19 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
       if (decoder === null || !decoder.init(this.getDecoder(), this.getAttributeId(i))) {
         return false;
       }
-      this.va[i] = decoder;
+      this.Ca[i] = decoder;
     }
     return true;
   }
-  ac() {
-    if (!this.T.generateSequence()) {
+  sc() {
+    if (!this.W.generateSequence()) {
       return false;
     }
-    this.Ka = this.T.getOutputPointIds();
+    this.Ua = this.W.getOutputPointIds();
     const numAttributes = this.getNumAttributes();
     for (let i = 0; i < numAttributes; i++) {
       const pa = this.getDecoder().pointCloud().attribute(this.getAttributeId(i));
-      if (!this.T.updatePointToAttributeIndexMapping(pa)) {
+      if (!this.W.updatePointToAttributeIndexMapping(pa)) {
         return false;
       }
     }
@@ -4331,24 +4050,24 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
   // of the finish work reads the buffer, and dependents only read parent
   // portable VALUES in finish, so ordering and output stay identical.
   decodeAttributesParse(buffer) {
-    if (!this.ac()) {
+    if (!this.sc()) {
       return false;
     }
-    const decoders = this.va;
+    const decoders = this.Ca;
     for (let i = 0; i < decoders.length; i++) {
-      if (!decoders[i].decodePortableAttributeParse(this.Ka, buffer)) {
+      if (!decoders[i].decodePortableAttributeParse(this.Ua, buffer)) {
         return false;
       }
     }
     for (let i = 0; i < decoders.length; i++) {
-      if (!decoders[i].decodeDataNeededByPortableTransform(this.Ka, buffer)) {
+      if (!decoders[i].decodeDataNeededByPortableTransform(this.Ua, buffer)) {
         return false;
       }
     }
     return true;
   }
   collectPendingSymbolStreams(out) {
-    const decoders = this.va;
+    const decoders = this.Ca;
     for (let i = 0; i < decoders.length; i++) {
       const pending = decoders[i].pendingSymbolStream();
       if (pending !== null) {
@@ -4357,14 +4076,14 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
     }
   }
   decodeAttributesFinish() {
-    const decoders = this.va;
+    const decoders = this.Ca;
     for (let i = 0; i < decoders.length; i++) {
       if (!decoders[i].decodePortableAttributeFinish()) {
         return false;
       }
     }
     for (let i = 0; i < decoders.length; i++) {
-      if (!decoders[i].transformAttributeToOriginalFormat(this.Ka)) {
+      if (!decoders[i].transformAttributeToOriginalFormat(this.Ua)) {
         return false;
       }
     }
@@ -4375,17 +4094,17 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
     if (locId < 0) {
       return null;
     }
-    return this.va[locId].getPortableAttribute();
+    return this.Ca[locId].getPortableAttribute();
   }
   createSequentialDecoder(decoderType) {
     switch (decoderType) {
-      case SequentialAttributeEncoderType.SEQUENTIAL_ATTRIBUTE_ENCODER_GENERIC:
+      case 0 /* SEQUENTIAL_ATTRIBUTE_ENCODER_GENERIC */:
         return new SequentialAttributeDecoder();
-      case SequentialAttributeEncoderType.SEQUENTIAL_ATTRIBUTE_ENCODER_INTEGER:
+      case 1 /* SEQUENTIAL_ATTRIBUTE_ENCODER_INTEGER */:
         return new SequentialIntegerAttributeDecoder();
-      case SequentialAttributeEncoderType.SEQUENTIAL_ATTRIBUTE_ENCODER_QUANTIZATION:
+      case 2 /* SEQUENTIAL_ATTRIBUTE_ENCODER_QUANTIZATION */:
         return new SequentialQuantizationAttributeDecoder();
-      case SequentialAttributeEncoderType.SEQUENTIAL_ATTRIBUTE_ENCODER_NORMALS:
+      case 3 /* SEQUENTIAL_ATTRIBUTE_ENCODER_NORMALS */:
         return new SequentialNormalAttributeDecoder();
     }
     return null;
@@ -4414,27 +4133,27 @@ var kInvalidFaceIndex = -1;
 var kInvalidVertexIndex2 = -1;
 var DepthFirstTraverser = class {
   a = null;
-  wa = null;
-  U = null;
-  xb = [];
-  ca = 0;
+  Da = null;
+  X = null;
+  Pb = [];
+  ja = 0;
   // Identifies the traversal order for the shared traversal cache
   // (MESH_TRAVERSAL_DEPTH_FIRST). See MeshTraversalSequencer.
-  yb = 0;
+  Qb = 0;
   // The sequencer derives the point id sequence from the corner map after
   // the traversal (see traverseFromCorner).
   emitsPointIds = false;
   j = null;
-  p = null;
-  zb = null;
-  H = 0;
+  s = null;
+  Rb = null;
+  J = 0;
   init(cornerTable, observer) {
     this.a = cornerTable;
-    this.wa = observer;
+    this.Da = observer;
     this.j = cornerTable.cornerToVertexArray();
-    this.p = cornerTable.oppositeCornerArray();
-    this.zb = cornerTable.vertexLeftmostCornerArray();
-    this.H = cornerTable.numCorners();
+    this.s = cornerTable.oppositeCornerArray();
+    this.Rb = cornerTable.vertexLeftmostCornerArray();
+    this.J = cornerTable.numCorners();
   }
   cornerTable() {
     return this.a;
@@ -4448,8 +4167,8 @@ var DepthFirstTraverser = class {
   // Decode-scoped scratch: released in bulk at the end of the decode.
   onTraversalStart() {
     const cornerTable = this.a;
-    this.U = scratchUint8Zeroed(cornerTable.numFaces());
-    this.xb = scratchInt32(this.H);
+    this.X = scratchUint8Zeroed(cornerTable.numFaces());
+    this.Pb = scratchInt32(this.J);
   }
   // Traverses every face, seeding a new traversal at the first corner of each
   // face not yet reached. The visited check lives here rather than behind a
@@ -4458,8 +4177,8 @@ var DepthFirstTraverser = class {
   // was measurable next to the traversal itself.
   traverseAll() {
     const numFaces = this.a.numFaces();
-    const isFaceVisited = this.U;
-    for (let f = 0; f < numFaces && this.ca < numFaces; ++f) {
+    const isFaceVisited = this.X;
+    for (let f = 0; f < numFaces && this.ja < numFaces; ++f) {
       if (isFaceVisited[f] === 0 && !this.traverseFromCorner(3 * f)) {
         return false;
       }
@@ -4467,19 +4186,19 @@ var DepthFirstTraverser = class {
     return true;
   }
   traverseFromCorner(cornerId) {
-    if (this.U[cornerId / 3 | 0]) {
+    if (this.X[cornerId / 3 | 0]) {
       return true;
     }
-    const isFaceVisited = this.U;
-    const observer = this.wa;
+    const isFaceVisited = this.X;
+    const observer = this.Da;
     const cornerToVertex = this.j;
-    const oppositeCorners = this.p;
-    const vertexLeftmost = this.zb;
-    const stack = this.xb;
-    let numVisitedFaces = this.ca;
+    const oppositeCorners = this.s;
+    const vertexLeftmost = this.Rb;
+    const stack = this.Pb;
+    let numVisitedFaces = this.ja;
     const encodingData = observer.C;
-    const encodedToCornerMap = observer.$a;
-    const vertexToEncodedMap = observer.ab;
+    const encodedToCornerMap = observer.kb;
+    const vertexToEncodedMap = observer.lb;
     let numValues = encodingData.numValues;
     let stackSize = 0;
     stack[stackSize++] = cornerId;
@@ -4557,7 +4276,7 @@ var DepthFirstTraverser = class {
         }
       }
     }
-    this.ca = numVisitedFaces;
+    this.ja = numVisitedFaces;
     encodingData.numValues = numValues;
     return true;
   }
@@ -4569,51 +4288,51 @@ var kInvalidFaceIndex2 = -1;
 var kMaxPriority = 3;
 var MaxPredictionDegreeTraverser = class {
   a = null;
-  wa = null;
-  U = null;
-  bb = null;
-  ca = 0;
+  Da = null;
+  X = null;
+  mb = null;
+  ja = 0;
   // One stack (bucket) per priority level [0, kMaxPriority).
-  La = null;
-  V = 0;
+  Va = null;
+  Y = 0;
   // Prediction degree accumulated per vertex during traversal.
-  cb = null;
+  nb = null;
   // Flat connectivity arrays (see DepthFirstTraverser for why).
   j = null;
-  p = null;
+  s = null;
   // Identifies the traversal order for the shared traversal cache
   // (MESH_TRAVERSAL_PREDICTION_DEGREE). See MeshTraversalSequencer.
-  yb = 1;
+  Qb = 1;
   // Point ids are appended through the observer as vertices are visited.
   emitsPointIds = true;
   init(cornerTable, observer) {
     this.a = cornerTable;
-    this.wa = observer;
-    this.U = new Uint8Array(cornerTable.numFaces());
-    this.bb = new Uint8Array(cornerTable.numVertices());
+    this.Da = observer;
+    this.X = new Uint8Array(cornerTable.numFaces());
+    this.mb = new Uint8Array(cornerTable.numVertices());
     this.j = cornerTable.cornerToVertexArray();
-    this.p = cornerTable.oppositeCornerArray();
-    this.La = [[], [], []];
+    this.s = cornerTable.oppositeCornerArray();
+    this.Va = [[], [], []];
   }
   cornerTable() {
     return this.a;
   }
   // corner is always valid (>= 0) where these are used.
-  Ab(c) {
+  Sb(c) {
     return c % 3 === 2 ? c - 2 : c + 1;
   }
-  Bb(c) {
+  Tb(c) {
     return c % 3 === 0 ? c + 2 : c - 1;
   }
   onTraversalStart() {
-    this.cb = new Int32Array(this.a.numVertices());
+    this.nb = new Int32Array(this.a.numVertices());
   }
   // Same contract as DepthFirstTraverser.traverseAll. Seeds every face
   // through traverseFromCorner (which re-checks the first face's vertices),
   // exactly as the sequencer's loop always has.
   traverseAll() {
     const numFaces = this.a.numFaces();
-    for (let f = 0; f < numFaces && this.ca < numFaces; ++f) {
+    for (let f = 0; f < numFaces && this.ja < numFaces; ++f) {
       if (!this.traverseFromCorner(3 * f)) {
         return false;
       }
@@ -4622,11 +4341,11 @@ var MaxPredictionDegreeTraverser = class {
   }
   // Returns the priority of traversing the edge leading to cornerId. Mutates
   // the prediction degree of the destination vertex.
-  Cb(cornerId) {
+  Ub(cornerId) {
     const vTip = this.j[cornerId];
     let priority = 0;
-    if (!this.bb[vTip]) {
-      const degree = ++this.cb[vTip];
+    if (!this.mb[vTip]) {
+      const degree = ++this.nb[vTip];
       priority = degree > 1 ? 1 : 2;
     }
     if (priority >= kMaxPriority) {
@@ -4634,38 +4353,38 @@ var MaxPredictionDegreeTraverser = class {
     }
     return priority;
   }
-  Db(ci, priority) {
-    this.La[priority].push(ci);
-    if (priority < this.V) {
-      this.V = priority;
+  Vb(ci, priority) {
+    this.Va[priority].push(ci);
+    if (priority < this.Y) {
+      this.Y = priority;
     }
   }
   // Retrieves the next available corner to traverse, processed by priority.
   // Returns kInvalidCornerIndex when no corner is available.
-  bc() {
-    for (let i = this.V; i < kMaxPriority; ++i) {
-      const stack = this.La[i];
+  tc() {
+    for (let i = this.Y; i < kMaxPriority; ++i) {
+      const stack = this.Va[i];
       if (stack.length > 0) {
         const ret = stack.pop();
-        this.V = i;
+        this.Y = i;
         return ret;
       }
     }
     return kInvalidCornerIndex5;
   }
   traverseFromCorner(cornerId) {
-    if (this.cb.length === 0) {
+    if (this.nb.length === 0) {
       return true;
     }
     const cornerToVertex = this.j;
-    const oppositeCorners = this.p;
-    const isFaceVisited = this.U;
-    const isVertexVisited = this.bb;
-    const observer = this.wa;
-    this.La[0].push(cornerId);
-    this.V = 0;
-    const firstNext = this.Ab(cornerId);
-    const firstPrev = this.Bb(cornerId);
+    const oppositeCorners = this.s;
+    const isFaceVisited = this.X;
+    const isVertexVisited = this.mb;
+    const observer = this.Da;
+    this.Va[0].push(cornerId);
+    this.Y = 0;
+    const firstNext = this.Sb(cornerId);
+    const firstPrev = this.Tb(cornerId);
     const nextVert = cornerToVertex[firstNext];
     const prevVert = cornerToVertex[firstPrev];
     if (!isVertexVisited[nextVert]) {
@@ -4681,7 +4400,7 @@ var MaxPredictionDegreeTraverser = class {
       isVertexVisited[tipVertex] = 1;
       observer.onNewVertexVisited(tipVertex, cornerId);
     }
-    while ((cornerId = this.bc()) !== kInvalidCornerIndex5) {
+    while ((cornerId = this.tc()) !== kInvalidCornerIndex5) {
       let faceId = cornerId / 3 | 0;
       if (isFaceVisited[faceId]) {
         continue;
@@ -4689,34 +4408,34 @@ var MaxPredictionDegreeTraverser = class {
       while (true) {
         faceId = cornerId / 3 | 0;
         isFaceVisited[faceId] = 1;
-        this.ca++;
+        this.ja++;
         const vertId = cornerToVertex[cornerId];
         if (!isVertexVisited[vertId]) {
           isVertexVisited[vertId] = 1;
           observer.onNewVertexVisited(vertId, cornerId);
         }
-        const rightCornerId = oppositeCorners[this.Ab(cornerId)];
-        const leftCornerId = oppositeCorners[this.Bb(cornerId)];
+        const rightCornerId = oppositeCorners[this.Sb(cornerId)];
+        const leftCornerId = oppositeCorners[this.Tb(cornerId)];
         const rightFaceId = rightCornerId === kInvalidCornerIndex5 ? kInvalidFaceIndex2 : rightCornerId / 3 | 0;
         const leftFaceId = leftCornerId === kInvalidCornerIndex5 ? kInvalidFaceIndex2 : leftCornerId / 3 | 0;
         const isRightFaceVisited = rightFaceId === kInvalidFaceIndex2 || isFaceVisited[rightFaceId] !== 0;
         const isLeftFaceVisited = leftFaceId === kInvalidFaceIndex2 || isFaceVisited[leftFaceId] !== 0;
         if (!isLeftFaceVisited) {
-          const priority = this.Cb(leftCornerId);
-          if (isRightFaceVisited && priority <= this.V) {
+          const priority = this.Ub(leftCornerId);
+          if (isRightFaceVisited && priority <= this.Y) {
             cornerId = leftCornerId;
             continue;
           } else {
-            this.Db(leftCornerId, priority);
+            this.Vb(leftCornerId, priority);
           }
         }
         if (!isRightFaceVisited) {
-          const priority = this.Cb(rightCornerId);
-          if (priority <= this.V) {
+          const priority = this.Ub(rightCornerId);
+          if (priority <= this.Y) {
             cornerId = rightCornerId;
             continue;
           } else {
-            this.Db(rightCornerId, priority);
+            this.Vb(rightCornerId, priority);
           }
         }
         break;
@@ -4729,66 +4448,66 @@ var MaxPredictionDegreeTraverser = class {
 // src/decoder/compression/mesh/traverser/MeshAttributeIndicesEncodingObserver.ts
 var MeshAttributeIndicesEncodingObserver = class {
   C;
-  T;
-  ab;
-  $a;
-  Eb;
+  W;
+  lb;
+  kb;
+  Wb;
   constructor(mesh, sequencer, encodingData) {
     this.C = encodingData;
-    this.T = sequencer;
-    this.ab = encodingData.vertexToEncodedAttributeValueIndexMap;
-    this.$a = encodingData.encodedAttributeValueIndexToCornerMap;
-    this.Eb = mesh.faces_;
+    this.W = sequencer;
+    this.lb = encodingData.vertexToEncodedAttributeValueIndexMap;
+    this.kb = encodingData.encodedAttributeValueIndexToCornerMap;
+    this.Wb = mesh.faces_;
   }
   onNewVertexVisited(vertex, corner) {
-    const pointId = this.Eb[corner];
-    this.T.addPointId(pointId);
+    const pointId = this.Wb[corner];
+    this.W.addPointId(pointId);
     const numValues = this.C.numValues;
-    this.$a[numValues] = corner;
-    this.ab[vertex] = numValues;
+    this.kb[numValues] = corner;
+    this.lb[vertex] = numValues;
     this.C.numValues++;
   }
 };
 
 // src/decoder/compression/mesh/traverser/MeshTraversalSequencer.ts
 var MeshTraversalSequencer = class {
-  F;
+  H;
   C;
-  xa = null;
-  v = new Int32Array(0);
-  ya = 0;
+  Ea = null;
+  x = new Int32Array(0);
+  Fa = 0;
   // Per-decode cache, keyed by corner table, shared across the attribute
   // decoders of one mesh (see MeshEdgebreakerDecoderImpl).
-  db;
+  ob;
   // The cache entry the last generateSequence resolved to (hit or store);
   // carries the shared indicesMap.
-  eb = null;
+  pb = null;
   // One representative corner per point id, when the connectivity decoder
   // recorded them (see MeshEdgebreakerDecoderImpl._assignAttributeVerticesAndPoints).
-  da;
+  ka;
   constructor(mesh, encodingData, traversalCache, pointCorner) {
-    this.F = mesh;
+    this.H = mesh;
     this.C = encodingData;
-    this.db = traversalCache;
-    this.da = pointCorner;
+    this.ob = traversalCache;
+    this.ka = pointCorner;
   }
   setTraverser(traverser) {
-    this.xa = traverser;
+    this.Ea = traverser;
   }
   generateSequence() {
-    const cornerTable = this.xa.cornerTable();
-    const methodId = this.xa.yb;
+    const cornerTable = this.Ea.cornerTable();
+    const methodId = this.Ea.Qb;
     const cacheKey = cornerTable.cornerToVertexArray();
     const encodingData = this.C;
-    let byMethod = this.db.get(cacheKey);
+    let byMethod = this.ob.get(cacheKey);
     const cached = byMethod && byMethod.get(methodId);
     if (cached !== void 0) {
-      this.v = cached.pointIds;
+      this.x = cached.pointIds;
       encodingData.adoptTraversalResult(cached.vertexMap, cached.cornerMap, cached.numValues);
-      this.eb = cached;
+      this.pb = cached;
       return true;
     }
-    if (!this.cc()) {
+    if (!this.uc()) {
       return false;
     }
     const numValues = encodingData.numValues;
@@ -4800,39 +4519,39 @@ var MeshTraversalSequencer = class {
     }
     if (byMethod === void 0) {
       byMethod = /* @__PURE__ */ new Map();
-      this.db.set(cacheKey, byMethod);
+      this.ob.set(cacheKey, byMethod);
     }
     const entry = {
-      pointIds: this.v,
+      pointIds: this.x,
       vertexMap: encodingData.vertexToEncodedAttributeValueIndexMap,
       cornerMap: encodingData.encodedAttributeValueIndexToCornerMap,
       numValues,
       indicesMap: null
     };
     byMethod.set(methodId, entry);
-    this.eb = entry;
+    this.pb = entry;
     return true;
   }
   getOutputPointIds() {
-    return this.v;
+    return this.x;
   }
   addPointId(pointId) {
-    this.v[this.ya++] = pointId;
+    this.x[this.Fa++] = pointId;
   }
   updatePointToAttributeIndexMapping(attribute) {
-    const entry = this.eb;
+    const entry = this.pb;
     if (entry !== null && entry.indicesMap !== null) {
       attribute.setExplicitMappingShared(entry.indicesMap);
       return true;
     }
-    const cornerTable = this.xa.cornerTable();
-    const numFaces = this.F.numFaces();
-    const numPoints = this.F.numPoints();
+    const cornerTable = this.Ea.cornerTable();
+    const numFaces = this.H.numFaces();
+    const numPoints = this.H.numPoints();
     attribute.setExplicitMappingUnfilled(numPoints);
     const cornerToVertex = cornerTable.cornerToVertexArray();
     const vertexToAttEntry = this.C.vertexToEncodedAttributeValueIndexMap;
     const indicesMap = attribute.indicesMap;
-    const pointCorner = this.da;
+    const pointCorner = this.ka;
     if (pointCorner !== null) {
       for (let p = 0; p < numPoints; ++p) {
         const vertId = cornerToVertex[pointCorner[p]];
@@ -4847,7 +4566,7 @@ var MeshTraversalSequencer = class {
       }
     } else {
       const numCorners = numFaces * 3;
-      const faces = this.F.faces_;
+      const faces = this.H.faces_;
       for (let ci = 0; ci < numCorners; ++ci) {
         const vertId = cornerToVertex[ci];
         if (vertId < 0) {
@@ -4866,10 +4585,10 @@ var MeshTraversalSequencer = class {
     }
     return true;
   }
-  cc() {
-    this.ya = 0;
-    this.v = scratchInt32(this.F.numPoints());
-    const traverser = this.xa;
+  uc() {
+    this.Fa = 0;
+    this.x = scratchInt32(this.H.numPoints());
+    const traverser = this.Ea;
     traverser.onTraversalStart();
     if (!traverser.traverseAll()) {
       return false;
@@ -4877,15 +4596,15 @@ var MeshTraversalSequencer = class {
     if (!traverser.emitsPointIds) {
       const numValues = this.C.numValues;
       const cornerMap = this.C.encodedAttributeValueIndexToCornerMap;
-      const faces = this.F.faces_;
-      const outPointIds = this.v;
+      const faces = this.H.faces_;
+      const outPointIds = this.x;
       for (let i = 0; i < numValues; ++i) {
         outPointIds[i] = faces[cornerMap[i]];
       }
-      this.ya = numValues;
+      this.Fa = numValues;
     }
-    if (this.ya < this.v.length) {
-      this.v = this.v.subarray(0, this.ya);
+    if (this.Fa < this.x.length) {
+      this.x = this.x.subarray(0, this.Fa);
     }
     return true;
   }
@@ -4894,36 +4613,38 @@ var MeshTraversalSequencer = class {
 // src/decoder/compression/mesh/MeshEdgebreakerDecoderImpl.ts
 var kInvalidCornerIndex6 = -1;
 var MeshEdgebreakerDecoderImpl = class {
-  o;
+  n;
   a = null;
-  N = [];
-  ea = new Uint8Array(0);
-  W = 0;
-  fb = new MeshAttributeIndicesEncodingData();
-  Fb = -1;
+  O = [];
+  la = new Uint8Array(0);
+  Z = 0;
+  qb = new MeshAttributeIndicesEncodingData();
+  Xb = -1;
   // Cache of vertex-traversal results keyed by corner table, so attributes
   // sharing connectivity traverse once.
-  dc = /* @__PURE__ */ new Map();
+  vc = /* @__PURE__ */ new Map();
   i = [];
-  I;
+  K;
   // One corner per point id (decode-scoped scratch), filled by
   // _assignAttributeVerticesAndPoints; null when points are the base vertices.
-  da = null;
+  ka = null;
+  // Corners on a boundary edge, counted by _decodeAttributeConnectivities.
+  Yb = 0;
   constructor(decoder, TraversalDecoderClass) {
-    this.o = decoder;
-    this.I = new TraversalDecoderClass();
+    this.n = decoder;
+    this.K = new TraversalDecoderClass();
   }
   getCornerTable() {
     return this.a;
   }
   // The attribute data set whose attributes decoder owns attId, if any.
-  Gb(attId) {
+  Zb(attId) {
     for (let i = 0; i < this.i.length; ++i) {
       const ad = this.i[i];
-      if (ad.decoderId < 0 || ad.decoderId >= this.o.numAttributesDecoders()) {
+      if (ad.decoderId < 0 || ad.decoderId >= this.n.numAttributesDecoders()) {
         continue;
       }
-      const dec = this.o.attributesDecoder(ad.decoderId);
+      const dec = this.n.attributesDecoder(ad.decoderId);
       for (let j = 0; j < dec.getNumAttributes(); ++j) {
         if (dec.getAttributeId(j) === attId) {
           return ad;
@@ -4933,16 +4654,17 @@ var MeshEdgebreakerDecoderImpl = class {
     return null;
   }
   getAttributeCornerTable(attId) {
-    const ad = this.Gb(attId);
+    const ad = this.Zb(attId);
     return ad !== null && ad.isConnectivityUsed ? ad.connectivityData : null;
   }
   getAttributeEncodingData(attId) {
-    const ad = this.Gb(attId);
-    return ad !== null ? ad.encodingData : this.fb;
+    const ad = this.Zb(attId);
+    return ad !== null ? ad.encodingData : this.qb;
   }
   createAttributesDecoder(attDecoderId) {
-    const buffer = this.o.buffer();
-    const attDataId = buffer.decodeInt8();
+    const buffer = this.n.buffer();
+    let attDataId = buffer.decodeUint8();
+    if (attDataId !== void 0) attDataId = attDataId << 24 >> 24;
     if (attDataId === void 0) return false;
     const decoderType = buffer.decodeUint8();
     if (decoderType === void 0) return false;
@@ -4955,55 +4677,57 @@ var MeshEdgebreakerDecoderImpl = class {
       }
       this.i[attDataId].decoderId = attDecoderId;
     } else {
-      if (this.Fb >= 0) {
+      if (this.Xb >= 0) {
         return false;
       }
-      this.Fb = attDecoderId;
+      this.Xb = attDecoderId;
     }
     const traversalMethod = buffer.decodeUint8();
-    if (traversalMethod === void 0 || traversalMethod >= MeshTraversalMethod.NUM_TRAVERSAL_METHODS) {
+    if (traversalMethod === void 0 || traversalMethod >= 2 /* NUM_TRAVERSAL_METHODS */) {
       return false;
     }
     let encodingData;
     let cornerTable;
-    if (decoderType === MeshAttributeElementType.MESH_VERTEX_ATTRIBUTE) {
+    if (decoderType === 0 /* MESH_VERTEX_ATTRIBUTE */) {
       if (attDataId < 0) {
-        encodingData = this.fb;
+        encodingData = this.qb;
       } else {
         encodingData = this.i[attDataId].encodingData;
         this.i[attDataId].isConnectivityUsed = false;
       }
       cornerTable = this.a;
     } else {
-      if (traversalMethod !== MeshTraversalMethod.MESH_TRAVERSAL_DEPTH_FIRST || attDataId < 0) {
+      if (traversalMethod !== 0 /* MESH_TRAVERSAL_DEPTH_FIRST */ || attDataId < 0) {
         return false;
       }
-      encodingData = this.i[attDataId].encodingData;
-      cornerTable = this.i[attDataId].connectivityData;
+      const ad = this.i[attDataId];
+      if (ad.noInteriorSeams) this.wc(ad);
+      encodingData = ad.encodingData;
+      cornerTable = ad.connectivityData;
     }
-    const mesh = this.o.mesh();
-    const sequencer = new MeshTraversalSequencer(mesh, encodingData, this.dc, this.da);
+    const mesh = this.n.mesh();
+    const sequencer = new MeshTraversalSequencer(mesh, encodingData, this.vc, this.ka);
     const observer = new MeshAttributeIndicesEncodingObserver(mesh, sequencer, encodingData);
-    const traverser = traversalMethod === MeshTraversalMethod.MESH_TRAVERSAL_PREDICTION_DEGREE ? new MaxPredictionDegreeTraverser() : new DepthFirstTraverser();
+    const traverser = traversalMethod === 1 /* MESH_TRAVERSAL_PREDICTION_DEGREE */ ? new MaxPredictionDegreeTraverser() : new DepthFirstTraverser();
     traverser.init(cornerTable, observer);
     sequencer.setTraverser(traverser);
-    return this.o.setAttributesDecoder(attDecoderId, new SequentialAttributeDecodersController(sequencer));
+    return this.n.setAttributesDecoder(attDecoderId, new SequentialAttributeDecodersController(sequencer));
   }
   decodeConnectivity() {
-    const buffer = this.o.buffer();
+    const buffer = this.n.buffer();
     const numEncodedVertices = decodeVarint(buffer);
     if (numEncodedVertices === void 0) return false;
-    this.W = numEncodedVertices;
+    this.Z = numEncodedVertices;
     const numFaces = decodeVarint(buffer);
     if (numFaces === void 0) return false;
     if (numFaces > 2147483647 / 3) {
       return false;
     }
-    if (this.W > numFaces * 3) {
+    if (this.Z > numFaces * 3) {
       return false;
     }
     const minNumFaceEdges = Math.floor(3 * numFaces / 2);
-    const maxNumVertexEdges = this.W * (this.W - 1) / 2;
+    const maxNumVertexEdges = this.Z * (this.Z - 1) / 2;
     if (maxNumVertexEdges < minNumFaceEdges) {
       return false;
     }
@@ -5030,27 +4754,28 @@ var MeshEdgebreakerDecoderImpl = class {
       ad.numSeamCorners = 0;
       this.i.push(ad);
     }
-    this.a.reset(numFaces, this.W + numEncodedSplitSymbols);
-    this.ea = scratchUint8Filled(this.W + numEncodedSplitSymbols, 1);
-    if (!this.ec(buffer)) {
+    this.a.reset(numFaces, this.Z + numEncodedSplitSymbols);
+    this.la = scratchUint8Filled(this.Z + numEncodedSplitSymbols, 1);
+    if (!this.xc(buffer)) {
       return false;
     }
-    this.I.init(this);
-    this.I.setNumEncodedVertices(this.W + numEncodedSplitSymbols);
-    this.I.setNumAttributeData(numAttributeData);
+    this.K.init(this);
+    this.K.setNumEncodedVertices(this.Z + numEncodedSplitSymbols);
+    this.K.setNumAttributeData(numAttributeData);
     const traversalEndBuffer = new DecoderBuffer();
-    if (!this.I.start(traversalEndBuffer)) {
+    if (!this.K.start(traversalEndBuffer)) {
       return false;
     }
-    const numConnectivityVerts = this.fc(numEncodedSymbols);
+    const numConnectivityVerts = this.yc(numEncodedSymbols);
     if (numConnectivityVerts === -1) {
       return false;
     }
     buffer.init(traversalEndBuffer.dataHead, traversalEndBuffer.remainingSize);
     if (this.i.length > 0) {
-      this.gc();
+      this.zc();
     }
-    this.I.done();
+    this.K.done();
+    const numBoundaryCorners = this.Yb;
     const distinctTables = [];
     const adoptions = [];
     let previousConnectivityData = null;
@@ -5060,6 +4785,10 @@ var MeshEdgebreakerDecoderImpl = class {
       const connectivityData = this.i[i].connectivityData;
       const seamCorners = this.i[i].attributeSeamCorners;
       const seamCount = this.i[i].numSeamCorners;
+      if (seamCount === numBoundaryCorners) {
+        this.i[i].noInteriorSeams = true;
+        continue;
+      }
       let sameAsPrevious = previousConnectivityData !== null && seamCount === previousSeamCount;
       if (sameAsPrevious) {
         const previous = previousSeamCorners;
@@ -5085,14 +4814,14 @@ var MeshEdgebreakerDecoderImpl = class {
       previousSeamCount = seamCount;
     }
     if (this.i.length === 0) {
-      this.hc(numConnectivityVerts);
-    } else if (!this.ic(distinctTables)) {
+      this.Ac(numConnectivityVerts);
+    } else if (!this.Bc(distinctTables)) {
       return false;
     }
     for (let i = 0; i < adoptions.length; i += 2) {
       adoptions[i].adoptFrom(adoptions[i + 1]);
     }
-    this.fb.init(this.a.numVertices());
+    this.qb.init(this.a.numVertices());
     for (let i = 0; i < this.i.length; ++i) {
       let attConnectivityVerts = this.i[i].connectivityData.numVertices();
       if (attConnectivityVerts < this.a.numVertices()) {
@@ -5102,11 +4831,11 @@ var MeshEdgebreakerDecoderImpl = class {
     }
     return true;
   }
-  jc(encoderSymbolId, outResult) {
-    if (this.N.length === 0) {
+  Cc(encoderSymbolId, outResult) {
+    if (this.O.length === 0) {
       return false;
     }
-    const back = this.N[this.N.length - 1];
+    const back = this.O[this.O.length - 1];
     if (back.sourceSymbolId > encoderSymbolId) {
       outResult.encoderSplitSymbolId = -1;
       return true;
@@ -5116,24 +4845,24 @@ var MeshEdgebreakerDecoderImpl = class {
     }
     outResult.faceEdge = back.sourceEdge;
     outResult.encoderSplitSymbolId = back.splitSymbolId;
-    this.N.pop();
+    this.O.pop();
     return true;
   }
-  fc(numSymbols) {
-    const activeCornerStack = scratchInt32(numSymbols + this.N.length + 16);
+  yc(numSymbols) {
+    const activeCornerStack = scratchInt32(numSymbols + this.O.length + 16);
     let activeCornerStackSize = 0;
     const topologySplitActiveCorners = /* @__PURE__ */ new Map();
     const splitResult = { faceEdge: 0, encoderSplitSymbolId: 0 };
     const invalidVertices = [];
     const removeInvalidVertices = this.i.length === 0;
-    let maxNumVertices = this.ea.length;
+    let maxNumVertices = this.la.length;
     let numFacesDecoded = 0;
     const cornerToVertex = this.a.j;
-    const oppositeCorners = this.a.p;
+    const oppositeCorners = this.a.s;
     const vc = this.a;
-    let vertexCorners = vc.w;
-    const isVertHole = this.ea;
-    const traversalDecoder = this.I;
+    let vertexCorners = vc.y;
+    const isVertHole = this.la;
+    const traversalDecoder = this.K;
     for (let symbolId = 0; symbolId < numSymbols; ++symbolId) {
       const faceIndex = numFacesDecoded++;
       let checkTopologySplit = false;
@@ -5189,7 +4918,7 @@ var MeshEdgebreakerDecoderImpl = class {
           newVertIndex = vc.l++;
         } else {
           newVertIndex = vc.addNewVertex();
-          vertexCorners = vc.w;
+          vertexCorners = vc.y;
         }
         if (vc.l > maxNumVertices) return -1;
         cornerToVertex[oppCorner] = newVertIndex;
@@ -5259,7 +4988,7 @@ var MeshEdgebreakerDecoderImpl = class {
           firstVertIndex = vc.addNewVertex();
           vc.addNewVertex();
           vc.addNewVertex();
-          vertexCorners = vc.w;
+          vertexCorners = vc.y;
         }
         if (vc.l > maxNumVertices) return -1;
         cornerToVertex[corner] = firstVertIndex;
@@ -5274,9 +5003,9 @@ var MeshEdgebreakerDecoderImpl = class {
         return -1;
       }
       traversalDecoder.newActiveCornerReached(activeCornerStack[activeCornerStackSize - 1]);
-      if (checkTopologySplit && this.N.length > 0) {
+      if (checkTopologySplit && this.O.length > 0) {
         const encoderSymbolId = numSymbols - symbolId - 1;
-        while (this.jc(encoderSymbolId, splitResult)) {
+        while (this.Cc(encoderSymbolId, splitResult)) {
           if (splitResult.encoderSplitSymbolId < 0) return -1;
           const actTopCorner = activeCornerStack[activeCornerStackSize - 1];
           let newActiveCorner;
@@ -5293,24 +5022,24 @@ var MeshEdgebreakerDecoderImpl = class {
     if (vc.l > maxNumVertices) {
       return -1;
     }
-    numFacesDecoded = this.kc(activeCornerStack, activeCornerStackSize, numFacesDecoded);
+    numFacesDecoded = this.Dc(activeCornerStack, activeCornerStackSize, numFacesDecoded);
     if (numFacesDecoded === -1) {
       return -1;
     }
     if (numFacesDecoded !== this.a.numFaces()) {
       return -1;
     }
-    return this.lc(invalidVertices);
+    return this.Ec(invalidVertices);
   }
   // Connects the remaining active-stack corners to newly decoded start faces.
   // Returns the updated decoded-face count, or -1 on malformed input.
-  kc(activeCornerStack, activeCornerStackSize, numFacesDecoded) {
+  Dc(activeCornerStack, activeCornerStackSize, numFacesDecoded) {
     const ct = this.a;
+    const oppositeCorners = ct.s;
     const cornerToVertex = ct.j;
-    const oppositeCorners = ct.p;
-    const vertexCorners = ct.w;
-    const isVertHole = this.ea;
-    const traversalDecoder = this.I;
+    const vertexCorners = ct.y;
+    const isVertHole = this.la;
+    const traversalDecoder = this.K;
     const numCorners = ct.numCorners();
     const numFaces = ct.numFaces();
     const next = (c) => c < 0 ? -1 : c % 3 === 2 ? c - 2 : c + 1;
@@ -5358,28 +5087,12 @@ var MeshEdgebreakerDecoderImpl = class {
   // Removes invalid (isolated) vertices by swapping them with the last valid
   // vertex in the table, matching C++ mesh_edgebreaker_decoder_impl.cc (the
   // forward iteration order matters). Returns the final vertex count, or -1.
-  lc(invalidVertices) {
+  Ec(invalidVertices) {
     const ct = this.a;
     const cornerToVertex = ct.j;
-    const oppositeCorners = ct.p;
-    const vertexCorners = ct.w;
-    const isVertHole = this.ea;
-    const numCorners = ct.numCorners();
-    const next = (c) => c < 0 ? -1 : c % 3 === 2 ? c - 2 : c + 1;
-    const prev = (c) => c < 0 ? -1 : c % 3 === 0 ? c + 2 : c - 1;
-    const vertex = (c) => c < 0 || c >= numCorners ? -1 : cornerToVertex[c];
-    const opposite = (c) => c < 0 || c >= numCorners ? -1 : oppositeCorners[c];
+    const vertexCorners = ct.y;
+    const isVertHole = this.la;
     const leftMostCorner = (v) => v < 0 || v >= vertexCorners.length ? -1 : vertexCorners[v];
-    const swingLeft = (c) => {
-      const n = next(c);
-      const o = opposite(n);
-      return o < 0 ? -1 : next(o);
-    };
-    const swingRight = (c) => {
-      const p = prev(c);
-      const o = opposite(p);
-      return o < 0 ? -1 : prev(o);
-    };
     let numVertices = ct.numVertices();
     for (let ivIdx = 0; ivIdx < invalidVertices.length; ++ivIdx) {
       const invalidVert = invalidVertices[ivIdx];
@@ -5392,22 +5105,22 @@ var MeshEdgebreakerDecoderImpl = class {
       let cid = startCid;
       let leftTraversal = true;
       while (cid !== kInvalidCornerIndex6) {
-        if (vertex(cid) !== srcVert) {
+        if (ct.vertex(cid) !== srcVert) {
           return -1;
         }
         cornerToVertex[cid] = invalidVert;
         if (leftTraversal) {
-          const nextC = swingLeft(cid);
+          const nextC = ct.swingLeft(cid);
           if (nextC === kInvalidCornerIndex6) {
             leftTraversal = false;
-            cid = swingRight(startCid);
+            cid = ct.swingRight(startCid);
           } else if (nextC === startCid) {
             break;
           } else {
             cid = nextC;
           }
         } else {
-          cid = swingRight(cid);
+          cid = ct.swingRight(cid);
         }
       }
       vertexCorners[invalidVert] = leftMostCorner(srcVert);
@@ -5420,7 +5133,7 @@ var MeshEdgebreakerDecoderImpl = class {
   }
   // Hole events were removed from the bitstream in 2.1; for 2.2 this only
   // decodes the inline topology-split events.
-  ec(decoderBuffer) {
+  xc(decoderBuffer) {
     const numTopologySplits = decodeVarint(decoderBuffer);
     if (numTopologySplits === void 0) return false;
     if (numTopologySplits > 0) {
@@ -5438,12 +5151,12 @@ var MeshEdgebreakerDecoderImpl = class {
         if (delta2 > eventData.sourceSymbolId) return false;
         eventData.splitSymbolId = eventData.sourceSymbolId - delta2;
         lastSourceSymbolId = eventData.sourceSymbolId;
-        this.N.push(eventData);
+        this.O.push(eventData);
       }
       decoderBuffer.startBitDecoding(false);
       for (let i = 0; i < numTopologySplits; ++i) {
         const edgeData = decoderBuffer.decodeLeastSignificantBits32(1);
-        this.N[i].sourceEdge = edgeData & 1;
+        this.O[i].sourceEdge = edgeData & 1;
       }
       decoderBuffer.endBitDecoding();
     }
@@ -5461,32 +5174,37 @@ var MeshEdgebreakerDecoderImpl = class {
   // the face's base corner -- is just `oppCorner >= faceBaseCorner`, since the
   // base corner is a multiple of 3. That removes the per-corner division; the
   // invalid-corner case (-1) is still handled by the branch above it.
-  gc() {
+  zc() {
     const oppositeCorners = this.a.oppositeCornerArray();
     const attributeData = this.i;
     const numAttrData = attributeData.length;
-    const connectivityDecoders = this.I.Hb;
+    const connectivityDecoders = this.K._b;
     const numCorners = this.a.numCorners();
     const candidates = scratchInt32(numCorners);
     let numCandidates = 0;
+    let numBoundaryCorners = 0;
     for (let corner = 0; corner < numCorners; corner += 3) {
       let opp = oppositeCorners[corner];
       candidates[numCandidates] = corner ^ opp >> 31;
       numCandidates -= (opp | corner - opp - 1) >> 31;
+      numBoundaryCorners -= opp >> 31;
       opp = oppositeCorners[corner + 1];
       candidates[numCandidates] = corner + 1 ^ opp >> 31;
       numCandidates -= (opp | corner - opp - 1) >> 31;
+      numBoundaryCorners -= opp >> 31;
       opp = oppositeCorners[corner + 2];
       candidates[numCandidates] = corner + 2 ^ opp >> 31;
       numCandidates -= (opp | corner - opp - 1) >> 31;
+      numBoundaryCorners -= opp >> 31;
     }
+    this.Yb = numBoundaryCorners;
     for (let i = 0; i < numAttrData; ++i) {
       const ad = attributeData[i];
       const seamCorners = ad.attributeSeamCorners;
       let numSeamCorners = ad.numSeamCorners;
       const decoder = connectivityDecoders[i];
-      const ans = decoder.ansDecoder_;
-      const p = decoder.p_;
+      const ans = decoder.db;
+      const p = decoder.eb;
       const buf = ans.buf;
       const bufStart = ans.bufStart;
       let state = ans.state;
@@ -5514,8 +5232,8 @@ var MeshEdgebreakerDecoderImpl = class {
     }
   }
   // Position-only connectivity: vertex indices equal point indices.
-  hc(numConnectivityVerts) {
-    const mesh = this.o.mesh();
+  Ac(numConnectivityVerts) {
+    const mesh = this.n.mesh();
     const ct = this.a;
     mesh.setNumFaces(ct.numFaces());
     const numCorners = ct.numCorners();
@@ -5524,8 +5242,36 @@ var MeshEdgebreakerDecoderImpl = class {
     for (let c = 0; c < numCorners; ++c) {
       faces[c] = baseCornerToVertex[c];
     }
-    this.da = null;
-    this.o.pointCloud().setNumPoints(numConnectivityVerts);
+    this.ka = null;
+    this.n.pointCloud().setNumPoints(numConnectivityVerts);
+  }
+  // Builds an attribute corner table whose only seams are boundary edges (see
+  // decodeConnectivity), for a per-corner decoder that asked for it. With no
+  // interior seam every vertex ring is one attribute vertex, numbered in
+  // vertex order with isolated vertices skipped -- what the ring walk in
+  // _assignAttributeVerticesAndPoints assigns such a table, without the walk.
+  wc(ad) {
+    const ct = this.a;
+    const table = ad.connectivityData;
+    table.initEmpty(ct);
+    table.reserveSeamEdges(ad.numSeamCorners);
+    for (let s = 0; s < ad.numSeamCorners; ++s) table.addSeamEdge(ad.attributeSeamCorners[s]);
+    const numVertices = ct.numVertices();
+    const numCorners = ct.numCorners();
+    const vertexLeftmost = ct.vertexLeftmostCornerArray();
+    const cornerToVertex = ct.cornerToVertexArray();
+    const vertexIds = scratchInt32(numVertices);
+    const leftMost = scratchInt32(numVertices);
+    let numAttVertices = 0;
+    for (let v = 0; v < numVertices; ++v) {
+      const c = vertexLeftmost[v];
+      vertexIds[v] = c === kInvalidCornerIndex6 ? -1 : numAttVertices;
+      if (c !== kInvalidCornerIndex6) leftMost[numAttVertices++] = c;
+    }
+    const c2v = table.ca;
+    for (let c = 0; c < numCorners; ++c) c2v[c] = vertexIds[cornerToVertex[c]];
+    table.setRecomputedVertices(leftMost, numAttVertices);
+    ad.noInteriorSeams = false;
   }
   // One walk around every vertex ring that (a) numbers the attribute vertices
   // of every distinct attribute corner table (C++ MeshAttributeCornerTable::
@@ -5547,8 +5293,8 @@ var MeshEdgebreakerDecoderImpl = class {
   // corner of every boundary vertex, but allowed for by the C++ code) is
   // extended leftwards first, so the walk covers exactly the corners the
   // separate passes would have reached.
-  ic(tables) {
-    const mesh = this.o.mesh();
+  Bc(tables) {
+    const mesh = this.n.mesh();
     const ct = this.a;
     mesh.setNumFaces(ct.numFaces());
     const numCorners = ct.numCorners();
@@ -5556,7 +5302,7 @@ var MeshEdgebreakerDecoderImpl = class {
     const faces = mesh.faces_;
     const vertexLeftmost = ct.vertexLeftmostCornerArray();
     const baseOpposite = ct.oppositeCornerArray();
-    const isVertHole = this.ea;
+    const isVertHole = this.la;
     const numTables = tables.length;
     const attCornerToVertex = new Array(numTables);
     const edgeOnSeam = new Array(numTables);
@@ -5564,9 +5310,9 @@ var MeshEdgebreakerDecoderImpl = class {
     const leftMostMaps = new Array(numTables);
     const numAttVertices = new Int32Array(numTables);
     for (let t = 0; t < numTables; ++t) {
-      attCornerToVertex[t] = tables[t].corner_to_vertex_map_;
-      edgeOnSeam[t] = tables[t].is_edge_on_seam_;
-      vertexOnSeam[t] = tables[t].is_vertex_on_seam_;
+      attCornerToVertex[t] = tables[t].ca;
+      edgeOnSeam[t] = tables[t].ba;
+      vertexOnSeam[t] = tables[t].ta;
       leftMostMaps[t] = scratchInt32(numCorners);
     }
     const ring = scratchInt32(numCorners);
@@ -5574,9 +5320,33 @@ var MeshEdgebreakerDecoderImpl = class {
     const pointCorner = scratchInt32(numCorners);
     const idChange = scratchUint8Zeroed(numCorners);
     let numPoints = 0;
+    const plainPointId = scratchInt32(numVertices);
+    const plainVertIds = new Array(numTables);
+    for (let t = 0; t < numTables; ++t) plainVertIds[t] = scratchInt32(numVertices);
     for (let v = 0; v < numVertices; ++v) {
       const c = vertexLeftmost[v];
       if (c === kInvalidCornerIndex6) continue;
+      const hole = isVertHole[v] !== 0;
+      let anySeam = false;
+      for (let t = 0; t < numTables; ++t) {
+        if (vertexOnSeam[t][v] !== 0) {
+          anySeam = true;
+          break;
+        }
+      }
+      if (!hole && !anySeam) {
+        for (let t = 0; t < numTables; ++t) {
+          const vertId = numAttVertices[t];
+          leftMostMaps[t][vertId] = c;
+          plainVertIds[t][v] = vertId;
+          numAttVertices[t] = vertId + 1;
+        }
+        const pointId2 = numPoints++;
+        pointCorner[pointId2] = c;
+        plainPointId[v] = pointId2;
+        continue;
+      }
+      plainPointId[v] = -1;
       let start = 0;
       let k = 0;
       let actC = c;
@@ -5664,20 +5434,6 @@ var MeshEdgebreakerDecoderImpl = class {
         if (vertId !== firstVertId) idChange[first] = 1;
         numAttVertices[t] = vertId + 1;
       }
-      const hole = isVertHole[v] !== 0;
-      let anySeam = false;
-      for (let t = 0; t < numTables; ++t) {
-        if (vertexOnSeam[t][v] !== 0) {
-          anySeam = true;
-          break;
-        }
-      }
-      if (!hole && !anySeam) {
-        const pointId2 = numPoints++;
-        pointCorner[pointId2] = c;
-        for (let j2 = start; j2 < end; ++j2) faces[ring[j2]] = pointId2;
-        continue;
-      }
       let j = start;
       if (!hole) {
         for (let t = 0; t < numTables; ++t) {
@@ -5717,11 +5473,19 @@ var MeshEdgebreakerDecoderImpl = class {
         faces[rc] = pointId;
       }
     }
+    const baseCornerToVertex = ct.cornerToVertexArray();
+    for (let c = 0; c < numCorners; ++c) {
+      const v = baseCornerToVertex[c];
+      const pointId = plainPointId[v];
+      if (pointId < 0) continue;
+      faces[c] = pointId;
+      for (let t = 0; t < numTables; ++t) attCornerToVertex[t][c] = plainVertIds[t][v];
+    }
     for (let t = 0; t < numTables; ++t) {
       tables[t].setRecomputedVertices(leftMostMaps[t], numAttVertices[t]);
     }
-    this.da = pointCorner;
-    this.o.pointCloud().setNumPoints(numPoints);
+    this.ka = pointCorner;
+    this.n.pointCloud().setNumPoints(numPoints);
     return true;
   }
 };
@@ -5750,30 +5514,33 @@ var AttributeData = class {
   encodingData = new MeshAttributeIndicesEncodingData();
   attributeSeamCorners = new Int32Array(0);
   numSeamCorners = 0;
+  // Set when every seam is a boundary edge and connectivityData was therefore
+  // left unbuilt (see decodeConnectivity); cleared once it is built on demand.
+  noInteriorSeams = false;
 };
 var CornerTable = class {
-  Ib = 0;
-  H = 0;
+  $b = 0;
+  J = 0;
   l = 0;
   j = null;
   // corner -> vertex
-  p = null;
+  s = null;
   // corner -> opposite corner
-  w = null;
+  y = null;
   // vertex -> left-most corner
   reset(numFaces, numVertices) {
-    this.Ib = numFaces;
-    this.H = numFaces * 3;
+    this.$b = numFaces;
+    this.J = numFaces * 3;
     this.l = 0;
-    this.j = scratchInt32Filled(this.H, -1);
-    this.p = scratchInt32Filled(this.H, -1);
-    this.w = scratchInt32Filled(numVertices, -1);
+    this.j = scratchInt32Filled(this.J, -1);
+    this.s = scratchInt32Filled(this.J, -1);
+    this.y = scratchInt32Filled(numVertices, -1);
   }
   numFaces() {
-    return this.Ib;
+    return this.$b;
   }
   numCorners() {
-    return this.H;
+    return this.J;
   }
   numVertices() {
     return this.l;
@@ -5789,34 +5556,34 @@ var CornerTable = class {
     return rem === 0 ? corner + 2 : corner - 1;
   }
   vertex(corner) {
-    if (corner < 0 || corner >= this.H) return -1;
+    if (corner < 0 || corner >= this.J) return -1;
     return this.j[corner];
   }
   opposite(corner) {
-    if (corner < 0 || corner >= this.H) return -1;
-    return this.p[corner];
+    if (corner < 0 || corner >= this.J) return -1;
+    return this.s[corner];
   }
   // Flat-array accessors; let callers avoid polymorphic per-corner dispatch.
   cornerToVertexArray() {
     return this.j;
   }
   oppositeCornerArray() {
-    return this.p;
+    return this.s;
   }
   vertexLeftmostCornerArray() {
-    return this.w;
+    return this.y;
   }
   // Mirrors C++ CornerTable::AddNewVertex() (push_back(kInvalidCornerIndex)).
   addNewVertex() {
     const newVertex = this.l;
     this.l++;
-    if (newVertex >= this.w.length) {
-      const newCapacity = Math.max(newVertex + 1, this.w.length * 2, 64);
+    if (newVertex >= this.y.length) {
+      const newCapacity = Math.max(newVertex + 1, this.y.length * 2, 64);
       const newArr = scratchInt32Filled(newCapacity, -1);
-      newArr.set(this.w);
-      this.w = newArr;
+      newArr.set(this.y);
+      this.y = newArr;
     }
-    this.w[newVertex] = -1;
+    this.y[newVertex] = -1;
     return newVertex;
   }
   // Next corner around a vertex, CCW. SwingLeft(c) = Next(Opposite(Next(c))).
@@ -5837,24 +5604,24 @@ var CornerTable = class {
 
 // src/decoder/compression/mesh/MeshEdgebreakerTraversalDecoder.ts
 var MeshEdgebreakerTraversalDecoder = class {
-  e = new DecoderBuffer();
-  J = new DecoderBuffer();
-  gb = null;
-  Hb = [];
-  Jb = 0;
+  d = new DecoderBuffer();
+  L = new DecoderBuffer();
+  rb = null;
+  _b = [];
+  ac = 0;
   // _symbolBuffer's bit cursor, captured once bit decoding starts: decodeSymbol
   // runs per decoded face and would otherwise reach it through two property
   // loads and a method call per read.
-  Kb = null;
+  bc = null;
   init(decoder) {
-    const srcBuffer = decoder.o.buffer();
-    this.e.init(srcBuffer.dataHead, srcBuffer.remainingSize);
+    const srcBuffer = decoder.n.buffer();
+    this.d.init(srcBuffer.dataHead, srcBuffer.remainingSize);
   }
   // Ignored by default; overridden by predictive/valence decoders.
   setNumEncodedVertices(_numVertices) {
   }
   setNumAttributeData(numData) {
-    this.Jb = numData;
+    this.ac = numData;
   }
   // Sets outBuffer to the data encoded after the traversal section.
   start(outBuffer) {
@@ -5867,19 +5634,19 @@ var MeshEdgebreakerTraversalDecoder = class {
     if (!this.decodeAttributeSeams()) {
       return false;
     }
-    outBuffer.init(this.e.dataHead, this.e.remainingSize);
+    outBuffer.init(this.d.dataHead, this.d.remainingSize);
     return true;
   }
   decodeStartFaceConfiguration() {
-    return this.gb.decodeNextBit();
+    return this.rb.decodeNextBit();
   }
   decodeSymbol() {
-    const bd = this.Kb;
+    const bd = this.bc;
     if (bd !== null) {
-      const buf = bd.Ea;
+      const buf = bd.Na;
       const off = bd.q;
       const byteOffset = off >> 3;
-      if (byteOffset + 4 < bd.ka) {
+      if (byteOffset + 4 < bd.ra) {
         const bits = (buf[byteOffset] | buf[byteOffset + 1] << 8 | buf[byteOffset + 2] << 16 | buf[byteOffset + 3] << 24) >>> (off & 7) & 7;
         if ((bits & 1) === TOPOLOGY_C) {
           bd.q = off + 1;
@@ -5889,11 +5656,11 @@ var MeshEdgebreakerTraversalDecoder = class {
         return bits;
       }
     }
-    let symbol = this.J.decodeLeastSignificantBits32(1);
+    let symbol = this.L.decodeLeastSignificantBits32(1);
     if (symbol === TOPOLOGY_C) {
       return symbol;
     }
-    const symbolSuffix = this.J.decodeLeastSignificantBits32(2);
+    const symbolSuffix = this.L.decodeLeastSignificantBits32(2);
     symbol |= symbolSuffix << 1;
     return symbol;
   }
@@ -5902,39 +5669,39 @@ var MeshEdgebreakerTraversalDecoder = class {
   mergeVertices(_dest, _source) {
   }
   done() {
-    if (this.J.bitDecoderActive) {
-      this.J.endBitDecoding();
+    if (this.L.bitDecoderActive) {
+      this.L.endBitDecoding();
     }
   }
   decodeTraversalSymbols() {
-    this.J.init(this.e.dataHead, this.e.remainingSize);
-    const traversalSize = this.J.startBitDecoding(true);
+    this.L.init(this.d.dataHead, this.d.remainingSize);
+    const traversalSize = this.L.startBitDecoding(true);
     if (traversalSize === void 0) {
       return false;
     }
-    this.Kb = this.J.ma;
-    this.e.init(this.J.dataHead, this.J.remainingSize);
-    if (traversalSize > this.e.remainingSize) {
+    this.bc = this.L.sa;
+    this.d.init(this.L.dataHead, this.L.remainingSize);
+    if (traversalSize > this.d.remainingSize) {
       return false;
     }
-    this.e.advance(traversalSize);
+    this.d.advance(traversalSize);
     return true;
   }
   decodeStartFaces() {
     try {
-      this.gb = new RAnsBitDecoder();
-      return this.gb.startDecoding(this.e);
+      this.rb = new RAnsBitDecoder();
+      return this.rb.startDecoding(this.d);
     } catch {
       return false;
     }
   }
   decodeAttributeSeams() {
-    for (let i = 0; i < this.Jb; ++i) {
+    for (let i = 0; i < this.ac; ++i) {
       const decoder = new RAnsBitDecoder();
-      if (!decoder.startDecoding(this.e)) {
+      if (!decoder.startDecoding(this.d)) {
         return false;
       }
-      this.Hb.push(decoder);
+      this._b.push(decoder);
     }
     return true;
   }
@@ -5944,10 +5711,10 @@ var MeshEdgebreakerTraversalDecoder = class {
 var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTraversalDecoder {
   a = null;
   l = 0;
-  x = -1;
-  fa = -1;
+  A = -1;
+  ma = -1;
   k = [];
-  hb = null;
+  sb = null;
   init(decoder) {
     super.init(decoder);
     this.a = decoder.getCornerTable();
@@ -5967,24 +5734,24 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
       return false;
     }
     this.k = new Array(this.l).fill(0);
-    this.hb = new RAnsBitDecoder();
-    return this.hb.startDecoding(outBuffer);
+    this.sb = new RAnsBitDecoder();
+    return this.sb.startDecoding(outBuffer);
   }
   decodeSymbol() {
-    if (this.fa !== -1) {
-      if (this.hb.decodeNextBit()) {
-        this.x = this.fa;
-        return this.fa;
+    if (this.ma !== -1) {
+      if (this.sb.decodeNextBit()) {
+        this.A = this.ma;
+        return this.ma;
       }
     }
-    this.x = super.decodeSymbol();
-    return this.x;
+    this.A = super.decodeSymbol();
+    return this.A;
   }
   newActiveCornerReached(corner) {
     const ct = this.a;
     const next = ct.next(corner);
     const prev = ct.previous(corner);
-    switch (this.x) {
+    switch (this.A) {
       case TOPOLOGY_C:
       case TOPOLOGY_S:
         this.k[ct.vertex(next)] += 1;
@@ -6008,15 +5775,15 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
       default:
         break;
     }
-    if (this.x === TOPOLOGY_C || this.x === TOPOLOGY_R) {
+    if (this.A === TOPOLOGY_C || this.A === TOPOLOGY_R) {
       const pivot = ct.vertex(ct.next(corner));
       if (this.k[pivot] < 6) {
-        this.fa = TOPOLOGY_R;
+        this.ma = TOPOLOGY_R;
       } else {
-        this.fa = TOPOLOGY_C;
+        this.ma = TOPOLOGY_C;
       }
     } else {
-      this.fa = -1;
+      this.ma = -1;
     }
   }
   mergeVertices(dest, source) {
@@ -6028,14 +5795,14 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
 var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraversalDecoder {
   a = null;
   l = 0;
-  x = -1;
-  Ma = -1;
-  Na = 2;
-  ib = 7;
+  A = -1;
+  Wa = -1;
+  Xa = 2;
+  tb = 7;
   k = new Int32Array(0);
-  ga = [];
+  na = [];
   // Int32Array, not number[]: read and written once per decoded symbol.
-  za = new Int32Array(0);
+  Ga = new Int32Array(0);
   // corner -> vertex of _cornerTable, cached at init(); the array is created
   // once by CornerTable.reset() before the traversal decoder is initialized and
   // never replaced, so the per-symbol hot path can read it without two property
@@ -6056,11 +5823,11 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     if (!this.decodeAttributeSeams()) {
       return false;
     }
-    outBuffer.init(this.e.dataHead, this.e.remainingSize);
+    outBuffer.init(this.d.dataHead, this.d.remainingSize);
     this.k = scratchInt32Filled(this.l, 0);
-    const numUniqueValences = this.ib - this.Na + 1;
-    this.ga = new Array(numUniqueValences);
-    this.za = new Int32Array(numUniqueValences);
+    const numUniqueValences = this.tb - this.Xa + 1;
+    this.na = new Array(numUniqueValences);
+    this.Ga = new Int32Array(numUniqueValences);
     const pending = [];
     for (let i = 0; i < numUniqueValences; ++i) {
       const numSymbols = decodeVarint(outBuffer);
@@ -6071,16 +5838,16 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
         return false;
       }
       if (numSymbols > 0) {
-        this.ga[i] = scratchUint32(numSymbols);
+        this.na[i] = scratchUint32(numSymbols);
         const scheme = outBuffer.decodeUint8();
-        if (scheme === SymbolCodingMethod.SYMBOL_CODING_TAGGED) {
-          if (!decodeTaggedSymbols(numSymbols, 1, outBuffer, this.ga[i])) {
+        if (scheme === 0 /* SYMBOL_CODING_TAGGED */) {
+          if (!decodeTaggedSymbols(numSymbols, 1, outBuffer, this.na[i])) {
             return false;
           }
-          this.za[i] = numSymbols;
+          this.Ga[i] = numSymbols;
           continue;
         }
-        if (scheme !== SymbolCodingMethod.SYMBOL_CODING_RAW) {
+        if (scheme !== 1 /* SYMBOL_CODING_RAW */) {
           return false;
         }
         const maxBitLength = outBuffer.decodeUint8();
@@ -6097,27 +5864,27 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
         if (!decoder.startDecoding(outBuffer)) {
           return false;
         }
-        pending.push({ decoder, out: this.ga[i], count: numSymbols });
-        this.za[i] = numSymbols;
+        pending.push({ decoder, out: this.na[i], count: numSymbols });
+        this.Ga[i] = numSymbols;
       } else {
-        this.ga[i] = new Uint32Array(0);
-        this.za[i] = 0;
+        this.na[i] = new Uint32Array(0);
+        this.Ga[i] = 0;
       }
     }
-    const lockstep = pending.filter((entry) => entry.decoder.ans_.lutTable instanceof Uint8Array);
+    const lockstep = pending.filter((entry) => !entry.decoder.o.coarse);
     let p = 0;
     while (lockstep.length - p >= 3) {
       const a = lockstep[p];
       const b = lockstep[p + 1];
       const c = lockstep[p + 2];
-      ransDecodeSymbolsTrioU8(
-        a.decoder.ans_,
+      ransDecodeSymbolsTrioU16(
+        a.decoder.o,
         a.out,
         a.count,
-        b.decoder.ans_,
+        b.decoder.o,
         b.out,
         b.count,
-        c.decoder.ans_,
+        c.decoder.o,
         c.out,
         c.count
       );
@@ -6126,35 +5893,35 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     if (lockstep.length - p === 2) {
       const a = lockstep[p];
       const b = lockstep[p + 1];
-      ransDecodeSymbolsPairU8(a.decoder.ans_, a.out, a.count, b.decoder.ans_, b.out, b.count);
+      ransDecodeSymbolsPairU16(a.decoder.o, a.out, a.count, b.decoder.o, b.out, b.count);
       p += 2;
     }
     for (; p < lockstep.length; ++p) {
-      lockstep[p].decoder.ans_.decodeSymbols(lockstep[p].out, lockstep[p].count);
+      lockstep[p].decoder.o.decodeSymbols(lockstep[p].out, lockstep[p].count);
     }
     for (const entry of pending) {
-      if (!(entry.decoder.ans_.lutTable instanceof Uint8Array)) {
-        entry.decoder.ans_.decodeSymbols(entry.out, entry.count);
+      if (entry.decoder.o.coarse) {
+        entry.decoder.o.decodeSymbols(entry.out, entry.count);
       }
       entry.decoder.endDecoding();
     }
     return true;
   }
   decodeSymbol() {
-    if (this.Ma !== -1) {
-      const contextCounter = --this.za[this.Ma];
+    if (this.Wa !== -1) {
+      const contextCounter = --this.Ga[this.Wa];
       if (contextCounter < 0) {
         return TOPOLOGY_INVALID;
       }
-      const symbolId = this.ga[this.Ma][contextCounter];
+      const symbolId = this.na[this.Wa][contextCounter];
       if (symbolId > 4) {
         return TOPOLOGY_INVALID;
       }
-      this.x = edgeBreakerSymbolToTopologyId[symbolId];
+      this.A = edgeBreakerSymbolToTopologyId[symbolId];
     } else {
-      this.x = TOPOLOGY_E;
+      this.A = TOPOLOGY_E;
     }
-    return this.x;
+    return this.A;
   }
   newActiveCornerReached(corner) {
     const cornerToVertex = this.j;
@@ -6163,7 +5930,7 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     const prev = corner % 3 === 0 ? corner + 2 : corner - 1;
     const vertNext = cornerToVertex[next];
     const vertPrev = cornerToVertex[prev];
-    switch (this.x) {
+    switch (this.A) {
       case TOPOLOGY_C:
       case TOPOLOGY_S:
         valences[vertNext] += 1;
@@ -6189,14 +5956,14 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     }
     const activeValence = valences[vertNext];
     let clampedValence;
-    if (activeValence < this.Na) {
-      clampedValence = this.Na;
-    } else if (activeValence > this.ib) {
-      clampedValence = this.ib;
+    if (activeValence < this.Xa) {
+      clampedValence = this.Xa;
+    } else if (activeValence > this.tb) {
+      clampedValence = this.tb;
     } else {
       clampedValence = activeValence;
     }
-    this.Ma = clampedValence - this.Na;
+    this.Wa = clampedValence - this.Xa;
   }
   mergeVertices(dest, source) {
     this.k[dest] += this.k[source];
@@ -6206,53 +5973,53 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
 // src/decoder/compression/mesh/MeshEdgebreakerDecoder.ts
 var MeshEdgebreakerDecoder = class extends MeshDecoder {
   // Set by initializeDecoder(), which runs before anything below is reached.
-  ha = null;
+  oa = null;
   getCornerTable() {
-    return this.ha.getCornerTable();
+    return this.oa.getCornerTable();
   }
   getAttributeCornerTable(attId) {
-    return this.ha.getAttributeCornerTable(attId);
+    return this.oa.getAttributeCornerTable(attId);
   }
   getAttributeEncodingData(attId) {
-    return this.ha.getAttributeEncodingData(attId);
+    return this.oa.getAttributeEncodingData(attId);
   }
   initializeDecoder() {
     const traversalDecoderType = this.buffer().decodeUint8();
-    const TraversalDecoderClass = traversalDecoderType === MeshEdgebreakerConnectivityEncodingMethod.MESH_EDGEBREAKER_STANDARD_ENCODING ? MeshEdgebreakerTraversalDecoder : traversalDecoderType === MeshEdgebreakerConnectivityEncodingMethod.MESH_EDGEBREAKER_PREDICTIVE_ENCODING ? MeshEdgebreakerTraversalPredictiveDecoder : traversalDecoderType === MeshEdgebreakerConnectivityEncodingMethod.MESH_EDGEBREAKER_VALENCE_ENCODING ? MeshEdgebreakerTraversalValenceDecoder : null;
+    const TraversalDecoderClass = traversalDecoderType === 0 /* MESH_EDGEBREAKER_STANDARD_ENCODING */ ? MeshEdgebreakerTraversalDecoder : traversalDecoderType === 1 /* MESH_EDGEBREAKER_PREDICTIVE_ENCODING */ ? MeshEdgebreakerTraversalPredictiveDecoder : traversalDecoderType === 2 /* MESH_EDGEBREAKER_VALENCE_ENCODING */ ? MeshEdgebreakerTraversalValenceDecoder : null;
     if (TraversalDecoderClass === null) {
       return false;
     }
-    this.ha = new MeshEdgebreakerDecoderImpl(this, TraversalDecoderClass);
+    this.oa = new MeshEdgebreakerDecoderImpl(this, TraversalDecoderClass);
     return true;
   }
   createAttributesDecoder(attDecoderId) {
-    return this.ha.createAttributesDecoder(attDecoderId);
+    return this.oa.createAttributesDecoder(attDecoderId);
   }
   decodeConnectivity() {
-    return this.ha.decodeConnectivity();
+    return this.oa.decodeConnectivity();
   }
 };
 
 // src/decoder/compression/attributes/LinearSequencer.ts
 var LinearSequencer = class {
-  Oa;
-  v = new Int32Array(0);
+  Ya;
+  x = new Int32Array(0);
   constructor(numPoints) {
-    this.Oa = numPoints;
+    this.Ya = numPoints;
   }
   generateSequence() {
-    if (this.Oa < 0) {
+    if (this.Ya < 0) {
       return false;
     }
-    const ids = new Int32Array(this.Oa);
-    for (let i = 0; i < this.Oa; ++i) {
+    const ids = new Int32Array(this.Ya);
+    for (let i = 0; i < this.Ya; ++i) {
       ids[i] = i;
     }
-    this.v = ids;
+    this.x = ids;
     return true;
   }
   getOutputPointIds() {
-    return this.v;
+    return this.x;
   }
   updatePointToAttributeIndexMapping(attribute) {
     attribute.setIdentityMapping();
@@ -6279,7 +6046,7 @@ var MeshSequentialDecoder = class extends MeshDecoder {
       return false;
     }
     if (connectivityMethod === 0) {
-      if (!this.mc(numFaces)) {
+      if (!this.Fc(numFaces)) {
         return false;
       }
     } else {
@@ -6318,7 +6085,7 @@ var MeshSequentialDecoder = class extends MeshDecoder {
       new SequentialAttributeDecodersController(new LinearSequencer(this.pointCloud().numPoints()))
     );
   }
-  mc(numFaces) {
+  Fc(numFaces) {
     const numIndices = numFaces * 3;
     const indicesBuffer = new Uint32Array(numIndices);
     if (!decodeSymbols(numIndices, 1, this.buffer(), indicesBuffer)) {
@@ -6351,9 +6118,9 @@ var MeshSequentialDecoder = class extends MeshDecoder {
 
 // src/decoder/compression/Decode.ts
 function createMeshDecoder(method) {
-  if (method === MeshEncoderMethod.MESH_SEQUENTIAL_ENCODING) {
+  if (method === 0 /* MESH_SEQUENTIAL_ENCODING */) {
     return new MeshSequentialDecoder();
-  } else if (method === MeshEncoderMethod.MESH_EDGEBREAKER_ENCODING) {
+  } else if (method === 1 /* MESH_EDGEBREAKER_ENCODING */) {
     return new MeshEdgebreakerDecoder();
   }
   throw new Error("Unsupported mesh encoding method.");
@@ -6366,7 +6133,7 @@ var Decoder = class {
     if (headerError !== "") {
       return { mesh: null, ok: false, message: headerError };
     }
-    if (header.encoderType !== EncodedGeometryType.TRIANGULAR_MESH) {
+    if (header.encoderType !== 1 /* TRIANGULAR_MESH */) {
       return { mesh: null, ok: false, message: "Input is not a Draco triangular mesh." };
     }
     try {
@@ -6429,12 +6196,12 @@ var MinidracoLoader = class extends Loader {
   mainThreadByteThreshold;
   // The pool, once its module has loaded; null again after dispose() so a
   // later decode spawns a fresh one.
-  ja = null;
-  jb = null;
+  qa = null;
+  ub = null;
   // Set when the pool module fails to load or the pool breaks: decoding
   // transparently falls back to the main thread.
-  kb = false;
-  Aa = null;
+  vb = false;
+  Ha = null;
   // Accepts either a LoadingManager (three-compatible form) or an options bag.
   constructor(managerOrOptions) {
     const options = isLoadingManager(managerOrOptions) ? { manager: managerOrOptions } : managerOrOptions ?? {};
@@ -6448,7 +6215,7 @@ var MinidracoLoader = class extends Loader {
   // (bundlers emit it as a hashed asset), and CDN origins are handled by the
   // blob bootstrap in the pool. Takes effect for the next pool spawned.
   setWorkerUrl(url) {
-    this.Aa = url;
+    this.Ha = url;
     return this;
   }
   // No-ops kept for API compatibility with THREE.DRACOLoader — minidraco has
@@ -6465,7 +6232,7 @@ var MinidracoLoader = class extends Loader {
   }
   setWorkerLimit(limit) {
     this.workerLimit = limit;
-    if (this.ja !== null) this.ja.limit = limit;
+    if (this.qa !== null) this.qa.limit = limit;
     return this;
   }
   // Toggle the worker pool on/off. true enables the pool, keeping the current
@@ -6477,15 +6244,15 @@ var MinidracoLoader = class extends Loader {
   // Loads the pool module and spawns the whole pool now, so the workers' JIT
   // warmup overlaps the model download instead of the first decode burst.
   preload() {
-    if (this.Mb()) {
-      this.Nb().then((pool) => pool?.spawnAll());
+    if (this.dc()) {
+      this.ec().then((pool) => pool?.spawnAll());
     }
     return this;
   }
   dispose() {
-    if (this.ja !== null) this.ja.dispose();
-    this.ja = null;
-    this.jb = null;
+    if (this.qa !== null) this.qa.dispose();
+    this.qa = null;
+    this.ub = null;
     return this;
   }
   load(url, onLoad, onProgress, onError) {
@@ -6525,21 +6292,21 @@ var MinidracoLoader = class extends Loader {
         return cachedTask.promise;
       }
     }
-    const geometryPending = this.pc(buffer, taskConfig);
+    const geometryPending = this.Ic(buffer, taskConfig);
     _taskCache.set(buffer, { key: taskKey, promise: geometryPending });
     return geometryPending;
   }
-  async pc(buffer, taskConfig) {
-    if (this.Mb()) {
+  async Ic(buffer, taskConfig) {
+    if (this.dc()) {
       if (buffer.byteLength > this.mainThreadByteThreshold) {
-        const pool = await this.Nb();
+        const pool = await this.ec();
         if (pool !== null) {
           try {
             const raw = await pool.decode(buffer, taskConfig);
-            return this.Ob(raw, taskConfig);
+            return this.fc(raw, taskConfig);
           } catch (error) {
             if (error?.isDecodeError) throw error;
-            this.kb = true;
+            this.vb = true;
           }
         }
       } else {
@@ -6548,28 +6315,28 @@ var MinidracoLoader = class extends Loader {
     }
     return this._decodeBuffer(buffer, taskConfig);
   }
-  Mb() {
-    return this.workerLimit > 0 && typeof Worker !== "undefined" && !this.kb;
+  dc() {
+    return this.workerLimit > 0 && typeof Worker !== "undefined" && !this.vb;
   }
   // The pool, loading its module on first use. Resolves null (and marks the
   // workers broken) when the module cannot be loaded, e.g. a bundler that does
   // not split dynamic imports out of dependencies.
-  Nb() {
-    this.jb ??= import("./pool.js").then(
-      (module) => this.ja = new module.WorkerPool(this.workerLimit, this.Aa),
+  ec() {
+    this.ub ??= import("./pool.js").then(
+      (module) => this.qa = new module.WorkerPool(this.workerLimit, this.Ha),
       () => {
-        this.kb = true;
+        this.vb = true;
         return null;
       }
     );
-    return this.jb;
+    return this.ub;
   }
-  Ob(raw, taskConfig) {
+  fc(raw, taskConfig) {
     const geometry = new BufferGeometry();
     for (const attribute of raw.attributes) {
       const bufferAttribute = new BufferAttribute(attribute.array, attribute.itemSize);
       if (attribute.name === "color") {
-        this.qc(bufferAttribute, taskConfig.vertexColorSpace);
+        this.Jc(bufferAttribute, taskConfig.vertexColorSpace);
         bufferAttribute.normalized = !(attribute.array instanceof Float32Array);
       }
       geometry.setAttribute(attribute.name, bufferAttribute);
@@ -6608,12 +6375,11 @@ var MinidracoLoader = class extends Loader {
         itemSize: attribute.numComponents
       });
     }
-    const numFaces = dracoGeometry.numFaces();
-    const indices = new Uint32Array(numFaces * 3);
-    indices.set(dracoGeometry.faces_.subarray(0, numFaces * 3));
-    return this.Ob({ indices, attributes }, taskConfig);
+    const faces = dracoGeometry.faces_;
+    const indices = new Uint32Array(faces.buffer, faces.byteOffset, dracoGeometry.numFaces() * 3);
+    return this.fc({ indices, attributes }, taskConfig);
   }
-  qc(attribute, inputColorSpace) {
+  Jc(attribute, inputColorSpace) {
     if (inputColorSpace !== SRGBColorSpace) return;
     const _color = new Color();
     for (let i = 0, il = attribute.count; i < il; i++) {