@proposit/proposit-core 0.12.1 → 1.0.0

package/dist/lib/core/managed-derivation-premise-engine.js

@@ -1,550 +0,0 @@
-import {} from "../schemata/index.js";
-import { PremiseEngine } from "./premise-engine.js";
-import { VariableManager } from "./variable-manager.js";
-import { defaultGenerateId, } from "./argument-engine.js";
-import {} from "../types/grammar.js";
-import { DERIVATION_TYPE_MISMATCH, DERIVATION_STRUCTURE_INVALID, DERIVATION_CONSEQUENT_LOCKED, DERIVATION_ROOT_OPERATOR_INVALID, DERIVATION_ANTECEDENT_NON_EMPTY, } from "../types/validation.js";
-import { InvariantViolationError } from "./invariant-violation-error.js";
-import { validateDerivationStructure } from "../utils/derivation-validation.js";
-/**
- * A managed engine for derivation premises that enforces structural rules
- * from the v0.11.0 spec on construction and on snapshot restoration.
- *
- * Construction validates the premise type (`DERIVATION_TYPE_MISMATCH` if the
- * premise isn't `type: "derivation"`). Full expression-tree structural
- * validation (`DERIVATION_STRUCTURE_INVALID`) runs in `fromSnapshot` — after
- * expressions are loaded — and will be called from mutation overrides in
- * Task 6.
- *
- * Note: The constructor only validates the premise type, not the expression
- * tree, because `PremiseEngine` is always constructed before expressions are
- * loaded (expressions are added separately via mutations or `loadExpressions`).
- * Structural validation at the end of `fromSnapshot` catches tampered
- * snapshots, and Task 6 mutation overrides will enforce it on every change.
- *
- * The classic `PremiseEngine` is permissive and allows mutations that leave a
- * derivation premise temporarily or permanently invalid. The managed engine
- * wraps it for safe, structurally-enforced editing.
- *
- * Use `ManagedDerivationPremiseEngine.fromSnapshot(...)` to restore from a
- * serialized snapshot — the validation pass catches tampered snapshots.
- */
-export class ManagedDerivationPremiseEngine extends PremiseEngine {
-    /**
-     * Captured from `config.generateId` (or the default UUID generator) for
-     * use in `populateFromSupports`, which needs to mint new expression IDs.
-     * Stored separately because `PremiseEngine`'s generateId is private.
-     * Not `readonly` because `fromSnapshot` re-injects it after the prototype
-     * upgrade.
-     */
-    generateIdFn;
-    constructor(premise, deps, config) {
-        super(premise, deps, config);
-        this.generateIdFn = config?.generateId ?? defaultGenerateId;
-        // Validate premise type immediately — no expressions needed.
-        // Structural validation (assertWellFormed) is deferred to fromSnapshot
-        // and mutation overrides because PremiseEngine is always constructed
-        // before expressions are loaded.
-        this.assertDerivationType();
-    }
-    /**
-     * Restore a `ManagedDerivationPremiseEngine` from a serialized snapshot,
-     * applying both derivation-type and structural validation. Throws on
-     * tampered or structurally invalid snapshots.
-     *
-     * Delegates to `PremiseEngine.fromSnapshot` for the full restoration logic
-     * (including the private `rebuildVariableIndex` pass), then upgrades the
-     * prototype and validates. TypeScript's static methods do not support
-     * `super`, so the parent is called by name and the result is recast.
-     */
-    static fromSnapshot(snapshot, argument, variables, expressionIndex, grammarConfig, generateId) {
-        // Validate type before doing the full restore work.
-        const premiseType = snapshot.premise.type;
-        if (premiseType !== "derivation") {
-            throw new InvariantViolationError([
-                {
-                    code: DERIVATION_TYPE_MISMATCH,
-                    message: `${DERIVATION_TYPE_MISMATCH}: ManagedDerivationPremiseEngine requires a premise with type "derivation" (got "${premiseType}")`,
-                    entityType: "premise",
-                    entityId: snapshot.premise.id,
-                },
-            ]);
-        }
-        // Delegate to the parent's static fromSnapshot to get a fully restored
-        // engine, including the private rebuildVariableIndex pass.
-        const pe = PremiseEngine.fromSnapshot(snapshot, argument, variables, expressionIndex, grammarConfig, generateId);
-        // Upgrade the instance prototype so it becomes a
-        // ManagedDerivationPremiseEngine with all subclass methods available.
-        Object.setPrototypeOf(pe, ManagedDerivationPremiseEngine.prototype);
-        const engine = pe;
-        // Inject the generateId captured from config (or the default) so that
-        // populateFromSupports can mint new expression IDs.
-        engine.generateIdFn = generateId ?? defaultGenerateId;
-        // Validate the full tree — expressions are fully loaded at this point.
-        // (Type was already checked at the top before delegating to the parent.)
-        engine.assertWellFormed();
-        return engine;
-    }
-    /**
-     * Validate that the wrapped premise has `type === "derivation"`.
-     * @throws InvariantViolationError with code `DERIVATION_TYPE_MISMATCH`
-     */
-    assertDerivationType() {
-        const premise = this.premise;
-        if (premise.type !== "derivation") {
-            throw new InvariantViolationError([
-                {
-                    code: DERIVATION_TYPE_MISMATCH,
-                    message: `${DERIVATION_TYPE_MISMATCH}: ManagedDerivationPremiseEngine requires a premise with type "derivation" (got "${premise.type}")`,
-                    entityType: "premise",
-                    entityId: premise.id,
-                },
-            ]);
-        }
-    }
-    /**
-     * Validate that the expression tree conforms to the derivation rules from
-     * the v0.11.0 spec (naked-Q or IMPLIES/IFF with Q as consequent).
-     * @throws InvariantViolationError with code `DERIVATION_STRUCTURE_INVALID`
-     */
-    assertWellFormed() {
-        const result = validateDerivationStructure(this.premise, this.expressions.toArray(), this.variables.toArray());
-        if (result.violations.length > 0) {
-            // Prefix each violation message with the code so the thrown Error's
-            // message text is searchable by code (InvariantViolationError uses
-            // violations[0].message as the Error message when there is exactly
-            // one violation).
-            const prefixed = result.violations.map((v) => ({
-                ...v,
-                message: `${DERIVATION_STRUCTURE_INVALID}: ${v.message}`,
-            }));
-            throw new InvariantViolationError(prefixed);
-        }
-    }
-    // -------------------------------------------------------------------------
-    // Mutation overrides — enforce derivation invariants on every change
-    // -------------------------------------------------------------------------
-    addExpression(expression) {
-        const result = super.addExpression(expression);
-        this.assertWellFormed();
-        return result;
-    }
-    appendExpression(parentId, expression) {
-        const result = super.appendExpression(parentId, expression);
-        this.assertWellFormed();
-        return result;
-    }
-    addExpressionRelative(siblingId, relativePosition, expression) {
-        const result = super.addExpressionRelative(siblingId, relativePosition, expression);
-        this.assertWellFormed();
-        return result;
-    }
-    updateExpression(expressionId, updates) {
-        this.assertConsequentNotMutated(expressionId, updates);
-        const result = super.updateExpression(expressionId, updates);
-        this.assertWellFormed();
-        return result;
-    }
-    removeExpression(expressionId, deleteSubtree) {
-        this.assertNotConsequentExpression(expressionId);
-        const result = super.removeExpression(expressionId, deleteSubtree);
-        this.assertWellFormed();
-        return result;
-    }
-    insertExpression(expression, leftNodeId, rightNodeId) {
-        this.assertNotConsequentSlot(expression);
-        const result = super.insertExpression(expression, leftNodeId, rightNodeId);
-        this.assertWellFormed();
-        return result;
-    }
-    toggleNegation(expressionId, extraFields) {
-        this.assertNotConsequentExpression(expressionId);
-        const result = super.toggleNegation(expressionId, extraFields);
-        this.assertWellFormed();
-        return result;
-    }
-    wrapExpression(operator, newSibling, leftNodeId, rightNodeId) {
-        // wrapExpression rejects calls without exactly one of leftNodeId/rightNodeId,
-        // so the !-assertion is safe: at least one of the two is always defined here.
-        this.assertNotConsequentExpression((leftNodeId ?? rightNodeId));
-        const result = super.wrapExpression(operator, newSibling, leftNodeId, rightNodeId);
-        this.assertWellFormed();
-        return result;
-    }
-    changeOperator(expressionId, newOperator, sourceChildId, targetChildId, extraFields) {
-        this.assertRootOperatorChangeValid(expressionId, newOperator);
-        const result = super.changeOperator(expressionId, newOperator, sourceChildId, targetChildId, extraFields);
-        this.assertWellFormed();
-        return result;
-    }
-    normalizeExpressions() {
-        const result = super.normalizeExpressions();
-        // Post-validate: normalization could destroy the consequent structure.
-        // assertWellFormed throws DERIVATION_STRUCTURE_INVALID if so.
-        this.assertWellFormed();
-        return result;
-    }
-    loadExpressions(expressions) {
-        // Pre-validate the proposed expression set BEFORE mutation because
-        // loadExpressions is a bulk replace — we need to reject the whole set
-        // atomically rather than rolling back after the fact.
-        const premise = this.premise;
-        const validationResult = validateDerivationStructure(premise, 
-        // TExpressionInput strips checksum fields, but validateDerivationStructure
-        // only reads parentId, type, variableId, operator, position, premiseId —
-        // all of which are present on TExpressionInput.
-        expressions, this.variables.toArray());
-        if (validationResult.violations.length > 0) {
-            const prefixed = validationResult.violations.map((v) => ({
-                ...v,
-                message: `${DERIVATION_STRUCTURE_INVALID}: ${v.message}`,
-            }));
-            throw new InvariantViolationError(prefixed);
-        }
-        super.loadExpressions(expressions);
-    }
-    // -------------------------------------------------------------------------
-    // Public one-shot helpers
-    // -------------------------------------------------------------------------
-    /**
-     * One-shot helper that builds the antecedent of this derivation premise
-     * from the current global support (citations + axiom invocations) of the
-     * derived claim.
-     *
-     * Behavior by total support count `n = citations + axioms`:
-     *   - n = 0: no change. Premise stays in its current form (typically
-     *     naked-Q, indicating "no support given").
-     *   - n = 1: `IMPLIES(VarExpr(S1), Q)`.
-     *   - n ≥ 2: `IMPLIES(formula(OR(VarExpr(S1), …, VarExpr(Sn))), Q)`.
-     *     Citations come first, axioms second; source order preserved within
-     *     each. The formula buffer between IMPLIES and OR is auto-inserted by
-     *     the engine's standard grammar. A supporting claim referenced by
-     *     multiple connections — for example, two citations from this derived
-     *     claim to the same supporting claim — appears exactly once in the
-     *     antecedent, at its first source-order position.
-     *
-     * Materializes a claim-bound variable for each supporting claim via
-     * `argumentEngine.ensureClaimBoundVariable(supportingClaimId)`.
-     *
-     * **Tree construction approach:** Mutations are performed via `super.*`
-     * calls, bypassing this class's overrides (which call `assertWellFormed()`
-     * after every mutation and would reject intermediate states during
-     * multi-step construction). Standard grammar is used throughout — the
-     * engine's `wrapInsertFormula` rule inserts a formula buffer between
-     * IMPLIES and OR for n ≥ 2 automatically. `assertWellFormed()` is called
-     * at the end to validate the final state.
-     *
-     * @throws InvariantViolationError(DERIVATION_ANTECEDENT_NON_EMPTY) when
-     *         the antecedent slot is already filled.
-     *
-     * @since 0.12.0
-     */
-    populateFromSupports(citationLib, axiomLib, argumentEngine) {
-        const premise = this.premise;
-        const derivedClaimId = premise.derivedClaimId;
-        // 1. Reject if antecedent is already non-empty.
-        const rootId = this.rootExpressionId;
-        if (rootId !== undefined) {
-            const root = this.expressions.getExpression(rootId);
-            if (root &&
-                root.type === "operator" &&
-                (root.operator === "implies" || root.operator === "iff")) {
-                // Sort children by position; lowest-position child is the antecedent.
-                const children = this.expressions
-                    .getChildExpressions(rootId)
-                    .sort((a, b) => a.position - b.position);
-                const antecedent = children[0];
-                if (antecedent) {
-                    throw new InvariantViolationError([
-                        {
-                            code: DERIVATION_ANTECEDENT_NON_EMPTY,
-                            message: `${DERIVATION_ANTECEDENT_NON_EMPTY}: derivation premise already has a non-empty antecedent`,
-                            entityType: "premise",
-                            entityId: premise.id,
-                            premiseId: premise.id,
-                        },
-                    ]);
-                }
-            }
-        }
-        // 2. Collect supporting connections from both libraries (citations
-        //    first, axioms second; source order preserved within each).
-        const citationConnections = citationLib.getConnectionsForClaim(derivedClaimId);
-        const axiomConnections = axiomLib.getConnectionsForClaim(derivedClaimId);
-        const totalCount = citationConnections.length + axiomConnections.length;
-        if (totalCount === 0)
-            return;
-        // 3. Dedupe by supportingClaimId in source order: a claim referenced by
-        //    multiple connections (e.g., two citations from this derived claim to
-        //    the same supporting claim) contributes exactly one OR child. Citation
-        //    duplicates collapse first, then axiom duplicates collapse against the
-        //    citation set (axioms keep their relative order behind citations).
-        const seenSupportingIds = new Set();
-        const orderedSupportingIds = [];
-        for (const conn of citationConnections) {
-            if (!seenSupportingIds.has(conn.supportingClaimId)) {
-                seenSupportingIds.add(conn.supportingClaimId);
-                orderedSupportingIds.push(conn.supportingClaimId);
-            }
-        }
-        for (const conn of axiomConnections) {
-            if (!seenSupportingIds.has(conn.supportingClaimId)) {
-                seenSupportingIds.add(conn.supportingClaimId);
-                orderedSupportingIds.push(conn.supportingClaimId);
-            }
-        }
-        // 4. Materialize claim-bound variables for each unique supporting claim.
-        // ensureClaimBoundVariable is idempotent, but the array also being unique
-        // ensures buildAntecedentFromSupportingVariables emits one OR child per
-        // distinct supporting claim.
-        const supportingVariables = orderedSupportingIds.map((claimId) => argumentEngine.ensureClaimBoundVariable(claimId));
-        for (const sv of supportingVariables) {
-            if (!this.variables.hasVariable(sv.id)) {
-                this.variables.addVariable(sv);
-            }
-        }
-        // 4. Build the antecedent expression tree.
-        this.buildAntecedentFromSupportingVariables(supportingVariables);
-        // 5. Validate the final tree is well-formed.
-        this.assertWellFormed();
-    }
-    /**
-     * Build the antecedent expression tree from a list of already-materialized
-     * supporting variables. Shared between populate helpers.
-     *
-     * - n=0 → no-op (caller decides whether to leave the naked-Q form intact).
-     * - n=1 → IMPLIES(VarExpr(S1), Q) using wrapExpression with rightNodeId=Q.
-     * - n≥2 → IMPLIES(formula(OR(S1, ..., Sn)), Q) via wrapExpression + appendExpression.
-     *
-     * Uses `super.*` mutation calls to bypass this class's overrides during
-     * multi-step construction. Caller is responsible for the final
-     * `assertWellFormed()`.
-     */
-    buildAntecedentFromSupportingVariables(supportingVars) {
-        if (supportingVars.length === 0)
-            return;
-        const argId = this.premise.argumentId;
-        const argVersion = this.premise.argumentVersion;
-        const premiseId = this.premise.id;
-        // qRootExprId is the ID of the current naked-Q root variable expression.
-        const qRootExprId = this.rootExpressionId;
-        if (supportingVars.length === 1) {
-            // n = 1: wrap naked-Q with IMPLIES using rightNodeId so that Q lands
-            // at the midpoint (consequent) position and S1 lands at initial.
-            const impliesId = this.generateIdFn();
-            const s1ExprId = this.generateIdFn();
-            const impliesOp = {
-                id: impliesId,
-                argumentId: argId,
-                argumentVersion: argVersion,
-                premiseId,
-                parentId: null,
-                type: "operator",
-                operator: "implies",
-            };
-            const s1VarExpr = {
-                id: s1ExprId,
-                argumentId: argId,
-                argumentVersion: argVersion,
-                premiseId,
-                parentId: null, // wrapExpression sets the parentId internally
-                type: "variable",
-                variableId: supportingVars[0].id,
-            };
-            // rightNodeId=qRootExprId: existing node (Q) → midpoint (consequent),
-            // newSibling (S1) → initial (antecedent).
-            super.wrapExpression(impliesOp, s1VarExpr, undefined, qRootExprId);
-        }
-        else {
-            // n ≥ 2: build IMPLIES(formula(OR(S1,...,Sn)), Q). Standard grammar
-            // throughout — the engine's wrapInsertFormula rule auto-inserts a
-            // formula buffer between IMPLIES and OR. The OR keeps its original
-            // ID, so subsequent appendExpression(orId, ...) calls still attach
-            // the supporting variables to the same OR node.
-            const impliesId = this.generateIdFn();
-            const orId = this.generateIdFn();
-            const impliesOp = {
-                id: impliesId,
-                argumentId: argId,
-                argumentVersion: argVersion,
-                premiseId,
-                parentId: null,
-                type: "operator",
-                operator: "implies",
-            };
-            const orOp = {
-                id: orId,
-                argumentId: argId,
-                argumentVersion: argVersion,
-                premiseId,
-                parentId: null, // wrapExpression sets the parentId internally
-                type: "operator",
-                operator: "or",
-            };
-            // rightNodeId=qRootExprId: Q → midpoint (consequent), OR → initial (antecedent).
-            super.wrapExpression(impliesOp, orOp, undefined, qRootExprId);
-            // Append each supporting variable expression as a child of OR.
-            for (const sourceVar of supportingVars) {
-                const srcExprId = this.generateIdFn();
-                const srcVarExpr = {
-                    id: srcExprId,
-                    argumentId: argId,
-                    argumentVersion: argVersion,
-                    premiseId,
-                    parentId: orId,
-                    type: "variable",
-                    variableId: sourceVar.id,
-                };
-                super.appendExpression(orId, srcVarExpr);
-            }
-        }
-    }
-    // -------------------------------------------------------------------------
-    // Private helpers
-    // -------------------------------------------------------------------------
-    /**
-     * Returns the ID of the consequent expression, or `undefined` if the tree
-     * has no root yet.
-     *
-     * - Naked form (root is a variable expression): the root IS the consequent.
-     * - Implication/biconditional form (root is `implies`/`iff`): the position-1
-     *   child of the root is the consequent.
-     */
-    getConsequentExpressionId() {
-        const rootId = this.rootExpressionId;
-        if (rootId === undefined) {
-            return undefined;
-        }
-        const root = this.expressions.getExpression(rootId);
-        if (!root) {
-            return undefined;
-        }
-        if (root.type === "variable") {
-            // Naked form — root IS the consequent.
-            return rootId;
-        }
-        if (root.type === "operator" &&
-            (root.operator === "implies" || root.operator === "iff")) {
-            // Implication/biconditional form — position-1 child is the consequent.
-            const children = this.expressions
-                .getChildExpressions(rootId)
-                .sort((a, b) => a.position - b.position);
-            return children[1]?.id;
-        }
-        return undefined;
-    }
-    /**
-     * Reject an `insertExpression` call that would place a new node into the
-     * consequent slot of the root `implies`/`iff`.
-     *
-     * Detection is by parentId + position on the input: we block when
-     * `expression.parentId === rootId` AND `expression.position >= consequent.position`.
-     * For `implies`/`iff` the consequent sits at position 1, so this blocks
-     * insertions into position 1 (which would displace the consequent) and
-     * positions beyond (which would exceed arity 2). Insertions at position 0
-     * (antecedent slot) pass through.
-     */
-    assertNotConsequentSlot(expression) {
-        const rootId = this.rootExpressionId;
-        if (rootId === undefined) {
-            return;
-        }
-        const root = this.expressions.getExpression(rootId);
-        if (!root ||
-            root.type !== "operator" ||
-            (root.operator !== "implies" && root.operator !== "iff")) {
-            return;
-        }
-        // The consequent is the position-1 child of the root operator.
-        const consequentId = this.getConsequentExpressionId();
-        if (!consequentId) {
-            return;
-        }
-        // Block if the incoming expression is being inserted directly under root
-        // with position 1 (i.e., it claims the consequent slot).
-        if (expression.parentId === rootId) {
-            // Determine the consequent's current position to compare.
-            const consequentExpr = this.expressions.getExpression(consequentId);
-            if (consequentExpr &&
-                expression.position >= consequentExpr.position) {
-                throw new InvariantViolationError([
-                    {
-                        code: DERIVATION_CONSEQUENT_LOCKED,
-                        message: `${DERIVATION_CONSEQUENT_LOCKED}: Cannot insert an expression into the consequent slot of a derivation premise`,
-                        entityType: "expression",
-                        entityId: expression.id,
-                        premiseId: this.premise.id,
-                    },
-                ]);
-            }
-        }
-    }
-    /**
-     * Reject `removeExpression` and `toggleNegation` calls on the consequent
-     * expression.
-     */
-    assertNotConsequentExpression(exprId) {
-        const consequentId = this.getConsequentExpressionId();
-        if (consequentId !== undefined && exprId === consequentId) {
-            throw new InvariantViolationError([
-                {
-                    code: DERIVATION_CONSEQUENT_LOCKED,
-                    message: `${DERIVATION_CONSEQUENT_LOCKED}: Cannot remove or negate the consequent expression of a derivation premise`,
-                    entityType: "expression",
-                    entityId: exprId,
-                    premiseId: this.premise.id,
-                },
-            ]);
-        }
-    }
-    /**
-     * Reject `updateExpression` calls that change the consequent's `variableId`
-     * or `type`.
-     */
-    assertConsequentNotMutated(exprId, updates) {
-        const consequentId = this.getConsequentExpressionId();
-        if (consequentId === undefined || exprId !== consequentId) {
-            return;
-        }
-        if (updates.variableId !== undefined ||
-            updates.operator !== undefined) {
-            throw new InvariantViolationError([
-                {
-                    code: DERIVATION_CONSEQUENT_LOCKED,
-                    message: `${DERIVATION_CONSEQUENT_LOCKED}: Cannot change the variable or operator of the consequent expression of a derivation premise`,
-                    entityType: "expression",
-                    entityId: exprId,
-                    premiseId: this.premise.id,
-                },
-            ]);
-        }
-    }
-    /**
-     * Reject `changeOperator` calls that would swap the root `implies`/`iff`
-     * to a non-implication operator (`and`, `or`, `not`).
-     */
-    assertRootOperatorChangeValid(exprId, newOperator) {
-        const rootId = this.rootExpressionId;
-        if (rootId === undefined || exprId !== rootId) {
-            return;
-        }
-        const root = this.expressions.getExpression(rootId);
-        if (!root ||
-            root.type !== "operator" ||
-            (root.operator !== "implies" && root.operator !== "iff")) {
-            return;
-        }
-        if (newOperator !== "implies" && newOperator !== "iff") {
-            throw new InvariantViolationError([
-                {
-                    code: DERIVATION_ROOT_OPERATOR_INVALID,
-                    message: `${DERIVATION_ROOT_OPERATOR_INVALID}: Cannot change a derivation premise's root operator from "${root.operator}" to "${newOperator}" — only implies↔iff swaps are permitted`,
-                    entityType: "expression",
-                    entityId: exprId,
-                    premiseId: this.premise.id,
-                },
-            ]);
-        }
-    }
-}
-//# sourceMappingURL=managed-derivation-premise-engine.js.map

