@fuaran-ui/ops 0.5.0 → 0.7.0

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-import { Result, NodeId, NodeKind, JsonValue, Binding, SemanticStyle, StateBehaviour, Node, Cell, ColExpr, DataSource, Transform, EvalError, Table, TextSource, CellFormat, ColumnWidth, Orientation, ToneVariant, StyleWeight, Emphasis, HeadingVariant, BadgeVariant, IconSource } from '@fuaran-ui/schema';
+import { Result, NodeId, NodeKind, JsonValue, Binding, SemanticStyle, StateBehaviour, Node, Cell, ColExpr, DataSource, Transform, EvalError, Table, TextSource, CellFormat, ColumnWidth, Orientation, ToneVariant, StyleWeight, Emphasis, HeadingVariant, BadgeVariant, IconSource, IconSize } from '@fuaran-ui/schema';
 
 /** Local JSON AST. Shape-for-shape port of the F# decoder's private `Json` DU. */
 type JsonAst = {
@@ -142,6 +142,22 @@ interface DecodeError {
     readonly expectedShape?: string;
 }
 type R<T> = Result<T, DecodeError>;
+/**
+ * Phase 818 — materialise a LIVE Transform source's resolved store value as the
+ * evaluation input table: row-major rows transpose through the same 815
+ * normalisation the decode-time snapshot used, then decode through the
+ * columnar codec (schema inference included). `ok: false` for any value that
+ * cannot be read as data — callers surface that loudly, never silently
+ * (the Phase-427 mismatch posture). Exported for the renderers' shared
+ * `evalTransformFrame` live leg.
+ */
+declare const liveValueToTable: (v: unknown) => {
+    readonly ok: true;
+    readonly value: Table;
+} | {
+    readonly ok: false;
+    readonly error: string;
+};
 /** Typed-value coercers for `TreeOp.UpdateProp` (used by the apply engine). */
 declare const coerce: {
     int: (v: JsonValue) => Result<number, string>;
@@ -168,6 +184,10 @@ declare const coerce: {
     headingVariant: (v: JsonValue) => Result<HeadingVariant, string>;
     badgeVariant: (v: JsonValue) => Result<BadgeVariant, string>;
     iconSource: (v: JsonValue) => Result<IconSource, string>;
+    /** `Icon.Size : IconSize` (Phase 821) — the UpdateProp twin of `decodeIconSize`,
+     * added with the standalone Icon display kind. */
+    iconSize: (v: JsonValue) => Result<IconSize, string>;
+    stringOption: (v: JsonValue) => Result<string | undefined, string>;
 };
 /** Decode a canonical-JSON `Node` payload into the storage-shape `Node<unknown>`. */
 declare const decodeNode: (json: string) => R<Node<unknown>>;
@@ -197,6 +217,168 @@ type ApplyResult<TMsg> = Result<{
  */
 declare const apply: <TMsg>(tree: Node<TMsg>, op: TreeOp<TMsg>) => ApplyResult<TMsg>;
 
+/**
+ * Where a node should sit among its destination siblings, stated the only way
+ * the op vocabulary allows: by naming an existing sibling, or an end.
+ */
+type Placement = 
+/** Append — what `InsertChild` / `MoveNode` do on their own. */
+{
+    readonly kind: 'Last';
+}
+/** Prepend — before every current sibling. */
+ | {
+    readonly kind: 'First';
+}
+/** Immediately before the named sibling. */
+ | {
+    readonly kind: 'Before';
+    readonly anchor: NodeId;
+}
+/** Immediately after the named sibling. */
+ | {
+    readonly kind: 'After';
+    readonly anchor: NodeId;
+};
+/** A structural destination: which parent, and where among its children. */
+interface PlaceTarget {
+    readonly parentId: NodeId;
+    readonly placement: Placement;
+}
+/**
+ * Why a placement could not become an op. Each case is a pre-statement of the
+ * apply-time refusal the emitted op would have met, so a helper rejection and
+ * an apply rejection agree — no false permit, no false refuse.
+ */
+type PlaceError = 
+/** The destination parent is not in the tree (apply: `ParentNotFound`). */
+{
+    readonly kind: 'ParentNotFound';
+    readonly parentId: NodeId;
+}
+/** The destination parent's kind has no children field (apply: `ChildlessKind`). */
+ | {
+    readonly kind: 'ChildlessKind';
+    readonly parentId: NodeId;
+}
+/**
+ * The node to move / nudge / duplicate is not structurally addressable
+ * (absent, or held in a non-structural position the structural ops cannot
+ * reach) — apply: `NodeNotFound`.
+ */
+ | {
+    readonly kind: 'NodeNotFound';
+    readonly nodeId: NodeId;
+}
+/**
+ * The placement anchor is not among the destination's post-op children. The
+ * only op that could honour it — a `ReorderChildren` naming it — is refused
+ * by the apply engine as `OrderingMismatch`.
+ */
+ | {
+    readonly kind: 'UnknownAnchor';
+    readonly anchor: NodeId;
+}
+/**
+ * The subtree being inserted carries an id already present in the tree
+ * (apply: `DuplicateNodeId`).
+ */
+ | {
+    readonly kind: 'DuplicateId';
+    readonly nodeId: NodeId;
+}
+/** The node would become its own parent (apply: `KindMismatch`). */
+ | {
+    readonly kind: 'MoveIntoSelf';
+    readonly nodeId: NodeId;
+}
+/**
+ * The destination sits inside the node's own subtree — a cycle (apply:
+ * `KindMismatch`).
+ */
+ | {
+    readonly kind: 'MoveIntoDescendant';
+    readonly nodeId: NodeId;
+    readonly parentId: NodeId;
+}
+/** The root has no siblings to nudge among. */
+ | {
+    readonly kind: 'CannotNudgeRoot';
+    readonly nodeId: NodeId;
+}
+/** The nudge would leave the sibling range (already first / already last). */
+ | {
+    readonly kind: 'NudgeOutOfRange';
+    readonly nodeId: NodeId;
+    readonly delta: number;
+};
+/**
+ * How the clone verbs mint replacement ids: given the id being replaced and a
+ * predicate over every id already claimed (the whole target tree, the whole
+ * incoming subtree, and ids minted earlier in the same remap), return an id
+ * the predicate refuses. Injectable so a host with its own id discipline can
+ * supply it; `derivedFreshIds` is the default.
+ */
+type FreshIds = (oldId: string, taken: (candidate: string) => boolean) => string;
+/**
+ * The default strategy: `<oldId>-copy`, then `<oldId>-copy-2`, `-copy-3`, … —
+ * the first candidate not already taken. Deterministic (derived from the id it
+ * replaces, no ambient state) and collision-free by probing.
+ */
+declare const derivedFreshIds: FreshIds;
+/**
+ * Sequential ids under a fixed prefix (`<prefix>-1`, `-2`, …) — the
+ * deterministic-replay option: the minted sequence depends only on the prefix
+ * and the order of requests, never on the ids being replaced. Each call to
+ * `sequentialFreshIds` starts its own counter.
+ */
+declare const sequentialFreshIds: (prefix: string) => FreshIds;
+/**
+ * Whether `moved` may legally take up residence at `target` — the pre-check an
+ * editor uses to grey out an illegal drop without a dry-run apply. Mirrors the
+ * apply engine's rejections: absent node, move into itself, move into its own
+ * descendant (a cycle), absent or childless destination, unknown anchor.
+ */
+declare const canPlace: <TMsg>(root: Node<TMsg>, moved: NodeId, target: PlaceTarget) => Result<void, PlaceError>;
+/**
+ * The op an insertion becomes. `InsertChild` appends, so the wanted order is
+ * computed over the post-insert membership and stated by `ReorderChildren`
+ * naming every sibling id; the reorder leg is dropped when appending already
+ * produces that order.
+ */
+declare const placeOp: <TMsg>(root: Node<TMsg>, child: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * The op a move becomes. `MoveNode` appends under the new parent, and the node
+ * may already be one of that parent's children (a re-placement within one
+ * parent), so the post-move membership is the siblings WITHOUT it plus it.
+ */
+declare const moveOp: <TMsg>(root: Node<TMsg>, moved: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * The op a keyboard move-up (`-1`) / move-down (`+1`) becomes: the node
+ * swapped with the sibling `delta` positions away, stated as the FULL sibling
+ * id order (which is what `ReorderChildren` requires — a partial list is
+ * refused by the apply engine, and rightly, since a partial order is not one).
+ */
+declare const nudgeOp: <TMsg>(root: Node<TMsg>, nodeId: NodeId, delta: number) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * Duplicate the subtree rooted at `source` and place the clone at `target`,
+ * minting replacement ids with `freshIds`. The emitted op is an ordinary
+ * placed insert — the clone is a fresh subtree, so the standard apply gate
+ * (including the tree-wide duplicate-id check) accepts it unchanged.
+ */
+declare const duplicateOpWith: <TMsg>(freshIds: FreshIds, root: Node<TMsg>, source: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/** `duplicateOpWith` under the default derived-suffix id strategy. */
+declare const duplicateOp: <TMsg>(root: Node<TMsg>, source: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * Place a subtree lifted from a DIFFERENT tree into `targetRoot`, remapping
+ * any id that collides with one already present (ids with no collision are
+ * preserved). The incoming subtree's ids must be unique within itself — a
+ * subtree extracted from any well-formed tree is.
+ */
+declare const pasteOpWith: <TMsg>(freshIds: FreshIds, targetRoot: Node<TMsg>, incoming: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/** `pasteOpWith` under the default derived-suffix id strategy. */
+declare const pasteOp: <TMsg>(targetRoot: Node<TMsg>, incoming: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+
 /** The result envelope captured on a DAG record (closed shape). */
 type DagResultEnvelope = {
     readonly $type: 'Success';
@@ -547,4 +729,4 @@ declare const decodeElicitationOutcome: (json: string) => Result<ElicitationOutc
  */
 declare const validateAnswerDocument: (json: string) => Result<undefined, ElicitationError>;
 
-export { type Answer, type AnswerContract, type AnswerField, type AnswerSpace, type AnswerValue, type ApplyError, type ApplyErrorCode, type ApplyResult, type Compatibility, type DagOpRecord, type DagResultEnvelope, type DecodeError, type DecodeErrorCode, type Decoded, ELICITATION_KEY, ELICITATION_VERSION, type ElicitationEnvelope, type ElicitationError, type ElicitationErrorCode, type ElicitationOutcome, type ElicitationOutcomeEnvelope, type Envelope, type EnvelopeError, type EnvelopeErrorCode, type EvalEnv, type JsonAst, type MergeConflict, type MergeResult, type OpApplyTelemetryRecord, PAYLOAD_KEY, PROFILE_KEY, type ParseError, type Profile, REQUIRED_PROFILE_KEY, type SourceResolver, type TreeOp, type UnknownKind, apply, cellString, coerce, coreV1, decodeDagRecord, decodeElicitation, decodeElicitationOutcome, decodeEnvelope, decodeEnvelopeAst, decodeNode, decodeNodeTolerant, decodeOp, decodeTolerant, encodeCell, encodeColExpr, encodeDagRecord, encodeDataSource, encodeElicitation, encodeElicitationOutcome, encodeEnvelope, encodeNode, encodeOp, encodePipeline, evalErrorString, evalPipeline, evalPipelineInEnv, evalPipelineWith, evalPipelineWithInEnv, evalSource, field as jsonField, merge3Way, negotiate, negotiateEnvelope, noResolve, parse, pipelineParams, reencodeNode, renderAstCanonical, renderProfile, stepParams, tryParseProfile, validateAnswer, validateAnswerAt, validateAnswerDocument };
+export { type Answer, type AnswerContract, type AnswerField, type AnswerSpace, type AnswerValue, type ApplyError, type ApplyErrorCode, type ApplyResult, type Compatibility, type DagOpRecord, type DagResultEnvelope, type DecodeError, type DecodeErrorCode, type Decoded, ELICITATION_KEY, ELICITATION_VERSION, type ElicitationEnvelope, type ElicitationError, type ElicitationErrorCode, type ElicitationOutcome, type ElicitationOutcomeEnvelope, type Envelope, type EnvelopeError, type EnvelopeErrorCode, type EvalEnv, type FreshIds, type JsonAst, type MergeConflict, type MergeResult, type OpApplyTelemetryRecord, PAYLOAD_KEY, PROFILE_KEY, type ParseError, type PlaceError, type PlaceTarget, type Placement, type Profile, REQUIRED_PROFILE_KEY, type SourceResolver, type TreeOp, type UnknownKind, apply, canPlace, cellString, coerce, coreV1, decodeDagRecord, decodeElicitation, decodeElicitationOutcome, decodeEnvelope, decodeEnvelopeAst, decodeNode, decodeNodeTolerant, decodeOp, decodeTolerant, derivedFreshIds, duplicateOp, duplicateOpWith, encodeCell, encodeColExpr, encodeDagRecord, encodeDataSource, encodeElicitation, encodeElicitationOutcome, encodeEnvelope, encodeNode, encodeOp, encodePipeline, evalErrorString, evalPipeline, evalPipelineInEnv, evalPipelineWith, evalPipelineWithInEnv, evalSource, field as jsonField, liveValueToTable, merge3Way, moveOp, negotiate, negotiateEnvelope, noResolve, nudgeOp, parse, pasteOp, pasteOpWith, pipelineParams, placeOp, reencodeNode, renderAstCanonical, renderProfile, sequentialFreshIds, stepParams, tryParseProfile, validateAnswer, validateAnswerAt, validateAnswerDocument };

package/dist/index.d.ts

@@ -1,4 +1,4 @@
-import { Result, NodeId, NodeKind, JsonValue, Binding, SemanticStyle, StateBehaviour, Node, Cell, ColExpr, DataSource, Transform, EvalError, Table, TextSource, CellFormat, ColumnWidth, Orientation, ToneVariant, StyleWeight, Emphasis, HeadingVariant, BadgeVariant, IconSource } from '@fuaran-ui/schema';
+import { Result, NodeId, NodeKind, JsonValue, Binding, SemanticStyle, StateBehaviour, Node, Cell, ColExpr, DataSource, Transform, EvalError, Table, TextSource, CellFormat, ColumnWidth, Orientation, ToneVariant, StyleWeight, Emphasis, HeadingVariant, BadgeVariant, IconSource, IconSize } from '@fuaran-ui/schema';
 
 /** Local JSON AST. Shape-for-shape port of the F# decoder's private `Json` DU. */
 type JsonAst = {
@@ -142,6 +142,22 @@ interface DecodeError {
     readonly expectedShape?: string;
 }
 type R<T> = Result<T, DecodeError>;
+/**
+ * Phase 818 — materialise a LIVE Transform source's resolved store value as the
+ * evaluation input table: row-major rows transpose through the same 815
+ * normalisation the decode-time snapshot used, then decode through the
+ * columnar codec (schema inference included). `ok: false` for any value that
+ * cannot be read as data — callers surface that loudly, never silently
+ * (the Phase-427 mismatch posture). Exported for the renderers' shared
+ * `evalTransformFrame` live leg.
+ */
+declare const liveValueToTable: (v: unknown) => {
+    readonly ok: true;
+    readonly value: Table;
+} | {
+    readonly ok: false;
+    readonly error: string;
+};
 /** Typed-value coercers for `TreeOp.UpdateProp` (used by the apply engine). */
 declare const coerce: {
     int: (v: JsonValue) => Result<number, string>;
@@ -168,6 +184,10 @@ declare const coerce: {
     headingVariant: (v: JsonValue) => Result<HeadingVariant, string>;
     badgeVariant: (v: JsonValue) => Result<BadgeVariant, string>;
     iconSource: (v: JsonValue) => Result<IconSource, string>;
+    /** `Icon.Size : IconSize` (Phase 821) — the UpdateProp twin of `decodeIconSize`,
+     * added with the standalone Icon display kind. */
+    iconSize: (v: JsonValue) => Result<IconSize, string>;
+    stringOption: (v: JsonValue) => Result<string | undefined, string>;
 };
 /** Decode a canonical-JSON `Node` payload into the storage-shape `Node<unknown>`. */
 declare const decodeNode: (json: string) => R<Node<unknown>>;
@@ -197,6 +217,168 @@ type ApplyResult<TMsg> = Result<{
  */
 declare const apply: <TMsg>(tree: Node<TMsg>, op: TreeOp<TMsg>) => ApplyResult<TMsg>;
 
+/**
+ * Where a node should sit among its destination siblings, stated the only way
+ * the op vocabulary allows: by naming an existing sibling, or an end.
+ */
+type Placement = 
+/** Append — what `InsertChild` / `MoveNode` do on their own. */
+{
+    readonly kind: 'Last';
+}
+/** Prepend — before every current sibling. */
+ | {
+    readonly kind: 'First';
+}
+/** Immediately before the named sibling. */
+ | {
+    readonly kind: 'Before';
+    readonly anchor: NodeId;
+}
+/** Immediately after the named sibling. */
+ | {
+    readonly kind: 'After';
+    readonly anchor: NodeId;
+};
+/** A structural destination: which parent, and where among its children. */
+interface PlaceTarget {
+    readonly parentId: NodeId;
+    readonly placement: Placement;
+}
+/**
+ * Why a placement could not become an op. Each case is a pre-statement of the
+ * apply-time refusal the emitted op would have met, so a helper rejection and
+ * an apply rejection agree — no false permit, no false refuse.
+ */
+type PlaceError = 
+/** The destination parent is not in the tree (apply: `ParentNotFound`). */
+{
+    readonly kind: 'ParentNotFound';
+    readonly parentId: NodeId;
+}
+/** The destination parent's kind has no children field (apply: `ChildlessKind`). */
+ | {
+    readonly kind: 'ChildlessKind';
+    readonly parentId: NodeId;
+}
+/**
+ * The node to move / nudge / duplicate is not structurally addressable
+ * (absent, or held in a non-structural position the structural ops cannot
+ * reach) — apply: `NodeNotFound`.
+ */
+ | {
+    readonly kind: 'NodeNotFound';
+    readonly nodeId: NodeId;
+}
+/**
+ * The placement anchor is not among the destination's post-op children. The
+ * only op that could honour it — a `ReorderChildren` naming it — is refused
+ * by the apply engine as `OrderingMismatch`.
+ */
+ | {
+    readonly kind: 'UnknownAnchor';
+    readonly anchor: NodeId;
+}
+/**
+ * The subtree being inserted carries an id already present in the tree
+ * (apply: `DuplicateNodeId`).
+ */
+ | {
+    readonly kind: 'DuplicateId';
+    readonly nodeId: NodeId;
+}
+/** The node would become its own parent (apply: `KindMismatch`). */
+ | {
+    readonly kind: 'MoveIntoSelf';
+    readonly nodeId: NodeId;
+}
+/**
+ * The destination sits inside the node's own subtree — a cycle (apply:
+ * `KindMismatch`).
+ */
+ | {
+    readonly kind: 'MoveIntoDescendant';
+    readonly nodeId: NodeId;
+    readonly parentId: NodeId;
+}
+/** The root has no siblings to nudge among. */
+ | {
+    readonly kind: 'CannotNudgeRoot';
+    readonly nodeId: NodeId;
+}
+/** The nudge would leave the sibling range (already first / already last). */
+ | {
+    readonly kind: 'NudgeOutOfRange';
+    readonly nodeId: NodeId;
+    readonly delta: number;
+};
+/**
+ * How the clone verbs mint replacement ids: given the id being replaced and a
+ * predicate over every id already claimed (the whole target tree, the whole
+ * incoming subtree, and ids minted earlier in the same remap), return an id
+ * the predicate refuses. Injectable so a host with its own id discipline can
+ * supply it; `derivedFreshIds` is the default.
+ */
+type FreshIds = (oldId: string, taken: (candidate: string) => boolean) => string;
+/**
+ * The default strategy: `<oldId>-copy`, then `<oldId>-copy-2`, `-copy-3`, … —
+ * the first candidate not already taken. Deterministic (derived from the id it
+ * replaces, no ambient state) and collision-free by probing.
+ */
+declare const derivedFreshIds: FreshIds;
+/**
+ * Sequential ids under a fixed prefix (`<prefix>-1`, `-2`, …) — the
+ * deterministic-replay option: the minted sequence depends only on the prefix
+ * and the order of requests, never on the ids being replaced. Each call to
+ * `sequentialFreshIds` starts its own counter.
+ */
+declare const sequentialFreshIds: (prefix: string) => FreshIds;
+/**
+ * Whether `moved` may legally take up residence at `target` — the pre-check an
+ * editor uses to grey out an illegal drop without a dry-run apply. Mirrors the
+ * apply engine's rejections: absent node, move into itself, move into its own
+ * descendant (a cycle), absent or childless destination, unknown anchor.
+ */
+declare const canPlace: <TMsg>(root: Node<TMsg>, moved: NodeId, target: PlaceTarget) => Result<void, PlaceError>;
+/**
+ * The op an insertion becomes. `InsertChild` appends, so the wanted order is
+ * computed over the post-insert membership and stated by `ReorderChildren`
+ * naming every sibling id; the reorder leg is dropped when appending already
+ * produces that order.
+ */
+declare const placeOp: <TMsg>(root: Node<TMsg>, child: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * The op a move becomes. `MoveNode` appends under the new parent, and the node
+ * may already be one of that parent's children (a re-placement within one
+ * parent), so the post-move membership is the siblings WITHOUT it plus it.
+ */
+declare const moveOp: <TMsg>(root: Node<TMsg>, moved: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * The op a keyboard move-up (`-1`) / move-down (`+1`) becomes: the node
+ * swapped with the sibling `delta` positions away, stated as the FULL sibling
+ * id order (which is what `ReorderChildren` requires — a partial list is
+ * refused by the apply engine, and rightly, since a partial order is not one).
+ */
+declare const nudgeOp: <TMsg>(root: Node<TMsg>, nodeId: NodeId, delta: number) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * Duplicate the subtree rooted at `source` and place the clone at `target`,
+ * minting replacement ids with `freshIds`. The emitted op is an ordinary
+ * placed insert — the clone is a fresh subtree, so the standard apply gate
+ * (including the tree-wide duplicate-id check) accepts it unchanged.
+ */
+declare const duplicateOpWith: <TMsg>(freshIds: FreshIds, root: Node<TMsg>, source: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/** `duplicateOpWith` under the default derived-suffix id strategy. */
+declare const duplicateOp: <TMsg>(root: Node<TMsg>, source: NodeId, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/**
+ * Place a subtree lifted from a DIFFERENT tree into `targetRoot`, remapping
+ * any id that collides with one already present (ids with no collision are
+ * preserved). The incoming subtree's ids must be unique within itself — a
+ * subtree extracted from any well-formed tree is.
+ */
+declare const pasteOpWith: <TMsg>(freshIds: FreshIds, targetRoot: Node<TMsg>, incoming: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+/** `pasteOpWith` under the default derived-suffix id strategy. */
+declare const pasteOp: <TMsg>(targetRoot: Node<TMsg>, incoming: Node<TMsg>, target: PlaceTarget) => Result<TreeOp<TMsg>, PlaceError>;
+
 /** The result envelope captured on a DAG record (closed shape). */
 type DagResultEnvelope = {
     readonly $type: 'Success';
@@ -547,4 +729,4 @@ declare const decodeElicitationOutcome: (json: string) => Result<ElicitationOutc
  */
 declare const validateAnswerDocument: (json: string) => Result<undefined, ElicitationError>;
 
-export { type Answer, type AnswerContract, type AnswerField, type AnswerSpace, type AnswerValue, type ApplyError, type ApplyErrorCode, type ApplyResult, type Compatibility, type DagOpRecord, type DagResultEnvelope, type DecodeError, type DecodeErrorCode, type Decoded, ELICITATION_KEY, ELICITATION_VERSION, type ElicitationEnvelope, type ElicitationError, type ElicitationErrorCode, type ElicitationOutcome, type ElicitationOutcomeEnvelope, type Envelope, type EnvelopeError, type EnvelopeErrorCode, type EvalEnv, type JsonAst, type MergeConflict, type MergeResult, type OpApplyTelemetryRecord, PAYLOAD_KEY, PROFILE_KEY, type ParseError, type Profile, REQUIRED_PROFILE_KEY, type SourceResolver, type TreeOp, type UnknownKind, apply, cellString, coerce, coreV1, decodeDagRecord, decodeElicitation, decodeElicitationOutcome, decodeEnvelope, decodeEnvelopeAst, decodeNode, decodeNodeTolerant, decodeOp, decodeTolerant, encodeCell, encodeColExpr, encodeDagRecord, encodeDataSource, encodeElicitation, encodeElicitationOutcome, encodeEnvelope, encodeNode, encodeOp, encodePipeline, evalErrorString, evalPipeline, evalPipelineInEnv, evalPipelineWith, evalPipelineWithInEnv, evalSource, field as jsonField, merge3Way, negotiate, negotiateEnvelope, noResolve, parse, pipelineParams, reencodeNode, renderAstCanonical, renderProfile, stepParams, tryParseProfile, validateAnswer, validateAnswerAt, validateAnswerDocument };
+export { type Answer, type AnswerContract, type AnswerField, type AnswerSpace, type AnswerValue, type ApplyError, type ApplyErrorCode, type ApplyResult, type Compatibility, type DagOpRecord, type DagResultEnvelope, type DecodeError, type DecodeErrorCode, type Decoded, ELICITATION_KEY, ELICITATION_VERSION, type ElicitationEnvelope, type ElicitationError, type ElicitationErrorCode, type ElicitationOutcome, type ElicitationOutcomeEnvelope, type Envelope, type EnvelopeError, type EnvelopeErrorCode, type EvalEnv, type FreshIds, type JsonAst, type MergeConflict, type MergeResult, type OpApplyTelemetryRecord, PAYLOAD_KEY, PROFILE_KEY, type ParseError, type PlaceError, type PlaceTarget, type Placement, type Profile, REQUIRED_PROFILE_KEY, type SourceResolver, type TreeOp, type UnknownKind, apply, canPlace, cellString, coerce, coreV1, decodeDagRecord, decodeElicitation, decodeElicitationOutcome, decodeEnvelope, decodeEnvelopeAst, decodeNode, decodeNodeTolerant, decodeOp, decodeTolerant, derivedFreshIds, duplicateOp, duplicateOpWith, encodeCell, encodeColExpr, encodeDagRecord, encodeDataSource, encodeElicitation, encodeElicitationOutcome, encodeEnvelope, encodeNode, encodeOp, encodePipeline, evalErrorString, evalPipeline, evalPipelineInEnv, evalPipelineWith, evalPipelineWithInEnv, evalSource, field as jsonField, liveValueToTable, merge3Way, moveOp, negotiate, negotiateEnvelope, noResolve, nudgeOp, parse, pasteOp, pasteOpWith, pipelineParams, placeOp, reencodeNode, renderAstCanonical, renderProfile, sequentialFreshIds, stepParams, tryParseProfile, validateAnswer, validateAnswerAt, validateAnswerDocument };