@polintpro/proposit-core 0.6.6 → 0.7.5

package/dist/lib/types/validation.js

@@ -0,0 +1,43 @@
+// -- Expression-level codes --
+export const EXPR_SCHEMA_INVALID = "EXPR_SCHEMA_INVALID";
+export const EXPR_DUPLICATE_ID = "EXPR_DUPLICATE_ID";
+export const EXPR_SELF_REFERENTIAL_PARENT = "EXPR_SELF_REFERENTIAL_PARENT";
+export const EXPR_PARENT_NOT_FOUND = "EXPR_PARENT_NOT_FOUND";
+export const EXPR_PARENT_NOT_CONTAINER = "EXPR_PARENT_NOT_CONTAINER";
+export const EXPR_ROOT_ONLY_VIOLATED = "EXPR_ROOT_ONLY_VIOLATED";
+export const EXPR_FORMULA_BETWEEN_OPERATORS_VIOLATED = "EXPR_FORMULA_BETWEEN_OPERATORS_VIOLATED";
+export const EXPR_CHILD_LIMIT_EXCEEDED = "EXPR_CHILD_LIMIT_EXCEEDED";
+export const EXPR_POSITION_DUPLICATE = "EXPR_POSITION_DUPLICATE";
+export const EXPR_CHECKSUM_MISMATCH = "EXPR_CHECKSUM_MISMATCH";
+// -- Premise-level codes --
+export const PREMISE_SCHEMA_INVALID = "PREMISE_SCHEMA_INVALID";
+export const PREMISE_ROOT_EXPRESSION_INVALID = "PREMISE_ROOT_EXPRESSION_INVALID";
+export const PREMISE_VARIABLE_REF_NOT_FOUND = "PREMISE_VARIABLE_REF_NOT_FOUND";
+export const PREMISE_CHECKSUM_MISMATCH = "PREMISE_CHECKSUM_MISMATCH";
+// -- Variable-level codes --
+export const VAR_SCHEMA_INVALID = "VAR_SCHEMA_INVALID";
+export const VAR_DUPLICATE_ID = "VAR_DUPLICATE_ID";
+export const VAR_DUPLICATE_SYMBOL = "VAR_DUPLICATE_SYMBOL";
+export const VAR_CHECKSUM_MISMATCH = "VAR_CHECKSUM_MISMATCH";
+// -- Argument-level codes --
+export const ARG_SCHEMA_INVALID = "ARG_SCHEMA_INVALID";
+export const ARG_OWNERSHIP_MISMATCH = "ARG_OWNERSHIP_MISMATCH";
+export const ARG_CLAIM_REF_NOT_FOUND = "ARG_CLAIM_REF_NOT_FOUND";
+export const ARG_PREMISE_REF_NOT_FOUND = "ARG_PREMISE_REF_NOT_FOUND";
+export const ARG_CIRCULARITY_DETECTED = "ARG_CIRCULARITY_DETECTED";
+export const ARG_CONCLUSION_NOT_FOUND = "ARG_CONCLUSION_NOT_FOUND";
+export const ARG_CHECKSUM_MISMATCH = "ARG_CHECKSUM_MISMATCH";
+// -- ClaimLibrary codes --
+export const CLAIM_SCHEMA_INVALID = "CLAIM_SCHEMA_INVALID";
+export const CLAIM_FROZEN_NO_SUCCESSOR = "CLAIM_FROZEN_NO_SUCCESSOR";
+// -- SourceLibrary codes --
+export const SOURCE_SCHEMA_INVALID = "SOURCE_SCHEMA_INVALID";
+export const SOURCE_FROZEN_NO_SUCCESSOR = "SOURCE_FROZEN_NO_SUCCESSOR";
+// -- ClaimSourceLibrary codes --
+export const ASSOC_SCHEMA_INVALID = "ASSOC_SCHEMA_INVALID";
+export const ASSOC_DUPLICATE_ID = "ASSOC_DUPLICATE_ID";
+export const ASSOC_CLAIM_REF_NOT_FOUND = "ASSOC_CLAIM_REF_NOT_FOUND";
+export const ASSOC_SOURCE_REF_NOT_FOUND = "ASSOC_SOURCE_REF_NOT_FOUND";
+// -- ForksLibrary codes --
+export const FORK_SCHEMA_INVALID = "FORK_SCHEMA_INVALID";
+//# sourceMappingURL=validation.js.map