package/dist/lib/core/managed-derivation-premise-engine.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"managed-derivation-premise-engine.js","sourceRoot":"","sources":["../../../src/lib/core/managed-derivation-premise-engine.ts"],"names":[],"mappings":"AAAA,OAAO,EASN,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EAAE,aAAa,EAA+B,MAAM,qBAAqB,CAAA;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AACvD,OAAO,EACH,iBAAiB,GAEpB,MAAM,sBAAsB,CAAA;AAU7B,OAAO,EAAuB,MAAM,qBAAqB,CAAA;AACzD,OAAO,EACH,wBAAwB,EACxB,4BAA4B,EAC5B,4BAA4B,EAC5B,gCAAgC,EAChC,+BAA+B,GAClC,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EAAE,uBAAuB,EAAE,MAAM,gCAAgC,CAAA;AACxE,OAAO,EAAE,2BAA2B,EAAE,MAAM,mCAAmC,CAAA;AAU/E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,OAAO,8BAKX,SAAQ,aAA0C;IAChD;;;;;;OAMG;IACK,YAAY,CAAc;IAElC,YACI,OAAoC,EACpC,IAIC,EACD,MAA4B;QAE5B,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QAC5B,IAAI,CAAC,YAAY,GAAG,MAAM,EAAE,UAAU,IAAI,iBAAiB,CAAA;QAC3D,6DAA6D;QAC7D,uEAAuE;QACvE,qEAAqE;QACrE,iCAAiC;QACjC,IAAI,CAAC,oBAAoB,EAAE,CAAA;IAC/B,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,YAAY,CAOf,QAAiD,EACjD,QAAiC,EACjC,SAAgC,EAChC,eAAqC,EACrC,aAA8B,EAC9B,UAAyB;QAEzB,oDAAoD;QACpD,MAAM,WAAW,GAAI,QAAQ,CAAC,OAAwB,CAAC,IAAI,CAAA;QAC3D,IAAI,WAAW,KAAK,YAAY,EAAE,CAAC;YAC/B,MAAM,IAAI,uBAAuB,CAAC;gBAC9B;oBACI,IAAI,EAAE,wBAAwB;oBAC9B,OAAO,EAAE,GAAG,wBAAwB,oFAAoF,WAAW,IAAI;oBACvI,UAAU,EAAE,SAAS;oBACrB,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC,EAAE;iBAChC;aACJ,CAAC,CAAA;QACN,CAAC;QAED,uEAAuE;QACvE,2DAA2D;QAC3D,MAAM,EAAE,GAAG,aAAa,CAAC,YAAY,CACjC,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,eAAe,EACf,aAAa,EACb,UAAU,CACb,CAAA;QAED,iDAAiD;QACjD,sEAAsE;QACtE,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,8BAA8B,CAAC,SAAS,CAAC,CAAA;QACnE,MAAM,MAAM,GAAG,EAKd,CAAA;QAED,sEAAsE;QACtE,oDAAoD;QACpD,MAAM,CAAC,YAAY,GAAG,UAAU,IAAI,iBAAiB,CAAA;QAErD,uEAAuE;QACvE,yEAAyE;QACzE,MAAM,CAAC,gBAAgB,EAAE,CAAA;QAEzB,OAAO,MAAM,CAAA;IACjB,CAAC;IAED;;;OAGG;IACO,oBAAoB;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAuB,CAAA;QAC5C,IAAI,OAAO,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAChC,MAAM,IAAI,uBAAuB,CAAC;gBAC9B;oBACI,IAAI,EAAE,wBAAwB;oBAC9B,OAAO,EAAE,GAAG,wBAAwB,oFAAoF,OAAO,CAAC,IAAI,IAAI;oBACxI,UAAU,EAAE,SAAS;oBACrB,QAAQ,EAAE,OAAO,CAAC,EAAE;iBACvB;aACJ,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED;;;;OAIG;IACO,gBAAgB;QACtB,MAAM,MAAM,GAAG,2BAA2B,CACtC,IAAI,CAAC,OAAiC,EACtC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAC1B,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAC3B,CAAA;QACD,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,oEAAoE;YACpE,mEAAmE;YACnE,mEAAmE;YACnE,kBAAkB;YAClB,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3C,GAAG,CAAC;gBACJ,OAAO,EAAE,GAAG,4BAA4B,KAAK,CAAC,CAAC,OAAO,EAAE;aAC3D,CAAC,CAAC,CAAA;YACH,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAA;QAC/C,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,4EAA4E;IAE5D,aAAa,CACzB,UAAmC;QAEnC,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,UAAU,CAAC,CAAA;QAC9C,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,gBAAgB,CAC5B,QAAuB,EACvB,UAA6C;QAE7C,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;QAC3D,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,qBAAqB,CACjC,SAAiB,EACjB,gBAAoC,EACpC,UAA6C;QAE7C,MAAM,MAAM,GAAG,KAAK,CAAC,qBAAqB,CACtC,SAAS,EACT,gBAAgB,EAChB,UAAU,CACb,CAAA;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,gBAAgB,CAC5B,YAAoB,EACpB,OAA0B;QAE1B,IAAI,CAAC,0BAA0B,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;QACtD,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;QAC5D,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,gBAAgB,CAC5B,YAAoB,EACpB,aAAsB;QAEtB,IAAI,CAAC,6BAA6B,CAAC,YAAY,CAAC,CAAA;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,YAAY,EAAE,aAAa,CAAC,CAAA;QAClE,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,gBAAgB,CAC5B,UAAmC,EACnC,UAAmB,EACnB,WAAoB;QAEpB,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CACjC,UAAU,EACV,UAAU,EACV,WAAW,CACd,CAAA;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,cAAc,CAC1B,YAAoB,EACpB,WAA4B;QAE5B,IAAI,CAAC,6BAA6B,CAAC,YAAY,CAAC,CAAA;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAAC,YAAY,EAAE,WAAW,CAAC,CAAA;QAC9D,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,cAAc,CAC1B,QAA2C,EAC3C,UAA6C,EAC7C,UAAmB,EACnB,WAAoB;QAEpB,8EAA8E;QAC9E,8EAA8E;QAC9E,IAAI,CAAC,6BAA6B,CAAC,CAAC,UAAU,IAAI,WAAW,CAAE,CAAC,CAAA;QAChE,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAC/B,QAAQ,EACR,UAAU,EACV,UAAU,EACV,WAAW,CACd,CAAA;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,cAAc,CAC1B,YAAoB,EACpB,WAAqC,EACrC,aAAsB,EACtB,aAAsB,EACtB,WAA4B;QAE5B,IAAI,CAAC,6BAA6B,CAAC,YAAY,EAAE,WAAW,CAAC,CAAA;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,CAC/B,YAAY,EACZ,WAAW,EACX,aAAa,EACb,aAAa,EACb,WAAW,CACd,CAAA;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,oBAAoB;QAOhC,MAAM,MAAM,GAAG,KAAK,CAAC,oBAAoB,EAAE,CAAA;QAC3C,uEAAuE;QACvE,8DAA8D;QAC9D,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACvB,OAAO,MAAM,CAAA;IACjB,CAAC;IAEe,eAAe,CAC3B,WAAsC;QAEtC,mEAAmE;QACnE,sEAAsE;QACtE,sDAAsD;QACtD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAiC,CAAA;QACtD,MAAM,gBAAgB,GAAG,2BAA2B,CAChD,OAAO;QACP,2EAA2E;QAC3E,yEAAyE;QACzE,gDAAgD;QAChD,WAAwD,EACxD,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAC3B,CAAA;QACD,IAAI,gBAAgB,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACrD,GAAG,CAAC;gBACJ,OAAO,EAAE,GAAG,4BAA4B,KAAK,CAAC,CAAC,OAAO,EAAE;aAC3D,CAAC,CAAC,CAAA;YACH,MAAM,IAAI,uBAAuB,CAAC,QAAQ,CAAC,CAAA;QAC/C,CAAC;QACD,KAAK,CAAC,eAAe,CAAC,WAAW,CAAC,CAAA;IACtC,CAAC;IAED,4EAA4E;IAC5E,0BAA0B;IAC1B,4EAA4E;IAE5E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACI,oBAAoB,CACvB,WAAiC,EACjC,QAA2B,EAC3B,cAAqC;QAErC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAiC,CAAA;QACtD,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,CAAA;QAE7C,gDAAgD;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAA;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YACnD,IACI,IAAI;gBACJ,IAAI,CAAC,IAAI,KAAK,UAAU;gBACxB,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,EAC1D,CAAC;gBACC,sEAAsE;gBACtE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW;qBAC5B,mBAAmB,CAAC,MAAM,CAAC;qBAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;gBAC5C,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;gBAC9B,IAAI,UAAU,EAAE,CAAC;oBACb,MAAM,IAAI,uBAAuB,CAAC;wBAC9B;4BACI,IAAI,EAAE,+BAA+B;4BACrC,OAAO,EAAE,GAAG,+BAA+B,yDAAyD;4BACpG,UAAU,EAAE,SAAS;4BACrB,QAAQ,EAAE,OAAO,CAAC,EAAE;4BACpB,SAAS,EAAE,OAAO,CAAC,EAAE;yBACxB;qBACJ,CAAC,CAAA;gBACN,CAAC;YACL,CAAC;QACL,CAAC;QAED,mEAAmE;QACnE,gEAAgE;QAChE,MAAM,mBAAmB,GACrB,WAAW,CAAC,sBAAsB,CAAC,cAAc,CAAC,CAAA;QACtD,MAAM,gBAAgB,GAAG,QAAQ,CAAC,sBAAsB,CAAC,cAAc,CAAC,CAAA;QACxE,MAAM,UAAU,GAAG,mBAAmB,CAAC,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAA;QACvE,IAAI,UAAU,KAAK,CAAC;YAAE,OAAM;QAE5B,wEAAwE;QACxE,0EAA0E;QAC1E,2EAA2E;QAC3E,2EAA2E;QAC3E,uEAAuE;QACvE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAA;QAC3C,MAAM,oBAAoB,GAAa,EAAE,CAAA;QACzC,KAAK,MAAM,IAAI,IAAI,mBAAmB,EAAE,CAAC;YACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBACjD,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;gBAC7C,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;YACrD,CAAC;QACL,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;YAClC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBACjD,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;gBAC7C,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;YACrD,CAAC;QACL,CAAC;QAED,yEAAyE;QACzE,0EAA0E;QAC1E,wEAAwE;QACxE,6BAA6B;QAC7B,MAAM,mBAAmB,GACrB,oBAAoB,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACjC,cAAc,CAAC,wBAAwB,CAAC,OAAO,CAAC,CACnD,CAAA;QACL,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAqB,CAAC,CAAA;YACrD,CAAC;QACL,CAAC;QAED,2CAA2C;QAC3C,IAAI,CAAC,sCAAsC,CAAC,mBAAmB,CAAC,CAAA;QAEhE,6CAA6C;QAC7C,IAAI,CAAC,gBAAgB,EAAE,CAAA;IAC3B,CAAC;IAED;;;;;;;;;;;OAWG;IACK,sCAAsC,CAC1C,cAAqC;QAErC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAEvC,MAAM,KAAK,GAAI,IAAI,CAAC,OAAwB,CAAC,UAAU,CAAA;QACvD,MAAM,UAAU,GAAI,IAAI,CAAC,OAAwB,CAAC,eAAe,CAAA;QACjE,MAAM,SAAS,GAAI,IAAI,CAAC,OAAwB,CAAC,EAAE,CAAA;QAEnD,yEAAyE;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAiB,CAAA;QAE1C,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,qEAAqE;YACrE,iEAAiE;YACjE,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;YACpC,MAAM,SAAS,GAAG;gBACd,EAAE,EAAE,SAAS;gBACb,UAAU,EAAE,KAAK;gBACjB,eAAe,EAAE,UAAU;gBAC3B,SAAS;gBACT,QAAQ,EAAE,IAAI;gBACd,IAAI,EAAE,UAAmB;gBACzB,QAAQ,EAAE,SAAkB;aACM,CAAA;YACtC,MAAM,SAAS,GAAG;gBACd,EAAE,EAAE,QAAQ;gBACZ,UAAU,EAAE,KAAK;gBACjB,eAAe,EAAE,UAAU;gBAC3B,SAAS;gBACT,QAAQ,EAAE,IAAI,EAAE,8CAA8C;gBAC9D,IAAI,EAAE,UAAmB;gBACzB,UAAU,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE;aACE,CAAA;YACtC,sEAAsE;YACtE,0CAA0C;YAC1C,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,CAAC,CAAA;QACtE,CAAC;aAAM,CAAC;YACJ,oEAAoE;YACpE,kEAAkE;YAClE,mEAAmE;YACnE,mEAAmE;YACnE,gDAAgD;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;YAChC,MAAM,SAAS,GAAG;gBACd,EAAE,EAAE,SAAS;gBACb,UAAU,EAAE,KAAK;gBACjB,eAAe,EAAE,UAAU;gBAC3B,SAAS;gBACT,QAAQ,EAAE,IAAI;gBACd,IAAI,EAAE,UAAmB;gBACzB,QAAQ,EAAE,SAAkB;aACM,CAAA;YACtC,MAAM,IAAI,GAAG;gBACT,EAAE,EAAE,IAAI;gBACR,UAAU,EAAE,KAAK;gBACjB,eAAe,EAAE,UAAU;gBAC3B,SAAS;gBACT,QAAQ,EAAE,IAAI,EAAE,8CAA8C;gBAC9D,IAAI,EAAE,UAAmB;gBACzB,QAAQ,EAAE,IAAa;aACW,CAAA;YACtC,iFAAiF;YACjF,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,CAAC,CAAA;YAC7D,+DAA+D;YAC/D,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACrC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAA;gBACrC,MAAM,UAAU,GAAG;oBACf,EAAE,EAAE,SAAS;oBACb,UAAU,EAAE,KAAK;oBACjB,eAAe,EAAE,UAAU;oBAC3B,SAAS;oBACT,QAAQ,EAAE,IAAI;oBACd,IAAI,EAAE,UAAmB;oBACzB,UAAU,EAAE,SAAS,CAAC,EAAE;iBACU,CAAA;gBACtC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YAC5C,CAAC;QACL,CAAC;IACL,CAAC;IAED,4EAA4E;IAC5E,kBAAkB;IAClB,4EAA4E;IAE5E;;;;;;;OAOG;IACK,yBAAyB;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAA;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,SAAS,CAAA;QACpB,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;QACnD,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,OAAO,SAAS,CAAA;QACpB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,uCAAuC;YACvC,OAAO,MAAM,CAAA;QACjB,CAAC;QACD,IACI,IAAI,CAAC,IAAI,KAAK,UAAU;YACxB,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,EAC1D,CAAC;YACC,uEAAuE;YACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW;iBAC5B,mBAAmB,CAAC,MAAM,CAAC;iBAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;YAC5C,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAA;QAC1B,CAAC;QACD,OAAO,SAAS,CAAA;IACpB,CAAC;IAED;;;;;;;;;;OAUG;IACK,uBAAuB,CAAC,UAAmC;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAA;QACpC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,OAAM;QACV,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;QACnD,IACI,CAAC,IAAI;YACL,IAAI,CAAC,IAAI,KAAK,UAAU;YACxB,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,EAC1D,CAAC;YACC,OAAM;QACV,CAAC;QACD,+DAA+D;QAC/D,MAAM,YAAY,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAA;QACrD,IAAI,CAAC,YAAY,EAAE,CAAC;YAChB,OAAM;QACV,CAAC;QACD,yEAAyE;QACzE,yDAAyD;QACzD,IAAI,UAAU,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YACjC,0DAA0D;YAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,YAAY,CAAC,CAAA;YACnE,IACI,cAAc;gBACd,UAAU,CAAC,QAAQ,IAAI,cAAc,CAAC,QAAQ,EAChD,CAAC;gBACC,MAAM,IAAI,uBAAuB,CAAC;oBAC9B;wBACI,IAAI,EAAE,4BAA4B;wBAClC,OAAO,EAAE,GAAG,4BAA4B,gFAAgF;wBACxH,UAAU,EAAE,YAAY;wBACxB,QAAQ,EAAE,UAAU,CAAC,EAAE;wBACvB,SAAS,EAAG,IAAI,CAAC,OAAwB,CAAC,EAAE;qBAC/C;iBACJ,CAAC,CAAA;YACN,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,6BAA6B,CAAC,MAAc;QAChD,MAAM,YAAY,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAA;QACrD,IAAI,YAAY,KAAK,SAAS,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;YACxD,MAAM,IAAI,uBAAuB,CAAC;gBAC9B;oBACI,IAAI,EAAE,4BAA4B;oBAClC,OAAO,EAAE,GAAG,4BAA4B,6EAA6E;oBACrH,UAAU,EAAE,YAAY;oBACxB,QAAQ,EAAE,MAAM;oBAChB,SAAS,EAAG,IAAI,CAAC,OAAwB,CAAC,EAAE;iBAC/C;aACJ,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,0BAA0B,CAC9B,MAAc,EACd,OAA0B;QAE1B,MAAM,YAAY,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAA;QACrD,IAAI,YAAY,KAAK,SAAS,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;YACxD,OAAM;QACV,CAAC;QACD,IACI,OAAO,CAAC,UAAU,KAAK,SAAS;YAChC,OAAO,CAAC,QAAQ,KAAK,SAAS,EAChC,CAAC;YACC,MAAM,IAAI,uBAAuB,CAAC;gBAC9B;oBACI,IAAI,EAAE,4BAA4B;oBAClC,OAAO,EAAE,GAAG,4BAA4B,+FAA+F;oBACvI,UAAU,EAAE,YAAY;oBACxB,QAAQ,EAAE,MAAM;oBAChB,SAAS,EAAG,IAAI,CAAC,OAAwB,CAAC,EAAE;iBAC/C;aACJ,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,6BAA6B,CACjC,MAAc,EACd,WAAqC;QAErC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAA;QACpC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YAC5C,OAAM;QACV,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;QACnD,IACI,CAAC,IAAI;YACL,IAAI,CAAC,IAAI,KAAK,UAAU;YACxB,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,EAC1D,CAAC;YACC,OAAM;QACV,CAAC;QACD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,KAAK,EAAE,CAAC;YACrD,MAAM,IAAI,uBAAuB,CAAC;gBAC9B;oBACI,IAAI,EAAE,gCAAgC;oBACtC,OAAO,EAAE,GAAG,gCAAgC,8DAA8D,IAAI,CAAC,QAAQ,SAAS,WAAW,0CAA0C;oBACrL,UAAU,EAAE,YAAY;oBACxB,QAAQ,EAAE,MAAM;oBAChB,SAAS,EAAG,IAAI,CAAC,OAAwB,CAAC,EAAE;iBAC/C;aACJ,CAAC,CAAA;QACN,CAAC;IACL,CAAC;CACJ"}

