@ifc-lite/rules 0.2.0

package/dist/engine/rule-engine.js

@@ -0,0 +1,244 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { exactTypeName } from '@ifc-lite/data';
+import { calculateSummary, } from '@ifc-lite/ids';
+import { setOpMatches } from '../filter/filter-ops.js';
+import { evaluateFilterGroupsFederated } from '../filter/filter-evaluate-groups.js';
+import { throwAbort } from '../filter/filter-evaluate-yield.js';
+import { checkElementForEntity } from './rule-engine-requirements.js';
+import { checkAggregate, checkUnique } from './rule-engine-sets.js';
+import { checkCompare } from './rule-engine-compare.js';
+import { checkUnit } from './rule-engine-unit.js';
+import { maybeYieldChunk, finalProgress } from './rule-engine-chunk.js';
+/** `targets` narrows the loaded-model list to the rule set's declared
+ *  default targets (plan §3: never a local model id; both lists OR'd;
+ *  empty/absent = every loaded model). */
+export function resolveTargetModels(models, targets) {
+    const fingerprints = targets?.modelFingerprints ?? [];
+    const tagIds = targets?.modelTagIds ?? [];
+    if (fingerprints.length === 0 && tagIds.length === 0)
+        return [...models];
+    const fpSet = new Set(fingerprints);
+    const tagSet = new Set(tagIds);
+    return models.filter((m) => {
+        if (fpSet.size > 0 && m.filterIdentity !== undefined && fpSet.has(m.filterIdentity))
+            return true;
+        if (tagSet.size > 0 && m.tagIds)
+            for (const t of m.tagIds)
+                if (tagSet.has(t))
+                    return true;
+        return false;
+    });
+}
+function buildModelInfo(models) {
+    const out = [];
+    for (const m of models) {
+        if (!m.store)
+            continue;
+        out.push({
+            modelId: m.id,
+            schemaVersion: m.store.schemaVersion || 'IFC4',
+            entityCount: m.store.entityCount || m.store.entities.count,
+        });
+    }
+    return out;
+}
+/** Every `exactClass`-flagged `ifcType` rule in an applicability block (plan
+ *  §2 row "Class inheritance", §4 item 1 last sentence). Scoped to the WHOLE
+ *  block rather than per-`FilterGroup` — a rule authoring `exactClass` on one
+ *  OR-branch and not another is not a shape the editor (PR 5) offers, so a
+ *  whole-rule post-filter is the closest correct reading, not a narrowing of
+ *  an actually-supported shape (documented here per the brief's "closest
+ *  correct thing" instruction rather than left unhandled). */
+function exactClassRulesOf(block) {
+    const out = [];
+    for (const group of block.groups) {
+        for (const rule of group.rules) {
+            if (rule.kind === 'ifcType' && rule.exactClass)
+                out.push(rule);
+        }
+    }
+    return out;
+}
+function applyExactClassFilter(elements, rules, storesById, opts) {
+    if (rules.length === 0)
+        return [...elements];
+    return elements.filter((el) => {
+        const store = storesById.get(el.modelId);
+        if (!store)
+            return false;
+        const exact = exactTypeName(store.entities, el.expressId);
+        return rules.some((r) => setOpMatches(r.op, exact, r.values, opts));
+    });
+}
+function checkCardinality(cardinality, count) {
+    if (!cardinality || (cardinality.minApplicable === undefined && cardinality.maxApplicable === undefined)) {
+        return undefined;
+    }
+    const messages = [];
+    let passed = true;
+    if (cardinality.minApplicable !== undefined && count < cardinality.minApplicable) {
+        passed = false;
+        messages.push(`expected at least ${cardinality.minApplicable}, found ${count}`);
+    }
+    if (cardinality.maxApplicable !== undefined && count > cardinality.maxApplicable) {
+        passed = false;
+        messages.push(`expected at most ${cardinality.maxApplicable}, found ${count}`);
+    }
+    return {
+        passed,
+        actualCount: count,
+        minExpected: cardinality.minApplicable,
+        maxExpected: cardinality.maxApplicable,
+        message: messages.length > 0 ? messages.join('; ') : 'Cardinality satisfied',
+    };
+}
+async function runElementRequirement(ruleId, block, applicable, storesById, opts, ruleIndex, signal, onProgress) {
+    const out = [];
+    for (let i = 0; i < applicable.length; i++) {
+        const el = applicable[i];
+        const store = storesById.get(el.modelId);
+        if (store)
+            out.push(checkElementForEntity(ruleId, block, el, store, opts));
+        await maybeYieldChunk(i + 1, applicable.length, ruleIndex, signal, onProgress);
+    }
+    finalProgress(applicable.length, ruleIndex, signal, onProgress);
+    return out;
+}
+function finalizeSpecification(rule, applicableCount, cardinalityResult, outcome, error) {
+    const specification = { id: rule.id, name: rule.name, description: rule.description };
+    if (error !== undefined) {
+        // Existing IDS convention (`packages/ids/src/report-types.ts`'s
+        // `SpecificationResult.error` doc): an unevaluable rule is `status:
+        // 'fail'` with `error` set, never silently folded into `pass`.
+        return {
+            specification, status: 'fail', applicableCount, passedCount: 0, failedCount: 0, passRate: 0,
+            entityResults: [], error,
+        };
+    }
+    const failedEntities = outcome.entityResults.filter((e) => !e.passed).length;
+    const passedEntities = outcome.entityResults.filter((e) => e.passed).length;
+    const setsFail = (outcome.setResults ?? []).some((s) => !s.passed);
+    // `element`/`compare`/`unit` report every applicable entity (pass and fail), so
+    // their counts read straight off `entityResults`. `unique`/`aggregate`
+    // only ever construct FAILING rows (plan §4.5/§4.6 — a whole federation's
+    // worth of passing rows would dwarf the report for no reporting value),
+    // so their `passedCount` is the complement against `applicableCount`.
+    //
+    // `aggregate` is the exception to "rows are complete for failures": it
+    // emits no row for a member of a group that fails on its aggregate value
+    // (none at all for `fn: 'count'`), so it reports the distinct failing
+    // element count alongside (#5177). Reading `failedEntities` there left a
+    // failing aggregate rule at `failedCount: 0` / `passRate: 100`.
+    const isPerElementKind = rule.requirement.kind === 'element' || rule.requirement.kind === 'compare'
+        || rule.requirement.kind === 'unit';
+    const failedCount = outcome.failedElementCount ?? failedEntities;
+    const passedCount = isPerElementKind ? passedEntities : Math.max(0, applicableCount - failedCount);
+    const anyFail = failedCount > 0 || setsFail || cardinalityResult?.passed === false;
+    // With zero applicable elements a `universe`-seeded aggregate group can
+    // still fail (every assembly has 0 plates), so `setsFail` counts here too.
+    const status = applicableCount === 0
+        ? (cardinalityResult?.passed === false || setsFail ? 'fail' : cardinalityResult?.passed === true ? 'pass' : 'not_applicable')
+        : (anyFail ? 'fail' : 'pass');
+    // A failure no applicable element carries — an unmet/exceeded cardinality,
+    // or an aggregate group seeded by `universe` with zero members — leaves the
+    // element arithmetic at 100 (or has nothing to rate). `status` and
+    // `passRate` must never disagree, so a failing spec never reads 100: the
+    // same rule `@ifc-lite/ids`'s `validateSpecification` applies (#5212).
+    const elementRate = applicableCount > 0 ? Math.floor((passedCount / applicableCount) * 100) : 100;
+    const passRate = status === 'fail' && elementRate === 100 ? 0 : elementRate;
+    return {
+        specification, status, applicableCount, passedCount, failedCount, passRate,
+        entityResults: outcome.entityResults,
+        cardinalityResult,
+        setResults: outcome.setResults,
+        setResultsTruncated: outcome.setResultsTruncated,
+    };
+}
+/** Run every rule in `ruleSet` against the targeted models and return one
+ *  `ValidationReport`. Rejects with `AbortError` on cancellation; the report
+ *  object is constructed only after the loop completes, so a caller can
+ *  never observe a partial one. */
+export async function runRuleSet(options) {
+    const { ruleSet, models, definedModelTagIds, signal, onProgress } = options;
+    const targetModels = resolveTargetModels(models, ruleSet.targets);
+    const storesById = new Map();
+    for (const m of targetModels)
+        if (m.store)
+            storesById.set(m.id, m.store);
+    const modelInfo = buildModelInfo(targetModels);
+    // A rule set that DECLARES targets (`modelFingerprints`/`modelTagIds`) but
+    // resolves to zero loaded models is a MISMATCH, not an empty applicable
+    // set (#5138 PR 7b review): every model tag id or fingerprint is opaque
+    // and unresolved-by-construction (`Subject` §3), so this is exactly as
+    // likely to mean "the caller's `filterIdentity`/tag set doesn't match
+    // what the rule set was authored against" as "no targeted model happens
+    // to be loaded right now" — and a silent `not_applicable` pass reads as
+    // a clean report either way. Every rule is unevaluable, not vacuously
+    // satisfied, so every rule reports `error`, the same convention
+    // `finalizeSpecification` already uses for an exception mid-evaluation.
+    const targetsDeclared = (ruleSet.targets?.modelFingerprints?.length ?? 0) > 0 || (ruleSet.targets?.modelTagIds?.length ?? 0) > 0;
+    const targetsUnresolved = targetsDeclared && targetModels.length === 0;
+    const specificationResults = [];
+    for (let ruleIndex = 0; ruleIndex < ruleSet.rules.length; ruleIndex++) {
+        if (signal?.aborted)
+            throwAbort(signal);
+        const rule = ruleSet.rules[ruleIndex];
+        const opts = { caseSensitive: rule.caseSensitive ?? true, tolerance: rule.tolerance ?? 1e-6 };
+        if (targetsUnresolved) {
+            specificationResults.push(finalizeSpecification(rule, 0, undefined, { entityResults: [] }, 'no loaded model matches the rule set targets'));
+            continue;
+        }
+        // Tracked outside the `try` so the `catch` can report the REAL applicable
+        // count when applicability itself succeeded and only the requirement
+        // check threw — `0` is reserved for when applicability never resolved.
+        let applicableCount = 0;
+        try {
+            const applicableRaw = await evaluateFilterGroupsFederated(targetModels, rule.applicability.groups, {
+                limit: Number.MAX_SAFE_INTEGER,
+                signal,
+                definedModelTagIds,
+                onProgress: (done, total) => onProgress?.({ ruleIndex, phase: 'applicability', done, total }),
+            });
+            const applicable = applyExactClassFilter(applicableRaw, exactClassRulesOf(rule.applicability), storesById, opts);
+            applicableCount = applicable.length;
+            const cardinalityResult = checkCardinality(rule.cardinality, applicableCount);
+            let outcome;
+            switch (rule.requirement.kind) {
+                case 'element': {
+                    const entityResults = await runElementRequirement(rule.id, rule.requirement.block, applicable, storesById, opts, ruleIndex, signal, onProgress);
+                    outcome = { entityResults };
+                    break;
+                }
+                case 'unique':
+                    outcome = await checkUnique(rule.id, rule.requirement, applicable, storesById, opts, ruleIndex, signal, onProgress);
+                    break;
+                case 'aggregate':
+                    outcome = await checkAggregate(rule.id, rule.requirement, applicable, storesById, targetModels, opts, ruleIndex, signal, onProgress);
+                    break;
+                case 'compare':
+                    outcome = await checkCompare(rule.id, rule.requirement, applicable, storesById, opts, ruleIndex, signal, onProgress);
+                    break;
+                case 'unit':
+                    outcome = await checkUnit(rule.id, rule.requirement, applicable, storesById, ruleIndex, signal, onProgress);
+                    break;
+            }
+            specificationResults.push(finalizeSpecification(rule, applicableCount, cardinalityResult, outcome));
+        }
+        catch (err) {
+            if (err instanceof DOMException && err.name === 'AbortError')
+                throw err;
+            const message = err instanceof Error ? err.message : String(err);
+            specificationResults.push(finalizeSpecification(rule, applicableCount, undefined, { entityResults: [] }, message));
+        }
+    }
+    return {
+        source: { kind: 'rules', ruleSet: { name: ruleSet.name, description: ruleSet.description } },
+        modelInfo,
+        timestamp: new Date(),
+        summary: calculateSummary(specificationResults),
+        specificationResults,
+    };
+}
+//# sourceMappingURL=rule-engine.js.map

