@bldrs-ai/conway 1.408.1248 → 1.409.1251

package/compiled/examples/browser-bundled.cjs

@@ -30,7 +30,7 @@ var import_node_process = require("node:process");
 var readline = __toESM(require("node:readline"), 1);
 
 // compiled/src/version/version.js
-var versionString = "Conway v1.408.1248";
+var versionString = "Conway v1.409.1251";
 
 // compiled/dependencies/conway-geom/interface/conway_geometry.js
 var wasmType = "";
@@ -2587,8 +2587,8 @@ var StepParser = class extends StepHeaderParser {
    * @param onProgress Optional byte-cursor progress callback.
    * @return {BlockParseResult} The parsing result, including the index and result enum.
    */
-  parseDataBlockStreamed(input2, onRecordBoundary, onRecordIndexed, onProgress) {
-    const parser211 = this.parseDataBlockIncremental(input2, onRecordBoundary, onRecordIndexed);
+  parseDataBlockStreamed(input2, onRecordBoundary, onRecordIndexed, onProgress, sink) {
+    const parser211 = this.parseDataBlockIncremental(input2, onRecordBoundary, onRecordIndexed, sink);
     while (true) {
       const next = parser211.next();
       if (next.done === true) {
@@ -2634,8 +2634,14 @@ var StepParser = class extends StepHeaderParser {
    * @yields {number} The current byte cursor within the input buffer.
    * @return {BlockParseResult} The parsing result, including the index and result enum.
    */
-  *parseDataBlockIncremental(input2, onRecordBoundary, onRecordIndexed) {
+  *parseDataBlockIncremental(input2, onRecordBoundary, onRecordIndexed, sink) {
     const indexResult = { elements: [] };
+    let topLevelCount = 0;
+    const pushEntry = sink !== void 0 ? (entry) => {
+      sink.pushTopLevel(entry);
+    } : (entry) => {
+      indexResult.elements.push(entry);
+    };
     const match = input2.match;
     const comment = () => match(commentParser2);
     const whitespace = () => {
@@ -2811,8 +2817,9 @@ var StepParser = class extends StepHeaderParser {
         if (!charws(SEMICOLON)) {
           return syntaxError();
         }
-        onRecordIndexed?.(indexResult.elements.length, expressID, 0);
-        indexResult.elements.push({
+        onRecordIndexed?.(topLevelCount, expressID, 0);
+        ++topLevelCount;
+        pushEntry({
           address: startElement2,
           length: input2.address - startElement2,
           typeID: 0,
@@ -2903,8 +2910,9 @@ var StepParser = class extends StepHeaderParser {
       if (!charws(SEMICOLON)) {
         return syntaxError();
       }
-      onRecordIndexed?.(indexResult.elements.length, expressID, foundItem);
-      indexResult.elements.push({
+      onRecordIndexed?.(topLevelCount, expressID, foundItem);
+      ++topLevelCount;
+      pushEntry({
         address: startElement,
         length: input2.address - startElement,
         typeID: foundItem,
@@ -5000,6 +5008,31 @@ var StepModelBase = class {
     this.elementMemoization = true;
     this.nullOnErrors = true;
     this.bufferProvider_ = provider ?? new ResidentStepBufferProvider(buffer_);
+    if (!Array.isArray(elementIndex)) {
+      const columns = elementIndex;
+      const firstInline = columns.firstInlineElement;
+      const inlineCount = columns.count - firstInline;
+      const inlineElementTable2 = new Uint32Array(inlineCount << 1);
+      for (let where2 = 0; where2 < inlineCount; ++where2) {
+        inlineElementTable2[where2 << 1] = firstInline + where2;
+        inlineElementTable2[(where2 << 1) + 1] = columns.address[firstInline + where2];
+      }
+      this.inlineAddressMap_ = new InterpolationSearchTable32(inlineElementTable2, true);
+      const expressIdTable2 = new Uint32Array(firstInline << 1);
+      for (let where2 = 0; where2 < firstInline; ++where2) {
+        expressIdTable2[where2 << 1] = where2;
+        expressIdTable2[(where2 << 1) + 1] = columns.expressID[where2];
+      }
+      this.expressIDMap_ = new InterpolationSearchTable32(expressIdTable2, columns.expressIdsSorted);
+      this.address_ = columns.address;
+      this.length_ = columns.length;
+      this.typeID_ = columns.typeID;
+      this.expressID_ = columns.expressID;
+      this.count_ = columns.count;
+      this.firstInlineElement_ = firstInline;
+      this.complexEntries_ = columns.complexEntries;
+      return;
+    }
     const localElementIndex = elementIndex;
     let where = 0;
     const firstInlineElement = localElementIndex.length;
@@ -70117,6 +70150,68 @@ var StepTypeIndexer = class {
   constructor(typeCount) {
     this.elementCounter_ = new Int32Array(typeCount << 1);
   }
+  /**
+   * Create a type index from either index form — the parsed object array or
+   * the columnar index (M7).
+   *
+   * @param index The element index, object or columnar.
+   * @return {MultiIndexSet} The created multi-set index.
+   */
+  createFor(index) {
+    return Array.isArray(index) ? this.create(index) : this.createFromColumns(index);
+  }
+  /**
+   * Create a type index straight from the columnar index — the same
+   * membership `create` produces from the unfolded object array: every row's
+   * concrete type (top-level + inline; −1 rows skipped) plus the
+   * multi-mapping subtypes of retained complex entries at their parent's
+   * dense index.
+   *
+   * @param columns The columnar index.
+   * @return {MultiIndexSet} The created multi-set index.
+   */
+  createFromColumns(columns) {
+    for (let where = 0, end = this.elementCounter_.length; where < end; where += 2) {
+      initCountCompactedElements32State(this.elementCounter_, where);
+    }
+    const elementCounter = this.elementCounter_;
+    const prefixSum = new Uint32Array((this.elementCounter_.length >>> 1) + 1);
+    const typeIDs = columns.typeID;
+    const count = columns.count;
+    const walkRows = (addOne) => {
+      const complexIterator = columns.complexEntries?.entries();
+      let nextComplex = complexIterator?.next();
+      for (let denseIndex = 0; denseIndex < count; ++denseIndex) {
+        const typeID = typeIDs[denseIndex];
+        if (typeID >= 0) {
+          addOne(denseIndex, typeID);
+        }
+        if (nextComplex !== void 0 && !nextComplex.done && nextComplex.value[0] === denseIndex) {
+          for (const subElement of nextComplex.value[1].multiMapping ?? []) {
+            const subTypeID = subElement.typeID;
+            if (subTypeID !== void 0) {
+              addOne(denseIndex, subTypeID);
+            }
+          }
+          nextComplex = complexIterator.next();
+        }
+      }
+    };
+    walkRows((denseIndex, typeID) => {
+      prefixSum[typeID + 1] = addCompactedElementCount32State(denseIndex, elementCounter, typeID << 1);
+    });
+    for (let prefixSumIndex = 2, prefixSumEnd = prefixSum.length; prefixSumIndex < prefixSumEnd; ++prefixSumIndex) {
+      prefixSum[prefixSumIndex] += prefixSum[prefixSumIndex - 1];
+    }
+    for (let where = 0, end = this.elementCounter_.length; where < end; where += 2) {
+      initCountCompactedElements32State(this.elementCounter_, where);
+    }
+    const indexOutput = new Uint32Array(prefixSum[prefixSum.length - 1] << 1);
+    walkRows((denseIndex, typeID) => {
+      addCompactedElement32State(denseIndex, elementCounter, indexOutput, typeID << 1, prefixSum[typeID] << 1);
+    });
+    return new MultiIndexSet(prefixSum, indexOutput);
+  }
   /**
    * Create a type index from a set of parsed STEP elements.
    *
@@ -70778,12 +70873,136 @@ var IfcStepModel = class extends StepModelBase {
     this.materials = new IfcMaterialCache(this);
     this.voidMaterials = new IfcMaterialCache(this, true);
     this.elementTypeIDs = entity_types_ifc_gen_default;
-    this.typeIndex = indexerInstance.create(elementIndex);
+    this.typeIndex = indexerInstance.createFor(elementIndex);
+  }
+};
+
+// compiled/src/step/parsing/columnar_index.js
+var COLUMN_UNDEFINED_TYPE = -1;
+var SEGMENT_ROWS = 64 * 1024;
+var ColumnarIndexSink = class {
+  constructor() {
+    this.segments_ = [];
+    this.count_ = 0;
+    this.retained_ = /* @__PURE__ */ new Map();
+    this.expressIdsSorted_ = true;
+    this.previousExpressID_ = 0;
+  }
+  /**
+   * @return {number} Top-level records pushed so far.
+   */
+  get topLevelCount() {
+    return this.count_;
+  }
+  /**
+   * Encode one completed top-level record into the columns. The entry object
+   * is not kept unless it carries children (inline entities / multi-mapping).
+   *
+   * @param entry The completed top-level index entry.
+   */
+  pushTopLevel(entry) {
+    const localID = this.count_++;
+    const segmentIndex = Math.floor(localID / SEGMENT_ROWS);
+    const row = localID % SEGMENT_ROWS;
+    if (segmentIndex === this.segments_.length) {
+      this.segments_.push({
+        address: new Uint32Array(SEGMENT_ROWS),
+        length: new Uint32Array(SEGMENT_ROWS),
+        typeID: new Int32Array(SEGMENT_ROWS),
+        expressID: new Uint32Array(SEGMENT_ROWS)
+      });
+    }
+    const segment = this.segments_[segmentIndex];
+    segment.address[row] = entry.address;
+    segment.length[row] = entry.length;
+    segment.typeID[row] = entry.typeID === void 0 ? COLUMN_UNDEFINED_TYPE : entry.typeID;
+    segment.expressID[row] = entry.expressID;
+    if (entry.expressID < this.previousExpressID_) {
+      this.expressIdsSorted_ = false;
+    }
+    this.previousExpressID_ = entry.expressID;
+    if (entry.inlineEntities !== void 0 || entry.multiMapping !== void 0) {
+      this.retained_.set(localID, entry);
+    }
+  }
+  /**
+   * Rewind to empty (the streaming builder's grow-and-restart). The first
+   * segment is kept for reuse.
+   */
+  reset() {
+    this.segments_.length = Math.min(this.segments_.length, 1);
+    this.count_ = 0;
+    this.retained_.clear();
+    this.expressIdsSorted_ = true;
+    this.previousExpressID_ = 0;
+  }
+  /**
+   * Assemble the final columns: concatenate the top-level segments (one
+   * column at a time, bounding transient overhead to a single column's
+   * segments) and unfold retained inline entities into the inline range in
+   * the model's exact unfold order.
+   *
+   * @return {StepIndexColumns} The finished columnar index.
+   */
+  finalize() {
+    const topLevel = this.count_;
+    const unfolded = [];
+    for (const entry of this.retained_.values()) {
+      if (entry.inlineEntities !== void 0) {
+        unfolded.push(...entry.inlineEntities);
+      }
+    }
+    for (let where = 0; where < unfolded.length; ++where) {
+      const inlineEntities = unfolded[where].inlineEntities;
+      if (inlineEntities !== void 0) {
+        unfolded.push(...inlineEntities);
+      }
+    }
+    const count = topLevel + unfolded.length;
+    const address = concatColumn(this.segments_, "address", topLevel, count);
+    const length = concatColumn(this.segments_, "length", topLevel, count);
+    const typeID = new Int32Array(count);
+    for (let segment = 0; segment * SEGMENT_ROWS < topLevel; ++segment) {
+      const rows = Math.min(SEGMENT_ROWS, topLevel - segment * SEGMENT_ROWS);
+      typeID.set(this.segments_[segment].typeID.subarray(0, rows), segment * SEGMENT_ROWS);
+    }
+    const expressID = concatColumn(this.segments_, "expressID", topLevel, topLevel);
+    for (let where = 0; where < unfolded.length; ++where) {
+      const entry = unfolded[where];
+      const row = topLevel + where;
+      address[row] = entry.address;
+      length[row] = entry.length;
+      typeID[row] = entry.typeID === void 0 ? COLUMN_UNDEFINED_TYPE : entry.typeID;
+    }
+    let complexEntries;
+    for (const [localID, entry] of this.retained_) {
+      if (entry.multiMapping !== void 0) {
+        (complexEntries ??= /* @__PURE__ */ new Map()).set(localID, entry);
+      }
+    }
+    return {
+      address,
+      length,
+      typeID,
+      expressID,
+      count,
+      firstInlineElement: topLevel,
+      complexEntries,
+      expressIdsSorted: this.expressIdsSorted_
+    };
   }
 };
+function concatColumn(segments, column, rows, finalLength) {
+  const result = new Uint32Array(finalLength);
+  for (let segment = 0; segment * SEGMENT_ROWS < rows; ++segment) {
+    const valid = Math.min(SEGMENT_ROWS, rows - segment * SEGMENT_ROWS);
+    result.set(segments[segment][column].subarray(0, valid), segment * SEGMENT_ROWS);
+  }
+  return result;
+}
 
 // compiled/src/step/parsing/streaming_index_builder.js
-function buildIndexStreaming(source, parser211, pool3, onRecordIndexed) {
+function buildIndexStreaming(source, parser211, pool3, onRecordIndexed, sink) {
   const fileSize = source.byteLength;
   let windowBytes = Math.max(pool3, MIN_WINDOW);
   for (; ; ) {
@@ -70829,11 +71048,12 @@ function buildIndexStreaming(source, parser211, pool3, onRecordIndexed) {
       buffer.rebaseWindow(window2, 0, windowLen, windowStartFile);
       ++slides;
     };
-    const [index, result] = parser211.parseDataBlockStreamed(input2, onRecordBoundary, onRecordIndexed);
+    const [index, result] = parser211.parseDataBlockStreamed(input2, onRecordBoundary, onRecordIndexed, void 0, sink);
     const stoppedShort = result !== ParseResult.COMPLETE;
     const notAtEof = windowStartFile + windowLen < fileSize;
     if (stoppedShort && notAtEof) {
       windowBytes *= 2;
+      sink?.reset();
       continue;
     }
     const lastRecordLen = windowStartFile + input2.cursor - prevBoundaryFile;
@@ -70849,6 +71069,11 @@ function buildIndexStreaming(source, parser211, pool3, onRecordIndexed) {
   }
 }
 var MIN_WINDOW = 4 * 1024;
+function buildColumnarIndexStreaming(source, parser211, pool3, onRecordIndexed) {
+  const sink = new ColumnarIndexSink();
+  const { header, result, stats } = buildIndexStreaming(source, parser211, pool3, onRecordIndexed, sink);
+  return { header, columns: sink.finalize(), result, stats };
+}
 
 // compiled/src/ifc/ifc_step_parser.js
 var DEFAULT_STREAM_POOL_BYTES = 1024 * 1024;
@@ -70914,9 +71139,9 @@ var IfcStepParser = class extends StepParser {
     if (store.byteLength !== source.byteLength) {
       throw new Error(`Streaming store byteLength ${store.byteLength} does not match source byteLength ${source.byteLength}`);
     }
-    const { elements, result } = buildIndexStreaming(source, this, opts?.pool ?? DEFAULT_STREAM_POOL_BYTES);
+    const { columns, result } = buildColumnarIndexStreaming(source, this, opts?.pool ?? DEFAULT_STREAM_POOL_BYTES);
     const provider = new WindowedStepBufferProvider(store, opts?.chunkBytes, opts?.maxResidentChunks);
-    return [result, new IfcStepModel(void 0, elements, provider)];
+    return [result, new IfcStepModel(void 0, columns, provider)];
   }
 };
 IfcStepParser.Instance = new IfcStepParser();

package/compiled/examples/cli-bundled.cjs

@@ -14965,7 +14965,7 @@ ${t5.join("\n")}` : "";
 var import_process = require("process");
 
 // compiled/src/version/version.js
-var versionString = "Conway v1.408.1248";
+var versionString = "Conway v1.409.1251";
 
 // compiled/dependencies/conway-geom/interface/conway_geometry.js
 function pThreadsAllowed() {
@@ -18401,8 +18401,8 @@ var StepParser = class extends StepHeaderParser {
    * @param onProgress Optional byte-cursor progress callback.
    * @return {BlockParseResult} The parsing result, including the index and result enum.
    */
-  parseDataBlockStreamed(input, onRecordBoundary, onRecordIndexed, onProgress) {
-    const parser210 = this.parseDataBlockIncremental(input, onRecordBoundary, onRecordIndexed);
+  parseDataBlockStreamed(input, onRecordBoundary, onRecordIndexed, onProgress, sink) {
+    const parser210 = this.parseDataBlockIncremental(input, onRecordBoundary, onRecordIndexed, sink);
     while (true) {
       const next = parser210.next();
       if (next.done === true) {
@@ -18448,8 +18448,14 @@ var StepParser = class extends StepHeaderParser {
    * @yields {number} The current byte cursor within the input buffer.
    * @return {BlockParseResult} The parsing result, including the index and result enum.
    */
-  *parseDataBlockIncremental(input, onRecordBoundary, onRecordIndexed) {
+  *parseDataBlockIncremental(input, onRecordBoundary, onRecordIndexed, sink) {
     const indexResult = { elements: [] };
+    let topLevelCount = 0;
+    const pushEntry = sink !== void 0 ? (entry) => {
+      sink.pushTopLevel(entry);
+    } : (entry) => {
+      indexResult.elements.push(entry);
+    };
     const match = input.match;
     const comment = () => match(commentParser2);
     const whitespace = () => {
@@ -18625,8 +18631,9 @@ var StepParser = class extends StepHeaderParser {
         if (!charws(SEMICOLON)) {
           return syntaxError();
         }
-        onRecordIndexed?.(indexResult.elements.length, expressID, 0);
-        indexResult.elements.push({
+        onRecordIndexed?.(topLevelCount, expressID, 0);
+        ++topLevelCount;
+        pushEntry({
           address: startElement2,
           length: input.address - startElement2,
           typeID: 0,
@@ -18717,8 +18724,9 @@ var StepParser = class extends StepHeaderParser {
       if (!charws(SEMICOLON)) {
         return syntaxError();
       }
-      onRecordIndexed?.(indexResult.elements.length, expressID, foundItem);
-      indexResult.elements.push({
+      onRecordIndexed?.(topLevelCount, expressID, foundItem);
+      ++topLevelCount;
+      pushEntry({
         address: startElement,
         length: input.address - startElement,
         typeID: foundItem,
@@ -20814,6 +20822,31 @@ var StepModelBase = class {
     this.elementMemoization = true;
     this.nullOnErrors = true;
     this.bufferProvider_ = provider ?? new ResidentStepBufferProvider(buffer_);
+    if (!Array.isArray(elementIndex)) {
+      const columns = elementIndex;
+      const firstInline = columns.firstInlineElement;
+      const inlineCount = columns.count - firstInline;
+      const inlineElementTable2 = new Uint32Array(inlineCount << 1);
+      for (let where2 = 0; where2 < inlineCount; ++where2) {
+        inlineElementTable2[where2 << 1] = firstInline + where2;
+        inlineElementTable2[(where2 << 1) + 1] = columns.address[firstInline + where2];
+      }
+      this.inlineAddressMap_ = new InterpolationSearchTable32(inlineElementTable2, true);
+      const expressIdTable2 = new Uint32Array(firstInline << 1);
+      for (let where2 = 0; where2 < firstInline; ++where2) {
+        expressIdTable2[where2 << 1] = where2;
+        expressIdTable2[(where2 << 1) + 1] = columns.expressID[where2];
+      }
+      this.expressIDMap_ = new InterpolationSearchTable32(expressIdTable2, columns.expressIdsSorted);
+      this.address_ = columns.address;
+      this.length_ = columns.length;
+      this.typeID_ = columns.typeID;
+      this.expressID_ = columns.expressID;
+      this.count_ = columns.count;
+      this.firstInlineElement_ = firstInline;
+      this.complexEntries_ = columns.complexEntries;
+      return;
+    }
     const localElementIndex = elementIndex;
     let where = 0;
     const firstInlineElement = localElementIndex.length;
@@ -85931,6 +85964,68 @@ var StepTypeIndexer = class {
   constructor(typeCount) {
     this.elementCounter_ = new Int32Array(typeCount << 1);
   }
+  /**
+   * Create a type index from either index form — the parsed object array or
+   * the columnar index (M7).
+   *
+   * @param index The element index, object or columnar.
+   * @return {MultiIndexSet} The created multi-set index.
+   */
+  createFor(index) {
+    return Array.isArray(index) ? this.create(index) : this.createFromColumns(index);
+  }
+  /**
+   * Create a type index straight from the columnar index — the same
+   * membership `create` produces from the unfolded object array: every row's
+   * concrete type (top-level + inline; −1 rows skipped) plus the
+   * multi-mapping subtypes of retained complex entries at their parent's
+   * dense index.
+   *
+   * @param columns The columnar index.
+   * @return {MultiIndexSet} The created multi-set index.
+   */
+  createFromColumns(columns) {
+    for (let where = 0, end = this.elementCounter_.length; where < end; where += 2) {
+      initCountCompactedElements32State(this.elementCounter_, where);
+    }
+    const elementCounter = this.elementCounter_;
+    const prefixSum = new Uint32Array((this.elementCounter_.length >>> 1) + 1);
+    const typeIDs = columns.typeID;
+    const count = columns.count;
+    const walkRows = (addOne) => {
+      const complexIterator = columns.complexEntries?.entries();
+      let nextComplex = complexIterator?.next();
+      for (let denseIndex = 0; denseIndex < count; ++denseIndex) {
+        const typeID = typeIDs[denseIndex];
+        if (typeID >= 0) {
+          addOne(denseIndex, typeID);
+        }
+        if (nextComplex !== void 0 && !nextComplex.done && nextComplex.value[0] === denseIndex) {
+          for (const subElement of nextComplex.value[1].multiMapping ?? []) {
+            const subTypeID = subElement.typeID;
+            if (subTypeID !== void 0) {
+              addOne(denseIndex, subTypeID);
+            }
+          }
+          nextComplex = complexIterator.next();
+        }
+      }
+    };
+    walkRows((denseIndex, typeID) => {
+      prefixSum[typeID + 1] = addCompactedElementCount32State(denseIndex, elementCounter, typeID << 1);
+    });
+    for (let prefixSumIndex = 2, prefixSumEnd = prefixSum.length; prefixSumIndex < prefixSumEnd; ++prefixSumIndex) {
+      prefixSum[prefixSumIndex] += prefixSum[prefixSumIndex - 1];
+    }
+    for (let where = 0, end = this.elementCounter_.length; where < end; where += 2) {
+      initCountCompactedElements32State(this.elementCounter_, where);
+    }
+    const indexOutput = new Uint32Array(prefixSum[prefixSum.length - 1] << 1);
+    walkRows((denseIndex, typeID) => {
+      addCompactedElement32State(denseIndex, elementCounter, indexOutput, typeID << 1, prefixSum[typeID] << 1);
+    });
+    return new MultiIndexSet(prefixSum, indexOutput);
+  }
   /**
    * Create a type index from a set of parsed STEP elements.
    *
@@ -86623,12 +86718,136 @@ var IfcStepModel = class extends StepModelBase {
     this.materials = new IfcMaterialCache(this);
     this.voidMaterials = new IfcMaterialCache(this, true);
     this.elementTypeIDs = entity_types_ifc_gen_default;
-    this.typeIndex = indexerInstance.create(elementIndex);
+    this.typeIndex = indexerInstance.createFor(elementIndex);
+  }
+};
+
+// compiled/src/step/parsing/columnar_index.js
+var COLUMN_UNDEFINED_TYPE = -1;
+var SEGMENT_ROWS = 64 * 1024;
+var ColumnarIndexSink = class {
+  constructor() {
+    this.segments_ = [];
+    this.count_ = 0;
+    this.retained_ = /* @__PURE__ */ new Map();
+    this.expressIdsSorted_ = true;
+    this.previousExpressID_ = 0;
+  }
+  /**
+   * @return {number} Top-level records pushed so far.
+   */
+  get topLevelCount() {
+    return this.count_;
+  }
+  /**
+   * Encode one completed top-level record into the columns. The entry object
+   * is not kept unless it carries children (inline entities / multi-mapping).
+   *
+   * @param entry The completed top-level index entry.
+   */
+  pushTopLevel(entry) {
+    const localID = this.count_++;
+    const segmentIndex = Math.floor(localID / SEGMENT_ROWS);
+    const row = localID % SEGMENT_ROWS;
+    if (segmentIndex === this.segments_.length) {
+      this.segments_.push({
+        address: new Uint32Array(SEGMENT_ROWS),
+        length: new Uint32Array(SEGMENT_ROWS),
+        typeID: new Int32Array(SEGMENT_ROWS),
+        expressID: new Uint32Array(SEGMENT_ROWS)
+      });
+    }
+    const segment = this.segments_[segmentIndex];
+    segment.address[row] = entry.address;
+    segment.length[row] = entry.length;
+    segment.typeID[row] = entry.typeID === void 0 ? COLUMN_UNDEFINED_TYPE : entry.typeID;
+    segment.expressID[row] = entry.expressID;
+    if (entry.expressID < this.previousExpressID_) {
+      this.expressIdsSorted_ = false;
+    }
+    this.previousExpressID_ = entry.expressID;
+    if (entry.inlineEntities !== void 0 || entry.multiMapping !== void 0) {
+      this.retained_.set(localID, entry);
+    }
+  }
+  /**
+   * Rewind to empty (the streaming builder's grow-and-restart). The first
+   * segment is kept for reuse.
+   */
+  reset() {
+    this.segments_.length = Math.min(this.segments_.length, 1);
+    this.count_ = 0;
+    this.retained_.clear();
+    this.expressIdsSorted_ = true;
+    this.previousExpressID_ = 0;
+  }
+  /**
+   * Assemble the final columns: concatenate the top-level segments (one
+   * column at a time, bounding transient overhead to a single column's
+   * segments) and unfold retained inline entities into the inline range in
+   * the model's exact unfold order.
+   *
+   * @return {StepIndexColumns} The finished columnar index.
+   */
+  finalize() {
+    const topLevel = this.count_;
+    const unfolded = [];
+    for (const entry of this.retained_.values()) {
+      if (entry.inlineEntities !== void 0) {
+        unfolded.push(...entry.inlineEntities);
+      }
+    }
+    for (let where = 0; where < unfolded.length; ++where) {
+      const inlineEntities = unfolded[where].inlineEntities;
+      if (inlineEntities !== void 0) {
+        unfolded.push(...inlineEntities);
+      }
+    }
+    const count = topLevel + unfolded.length;
+    const address = concatColumn(this.segments_, "address", topLevel, count);
+    const length = concatColumn(this.segments_, "length", topLevel, count);
+    const typeID = new Int32Array(count);
+    for (let segment = 0; segment * SEGMENT_ROWS < topLevel; ++segment) {
+      const rows = Math.min(SEGMENT_ROWS, topLevel - segment * SEGMENT_ROWS);
+      typeID.set(this.segments_[segment].typeID.subarray(0, rows), segment * SEGMENT_ROWS);
+    }
+    const expressID = concatColumn(this.segments_, "expressID", topLevel, topLevel);
+    for (let where = 0; where < unfolded.length; ++where) {
+      const entry = unfolded[where];
+      const row = topLevel + where;
+      address[row] = entry.address;
+      length[row] = entry.length;
+      typeID[row] = entry.typeID === void 0 ? COLUMN_UNDEFINED_TYPE : entry.typeID;
+    }
+    let complexEntries;
+    for (const [localID, entry] of this.retained_) {
+      if (entry.multiMapping !== void 0) {
+        (complexEntries ??= /* @__PURE__ */ new Map()).set(localID, entry);
+      }
+    }
+    return {
+      address,
+      length,
+      typeID,
+      expressID,
+      count,
+      firstInlineElement: topLevel,
+      complexEntries,
+      expressIdsSorted: this.expressIdsSorted_
+    };
   }
 };
+function concatColumn(segments, column, rows, finalLength) {
+  const result = new Uint32Array(finalLength);
+  for (let segment = 0; segment * SEGMENT_ROWS < rows; ++segment) {
+    const valid = Math.min(SEGMENT_ROWS, rows - segment * SEGMENT_ROWS);
+    result.set(segments[segment][column].subarray(0, valid), segment * SEGMENT_ROWS);
+  }
+  return result;
+}
 
 // compiled/src/step/parsing/streaming_index_builder.js
-function buildIndexStreaming(source, parser210, pool3, onRecordIndexed) {
+function buildIndexStreaming(source, parser210, pool3, onRecordIndexed, sink) {
   const fileSize = source.byteLength;
   let windowBytes = Math.max(pool3, MIN_WINDOW);
   for (; ; ) {
@@ -86674,11 +86893,12 @@ function buildIndexStreaming(source, parser210, pool3, onRecordIndexed) {
       buffer.rebaseWindow(window2, 0, windowLen, windowStartFile);
       ++slides;
     };
-    const [index, result] = parser210.parseDataBlockStreamed(input, onRecordBoundary, onRecordIndexed);
+    const [index, result] = parser210.parseDataBlockStreamed(input, onRecordBoundary, onRecordIndexed, void 0, sink);
     const stoppedShort = result !== ParseResult.COMPLETE;
     const notAtEof = windowStartFile + windowLen < fileSize;
     if (stoppedShort && notAtEof) {
       windowBytes *= 2;
+      sink?.reset();
       continue;
     }
     const lastRecordLen = windowStartFile + input.cursor - prevBoundaryFile;
@@ -86694,6 +86914,11 @@ function buildIndexStreaming(source, parser210, pool3, onRecordIndexed) {
   }
 }
 var MIN_WINDOW = 4 * 1024;
+function buildColumnarIndexStreaming(source, parser210, pool3, onRecordIndexed) {
+  const sink = new ColumnarIndexSink();
+  const { header, result, stats } = buildIndexStreaming(source, parser210, pool3, onRecordIndexed, sink);
+  return { header, columns: sink.finalize(), result, stats };
+}
 
 // compiled/src/ifc/ifc_step_parser.js
 var DEFAULT_STREAM_POOL_BYTES = 1024 * 1024;
@@ -86759,9 +86984,9 @@ var IfcStepParser = class extends StepParser {
     if (store.byteLength !== source.byteLength) {
       throw new Error(`Streaming store byteLength ${store.byteLength} does not match source byteLength ${source.byteLength}`);
     }
-    const { elements, result } = buildIndexStreaming(source, this, opts?.pool ?? DEFAULT_STREAM_POOL_BYTES);
+    const { columns, result } = buildColumnarIndexStreaming(source, this, opts?.pool ?? DEFAULT_STREAM_POOL_BYTES);
     const provider = new WindowedStepBufferProvider(store, opts?.chunkBytes, opts?.maxResidentChunks);
-    return [result, new IfcStepModel(void 0, elements, provider)];
+    return [result, new IfcStepModel(void 0, columns, provider)];
   }
 };
 IfcStepParser.Instance = new IfcStepParser();