package/dist/lib/types/validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation.js","sourceRoot":"","sources":["../../../src/lib/types/validation.ts"],"names":[],"mappings":"AAuBA,+BAA+B;AAC/B,MAAM,CAAC,MAAM,mBAAmB,GAAG,qBAAqB,CAAA;AACxD,MAAM,CAAC,MAAM,iBAAiB,GAAG,mBAAmB,CAAA;AACpD,MAAM,CAAC,MAAM,4BAA4B,GAAG,8BAA8B,CAAA;AAC1E,MAAM,CAAC,MAAM,qBAAqB,GAAG,uBAAuB,CAAA;AAC5D,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AACpE,MAAM,CAAC,MAAM,uBAAuB,GAAG,yBAAyB,CAAA;AAChE,MAAM,CAAC,MAAM,uCAAuC,GAChD,yCAAyC,CAAA;AAC7C,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AACpE,MAAM,CAAC,MAAM,uBAAuB,GAAG,yBAAyB,CAAA;AAChE,MAAM,CAAC,MAAM,sBAAsB,GAAG,wBAAwB,CAAA;AAE9D,4BAA4B;AAC5B,MAAM,CAAC,MAAM,sBAAsB,GAAG,wBAAwB,CAAA;AAC9D,MAAM,CAAC,MAAM,+BAA+B,GAAG,iCAAiC,CAAA;AAChF,MAAM,CAAC,MAAM,8BAA8B,GAAG,gCAAgC,CAAA;AAC9E,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AAEpE,6BAA6B;AAC7B,MAAM,CAAC,MAAM,kBAAkB,GAAG,oBAAoB,CAAA;AACtD,MAAM,CAAC,MAAM,gBAAgB,GAAG,kBAAkB,CAAA;AAClD,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAA;AAC1D,MAAM,CAAC,MAAM,qBAAqB,GAAG,uBAAuB,CAAA;AAE5D,6BAA6B;AAC7B,MAAM,CAAC,MAAM,kBAAkB,GAAG,oBAAoB,CAAA;AACtD,MAAM,CAAC,MAAM,sBAAsB,GAAG,wBAAwB,CAAA;AAC9D,MAAM,CAAC,MAAM,uBAAuB,GAAG,yBAAyB,CAAA;AAChE,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AACpE,MAAM,CAAC,MAAM,wBAAwB,GAAG,0BAA0B,CAAA;AAClE,MAAM,CAAC,MAAM,wBAAwB,GAAG,0BAA0B,CAAA;AAClE,MAAM,CAAC,MAAM,qBAAqB,GAAG,uBAAuB,CAAA;AAE5D,2BAA2B;AAC3B,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAA;AAC1D,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AAEpE,4BAA4B;AAC5B,MAAM,CAAC,MAAM,qBAAqB,GAAG,uBAAuB,CAAA;AAC5D,MAAM,CAAC,MAAM,0BAA0B,GAAG,4BAA4B,CAAA;AAEtE,iCAAiC;AACjC,MAAM,CAAC,MAAM,oBAAoB,GAAG,sBAAsB,CAAA;AAC1D,MAAM,CAAC,MAAM,kBAAkB,GAAG,oBAAoB,CAAA;AACtD,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAA;AACpE,MAAM,CAAC,MAAM,0BAA0B,GAAG,4BAA4B,CAAA;AAEtE,2BAA2B;AAC3B,MAAM,CAAC,MAAM,mBAAmB,GAAG,qBAAqB,CAAA"}

package/dist/lib/utils/changeset.d.ts

