prefix-safe-json 0.0.1-alpha.4 → 0.1.0

package/dist/gate/types.d.ts

@@ -1,184 +0,0 @@
-import { JsonValue, Diagnostic } from "../types.js";
-import { CoordinatorDiagnostic, CoordinatorPushResult, ToolCallCoordinatorEvent } from "../coordinator/types.js";
-import { NormalizedToolStreamEvent, ProviderName, StreamEndReason } from "../coordinator/protocol.js";
-/**
- * What to do with a tool call right now.
- *
- * - `"execute"`: the arguments are complete, unfabricated, and (if a schema
- *   was registered for this tool) schema-valid. Safe to run.
- * - `"retry"`: the provider's output was incomplete or truncated. There is
- *   nothing wrong with the data received so far - there just isn't a
- *   trustworthy complete value yet. Re-request/continue generation.
- * - `"reject"`: the data itself is the problem (malformed JSON, a schema
- *   mismatch, a resource limit, a provider-side error, or a content-policy
- *   termination). Re-sending the exact same partial input will not fix it.
- */
-export type ExecutionAction = "execute" | "retry" | "reject";
-/**
- * Machine-readable classification of *why* an `ExecutionAction` was chosen.
- * See `docs/EXECUTION_GATE.md` for the full decision table.
- */
-export type ExecutionReason = "complete" | "truncated" | "stream_incomplete" | "schema_invalid" | "malformed" | "resource_limit" | "provider_error" | "content_filtered" | "unknown";
-/**
- * Why a decision came out the way it did - observability, not a second
- * decision input. Every field here is read-only, derived state already held
- * elsewhere (`ToolCallState`, the stream-level `DecisionContext`); nothing
- * on this object ever feeds back into `decideExecution()`'s own logic, and
- * changing what it reports can never change `action`/`executable`/`reason`.
- *
- * Deliberately excludes anything that would require new cross-layer
- * plumbing to derive reliably (e.g. a received-chunk count - the parser
- * only tracks cumulative bytes, not `push()` call counts, and adding that
- * tracking purely to populate a metric here was judged not worth the
- * coupling for this release).
- */
-export interface DecisionEvidence {
-    /** Which provider adapter produced this call (`ToolCallState.provider`). */
-    readonly provider: ProviderName;
-    /**
-     * The provider's own, pre-normalization finish/stop reason string, when
-     * the stream-ending event carried one (e.g. `"length"`, `"max_output_tokens"`,
-     * `"content_filter"`). `undefined` when the stream never reported one, or
-     * reported one without a `providerReason` (e.g. a default `finish()` call
-     * with no `meta`).
-     */
-    readonly providerReason?: string;
-    /** The normalized, library-level stream-end reason applied to this call. */
-    readonly streamEndReason: StreamEndReason;
-    /**
-     * Whether a real `provider_stream_end` reason was ever observed, as
-     * opposed to the neutral `"unknown"` default a gate reports before any
-     * stream-end signal has arrived at all. `true` here does NOT mean the
-     * reason was safe - a confirmed `"length"` still has `terminalConfirmed:
-     * true` - only that the stream's end state is genuinely known rather than
-     * merely unclassified or never observed.
-     */
-    readonly terminalConfirmed: boolean;
-    /**
-     * Whether the parser's root JSON container actually closed
-     * (`ToolCallState.parser.rootComplete`) - independent of whether that
-     * closure was genuine or reached via a safe-close repair, and independent
-     * of whether the stream-end reason makes it trustworthy. A syntactically
-     * complete value cut short by `length` has `structurallyComplete: true`
-     * and `parserExecutable: false` at the same time - that combination *is*
-     * the scenario this library exists to catch.
-     */
-    readonly structurallyComplete: boolean;
-    /** `ToolCallState.parser.executable`, verbatim - the parser's own fail-closed verdict. */
-    readonly parserExecutable: boolean;
-    /**
-     * `ToolCallState.schemaValid`, verbatim. `undefined` when no schema was
-     * registered for this tool, or the call never reached a structurally
-     * complete outcome.
-     */
-    readonly schemaValid?: boolean;
-    /** Total bytes received for this call's argument stream (`ToolCallState.parser.receivedBytes`). */
-    readonly receivedBytes: number;
-}
-interface ExecutionDecisionCommon {
-    /** The coordinator's internal call identifier (see `ToolCallState.internalId`). */
-    readonly internalId: string;
-    readonly toolCallId?: string;
-    readonly toolIndex?: number;
-    readonly name?: string;
-    /**
-     * Whatever was safely committed for this call, complete or not - present
-     * for both executable and non-executable decisions so a caller can see
-     * *what part* of a rejected/retried call was genuinely received (e.g. a
-     * `path` field that arrived before a `content` field got cut off).
-     * Never the source of truth for whether it's safe to act on - that's
-     * `action`/`executable`. Absent only when nothing was ever committed.
-     */
-    readonly stableValue?: JsonValue;
-    /** This call's own parser diagnostics, verbatim (`ToolCallState.parser.diagnostics`). */
-    readonly parserDiagnostics: readonly Diagnostic[];
-    /** Coordinator-level diagnostics attributable to this call, verbatim. */
-    readonly coordinatorDiagnostics: readonly CoordinatorDiagnostic[];
-    /**
-     * Why this decision came out the way it did. See `DecisionEvidence` -
-     * always present, purely observational, never a second source of truth
-     * for `action`/`executable`/`reason`.
-     */
-    readonly evidence: DecisionEvidence;
-}
-/**
- * The one and only shape a decision can have when `action === "execute"`.
- * `value` is a real, present `JsonValue` here - never `undefined`, never
- * optional - because this is the single positive case: everything else in
- * the gate exists to rule this out unless it's genuinely earned.
- */
-export interface ExecuteDecision extends ExecutionDecisionCommon {
-    readonly action: "execute";
-    readonly executable: true;
-    readonly reason: "complete";
-    readonly value: JsonValue;
-    /**
-     * Narrowed to required here (unlike the inherited `name?: string`):
-     * the coordinator only ever transitions a call to `status: "complete"`
-     * when `name` is defined (see `DefaultToolCallStreamCoordinator.finishCall`
-     * - a call with no name is forced to `"invalid"` instead), so every
-     * `ExecuteDecision` genuinely has one. Encoding that here means
-     * `tools[decision.name](decision.value)` type-checks directly after
-     * narrowing on `action === "execute"`, with no non-null assertion needed.
-     */
-    readonly name: string;
-}
-/**
- * Every other outcome. `value` does not exist on this type at all (not
- * `undefined` - absent) - TypeScript itself refuses code that reads a
- * "final executable value" off a call the gate did not clear for execution.
- */
-export interface NonExecutableDecision extends ExecutionDecisionCommon {
-    readonly action: "retry" | "reject";
-    readonly executable: false;
-    readonly reason: Exclude<ExecutionReason, "complete">;
-}
-/**
- * `ExecuteDecision | NonExecutableDecision` - a discriminated union on
- * `action` (and redundantly on `executable`, for callers who prefer that
- * check). Narrowing on either field gives you the right shape:
- *
- * ```ts
- * if (decision.action === "execute") {
- *   await tools[decision.name](decision.value); // JsonValue, not JsonValue|undefined
- * }
- * ```
- */
-export type ExecutionDecision = ExecuteDecision | NonExecutableDecision;
-export interface ToolCallExecutionGateFinalResult {
-    /** One decision per tool call the coordinator ever created. */
-    readonly decisions: readonly ExecutionDecision[];
-    /**
-     * The full, unfiltered coordinator diagnostics list (same as
-     * `coordinator.snapshot().diagnostics`) - includes diagnostics with no
-     * associated call, e.g. `E_COORDINATOR_LIMIT_CALLS` fires for a call that
-     * hit the concurrent-call limit before a `ToolCallState` could even be
-     * created for it, so it can never appear in `decisions`.
-     */
-    readonly diagnostics: readonly CoordinatorDiagnostic[];
-}
-/**
- * High-level fail-closed execution decision layer built on top of
- * `ToolCallStreamCoordinator`. Answers one question per tool call: is it
- * safe to execute right now? Callers never need to touch parser lexical
- * state, coordinator event mechanics, or JSON Pointer paths - push provider
- * events in, read `ExecutionDecision`s out.
- */
-export interface ToolCallExecutionGate {
-    push(event: NormalizedToolStreamEvent): CoordinatorPushResult;
-    /**
-     * In-flight view. Every decision here is `"retry"` or `"reject"` -
-     * `"execute"` is only ever returned once the stream has genuinely
-     * finished (see `finish()`), since schema validity and prefix-safety are
-     * both only meaningful once a call has settled.
-     */
-    snapshot(): readonly ExecutionDecision[];
-    /** Drains the underlying coordinator's raw event queue, for advanced/UI consumers. */
-    drainEvents(): readonly ToolCallCoordinatorEvent[];
-    finish(meta?: {
-        reason?: StreamEndReason;
-        providerReason?: string;
-    }): ToolCallExecutionGateFinalResult;
-}
-export {};
-//# sourceMappingURL=types.d.ts.map