package/dist/engine/rule-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-engine.js","sourceRoot":"","sources":["../../src/engine/rule-engine.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAe/D,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EACL,gBAAgB,GAMjB,MAAM,eAAe,CAAC;AAGvB,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,6BAA6B,EAAE,MAAM,qCAAqC,CAAC;AAEpF,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC;AAGhE,OAAO,EAAE,qBAAqB,EAAuB,MAAM,+BAA+B,CAAC;AAC3F,OAAO,EAAE,cAAc,EAAE,WAAW,EAAwB,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,aAAa,EAA2B,MAAM,wBAAwB,CAAC;AAmBjG;;0CAE0C;AAC1C,MAAM,UAAU,mBAAmB,CAAC,MAAqC,EAAE,OAAmC;IAC5G,MAAM,YAAY,GAAG,OAAO,EAAE,iBAAiB,IAAI,EAAE,CAAC;IACtD,MAAM,MAAM,GAAG,OAAO,EAAE,WAAW,IAAI,EAAE,CAAC;IAC1C,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACzB,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,cAAc,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;YAAE,OAAO,IAAI,CAAC;QACjG,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM;gBAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,IAAI,CAAC;QAC1F,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,MAAiC;IACvD,MAAM,GAAG,GAA0B,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,CAAC,KAAK;YAAE,SAAS;QACvB,GAAG,CAAC,IAAI,CAAC;YACP,OAAO,EAAE,CAAC,CAAC,EAAE;YACb,aAAa,EAAE,CAAC,CAAC,KAAK,CAAC,aAAa,IAAI,MAAM;YAC9C,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK;SAC3D,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;8DAM8D;AAC9D,SAAS,iBAAiB,CAAC,KAAgB;IACzC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,qBAAqB,CAC5B,QAAoC,EACpC,KAA6B,EAC7B,UAA6C,EAC7C,IAAoB;IAEpB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC7C,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE;QAC5B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;QAC1D,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CACvB,WAA2C,EAC3C,KAAa;IAEb,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,aAAa,KAAK,SAAS,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,CAAC,EAAE,CAAC;QACzG,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC;QACjF,MAAM,GAAG,KAAK,CAAC;QACf,QAAQ,CAAC,IAAI,CAAC,qBAAqB,WAAW,CAAC,aAAa,WAAW,KAAK,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC;QACjF,MAAM,GAAG,KAAK,CAAC;QACf,QAAQ,CAAC,IAAI,CAAC,oBAAoB,WAAW,CAAC,aAAa,WAAW,KAAK,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,OAAO;QACL,MAAM;QACN,WAAW,EAAE,KAAK;QAClB,WAAW,EAAE,WAAW,CAAC,aAAa;QACtC,WAAW,EAAE,WAAW,CAAC,aAAa;QACtC,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,uBAAuB;KAC7E,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,qBAAqB,CAClC,MAAc,EACd,KAAgB,EAChB,UAAsC,EACtC,UAA6C,EAC7C,IAAoB,EACpB,SAAiB,EACjB,MAA+B,EAC/B,UAAyD;IAEzD,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,KAAK;YAAE,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3E,MAAM,eAAe,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACjF,CAAC;IACD,aAAa,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAChE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,qBAAqB,CAC5B,IAAqB,EACrB,eAAuB,EACvB,iBAAmD,EACnD,OAAwB,EACxB,KAAc;IAEd,MAAM,aAAa,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;IACtF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,gEAAgE;QAChE,oEAAoE;QACpE,+DAA+D;QAC/D,OAAO;YACL,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;YAC3F,aAAa,EAAE,EAAE,EAAE,KAAK;SACzB,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC7E,MAAM,cAAc,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC5E,MAAM,QAAQ,GAAG,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAEnE,gFAAgF;IAChF,uEAAuE;IACvE,0EAA0E;IAC1E,wEAAwE;IACxE,sEAAsE;IACtE,EAAE;IACF,uEAAuE;IACvE,yEAAyE;IACzE,sEAAsE;IACtE,yEAAyE;IACzE,gEAAgE;IAChE,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,SAAS;WAC9F,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,CAAC;IACtC,MAAM,WAAW,GAAG,OAAO,CAAC,kBAAkB,IAAI,cAAc,CAAC;IACjE,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,GAAG,WAAW,CAAC,CAAC;IAEnG,MAAM,OAAO,GAAG,WAAW,GAAG,CAAC,IAAI,QAAQ,IAAI,iBAAiB,EAAE,MAAM,KAAK,KAAK,CAAC;IACnF,wEAAwE;IACxE,2EAA2E;IAC3E,MAAM,MAAM,GAAkC,eAAe,KAAK,CAAC;QACjE,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,KAAK,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC;QAC7H,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAChC,2EAA2E;IAC3E,4EAA4E;IAC5E,mEAAmE;IACnE,yEAAyE;IACzE,uEAAuE;IACvE,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,eAAe,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAClG,MAAM,QAAQ,GAAG,MAAM,KAAK,MAAM,IAAI,WAAW,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAE5E,OAAO;QACL,aAAa,EAAE,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ;QAC1E,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,iBAAiB;QACjB,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,mBAAmB,EAAE,OAAO,CAAC,mBAAmB;KACjD,CAAC;AACJ,CAAC;AAED;;;mCAGmC;AACnC,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAA0B;IACzD,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAC5E,MAAM,YAAY,GAAG,mBAAmB,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,YAAY;QAAE,IAAI,CAAC,CAAC,KAAK;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACzE,MAAM,SAAS,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;IAE/C,2EAA2E;IAC3E,wEAAwE;IACxE,wEAAwE;IACxE,uEAAuE;IACvE,sEAAsE;IACtE,wEAAwE;IACxE,wEAAwE;IACxE,sEAAsE;IACtE,gEAAgE;IAChE,wEAAwE;IACxE,MAAM,eAAe,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,iBAAiB,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACjI,MAAM,iBAAiB,GAAG,eAAe,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;IAEvE,MAAM,oBAAoB,GAA0B,EAAE,CAAC;IACvD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC;QACtE,IAAI,MAAM,EAAE,OAAO;YAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,IAAI,GAAmB,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE,CAAC;QAE9G,IAAI,iBAAiB,EAAE,CAAC;YACtB,oBAAoB,CAAC,IAAI,CAAC,qBAAqB,CAC7C,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,EAAE,8CAA8C,CAC1F,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,0EAA0E;QAC1E,qEAAqE;QACrE,uEAAuE;QACvE,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,6BAA6B,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE;gBACjG,KAAK,EAAE,MAAM,CAAC,gBAAgB;gBAC9B,MAAM;gBACN,kBAAkB;gBAClB,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;aAC9F,CAAC,CAAC;YACH,MAAM,UAAU,GAAG,qBAAqB,CAAC,aAAa,EAAE,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YACjH,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;YACpC,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;YAE9E,IAAI,OAAwB,CAAC;YAC7B,QAAQ,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;gBAC9B,KAAK,SAAS,CAAC,CAAC,CAAC;oBACf,MAAM,aAAa,GAAG,MAAM,qBAAqB,CAC/C,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAC7F,CAAC;oBACF,OAAO,GAAG,EAAE,aAAa,EAAE,CAAC;oBAC5B,MAAM;gBACR,CAAC;gBACD,KAAK,QAAQ;oBACX,OAAO,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;oBACpH,MAAM;gBACR,KAAK,WAAW;oBACd,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;oBACrI,MAAM;gBACR,KAAK,SAAS;oBACZ,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;oBACrH,MAAM;gBACR,KAAK,MAAM;oBACT,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;oBAC5G,MAAM;YACV,CAAC;YAED,oBAAoB,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,eAAe,EAAE,iBAAiB,EAAE,OAAO,CAAC,CAAC,CAAC;QACtG,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,YAAY,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,GAAG,CAAC;YACxE,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,oBAAoB,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,eAAe,EAAE,SAAS,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QACrH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,EAAE;QAC5F,SAAS;QACT,SAAS,EAAE,IAAI,IAAI,EAAE;QACrB,OAAO,EAAE,gBAAgB,CAAC,oBAAoB,CAAC;QAC/C,oBAAoB;KACrB,CAAC;AACJ,CAAC"}

