@proposit/proposit-core 0.12.1 → 1.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +104 -93
- package/dist/cli/commands/premises.d.ts.map +1 -1
- package/dist/cli/commands/premises.js +28 -24
- package/dist/cli/commands/premises.js.map +1 -1
- package/dist/cli/commands/repair.d.ts.map +1 -1
- package/dist/cli/commands/repair.js +4 -2
- package/dist/cli/commands/repair.js.map +1 -1
- package/dist/cli/commands/validate.d.ts.map +1 -1
- package/dist/cli/commands/validate.js +7 -1
- package/dist/cli/commands/validate.js.map +1 -1
- package/dist/cli/engine.d.ts.map +1 -1
- package/dist/cli/engine.js +7 -25
- package/dist/cli/engine.js.map +1 -1
- package/dist/cli/import.d.ts.map +1 -1
- package/dist/cli/import.js +66 -28
- package/dist/cli/import.js.map +1 -1
- package/dist/cli/schemata.d.ts.map +1 -1
- package/dist/cli/schemata.js +4 -3
- package/dist/cli/schemata.js.map +1 -1
- package/dist/extensions/basics/schemata.d.ts +56 -2
- package/dist/extensions/basics/schemata.d.ts.map +1 -1
- package/dist/extensions/basics/schemata.js +54 -23
- package/dist/extensions/basics/schemata.js.map +1 -1
- package/dist/lib/core/argument-engine.d.ts +275 -10
- package/dist/lib/core/argument-engine.d.ts.map +1 -1
- package/dist/lib/core/argument-engine.js +442 -82
- package/dist/lib/core/argument-engine.js.map +1 -1
- package/dist/lib/core/argument-library.d.ts +5 -1
- package/dist/lib/core/argument-library.d.ts.map +1 -1
- package/dist/lib/core/argument-library.js +7 -3
- package/dist/lib/core/argument-library.js.map +1 -1
- package/dist/lib/core/claim-axiom-library.d.ts +3 -3
- package/dist/lib/core/claim-axiom-library.d.ts.map +1 -1
- package/dist/lib/core/claim-axiom-library.js +2 -2
- package/dist/lib/core/claim-axiom-library.js.map +1 -1
- package/dist/lib/core/claim-citation-library.d.ts +3 -3
- package/dist/lib/core/claim-citation-library.d.ts.map +1 -1
- package/dist/lib/core/claim-citation-library.js +2 -2
- package/dist/lib/core/claim-citation-library.js.map +1 -1
- package/dist/lib/core/expression-manager.d.ts +68 -73
- package/dist/lib/core/expression-manager.d.ts.map +1 -1
- package/dist/lib/core/expression-manager.js +242 -762
- package/dist/lib/core/expression-manager.js.map +1 -1
- package/dist/lib/core/fork.d.ts +5 -1
- package/dist/lib/core/fork.d.ts.map +1 -1
- package/dist/lib/core/fork.js +16 -6
- package/dist/lib/core/fork.js.map +1 -1
- package/dist/lib/core/interfaces/argument-engine.interfaces.d.ts +68 -7
- package/dist/lib/core/interfaces/argument-engine.interfaces.d.ts.map +1 -1
- package/dist/lib/core/interfaces/library.interfaces.d.ts +9 -6
- package/dist/lib/core/interfaces/library.interfaces.d.ts.map +1 -1
- package/dist/lib/core/interfaces/premise-engine.interfaces.d.ts +50 -47
- package/dist/lib/core/interfaces/premise-engine.interfaces.d.ts.map +1 -1
- package/dist/lib/core/premise-engine.d.ts +80 -11
- package/dist/lib/core/premise-engine.d.ts.map +1 -1
- package/dist/lib/core/premise-engine.js +232 -80
- package/dist/lib/core/premise-engine.js.map +1 -1
- package/dist/lib/core/proposit-core.d.ts +5 -5
- package/dist/lib/core/proposit-core.d.ts.map +1 -1
- package/dist/lib/core/proposit-core.js +13 -3
- package/dist/lib/core/proposit-core.js.map +1 -1
- package/dist/lib/grammar/an-rules.d.ts +158 -0
- package/dist/lib/grammar/an-rules.d.ts.map +1 -0
- package/dist/lib/grammar/an-rules.js +778 -0
- package/dist/lib/grammar/an-rules.js.map +1 -0
- package/dist/lib/grammar/auto-normalize.d.ts +14 -0
- package/dist/lib/grammar/auto-normalize.d.ts.map +1 -0
- package/dist/lib/grammar/auto-normalize.js +35 -0
- package/dist/lib/grammar/auto-normalize.js.map +1 -0
- package/dist/lib/grammar/bounded-subtree.d.ts +30 -0
- package/dist/lib/grammar/bounded-subtree.d.ts.map +1 -0
- package/dist/lib/grammar/bounded-subtree.js +74 -0
- package/dist/lib/grammar/bounded-subtree.js.map +1 -0
- package/dist/lib/grammar/naked-q.d.ts +20 -0
- package/dist/lib/grammar/naked-q.d.ts.map +1 -0
- package/dist/lib/grammar/naked-q.js +58 -0
- package/dist/lib/grammar/naked-q.js.map +1 -0
- package/dist/lib/grammar/normalize.d.ts +12 -0
- package/dist/lib/grammar/normalize.d.ts.map +1 -0
- package/dist/lib/grammar/normalize.js +45 -0
- package/dist/lib/grammar/normalize.js.map +1 -0
- package/dist/lib/grammar/populate-from.d.ts +25 -0
- package/dist/lib/grammar/populate-from.d.ts.map +1 -0
- package/dist/lib/grammar/populate-from.js +252 -0
- package/dist/lib/grammar/populate-from.js.map +1 -0
- package/dist/lib/grammar/repair.d.ts +65 -0
- package/dist/lib/grammar/repair.d.ts.map +1 -0
- package/dist/lib/grammar/repair.js +251 -0
- package/dist/lib/grammar/repair.js.map +1 -0
- package/dist/lib/grammar/types.d.ts +17 -0
- package/dist/lib/grammar/types.d.ts.map +1 -0
- package/dist/lib/grammar/types.js +82 -0
- package/dist/lib/grammar/types.js.map +1 -0
- package/dist/lib/grammar/validate.d.ts +4 -0
- package/dist/lib/grammar/validate.d.ts.map +1 -0
- package/dist/lib/grammar/validate.js +28 -0
- package/dist/lib/grammar/validate.js.map +1 -0
- package/dist/lib/grammar/validators/context.d.ts +11 -0
- package/dist/lib/grammar/validators/context.d.ts.map +1 -0
- package/dist/lib/grammar/validators/context.js +5 -0
- package/dist/lib/grammar/validators/context.js.map +1 -0
- package/dist/lib/grammar/validators/derivable.d.ts +63 -0
- package/dist/lib/grammar/validators/derivable.d.ts.map +1 -0
- package/dist/lib/grammar/validators/derivable.js +502 -0
- package/dist/lib/grammar/validators/derivable.js.map +1 -0
- package/dist/lib/grammar/validators/evaluable.d.ts +48 -0
- package/dist/lib/grammar/validators/evaluable.d.ts.map +1 -0
- package/dist/lib/grammar/validators/evaluable.js +226 -0
- package/dist/lib/grammar/validators/evaluable.js.map +1 -0
- package/dist/lib/grammar/validators/presentable.d.ts +45 -0
- package/dist/lib/grammar/validators/presentable.d.ts.map +1 -0
- package/dist/lib/grammar/validators/presentable.js +231 -0
- package/dist/lib/grammar/validators/presentable.js.map +1 -0
- package/dist/lib/grammar/validators/structural.d.ts +103 -0
- package/dist/lib/grammar/validators/structural.d.ts.map +1 -0
- package/dist/lib/grammar/validators/structural.js +602 -0
- package/dist/lib/grammar/validators/structural.js.map +1 -0
- package/dist/lib/index.d.ts +4 -3
- package/dist/lib/index.d.ts.map +1 -1
- package/dist/lib/index.js +2 -2
- package/dist/lib/index.js.map +1 -1
- package/dist/lib/parsing/argument-parser.d.ts +8 -5
- package/dist/lib/parsing/argument-parser.d.ts.map +1 -1
- package/dist/lib/parsing/argument-parser.js +204 -42
- package/dist/lib/parsing/argument-parser.js.map +1 -1
- package/dist/lib/parsing/clamp-max-lengths.d.ts.map +1 -1
- package/dist/lib/parsing/clamp-max-lengths.js +10 -4
- package/dist/lib/parsing/clamp-max-lengths.js.map +1 -1
- package/dist/lib/parsing/prompt-builder.d.ts.map +1 -1
- package/dist/lib/parsing/prompt-builder.js +13 -15
- package/dist/lib/parsing/prompt-builder.js.map +1 -1
- package/dist/lib/parsing/schemata.d.ts +0 -3
- package/dist/lib/parsing/schemata.d.ts.map +1 -1
- package/dist/lib/parsing/schemata.js +25 -13
- package/dist/lib/parsing/schemata.js.map +1 -1
- package/dist/lib/parsing/types.d.ts +1 -1
- package/dist/lib/parsing/types.d.ts.map +1 -1
- package/dist/lib/schemata/claim.d.ts +8 -0
- package/dist/lib/schemata/claim.d.ts.map +1 -1
- package/dist/lib/schemata/claim.js +17 -7
- package/dist/lib/schemata/claim.js.map +1 -1
- package/dist/lib/schemata/import.d.ts.map +1 -1
- package/dist/lib/schemata/import.js +2 -5
- package/dist/lib/schemata/import.js.map +1 -1
- package/dist/lib/schemata/index.d.ts +0 -2
- package/dist/lib/schemata/index.d.ts.map +1 -1
- package/dist/lib/schemata/index.js +0 -2
- package/dist/lib/schemata/index.js.map +1 -1
- package/dist/lib/types/evaluation.d.ts +1 -1
- package/dist/lib/types/evaluation.d.ts.map +1 -1
- package/dist/lib/types/fork.d.ts +12 -3
- package/dist/lib/types/fork.d.ts.map +1 -1
- package/dist/lib/types/validation.d.ts +0 -6
- package/dist/lib/types/validation.d.ts.map +1 -1
- package/dist/lib/types/validation.js +23 -6
- package/dist/lib/types/validation.js.map +1 -1
- package/dist/lib/utils/lookup.d.ts +2 -2
- package/dist/lib/utils/lookup.js +2 -2
- package/package.json +1 -1
- package/dist/lib/core/managed-derivation-premise-engine.d.ts +0 -172
- package/dist/lib/core/managed-derivation-premise-engine.d.ts.map +0 -1
- package/dist/lib/core/managed-derivation-premise-engine.js +0 -550
- package/dist/lib/core/managed-derivation-premise-engine.js.map +0 -1
- package/dist/lib/schemata/claim-axiom.d.ts +0 -11
- package/dist/lib/schemata/claim-axiom.d.ts.map +0 -1
- package/dist/lib/schemata/claim-axiom.js +0 -9
- package/dist/lib/schemata/claim-axiom.js.map +0 -1
- package/dist/lib/schemata/claim-citation.d.ts +0 -11
- package/dist/lib/schemata/claim-citation.d.ts.map +0 -1
- package/dist/lib/schemata/claim-citation.js +0 -9
- package/dist/lib/schemata/claim-citation.js.map +0 -1
- package/dist/lib/types/grammar.d.ts +0 -83
- package/dist/lib/types/grammar.d.ts.map +0 -1
- package/dist/lib/types/grammar.js +0 -24
- package/dist/lib/types/grammar.js.map +0 -1
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import type { TCoreLogicalOperatorType, TCorePropositionalExpression } from "../schemata/index.js";
|
|
2
2
|
import type { ChangeCollector } from "./change-collector.js";
|
|
3
|
+
import { type TCorePositionConfig } from "../utils/position.js";
|
|
3
4
|
import type { TLogicEngineOptions } from "./argument-engine.js";
|
|
4
|
-
import { type TGrammarConfig } from "../types/grammar.js";
|
|
5
5
|
import type { TInvariantValidationResult } from "../types/validation.js";
|
|
6
6
|
export type TExpressionInput<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression> = TExpr extends infer U ? U extends TCorePropositionalExpression ? Omit<U, "checksum" | "descendantChecksum" | "combinedChecksum"> : never : never;
|
|
7
7
|
export type TExpressionWithoutPosition<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression> = TExpr extends infer U ? U extends TCorePropositionalExpression ? Omit<U, "position" | "checksum" | "descendantChecksum" | "combinedChecksum"> : never : never;
|
|
@@ -36,15 +36,17 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
36
36
|
private collector;
|
|
37
37
|
private dirtyExpressionIds;
|
|
38
38
|
setCollector(collector: ChangeCollector | null): void;
|
|
39
|
+
constructor(config?: TLogicEngineOptions);
|
|
39
40
|
/**
|
|
40
|
-
*
|
|
41
|
-
*
|
|
42
|
-
*
|
|
43
|
-
*
|
|
41
|
+
* Returns the position config in effect for this expression manager.
|
|
42
|
+
* Used by in-package helpers (e.g. native AN-4 in
|
|
43
|
+
* `src/lib/grammar/an-rules.ts`) that need the position range
|
|
44
|
+
* boundaries (`min`/`max`) for spacing-algorithm fallbacks when a
|
|
45
|
+
* formula sits at the leftmost or rightmost slot under its parent.
|
|
46
|
+
*
|
|
47
|
+
* @internal
|
|
44
48
|
*/
|
|
45
|
-
|
|
46
|
-
constructor(config?: TLogicEngineOptions);
|
|
47
|
-
private get grammarConfig();
|
|
49
|
+
getPositionConfig(): TCorePositionConfig;
|
|
48
50
|
private attachChecksum;
|
|
49
51
|
/**
|
|
50
52
|
* Registers an expression in the internal data structures without any
|
|
@@ -58,9 +60,13 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
58
60
|
* maps (`expressions`, `childExpressionIdsByParentId`,
|
|
59
61
|
* `childPositionsByParentId`) and notifies the change collector.
|
|
60
62
|
*
|
|
61
|
-
*
|
|
62
|
-
*
|
|
63
|
-
*
|
|
63
|
+
* As of v1.0 the legacy per-mutation P-1 buffer-insertion branches
|
|
64
|
+
* (`addExpression`/`insertExpression`/`wrapExpression`) are gone —
|
|
65
|
+
* AN-1 (post-mutation hook in assistive mode, see
|
|
66
|
+
* `src/lib/grammar/an-rules.ts`) is the sole formula-buffer
|
|
67
|
+
* insertion path. This helper is invoked from `wrapInFormula` (the
|
|
68
|
+
* public AN-1 primitive on `PremiseEngine`) which calls it once per
|
|
69
|
+
* buffer insertion to materialize the formula node.
|
|
64
70
|
*
|
|
65
71
|
* @returns The generated formula expression ID.
|
|
66
72
|
*/
|
|
@@ -141,13 +147,16 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
141
147
|
* Removes an expression from the tree.
|
|
142
148
|
*
|
|
143
149
|
* When `deleteSubtree` is `true`, the expression and its entire descendant
|
|
144
|
-
* subtree are removed
|
|
150
|
+
* subtree are removed.
|
|
145
151
|
*
|
|
146
152
|
* When `deleteSubtree` is `false`, the expression is removed but its single
|
|
147
|
-
* child (if any) is promoted into the removed expression's slot.
|
|
148
|
-
* expression has more than one child, an error is thrown.
|
|
149
|
-
*
|
|
150
|
-
*
|
|
153
|
+
* child (if any) is promoted into the removed expression's slot. If the
|
|
154
|
+
* expression has more than one child, an error is thrown.
|
|
155
|
+
*
|
|
156
|
+
* As of v1.0 the pre-removal collapse-cascade (the legacy
|
|
157
|
+
* `collapseIfNeeded` / `simulateCollapseChain`) is gone — AN-3
|
|
158
|
+
* (post-mutation hook in assistive mode) handles 0/1-child
|
|
159
|
+
* operator/formula collapse on the surviving parent.
|
|
151
160
|
*
|
|
152
161
|
* @throws If `deleteSubtree` is `false` and the expression has multiple children.
|
|
153
162
|
* @throws If `deleteSubtree` is `false` and the single child is a root-only
|
|
@@ -157,11 +166,6 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
157
166
|
removeExpression(expressionId: string, deleteSubtree: boolean): TExpr | undefined;
|
|
158
167
|
private removeSubtree;
|
|
159
168
|
private removeAndPromote;
|
|
160
|
-
/**
|
|
161
|
-
* Promotes `child` into the slot occupied by `parent` and removes `parent`.
|
|
162
|
-
* Used by `collapseIfNeeded` and `normalize()`.
|
|
163
|
-
*/
|
|
164
|
-
private promoteChild;
|
|
165
169
|
/**
|
|
166
170
|
* Redistributes the minimal set of sibling positions to create room at
|
|
167
171
|
* an insertion point between `leftPos` and `rightPos` under `parentId`.
|
|
@@ -170,41 +174,6 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
170
174
|
* rather than a real node position, the corresponding chain has 0 nodes.
|
|
171
175
|
*/
|
|
172
176
|
private repositionSiblings;
|
|
173
|
-
private collapseIfNeeded;
|
|
174
|
-
/**
|
|
175
|
-
* Flag-gated wrapper: absorbs same-operator children through a formula
|
|
176
|
-
* after an operator swap, if `absorbSameOperator` is enabled.
|
|
177
|
-
*/
|
|
178
|
-
private absorbSameOperatorIfNeeded;
|
|
179
|
-
/**
|
|
180
|
-
* Absorbs the inner operator's children into the outer (grandparent)
|
|
181
|
-
* operator when both are the same type, separated by a formula.
|
|
182
|
-
*
|
|
183
|
-
* Example: `AND → formula → AND(B, C)` becomes `AND → [B, C]` (children
|
|
184
|
-
* promoted into the outer AND at positions between the formula's neighbors).
|
|
185
|
-
*
|
|
186
|
-
* No-op if the pattern does not match.
|
|
187
|
-
*/
|
|
188
|
-
private absorbSameOperator;
|
|
189
|
-
/**
|
|
190
|
-
* Checks whether the subtree rooted at `expressionId` contains a binary
|
|
191
|
-
* operator (`and` or `or`). Traversal stops at formula boundaries — a
|
|
192
|
-
* nested formula owns its own subtree and is not inspected.
|
|
193
|
-
*/
|
|
194
|
-
private hasBinaryOperatorInBoundedSubtree;
|
|
195
|
-
/**
|
|
196
|
-
* Performs a full normalization sweep on the expression tree:
|
|
197
|
-
* 1. Collapses operators with 0 or 1 children.
|
|
198
|
-
* 2. Collapses formulas whose bounded subtree has no binary operator.
|
|
199
|
-
* 3. Inserts formula buffers where `enforceFormulaBetweenOperators` requires them.
|
|
200
|
-
* 4. Collapses double negation.
|
|
201
|
-
* 5. Absorbs same-operator nesting through formulas.
|
|
202
|
-
* 6. Repeats until stable.
|
|
203
|
-
*
|
|
204
|
-
* Works regardless of the current `autoNormalize` setting — this is an
|
|
205
|
-
* explicit on-demand normalization.
|
|
206
|
-
*/
|
|
207
|
-
normalize(): void;
|
|
208
177
|
/** Returns `true` if any expression in the tree references the given variable ID. */
|
|
209
178
|
hasVariableReference(variableId: string): boolean;
|
|
210
179
|
/** Returns the expression with the given ID, or `undefined` if not found. */
|
|
@@ -213,28 +182,24 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
213
182
|
getChildExpressions(parentId: string | null): TExpr[];
|
|
214
183
|
private loadInitialExpressions;
|
|
215
184
|
/**
|
|
216
|
-
*
|
|
217
|
-
*
|
|
185
|
+
* Pre-flight before {@link removeExpression} mutates state. As of v1.0
|
|
186
|
+
* the only structural failure mode for `removeAndPromote`'s 1-child
|
|
187
|
+
* branch is the root-only-operator promotion rule (S-5): an
|
|
188
|
+
* `implies`/`iff` child cannot be promoted into a non-root slot. The
|
|
189
|
+
* pre-v1.0 P-1 promote-on-remove check was deleted in D2 along with
|
|
190
|
+
* the rest of the `grammarConfig.enforceFormulaBetweenOperators`
|
|
191
|
+
* machinery; the legacy `collapseEmptyFormula` cascade simulation
|
|
192
|
+
* (`simulateCollapseChain` / `simulatePostPromotionCollapse`) was
|
|
193
|
+
* deleted in lockstep — AN-3 (post-mutation hook in assistive mode)
|
|
194
|
+
* handles every collapse case.
|
|
218
195
|
*/
|
|
219
196
|
private assertRemovalSafe;
|
|
220
197
|
/**
|
|
221
198
|
* Checks whether promoting `child` into a slot with the given `newParentId`
|
|
222
|
-
* would violate the
|
|
199
|
+
* would violate the root-only rule (S-5). The pre-v1.0 nesting check
|
|
200
|
+
* (P-1 / `enforceFormulaBetweenOperators`) was deleted in D2.
|
|
223
201
|
*/
|
|
224
202
|
private assertPromotionSafe;
|
|
225
|
-
/**
|
|
226
|
-
* Walks the collapse chain starting from `operatorId` after `removedChildId`
|
|
227
|
-
* is removed. At each level: if 0 remaining children, operator/formula is deleted
|
|
228
|
-
* and chain continues up. If 1 remaining child, check promotion safety.
|
|
229
|
-
*/
|
|
230
|
-
private simulateCollapseChain;
|
|
231
|
-
/**
|
|
232
|
-
* After an operator promotion places `promotedChild` into `parentId`'s child set,
|
|
233
|
-
* check whether the parent (if a formula) would itself collapse. Formula collapse
|
|
234
|
-
* promotion is always safe (the child can't be a binary operator or root-only operator),
|
|
235
|
-
* but we need to continue the simulation chain.
|
|
236
|
-
*/
|
|
237
|
-
private simulatePostPromotionCollapse;
|
|
238
203
|
private assertChildLimit;
|
|
239
204
|
private reparent;
|
|
240
205
|
/**
|
|
@@ -282,6 +247,36 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
282
247
|
* Reparents an expression to a new parent at a given position.
|
|
283
248
|
*/
|
|
284
249
|
reparentExpression(expressionId: string, newParentId: string | null, newPosition: number): void;
|
|
250
|
+
/**
|
|
251
|
+
* Inserts a new `formula` node between an existing expression and
|
|
252
|
+
* its current parent atomically. The formula takes the child's
|
|
253
|
+
* original slot (parentId + position); the child becomes the
|
|
254
|
+
* formula's sole child at position 0.
|
|
255
|
+
*
|
|
256
|
+
* Used by the native AN-1 (formula-buffer insertion) pass in
|
|
257
|
+
* `src/lib/grammar/an-rules.ts` per spec §5.1. Composing this from
|
|
258
|
+
* `addExpression` + `reparentExpression` is not possible without
|
|
259
|
+
* trip-wires: `addExpression(formula, parent, childPosition)` would
|
|
260
|
+
* throw S-9 (child still occupies that slot), and `assertChildLimit`
|
|
261
|
+
* would reject the extra child under unary `not` parents and binary
|
|
262
|
+
* `implies`/`iff` parents even transiently. This primitive sidesteps
|
|
263
|
+
* both: the net child count of the parent is unchanged by the wrap
|
|
264
|
+
* (the formula displaces the child), so the limit isn't actually
|
|
265
|
+
* violated, just transiently if expressed via two atomic mutations.
|
|
266
|
+
*
|
|
267
|
+
* Generates the formula's id via the caller-supplied `formulaId`
|
|
268
|
+
* parameter so the caller (PE) can plug in the engine's
|
|
269
|
+
* `idGenerator` rather than this manager minting one internally —
|
|
270
|
+
* keeps id provenance explicit at the PE boundary.
|
|
271
|
+
*
|
|
272
|
+
* The new formula inherits the source child's `argumentId`,
|
|
273
|
+
* `argumentVersion`, and `premiseId` automatically.
|
|
274
|
+
*
|
|
275
|
+
* @throws If `childId` does not exist.
|
|
276
|
+
* @throws If `childId` is at the root (`parentId === null`) — there
|
|
277
|
+
* is no operator parent to insert a buffer beneath.
|
|
278
|
+
*/
|
|
279
|
+
wrapInFormula(childId: string, formulaId: string): void;
|
|
285
280
|
/**
|
|
286
281
|
* Deletes a single expression that has no children.
|
|
287
282
|
* Does NOT trigger operator collapse. Caller must ensure children
|
|
@@ -313,6 +308,6 @@ export declare class ExpressionManager<TExpr extends TCorePropositionalExpressio
|
|
|
313
308
|
/** Returns a serializable snapshot of the current state. */
|
|
314
309
|
snapshot(): TExpressionManagerSnapshot<TExpr>;
|
|
315
310
|
/** Creates a new ExpressionManager from a previously captured snapshot. */
|
|
316
|
-
static fromSnapshot<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression>(snapshot: TExpressionManagerSnapshot<TExpr>,
|
|
311
|
+
static fromSnapshot<TExpr extends TCorePropositionalExpression = TCorePropositionalExpression>(snapshot: TExpressionManagerSnapshot<TExpr>, generateId?: () => string): ExpressionManager<TExpr>;
|
|
317
312
|
}
|
|
318
313
|
//# sourceMappingURL=expression-manager.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"expression-manager.d.ts","sourceRoot":"","sources":["../../../src/lib/core/expression-manager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACR,wBAAwB,EACxB,4BAA4B,EAC/B,MAAM,sBAAsB,CAAA;AAE7B,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;
|
|
1
|
+
{"version":3,"file":"expression-manager.d.ts","sourceRoot":"","sources":["../../../src/lib/core/expression-manager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACR,wBAAwB,EACxB,4BAA4B,EAC/B,MAAM,sBAAsB,CAAA;AAE7B,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AAE5D,OAAO,EAEH,KAAK,mBAAmB,EAE3B,MAAM,sBAAsB,CAAA;AAE7B,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAA;AAQ/D,OAAO,KAAK,EAER,0BAA0B,EAC7B,MAAM,wBAAwB,CAAA;AAgB/B,MAAM,MAAM,gBAAgB,CACxB,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,IACzE,KAAK,SAAS,MAAM,CAAC,GACnB,CAAC,SAAS,4BAA4B,GAClC,IAAI,CAAC,CAAC,EAAE,UAAU,GAAG,oBAAoB,GAAG,kBAAkB,CAAC,GAC/D,KAAK,GACT,KAAK,CAAA;AAEX,MAAM,MAAM,0BAA0B,CAClC,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,IACzE,KAAK,SAAS,MAAM,CAAC,GACnB,CAAC,SAAS,4BAA4B,GAClC,IAAI,CACA,CAAC,EACC,UAAU,GACV,UAAU,GACV,oBAAoB,GACpB,kBAAkB,CACvB,GACD,KAAK,GACT,KAAK,CAAA;AAEX,MAAM,MAAM,0BAA0B,CAClC,KAAK,SAAS,4BAA4B,GAAG,4BAA4B,IACzE;IACA,WAAW,EAAE,KAAK,EAAE,CAAA;IACpB,MAAM,CAAC,EAAE,mBAAmB,CAAA;CAC/B,CAAA;AAED,4DAA4D;AAC5D,MAAM,MAAM,iBAAiB,GAAG;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,EAAE,wBAAwB,CAAA;CACtC,CAAA;AASD;;;;;;;;;;GAUG;AACH,qBAAa,iBAAiB,CAC1B,KAAK,SAAS,4BAA4B,GAAG,4BAA4B;IAEzE,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,4BAA4B,CAAiC;IACrE,OAAO,CAAC,wBAAwB,CAAiC;IACjE,OAAO,CAAC,cAAc,CAAqB;IAC3C,OAAO,CAAC,MAAM,CAAC,CAAqB;IACpC,OAAO,CAAC,UAAU,CAAc;IAChC,OAAO,CAAC,SAAS,CAA+B;IAChD,OAAO,CAAC,kBAAkB,CAAoB;IAE9C,YAAY,CAAC,SAAS,EAAE,eAAe,GAAG,IAAI,GAAG,IAAI;gBAIzC,MAAM,CAAC,EAAE,mBAAmB;IASxC;;;;;;;;OAQG;IACI,iBAAiB,IAAI,mBAAmB;IAI/C,OAAO,CAAC,cAAc;IAgBtB;;;;;OAKG;IACH,OAAO,CAAC,kBAAkB;IAqB1B;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,qBAAqB;IAoC7B;;;;;;;;OAQG;IACH,OAAO,CAAC,gBAAgB;IAYxB;;;;OAIG;IACI,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAUhD;;;;OAIG;IACI,wBAAwB,IAAI,IAAI;IA6EvC;;;OAGG;IACI,wBAAwB,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI;IAM9D,qEAAqE;IAC9D,OAAO,IAAI,KAAK,EAAE;IAMzB;;;;;;;;;OASG;IACI,aAAa,CAAC,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC;IA0EnD;;;;;;OAMG;IACI,gBAAgB,CACnB,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,UAAU,EAAE,0BAA0B,CAAC,KAAK,CAAC,GAC9C,IAAI;IAoCP;;;;OAIG;IACI,qBAAqB,CACxB,SAAS,EAAE,MAAM,EACjB,gBAAgB,EAAE,QAAQ,GAAG,OAAO,EACpC,UAAU,EAAE,0BAA0B,CAAC,KAAK,CAAC,GAC9C,IAAI;IA2EP;;;;;;;;;;;;;;;;OAgBG;IACI,gBAAgB,CACnB,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAC3B,KAAK;IAyGR;;;;;;;;;;;;;;;;;;;OAmBG;IACI,gBAAgB,CACnB,YAAY,EAAE,MAAM,EACpB,aAAa,EAAE,OAAO,GACvB,KAAK,GAAG,SAAS;IAgBpB,OAAO,CAAC,aAAa;IA+CrB,OAAO,CAAC,gBAAgB;IA0GxB;;;;;;OAMG;IACH,OAAO,CAAC,kBAAkB;IA0I1B,qFAAqF;IAC9E,oBAAoB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAYxD,6EAA6E;IACtE,aAAa,CAAC,YAAY,EAAE,MAAM,GAAG,KAAK,GAAG,SAAS;IAI7D,oEAAoE;IAC7D,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,KAAK,EAAE;IAiB5D,OAAO,CAAC,sBAAsB;IAQ9B;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,iBAAiB;IAezB;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAiB3B,OAAO,CAAC,gBAAgB;IAmBxB,OAAO,CAAC,QAAQ;IA8ChB;;;;;;;;;;;;;;;;;;OAkBG;IACI,gBAAgB,CACnB,UAAU,EAAE,gBAAgB,CAAC,KAAK,CAAC,EACnC,UAAU,CAAC,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,MAAM,GACrB,IAAI;IA0LP;;;;;;;;;;;;;;;;;;;OAmBG;IACI,cAAc,CACjB,QAAQ,EAAE,0BAA0B,CAAC,KAAK,CAAC,EAC3C,UAAU,EAAE,0BAA0B,CAAC,KAAK,CAAC,EAC7C,UAAU,CAAC,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,MAAM,GACrB,IAAI;IAoKP;;OAEG;IACI,kBAAkB,CACrB,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,MAAM,GAAG,IAAI,EAC1B,WAAW,EAAE,MAAM,GACpB,IAAI;IAQP;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACI,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IA0D9D;;;;OAIG;IACI,gBAAgB,CAAC,YAAY,EAAE,MAAM,GAAG,KAAK,GAAG,SAAS;IA2BhE;;;;;OAKG;IACI,kBAAkB,CACrB,YAAY,EAAE,MAAM,EACpB,WAAW,EAAE,wBAAwB,GACtC,KAAK;IA0CR;;;OAGG;IACI,eAAe,CAAC,WAAW,EAAE,gBAAgB,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI;IAIpE;;;;;;;;OAQG;IACI,QAAQ,IAAI,0BAA0B;IAsM7C,4DAA4D;IACrD,QAAQ,IAAI,0BAA0B,CAAC,KAAK,CAAC;IAcpD,2EAA2E;WAC7D,YAAY,CACtB,KAAK,SAAS,4BAA4B,GACtC,4BAA4B,EAEhC,QAAQ,EAAE,0BAA0B,CAAC,KAAK,CAAC,EAC3C,UAAU,CAAC,EAAE,MAAM,MAAM,GAC1B,iBAAiB,CAAC,KAAK,CAAC;CA0B9B"}
|