@@ -0,0 +1,124 @@
+import type { TCorePropositionalExpression, TCorePropositionalVariable, TCorePremise } from "../schemata/propositional.js";
+import type { TCoreArgument, TCoreArgumentRoleState } from "../schemata/argument.js";
+import type { TCoreChangeset } from "../types/mutation.js";
+/**
+ * Merges two changesets into one, deduplicating entities by `id` within each
+ * bucket (added/modified/removed) with last-write-wins semantics.
+ *
+ * Use this when a single logical operation requires multiple engine calls that
+ * each produce a changeset. For example, creating a conclusion premise requires
+ * both `createPremiseWithId` and `setConclusionPremise`, each returning a
+ * changeset — `mergeChangesets` combines them into one changeset suitable for
+ * a single persistence call.
+ *
+ * @param a - The first changeset.
+ * @param b - The second changeset. Its entries take precedence when both
+ *   changesets contain the same entity ID in the same bucket.
+ * @returns A merged changeset. Entity categories that are empty after merge
+ *   are omitted from the result.
+ * @throws {Error} If any entity ID appears in more than one bucket
+ *   (added/modified/removed) within the same category after merge. This
+ *   indicates a logic error in the caller.
+ *
+ * @example
+ * ```ts
+ * const { changes: createChanges } = engine.createPremiseWithId(premiseId, data)
+ * const { changes: roleChanges } = engine.setConclusionPremise(premiseId)
+ * const combined = mergeChangesets(createChanges, roleChanges)
+ * await persistChangeset(db, combined)
+ * ```
+ */
+export declare function mergeChangesets<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TPremise extends TCorePremise = TCorePremise, TArg extends TCoreArgument = TCoreArgument>(a: TCoreChangeset<TExpr, TVar, TPremise, TArg>, b: TCoreChangeset<TExpr, TVar, TPremise, TArg>): TCoreChangeset<TExpr, TVar, TPremise, TArg>;
+/**
+ * A single persistence operation extracted from a changeset, tagged with
+ * its operation type (`insert`, `update`, or `delete`) and entity kind.
+ *
+ * Used as the element type for the ordered operation list returned by
+ * {@link orderChangeset}.
+ */
+export type TOrderedOperation<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TPremise extends TCorePremise = TCorePremise, TArg extends TCoreArgument = TCoreArgument> = {
+    type: "delete";
+    entity: "expression";
+    data: TExpr;
+} | {
+    type: "delete";
+    entity: "variable";
+    data: TVar;
+} | {
+    type: "delete";
+    entity: "premise";
+    data: TPremise;
+} | {
+    type: "insert";
+    entity: "premise";
+    data: TPremise;
+} | {
+    type: "insert";
+    entity: "variable";
+    data: TVar;
+} | {
+    type: "insert";
+    entity: "expression";
+    data: TExpr;
+} | {
+    type: "update";
+    entity: "expression";
+    data: TExpr;
+} | {
+    type: "update";
+    entity: "variable";
+    data: TVar;
+} | {
+    type: "update";
+    entity: "premise";
+    data: TPremise;
+} | {
+    type: "update";
+    entity: "argument";
+    data: TArg;
+} | {
+    type: "update";
+    entity: "roles";
+    data: TCoreArgumentRoleState;
+};
+/**
+ * Converts a changeset into a flat, ordered array of persistence operations
+ * that is safe to execute sequentially against a relational store with
+ * foreign-key constraints.
+ *
+ * The FK dependency chain is:
+ * - `expression.premiseId` → `premise.id`
+ * - `expression.variableId` → `variable.id` (for variable-type expressions)
+ * - `expression.parentId` → `expression.id` (self-FK for tree structure)
+ * - `variable.argumentId` → `argument.id`
+ * - `premise.argumentId` → `argument.id`
+ *
+ * The resulting order guarantees that every referenced row exists before any
+ * row that depends on it is inserted, and that every dependent row is removed
+ * before the row it references is deleted.
+ *
+ * Ordering phases:
+ * 1. Update premises — ensure premise rows have correct metadata before
+ *    dependent deletes run.
+ * 2. Delete expressions — expression rows hold FKs to variables and premises,
+ *    so they must be removed first.
+ * 3. Delete variables — safe after expression deletes (no remaining FK
+ *    references from expressions).
+ * 4. Delete premises — safe after all child rows are removed.
+ * 5. Insert premises — new premises must exist before their expressions and
+ *    variables can be inserted.
+ * 6. Insert variables — new variables must exist before variable-type
+ *    expressions can reference them.
+ * 7. Insert expressions — topologically sorted so parent expressions are
+ *    inserted before their children (satisfies the parentId self-FK).
+ * 8. Update variables — grouped after inserts for clarity.
+ * 9. Update expressions — checksum and position updates.
+ * 10. Update argument metadata — if present.
+ * 11. Update role state — if present.
+ *
+ * @param changeset - The changeset to convert into ordered operations.
+ * @returns A flat array of {@link TOrderedOperation} entries in FK-safe
+ *   execution order. Returns an empty array if the changeset is empty.
+ */
+export declare function orderChangeset<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression, TVar extends TCorePropositionalVariable = TCorePropositionalVariable, TPremise extends TCorePremise = TCorePremise, TArg extends TCoreArgument = TCoreArgument>(changeset: TCoreChangeset<TExpr, TVar, TPremise, TArg>): TOrderedOperation<TExpr, TVar, TPremise, TArg>[];
+//# sourceMappingURL=changeset.d.ts.map

