@proposit/proposit-core 2.3.1 → 2.4.1

package/dist/lib/core/expression-manager-checks.js

@@ -0,0 +1,355 @@
+const PERMITTED_OPERATOR_SWAPS = {
+    and: "or",
+    or: "and",
+    implies: "iff",
+    iff: "implies",
+};
+/**
+ * Validates the preconditions for `ExpressionManager.insertExpression`
+ * (existence, arity, and root-only-operator rules) and returns the anchor
+ * slot the new expression inherits.
+ *
+ * @throws Under the same conditions documented on `insertExpression`.
+ */
+export function validateInsertExpression(expression, leftNodeId, rightNodeId, expressions) {
+    // 1. At least one child node must be provided.
+    if (leftNodeId === undefined && rightNodeId === undefined) {
+        throw new Error(`insertExpression requires at least one of leftNodeId or rightNodeId.`);
+    }
+    // 2. The new expression's ID must not already exist.
+    if (expressions.has(expression.id)) {
+        throw new Error(`Expression with ID "${expression.id}" already exists.`);
+    }
+    // 3. An expression cannot be its own parent.
+    if (expression.parentId === expression.id) {
+        throw new Error(`Expression "${expression.id}" cannot be its own parent.`);
+    }
+    // 4. Left and right nodes must be distinct.
+    if (leftNodeId !== undefined &&
+        rightNodeId !== undefined &&
+        leftNodeId === rightNodeId) {
+        throw new Error(`leftNodeId and rightNodeId must be different.`);
+    }
+    // 5. The left node must exist if provided.
+    // Cast to base TExpressionInput for validation access — deferred conditional
+    // types (TExpressionInput<TExpr>) cannot be narrowed by TS control flow.
+    const leftNode = leftNodeId !== undefined
+        ? expressions.get(leftNodeId)
+        : undefined;
+    if (leftNodeId !== undefined && !leftNode) {
+        throw new Error(`Expression "${leftNodeId}" does not exist.`);
+    }
+    // 6. The right node must exist if provided.
+    const rightNode = rightNodeId !== undefined
+        ? expressions.get(rightNodeId)
+        : undefined;
+    if (rightNodeId !== undefined && !rightNode) {
+        throw new Error(`Expression "${rightNodeId}" does not exist.`);
+    }
+    // 7a. A variable expression cannot have children.
+    if (expression.type === "variable") {
+        throw new Error(`Variable expression "${expression.id}" cannot have children.`);
+    }
+    // 7. The "not" operator is unary and cannot take two children.
+    if (expression.type === "operator" &&
+        expression.operator === "not" &&
+        leftNodeId !== undefined &&
+        rightNodeId !== undefined) {
+        throw new Error(`Operator expression "${expression.id}" with "not" can only have one child.`);
+    }
+    // 7b. A formula expression is also unary and cannot take two children.
+    if (expression.type === "formula" &&
+        leftNodeId !== undefined &&
+        rightNodeId !== undefined) {
+        throw new Error(`Formula expression "${expression.id}" can only have one child.`);
+    }
+    // 8. The left node must not be an implies/iff expression (which must remain a root).
+    if (leftNode?.type === "operator" &&
+        (leftNode.operator === "implies" || leftNode.operator === "iff")) {
+        throw new Error(`Expression "${leftNodeId}" with "${leftNode.operator}" cannot be subordinated (it must remain a root expression).`);
+    }
+    // 9. The right node must not be an implies/iff expression (which must remain a root).
+    if (rightNode?.type === "operator" &&
+        (rightNode.operator === "implies" || rightNode.operator === "iff")) {
+        throw new Error(`Expression "${rightNodeId}" with "${rightNode.operator}" cannot be subordinated (it must remain a root expression).`);
+    }
+    // The anchor is the node whose current tree slot the new expression will inherit.
+    const anchor = (leftNode ?? rightNode);
+    // 10. implies/iff expressions may only be inserted at the root of the tree.
+    if (expression.type === "operator" &&
+        (expression.operator === "implies" || expression.operator === "iff") &&
+        anchor.parentId !== null) {
+        throw new Error(`Operator expression "${expression.id}" with "${expression.operator}" must be a root expression (parentId must be null).`);
+    }
+    // The pre-v1.0 P-1 inline buffer-insertion / throw branches
+    // (gated on `grammarConfig.enforceFormulaBetweenOperators` +
+    // `resolveAutoNormalize(_, 'wrapInsertFormula')`) for three
+    // sites — (1) new expression as child of anchor's parent;
+    // (2) left node as child of new expression; (3) right node as
+    // child of new expression — were deleted. AN-1 (post-mutation
+    // hook in assistive mode) inserts the buffer when any of these
+    // sites produces a non-not operator under operator;
+    // permissive mode leaves the un-buffered state and
+    // `validate('presentable')` flags it.
+    return { anchorParentId: anchor.parentId, anchorPosition: anchor.position };
+}
+/**
+ * Validates the preconditions for `ExpressionManager.wrapExpression`
+ * (existence, arity, and root-only-operator rules) and returns the existing
+ * node's ID plus the anchor slot the operator inherits.
+ *
+ * @throws Under the same conditions documented on `wrapExpression`.
+ */
+export function validateWrapExpression(operator, newSibling, leftNodeId, rightNodeId, expressions) {
+    // 1. Exactly one of leftNodeId / rightNodeId must be provided.
+    if (leftNodeId === undefined && rightNodeId === undefined) {
+        throw new Error(`wrapExpression requires exactly one of leftNodeId or rightNodeId.`);
+    }
+    if (leftNodeId !== undefined && rightNodeId !== undefined) {
+        throw new Error(`wrapExpression requires exactly one of leftNodeId or rightNodeId, not both.`);
+    }
+    // 2. Operator expression ID must not already exist.
+    if (expressions.has(operator.id)) {
+        throw new Error(`Expression with ID "${operator.id}" already exists.`);
+    }
+    // 3. New sibling expression ID must not already exist.
+    if (expressions.has(newSibling.id)) {
+        throw new Error(`Expression with ID "${newSibling.id}" already exists.`);
+    }
+    // 4. Operator and sibling IDs must be different.
+    if (operator.id === newSibling.id) {
+        throw new Error(`Operator and sibling expression IDs must be different.`);
+    }
+    // 5. The existing node must exist.
+    const existingNodeId = (leftNodeId ?? rightNodeId);
+    const existingNode = expressions.get(existingNodeId);
+    if (!existingNode) {
+        throw new Error(`Expression "${existingNodeId}" does not exist.`);
+    }
+    // 6. Operator expression must have type "operator".
+    if (operator.type !== "operator") {
+        throw new Error(`Wrap operator expression "${operator.id}" must have type "operator", got "${operator.type}".`);
+    }
+    // 7. Operator must not be unary ("not").
+    if (operator.operator === "not") {
+        throw new Error(`Operator expression "${operator.id}" with "not" cannot wrap (it is unary and wrapping always produces two children).`);
+    }
+    // 8. implies/iff operator only allowed if existing node is at root.
+    if ((operator.operator === "implies" || operator.operator === "iff") &&
+        existingNode.parentId !== null) {
+        throw new Error(`Operator expression "${operator.id}" with "${operator.operator}" must be a root expression (parentId must be null).`);
+    }
+    // 9. Existing node must not be implies/iff (cannot be subordinated).
+    if (existingNode.type === "operator" &&
+        (existingNode.operator === "implies" || existingNode.operator === "iff")) {
+        throw new Error(`Expression "${existingNodeId}" with "${existingNode.operator}" cannot be subordinated (it must remain a root expression).`);
+    }
+    // 10. New sibling must not be implies/iff (cannot be subordinated).
+    if (newSibling.type === "operator" &&
+        (newSibling.operator === "implies" || newSibling.operator === "iff")) {
+        throw new Error(`Sibling expression "${newSibling.id}" with "${newSibling.operator}" cannot be subordinated (it must remain a root expression).`);
+    }
+    // The pre-v1.0 P-1 inline buffer-insertion / throw branches
+    // (gated on `grammarConfig.enforceFormulaBetweenOperators` +
+    // `resolveAutoNormalize(_, 'wrapInsertFormula')`) for three
+    // sites — (1) new operator as child of existing node's parent;
+    // (2) existing node as child of new operator;
+    // (3) new sibling as child of new operator — were deleted.
+    // AN-1 (post-mutation hook in assistive mode) inserts the
+    // buffer when any of these sites produces a non-not operator
+    // under operator; permissive mode leaves the un-buffered state
+    // and `validate('presentable')` flags it.
+    return {
+        existingNodeId,
+        anchorParentId: existingNode.parentId,
+        anchorPosition: existingNode.position,
+    };
+}
+/**
+ * Computes the sibling-position redistribution range for
+ * `ExpressionManager.repositionSiblings`: which contiguous run of
+ * `children` to shift, and the bounds to spread them across.
+ *
+ * @throws If neither direction has enough space to redistribute into.
+ */
+export function validateRepositionSiblings(children, leftPos, rightPos, positionConfig) {
+    const positions = children.map((c) => c.position);
+    const leftIdx = positions.indexOf(leftPos);
+    const rightIdx = positions.indexOf(rightPos);
+    // Scan left from leftIdx: expand while consecutive gaps <= 1.
+    let scanLeft;
+    let leftBound;
+    let leftCount;
+    if (leftIdx === -1) {
+        // leftPos is a boundary (positionConfig.min), not a real node.
+        scanLeft = 0;
+        leftBound = leftPos;
+        leftCount = 0;
+    }
+    else {
+        scanLeft = leftIdx;
+        while (scanLeft > 0 &&
+            positions[scanLeft] - positions[scanLeft - 1] <= 1) {
+            scanLeft--;
+        }
+        leftBound = scanLeft > 0 ? positions[scanLeft - 1] : positionConfig.min;
+        leftCount = leftIdx - scanLeft + 1;
+    }
+    // Scan right from rightIdx: expand while consecutive gaps <= 1.
+    let scanRight;
+    let rightBound;
+    let rightCount;
+    if (rightIdx === -1) {
+        // rightPos is a boundary (positionConfig.max), not a real node.
+        scanRight = positions.length - 1;
+        rightBound = rightPos;
+        rightCount = 0;
+    }
+    else {
+        scanRight = rightIdx;
+        while (scanRight < positions.length - 1 &&
+            positions[scanRight + 1] - positions[scanRight] <= 1) {
+            scanRight++;
+        }
+        rightBound =
+            scanRight < positions.length - 1
+                ? positions[scanRight + 1]
+                : positionConfig.max;
+        rightCount = scanRight - rightIdx + 1;
+    }
+    // Pick direction with fewer nodes. Tie-break: right.
+    let startIdx;
+    let endIdx;
+    let lowerBound;
+    let upperBound;
+    if (leftCount > 0 && leftCount < rightCount) {
+        startIdx = scanLeft;
+        endIdx = leftIdx;
+        lowerBound = leftBound;
+        upperBound = rightPos;
+    }
+    else if (rightCount > 0) {
+        startIdx = rightIdx;
+        endIdx = scanRight;
+        lowerBound = leftPos;
+        upperBound = rightBound;
+    }
+    else {
+        // leftCount > 0, rightCount === 0: must pick left.
+        startIdx = scanLeft;
+        endIdx = leftIdx;
+        lowerBound = leftBound;
+        upperBound = rightPos;
+    }
+    const count = endIdx - startIdx + 1;
+    const range = upperBound - lowerBound;
+    if (range <= count) {
+        throw new Error(`Cannot reposition: not enough space in range (${lowerBound}, ${upperBound}) for ${count} expressions.`);
+    }
+    return { startIdx, endIdx, lowerBound, upperBound, count };
+}
+/**
+ * Validates the preconditions for `ExpressionManager.updateExpression`
+ * and, when the update includes a position change, performs the sibling
+ * position-set swap (delete old position, reject or accept the new one).
+ *
+ * Mutates `childPositionsByParentId` in place when a position update is
+ * accepted — this is the one check in this module that isn't a pure
+ * throw-or-void helper, since the swap must happen atomically with the
+ * collision check to avoid leaving the position set inconsistent.
+ *
+ * @throws Under the same conditions documented on `updateExpression`.
+ */
+export function validateUpdateExpression(expressionId, expression, updates, childPositionsByParentId) {
+    // Reject forbidden fields passed via `as any`.
+    const FORBIDDEN_KEYS = [
+        "id",
+        "argumentId",
+        "argumentVersion",
+        "premiseId",
+        "checksum",
+        "parentId",
+        "type",
+    ];
+    for (const key of FORBIDDEN_KEYS) {
+        if (key in updates) {
+            throw new Error(`Field "${key}" is forbidden in expression updates.`);
+        }
+    }
+    // Validate operator change.
+    if (updates.operator !== undefined) {
+        if (expression.type !== "operator") {
+            throw new Error(`Expression "${expressionId}" is not an operator expression; cannot update operator.`);
+        }
+        const permitted = PERMITTED_OPERATOR_SWAPS[expression.operator];
+        if (permitted !== updates.operator) {
+            throw new Error(`Changing operator from "${expression.operator}" to "${updates.operator}" is not a permitted operator change. Permitted: and↔or, implies↔iff.`);
+        }
+    }
+    // Validate variableId change.
+    if (updates.variableId !== undefined) {
+        if (expression.type !== "variable") {
+            throw new Error(`Expression "${expressionId}" is not a variable expression; cannot update variableId.`);
+        }
+    }
+    // Validate position change.
+    if (updates.position !== undefined) {
+        const positionSet = childPositionsByParentId.get(expression.parentId);
+        if (positionSet) {
+            positionSet.delete(expression.position);
+            if (positionSet.has(updates.position)) {
+                // Restore old position before throwing.
+                positionSet.add(expression.position);
+                throw new Error(`Position ${updates.position} is already used under parent "${expression.parentId}".`);
+            }
+            positionSet.add(updates.position);
+        }
+    }
+}
+/**
+ * Validates the preconditions for the single-child-promotion branch of
+ * `ExpressionManager.removeAndPromote` and returns which of the two
+ * branches applies.
+ *
+ * @throws If `target` has more than one child.
+ * @throws If the single child is a root-only operator (`implies`/`iff`)
+ *   that would be placed in a non-root position.
+ * @returns The child to promote, or `undefined` for a plain leaf removal.
+ */
+export function validateRemoveAndPromote(expressionId, target, children) {
+    if (children.length > 1) {
+        throw new Error(`Cannot promote: expression "${expressionId}" has multiple children (${children.length}). Use deleteSubtree: true or remove children first.`);
+    }
+    if (children.length === 0) {
+        return undefined;
+    }
+    // Exactly 1 child — promote it into the target's slot.
+    const child = children[0];
+    // The P-1 promote-on-remove enforcement throw lived here under
+    // `grammarConfig.enforceFormulaBetweenOperators`. AN-1 (post-mutation
+    // hook in assistive mode) now inserts the buffer if the promotion
+    // produced a non-not operator under operator; permissive mode leaves
+    // the un-buffered state and `validate('presentable')` flags it.
+    // Validate: root-only operators cannot be promoted into a non-root position.
+    if (child.type === "operator" &&
+        (child.operator === "implies" || child.operator === "iff") &&
+        target.parentId !== null) {
+        throw new Error(`Cannot promote: child "${child.id}" is a root-only operator ("${child.operator}") and would be placed in a non-root position.`);
+    }
+    return child;
+}
+/**
+ * Validates the preconditions for
+ * `ExpressionManager.addExpressionRelative` and returns the sibling
+ * looked up by ID.
+ *
+ * @throws If the sibling does not exist.
+ */
+export function validateAddExpressionRelative(siblingId, expressions) {
+    const sibling = expressions.get(siblingId);
+    if (!sibling) {
+        throw new Error(`Expression "${siblingId}" not found.`);
+    }
+    return sibling;
+}
+//# sourceMappingURL=expression-manager-checks.js.map