package/dist/gate/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/gate/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,wBAAwB,EACzB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,yBAAyB,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAEtG;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,OAAO,GAAG,QAAQ,CAAC;AAE7D;;;GAGG;AACH,MAAM,MAAM,eAAe,GACvB,UAAU,GACV,WAAW,GACX,mBAAmB,GACnB,gBAAgB,GAChB,WAAW,GACX,gBAAgB,GAChB,gBAAgB,GAChB,kBAAkB,GAClB,SAAS,CAAC;AAEd;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,gBAAgB;IAC/B,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAEhC;;;;;;OAMG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IAEjC,4EAA4E;IAC5E,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;IAE1C;;;;;;;OAOG;IACH,QAAQ,CAAC,iBAAiB,EAAE,OAAO,CAAC;IAEpC;;;;;;;;OAQG;IACH,QAAQ,CAAC,oBAAoB,EAAE,OAAO,CAAC;IAEvC,0FAA0F;IAC1F,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IAEnC;;;;OAIG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAE/B,mGAAmG;IACnG,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,UAAU,uBAAuB;IAC/B,mFAAmF;IACnF,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;OAOG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC;IAEjC,yFAAyF;IACzF,QAAQ,CAAC,iBAAiB,EAAE,SAAS,UAAU,EAAE,CAAC;IAElD,yEAAyE;IACzE,QAAQ,CAAC,sBAAsB,EAAE,SAAS,qBAAqB,EAAE,CAAC;IAElE;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;CACrC;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAgB,SAAQ,uBAAuB;IAC9D,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;IAE1B;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;;;GAIG;AACH,MAAM,WAAW,qBAAsB,SAAQ,uBAAuB;IACpE,QAAQ,CAAC,MAAM,EAAE,OAAO,GAAG,QAAQ,CAAC;IACpC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;CACvD;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,iBAAiB,GAAG,eAAe,GAAG,qBAAqB,CAAC;AAExE,MAAM,WAAW,gCAAgC;IAC/C,+DAA+D;IAC/D,QAAQ,CAAC,SAAS,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAEjD;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,qBAAqB,EAAE,CAAC;CACxD;AAED;;;;;;GAMG;AACH,MAAM,WAAW,qBAAqB;IACpC,IAAI,CAAC,KAAK,EAAE,yBAAyB,GAAG,qBAAqB,CAAC;IAE9D;;;;;OAKG;IACH,QAAQ,IAAI,SAAS,iBAAiB,EAAE,CAAC;IAEzC,sFAAsF;IACtF,WAAW,IAAI,SAAS,wBAAwB,EAAE,CAAC;IAEnD,MAAM,CAAC,IAAI,CAAC,EAAE;QACZ,MAAM,CAAC,EAAE,eAAe,CAAC;QACzB,cAAc,CAAC,EAAE,MAAM,CAAC;KACzB,GAAG,gCAAgC,CAAC;CACtC"}