package/dist/lib/schemata/claim-axiom.d.ts

@@ -1,11 +0,0 @@
-import Type, { type Static } from "typebox";
-export declare const CoreClaimAxiomSchema: Type.TObject<{
-    id: Type.TString;
-    claimId: Type.TString;
-    claimVersion: Type.TNumber;
-    supportingClaimId: Type.TString;
-    supportingClaimVersion: Type.TNumber;
-    checksum: Type.TString;
-}>;
-export type TCoreClaimAxiom = Static<typeof CoreClaimAxiomSchema>;
-//# sourceMappingURL=claim-axiom.d.ts.map

package/dist/lib/schemata/claim-axiom.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"claim-axiom.d.ts","sourceRoot":"","sources":["../../../src/lib/schemata/claim-axiom.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;AAG3C,eAAO,MAAM,oBAAoB;;;;;;;EAShC,CAAA;AACD,MAAM,MAAM,eAAe,GAAG,MAAM,CAAC,OAAO,oBAAoB,CAAC,CAAA"}

package/dist/lib/schemata/claim-axiom.js

@@ -1,9 +0,0 @@
-import Type, {} from "typebox";
-import { CoreClaimConnectionSchema } from "./claim-connection.js";
-export const CoreClaimAxiomSchema = Type.Object({
-    ...CoreClaimConnectionSchema.properties,
-}, {
-    additionalProperties: true,
-    description: "A directional axiom-invocation edge: the claim at supportingClaimId (type='axiomatic') supports the claim at claimId (type='normal'). Extended via additionalProperties for app-level fields.",
-});
-//# sourceMappingURL=claim-axiom.js.map