package/dist/lib/core/expression-manager-checks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-manager-checks.js","sourceRoot":"","sources":["../../../src/lib/core/expression-manager-checks.ts"],"names":[],"mappings":"AAQA,MAAM,wBAAwB,GAAuC;IACjE,GAAG,EAAE,IAAI;IACT,EAAE,EAAE,KAAK;IACT,OAAO,EAAE,KAAK;IACd,GAAG,EAAE,SAAS;CACjB,CAAA;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CAGpC,UAAmC,EACnC,UAA8B,EAC9B,WAA+B,EAC/B,WAA+B;IAE/B,+CAA+C;IAC/C,IAAI,UAAU,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CACX,sEAAsE,CACzE,CAAA;IACL,CAAC;IAED,qDAAqD;IACrD,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAA;IAC5E,CAAC;IAED,6CAA6C;IAC7C,IAAI,UAAU,CAAC,QAAQ,KAAK,UAAU,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CACX,eAAe,UAAU,CAAC,EAAE,6BAA6B,CAC5D,CAAA;IACL,CAAC;IAED,4CAA4C;IAC5C,IACI,UAAU,KAAK,SAAS;QACxB,WAAW,KAAK,SAAS;QACzB,UAAU,KAAK,WAAW,EAC5B,CAAC;QACC,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAA;IACpE,CAAC;IAED,2CAA2C;IAC3C,6EAA6E;IAC7E,yEAAyE;IACzE,MAAM,QAAQ,GACV,UAAU,KAAK,SAAS;QACpB,CAAC,CAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAkC;QAC/D,CAAC,CAAC,SAAS,CAAA;IACnB,IAAI,UAAU,KAAK,SAAS,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,eAAe,UAAU,mBAAmB,CAAC,CAAA;IACjE,CAAC;IAED,4CAA4C;IAC5C,MAAM,SAAS,GACX,WAAW,KAAK,SAAS;QACrB,CAAC,CAAE,WAAW,CAAC,GAAG,CAAC,WAAW,CAAkC;QAChE,CAAC,CAAC,SAAS,CAAA;IACnB,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,eAAe,WAAW,mBAAmB,CAAC,CAAA;IAClE,CAAC;IAED,kDAAkD;IAClD,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CACX,wBAAwB,UAAU,CAAC,EAAE,yBAAyB,CACjE,CAAA;IACL,CAAC;IAED,+DAA+D;IAC/D,IACI,UAAU,CAAC,IAAI,KAAK,UAAU;QAC9B,UAAU,CAAC,QAAQ,KAAK,KAAK;QAC7B,UAAU,KAAK,SAAS;QACxB,WAAW,KAAK,SAAS,EAC3B,CAAC;QACC,MAAM,IAAI,KAAK,CACX,wBAAwB,UAAU,CAAC,EAAE,uCAAuC,CAC/E,CAAA;IACL,CAAC;IAED,uEAAuE;IACvE,IACI,UAAU,CAAC,IAAI,KAAK,SAAS;QAC7B,UAAU,KAAK,SAAS;QACxB,WAAW,KAAK,SAAS,EAC3B,CAAC;QACC,MAAM,IAAI,KAAK,CACX,uBAAuB,UAAU,CAAC,EAAE,4BAA4B,CACnE,CAAA;IACL,CAAC;IAED,qFAAqF;IACrF,IACI,QAAQ,EAAE,IAAI,KAAK,UAAU;QAC7B,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,KAAK,KAAK,CAAC,EAClE,CAAC;QACC,MAAM,IAAI,KAAK,CACX,eAAe,UAAU,WAAW,QAAQ,CAAC,QAAQ,8DAA8D,CACtH,CAAA;IACL,CAAC;IAED,sFAAsF;IACtF,IACI,SAAS,EAAE,IAAI,KAAK,UAAU;QAC9B,CAAC,SAAS,CAAC,QAAQ,KAAK,SAAS,IAAI,SAAS,CAAC,QAAQ,KAAK,KAAK,CAAC,EACpE,CAAC;QACC,MAAM,IAAI,KAAK,CACX,eAAe,WAAW,WAAW,SAAS,CAAC,QAAQ,8DAA8D,CACxH,CAAA;IACL,CAAC;IAED,kFAAkF;IAClF,MAAM,MAAM,GAAG,CAAC,QAAQ,IAAI,SAAS,CAAE,CAAA;IAEvC,4EAA4E;IAC5E,IACI,UAAU,CAAC,IAAI,KAAK,UAAU;QAC9B,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS,IAAI,UAAU,CAAC,QAAQ,KAAK,KAAK,CAAC;QACpE,MAAM,CAAC,QAAQ,KAAK,IAAI,EAC1B,CAAC;QACC,MAAM,IAAI,KAAK,CACX,wBAAwB,UAAU,CAAC,EAAE,WAAW,UAAU,CAAC,QAAQ,sDAAsD,CAC5H,CAAA;IACL,CAAC;IAED,4DAA4D;IAC5D,6DAA6D;IAC7D,4DAA4D;IAC5D,0DAA0D;IAC1D,8DAA8D;IAC9D,8DAA8D;IAC9D,+DAA+D;IAC/D,oDAAoD;IACpD,mDAAmD;IACnD,sCAAsC;IAEtC,OAAO,EAAE,cAAc,EAAE,MAAM,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAA;AAC/E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAGlC,QAA2C,EAC3C,UAA6C,EAC7C,UAA8B,EAC9B,WAA+B,EAC/B,WAA+B;IAM/B,+DAA+D;IAC/D,IAAI,UAAU,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CACX,mEAAmE,CACtE,CAAA;IACL,CAAC;IACD,IAAI,UAAU,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CACX,6EAA6E,CAChF,CAAA;IACL,CAAC;IAED,oDAAoD;IACpD,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,uBAAuB,QAAQ,CAAC,EAAE,mBAAmB,CAAC,CAAA;IAC1E,CAAC;IAED,uDAAuD;IACvD,IAAI,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,uBAAuB,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAA;IAC5E,CAAC;IAED,iDAAiD;IACjD,IAAI,QAAQ,CAAC,EAAE,KAAK,UAAU,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CACX,wDAAwD,CAC3D,CAAA;IACL,CAAC;IAED,mCAAmC;IACnC,MAAM,cAAc,GAAG,CAAC,UAAU,IAAI,WAAW,CAAE,CAAA;IACnD,MAAM,YAAY,GAAiC,WAAW,CAAC,GAAG,CAC9D,cAAc,CACe,CAAA;IACjC,IAAI,CAAC,YAAY,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,eAAe,cAAc,mBAAmB,CAAC,CAAA;IACrE,CAAC;IAED,oDAAoD;IACpD,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACX,6BAA6B,QAAQ,CAAC,EAAE,qCAAqC,QAAQ,CAAC,IAAI,IAAI,CACjG,CAAA;IACL,CAAC;IAED,yCAAyC;IACzC,IAAI,QAAQ,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CACX,wBAAwB,QAAQ,CAAC,EAAE,mFAAmF,CACzH,CAAA;IACL,CAAC;IAED,oEAAoE;IACpE,IACI,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,KAAK,KAAK,CAAC;QAChE,YAAY,CAAC,QAAQ,KAAK,IAAI,EAChC,CAAC;QACC,MAAM,IAAI,KAAK,CACX,wBAAwB,QAAQ,CAAC,EAAE,WAAW,QAAQ,CAAC,QAAQ,sDAAsD,CACxH,CAAA;IACL,CAAC;IAED,qEAAqE;IACrE,IACI,YAAY,CAAC,IAAI,KAAK,UAAU;QAChC,CAAC,YAAY,CAAC,QAAQ,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,KAAK,KAAK,CAAC,EAC1E,CAAC;QACC,MAAM,IAAI,KAAK,CACX,eAAe,cAAc,WAAW,YAAY,CAAC,QAAQ,8DAA8D,CAC9H,CAAA;IACL,CAAC;IAED,oEAAoE;IACpE,IACI,UAAU,CAAC,IAAI,KAAK,UAAU;QAC9B,CAAC,UAAU,CAAC,QAAQ,KAAK,SAAS,IAAI,UAAU,CAAC,QAAQ,KAAK,KAAK,CAAC,EACtE,CAAC;QACC,MAAM,IAAI,KAAK,CACX,uBAAuB,UAAU,CAAC,EAAE,WAAW,UAAU,CAAC,QAAQ,8DAA8D,CACnI,CAAA;IACL,CAAC;IAED,4DAA4D;IAC5D,6DAA6D;IAC7D,4DAA4D;IAC5D,+DAA+D;IAC/D,8CAA8C;IAC9C,2DAA2D;IAC3D,0DAA0D;IAC1D,6DAA6D;IAC7D,+DAA+D;IAC/D,0CAA0C;IAE1C,OAAO;QACH,cAAc;QACd,cAAc,EAAE,YAAY,CAAC,QAAQ;QACrC,cAAc,EAAE,YAAY,CAAC,QAAQ;KACxC,CAAA;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,0BAA0B,CAGtC,QAAiB,EACjB,OAAe,EACf,QAAgB,EAChB,cAAmC;IAQnC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;IAEjD,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;IAE5C,8DAA8D;IAC9D,IAAI,QAAgB,CAAA;IACpB,IAAI,SAAiB,CAAA;IACrB,IAAI,SAAiB,CAAA;IACrB,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;QACjB,+DAA+D;QAC/D,QAAQ,GAAG,CAAC,CAAA;QACZ,SAAS,GAAG,OAAO,CAAA;QACnB,SAAS,GAAG,CAAC,CAAA;IACjB,CAAC;SAAM,CAAC;QACJ,QAAQ,GAAG,OAAO,CAAA;QAClB,OACI,QAAQ,GAAG,CAAC;YACZ,SAAS,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,EACpD,CAAC;YACC,QAAQ,EAAE,CAAA;QACd,CAAC;QACD,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;QACvE,SAAS,GAAG,OAAO,GAAG,QAAQ,GAAG,CAAC,CAAA;IACtC,CAAC;IAED,gEAAgE;IAChE,IAAI,SAAiB,CAAA;IACrB,IAAI,UAAkB,CAAA;IACtB,IAAI,UAAkB,CAAA;IACtB,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,gEAAgE;QAChE,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;QAChC,UAAU,GAAG,QAAQ,CAAA;QACrB,UAAU,GAAG,CAAC,CAAA;IAClB,CAAC;SAAM,CAAC;QACJ,SAAS,GAAG,QAAQ,CAAA;QACpB,OACI,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;YAChC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,EACtD,CAAC;YACC,SAAS,EAAE,CAAA;QACf,CAAC;QACD,UAAU;YACN,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;gBAC5B,CAAC,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC;gBAC1B,CAAC,CAAC,cAAc,CAAC,GAAG,CAAA;QAC5B,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAA;IACzC,CAAC;IAED,qDAAqD;IACrD,IAAI,QAAgB,CAAA;IACpB,IAAI,MAAc,CAAA;IAClB,IAAI,UAAkB,CAAA;IACtB,IAAI,UAAkB,CAAA;IAEtB,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;QAC1C,QAAQ,GAAG,QAAQ,CAAA;QACnB,MAAM,GAAG,OAAO,CAAA;QAChB,UAAU,GAAG,SAAS,CAAA;QACtB,UAAU,GAAG,QAAQ,CAAA;IACzB,CAAC;SAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QACxB,QAAQ,GAAG,QAAQ,CAAA;QACnB,MAAM,GAAG,SAAS,CAAA;QAClB,UAAU,GAAG,OAAO,CAAA;QACpB,UAAU,GAAG,UAAU,CAAA;IAC3B,CAAC;SAAM,CAAC;QACJ,mDAAmD;QACnD,QAAQ,GAAG,QAAQ,CAAA;QACnB,MAAM,GAAG,OAAO,CAAA;QAChB,UAAU,GAAG,SAAS,CAAA;QACtB,UAAU,GAAG,QAAQ,CAAA;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAA;IACnC,MAAM,KAAK,GAAG,UAAU,GAAG,UAAU,CAAA;IACrC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CACX,iDAAiD,UAAU,KAAK,UAAU,SAAS,KAAK,eAAe,CAC1G,CAAA;IACL,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,CAAA;AAC9D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CAGpC,YAAoB,EACpB,UAAiB,EACjB,OAA0B,EAC1B,wBAAyD;IAEzD,+CAA+C;IAC/C,MAAM,cAAc,GAAG;QACnB,IAAI;QACJ,YAAY;QACZ,iBAAiB;QACjB,WAAW;QACX,UAAU;QACV,UAAU;QACV,MAAM;KACT,CAAA;IACD,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QAC/B,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CACX,UAAU,GAAG,uCAAuC,CACvD,CAAA;QACL,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CACX,eAAe,YAAY,0DAA0D,CACxF,CAAA;QACL,CAAC;QACD,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC/D,IAAI,SAAS,KAAK,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CACX,2BAA2B,UAAU,CAAC,QAAQ,SAAS,OAAO,CAAC,QAAQ,uEAAuE,CACjJ,CAAA;QACL,CAAC;IACL,CAAC;IAED,8BAA8B;IAC9B,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CACX,eAAe,YAAY,2DAA2D,CACzF,CAAA;QACL,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,wBAAwB,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;QACrE,IAAI,WAAW,EAAE,CAAC;YACd,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;YACvC,IAAI,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpC,wCAAwC;gBACxC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;gBACpC,MAAM,IAAI,KAAK,CACX,YAAY,OAAO,CAAC,QAAQ,kCAAkC,UAAU,CAAC,QAAQ,IAAI,CACxF,CAAA;YACL,CAAC;YACD,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACrC,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CAEtC,YAAoB,EAAE,MAAa,EAAE,QAAiB;IACpD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CACX,+BAA+B,YAAY,4BAA4B,QAAQ,CAAC,MAAM,sDAAsD,CAC/I,CAAA;IACL,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,SAAS,CAAA;IACpB,CAAC;IAED,uDAAuD;IACvD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;IAEzB,+DAA+D;IAC/D,sEAAsE;IACtE,kEAAkE;IAClE,qEAAqE;IACrE,gEAAgE;IAEhE,6EAA6E;IAC7E,IACI,KAAK,CAAC,IAAI,KAAK,UAAU;QACzB,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC;QAC1D,MAAM,CAAC,QAAQ,KAAK,IAAI,EAC1B,CAAC;QACC,MAAM,IAAI,KAAK,CACX,0BAA0B,KAAK,CAAC,EAAE,+BAA+B,KAAK,CAAC,QAAQ,gDAAgD,CAClI,CAAA;IACL,CAAC;IAED,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,6BAA6B,CAE3C,SAAiB,EAAE,WAA+B;IAChD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IAC1C,IAAI,CAAC,OAAO,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,eAAe,SAAS,cAAc,CAAC,CAAA;IAC3D,CAAC;IACD,OAAO,OAAO,CAAA;AAClB,CAAC"}