package/dist/gate/types.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=types.js.map

package/dist/gate/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/gate/types.ts"],"names":[],"mappings":""}

package/dist/grammar/frame.d.ts

@@ -1,58 +0,0 @@
-/**
- * Expectation states for object parsing.
- */
-export type ObjectExpectation = "first_key_or_end" | "key_after_comma" | "colon" | "value" | "comma_or_end";
-/**
- * Expectation states for array parsing.
- */
-export type ArrayExpectation = "first_value_or_end" | "value_after_comma" | "comma_or_end";
-/**
- * A frame on the grammar stack representing a JSON container.
- */
-export interface GrammarFrame {
-    /** The type of container. */
-    containerType: "object" | "array";
-    /**
-     * The JSON Pointer path up to this container.
-     * Backed by a lazily-computed, memoized getter (see attachLazyPath) —
-     * reads exactly like a plain string field everywhere else in the codebase.
-     */
-    path: string;
-    /** Current expectation for object parsing. */
-    objectExpectation?: ObjectExpectation;
-    /** Current key being processed. */
-    currentKey?: string;
-    /** Set of keys already seen (for duplicate detection). */
-    seenKeys?: Set<string>;
-    /** Current expectation for array parsing. */
-    arrayExpectation?: ArrayExpectation;
-    /** Index of the next element. */
-    nextArrayIndex: number;
-    /** Byte offset where this container started. */
-    byteStart: number;
-    /**
-     * @internal Lazy-path bookkeeping. Do not read directly — use `.path`.
-     * A frame's own path never changes after creation (only descendants'
-     * currentKey/nextArrayIndex mutate), so it's safe to resolve on demand.
-     */
-    _parent?: GrammarFrame | null;
-    /** @internal The key/index linking `_parent` to this frame, captured at creation time. */
-    _segment?: string | number | null;
-    /** @internal Memoized resolved path, set the first time `.path` is read. */
-    _cachedPath?: string;
-}
-/**
- * Create a new object frame.
- * `parent` is the frame this one is nested inside (or null at the root);
- * `segment` is the key/index leading from parent to this frame (or null at
- * the root) — the same value `GrammarStack.currentValuePath()` would have
- * used, captured eagerly since it reflects the parent's mutable state at
- * this exact moment. Only the (expensive, O(depth)) string flattening is
- * deferred.
- */
-export declare function createObjectFrame(parent: GrammarFrame | null, segment: string | number | null, byteStart: number): GrammarFrame;
-/**
- * Create a new array frame. See createObjectFrame for `parent`/`segment`.
- */
-export declare function createArrayFrame(parent: GrammarFrame | null, segment: string | number | null, byteStart: number): GrammarFrame;
-//# sourceMappingURL=frame.d.ts.map