package/dist/lib/schemata/claim-axiom.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"claim-axiom.js","sourceRoot":"","sources":["../../../src/lib/schemata/claim-axiom.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAe,MAAM,SAAS,CAAA;AAC3C,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAA;AAEjE,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAC3C;IACI,GAAG,yBAAyB,CAAC,UAAU;CAC1C,EACD;IACI,oBAAoB,EAAE,IAAI;IAC1B,WAAW,EACP,+LAA+L;CACtM,CACJ,CAAA"}

package/dist/lib/schemata/claim-citation.d.ts

@@ -1,11 +0,0 @@
-import Type, { type Static } from "typebox";
-export declare const CoreClaimCitationSchema: Type.TObject<{
-    id: Type.TString;
-    claimId: Type.TString;
-    claimVersion: Type.TNumber;
-    supportingClaimId: Type.TString;
-    supportingClaimVersion: Type.TNumber;
-    checksum: Type.TString;
-}>;
-export type TCoreClaimCitation = Static<typeof CoreClaimCitationSchema>;
-//# sourceMappingURL=claim-citation.d.ts.map

package/dist/lib/schemata/claim-citation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"claim-citation.d.ts","sourceRoot":"","sources":["../../../src/lib/schemata/claim-citation.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAE,KAAK,MAAM,EAAE,MAAM,SAAS,CAAA;AAG3C,eAAO,MAAM,uBAAuB;;;;;;;EASnC,CAAA;AACD,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,OAAO,uBAAuB,CAAC,CAAA"}

package/dist/lib/schemata/claim-citation.js

@@ -1,9 +0,0 @@
-import Type, {} from "typebox";
-import { CoreClaimConnectionSchema } from "./claim-connection.js";
-export const CoreClaimCitationSchema = Type.Object({
-    ...CoreClaimConnectionSchema.properties,
-}, {
-    additionalProperties: true,
-    description: "A directional citation edge: the claim at supportingClaimId is cited as evidence for the claim at claimId. The supporting-side endpoint must reference a claim with type='citation'. Extended via additionalProperties for app-level fields.",
-});
-//# sourceMappingURL=claim-citation.js.map

package/dist/lib/schemata/claim-citation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"claim-citation.js","sourceRoot":"","sources":["../../../src/lib/schemata/claim-citation.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,EAAE,EAAe,MAAM,SAAS,CAAA;AAC3C,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAA;AAEjE,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC,MAAM,CAC9C;IACI,GAAG,yBAAyB,CAAC,UAAU;CAC1C,EACD;IACI,oBAAoB,EAAE,IAAI;IAC1B,WAAW,EACP,8OAA8O;CACrP,CACJ,CAAA"}