package/dist/lib/utils/changeset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"changeset.d.ts","sourceRoot":"","sources":["../../../src/lib/utils/changeset.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACR,4BAA4B,EAC5B,0BAA0B,EAC1B,YAAY,EACf,MAAM,8BAA8B,CAAA;AACrC,OAAO,KAAK,EACR,aAAa,EACb,sBAAsB,EACzB,MAAM,yBAAyB,CAAA;AAChC,OAAO,KAAK,EAAsB,cAAc,EAAE,MAAM,sBAAsB,CAAA;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,eAAe,CAC3B,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,IAAI,SAAS,aAAa,GAAG,aAAa,EAE1C,CAAC,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,EAC9C,CAAC,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,GAC/C,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAqC7C;AAoDD;;;;;;GAMG;AACH,MAAM,MAAM,iBAAiB,CACzB,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,IAAI,SAAS,aAAa,GAAG,aAAa,IAExC;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,KAAK,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,KAAK,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,KAAK,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,sBAAsB,CAAA;CAAE,CAAA;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,wBAAgB,cAAc,CAC1B,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,EACzE,IAAI,SAAS,0BAA0B,GAAG,0BAA0B,EACpE,QAAQ,SAAS,YAAY,GAAG,YAAY,EAC5C,IAAI,SAAS,aAAa,GAAG,aAAa,EAE1C,SAAS,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,GACvD,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CA4ElD"}

package/dist/lib/utils/changeset.js