package/dist/grammar/frame.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"frame.d.ts","sourceRoot":"","sources":["../../src/grammar/frame.ts"],"names":[],"mappings":"AAMA;;GAEG;AACH,MAAM,MAAM,iBAAiB,GACzB,kBAAkB,GAClB,iBAAiB,GACjB,OAAO,GACP,OAAO,GACP,cAAc,CAAC;AAEnB;;GAEG;AACH,MAAM,MAAM,gBAAgB,GACxB,oBAAoB,GACpB,mBAAmB,GACnB,cAAc,CAAC;AAEnB;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6BAA6B;IAC7B,aAAa,EAAE,QAAQ,GAAG,OAAO,CAAC;IAElC;;;;OAIG;IACH,IAAI,EAAE,MAAM,CAAC;IAGb,8CAA8C;IAC9C,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IAEtC,mCAAmC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB,0DAA0D;IAC1D,QAAQ,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAGvB,6CAA6C;IAC7C,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IAEpC,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAC;IAEvB,gDAAgD;IAChD,SAAS,EAAE,MAAM,CAAC;IAElB;;;;OAIG;IACH,OAAO,CAAC,EAAE,YAAY,GAAG,IAAI,CAAC;IAC9B,0FAA0F;IAC1F,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IAClC,4EAA4E;IAC5E,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA0DD;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,YAAY,GAAG,IAAI,EAC3B,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,EAC/B,SAAS,EAAE,MAAM,GAChB,YAAY,CAWd;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,YAAY,GAAG,IAAI,EAC3B,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,EAC/B,SAAS,EAAE,MAAM,GAChB,YAAY,CAUd"}

package/dist/grammar/frame.js