package/dist/filter/effective-filter-fields.d.ts

@@ -0,0 +1,13 @@
+import { type EffectiveEntityRecord, type IfcDataStore } from '@ifc-lite/parser';
+import type { MutablePropertyView } from '@ifc-lite/mutations';
+import type { FilteredElement } from './filter-evaluate.js';
+export interface EffectiveFilterFields {
+    ifcType: string;
+    name: string | undefined;
+    globalId: string;
+}
+export declare function createdFilterRecord(store: IfcDataStore, view: MutablePropertyView | undefined, expressId: number): EffectiveEntityRecord | null;
+/** The same class and root values export will write for a live filter result. */
+export declare function effectiveFilterFields(store: IfcDataStore, view: MutablePropertyView | undefined, expressId: number): EffectiveFilterFields;
+export declare function buildFilterResult(modelId: string, expressId: number, fields: EffectiveFilterFields): FilteredElement;
+//# sourceMappingURL=effective-filter-fields.d.ts.map

package/dist/filter/effective-filter-fields.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"effective-filter-fields.d.ts","sourceRoot":"","sources":["../../src/filter/effective-filter-fields.ts"],"names":[],"mappings":"AAIA,OAAO,EAAsD,KAAK,qBAAqB,EAAE,KAAK,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACrI,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAE5D,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,mBAAmB,GAAG,SAAS,EACrC,SAAS,EAAE,MAAM,GAChB,qBAAqB,GAAG,IAAI,CAQ9B;AAED,iFAAiF;AACjF,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,YAAY,EACnB,IAAI,EAAE,mBAAmB,GAAG,SAAS,EACrC,SAAS,EAAE,MAAM,GAChB,qBAAqB,CAmBvB;AAED,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,GAAG,eAAe,CAQpH"}