package/dist/lib/core/expression-manager-dirty-set.d.ts

@@ -0,0 +1,21 @@
+import type { TCorePropositionalExpression } from "../schemata/index.js";
+import type { ChangeCollector } from "./change-collector.js";
+import type { TLogicEngineOptions } from "./argument-engine.js";
+/**
+ * Marks an expression and all its ancestors as dirty for hierarchical
+ * checksum recomputation. Stops early when it reaches an expression
+ * already in the dirty set (since its ancestors are already marked).
+ */
+export declare function markExpressionDirty<TExpr extends TCorePropositionalExpression>(exprId: string, dirtyExpressionIds: Set<string>, expressions: Map<string, TExpr>): void;
+/**
+ * Recomputes `descendantChecksum` and `combinedChecksum` for all dirty
+ * expressions, processing bottom-up (deepest first) so that children
+ * are up-to-date before their parents are computed.
+ */
+export declare function flushExpressionChecksums<TExpr extends TCorePropositionalExpression>(dirtyExpressionIds: Set<string>, expressions: Map<string, TExpr>, childExpressionIdsByParentId: Map<string | null, Set<string>>, config: TLogicEngineOptions | undefined, collector: ChangeCollector | null): void;
+/**
+ * Removes deleted expression IDs from the dirty set so that flush
+ * doesn't attempt to process expressions that no longer exist.
+ */
+export declare function pruneDeletedFromDirtySet(deletedIds: Set<string>, dirtyExpressionIds: Set<string>): void;
+//# sourceMappingURL=expression-manager-dirty-set.d.ts.map