@@ -1,87 +0,0 @@
-// ---------------------------------------------------------------------------
-// Grammar stack frame — tracks state of a JSON container
-// ---------------------------------------------------------------------------
-import { appendPointer } from "./pointer.js";
-/**
- * Resolve (and memoize) a frame's full JSON Pointer path.
- *
- * Iterative, not recursive: walks up `_parent` references collecting frames
- * until it finds one whose path is already cached (or the root), then walks
- * back down building and caching each frame's path exactly once. This keeps
- * per-frame cost amortized O(1) regardless of nesting depth, and avoids
- * both the call-stack growth a recursive walk would have and the O(depth)
- * eager string concatenation this replaces (which made opening N nested
- * containers cost O(N^2) total, regardless of whether any value inside them
- * was ever committed).
- */
-function resolveFramePath(frame) {
-    if (frame._cachedPath !== undefined)
-        return frame._cachedPath;
-    const chain = [];
-    let cur = frame;
-    while (cur !== null && cur._cachedPath === undefined) {
-        chain.push(cur);
-        cur = cur._parent === undefined ? null : cur._parent;
-    }
-    let basePath = cur !== null ? cur._cachedPath : "";
-    // chain[0] is always `frame` itself (pushed in the first loop iteration),
-    // and this loop runs in reverse, so the last iteration (i === 0) sets
-    // basePath to frame's own resolved path — returning it directly avoids
-    // re-reading frame._cachedPath, which TS can't prove was set here since
-    // the mutation happens through the aliased `f` reference.
-    for (let i = chain.length - 1; i >= 0; i--) {
-        const f = chain[i];
-        const seg = f._segment;
-        basePath =
-            seg === null || seg === undefined ? basePath : appendPointer(basePath, seg);
-        f._cachedPath = basePath;
-    }
-    return basePath;
-}
-function attachLazyPath(frame, parent, segment) {
-    frame._parent = parent;
-    frame._segment = segment;
-    Object.defineProperty(frame, "path", {
-        enumerable: true,
-        configurable: true,
-        get() {
-            return resolveFramePath(frame);
-        },
-    });
-}
-/**
- * Create a new object frame.
- * `parent` is the frame this one is nested inside (or null at the root);
- * `segment` is the key/index leading from parent to this frame (or null at
- * the root) — the same value `GrammarStack.currentValuePath()` would have
- * used, captured eagerly since it reflects the parent's mutable state at
- * this exact moment. Only the (expensive, O(depth)) string flattening is
- * deferred.
- */
-export function createObjectFrame(parent, segment, byteStart) {
-    const frame = {
-        containerType: "object",
-        path: "",
-        objectExpectation: "first_key_or_end",
-        seenKeys: new Set(),
-        nextArrayIndex: 0,
-        byteStart,
-    };
-    attachLazyPath(frame, parent, segment);
-    return frame;
-}
-/**
- * Create a new array frame. See createObjectFrame for `parent`/`segment`.
- */
-export function createArrayFrame(parent, segment, byteStart) {
-    const frame = {
-        containerType: "array",
-        path: "",
-        arrayExpectation: "first_value_or_end",
-        nextArrayIndex: 0,
-        byteStart,
-    };
-    attachLazyPath(frame, parent, segment);
-    return frame;
-}
-//# sourceMappingURL=frame.js.map