@@ -0,0 +1,221 @@
+/**
+ * Merges two changesets into one, deduplicating entities by `id` within each
+ * bucket (added/modified/removed) with last-write-wins semantics.
+ *
+ * Use this when a single logical operation requires multiple engine calls that
+ * each produce a changeset. For example, creating a conclusion premise requires
+ * both `createPremiseWithId` and `setConclusionPremise`, each returning a
+ * changeset — `mergeChangesets` combines them into one changeset suitable for
+ * a single persistence call.
+ *
+ * @param a - The first changeset.
+ * @param b - The second changeset. Its entries take precedence when both
+ *   changesets contain the same entity ID in the same bucket.
+ * @returns A merged changeset. Entity categories that are empty after merge
+ *   are omitted from the result.
+ * @throws {Error} If any entity ID appears in more than one bucket
+ *   (added/modified/removed) within the same category after merge. This
+ *   indicates a logic error in the caller.
+ *
+ * @example
+ * ```ts
+ * const { changes: createChanges } = engine.createPremiseWithId(premiseId, data)
+ * const { changes: roleChanges } = engine.setConclusionPremise(premiseId)
+ * const combined = mergeChangesets(createChanges, roleChanges)
+ * await persistChangeset(db, combined)
+ * ```
+ */
+export function mergeChangesets(a, b) {
+    const result = {};
+    const mergedExpressions = mergeEntityChanges(a.expressions, b.expressions, "expressions");
+    if (mergedExpressions)
+        result.expressions = mergedExpressions;
+    const mergedVariables = mergeEntityChanges(a.variables, b.variables, "variables");
+    if (mergedVariables)
+        result.variables = mergedVariables;
+    const mergedPremises = mergeEntityChanges(a.premises, b.premises, "premises");
+    if (mergedPremises)
+        result.premises = mergedPremises;
+    if (b.roles !== undefined) {
+        result.roles = b.roles;
+    }
+    else if (a.roles !== undefined) {
+        result.roles = a.roles;
+    }
+    if (b.argument !== undefined) {
+        result.argument = b.argument;
+    }
+    else if (a.argument !== undefined) {
+        result.argument = a.argument;
+    }
+    return result;
+}
+function mergeEntityChanges(a, b, categoryName) {
+    if (!a && !b)
+        return undefined;
+    const dedup = (aList, bList) => {
+        const map = new Map();
+        for (const item of aList)
+            map.set(item.id, item);
+        for (const item of bList)
+            map.set(item.id, item);
+        return [...map.values()];
+    };
+    const added = dedup(a?.added ?? [], b?.added ?? []);
+    const modified = dedup(a?.modified ?? [], b?.modified ?? []);
+    const removed = dedup(a?.removed ?? [], b?.removed ?? []);
+    // Enforce invariant: no entity ID may appear in more than one bucket.
+    const addedIds = new Set(added.map((e) => e.id));
+    const modifiedIds = new Set(modified.map((e) => e.id));
+    const removedIds = new Set(removed.map((e) => e.id));
+    for (const id of addedIds) {
+        if (modifiedIds.has(id)) {
+            throw new Error(`mergeChangesets: entity "${id}" appears in both added and modified in ${categoryName}`);
+        }
+        if (removedIds.has(id)) {
+            throw new Error(`mergeChangesets: entity "${id}" appears in both added and removed in ${categoryName}`);
+        }
+    }
+    for (const id of modifiedIds) {
+        if (removedIds.has(id)) {
+            throw new Error(`mergeChangesets: entity "${id}" appears in both modified and removed in ${categoryName}`);
+        }
+    }
+    if (added.length === 0 && modified.length === 0 && removed.length === 0) {
+        return undefined;
+    }
+    return { added, modified, removed };
+}
+/**
+ * Converts a changeset into a flat, ordered array of persistence operations
+ * that is safe to execute sequentially against a relational store with
+ * foreign-key constraints.
+ *
+ * The FK dependency chain is:
+ * - `expression.premiseId` → `premise.id`
+ * - `expression.variableId` → `variable.id` (for variable-type expressions)
+ * - `expression.parentId` → `expression.id` (self-FK for tree structure)
+ * - `variable.argumentId` → `argument.id`
+ * - `premise.argumentId` → `argument.id`
+ *
+ * The resulting order guarantees that every referenced row exists before any
+ * row that depends on it is inserted, and that every dependent row is removed
+ * before the row it references is deleted.
+ *
+ * Ordering phases:
+ * 1. Update premises — ensure premise rows have correct metadata before
+ *    dependent deletes run.
+ * 2. Delete expressions — expression rows hold FKs to variables and premises,
+ *    so they must be removed first.
+ * 3. Delete variables — safe after expression deletes (no remaining FK
+ *    references from expressions).
+ * 4. Delete premises — safe after all child rows are removed.
+ * 5. Insert premises — new premises must exist before their expressions and
+ *    variables can be inserted.
+ * 6. Insert variables — new variables must exist before variable-type
+ *    expressions can reference them.
+ * 7. Insert expressions — topologically sorted so parent expressions are
+ *    inserted before their children (satisfies the parentId self-FK).
+ * 8. Update variables — grouped after inserts for clarity.
+ * 9. Update expressions — checksum and position updates.
+ * 10. Update argument metadata — if present.
+ * 11. Update role state — if present.
+ *
+ * @param changeset - The changeset to convert into ordered operations.
+ * @returns A flat array of {@link TOrderedOperation} entries in FK-safe
+ *   execution order. Returns an empty array if the changeset is empty.
+ */
+export function orderChangeset(changeset) {
+    const ops = [];
+    // Phase 1: Update premises — ensure premise rows have correct metadata
+    // before dependent deletes run.
+    for (const p of changeset.premises?.modified ?? []) {
+        ops.push({ type: "update", entity: "premise", data: p });
+    }
+    // Phase 2: Delete expressions — reverse-topologically sorted so children
+    // are deleted before parents (satisfies the parentId self-FK).
+    const removedExprs = changeset.expressions?.removed ?? [];
+    const sortedRemoved = topologicalSortExpressions(removedExprs).reverse();
+    for (const e of sortedRemoved) {
+        ops.push({ type: "delete", entity: "expression", data: e });
+    }
+    // Phase 3: Delete variables — safe after expression deletes (no
+    // remaining FK references from expressions).
+    for (const v of changeset.variables?.removed ?? []) {
+        ops.push({ type: "delete", entity: "variable", data: v });
+    }
+    // Phase 4: Delete premises — safe after all child rows (expressions,
+    // variables) are removed.
+    for (const p of changeset.premises?.removed ?? []) {
+        ops.push({ type: "delete", entity: "premise", data: p });
+    }
+    // Phase 5: Insert premises — new premises must exist before their
+    // expressions and variables can be inserted.
+    for (const p of changeset.premises?.added ?? []) {
+        ops.push({ type: "insert", entity: "premise", data: p });
+    }
+    // Phase 6: Insert variables — new variables must exist before
+    // variable-type expressions can reference them.
+    for (const v of changeset.variables?.added ?? []) {
+        ops.push({ type: "insert", entity: "variable", data: v });
+    }
+    // Phase 7: Insert expressions — topologically sorted so parent
+    // expressions are inserted before their children (satisfies the
+    // parentId self-FK).
+    const sortedInsertExprs = topologicalSortExpressions(changeset.expressions?.added ?? []);
+    for (const e of sortedInsertExprs) {
+        ops.push({ type: "insert", entity: "expression", data: e });
+    }
+    // Phase 8: Update variables — grouped after inserts for clarity.
+    for (const v of changeset.variables?.modified ?? []) {
+        ops.push({ type: "update", entity: "variable", data: v });
+    }
+    // Phase 9: Update expressions — checksum and position updates.
+    for (const e of changeset.expressions?.modified ?? []) {
+        ops.push({ type: "update", entity: "expression", data: e });
+    }
+    // Phase 10: Update argument metadata — if present.
+    if (changeset.argument !== undefined) {
+        ops.push({
+            type: "update",
+            entity: "argument",
+            data: changeset.argument,
+        });
+    }
+    // Phase 11: Update role state — if present.
+    if (changeset.roles !== undefined) {
+        ops.push({ type: "update", entity: "roles", data: changeset.roles });
+    }
+    return ops;
+}
+/**
+ * Topologically sorts expressions so that parents appear before children,
+ * using the `parentId` field. Expressions with `parentId: null` (roots)
+ * come first, followed by their children in dependency order.
+ */
+function topologicalSortExpressions(expressions) {
+    if (expressions.length <= 1)
+        return expressions;
+    const byId = new Map();
+    for (const expr of expressions) {
+        byId.set(expr.id, expr);
+    }
+    const sorted = [];
+    const visited = new Set();
+    function visit(expr) {
+        if (visited.has(expr.id))
+            return;
+        // If this expression has a parent that is also in the insertion set,
+        // ensure the parent is emitted first.
+        if (expr.parentId !== null && byId.has(expr.parentId)) {
+            visit(byId.get(expr.parentId));
+        }
+        visited.add(expr.id);
+        sorted.push(expr);
+    }
+    for (const expr of expressions) {
+        visit(expr);
+    }
+    return sorted;
+}
+//# sourceMappingURL=changeset.js.map