package/dist/filter/effective-filter-fields.js

@@ -0,0 +1,44 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { normalizeIfcTypeName, resolveEffectiveEntityRecord } from '@ifc-lite/parser';
+export function createdFilterRecord(store, view, expressId) {
+    const created = view?.getNewEntity(expressId);
+    if (!created || !view)
+        return null;
+    return resolveEffectiveEntityRecord(created, {
+        retype: view.getEntityTypeMutation(expressId)?.newType,
+        named: view.getAttributeMutationsForEntity(expressId).map(({ name, value }) => [name, value]),
+        positional: view.getPositionalMutationsForEntity(expressId) ?? [],
+    }, store.schemaVersion);
+}
+/** The same class and root values export will write for a live filter result. */
+export function effectiveFilterFields(store, view, expressId) {
+    const record = createdFilterRecord(store, view, expressId);
+    if (record) {
+        const value = (name) => {
+            const index = record.names.indexOf(name);
+            const raw = index < 0 ? undefined : record.attributes[index];
+            return typeof raw === 'string' && raw !== '$' ? raw : undefined;
+        };
+        return { ifcType: record.type, name: value('Name'), globalId: value('GlobalId') ?? '' };
+    }
+    const retype = view?.getEntityTypeMutation(expressId)?.newType;
+    const edits = view?.getAttributeMutationsForEntity(expressId);
+    const edited = (name) => edits?.find((entry) => entry.name === name)?.value;
+    return {
+        ifcType: retype ? normalizeIfcTypeName(retype) : store.entities.getTypeName(expressId),
+        name: edited('Name') ?? store.entities.getNameOrUndefined(expressId),
+        globalId: edited('GlobalId') ?? store.entities.getGlobalId(expressId),
+    };
+}
+export function buildFilterResult(modelId, expressId, fields) {
+    return {
+        modelId,
+        expressId,
+        ifcType: fields.ifcType,
+        name: fields.name ?? '',
+        globalId: fields.globalId,
+    };
+}
+//# sourceMappingURL=effective-filter-fields.js.map