package/dist/lib/core/expression-manager-dirty-set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-manager-dirty-set.d.ts","sourceRoot":"","sources":["../../../src/lib/core/expression-manager-dirty-set.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAA;AACxE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AAC5D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAA;AAI/D;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,SAAS,4BAA4B,EAC1E,MAAM,EAAE,MAAM,EACd,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,EAC/B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,GAChC,IAAI,CAQN;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACpC,KAAK,SAAS,4BAA4B,EAE1C,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,EAC/B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC/B,4BAA4B,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAC7D,MAAM,EAAE,mBAAmB,GAAG,SAAS,EACvC,SAAS,EAAE,eAAe,GAAG,IAAI,GAClC,IAAI,CA2EN;AAED;;;GAGG;AACH,wBAAgB,wBAAwB,CACpC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,EACvB,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,GAChC,IAAI,CAIN"}

package/dist/lib/core/expression-manager-dirty-set.js

@@ -0,0 +1,93 @@
+import { DEFAULT_CHECKSUM_CONFIG } from "../consts.js";
+import { entityChecksum, computeHash, canonicalSerialize } from "./checksum.js";
+/**
+ * Marks an expression and all its ancestors as dirty for hierarchical
+ * checksum recomputation. Stops early when it reaches an expression
+ * already in the dirty set (since its ancestors are already marked).
+ */
+export function markExpressionDirty(exprId, dirtyExpressionIds, expressions) {
+    let current = exprId;
+    while (current !== null) {
+        if (dirtyExpressionIds.has(current))
+            break; // ancestors already dirty
+        dirtyExpressionIds.add(current);
+        const expr = expressions.get(current);
+        current = expr ? expr.parentId : null;
+    }
+}
+/**
+ * Recomputes `descendantChecksum` and `combinedChecksum` for all dirty
+ * expressions, processing bottom-up (deepest first) so that children
+ * are up-to-date before their parents are computed.
+ */
+export function flushExpressionChecksums(dirtyExpressionIds, expressions, childExpressionIdsByParentId, config, collector) {
+    if (dirtyExpressionIds.size === 0)
+        return;
+    // Sort dirty expressions by depth (deepest first) for bottom-up processing
+    const dirtyIds = [...dirtyExpressionIds];
+    const depthOf = (id) => {
+        let depth = 0;
+        let current = expressions.get(id);
+        while (current && current.parentId !== null) {
+            depth++;
+            current = expressions.get(current.parentId);
+        }
+        return depth;
+    };
+    dirtyIds.sort((a, b) => depthOf(b) - depthOf(a));
+    const fields = config?.checksumConfig?.expressionFields ??
+        DEFAULT_CHECKSUM_CONFIG.expressionFields;
+    for (const id of dirtyIds) {
+        const expr = expressions.get(id);
+        if (!expr)
+            continue;
+        const oldChecksum = expr.checksum;
+        const oldDescendantChecksum = expr.descendantChecksum;
+        const oldCombinedChecksum = expr.combinedChecksum;
+        const metaChecksum = entityChecksum(expr, fields);
+        const childIds = childExpressionIdsByParentId.get(id);
+        let descendantChecksum = null;
+        if (childIds && childIds.size > 0) {
+            const childMap = {};
+            for (const childId of childIds) {
+                const child = expressions.get(childId);
+                if (child) {
+                    childMap[childId] = child.combinedChecksum;
+                }
+            }
+            descendantChecksum = computeHash(canonicalSerialize(childMap));
+        }
+        const combinedChecksum = descendantChecksum === null
+            ? metaChecksum
+            : computeHash(metaChecksum + descendantChecksum);
+        expressions.set(id, {
+            ...expr,
+            checksum: metaChecksum,
+            descendantChecksum,
+            combinedChecksum,
+        });
+        if (collector &&
+            !collector.isExpressionAdded(expr.id) &&
+            (metaChecksum !== oldChecksum ||
+                descendantChecksum !== oldDescendantChecksum ||
+                combinedChecksum !== oldCombinedChecksum)) {
+            collector.modifiedExpression({
+                ...expr,
+                checksum: metaChecksum,
+                descendantChecksum,
+                combinedChecksum,
+            });
+        }
+    }
+    dirtyExpressionIds.clear();
+}
+/**
+ * Removes deleted expression IDs from the dirty set so that flush
+ * doesn't attempt to process expressions that no longer exist.
+ */
+export function pruneDeletedFromDirtySet(deletedIds, dirtyExpressionIds) {
+    for (const id of deletedIds) {
+        dirtyExpressionIds.delete(id);
+    }
+}
+//# sourceMappingURL=expression-manager-dirty-set.js.map