package/dist/lib/utils/changeset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"changeset.js","sourceRoot":"","sources":["../../../src/lib/utils/changeset.ts"],"names":[],"mappings":"AAWA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,eAAe,CAM3B,CAA8C,EAC9C,CAA8C;IAE9C,MAAM,MAAM,GAAgD,EAAE,CAAA;IAE9D,MAAM,iBAAiB,GAAG,kBAAkB,CACxC,CAAC,CAAC,WAAW,EACb,CAAC,CAAC,WAAW,EACb,aAAa,CAChB,CAAA;IACD,IAAI,iBAAiB;QAAE,MAAM,CAAC,WAAW,GAAG,iBAAiB,CAAA;IAE7D,MAAM,eAAe,GAAG,kBAAkB,CACtC,CAAC,CAAC,SAAS,EACX,CAAC,CAAC,SAAS,EACX,WAAW,CACd,CAAA;IACD,IAAI,eAAe;QAAE,MAAM,CAAC,SAAS,GAAG,eAAe,CAAA;IAEvD,MAAM,cAAc,GAAG,kBAAkB,CACrC,CAAC,CAAC,QAAQ,EACV,CAAC,CAAC,QAAQ,EACV,UAAU,CACb,CAAA;IACD,IAAI,cAAc;QAAE,MAAM,CAAC,QAAQ,GAAG,cAAc,CAAA;IAEpD,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;IAC1B,CAAC;SAAM,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;IAC1B,CAAC;IAED,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAA;IAChC,CAAC;SAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAClC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAA;IAChC,CAAC;IAED,OAAO,MAAM,CAAA;AACjB,CAAC;AAED,SAAS,kBAAkB,CACvB,CAAoC,EACpC,CAAoC,EACpC,YAAoB;IAEpB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IAE9B,MAAM,KAAK,GAAG,CAAC,KAAU,EAAE,KAAU,EAAO,EAAE;QAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAA;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAChD,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAChD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;IAC5B,CAAC,CAAA;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAA;IACnD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAA;IAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,EAAE,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC,CAAA;IAEzD,sEAAsE;IACtE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAChD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACtD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAEpD,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QACxB,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACX,4BAA4B,EAAE,2CAA2C,YAAY,EAAE,CAC1F,CAAA;QACL,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CACX,4BAA4B,EAAE,0CAA0C,YAAY,EAAE,CACzF,CAAA;QACL,CAAC;IACL,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC3B,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CACX,4BAA4B,EAAE,6CAA6C,YAAY,EAAE,CAC5F,CAAA;QACL,CAAC;IACL,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtE,OAAO,SAAS,CAAA;IACpB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAA;AACvC,CAAC;AA2BD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,UAAU,cAAc,CAM1B,SAAsD;IAEtD,MAAM,GAAG,GAAqD,EAAE,CAAA;IAEhE,uEAAuE;IACvE,gCAAgC;IAChC,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC5D,CAAC;IAED,yEAAyE;IACzE,+DAA+D;IAC/D,MAAM,YAAY,GAAG,SAAS,CAAC,WAAW,EAAE,OAAO,IAAI,EAAE,CAAA;IACzD,MAAM,aAAa,GAAG,0BAA0B,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAA;IACxE,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC5B,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC/D,CAAC;IAED,gEAAgE;IAChE,6CAA6C;IAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,SAAS,EAAE,OAAO,IAAI,EAAE,EAAE,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,qEAAqE;IACrE,0BAA0B;IAC1B,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,OAAO,IAAI,EAAE,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC5D,CAAC;IAED,kEAAkE;IAClE,6CAA6C;IAC7C,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC;QAC9C,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC5D,CAAC;IAED,8DAA8D;IAC9D,gDAAgD;IAChD,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,+DAA+D;IAC/D,gEAAgE;IAChE,qBAAqB;IACrB,MAAM,iBAAiB,GAAG,0BAA0B,CAChD,SAAS,CAAC,WAAW,EAAE,KAAK,IAAI,EAAE,CACrC,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC/D,CAAC;IAED,iEAAiE;IACjE,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,SAAS,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC;QAClD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,+DAA+D;IAC/D,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,WAAW,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAC;QACpD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;IAC/D,CAAC;IAED,mDAAmD;IACnD,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,GAAG,CAAC,IAAI,CAAC;YACL,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,UAAU;YAClB,IAAI,EAAE,SAAS,CAAC,QAAQ;SAC3B,CAAC,CAAA;IACN,CAAC;IAED,4CAA4C;IAC5C,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAA;IACxE,CAAC;IAED,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,0BAA0B,CAC/B,WAAoB;IAEpB,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,WAAW,CAAA;IAE/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAA;IACrC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED,MAAM,MAAM,GAAY,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,SAAS,KAAK,CAAC,IAAW;QACtB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAM;QAChC,qEAAqE;QACrE,sCAAsC;QACtC,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,CAAA;QACnC,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,CAAA;IACf,CAAC;IAED,OAAO,MAAM,CAAA;AACjB,CAAC"}