package/dist/filter/effective-filter-fields.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"effective-filter-fields.js","sourceRoot":"","sources":["../../src/filter/effective-filter-fields.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,oBAAoB,EAAE,4BAA4B,EAAiD,MAAM,kBAAkB,CAAC;AAUrI,MAAM,UAAU,mBAAmB,CACjC,KAAmB,EACnB,IAAqC,EACrC,SAAiB;IAEjB,MAAM,OAAO,GAAG,IAAI,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;IAC9C,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO,4BAA4B,CAAC,OAAO,EAAE;QAC3C,MAAM,EAAE,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,EAAE,OAAO;QACtD,KAAK,EAAE,IAAI,CAAC,8BAA8B,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAU,CAAC;QACtG,UAAU,EAAE,IAAI,CAAC,+BAA+B,CAAC,SAAS,CAAC,IAAI,EAAE;KAClE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;AAC1B,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,qBAAqB,CACnC,KAAmB,EACnB,IAAqC,EACrC,SAAiB;IAEjB,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IAC3D,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,KAAK,GAAG,CAAC,IAAY,EAAsB,EAAE;YACjD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC7D,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,CAAC,CAAC;QACF,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;IAC1F,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,EAAE,qBAAqB,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,EAAE,8BAA8B,CAAC,SAAS,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,CAAC,IAAY,EAAsB,EAAE,CAClD,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,KAAK,CAAC;IACrD,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC;QACtF,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,kBAAkB,CAAC,SAAS,CAAC;QACpE,QAAQ,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC;KACtE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,OAAe,EAAE,SAAiB,EAAE,MAA6B;IACjG,OAAO;QACL,OAAO;QACP,SAAS;QACT,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE;QACvB,QAAQ,EAAE,MAAM,CAAC,QAAQ;KAC1B,CAAC;AACJ,CAAC"}

package/dist/filter/entity-predefined-type.d.ts

@@ -0,0 +1,24 @@
+import { type IfcDataStore } from '@ifc-lite/parser';
+/**
+ * Pick the `PredefinedType` value out of the schema-named attribute pairs
+ * returned by {@link extractAllEntityAttributes}. The extractor already strips
+ * the STEP enum markers (`.FLOOR.` → `FLOOR`), so this returns the display
+ * token (e.g. `"FLOOR"`, `"FLOORING"`, `"USERDEFINED"`, `"NOTDEFINED"`).
+ * Returns `undefined` when the slot is absent or empty so callers can ghost /
+ * skip elements that carry no PredefinedType.
+ */
+export declare function pickPredefinedType(attrs: ReadonlyArray<{
+    name: string;
+    value: string | number | boolean;
+}>): string | undefined;
+/**
+ * Resolve an entity's IFC `PredefinedType` (e.g. `IfcSlab.FLOOR`,
+ * `IfcCovering.FLOORING`) from the source buffer. Schema-driven, so it works
+ * for any product type whose attribute layout the registry knows. (#1364)
+ *
+ * Like `Tag` and the property / quantity auto-color sources, this re-parses
+ * the entity on demand — there is no columnar PredefinedType accessor — which
+ * is the same cost class as those existing per-entity attribute reads.
+ */
+export declare function resolveEntityPredefinedType(store: IfcDataStore, expressId: number): string | undefined;
+//# sourceMappingURL=entity-predefined-type.d.ts.map

package/dist/filter/entity-predefined-type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-predefined-type.d.ts","sourceRoot":"","sources":["../../src/filter/entity-predefined-type.ts"],"names":[],"mappings":"AAIA,OAAO,EAA8B,KAAK,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEjF;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,aAAa,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAA;CAAE,CAAC,GACvE,MAAM,GAAG,SAAS,CAKpB;AAED;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,YAAY,EACnB,SAAS,EAAE,MAAM,GAChB,MAAM,GAAG,SAAS,CAGpB"}

package/dist/filter/entity-predefined-type.js

