@itwin/core-common 5.0.0-dev.8 → 5.0.0-dev.82

package/lib/cjs/FeatureTable.js

@@ -7,9 +7,10 @@
  * @module Rendering
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.MultiModelPackedFeatureTable = exports.PackedFeatureModelTable = exports.PackedFeatureTable = exports.FeatureTable = exports.BatchType = exports.PackedFeature = exports.ModelFeature = exports.Feature = void 0;
+exports.FeatureTable = exports.BatchType = exports.PackedFeature = exports.ModelFeature = exports.Feature = void 0;
 const core_bentley_1 = require("@itwin/core-bentley");
 const GeometryParams_1 = require("./GeometryParams");
+const PackedFeatureTable_1 = require("./internal/PackedFeatureTable");
 /** Describes a discrete entity within a batched [RenderGraphic]($frontend) that can be
  * grouped with other such entities in a [[FeatureTable]].
  * Features roughly correlate to elements: a [Tile]($frontend)'s graphics combines geometry from every
@@ -20,6 +21,9 @@ const GeometryParams_1 = require("./GeometryParams");
  * @public
  */
 class Feature {
+    elementId;
+    subCategoryId;
+    geometryClass;
     constructor(elementId = core_bentley_1.Id64.invalid, subCategoryId = core_bentley_1.Id64.invalid, geometryClass = GeometryParams_1.GeometryClass.Primary) {
         this.elementId = elementId;
         this.subCategoryId = subCategoryId;
@@ -136,6 +140,8 @@ var BatchType;
  * @public
  */
 class FeatureTable extends core_bentley_1.IndexMap {
+    modelId;
+    type;
     /** Construct an empty FeatureTable. */
     constructor(maxFeatures, modelId = core_bentley_1.Id64.invalid, type = BatchType.Primary) {
         super((lhs, rhs) => lhs.compare(rhs), maxFeatures);
@@ -144,7 +150,7 @@ class FeatureTable extends core_bentley_1.IndexMap {
     }
     /** Returns the maximum number of [[Feature]]s this FeatureTable can contain. */
     get maxFeatures() { return this._maximumSize; }
-    /** @internal */
+    /** Returns true if this table contains at least one [[Feature]] with a valid element and/or subcategory Id. */
     get anyDefined() { return this.length > 1 || (1 === this.length && this._array[0].value.isDefined); }
     /** Returns true if this FeatureTable contains exactly one [[Feature]]. */
     get isUniform() { return 1 === this.length; }
@@ -161,7 +167,9 @@ class FeatureTable extends core_bentley_1.IndexMap {
                 return entry.value;
         return undefined;
     }
-    /** @internal */
+    /** Inserts the specified [[Feature]] at the specified index. This is really only useful when reconstructing a previously-create feature table
+     * for which you know the index assigned to each feature.
+     */
     insertWithIndex(feature, index) {
         const bound = this.lowerBound(feature);
         (0, core_bentley_1.assert)(!bound.equal);
@@ -169,336 +177,12 @@ class FeatureTable extends core_bentley_1.IndexMap {
         const entry = new core_bentley_1.IndexedValue(feature, index);
         this._array.splice(bound.index, 0, entry);
     }
-    /** @internal */
+    /** Access the underlying array containing the table's current contents. */
     getArray() { return this._array; }
     /** Convert this feature table to a representation that can be supplied to [RenderSystem.createBatch]($frontend). */
     pack() {
-        return PackedFeatureTable.pack(this);
+        return PackedFeatureTable_1.PackedFeatureTable.pack(this);
     }
 }
 exports.FeatureTable = FeatureTable;
-const scratchPackedFeature = PackedFeature.create();
-function populateAnimationNodeIds(table, computeNodeId, maxNodeId) {
-    (0, core_bentley_1.assert)(maxNodeId > 0);
-    let nodeIds;
-    const outputFeature = PackedFeature.createWithIndex();
-    for (const feature of table.iterable(outputFeature)) {
-        const nodeId = computeNodeId(feature);
-        (0, core_bentley_1.assert)(nodeId <= maxNodeId);
-        if (0 !== nodeId) {
-            if (!nodeIds) {
-                const size = table.numFeatures;
-                nodeIds = maxNodeId < 0x100 ? new Uint8Array(size) : (maxNodeId < 0x10000 ? new Uint16Array(size) : new Uint32Array(size));
-            }
-            nodeIds[feature.index] = nodeId;
-        }
-    }
-    return nodeIds;
-}
-/**
- * An immutable, packed representation of a [[FeatureTable]]. The features are packed into a single array of 32-bit integer values,
- * wherein each feature occupies 3 32-bit integers.
- * @internal
- */
-class PackedFeatureTable {
-    get byteLength() { return this.data.byteLength; }
-    /** Construct a PackedFeatureTable from the packed binary data.
-     * This is used internally when deserializing Tiles in iMdl format.
-     * @internal
-     */
-    constructor(data, modelId, numFeatures, type, animationNodeIds) {
-        this.data = data;
-        this.batchModelId = modelId;
-        this.batchModelIdPair = core_bentley_1.Id64.getUint32Pair(modelId);
-        this.numFeatures = numFeatures;
-        this.type = type;
-        this.animationNodeIds = animationNodeIds;
-        switch (this.numFeatures) {
-            case 0:
-                this.anyDefined = false;
-                break;
-            case 1:
-                this.anyDefined = ModelFeature.isDefined(this.getFeature(0, ModelFeature.create()));
-                break;
-            default:
-                this.anyDefined = true;
-                break;
-        }
-        (0, core_bentley_1.assert)(this.data.length >= this._subCategoriesOffset);
-        (0, core_bentley_1.assert)(undefined === this.animationNodeIds || this.animationNodeIds.length === this.numFeatures);
-    }
-    /** Create a packed feature table from a [[FeatureTable]]. */
-    static pack(featureTable) {
-        // We must determine how many subcategories we have ahead of time to compute the size of the Uint32Array, as
-        // the array cannot be resized after it is created.
-        // We are not too worried about this as FeatureTables created on the front-end will contain few if any features; those obtained from the
-        // back-end arrive within tiles already in the packed format.
-        const subcategories = new Map();
-        for (const iv of featureTable.getArray()) {
-            const found = subcategories.get(iv.value.subCategoryId.toString());
-            if (undefined === found)
-                subcategories.set(iv.value.subCategoryId, subcategories.size);
-        }
-        // We need 3 32-bit integers per feature, plus 2 32-bit integers per subcategory.
-        const subCategoriesOffset = 3 * featureTable.length;
-        const nUint32s = subCategoriesOffset + 2 * subcategories.size;
-        const uint32s = new Uint32Array(nUint32s);
-        for (const iv of featureTable.getArray()) {
-            const feature = iv.value;
-            const index = iv.index * 3;
-            let subCategoryIndex = subcategories.get(feature.subCategoryId);
-            (0, core_bentley_1.assert)(undefined !== subCategoryIndex); // we inserted it above...
-            subCategoryIndex |= (feature.geometryClass << 24);
-            uint32s[index + 0] = core_bentley_1.Id64.getLowerUint32(feature.elementId);
-            uint32s[index + 1] = core_bentley_1.Id64.getUpperUint32(feature.elementId);
-            uint32s[index + 2] = subCategoryIndex;
-        }
-        subcategories.forEach((index, id, _map) => {
-            const index32 = subCategoriesOffset + 2 * index;
-            uint32s[index32 + 0] = core_bentley_1.Id64.getLowerUint32(id);
-            uint32s[index32 + 1] = core_bentley_1.Id64.getUpperUint32(id);
-        });
-        return new PackedFeatureTable(uint32s, featureTable.modelId, featureTable.length, featureTable.type);
-    }
-    /** Retrieve the Feature associated with the specified index. */
-    getFeature(featureIndex, result) {
-        const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);
-        return ModelFeature.unpack(packed, result, this.batchModelId);
-    }
-    /** Returns the Feature associated with the specified index, or undefined if the index is out of range. */
-    findFeature(featureIndex, result) {
-        return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;
-    }
-    /** @internal */
-    getElementIdPair(featureIndex, out) {
-        out = out ?? { lower: 0, upper: 0 };
-        (0, core_bentley_1.assert)(featureIndex < this.numFeatures);
-        const offset = 3 * featureIndex;
-        out.lower = this.data[offset];
-        out.upper = this.data[offset + 1];
-        return out;
-    }
-    /** @internal */
-    getSubCategoryIdPair(featureIndex) {
-        const index = 3 * featureIndex;
-        let subCatIndex = this.data[index + 2];
-        subCatIndex = (subCatIndex & 0x00ffffff) >>> 0;
-        subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;
-        return { lower: this.data[subCatIndex], upper: this.data[subCatIndex + 1] };
-    }
-    /** @internal */
-    getAnimationNodeId(featureIndex) {
-        return undefined !== this.animationNodeIds && featureIndex < this.numFeatures ? this.animationNodeIds[featureIndex] : 0;
-    }
-    /** @internal */
-    getPackedFeature(featureIndex, result) {
-        (0, core_bentley_1.assert)(featureIndex < this.numFeatures);
-        const index32 = 3 * featureIndex;
-        result.elementId.lower = this.data[index32];
-        result.elementId.upper = this.data[index32 + 1];
-        const subCatIndexAndClass = this.data[index32 + 2];
-        result.geometryClass = (subCatIndexAndClass >>> 24) & 0xff;
-        let subCatIndex = (subCatIndexAndClass & 0x00ffffff) >>> 0;
-        subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;
-        result.subCategoryId.lower = this.data[subCatIndex];
-        result.subCategoryId.upper = this.data[subCatIndex + 1];
-        result.animationNodeId = this.getAnimationNodeId(featureIndex);
-        result.modelId.lower = this.batchModelIdPair.lower;
-        result.modelId.upper = this.batchModelIdPair.upper;
-        return result;
-    }
-    getModelIdPair(_featureIndex, out) {
-        out.lower = this.batchModelIdPair.lower;
-        out.upper = this.batchModelIdPair.upper;
-        return out;
-    }
-    /** Returns the element ID of the Feature associated with the specified index, or undefined if the index is out of range. */
-    findElementId(featureIndex) {
-        if (featureIndex >= this.numFeatures)
-            return undefined;
-        else
-            return this.readId(3 * featureIndex);
-    }
-    /** Return true if this table contains exactly 1 feature. */
-    get isUniform() { return 1 === this.numFeatures; }
-    /** If this table contains exactly 1 feature, return it. */
-    getUniform(result) {
-        return this.isUniform ? this.getFeature(0, result) : undefined;
-    }
-    get isVolumeClassifier() { return BatchType.VolumeClassifier === this.type; }
-    get isPlanarClassifier() { return BatchType.VolumeClassifier === this.type; }
-    get isClassifier() { return this.isVolumeClassifier || this.isPlanarClassifier; }
-    /** Unpack the features into a [[FeatureTable]]. */
-    unpack() {
-        const table = new FeatureTable(this.numFeatures, this.batchModelId);
-        const feature = ModelFeature.create();
-        for (let i = 0; i < this.numFeatures; i++) {
-            this.getFeature(i, feature);
-            table.insertWithIndex(new Feature(feature.elementId, feature.subCategoryId, feature.geometryClass), i);
-        }
-        return table;
-    }
-    populateAnimationNodeIds(computeNodeId, maxNodeId) {
-        (0, core_bentley_1.assert)(undefined === this.animationNodeIds);
-        this.animationNodeIds = populateAnimationNodeIds(this, computeNodeId, maxNodeId);
-    }
-    *iterator(output) {
-        for (let i = 0; i < this.numFeatures; i++) {
-            this.getPackedFeature(i, output);
-            output.index = i;
-            yield output;
-        }
-    }
-    iterable(output) {
-        return {
-            [Symbol.iterator]: () => this.iterator(output),
-        };
-    }
-    get _subCategoriesOffset() { return this.numFeatures * 3; }
-    readId(offset32) {
-        return core_bentley_1.Id64.fromUint32Pair(this.data[offset32], this.data[offset32 + 1]);
-    }
-}
-exports.PackedFeatureTable = PackedFeatureTable;
-const scratchPackedFeatureModelEntry = { lastFeatureIndex: -1, idLower: -1, idUpper: -1 };
-/** A table of model Ids associated with a [[MultiModelPackedFeatureTable]].
- * The feature indices in the packed feature table are grouped together by model, such that the first N features belong to model 1, the next M features to model 2, and so on.
- * The model table itself consists of one entry per model, where each entry looks like:
- *  indexOfLastFeatureInModel: u32
- *  modelId: u64
- * The modelId associated with a feature can therefore be derived by finding the entry in the model table with the highest indexOfLastFeatureInModel no greater than the feature index.
- * This lookup can be optimized using binary search.
- * Moreover, while iterating the feature table in sequence, the model table can be iterated in parallel so that no per-feature lookup of model Id is required.
- * @internal
- */
-class PackedFeatureModelTable {
-    constructor(data) {
-        this._data = data;
-        (0, core_bentley_1.assert)(this._data.length % 3 === 0);
-    }
-    /** The number of models in the table. */
-    get length() {
-        return this._data.length / 3;
-    }
-    get byteLength() {
-        return this._data.byteLength;
-    }
-    getLastFeatureIndex(modelIndex) {
-        return this._data[modelIndex * 3];
-    }
-    getEntry(modelIndex, result) {
-        if (modelIndex >= this.length) {
-            result.idLower = result.idUpper = 0;
-            result.lastFeatureIndex = Number.MAX_SAFE_INTEGER;
-            return result;
-        }
-        const index = modelIndex * 3;
-        result.lastFeatureIndex = this._data[index + 0];
-        result.idLower = this._data[index + 1];
-        result.idUpper = this._data[index + 2];
-        return result;
-    }
-    /** Get the Id of the model associated with the specified feature, or an invalid Id if the feature is not associated with any model. */
-    getModelIdPair(featureIndex, result) {
-        if (!result)
-            result = { lower: 0, upper: 0 };
-        else
-            result.lower = result.upper = 0;
-        let first = 0;
-        const last = this.length;
-        let count = last;
-        while (count > 0) {
-            const step = Math.floor(count / 2);
-            const mid = first + step;
-            const lastFeatureIndex = this.getLastFeatureIndex(mid);
-            if (featureIndex > lastFeatureIndex) {
-                first = mid + 1;
-                count -= step + 1;
-            }
-            else {
-                count = step;
-            }
-        }
-        if (first < last) {
-            result.lower = this._data[first * 3 + 1];
-            result.upper = this._data[first * 3 + 2];
-        }
-        return result;
-    }
-}
-exports.PackedFeatureModelTable = PackedFeatureModelTable;
-/** A PackedFeatureTable with a PackedFeatureModelTable appended to it, capable of storing features belonging to more than one model.
- * @internal
- */
-class MultiModelPackedFeatureTable {
-    constructor(features, models) {
-        this._features = features;
-        this._models = models;
-    }
-    static create(data, batchModelId, numFeatures, type, numSubCategories) {
-        const modelTableOffset = 3 * numFeatures + 2 * numSubCategories;
-        const featureData = data.subarray(0, modelTableOffset);
-        const features = new PackedFeatureTable(featureData, batchModelId, numFeatures, type);
-        const modelData = data.subarray(modelTableOffset);
-        const models = new PackedFeatureModelTable(modelData);
-        return new MultiModelPackedFeatureTable(features, models);
-    }
-    get batchModelId() { return this._features.batchModelId; }
-    get batchModelIdPair() { return this._features.batchModelIdPair; }
-    get numFeatures() { return this._features.numFeatures; }
-    get type() { return this._features.type; }
-    get animationNodeIds() { return this._features.animationNodeIds; }
-    set animationNodeIds(ids) { this._features.animationNodeIds = ids; }
-    get byteLength() {
-        return this._features.byteLength + this._models.byteLength;
-    }
-    getPackedFeature(featureIndex, result) {
-        this._features.getPackedFeature(featureIndex, result);
-        this._models.getModelIdPair(featureIndex, result.modelId);
-        return result;
-    }
-    getFeature(featureIndex, result) {
-        const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);
-        return ModelFeature.unpack(packed, result);
-    }
-    findFeature(featureIndex, result) {
-        return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;
-    }
-    getElementIdPair(featureIndex, out) {
-        return this._features.getElementIdPair(featureIndex, out);
-    }
-    getModelIdPair(featureIndex, out) {
-        this._models.getModelIdPair(featureIndex, out);
-        return out;
-    }
-    findElementId(featureIndex) {
-        return this._features.findElementId(featureIndex);
-    }
-    *iterator(output) {
-        // Rather than perform a binary search on the model table to find each feature's model Id, traverse the model table in parallel with the feature table.
-        let modelIndex = 0;
-        const modelEntry = this._models.getEntry(modelIndex, scratchPackedFeatureModelEntry);
-        for (let featureIndex = 0; featureIndex < this.numFeatures; featureIndex++) {
-            if (featureIndex > modelEntry.lastFeatureIndex)
-                this._models.getEntry(++modelIndex, modelEntry);
-            this._features.getPackedFeature(featureIndex, output);
-            output.modelId.lower = modelEntry.idLower;
-            output.modelId.upper = modelEntry.idUpper;
-            output.index = featureIndex;
-            yield output;
-        }
-    }
-    iterable(output) {
-        return {
-            [Symbol.iterator]: () => this.iterator(output),
-        };
-    }
-    getAnimationNodeId(featureIndex) {
-        return this._features.getAnimationNodeId(featureIndex);
-    }
-    populateAnimationNodeIds(computeNodeId, maxNodeId) {
-        this._features.animationNodeIds = populateAnimationNodeIds(this, computeNodeId, maxNodeId);
-    }
-}
-exports.MultiModelPackedFeatureTable = MultiModelPackedFeatureTable;
 //# sourceMappingURL=FeatureTable.js.map

package/lib/cjs/FeatureTable.js.map

@@ -1 +1 @@
-{"version":3,"file":"FeatureTable.js","sourceRoot":"","sources":["../../src/FeatureTable.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAE6B;AAC7B,qDAAiD;AAEjD;;;;;;;;GAQG;AACH,MAAa,OAAO;IAKlB,YAAmB,YAAwB,mBAAI,CAAC,OAAO,EAAE,gBAA4B,mBAAI,CAAC,OAAO,EAAE,gBAA+B,8BAAa,CAAC,OAAO;QACrJ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,IAAW,SAAS,KAAc,OAAO,CAAC,mBAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,CAAC,aAAa,KAAK,8BAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAClK,IAAW,WAAW,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAE7D,0EAA0E;IACnE,MAAM,CAAC,KAAc,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5E;;;OAGG;IACI,OAAO,CAAC,GAAY;QACzB,IAAI,IAAI,KAAK,GAAG;YACd,OAAO,CAAC,CAAC;QAEX,IAAI,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACd,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAnCD,0BAmCC;AAYD,cAAc;AACd,IAAiB,YAAY,CA0B5B;AA1BD,WAAiB,YAAY;IAC3B;;OAEG;IACH,SAAgB,MAAM;QACpB,OAAO;YACL,OAAO,EAAE,mBAAI,CAAC,OAAO;YACrB,SAAS,EAAE,mBAAI,CAAC,OAAO;YACvB,aAAa,EAAE,mBAAI,CAAC,OAAO;YAC3B,aAAa,EAAE,8BAAa,CAAC,OAAO;SACrC,CAAC;IACJ,CAAC;IAPe,mBAAM,SAOrB,CAAA;IAED,4HAA4H;IAC5H,SAAgB,SAAS,CAAC,OAAqB;QAC7C,OAAO,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,aAAa,KAAK,8BAAa,CAAC,OAAO,CAAC;IAC7K,CAAC;IAFe,sBAAS,YAExB,CAAA;IAED,aAAa;IACb,SAAgB,MAAM,CAAC,MAAqB,EAAE,MAAoB,EAAE,eAA4B;QAC9F,MAAM,CAAC,OAAO,GAAG,eAAe,IAAI,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9E,MAAM,CAAC,SAAS,GAAG,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC/D,MAAM,CAAC,aAAa,GAAG,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IANe,mBAAM,SAMrB,CAAA;AACH,CAAC,EA1BgB,YAAY,4BAAZ,YAAY,QA0B5B;AAqBD,cAAc;AACd,IAAiB,aAAa,CAuB7B;AAvBD,WAAiB,aAAa;IAC5B;;OAEG;IACH,SAAgB,MAAM;QACpB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,OAAO;YACL,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE;YACpB,SAAS,EAAE,EAAE,GAAG,IAAI,EAAE;YACtB,aAAa,EAAE,EAAE,GAAG,IAAI,EAAE;YAC1B,aAAa,EAAE,8BAAa,CAAC,OAAO;YACpC,eAAe,EAAE,CAAC;SACnB,CAAC;IACJ,CAAC;IATe,oBAAM,SASrB,CAAA;IAED;;OAEG;IACH,SAAgB,eAAe;QAC7B,MAAM,MAAM,GAAG,MAAM,EAA4B,CAAC;QAClD,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAJe,6BAAe,kBAI9B,CAAA;AACH,CAAC,EAvBgB,aAAa,6BAAb,aAAa,QAuB7B;AAED;;;;;GAKG;AACH,IAAY,SAeX;AAfD,WAAY,SAAS;IACnB,4EAA4E;IAC5E,+CAAO,CAAA;IACP;;;;OAIG;IACH,iEAAgB,CAAA;IAChB;;;;OAIG;IACH,iEAAgB,CAAA;AAClB,CAAC,EAfW,SAAS,yBAAT,SAAS,QAepB;AAED;;;;;;;GAOG;AACH,MAAa,YAAa,SAAQ,uBAAiB;IAIjD,uCAAuC;IACvC,YAAmB,WAAmB,EAAE,UAAsB,mBAAI,CAAC,OAAO,EAAE,OAAkB,SAAS,CAAC,OAAO;QAC7G,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gFAAgF;IAChF,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,gBAAgB;IAChB,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACrH,0EAA0E;IAC1E,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,gHAAgH;IAChH,IAAW,OAAO,KAA0B,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1G,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7F,0GAA0G;IACnG,WAAW,CAAC,KAAa;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK;gBACvB,OAAO,KAAK,CAAC,KAAK,CAAC;QAEvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,gBAAgB;IACT,eAAe,CAAC,OAAgB,EAAE,KAAa;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvC,IAAA,qBAAM,EAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrB,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,2BAAY,CAAU,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,gBAAgB;IACT,QAAQ,KAAmC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEvE,oHAAoH;IAC7G,IAAI;QACT,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;CACF;AAjDD,oCAiDC;AA6DD,MAAM,oBAAoB,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;AAEpD,SAAS,wBAAwB,CAAC,KAAyB,EAAE,aAA4B,EAAE,SAAiB;IAC1G,IAAA,qBAAM,EAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAEtB,IAAI,OAAO,CAAC;IACZ,MAAM,aAAa,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC;IACtD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACtC,IAAA,qBAAM,EAAC,MAAM,IAAI,SAAS,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACjB,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;gBAC/B,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7H,CAAC;YAED,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAa,kBAAkB;IAS7B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAEhE;;;OAGG;IACH,YAAmB,IAAiB,EAAE,OAAmB,EAAE,WAAmB,EAAE,IAAe,EAAE,gBAA4B;QAC3H,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC;QAC5B,IAAI,CAAC,gBAAgB,GAAG,mBAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;QAEzC,QAAQ,IAAI,CAAC,WAAW,EAAE,CAAC;YACzB,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;gBACxB,MAAM;YACR,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACpF,MAAM;YACR;gBACE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,MAAM;QACV,CAAC;QAED,IAAA,qBAAM,EAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACtD,IAAA,qBAAM,EAAC,SAAS,KAAK,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC;IACnG,CAAC;IAED,6DAA6D;IACtD,MAAM,CAAC,IAAI,CAAC,YAA0B;QAC3C,4GAA4G;QAC5G,mDAAmD;QACnD,wIAAwI;QACxI,6DAA6D;QAC7D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,KAAK,KAAK;gBACrB,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;QAClE,CAAC;QAED,iFAAiF;QACjF,MAAM,mBAAmB,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,mBAAmB,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE1C,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YACzB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;YAE3B,IAAI,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAE,CAAC;YACjE,IAAA,qBAAM,EAAC,SAAS,KAAK,gBAAgB,CAAC,CAAC,CAAC,0BAA0B;YAClE,gBAAgB,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;YAElD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,mBAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,mBAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC;QACxC,CAAC;QAED,aAAa,CAAC,OAAO,CAAC,CAAC,KAAa,EAAE,EAAU,EAAE,IAAI,EAAE,EAAE;YACxD,MAAM,OAAO,GAAG,mBAAmB,GAAG,CAAC,GAAG,KAAK,CAAC;YAChD,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,mBAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YAC/C,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,mBAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,kBAAkB,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;IACvG,CAAC;IAED,gEAAgE;IACzD,UAAU,CAAC,YAAoB,EAAE,MAAoB;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC;QACzE,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAChE,CAAC;IAED,0GAA0G;IACnG,WAAW,CAAC,YAAoB,EAAE,MAAoB;QAC3D,OAAO,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB,EAAE,GAAqB;QACjE,GAAG,GAAG,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,IAAA,qBAAM,EAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC;QAChC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,gBAAgB;IACT,oBAAoB,CAAC,YAAoB;QAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC;QAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvC,WAAW,GAAG,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC/C,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;IAC9E,CAAC;IAED,gBAAgB;IACT,kBAAkB,CAAC,YAAoB;QAC5C,OAAO,SAAS,KAAK,IAAI,CAAC,gBAAgB,IAAI,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1H,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB,EAAE,MAAqB;QACjE,IAAA,qBAAM,EAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC;QACjC,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QAEhD,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,aAAa,GAAG,CAAC,mBAAmB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QAE3D,IAAI,WAAW,GAAG,CAAC,mBAAmB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3D,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpD,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAExD,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;QAC/D,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACnD,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAEnD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,cAAc,CAAC,aAAqB,EAAE,GAAoB;QAC/D,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACxC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACxC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,4HAA4H;IACrH,aAAa,CAAC,YAAoB;QACvC,IAAI,YAAY,IAAI,IAAI,CAAC,WAAW;YAClC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAElE,2DAA2D;IACpD,UAAU,CAAC,MAAoB;QACpC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,CAAC;IAED,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,YAAY,KAAc,OAAO,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAEjG,mDAAmD;IAC5C,MAAM;QACX,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC5B,KAAK,CAAC,eAAe,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QACzG,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,wBAAwB,CAAC,aAA4B,EAAE,SAAiB;QAC7E,IAAA,qBAAM,EAAC,SAAS,KAAK,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC5C,IAAI,CAAC,gBAAgB,GAAG,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;IACnF,CAAC;IAEM,CAAE,QAAQ,CAAC,MAA8B;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;YACjB,MAAM,MAAM,CAAC;QACf,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,MAA8B;QAC5C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;SAC/C,CAAC;IACJ,CAAC;IAED,IAAY,oBAAoB,KAAa,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC;IAEnE,MAAM,CAAC,QAAgB;QAC7B,OAAO,mBAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;CACF;AAvMD,gDAuMC;AAQD,MAAM,8BAA8B,GAAG,EAAE,gBAAgB,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;AAE1F;;;;;;;;;GASG;AACH,MAAa,uBAAuB;IAGlC,YAAmB,IAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAA,qBAAM,EAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/B,CAAC;IAEO,mBAAmB,CAAC,UAAkB;QAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAEM,QAAQ,CAAC,UAAkB,EAAG,MAA+B;QAClE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;YAClD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,uIAAuI;IAChI,cAAc,CAAC,YAAoB,EAAE,MAAwB;QAClE,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;;YAEhC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QAElC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC;YACzB,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,YAAY,GAAG,gBAAgB,EAAE,CAAC;gBACpC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;gBAChB,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAhED,0DAgEC;AAED;;GAEG;AACH,MAAa,4BAA4B;IAIvC,YAAmB,QAA4B,EAAE,MAA+B;QAC9E,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,IAAiB,EAAE,YAAwB,EAAE,WAAmB,EAAE,IAAe,EAAE,gBAAwB;QAC9H,MAAM,gBAAgB,GAAG,CAAC,GAAG,WAAW,GAAG,CAAC,GAAG,gBAAgB,CAAC;QAChE,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,kBAAkB,CAAC,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,SAAS,CAAC,CAAC;QAEtD,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC;IACjE,IAAW,gBAAgB,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACzE,IAAW,WAAW,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/D,IAAW,IAAI,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACjD,IAAW,gBAAgB,KAA4B,OAAO,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAChG,IAAW,gBAAgB,CAAC,GAA0B,IAAI,IAAI,CAAC,SAAS,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC;IAElG,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IAC7D,CAAC;IAEM,gBAAgB,CAAC,YAAoB,EAAE,MAAqB;QACjE,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1D,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,UAAU,CAAC,YAAoB,EAAE,MAAoB;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC;QACzE,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,CAAC;IAEM,WAAW,CAAC,YAAoB,EAAE,MAAoB;QAC3D,OAAO,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IAEM,gBAAgB,CAAC,YAAoB,EAAE,GAAoB;QAChE,OAAO,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;IAC5D,CAAC;IAEM,cAAc,CAAC,YAAoB,EAAE,GAAoB;QAC9D,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAC/C,OAAO,GAAG,CAAC;IACb,CAAC;IAEM,aAAa,CAAC,YAAoB;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IACpD,CAAC;IAEM,CAAE,QAAQ,CAAC,MAA8B;QAC9C,uJAAuJ;QACvJ,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,8BAA8B,CAAC,CAAC;QAErF,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,IAAI,CAAC,WAAW,EAAE,YAAY,EAAE,EAAE,CAAC;YAC3E,IAAI,YAAY,GAAG,UAAU,CAAC,gBAAgB;gBAC5C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YAElD,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;YACtD,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;YAC1C,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;YAC1C,MAAM,CAAC,KAAK,GAAG,YAAY,CAAC;YAC5B,MAAM,MAAM,CAAC;QACf,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,MAA8B;QAC5C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;SAC/C,CAAC;IACJ,CAAC;IAEM,kBAAkB,CAAC,YAAoB;QAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACzD,CAAC;IAEM,wBAAwB,CAAC,aAA4B,EAAE,SAAiB;QAC7E,IAAI,CAAC,SAAS,CAAC,gBAAgB,GAAG,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7F,CAAC;CACF;AAzFD,oEAyFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Rendering\n */\n\nimport {\n  assert, compareNumbers, compareStrings, Id64, Id64String, IndexedValue, IndexMap, UintArray,\n} from \"@itwin/core-bentley\";\nimport { GeometryClass } from \"./GeometryParams\";\n\n/** Describes a discrete entity within a batched [RenderGraphic]($frontend) that can be\n * grouped with other such entities in a [[FeatureTable]].\n * Features roughly correlate to elements: a [Tile]($frontend)'s graphics combines geometry from every\n * [GeometricElement]($backend) that intersects the tile's volume, so each element produces at least one feature.\n * However, an element's geometry stream can contain geometry belonging to multiple different combinations of [SubCategory]($backend) and\n * [[GeometryClass]], so an individual element may produce more than one feature.\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\n * @public\n */\nexport class Feature {\n  public readonly elementId: Id64String;\n  public readonly subCategoryId: Id64String;\n  public readonly geometryClass: GeometryClass;\n\n  public constructor(elementId: Id64String = Id64.invalid, subCategoryId: Id64String = Id64.invalid, geometryClass: GeometryClass = GeometryClass.Primary) {\n    this.elementId = elementId;\n    this.subCategoryId = subCategoryId;\n    this.geometryClass = geometryClass;\n  }\n\n  public get isDefined(): boolean { return !Id64.isInvalid(this.elementId) || !Id64.isInvalid(this.subCategoryId) || this.geometryClass !== GeometryClass.Primary; }\n  public get isUndefined(): boolean { return !this.isDefined; }\n\n  /** Returns true if this feature is equivalent to the supplied feature. */\n  public equals(other: Feature): boolean { return 0 === this.compare(other); }\n\n  /** Performs ordinal comparison of this feature with another.\n   * @param rhs The feature to compare with.\n   * @returns zero if the features are equivalent, a negative value if this feature compares as \"less than\" `rhs`, or a positive value if this feature compares \"greater than\" `rhs`.\n   */\n  public compare(rhs: Feature): number {\n    if (this === rhs)\n      return 0;\n\n    let cmp = compareNumbers(this.geometryClass, rhs.geometryClass);\n    if (0 === cmp) {\n      cmp = compareStrings(this.elementId, rhs.elementId);\n      if (0 === cmp) {\n        cmp = compareStrings(this.subCategoryId, rhs.subCategoryId);\n      }\n    }\n\n    return cmp;\n  }\n}\n\n/** A [[Feature]] with a modelId identifying the model containing the feature, obtained from a [[RenderFeatureTable]].\n * @public\n */\nexport interface ModelFeature {\n  modelId: Id64String;\n  elementId: Id64String;\n  subCategoryId: Id64String;\n  geometryClass: GeometryClass;\n}\n\n/** @public */\nexport namespace ModelFeature {\n  /** Create a ModelFeature of [[GeometryClass.Primary]] with all invalid Ids.\n   * This is primarily useful for creating a `result` argument for [[RenderFeatureTable.findFeature]] and [[RenderFeatureTable.getFeature]].\n   */\n  export function create(): ModelFeature {\n    return {\n      modelId: Id64.invalid,\n      elementId: Id64.invalid,\n      subCategoryId: Id64.invalid,\n      geometryClass: GeometryClass.Primary,\n    };\n  }\n\n  /** Returns `true` if any of `feature`'s properties differ from the defaults (invalid Ids and [[GeometryClass.Primary]]). */\n  export function isDefined(feature: ModelFeature): boolean {\n    return !Id64.isInvalid(feature.modelId) || !Id64.isInvalid(feature.elementId) || !Id64.isInvalid(feature.subCategoryId) || feature.geometryClass !== GeometryClass.Primary;\n  }\n\n  /** @alpha */\n  export function unpack(packed: PackedFeature, result: ModelFeature, unpackedModelId?: Id64String): ModelFeature {\n    result.modelId = unpackedModelId ?? Id64.fromUint32PairObject(packed.modelId);\n    result.elementId = Id64.fromUint32PairObject(packed.elementId);\n    result.subCategoryId = Id64.fromUint32PairObject(packed.subCategoryId);\n    result.geometryClass = packed.geometryClass;\n    return result;\n  }\n}\n\n/** Represents a [[Feature]] within a [[RenderFeatureTable]]. This representation is optimized for use on the GPU.\n * @public\n */\nexport interface PackedFeature {\n  modelId: Id64.Uint32Pair;\n  elementId: Id64.Uint32Pair;\n  subCategoryId: Id64.Uint32Pair;\n  geometryClass: GeometryClass;\n  /** @alpha */\n  animationNodeId: number;\n}\n\n/** Represents a [[PackedFeature]] obtained from a [[RenderFeatureTable]], including the index of that feature within the table.\n * @public\n */\nexport interface PackedFeatureWithIndex extends PackedFeature {\n  index: number;\n}\n\n/** @public */\nexport namespace PackedFeature {\n  /** Create a PackedFeature of [[GeometryClass.Primary]] with all invalid Ids.\n   * This is primarily useful for creating a `result` argument for [[RenderFeatureTable.getPackedFeature]].\n   */\n  export function create(): PackedFeature {\n    const pair = { upper: 0, lower: 0 };\n    return {\n      modelId: { ...pair },\n      elementId: { ...pair },\n      subCategoryId: { ...pair },\n      geometryClass: GeometryClass.Primary,\n      animationNodeId: 0,\n    };\n  }\n\n  /** Create a PackedFeatureWithIndex of [[GeometryClass.Primary]] with all invalid Ids and an index of zero.\n   * This is primarily useful for creating a reusable `output` argument for [[RenderFeatureTable.iterable]].\n   */\n  export function createWithIndex(): PackedFeatureWithIndex {\n    const result = create() as PackedFeatureWithIndex;\n    result.index = 0;\n    return result;\n  }\n}\n\n/** Describes the type of a 'batch' of graphics representing multiple [[Feature]]s.\n * The most commonly-encountered batches are Tiles, which can be of either Primary or\n * Classifier type.\n * @public\n * @extensions\n */\nexport enum BatchType {\n  /** This batch contains graphics derived from a model's visible geometry. */\n  Primary,\n  /**\n   * This batch contains color volumes which are used to classify a model's visible geometry.\n   * The graphics themselves are not rendered to the screen; instead they are rendered to the stencil buffer\n   * to resymbolize the primary geometry.\n   */\n  VolumeClassifier,\n  /**\n   * This batch contains planar graphics which are used to classify a model's visible geometry.\n   * The graphics themselves are not rendered to the screen; instead they are rendered to a texture buffer\n   * to resymbolize the primary geometry.\n   */\n  PlanarClassifier,\n}\n\n/** Defines a look-up table for [[Feature]]s within a batched [RenderGraphic]($frontend). Consecutive 32-bit\n * indices are assigned to each unique Feature. Primitives within the RenderGraphic can\n * use per-vertex indices to specify the distribution of Features within the primitive. The appearance of individual\n * features can be customized using [[FeatureOverrides]]. Typically a [Tile]($frontend) will contain a feature table\n * identifying the elements whose geometry appears within that tile.\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\n * @public\n */\nexport class FeatureTable extends IndexMap<Feature> {\n  public readonly modelId: Id64String;\n  public readonly type: BatchType;\n\n  /** Construct an empty FeatureTable. */\n  public constructor(maxFeatures: number, modelId: Id64String = Id64.invalid, type: BatchType = BatchType.Primary) {\n    super((lhs, rhs) => lhs.compare(rhs), maxFeatures);\n    this.modelId = modelId;\n    this.type = type;\n  }\n\n  /** Returns the maximum number of [[Feature]]s this FeatureTable can contain. */\n  public get maxFeatures(): number { return this._maximumSize; }\n  /** @internal */\n  public get anyDefined(): boolean { return this.length > 1 || (1 === this.length && this._array[0].value.isDefined); }\n  /** Returns true if this FeatureTable contains exactly one [[Feature]]. */\n  public get isUniform(): boolean { return 1 === this.length; }\n  /** If this FeatureTable contains exactly one [[Feature]], returns that Feature; otherwise returns undefined. */\n  public get uniform(): Feature | undefined { return 1 === this.length ? this._array[0].value : undefined; }\n  /** Returns true if this FeatureTable is associated with [[BatchType.VolumeClassifier]] geometry. */\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\n  /** Returns true if this FeatureTable is associated with [[BatchType.PlanarClassifier]] geometry. */\n  public get isPlanarClassifier(): boolean { return BatchType.PlanarClassifier === this.type; }\n\n  /** Returns the Feature corresponding to the specified index, or undefined if the index is not present. */\n  public findFeature(index: number): Feature | undefined {\n    for (const entry of this._array)\n      if (entry.index === index)\n        return entry.value;\n\n    return undefined;\n  }\n\n  /** @internal */\n  public insertWithIndex(feature: Feature, index: number): void {\n    const bound = this.lowerBound(feature);\n    assert(!bound.equal);\n    assert(!this.isFull);\n    const entry = new IndexedValue<Feature>(feature, index);\n    this._array.splice(bound.index, 0, entry);\n  }\n\n  /** @internal */\n  public getArray(): Array<IndexedValue<Feature>> { return this._array; }\n\n  /** Convert this feature table to a representation that can be supplied to [RenderSystem.createBatch]($frontend). */\n  public pack(): RenderFeatureTable {\n    return PackedFeatureTable.pack(this);\n  }\n}\n\n/** @alpha */\nexport type ComputeNodeId = (feature: PackedFeatureWithIndex) => number;\n\n/** Representation of a [[FeatureTable]] suitable for use with [RenderSystem.createBatch]($frontend).\n * The [[Feature]]s are represented as [[PackedFeature]]s. The feature table may contain features from multiple [Model]($backend)s.\n * @see [[FeatureTable.pack]] to produce a RenderFeatureTable.\n * @public\n */\nexport interface RenderFeatureTable {\n  /** The \"model Id\" of the tile tree containing the tile from which this feature table originated.\n   * It may be a transient Id if, for example, the tile tree represents a reality model or represents the geometry of multiple\n   * persistent models batched together.\n   */\n  readonly batchModelId: Id64String;\n  /** A split representation of [[batchModelId]], to avoid having to constantly having to parse the string. */\n  readonly batchModelIdPair: Id64.Uint32Pair;\n  /** The number of features in the table; equivalently, one more than the largest feature index. */\n  readonly numFeatures: number;\n  /** The number of bytes consumed by the feature table, strictly for diagnostic purposes. */\n  readonly byteLength: number;\n  readonly type: BatchType;\n  /** @alpha */\n  animationNodeIds?: UintArray;\n\n  /** Get the feature at the specified index. The caller is responsible for validating featureIndex less than numFeatures. */\n  getFeature(featureIndex: number, result: ModelFeature): ModelFeature;\n\n  /** Find the feature at the specified index. Returns undefined if featureIndex >= [[numFeatures]]. */\n  findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined;\n\n  /** Find the Id of the element associated with the feature at the specified index. */\n  findElementId(featureIndex: number): Id64String | undefined;\n\n  /** Get the Id of the element associated with the feature at the specified index as a pair of 32-bit integers.\n   * The caller is responsible for validating that `featureIndex` is less than [[numFeatures]].\n   */\n  getElementIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair;\n\n  /** Get the feature at the specified index. The caller is responsible for validating featureIndex less than numFeatures. */\n  getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature;\n\n  /** Get an object that provides ordered iteration over all features.\n   * @note The `output` object is reused (mutated in place) as the current value on each iteration.\n   */\n  iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex>;\n\n  /** @alpha */\n  populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void;\n\n  /** @alpha */\n  getAnimationNodeId(featureIndex: number): number;\n\n  /** Get the Id of the model associated with the feature at the specified index.\n   * The caller is responsible for validating that `featureIndex` is less than [[numFeatures]].\n   * This is more efficient than [[getFeature]] for callers who are only interested in the model Id.\n   */\n  getModelIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair;\n}\n\nconst scratchPackedFeature = PackedFeature.create();\n\nfunction populateAnimationNodeIds(table: RenderFeatureTable, computeNodeId: ComputeNodeId, maxNodeId: number): UintArray | undefined {\n  assert(maxNodeId > 0);\n\n  let nodeIds;\n  const outputFeature = PackedFeature.createWithIndex();\n  for (const feature of table.iterable(outputFeature)) {\n    const nodeId = computeNodeId(feature);\n    assert(nodeId <= maxNodeId);\n    if (0 !== nodeId) {\n      if (!nodeIds) {\n        const size = table.numFeatures;\n        nodeIds = maxNodeId < 0x100 ? new Uint8Array(size) : (maxNodeId < 0x10000 ? new Uint16Array(size) : new Uint32Array(size));\n      }\n\n      nodeIds[feature.index] = nodeId;\n    }\n  }\n\n  return nodeIds;\n}\n\n/**\n * An immutable, packed representation of a [[FeatureTable]]. The features are packed into a single array of 32-bit integer values,\n * wherein each feature occupies 3 32-bit integers.\n * @internal\n */\nexport class PackedFeatureTable implements RenderFeatureTable {\n  public readonly data: Uint32Array;\n  public readonly batchModelId: Id64String;\n  public readonly batchModelIdPair: Id64.Uint32Pair;\n  public readonly numFeatures: number;\n  public readonly anyDefined: boolean;\n  public readonly type: BatchType;\n  public animationNodeIds?: UintArray;\n\n  public get byteLength(): number { return this.data.byteLength; }\n\n  /** Construct a PackedFeatureTable from the packed binary data.\n   * This is used internally when deserializing Tiles in iMdl format.\n   * @internal\n   */\n  public constructor(data: Uint32Array, modelId: Id64String, numFeatures: number, type: BatchType, animationNodeIds?: UintArray) {\n    this.data = data;\n    this.batchModelId = modelId;\n    this.batchModelIdPair = Id64.getUint32Pair(modelId);\n    this.numFeatures = numFeatures;\n    this.type = type;\n    this.animationNodeIds = animationNodeIds;\n\n    switch (this.numFeatures) {\n      case 0:\n        this.anyDefined = false;\n        break;\n      case 1:\n        this.anyDefined = ModelFeature.isDefined(this.getFeature(0, ModelFeature.create()));\n        break;\n      default:\n        this.anyDefined = true;\n        break;\n    }\n\n    assert(this.data.length >= this._subCategoriesOffset);\n    assert(undefined === this.animationNodeIds || this.animationNodeIds.length === this.numFeatures);\n  }\n\n  /** Create a packed feature table from a [[FeatureTable]]. */\n  public static pack(featureTable: FeatureTable): PackedFeatureTable {\n    // We must determine how many subcategories we have ahead of time to compute the size of the Uint32Array, as\n    // the array cannot be resized after it is created.\n    // We are not too worried about this as FeatureTables created on the front-end will contain few if any features; those obtained from the\n    // back-end arrive within tiles already in the packed format.\n    const subcategories = new Map<string, number>();\n    for (const iv of featureTable.getArray()) {\n      const found = subcategories.get(iv.value.subCategoryId.toString());\n      if (undefined === found)\n        subcategories.set(iv.value.subCategoryId, subcategories.size);\n    }\n\n    // We need 3 32-bit integers per feature, plus 2 32-bit integers per subcategory.\n    const subCategoriesOffset = 3 * featureTable.length;\n    const nUint32s = subCategoriesOffset + 2 * subcategories.size;\n    const uint32s = new Uint32Array(nUint32s);\n\n    for (const iv of featureTable.getArray()) {\n      const feature = iv.value;\n      const index = iv.index * 3;\n\n      let subCategoryIndex = subcategories.get(feature.subCategoryId)!;\n      assert(undefined !== subCategoryIndex); // we inserted it above...\n      subCategoryIndex |= (feature.geometryClass << 24);\n\n      uint32s[index + 0] = Id64.getLowerUint32(feature.elementId);\n      uint32s[index + 1] = Id64.getUpperUint32(feature.elementId);\n      uint32s[index + 2] = subCategoryIndex;\n    }\n\n    subcategories.forEach((index: number, id: string, _map) => {\n      const index32 = subCategoriesOffset + 2 * index;\n      uint32s[index32 + 0] = Id64.getLowerUint32(id);\n      uint32s[index32 + 1] = Id64.getUpperUint32(id);\n    });\n\n    return new PackedFeatureTable(uint32s, featureTable.modelId, featureTable.length, featureTable.type);\n  }\n\n  /** Retrieve the Feature associated with the specified index. */\n  public getFeature(featureIndex: number, result: ModelFeature): ModelFeature {\n    const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);\n    return ModelFeature.unpack(packed, result, this.batchModelId);\n  }\n\n  /** Returns the Feature associated with the specified index, or undefined if the index is out of range. */\n  public findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined {\n    return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;\n  }\n\n  /** @internal */\n  public getElementIdPair(featureIndex: number, out?: Id64.Uint32Pair): Id64.Uint32Pair {\n    out = out ?? { lower: 0, upper: 0 };\n    assert(featureIndex < this.numFeatures);\n    const offset = 3 * featureIndex;\n    out.lower = this.data[offset];\n    out.upper = this.data[offset + 1];\n    return out;\n  }\n\n  /** @internal */\n  public getSubCategoryIdPair(featureIndex: number): Id64.Uint32Pair {\n    const index = 3 * featureIndex;\n    let subCatIndex = this.data[index + 2];\n    subCatIndex = (subCatIndex & 0x00ffffff) >>> 0;\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\n    return { lower: this.data[subCatIndex], upper: this.data[subCatIndex + 1] };\n  }\n\n  /** @internal */\n  public getAnimationNodeId(featureIndex: number): number {\n    return undefined !== this.animationNodeIds && featureIndex < this.numFeatures ? this.animationNodeIds[featureIndex] : 0;\n  }\n\n  /** @internal */\n  public getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature {\n    assert(featureIndex < this.numFeatures);\n\n    const index32 = 3 * featureIndex;\n    result.elementId.lower = this.data[index32];\n    result.elementId.upper = this.data[index32 + 1];\n\n    const subCatIndexAndClass = this.data[index32 + 2];\n    result.geometryClass = (subCatIndexAndClass >>> 24) & 0xff;\n\n    let subCatIndex = (subCatIndexAndClass & 0x00ffffff) >>> 0;\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\n    result.subCategoryId.lower = this.data[subCatIndex];\n    result.subCategoryId.upper = this.data[subCatIndex + 1];\n\n    result.animationNodeId = this.getAnimationNodeId(featureIndex);\n    result.modelId.lower = this.batchModelIdPair.lower;\n    result.modelId.upper = this.batchModelIdPair.upper;\n\n    return result;\n  }\n\n  public getModelIdPair(_featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair {\n    out.lower = this.batchModelIdPair.lower;\n    out.upper = this.batchModelIdPair.upper;\n    return out;\n  }\n\n  /** Returns the element ID of the Feature associated with the specified index, or undefined if the index is out of range. */\n  public findElementId(featureIndex: number): Id64String | undefined {\n    if (featureIndex >= this.numFeatures)\n      return undefined;\n    else\n      return this.readId(3 * featureIndex);\n  }\n\n  /** Return true if this table contains exactly 1 feature. */\n  public get isUniform(): boolean { return 1 === this.numFeatures; }\n\n  /** If this table contains exactly 1 feature, return it. */\n  public getUniform(result: ModelFeature): ModelFeature | undefined {\n    return this.isUniform ? this.getFeature(0, result) : undefined;\n  }\n\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\n  public get isPlanarClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\n  public get isClassifier(): boolean { return this.isVolumeClassifier || this.isPlanarClassifier; }\n\n  /** Unpack the features into a [[FeatureTable]]. */\n  public unpack(): FeatureTable {\n    const table = new FeatureTable(this.numFeatures, this.batchModelId);\n    const feature = ModelFeature.create();\n    for (let i = 0; i < this.numFeatures; i++) {\n      this.getFeature(i, feature);\n      table.insertWithIndex(new Feature(feature.elementId, feature.subCategoryId, feature.geometryClass), i);\n    }\n\n    return table;\n  }\n\n  public populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void {\n    assert(undefined === this.animationNodeIds);\n    this.animationNodeIds = populateAnimationNodeIds(this, computeNodeId, maxNodeId);\n  }\n\n  public * iterator(output: PackedFeatureWithIndex): Iterator<PackedFeatureWithIndex> {\n    for (let i = 0; i < this.numFeatures; i++) {\n      this.getPackedFeature(i, output);\n      output.index = i;\n      yield output;\n    }\n  }\n\n  public iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex> {\n    return {\n      [Symbol.iterator]: () => this.iterator(output),\n    };\n  }\n\n  private get _subCategoriesOffset(): number { return this.numFeatures * 3; }\n\n  private readId(offset32: number): Id64String {\n    return Id64.fromUint32Pair(this.data[offset32], this.data[offset32 + 1]);\n  }\n}\n\ninterface PackedFeatureModelEntry {\n  lastFeatureIndex: number;\n  idLower: number;\n  idUpper: number;\n}\n\nconst scratchPackedFeatureModelEntry = { lastFeatureIndex: -1, idLower: -1, idUpper: -1 };\n\n/** A table of model Ids associated with a [[MultiModelPackedFeatureTable]].\n * The feature indices in the packed feature table are grouped together by model, such that the first N features belong to model 1, the next M features to model 2, and so on.\n * The model table itself consists of one entry per model, where each entry looks like:\n *  indexOfLastFeatureInModel: u32\n *  modelId: u64\n * The modelId associated with a feature can therefore be derived by finding the entry in the model table with the highest indexOfLastFeatureInModel no greater than the feature index.\n * This lookup can be optimized using binary search.\n * Moreover, while iterating the feature table in sequence, the model table can be iterated in parallel so that no per-feature lookup of model Id is required.\n * @internal\n */\nexport class PackedFeatureModelTable {\n  private readonly _data: Uint32Array;\n\n  public constructor(data: Uint32Array) {\n    this._data = data;\n    assert(this._data.length % 3 === 0);\n  }\n\n  /** The number of models in the table. */\n  public get length(): number {\n    return this._data.length / 3;\n  }\n\n  public get byteLength(): number {\n    return this._data.byteLength;\n  }\n\n  private getLastFeatureIndex(modelIndex: number): number {\n    return this._data[modelIndex * 3];\n  }\n\n  public getEntry(modelIndex: number,  result: PackedFeatureModelEntry): PackedFeatureModelEntry {\n    if (modelIndex >= this.length) {\n      result.idLower = result.idUpper = 0;\n      result.lastFeatureIndex = Number.MAX_SAFE_INTEGER;\n      return result;\n    }\n\n    const index = modelIndex * 3;\n    result.lastFeatureIndex = this._data[index + 0];\n    result.idLower = this._data[index + 1];\n    result.idUpper = this._data[index + 2];\n    return result;\n  }\n\n  /** Get the Id of the model associated with the specified feature, or an invalid Id if the feature is not associated with any model. */\n  public getModelIdPair(featureIndex: number, result?: Id64.Uint32Pair): Id64.Uint32Pair {\n    if (!result)\n      result = { lower: 0, upper: 0 };\n    else\n      result.lower = result.upper = 0;\n\n    let first = 0;\n    const last = this.length;\n    let count = last;\n    while (count > 0) {\n      const step = Math.floor(count / 2);\n      const mid = first + step;\n      const lastFeatureIndex = this.getLastFeatureIndex(mid);\n      if (featureIndex > lastFeatureIndex) {\n        first = mid + 1;\n        count -= step + 1;\n      } else {\n        count = step;\n      }\n    }\n\n    if (first < last) {\n      result.lower = this._data[first * 3 + 1];\n      result.upper = this._data[first * 3 + 2];\n    }\n\n    return result;\n  }\n}\n\n/** A PackedFeatureTable with a PackedFeatureModelTable appended to it, capable of storing features belonging to more than one model.\n * @internal\n */\nexport class MultiModelPackedFeatureTable implements RenderFeatureTable {\n  private readonly _features: PackedFeatureTable;\n  private readonly _models: PackedFeatureModelTable;\n\n  public constructor(features: PackedFeatureTable, models: PackedFeatureModelTable) {\n    this._features = features;\n    this._models = models;\n  }\n\n  public static create(data: Uint32Array, batchModelId: Id64String, numFeatures: number, type: BatchType, numSubCategories: number): MultiModelPackedFeatureTable {\n    const modelTableOffset = 3 * numFeatures + 2 * numSubCategories;\n    const featureData = data.subarray(0, modelTableOffset);\n    const features = new PackedFeatureTable(featureData, batchModelId, numFeatures, type);\n\n    const modelData = data.subarray(modelTableOffset);\n    const models = new PackedFeatureModelTable(modelData);\n\n    return new MultiModelPackedFeatureTable(features, models);\n  }\n\n  public get batchModelId() { return this._features.batchModelId; }\n  public get batchModelIdPair() { return this._features.batchModelIdPair; }\n  public get numFeatures() { return this._features.numFeatures; }\n  public get type() { return this._features.type; }\n  public get animationNodeIds(): UintArray | undefined { return this._features.animationNodeIds; }\n  public set animationNodeIds(ids: UintArray | undefined) { this._features.animationNodeIds = ids; }\n\n  public get byteLength() {\n    return this._features.byteLength + this._models.byteLength;\n  }\n\n  public getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature {\n    this._features.getPackedFeature(featureIndex, result);\n    this._models.getModelIdPair(featureIndex, result.modelId);\n    return result;\n  }\n\n  public getFeature(featureIndex: number, result: ModelFeature): ModelFeature {\n    const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);\n    return ModelFeature.unpack(packed, result);\n  }\n\n  public findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined {\n    return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;\n  }\n\n  public getElementIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair {\n    return this._features.getElementIdPair(featureIndex, out);\n  }\n\n  public getModelIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair {\n    this._models.getModelIdPair(featureIndex, out);\n    return out;\n  }\n\n  public findElementId(featureIndex: number): Id64String | undefined {\n    return this._features.findElementId(featureIndex);\n  }\n\n  public * iterator(output: PackedFeatureWithIndex): Iterator<PackedFeatureWithIndex> {\n    // Rather than perform a binary search on the model table to find each feature's model Id, traverse the model table in parallel with the feature table.\n    let modelIndex = 0;\n    const modelEntry = this._models.getEntry(modelIndex, scratchPackedFeatureModelEntry);\n\n    for (let featureIndex = 0; featureIndex < this.numFeatures; featureIndex++) {\n      if (featureIndex > modelEntry.lastFeatureIndex)\n        this._models.getEntry(++modelIndex, modelEntry);\n\n      this._features.getPackedFeature(featureIndex, output);\n      output.modelId.lower = modelEntry.idLower;\n      output.modelId.upper = modelEntry.idUpper;\n      output.index = featureIndex;\n      yield output;\n    }\n  }\n\n  public iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex> {\n    return {\n      [Symbol.iterator]: () => this.iterator(output),\n    };\n  }\n\n  public getAnimationNodeId(featureIndex: number): number {\n    return this._features.getAnimationNodeId(featureIndex);\n  }\n\n  public populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void {\n    this._features.animationNodeIds = populateAnimationNodeIds(this, computeNodeId, maxNodeId);\n  }\n}\n"]}
+{"version":3,"file":"FeatureTable.js","sourceRoot":"","sources":["../../src/FeatureTable.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAE6B;AAC7B,qDAAiD;AACjD,sEAAmE;AAEnE;;;;;;;;GAQG;AACH,MAAa,OAAO;IACF,SAAS,CAAa;IACtB,aAAa,CAAa;IAC1B,aAAa,CAAgB;IAE7C,YAAmB,YAAwB,mBAAI,CAAC,OAAO,EAAE,gBAA4B,mBAAI,CAAC,OAAO,EAAE,gBAA+B,8BAAa,CAAC,OAAO;QACrJ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,IAAW,SAAS,KAAc,OAAO,CAAC,mBAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,CAAC,aAAa,KAAK,8BAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAClK,IAAW,WAAW,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAE7D,0EAA0E;IACnE,MAAM,CAAC,KAAc,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5E;;;OAGG;IACI,OAAO,CAAC,GAAY;QACzB,IAAI,IAAI,KAAK,GAAG;YACd,OAAO,CAAC,CAAC;QAEX,IAAI,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACd,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACd,GAAG,GAAG,IAAA,6BAAc,EAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAnCD,0BAmCC;AAYD,cAAc;AACd,IAAiB,YAAY,CA0B5B;AA1BD,WAAiB,YAAY;IAC3B;;OAEG;IACH,SAAgB,MAAM;QACpB,OAAO;YACL,OAAO,EAAE,mBAAI,CAAC,OAAO;YACrB,SAAS,EAAE,mBAAI,CAAC,OAAO;YACvB,aAAa,EAAE,mBAAI,CAAC,OAAO;YAC3B,aAAa,EAAE,8BAAa,CAAC,OAAO;SACrC,CAAC;IACJ,CAAC;IAPe,mBAAM,SAOrB,CAAA;IAED,4HAA4H;IAC5H,SAAgB,SAAS,CAAC,OAAqB;QAC7C,OAAO,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,mBAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,aAAa,KAAK,8BAAa,CAAC,OAAO,CAAC;IAC7K,CAAC;IAFe,sBAAS,YAExB,CAAA;IAED,aAAa;IACb,SAAgB,MAAM,CAAC,MAAqB,EAAE,MAAoB,EAAE,eAA4B;QAC9F,MAAM,CAAC,OAAO,GAAG,eAAe,IAAI,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9E,MAAM,CAAC,SAAS,GAAG,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC/D,MAAM,CAAC,aAAa,GAAG,mBAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IANe,mBAAM,SAMrB,CAAA;AACH,CAAC,EA1BgB,YAAY,4BAAZ,YAAY,QA0B5B;AAqBD,cAAc;AACd,IAAiB,aAAa,CAuB7B;AAvBD,WAAiB,aAAa;IAC5B;;OAEG;IACH,SAAgB,MAAM;QACpB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,OAAO;YACL,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE;YACpB,SAAS,EAAE,EAAE,GAAG,IAAI,EAAE;YACtB,aAAa,EAAE,EAAE,GAAG,IAAI,EAAE;YAC1B,aAAa,EAAE,8BAAa,CAAC,OAAO;YACpC,eAAe,EAAE,CAAC;SACnB,CAAC;IACJ,CAAC;IATe,oBAAM,SASrB,CAAA;IAED;;OAEG;IACH,SAAgB,eAAe;QAC7B,MAAM,MAAM,GAAG,MAAM,EAA4B,CAAC;QAClD,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAJe,6BAAe,kBAI9B,CAAA;AACH,CAAC,EAvBgB,aAAa,6BAAb,aAAa,QAuB7B;AAED;;;;;GAKG;AACH,IAAY,SAeX;AAfD,WAAY,SAAS;IACnB,4EAA4E;IAC5E,+CAAO,CAAA;IACP;;;;OAIG;IACH,iEAAgB,CAAA;IAChB;;;;OAIG;IACH,iEAAgB,CAAA;AAClB,CAAC,EAfW,SAAS,yBAAT,SAAS,QAepB;AAED;;;;;;;GAOG;AACH,MAAa,YAAa,SAAQ,uBAAiB;IACjC,OAAO,CAAa;IACpB,IAAI,CAAY;IAEhC,uCAAuC;IACvC,YAAmB,WAAmB,EAAE,UAAsB,mBAAI,CAAC,OAAO,EAAE,OAAkB,SAAS,CAAC,OAAO;QAC7G,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gFAAgF;IAChF,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,+GAA+G;IAC/G,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACrH,0EAA0E;IAC1E,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,gHAAgH;IAChH,IAAW,OAAO,KAA0B,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1G,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7F,0GAA0G;IACnG,WAAW,CAAC,KAAa;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK;gBACvB,OAAO,KAAK,CAAC,KAAK,CAAC;QAEvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,OAAgB,EAAE,KAAa;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvC,IAAA,qBAAM,EAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrB,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,2BAAY,CAAU,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,2EAA2E;IACpE,QAAQ,KAA2C,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE/E,oHAAoH;IAC7G,IAAI;QACT,OAAO,uCAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;CACF;AAnDD,oCAmDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Rendering\n */\n\nimport {\n  assert, compareNumbers, compareStrings, Id64, Id64String, IndexedValue, IndexMap, UintArray,\n} from \"@itwin/core-bentley\";\nimport { GeometryClass } from \"./GeometryParams\";\nimport { PackedFeatureTable } from \"./internal/PackedFeatureTable\";\n\n/** Describes a discrete entity within a batched [RenderGraphic]($frontend) that can be\n * grouped with other such entities in a [[FeatureTable]].\n * Features roughly correlate to elements: a [Tile]($frontend)'s graphics combines geometry from every\n * [GeometricElement]($backend) that intersects the tile's volume, so each element produces at least one feature.\n * However, an element's geometry stream can contain geometry belonging to multiple different combinations of [SubCategory]($backend) and\n * [[GeometryClass]], so an individual element may produce more than one feature.\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\n * @public\n */\nexport class Feature {\n  public readonly elementId: Id64String;\n  public readonly subCategoryId: Id64String;\n  public readonly geometryClass: GeometryClass;\n\n  public constructor(elementId: Id64String = Id64.invalid, subCategoryId: Id64String = Id64.invalid, geometryClass: GeometryClass = GeometryClass.Primary) {\n    this.elementId = elementId;\n    this.subCategoryId = subCategoryId;\n    this.geometryClass = geometryClass;\n  }\n\n  public get isDefined(): boolean { return !Id64.isInvalid(this.elementId) || !Id64.isInvalid(this.subCategoryId) || this.geometryClass !== GeometryClass.Primary; }\n  public get isUndefined(): boolean { return !this.isDefined; }\n\n  /** Returns true if this feature is equivalent to the supplied feature. */\n  public equals(other: Feature): boolean { return 0 === this.compare(other); }\n\n  /** Performs ordinal comparison of this feature with another.\n   * @param rhs The feature to compare with.\n   * @returns zero if the features are equivalent, a negative value if this feature compares as \"less than\" `rhs`, or a positive value if this feature compares \"greater than\" `rhs`.\n   */\n  public compare(rhs: Feature): number {\n    if (this === rhs)\n      return 0;\n\n    let cmp = compareNumbers(this.geometryClass, rhs.geometryClass);\n    if (0 === cmp) {\n      cmp = compareStrings(this.elementId, rhs.elementId);\n      if (0 === cmp) {\n        cmp = compareStrings(this.subCategoryId, rhs.subCategoryId);\n      }\n    }\n\n    return cmp;\n  }\n}\n\n/** A [[Feature]] with a modelId identifying the model containing the feature, obtained from a [[RenderFeatureTable]].\n * @public\n */\nexport interface ModelFeature {\n  modelId: Id64String;\n  elementId: Id64String;\n  subCategoryId: Id64String;\n  geometryClass: GeometryClass;\n}\n\n/** @public */\nexport namespace ModelFeature {\n  /** Create a ModelFeature of [[GeometryClass.Primary]] with all invalid Ids.\n   * This is primarily useful for creating a `result` argument for [[RenderFeatureTable.findFeature]] and [[RenderFeatureTable.getFeature]].\n   */\n  export function create(): ModelFeature {\n    return {\n      modelId: Id64.invalid,\n      elementId: Id64.invalid,\n      subCategoryId: Id64.invalid,\n      geometryClass: GeometryClass.Primary,\n    };\n  }\n\n  /** Returns `true` if any of `feature`'s properties differ from the defaults (invalid Ids and [[GeometryClass.Primary]]). */\n  export function isDefined(feature: ModelFeature): boolean {\n    return !Id64.isInvalid(feature.modelId) || !Id64.isInvalid(feature.elementId) || !Id64.isInvalid(feature.subCategoryId) || feature.geometryClass !== GeometryClass.Primary;\n  }\n\n  /** @alpha */\n  export function unpack(packed: PackedFeature, result: ModelFeature, unpackedModelId?: Id64String): ModelFeature {\n    result.modelId = unpackedModelId ?? Id64.fromUint32PairObject(packed.modelId);\n    result.elementId = Id64.fromUint32PairObject(packed.elementId);\n    result.subCategoryId = Id64.fromUint32PairObject(packed.subCategoryId);\n    result.geometryClass = packed.geometryClass;\n    return result;\n  }\n}\n\n/** Represents a [[Feature]] within a [[RenderFeatureTable]]. This representation is optimized for use on the GPU.\n * @public\n */\nexport interface PackedFeature {\n  modelId: Id64.Uint32Pair;\n  elementId: Id64.Uint32Pair;\n  subCategoryId: Id64.Uint32Pair;\n  geometryClass: GeometryClass;\n  /** @alpha */\n  animationNodeId: number;\n}\n\n/** Represents a [[PackedFeature]] obtained from a [[RenderFeatureTable]], including the index of that feature within the table.\n * @public\n */\nexport interface PackedFeatureWithIndex extends PackedFeature {\n  index: number;\n}\n\n/** @public */\nexport namespace PackedFeature {\n  /** Create a PackedFeature of [[GeometryClass.Primary]] with all invalid Ids.\n   * This is primarily useful for creating a `result` argument for [[RenderFeatureTable.getPackedFeature]].\n   */\n  export function create(): PackedFeature {\n    const pair = { upper: 0, lower: 0 };\n    return {\n      modelId: { ...pair },\n      elementId: { ...pair },\n      subCategoryId: { ...pair },\n      geometryClass: GeometryClass.Primary,\n      animationNodeId: 0,\n    };\n  }\n\n  /** Create a PackedFeatureWithIndex of [[GeometryClass.Primary]] with all invalid Ids and an index of zero.\n   * This is primarily useful for creating a reusable `output` argument for [[RenderFeatureTable.iterable]].\n   */\n  export function createWithIndex(): PackedFeatureWithIndex {\n    const result = create() as PackedFeatureWithIndex;\n    result.index = 0;\n    return result;\n  }\n}\n\n/** Describes the type of a 'batch' of graphics representing multiple [[Feature]]s.\n * The most commonly-encountered batches are Tiles, which can be of either Primary or\n * Classifier type.\n * @public\n * @extensions\n */\nexport enum BatchType {\n  /** This batch contains graphics derived from a model's visible geometry. */\n  Primary,\n  /**\n   * This batch contains color volumes which are used to classify a model's visible geometry.\n   * The graphics themselves are not rendered to the screen; instead they are rendered to the stencil buffer\n   * to resymbolize the primary geometry.\n   */\n  VolumeClassifier,\n  /**\n   * This batch contains planar graphics which are used to classify a model's visible geometry.\n   * The graphics themselves are not rendered to the screen; instead they are rendered to a texture buffer\n   * to resymbolize the primary geometry.\n   */\n  PlanarClassifier,\n}\n\n/** Defines a look-up table for [[Feature]]s within a batched [RenderGraphic]($frontend). Consecutive 32-bit\n * indices are assigned to each unique Feature. Primitives within the RenderGraphic can\n * use per-vertex indices to specify the distribution of Features within the primitive. The appearance of individual\n * features can be customized using [[FeatureOverrides]]. Typically a [Tile]($frontend) will contain a feature table\n * identifying the elements whose geometry appears within that tile.\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\n * @public\n */\nexport class FeatureTable extends IndexMap<Feature> {\n  public readonly modelId: Id64String;\n  public readonly type: BatchType;\n\n  /** Construct an empty FeatureTable. */\n  public constructor(maxFeatures: number, modelId: Id64String = Id64.invalid, type: BatchType = BatchType.Primary) {\n    super((lhs, rhs) => lhs.compare(rhs), maxFeatures);\n    this.modelId = modelId;\n    this.type = type;\n  }\n\n  /** Returns the maximum number of [[Feature]]s this FeatureTable can contain. */\n  public get maxFeatures(): number { return this._maximumSize; }\n  /** Returns true if this table contains at least one [[Feature]] with a valid element and/or subcategory Id. */\n  public get anyDefined(): boolean { return this.length > 1 || (1 === this.length && this._array[0].value.isDefined); }\n  /** Returns true if this FeatureTable contains exactly one [[Feature]]. */\n  public get isUniform(): boolean { return 1 === this.length; }\n  /** If this FeatureTable contains exactly one [[Feature]], returns that Feature; otherwise returns undefined. */\n  public get uniform(): Feature | undefined { return 1 === this.length ? this._array[0].value : undefined; }\n  /** Returns true if this FeatureTable is associated with [[BatchType.VolumeClassifier]] geometry. */\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\n  /** Returns true if this FeatureTable is associated with [[BatchType.PlanarClassifier]] geometry. */\n  public get isPlanarClassifier(): boolean { return BatchType.PlanarClassifier === this.type; }\n\n  /** Returns the Feature corresponding to the specified index, or undefined if the index is not present. */\n  public findFeature(index: number): Feature | undefined {\n    for (const entry of this._array)\n      if (entry.index === index)\n        return entry.value;\n\n    return undefined;\n  }\n\n  /** Inserts the specified [[Feature]] at the specified index. This is really only useful when reconstructing a previously-create feature table\n   * for which you know the index assigned to each feature.\n   */\n  public insertWithIndex(feature: Feature, index: number): void {\n    const bound = this.lowerBound(feature);\n    assert(!bound.equal);\n    assert(!this.isFull);\n    const entry = new IndexedValue<Feature>(feature, index);\n    this._array.splice(bound.index, 0, entry);\n  }\n\n  /** Access the underlying array containing the table's current contents. */\n  public getArray(): ReadonlyArray<IndexedValue<Feature>> { return this._array; }\n\n  /** Convert this feature table to a representation that can be supplied to [RenderSystem.createBatch]($frontend). */\n  public pack(): RenderFeatureTable {\n    return PackedFeatureTable.pack(this);\n  }\n}\n\n/** @alpha */\nexport type ComputeNodeId = (feature: PackedFeatureWithIndex) => number;\n\n/** Representation of a [[FeatureTable]] suitable for use with [RenderSystem.createBatch]($frontend).\n * The [[Feature]]s are represented as [[PackedFeature]]s. The feature table may contain features from multiple [Model]($backend)s.\n * @see [[FeatureTable.pack]] to produce a RenderFeatureTable.\n * @public\n */\nexport interface RenderFeatureTable {\n  /** The \"model Id\" of the tile tree containing the tile from which this feature table originated.\n   * It may be a transient Id if, for example, the tile tree represents a reality model or represents the geometry of multiple\n   * persistent models batched together.\n   */\n  readonly batchModelId: Id64String;\n  /** A split representation of [[batchModelId]], to avoid having to constantly having to parse the string. */\n  readonly batchModelIdPair: Id64.Uint32Pair;\n  /** The number of features in the table; equivalently, one more than the largest feature index. */\n  readonly numFeatures: number;\n  /** The number of bytes consumed by the feature table, strictly for diagnostic purposes. */\n  readonly byteLength: number;\n  readonly type: BatchType;\n  /** @alpha */\n  animationNodeIds?: UintArray;\n\n  /** Get the feature at the specified index. The caller is responsible for validating featureIndex less than numFeatures. */\n  getFeature(featureIndex: number, result: ModelFeature): ModelFeature;\n\n  /** Find the feature at the specified index. Returns undefined if featureIndex >= [[numFeatures]]. */\n  findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined;\n\n  /** Find the Id of the element associated with the feature at the specified index. */\n  findElementId(featureIndex: number): Id64String | undefined;\n\n  /** Get the Id of the element associated with the feature at the specified index as a pair of 32-bit integers.\n   * The caller is responsible for validating that `featureIndex` is less than [[numFeatures]].\n   */\n  getElementIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair;\n\n  /** Get the feature at the specified index. The caller is responsible for validating featureIndex less than numFeatures. */\n  getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature;\n\n  /** Get an object that provides ordered iteration over all features.\n   * @note The `output` object is reused (mutated in place) as the current value on each iteration.\n   */\n  iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex>;\n\n  /** @alpha */\n  populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void;\n\n  /** @alpha */\n  getAnimationNodeId(featureIndex: number): number;\n\n  /** Get the Id of the model associated with the feature at the specified index.\n   * The caller is responsible for validating that `featureIndex` is less than [[numFeatures]].\n   * This is more efficient than [[getFeature]] for callers who are only interested in the model Id.\n   */\n  getModelIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair;\n}\n"]}

package/lib/cjs/Fonts.d.ts

@@ -1,34 +1,92 @@
 /** @packageDocumentation
  * @module Symbology
  */
-/** The type of a font.
+/** The [FontFile]($backend) encodings understood by iTwin.js.
+ * @see [this article]($docs/learning/backend/Fonts.md) to learn more about fonts in iModels.
  * @public
  * @extensions
  */
 export declare enum FontType {
+    /** [OpenType](https://en.wikipedia.org/wiki/OpenType) format, derived from and compatible with the earlier [TrueType](https://en.wikipedia.org/wiki/TrueType) format.
+     * The vast majority of modern, scalable, aesthetically-pleasing fonts are delivered in this format.
+     * OpenType files typically use one of the following suffixes: .ttf, .ttc, .otf, and .otc.
+     * @see [FontFile.createFromTrueTypeFileName]($backend) to work with font files in this format.
+     */
     TrueType = 1,
+    /** [RSC](https://docs.bentley.com/LiveContent/web/MicroStation%20Help-v27/en/GUID-FC78484C-E42F-30BF-BF68-2B2C025AE040.html) is a simple font format
+     * originating in [MicroStation](https://en.wikipedia.org/wiki/MicroStation). In MicroStation, they are defined in "resource files" with a ".rsc" suffix.
+     * In iModels, they are encoded in a binary format. Currently, no APIs exist to convert to this binary format, but some [connectors]($docs/learning/imodel-connectors.md) can
+     * perform the conversion.
+     */
     Rsc = 2,
+    /** [SHX](https://help.autodesk.com/view/OARX/2024/ENU/?guid=GUID-DE941DB5-7044-433C-AA68-2A9AE98A5713) is a simple font format originating in
+     * [AutoCAD](https://en.wikipedia.org/wiki/AutoCAD). SHX fonts are generally distributed as files with a ".shx" suffix.
+     * @see [FontFile.createFromShxFontBlob]($backend) to work with font files in this format.
+     */
     Shx = 3
 }
-/** An iModel-local identifier for a font.
+/** An unsigned integer uniquely identifying a [font family]($docs/learning/backend/Fonts.md) in the context of an [[IModel]].
+ * The iModel stores a mapping between `FontId`s and [[FontFamilyDescriptor]]s.
+ * [[TextString]]s refer to fonts by the their `FontId`s.
+ * A font Id of zero represents an invalid/non-existent font.
+ * @see [IModelDbFonts]($backend) to work with font Ids.
  * @public
  * @extensions
  */
 export type FontId = number;
-/** The properties of a Font.
+/** Uniquely describes one or more [[FontFace]]s sharing the same name and type comprising a single [font family]($docs/learning/backend/Fonts.md).
  * @public
  */
-export interface FontProps {
-    /** the Id, within an iModel, of this font. */
-    id: FontId;
-    /** The type of font */
+export interface FontFamilyDescriptor {
+    /** The encoding in which the font family's faces are stored. */
     type: FontType;
-    /** The name of the font. */
+    /** The name of the family. */
+    name: string;
+}
+/** A [[FontFamilyDescriptor]] in which the [[FontType]] is optional, used when querying [[FontId]]s via [IModelDbFonts.findId]($backend).
+ * If a font type is provided, this selector exactly identifies a unique font family, just like [[FontFamilyDescriptor]] does.
+ * If the type is omitted, then the selector refers to the first font family that matches the specified [[name]]. If multiple families
+ * with the same name exist, then a TrueType font will be preferred over a RSC font, and a RSC font preferred over an SHX font.
+ * @beta
+ */
+export interface FontFamilySelector {
+    /** The encoding in which the font family's faces are stored. */
+    type?: FontType;
+    /** The name of the family. */
     name: string;
 }
+/** Represents a [[FontFamilyDescriptor]] stored in an iModel with a unique numeric Id.
+ * @public
+ */
+export interface FontProps extends FontFamilyDescriptor {
+    /** An integer that uniquely identifies this font family in the context of the iModel in which it is stored. */
+    id: FontId;
+}
+/** A specific variation of the glyphs defined by a [font family]($docs/learning/backend/Fonts.md).
+ * Each face can be italicized, bolded, both, or neither.
+ * Font faces are stored in [FontFile]($backend)s.
+ * @beta
+ */
+export interface FontFace {
+    /** The name of the font family to which this face belongs. */
+    familyName: string;
+    isBold: boolean;
+    isItalic: boolean;
+}
+/** Information about the encoding of a [[FontType.Rsc]] [FontFile]($backend), used when embedding such a font into an iModel.
+ * Currently, no public APIs exist to create such fonts.
+ * @alpha
+ */
+export interface RscFontEncodingProps {
+    codePage?: number;
+    degree?: number;
+    plusMinus?: number;
+    diameter?: number;
+}
 /** The properties of a FontMap
  * @public
  * @extensions
+ * @deprecated in 5.0.0. Use [IModelDb.fonts]($backend)
  */
 export interface FontMapProps {
     fonts: FontProps[];
@@ -37,9 +95,9 @@ export interface FontMapProps {
  * A FontMap holds the set of font names available in an iModel.
  * Within the GeometryStream of an Element, a specific font is referenced by its FontId that is local to the iModel.
  * This class maps FontIds to FontProps.
- * @note The font map is generally established when the iModel is first created to specify the set of fonts available
- * for editors. Adding new entries requires that the schema lock be held.
+ * @note This API has never worked properly. Don't use it. Use [IModelDb.fonts]($backend) instead.
  * @public
+ * @deprecated in 5.0.0. Use [IModelDb.fonts]($backend) instead.
  */
 export declare class FontMap {
     readonly fonts: Map<number, FontProps>;