package/dist/lib/utils/lookup.d.ts

@@ -0,0 +1,47 @@
+import type { TClaimLookup, TSourceLookup, TClaimSourceLookup } from "../core/interfaces/library.interfaces.js";
+/**
+ * Creates a keyed lookup from an array of items. Items are indexed by a
+ * composite string key (typically `"id:version"`), and the returned object
+ * exposes a `get(id, version)` method that reconstructs the same key
+ * internally.
+ *
+ * Use this to build the `TClaimLookup` or `TSourceLookup` required by
+ * `ArgumentEngine`'s constructor from flat arrays (e.g. database query
+ * results).
+ *
+ * @param items - The array of items to index.
+ * @param getKey - A function that produces the composite key for each item.
+ *   Must return a string of the form `"id:version"` so that the returned
+ *   `get(id, version)` method can reconstruct it.
+ * @returns An object with a `get(id, version)` method that looks up items
+ *   by reconstructing the composite key. Returns `undefined` if no item
+ *   matches.
+ *
+ * @example
+ * ```ts
+ * const claimLookup = createLookup(claims, (c) => `${c.id}:${c.version}`)
+ * const sourceLookup = createLookup(sources, (s) => `${s.id}:${s.version}`)
+ * const engine = new ArgumentEngine(arg, claimLookup, sourceLookup, ...)
+ * ```
+ */
+export declare function createLookup<T>(items: T[], getKey: (item: T) => string): {
+    get(id: string, version: number): T | undefined;
+};
+/**
+ * A no-op claim lookup that always returns `undefined`. Use this when the
+ * consumer does not use claims (e.g. an argument with no claim-bound
+ * variables).
+ */
+export declare const EMPTY_CLAIM_LOOKUP: TClaimLookup;
+/**
+ * A no-op source lookup that always returns `undefined`. Use this when the
+ * consumer does not use sources.
+ */
+export declare const EMPTY_SOURCE_LOOKUP: TSourceLookup;
+/**
+ * A no-op claim-source association lookup that always returns `undefined`
+ * or empty arrays. Use this when the consumer does not use claim-source
+ * associations.
+ */
+export declare const EMPTY_CLAIM_SOURCE_LOOKUP: TClaimSourceLookup;
+//# sourceMappingURL=lookup.d.ts.map