@@ -0,0 +1,34 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { extractAllEntityAttributes } from '@ifc-lite/parser';
+/**
+ * Pick the `PredefinedType` value out of the schema-named attribute pairs
+ * returned by {@link extractAllEntityAttributes}. The extractor already strips
+ * the STEP enum markers (`.FLOOR.` → `FLOOR`), so this returns the display
+ * token (e.g. `"FLOOR"`, `"FLOORING"`, `"USERDEFINED"`, `"NOTDEFINED"`).
+ * Returns `undefined` when the slot is absent or empty so callers can ghost /
+ * skip elements that carry no PredefinedType.
+ */
+export function pickPredefinedType(attrs) {
+    const entry = attrs.find((a) => a.name === 'PredefinedType');
+    if (!entry)
+        return undefined;
+    const value = String(entry.value).trim();
+    return value.length > 0 ? value : undefined;
+}
+/**
+ * Resolve an entity's IFC `PredefinedType` (e.g. `IfcSlab.FLOOR`,
+ * `IfcCovering.FLOORING`) from the source buffer. Schema-driven, so it works
+ * for any product type whose attribute layout the registry knows. (#1364)
+ *
+ * Like `Tag` and the property / quantity auto-color sources, this re-parses
+ * the entity on demand — there is no columnar PredefinedType accessor — which
+ * is the same cost class as those existing per-entity attribute reads.
+ */
+export function resolveEntityPredefinedType(store, expressId) {
+    if (!(store.source?.length > 0) || !store.entityIndex)
+        return undefined;
+    return pickPredefinedType(extractAllEntityAttributes(store, expressId));
+}
+//# sourceMappingURL=entity-predefined-type.js.map

package/dist/filter/entity-predefined-type.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-predefined-type.js","sourceRoot":"","sources":["../../src/filter/entity-predefined-type.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,0BAA0B,EAAqB,MAAM,kBAAkB,CAAC;AAEjF;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAwE;IAExE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC;IAC7D,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC9C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAmB,EACnB,SAAiB;IAEjB,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IACxE,OAAO,kBAAkB,CAAC,0BAA0B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;AAC1E,CAAC"}