package/dist/lib/core/expression-manager-dirty-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-manager-dirty-set.js","sourceRoot":"","sources":["../../../src/lib/core/expression-manager-dirty-set.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAA;AACtD,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AAE/E;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAC/B,MAAc,EACd,kBAA+B,EAC/B,WAA+B;IAE/B,IAAI,OAAO,GAAkB,MAAM,CAAA;IACnC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACtB,IAAI,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,MAAK,CAAC,0BAA0B;QACrE,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACrC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;IACzC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAGpC,kBAA+B,EAC/B,WAA+B,EAC/B,4BAA6D,EAC7D,MAAuC,EACvC,SAAiC;IAEjC,IAAI,kBAAkB,CAAC,IAAI,KAAK,CAAC;QAAE,OAAM;IAEzC,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAA;IACxC,MAAM,OAAO,GAAG,CAAC,EAAU,EAAU,EAAE;QACnC,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,IAAI,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACjC,OAAO,OAAO,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC1C,KAAK,EAAE,CAAA;YACP,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QAC/C,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC,CAAA;IACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IAEhD,MAAM,MAAM,GACR,MAAM,EAAE,cAAc,EAAE,gBAAgB;QACxC,uBAAuB,CAAC,gBAAiB,CAAA;IAE7C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAChC,IAAI,CAAC,IAAI;YAAE,SAAQ;QAEnB,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAA;QACjC,MAAM,qBAAqB,GAAG,IAAI,CAAC,kBAAkB,CAAA;QACrD,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAA;QAEjD,MAAM,YAAY,GAAG,cAAc,CAC/B,IAA0C,EAC1C,MAAM,CACT,CAAA;QAED,MAAM,QAAQ,GAAG,4BAA4B,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrD,IAAI,kBAAkB,GAAkB,IAAI,CAAA;QAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,QAAQ,GAA2B,EAAE,CAAA;YAC3C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;gBACtC,IAAI,KAAK,EAAE,CAAC;oBACR,QAAQ,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAA;gBAC9C,CAAC;YACL,CAAC;YACD,kBAAkB,GAAG,WAAW,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAA;QAClE,CAAC;QAED,MAAM,gBAAgB,GAClB,kBAAkB,KAAK,IAAI;YACvB,CAAC,CAAC,YAAY;YACd,CAAC,CAAC,WAAW,CAAC,YAAY,GAAG,kBAAkB,CAAC,CAAA;QAExD,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE;YAChB,GAAG,IAAI;YACP,QAAQ,EAAE,YAAY;YACtB,kBAAkB;YAClB,gBAAgB;SACV,CAAC,CAAA;QAEX,IACI,SAAS;YACT,CAAC,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,CAAC,YAAY,KAAK,WAAW;gBACzB,kBAAkB,KAAK,qBAAqB;gBAC5C,gBAAgB,KAAK,mBAAmB,CAAC,EAC/C,CAAC;YACC,SAAS,CAAC,kBAAkB,CAAC;gBACzB,GAAG,IAAI;gBACP,QAAQ,EAAE,YAAY;gBACtB,kBAAkB;gBAClB,gBAAgB;aACV,CAAC,CAAA;QACf,CAAC;IACL,CAAC;IAED,kBAAkB,CAAC,KAAK,EAAE,CAAA;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACpC,UAAuB,EACvB,kBAA+B;IAE/B,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC1B,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IACjC,CAAC;AACL,CAAC"}