package/dist/lib/utils/lookup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookup.d.ts","sourceRoot":"","sources":["../../../src/lib/utils/lookup.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACR,YAAY,EACZ,aAAa,EACb,kBAAkB,EACrB,MAAM,0CAA0C,CAAA;AAEjD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC1B,KAAK,EAAE,CAAC,EAAE,EACV,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC5B;IAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAA;CAAE,CAUrD;AAED;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,EAAE,YAEhC,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,mBAAmB,EAAE,aAEjC,CAAA;AAED;;;;GAIG;AACH,eAAO,MAAM,yBAAyB,EAAE,kBAIvC,CAAA"}

package/dist/lib/utils/lookup.js

@@ -0,0 +1,62 @@
+/**
+ * Creates a keyed lookup from an array of items. Items are indexed by a
+ * composite string key (typically `"id:version"`), and the returned object
+ * exposes a `get(id, version)` method that reconstructs the same key
+ * internally.
+ *
+ * Use this to build the `TClaimLookup` or `TSourceLookup` required by
+ * `ArgumentEngine`'s constructor from flat arrays (e.g. database query
+ * results).
+ *
+ * @param items - The array of items to index.
+ * @param getKey - A function that produces the composite key for each item.
+ *   Must return a string of the form `"id:version"` so that the returned
+ *   `get(id, version)` method can reconstruct it.
+ * @returns An object with a `get(id, version)` method that looks up items
+ *   by reconstructing the composite key. Returns `undefined` if no item
+ *   matches.
+ *
+ * @example
+ * ```ts
+ * const claimLookup = createLookup(claims, (c) => `${c.id}:${c.version}`)
+ * const sourceLookup = createLookup(sources, (s) => `${s.id}:${s.version}`)
+ * const engine = new ArgumentEngine(arg, claimLookup, sourceLookup, ...)
+ * ```
+ */
+export function createLookup(items, getKey) {
+    const map = new Map();
+    for (const item of items) {
+        map.set(getKey(item), item);
+    }
+    return {
+        get(id, version) {
+            return map.get(`${id}:${version}`);
+        },
+    };
+}
+/**
+ * A no-op claim lookup that always returns `undefined`. Use this when the
+ * consumer does not use claims (e.g. an argument with no claim-bound
+ * variables).
+ */
+export const EMPTY_CLAIM_LOOKUP = {
+    get: () => undefined,
+};
+/**
+ * A no-op source lookup that always returns `undefined`. Use this when the
+ * consumer does not use sources.
+ */
+export const EMPTY_SOURCE_LOOKUP = {
+    get: () => undefined,
+};
+/**
+ * A no-op claim-source association lookup that always returns `undefined`
+ * or empty arrays. Use this when the consumer does not use claim-source
+ * associations.
+ */
+export const EMPTY_CLAIM_SOURCE_LOOKUP = {
+    getForClaim: () => [],
+    getForSource: () => [],
+    get: () => undefined,
+};
+//# sourceMappingURL=lookup.js.map

package/dist/lib/utils/lookup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookup.js","sourceRoot":"","sources":["../../../src/lib/utils/lookup.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,YAAY,CACxB,KAAU,EACV,MAA2B;IAE3B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAA;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;IAC/B,CAAC;IACD,OAAO;QACH,GAAG,CAAC,EAAU,EAAE,OAAe;YAC3B,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC,CAAA;QACtC,CAAC;KACJ,CAAA;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAiB;IAC5C,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS;CACvB,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAkB;IAC9C,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS;CACvB,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAuB;IACzD,WAAW,EAAE,GAAG,EAAE,CAAC,EAAE;IACrB,YAAY,EAAE,GAAG,EAAE,CAAC,EAAE;IACtB,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS;CACvB,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@polintpro/proposit-core",
-  "version": "0.6.6",
+  "version": "0.7.5",
   "description": "Core engine for building and manipulating propositional logic arguments.",
   "license": "MIT",
   "keywords": [