package/dist/filter/filter-evaluate-groups.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Group evaluation (OR-of-AND-groups, #4904).
+ *
+ * Split out of `filter-evaluate.ts` (allowlisted at 583 lines,
+ * `scripts/module-size-allowlist.txt`) rather than grown in place — the
+ * ratchet forbids a listed file growing, and this needs its own home
+ * regardless: it's the one seam where "groups" become a second concern
+ * layered on top of the single-list evaluator, not a change to it.
+ *
+ * A `FilterGroup[]` ORs its groups together; within each group, the group's
+ * own `combinator` still governs (mirrors the selector's `+`: AND within a
+ * group, OR across groups). Rather than desugar this into a full-scan pass
+ * over some merged rule list — a second matching path that could not answer
+ * "why did this match" per-group, and could not be saved — each group is run
+ * through the EXACT SAME per-entity evaluator as a single-group query
+ * (`evaluateFilterRules(Federated)`), one call per group, unioned by
+ * (modelId, expressId). A single group (the overwhelmingly common case,
+ * and every query before #4904) takes this function's fast path straight
+ * through to the existing single-list evaluator with zero extra overhead.
+ *
+ * This also means the AND+`op:in` index prefilter is NOT lost for
+ * multi-group queries: each group still gets its own prefilter via
+ * `selectIterationSource`, same as it would running alone. Measured on
+ * `tests/models/buildingsmart/Building-Architecture.ifc` (the largest
+ * fixture available on this host; see the PR body for the exact numbers) —
+ * a two-group union costs about the sum of the two single-group runs, not a
+ * full-scan multiple of it.
+ */
+import type { IfcDataStore } from '@ifc-lite/parser';
+import type { FilterGroup } from './filter-groups.js';
+import { type EvaluateOptions, type FederatedEvaluateOptions, type FilteredElement, type EvaluatorModel } from './filter-evaluate.js';
+/** Sync entry — small candidate sets, tests. Mirrors `evaluateFilterRules`. */
+export declare function evaluateFilterGroups(modelId: string, store: IfcDataStore, groups: readonly FilterGroup[], options?: EvaluateOptions): FilteredElement[];
+/** Async federated entry — production UI path. Mirrors `evaluateFilterRulesFederated`. */
+export declare function evaluateFilterGroupsFederated(models: ReadonlyArray<EvaluatorModel>, groups: readonly FilterGroup[], options?: FederatedEvaluateOptions): Promise<FilteredElement[]>;
+//# sourceMappingURL=filter-evaluate-groups.d.ts.map

package/dist/filter/filter-evaluate-groups.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-evaluate-groups.d.ts","sourceRoot":"","sources":["../../src/filter/filter-evaluate-groups.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAGL,KAAK,eAAe,EACpB,KAAK,wBAAwB,EAC7B,KAAK,eAAe,EACpB,KAAK,cAAc,EACpB,MAAM,sBAAsB,CAAC;AAQ9B,+EAA+E;AAC/E,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,OAAO,GAAE,eAAoB,GAC5B,eAAe,EAAE,CAkCnB;AAED,0FAA0F;AAC1F,wBAAsB,6BAA6B,CACjD,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,EACrC,MAAM,EAAE,SAAS,WAAW,EAAE,EAC9B,OAAO,GAAE,wBAA6B,GACrC,OAAO,CAAC,eAAe,EAAE,CAAC,CAsD5B"}

package/dist/filter/filter-evaluate-groups.js

@@ -0,0 +1,111 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { evaluateFilterRules, evaluateFilterRulesFederated, } from './filter-evaluate.js';
+const DEFAULT_LIMIT = 5_000;
+function groupKey(el) {
+    return `${el.modelId}:${el.expressId}`;
+}
+/** Sync entry — small candidate sets, tests. Mirrors `evaluateFilterRules`. */
+export function evaluateFilterGroups(modelId, store, groups, options = {}) {
+    if (groups.length === 0)
+        return [];
+    if (groups.length === 1) {
+        return evaluateFilterRules(modelId, store, groups[0].rules, groups[0].combinator, options);
+    }
+    const limit = options.limit ?? DEFAULT_LIMIT;
+    const seen = new Set();
+    const out = [];
+    for (const group of groups) {
+        if (out.length >= limit)
+            break;
+        if (group.rules.length === 0)
+            continue;
+        // Each group's OWN cap is the full `limit`, not `limit - out.length` —
+        // review (PR #4987) caught that a shrinking per-group cap can underfill
+        // the union: if THIS group's first N matches all duplicate ones an
+        // earlier group already returned, capping it at the (small) remaining
+        // budget stops the scan before its later, actually-unique matches are
+        // ever reached. The outer `out.length >= limit` check above still skips
+        // whole groups once the union is already full, and the inner loop below
+        // still stops appending once it is; the only change is that a later
+        // group may now be asked to find more candidates than strictly remain,
+        // which costs some extra scanning but never drops a real match.
+        const groupOut = evaluateFilterRules(modelId, store, group.rules, group.combinator, {
+            ...options,
+            limit,
+        });
+        for (const el of groupOut) {
+            const key = groupKey(el);
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            out.push(el);
+            if (out.length >= limit)
+                break;
+        }
+    }
+    return out;
+}
+/** Async federated entry — production UI path. Mirrors `evaluateFilterRulesFederated`. */
+export async function evaluateFilterGroupsFederated(models, groups, options = {}) {
+    if (groups.length === 0)
+        return [];
+    if (groups.length === 1) {
+        return evaluateFilterRulesFederated(models, groups[0].rules, groups[0].combinator, options);
+    }
+    const limit = options.limit ?? DEFAULT_LIMIT;
+    const seen = new Set();
+    const out = [];
+    // A single-use candidate iterable (a generator, say) would be exhausted
+    // by the first group's call and come back empty for every later one —
+    // review (PR #4987). Materialize each model's candidates ONCE, up front,
+    // so every group's `evaluateFilterRulesFederated` call gets its own fresh
+    // pass over the same (now-array) candidate set.
+    const candidatesByModel = options.candidateExpressIdsByModel
+        ? new Map([...options.candidateExpressIdsByModel].map(([id, c]) => [id, [...c]]))
+        : undefined;
+    // Accumulate `scanned` ACROSS groups rather than handing each group's raw
+    // per-group progress straight through — review (PR #4987) caught that
+    // without this, a multi-group run's progress bar reached 100% at the end
+    // of group 1 and then reset to 0% when group 2 started. `total` is
+    // reported as -1 (unknown) for the whole multi-group run: the UI's own
+    // progress renderer already has an unknown-total mode (a plain "scanned
+    // N" count, no bar) for exactly this case, rather than a bar this
+    // function would otherwise have to guess a cross-group total for.
+    let scannedSoFar = 0;
+    for (const group of groups) {
+        if (out.length >= limit)
+            break;
+        if (group.rules.length === 0)
+            continue;
+        let lastGroupScanned = 0;
+        // See the sync entry above (`evaluateFilterGroups`) for why this is
+        // `limit`, not `limit - out.length`: a shrinking per-group cap can
+        // underfill the union when a later group's early matches duplicate an
+        // earlier group's.
+        const groupOut = await evaluateFilterRulesFederated(models, group.rules, group.combinator, {
+            ...options,
+            candidateExpressIdsByModel: candidatesByModel,
+            limit,
+            onProgress: options.onProgress
+                ? (scanned) => {
+                    lastGroupScanned = scanned;
+                    options.onProgress(scannedSoFar + scanned, -1);
+                }
+                : undefined,
+        });
+        scannedSoFar += lastGroupScanned;
+        for (const el of groupOut) {
+            const key = groupKey(el);
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            out.push(el);
+            if (out.length >= limit)
+                break;
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=filter-evaluate-groups.js.map

package/dist/filter/filter-evaluate-groups.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-evaluate-groups.js","sourceRoot":"","sources":["../../src/filter/filter-evaluate-groups.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAiC/D,OAAO,EACL,mBAAmB,EACnB,4BAA4B,GAK7B,MAAM,sBAAsB,CAAC;AAE9B,MAAM,aAAa,GAAG,KAAK,CAAC;AAE5B,SAAS,QAAQ,CAAC,EAAmB;IACnC,OAAO,GAAG,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,SAAS,EAAE,CAAC;AACzC,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,oBAAoB,CAClC,OAAe,EACf,KAAmB,EACnB,MAA8B,EAC9B,UAA2B,EAAE;IAE7B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC7F,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;QAC/B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACvC,uEAAuE;QACvE,wEAAwE;QACxE,mEAAmE;QACnE,sEAAsE;QACtE,sEAAsE;QACtE,wEAAwE;QACxE,wEAAwE;QACxE,oEAAoE;QACpE,uEAAuE;QACvE,gEAAgE;QAChE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE;YAClF,GAAG,OAAO;YACV,KAAK;SACN,CAAC,CAAC;QACH,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACjC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0FAA0F;AAC1F,MAAM,CAAC,KAAK,UAAU,6BAA6B,CACjD,MAAqC,EACrC,MAA8B,EAC9B,UAAoC,EAAE;IAEtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,4BAA4B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,wEAAwE;IACxE,sEAAsE;IACtE,yEAAyE;IACzE,0EAA0E;IAC1E,gDAAgD;IAChD,MAAM,iBAAiB,GAAG,OAAO,CAAC,0BAA0B;QAC1D,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,0BAA0B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAU,CAAC,CAAC;QAC1F,CAAC,CAAC,SAAS,CAAC;IACd,0EAA0E;IAC1E,sEAAsE;IACtE,yEAAyE;IACzE,mEAAmE;IACnE,uEAAuE;IACvE,wEAAwE;IACxE,kEAAkE;IAClE,kEAAkE;IAClE,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;QAC/B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACvC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,oEAAoE;QACpE,mEAAmE;QACnE,sEAAsE;QACtE,mBAAmB;QACnB,MAAM,QAAQ,GAAG,MAAM,4BAA4B,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAE;YACzF,GAAG,OAAO;YACV,0BAA0B,EAAE,iBAAiB;YAC7C,KAAK;YACL,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC5B,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE;oBACV,gBAAgB,GAAG,OAAO,CAAC;oBAC3B,OAAO,CAAC,UAAW,CAAC,YAAY,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC;gBACH,CAAC,CAAC,SAAS;SACd,CAAC,CAAC;QACH,YAAY,IAAI,gBAAgB,CAAC;QACjC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,IAAI,GAAG,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACjC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/filter/filter-evaluate-model-tag.d.ts

@@ -0,0 +1,22 @@
+import type { FilterRule, ModelRule, ModelTagRule } from './filter-rules.js';
+/** What a model-scoped rule needs to know about one model. */
+export interface ModelScope {
+    /** Stable source identity compared by `ModelRule` (`sourceFingerprint`, else the id). */
+    filterIdentity: string;
+    /** The model's tag ids; absent = untagged. */
+    tagIds?: ReadonlySet<string>;
+    /** Every tag id that currently exists — a rule naming any other id is unresolved. */
+    definedModelTagIds: ReadonlySet<string>;
+}
+export type ModelScopedRule = ModelRule | ModelTagRule;
+export declare function isModelScopedRule(rule: FilterRule): rule is ModelScopedRule;
+export declare function modelScopedRuleMatches(rule: ModelScopedRule, scope: ModelScope): boolean;
+/**
+ * Under AND, may this model be skipped outright? True when some model-scoped
+ * rule fails for it. Under OR the answer is always `false`: the entity-level
+ * rules on the other side of the OR can still admit its entities.
+ */
+export declare function modelPrunedUnderAnd(rules: readonly FilterRule[], scope: ModelScope): boolean;
+/** Empty set for callers that know of no tags (single-model tests, adapters without a tag store). */
+export declare const NO_MODEL_TAGS: ReadonlySet<string>;
+//# sourceMappingURL=filter-evaluate-model-tag.d.ts.map

package/dist/filter/filter-evaluate-model-tag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-evaluate-model-tag.d.ts","sourceRoot":"","sources":["../../src/filter/filter-evaluate-model-tag.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAE7E,8DAA8D;AAC9D,MAAM,WAAW,UAAU;IACzB,yFAAyF;IACzF,cAAc,EAAE,MAAM,CAAC;IACvB,8CAA8C;IAC9C,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7B,qFAAqF;IACrF,kBAAkB,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,YAAY,CAAC;AAEvD,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,IAAI,eAAe,CAE3E;AAED,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAGxF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAE5F;AAED,qGAAqG;AACrG,eAAO,MAAM,aAAa,EAAE,WAAW,CAAC,MAAM,CAAa,CAAC"}

package/dist/filter/filter-evaluate-model-tag.js

@@ -0,0 +1,35 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * The MODEL-SCOPED rule arm of the evaluator (`filter-evaluate.ts`): `model`
+ * and `modelTag` (#4215) are decided by the owning model alone, never by the
+ * entity, so one answer per model serves every entity in it.
+ *
+ * Used twice, by design: as the per-entity arm (so OR keeps its boolean
+ * meaning — a model failing the tag condition still contributes entities that
+ * pass the other side of the OR) and as the whole-model prune under AND (a
+ * model that fails any model-scoped rule can contribute no entity, so its scan
+ * is skipped). Same function both times, so the two cannot disagree.
+ */
+import { modelTagRuleMatches } from './model-tag.js';
+import { setOpMatches } from './filter-ops.js';
+export function isModelScopedRule(rule) {
+    return rule.kind === 'model' || rule.kind === 'modelTag';
+}
+export function modelScopedRuleMatches(rule, scope) {
+    if (rule.kind === 'model')
+        return setOpMatches(rule.op, scope.filterIdentity, rule.values);
+    return modelTagRuleMatches(rule.op, rule.tagIds, scope.tagIds, scope.definedModelTagIds);
+}
+/**
+ * Under AND, may this model be skipped outright? True when some model-scoped
+ * rule fails for it. Under OR the answer is always `false`: the entity-level
+ * rules on the other side of the OR can still admit its entities.
+ */
+export function modelPrunedUnderAnd(rules, scope) {
+    return rules.some((rule) => isModelScopedRule(rule) && !modelScopedRuleMatches(rule, scope));
+}
+/** Empty set for callers that know of no tags (single-model tests, adapters without a tag store). */
+export const NO_MODEL_TAGS = new Set();
+//# sourceMappingURL=filter-evaluate-model-tag.js.map

package/dist/filter/filter-evaluate-model-tag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-evaluate-model-tag.js","sourceRoot":"","sources":["../../src/filter/filter-evaluate-model-tag.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAe/C,MAAM,UAAU,iBAAiB,CAAC,IAAgB;IAChD,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,IAAqB,EAAE,KAAiB;IAC7E,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3F,OAAO,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAC3F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAA4B,EAAE,KAAiB;IACjF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/F,CAAC;AAED,qGAAqG;AACrG,MAAM,CAAC,MAAM,aAAa,GAAwB,IAAI,GAAG,EAAE,CAAC"}