package/dist/lib/core/expression-manager-invariants.d.ts

@@ -0,0 +1,14 @@
+import type { TCorePropositionalExpression } from "../schemata/index.js";
+import type { ChangeCollector } from "./change-collector.js";
+import type { TLogicEngineOptions } from "./argument-engine.js";
+import type { TInvariantValidationResult } from "../types/validation.js";
+/**
+ * Performs a comprehensive validation sweep on all managed expressions.
+ *
+ * Collects ALL violations rather than failing on the first one. Checks:
+ * schema validity, duplicate IDs, self-referential parents, parent
+ * existence, parent container type, root-only operators, child limits,
+ * position uniqueness, and checksum integrity.
+ */
+export declare function validateExpressionManagerInvariants<TExpr extends TCorePropositionalExpression>(expressions: Map<string, TExpr>, childExpressionIdsByParentId: Map<string | null, Set<string>>, dirtyExpressionIds: Set<string>, config: TLogicEngineOptions | undefined, collector: ChangeCollector | null): TInvariantValidationResult;
+//# sourceMappingURL=expression-manager-invariants.d.ts.map

package/dist/lib/core/expression-manager-invariants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-manager-invariants.d.ts","sourceRoot":"","sources":["../../../src/lib/core/expression-manager-invariants.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAA;AAExE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AAC5D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAA;AAE/D,OAAO,KAAK,EAER,0BAA0B,EAC7B,MAAM,wBAAwB,CAAA;AAc/B;;;;;;;GAOG;AACH,wBAAgB,mCAAmC,CAC/C,KAAK,SAAS,4BAA4B,EAE1C,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC/B,4BAA4B,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAC7D,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,EAC/B,MAAM,EAAE,mBAAmB,GAAG,SAAS,EACvC,SAAS,EAAE,eAAe,GAAG,IAAI,GAClC,0BAA0B,CAoM5B"}