package/dist/grammar/frame.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"frame.js","sourceRoot":"","sources":["../../src/grammar/frame.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,yDAAyD;AACzD,8EAA8E;AAE9E,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAkE7C;;;;;;;;;;;GAWG;AACH,SAAS,gBAAgB,CAAC,KAAmB;IAC3C,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,WAAW,CAAC;IAE9D,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,GAAG,GAAwB,KAAK,CAAC;IACrC,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,GAAG,GAAG,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;IACvD,CAAC;IAED,IAAI,QAAQ,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,WAAsB,CAAC,CAAC,CAAC,EAAE,CAAC;IAE/D,0EAA0E;IAC1E,sEAAsE;IACtE,uEAAuE;IACvE,wEAAwE;IACxE,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAiB,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;QACvB,QAAQ;YACN,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9E,CAAC,CAAC,WAAW,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,cAAc,CACrB,KAAmB,EACnB,MAA2B,EAC3B,OAA+B;IAE/B,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC;IACvB,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC;IACzB,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE;QACnC,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;QAClB,GAAG;YACD,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAA2B,EAC3B,OAA+B,EAC/B,SAAiB;IAEjB,MAAM,KAAK,GAAiB;QAC1B,aAAa,EAAE,QAAQ;QACvB,IAAI,EAAE,EAAE;QACR,iBAAiB,EAAE,kBAAkB;QACrC,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,cAAc,EAAE,CAAC;QACjB,SAAS;KACV,CAAC;IACF,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAA2B,EAC3B,OAA+B,EAC/B,SAAiB;IAEjB,MAAM,KAAK,GAAiB;QAC1B,aAAa,EAAE,OAAO;QACtB,IAAI,EAAE,EAAE;QACR,gBAAgB,EAAE,oBAAoB;QACtC,cAAc,EAAE,CAAC;QACjB,SAAS;KACV,CAAC;IACF,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/grammar/pointer.d.ts

@@ -1,10 +0,0 @@
-/**
- * Escape a JSON Pointer reference token per RFC 6901.
- * ~ → ~0, / → ~1
- */
-export declare function escapePointerToken(token: string): string;
-/**
- * Build a JSON Pointer path from parent path and a key or index.
- */
-export declare function appendPointer(parent: string, token: string | number): string;
-//# sourceMappingURL=pointer.d.ts.map

package/dist/grammar/pointer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pointer.d.ts","sourceRoot":"","sources":["../../src/grammar/pointer.ts"],"names":[],"mappings":"AAIA;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAK5E"}

package/dist/grammar/pointer.js

@@ -1,20 +0,0 @@
-// ---------------------------------------------------------------------------
-// JSON Pointer utilities (RFC 6901)
-// ---------------------------------------------------------------------------
-/**
- * Escape a JSON Pointer reference token per RFC 6901.
- * ~ → ~0, / → ~1
- */
-export function escapePointerToken(token) {
-    return token.replace(/~/g, "~0").replace(/\//g, "~1");
-}
-/**
- * Build a JSON Pointer path from parent path and a key or index.
- */
-export function appendPointer(parent, token) {
-    if (typeof token === "number") {
-        return `${parent}/${token}`;
-    }
-    return `${parent}/${escapePointerToken(token)}`;
-}
-//# sourceMappingURL=pointer.js.map

package/dist/grammar/pointer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pointer.js","sourceRoot":"","sources":["../../src/grammar/pointer.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,oCAAoC;AACpC,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa;IAC9C,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,MAAc,EAAE,KAAsB;IAClE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO,GAAG,MAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;AAClD,CAAC"}

package/dist/grammar/stack.d.ts

@@ -1,73 +0,0 @@
-import type { GrammarFrame } from "./frame.js";
-import type { Diagnostic } from "../types.js";
-/**
- * Manages the stack of open JSON containers.
- * Handles object/array nesting, expectations, and duplicate key detection.
- */
-export declare class GrammarStack {
-    private stack;
-    private diagnostics;
-    private hasDuplicateKey;
-    private maxDepth;
-    constructor(maxDepth: number);
-    /** Current depth (number of open containers). */
-    get depth(): number;
-    /** Whether any duplicate key has been seen. */
-    get hasDuplicate(): boolean;
-    /** Get the current (top) frame, or undefined if empty. */
-    get current(): GrammarFrame | undefined;
-    /**
-     * Push a new object container.
-     * Returns the frame, or null if depth limit exceeded.
-     */
-    pushObject(byteStart: number): GrammarFrame | null;
-    /**
-     * Push a new array container.
-     * Returns the frame, or null if depth limit exceeded.
-     */
-    pushArray(byteStart: number): GrammarFrame | null;
-    /**
-     * Pop the current container.
-     * Returns the popped frame.
-     */
-    pop(): GrammarFrame | undefined;
-    /**
-     * Register an object key. Returns true if the key is new.
-     * If duplicate, emits diagnostic and returns false.
-     */
-    registerObjectKey(key: string, byteOffset: number): boolean;
-    /**
-     * Get the JSON Pointer path for where the next value will go.
-     */
-    currentValuePath(): string;
-    /**
-     * The key/index that would lead from the current frame to its next child,
-     * without flattening it into a full path string. Same underlying value
-     * currentValuePath() uses; kept as a raw segment so a newly-pushed child
-     * frame can capture it in O(1) and defer the expensive path-string join
-     * (see grammar/frame.ts) until something actually reads `.path`.
-     */
-    private currentSegment;
-    /**
-     * Advance the array index after an element value is committed.
-     */
-    advanceArrayIndex(): void;
-    /**
-     * Take accumulated diagnostics and clear.
-     */
-    takeDiagnostics(): Diagnostic[];
-    /**
-     * Check if the stack is empty (no open containers).
-     */
-    isEmpty(): boolean;
-    /**
-     * Get all frames (for snapshot/pending info).
-     */
-    getFrames(): readonly GrammarFrame[];
-    /**
-     * Determine if all open containers can be safely closed by just appending '}' or ']'.
-     * This is true if no container is waiting for a colon or a value.
-     */
-    canSafelyCloseAll(): boolean;
-}
-//# sourceMappingURL=stack.d.ts.map

package/dist/grammar/stack.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"stack.d.ts","sourceRoot":"","sources":["../../src/grammar/stack.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAI9C;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAsB;IACnC,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAS;gBAEb,QAAQ,EAAE,MAAM;IAI5B,iDAAiD;IACjD,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,+CAA+C;IAC/C,IAAI,YAAY,IAAI,OAAO,CAE1B;IAED,0DAA0D;IAC1D,IAAI,OAAO,IAAI,YAAY,GAAG,SAAS,CAEtC;IAED;;;OAGG;IACH,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAmBlD;;;OAGG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IAmBjD;;;OAGG;IACH,GAAG,IAAI,YAAY,GAAG,SAAS;IAI/B;;;OAGG;IACH,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO;IA0B3D;;OAEG;IACH,gBAAgB,IAAI,MAAM;IAc1B;;;;;;OAMG;IACH,OAAO,CAAC,cAAc;IAUtB;;OAEG;IACH,iBAAiB,IAAI,IAAI;IAOzB;;OAEG;IACH,eAAe,IAAI,UAAU,EAAE;IAM/B;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,SAAS,IAAI,SAAS,YAAY,EAAE;IAIpC;;;OAGG;IACH,iBAAiB,IAAI,OAAO;CAkB7B"}

package/dist/grammar/stack.js

@@ -1,168 +0,0 @@
-// ---------------------------------------------------------------------------
-// Grammar Stack — tracks nested JSON container state
-// ---------------------------------------------------------------------------
-import { createObjectFrame, createArrayFrame } from "./frame.js";
-import { appendPointer } from "./pointer.js";
-import { DiagnosticCode } from "../diagnostics/codes.js";
-import { createDiagnostic } from "../diagnostics/factory.js";
-/**
- * Manages the stack of open JSON containers.
- * Handles object/array nesting, expectations, and duplicate key detection.
- */
-export class GrammarStack {
-    stack = [];
-    diagnostics = [];
-    hasDuplicateKey = false;
-    maxDepth;
-    constructor(maxDepth) {
-        this.maxDepth = maxDepth;
-    }
-    /** Current depth (number of open containers). */
-    get depth() {
-        return this.stack.length;
-    }
-    /** Whether any duplicate key has been seen. */
-    get hasDuplicate() {
-        return this.hasDuplicateKey;
-    }
-    /** Get the current (top) frame, or undefined if empty. */
-    get current() {
-        return this.stack[this.stack.length - 1];
-    }
-    /**
-     * Push a new object container.
-     * Returns the frame, or null if depth limit exceeded.
-     */
-    pushObject(byteStart) {
-        if (this.stack.length >= this.maxDepth) {
-            this.diagnostics.push(createDiagnostic(DiagnosticCode.E_LIMIT_DEPTH, "fatal", byteStart, `Maximum nesting depth ${this.maxDepth} exceeded`, false));
-            return null;
-        }
-        const parent = this.current ?? null;
-        const frame = createObjectFrame(parent, this.currentSegment(), byteStart);
-        this.stack.push(frame);
-        return frame;
-    }
-    /**
-     * Push a new array container.
-     * Returns the frame, or null if depth limit exceeded.
-     */
-    pushArray(byteStart) {
-        if (this.stack.length >= this.maxDepth) {
-            this.diagnostics.push(createDiagnostic(DiagnosticCode.E_LIMIT_DEPTH, "fatal", byteStart, `Maximum nesting depth ${this.maxDepth} exceeded`, false));
-            return null;
-        }
-        const parent = this.current ?? null;
-        const frame = createArrayFrame(parent, this.currentSegment(), byteStart);
-        this.stack.push(frame);
-        return frame;
-    }
-    /**
-     * Pop the current container.
-     * Returns the popped frame.
-     */
-    pop() {
-        return this.stack.pop();
-    }
-    /**
-     * Register an object key. Returns true if the key is new.
-     * If duplicate, emits diagnostic and returns false.
-     */
-    registerObjectKey(key, byteOffset) {
-        const frame = this.current;
-        if (!frame || frame.containerType !== "object" || !frame.seenKeys) {
-            return false;
-        }
-        if (frame.seenKeys.has(key)) {
-            this.hasDuplicateKey = true;
-            this.diagnostics.push(createDiagnostic(DiagnosticCode.E_DUPLICATE_KEY, "error", byteOffset, `Duplicate object key: ${JSON.stringify(key)}`, false, frame.path));
-            return false;
-        }
-        frame.seenKeys.add(key);
-        frame.currentKey = key;
-        return true;
-    }
-    /**
-     * Get the JSON Pointer path for where the next value will go.
-     */
-    currentValuePath() {
-        const frame = this.current;
-        if (!frame)
-            return "";
-        if (frame.containerType === "object") {
-            if (frame.currentKey !== undefined) {
-                return appendPointer(frame.path, frame.currentKey);
-            }
-            return frame.path;
-        }
-        // array
-        return appendPointer(frame.path, frame.nextArrayIndex);
-    }
-    /**
-     * The key/index that would lead from the current frame to its next child,
-     * without flattening it into a full path string. Same underlying value
-     * currentValuePath() uses; kept as a raw segment so a newly-pushed child
-     * frame can capture it in O(1) and defer the expensive path-string join
-     * (see grammar/frame.ts) until something actually reads `.path`.
-     */
-    currentSegment() {
-        const frame = this.current;
-        if (!frame)
-            return null;
-        if (frame.containerType === "object") {
-            return frame.currentKey !== undefined ? frame.currentKey : null;
-        }
-        return frame.nextArrayIndex;
-    }
-    /**
-     * Advance the array index after an element value is committed.
-     */
-    advanceArrayIndex() {
-        const frame = this.current;
-        if (frame && frame.containerType === "array") {
-            frame.nextArrayIndex++;
-        }
-    }
-    /**
-     * Take accumulated diagnostics and clear.
-     */
-    takeDiagnostics() {
-        const result = this.diagnostics;
-        this.diagnostics = [];
-        return result;
-    }
-    /**
-     * Check if the stack is empty (no open containers).
-     */
-    isEmpty() {
-        return this.stack.length === 0;
-    }
-    /**
-     * Get all frames (for snapshot/pending info).
-     */
-    getFrames() {
-        return this.stack;
-    }
-    /**
-     * Determine if all open containers can be safely closed by just appending '}' or ']'.
-     * This is true if no container is waiting for a colon or a value.
-     */
-    canSafelyCloseAll() {
-        for (const frame of this.stack) {
-            if (frame.containerType === "object") {
-                if (frame.objectExpectation === "colon" ||
-                    frame.objectExpectation === "value" ||
-                    frame.objectExpectation === "key_after_comma") {
-                    return false; // Missing colon or value or key
-                }
-            }
-            else {
-                if (frame.arrayExpectation === "value_after_comma") {
-                    return false; // Missing value after comma
-                }
-            }
-        }
-        return true;
-    }
-}
-//# sourceMappingURL=stack.js.map

package/dist/grammar/stack.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../src/grammar/stack.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,qDAAqD;AACrD,8EAA8E;AAG9E,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE7C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAE7D;;;GAGG;AACH,MAAM,OAAO,YAAY;IACf,KAAK,GAAmB,EAAE,CAAC;IAC3B,WAAW,GAAiB,EAAE,CAAC;IAC/B,eAAe,GAAG,KAAK,CAAC;IACxB,QAAQ,CAAS;IAEzB,YAAY,QAAgB;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,iDAAiD;IACjD,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,+CAA+C;IAC/C,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,0DAA0D;IAC1D,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,SAAiB;QAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,IAAI,CACnB,gBAAgB,CACd,cAAc,CAAC,aAAa,EAC5B,OAAO,EACP,SAAS,EACT,yBAAyB,IAAI,CAAC,QAAQ,WAAW,EACjD,KAAK,CACN,CACF,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,EAAE,SAAS,CAAC,CAAC;QAC1E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,SAAiB;QACzB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,IAAI,CACnB,gBAAgB,CACd,cAAc,CAAC,aAAa,EAC5B,OAAO,EACP,SAAS,EACT,yBAAyB,IAAI,CAAC,QAAQ,WAAW,EACjD,KAAK,CACN,CACF,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC;QACpC,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,EAAE,SAAS,CAAC,CAAC;QACzE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,GAAG;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,GAAW,EAAE,UAAkB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC3B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CACnB,gBAAgB,CACd,cAAc,CAAC,eAAe,EAC9B,OAAO,EACP,UAAU,EACV,yBAAyB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAC9C,KAAK,EACL,KAAK,CAAC,IAAI,CACX,CACF,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QAED,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxB,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC3B,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QAEtB,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACnC,OAAO,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,CAAC;QACpB,CAAC;QACD,QAAQ;QACR,OAAO,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACK,cAAc;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC3B,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QAExB,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;QAClE,CAAC;QACD,OAAO,KAAK,CAAC,cAAc,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC3B,IAAI,KAAK,IAAI,KAAK,CAAC,aAAa,KAAK,OAAO,EAAE,CAAC;YAC7C,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;QAChC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,iBAAiB;QACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;gBACrC,IACE,KAAK,CAAC,iBAAiB,KAAK,OAAO;oBACnC,KAAK,CAAC,iBAAiB,KAAK,OAAO;oBACnC,KAAK,CAAC,iBAAiB,KAAK,iBAAiB,EAC7C,CAAC;oBACD,OAAO,KAAK,CAAC,CAAC,gCAAgC;gBAChD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,KAAK,CAAC,gBAAgB,KAAK,mBAAmB,EAAE,CAAC;oBACnD,OAAO,KAAK,CAAC,CAAC,4BAA4B;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}