@smthrs/flow 0.0.0-stage → 1.0.0-rc.4

package/dist/esm/internal/JsonSchemaSubset.d.ts

@@ -0,0 +1,133 @@
+/**
+ * The bounded JSON Schema subset a human-task answer is checked against.
+ *
+ * `HumanTask` asks a person for a value and refuses one that does not fit the
+ * question. The fit for a `json` question is decided here: a schema is kept
+ * inside a deliberately small subset, an answer is checked against it under
+ * the same size bounds every human-task value is admitted under, and every
+ * rejection is rendered within one diagnostic budget. `HumanTask` re-exports
+ * the limits and the two public entry points; this file is the mechanism.
+ *
+ * @since 1.0.0
+ */
+import * as BoundedJson from "./BoundedJson.ts";
+/**
+ * The deepest supported JSON Schema path, counting the root as depth zero.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxSchemaDepth = 32;
+/**
+ * The most schema objects one human-task request may contain.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxSchemaNodes = 512;
+/**
+ * The most JSON values embedded across schema keywords such as `enum`.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxSchemaValueNodes = 10000;
+/**
+ * The deepest JSON value embedded in a schema, including enum members.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxSchemaValueDepth = 64;
+/**
+ * The most JSON values one answer validation may visit.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxAnswerNodes = 10000;
+/**
+ * The largest encoded JSON answer that can enter the durable store.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxAnswerBytes: number;
+/**
+ * The largest encoded JSON Schema carried by one question.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxSchemaBytes: number;
+/**
+ * The deepest admitted answer tree.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxAnswerDepth = 64;
+/**
+ * The largest encoded string value admitted in a request or answer.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxJsonStringBytes: number;
+/**
+ * The largest encoded object key admitted in a request or answer.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxJsonKeyBytes: number;
+/**
+ * The most members admitted in one JSON array or object.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxJsonMembers = 10000;
+/**
+ * The most caller-supplied characters retained in one rendered diagnostic.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const maxDiagnosticChars = 512;
+/** Truncates a caller-supplied diagnostic while stating exactly what was dropped.
+ * @private
+ * @since 1.0.0
+ */
+export declare const truncateDiagnostic: (rendered: string) => string;
+/** Renders one JSON value for a bounded rejection message.
+ * @private
+ * @since 1.0.0
+ */
+export declare const renderDiagnostic: (value: unknown) => string;
+/** The bounds one answer is admitted under.
+ * @private
+ * @since 1.0.0
+ */
+export declare const answerLimits: BoundedJson.Limits;
+/** The bounds one schema is admitted under, enum members included.
+ * @private
+ * @since 1.0.0
+ */
+export declare const schemaLimits: BoundedJson.Limits;
+/** Checks schema validity and snapshots both inputs before walking them together.
+ * @private
+ * @since 1.0.0
+ */
+export declare const check: (value: unknown, schema: unknown) => string | undefined;
+/**
+ * Checks that a JSON Schema stays inside the bounded subset, at every depth.
+ *
+ * Returns the first reason the schema is out of bounds, or `undefined` when the
+ * whole tree is inside it.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export declare const validateSchema: (schema: unknown, path: ReadonlyArray<string>) => string | undefined;
+//# sourceMappingURL=JsonSchemaSubset.d.ts.map

package/dist/esm/internal/JsonSchemaSubset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"JsonSchemaSubset.d.ts","sourceRoot":"","sources":["../../../src/internal/JsonSchemaSubset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C;;;;;GAKG;AACH,eAAO,MAAM,cAAc,KAAK,CAAA;AAEhC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,MAAM,CAAA;AAEjC;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,QAAS,CAAA;AAEzC;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,KAAK,CAAA;AAErC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,QAAS,CAAA;AAEpC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,QAAa,CAAA;AAExC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,QAAa,CAAA;AAExC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,KAAK,CAAA;AAEhC;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,QAAa,CAAA;AAE5C;;;;;GAKG;AACH,eAAO,MAAM,eAAe,QAAW,CAAA;AAEvC;;;;;GAKG;AACH,eAAO,MAAM,cAAc,QAAS,CAAA;AAEpC;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,MAAM,CAAA;AAiBrC;;;GAGG;AACH,eAAO,MAAM,kBAAkB,GAAI,UAAU,MAAM,KAAG,MAKrD,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,gBAAgB,GAAI,OAAO,OAAO,KAAG,MAAuD,CAAA;AA8CzG;;;GAGG;AACH,eAAO,MAAM,YAAY,EAAE,WAAW,CAAC,MAOtC,CAAA;AAED;;;GAGG;AACH,eAAO,MAAM,YAAY,EAAE,WAAW,CAAC,MAOtC,CAAA;AAsFD;;;GAGG;AACH,eAAO,MAAM,KAAK,GAAI,OAAO,OAAO,EAAE,QAAQ,OAAO,KAAG,MAAM,GAAG,SAQhE,CAAA;AAiED;;;;;;;;GAQG;AACH,eAAO,MAAM,cAAc,GACzB,QAAQ,OAAO,EACf,MAAM,aAAa,CAAC,MAAM,CAAC,KAC1B,MAAM,GAAG,SAKX,CAAA"}

package/dist/esm/internal/JsonSchemaSubset.js

@@ -0,0 +1,363 @@
+/**
+ * The bounded JSON Schema subset a human-task answer is checked against.
+ *
+ * `HumanTask` asks a person for a value and refuses one that does not fit the
+ * question. The fit for a `json` question is decided here: a schema is kept
+ * inside a deliberately small subset, an answer is checked against it under
+ * the same size bounds every human-task value is admitted under, and every
+ * rejection is rendered within one diagnostic budget. `HumanTask` re-exports
+ * the limits and the two public entry points; this file is the mechanism.
+ *
+ * @since 1.0.0
+ */
+import * as BoundedJson from "./BoundedJson.js";
+/**
+ * The deepest supported JSON Schema path, counting the root as depth zero.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxSchemaDepth = 32;
+/**
+ * The most schema objects one human-task request may contain.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxSchemaNodes = 512;
+/**
+ * The most JSON values embedded across schema keywords such as `enum`.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxSchemaValueNodes = 10_000;
+/**
+ * The deepest JSON value embedded in a schema, including enum members.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxSchemaValueDepth = 64;
+/**
+ * The most JSON values one answer validation may visit.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxAnswerNodes = 10_000;
+/**
+ * The largest encoded JSON answer that can enter the durable store.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxAnswerBytes = 256 * 1024;
+/**
+ * The largest encoded JSON Schema carried by one question.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxSchemaBytes = 256 * 1024;
+/**
+ * The deepest admitted answer tree.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxAnswerDepth = 64;
+/**
+ * The largest encoded string value admitted in a request or answer.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxJsonStringBytes = 128 * 1024;
+/**
+ * The largest encoded object key admitted in a request or answer.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxJsonKeyBytes = 4 * 1024;
+/**
+ * The most members admitted in one JSON array or object.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxJsonMembers = 10_000;
+/**
+ * The most caller-supplied characters retained in one rendered diagnostic.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const maxDiagnosticChars = 512;
+/** The JSON Schema types the bounded subset understands. */
+const supportedTypes = new Set(["object", "array", "string", "number", "integer", "boolean", "null"]);
+/** The JSON Schema keywords the bounded subset understands. */
+const supportedKeywords = [
+    "type",
+    "enum",
+    "properties",
+    "required",
+    "items",
+    "nullable",
+    "description",
+    "title"
+];
+/** Truncates a caller-supplied diagnostic while stating exactly what was dropped.
+ * @private
+ * @since 1.0.0
+ */
+export const truncateDiagnostic = (rendered) => {
+    const prefix = BoundedJson.scalarPrefix(rendered, maxDiagnosticChars);
+    return prefix.length === rendered.length
+        ? prefix
+        : `${prefix} [${rendered.length - prefix.length} characters dropped]`;
+};
+/** Renders one JSON value for a bounded rejection message.
+ * @private
+ * @since 1.0.0
+ */
+export const renderDiagnostic = (value) => BoundedJson.render(value, maxDiagnosticChars);
+/**
+ * Renders a value list in its comma-separated diagnostic shape.
+ *
+ * Every member renders to at least one character, so members past the
+ * diagnostic budget can never survive truncation and are not rendered at all.
+ */
+const renderDiagnosticList = (values) => truncateDiagnostic(values.slice(0, maxDiagnosticChars).map((value) => BoundedJson.render(value, maxDiagnosticChars)).join(", "));
+/** Renders a JSON pointer-ish path for a rejection message. */
+const at = (path) => path.length === 0 ? "the answer" : `"${truncateDiagnostic(path.join("."))}"`;
+/** Whether a value is a plain JSON object rather than an array or a null. */
+const isObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+/** Compares two JSON values structurally without depending on object key order. */
+const jsonEquals = (left, right) => {
+    const pending = [[left, right]];
+    while (pending.length > 0) {
+        const [a, b] = pending.pop();
+        if (a === b)
+            continue;
+        if (Array.isArray(a)) {
+            if (!Array.isArray(b) || a.length !== b.length)
+                return false;
+            for (let index = a.length - 1; index >= 0; index--)
+                pending.push([a[index], b[index]]);
+            continue;
+        }
+        if (!isObject(a) || !isObject(b))
+            return false;
+        const aKeys = Object.keys(a).sort();
+        const bKeys = Object.keys(b).sort();
+        if (aKeys.length !== bKeys.length)
+            return false;
+        for (let index = aKeys.length - 1; index >= 0; index--) {
+            const aKey = aKeys[index];
+            const bKey = bKeys[index];
+            if (aKey !== bKey)
+                return false;
+            pending.push([a[aKey], b[bKey]]);
+        }
+    }
+    return true;
+};
+/** The bounds one answer is admitted under.
+ * @private
+ * @since 1.0.0
+ */
+export const answerLimits = {
+    maxNodes: maxAnswerNodes,
+    maxDepth: maxAnswerDepth,
+    maxBytes: maxAnswerBytes,
+    maxStringBytes: maxJsonStringBytes,
+    maxKeyBytes: maxJsonKeyBytes,
+    maxMembers: maxJsonMembers
+};
+/** The bounds one schema is admitted under, enum members included.
+ * @private
+ * @since 1.0.0
+ */
+export const schemaLimits = {
+    maxNodes: maxSchemaValueNodes,
+    maxDepth: maxSchemaValueDepth,
+    maxBytes: maxSchemaBytes,
+    maxStringBytes: maxJsonStringBytes,
+    maxKeyBytes: maxJsonKeyBytes,
+    maxMembers: maxJsonMembers
+};
+/**
+ * Checks a value against the bounded JSON Schema subset, returning the first
+ * reason it does not fit.
+ *
+ * The subset is `type` (`object`, `array`, `string`, `number`, `integer`,
+ * `boolean`, `null`), `enum`, `properties`, `required`, `items`, and
+ * `nullable`. It is deliberately small: a human-task schema exists to say what
+ * shape an answer takes, and every keyword beyond these describes a constraint
+ * a person cannot be usefully re-asked about. A schema that reaches outside it
+ * is refused as `request_invalid` rather than silently ignored, because a
+ * quietly dropped constraint reads as a validation that passed.
+ *
+ * Presence is `Object.hasOwn`, never the `in` operator. An answer is a decoded
+ * JSON object, so every property it really has is its own; `in` also reports
+ * `Object.prototype`'s members, which would accept a missing required
+ * `toString` and check a `constructor` nobody answered against the schema for
+ * one.
+ *
+ * @private
+ */
+const checkAt = (value, schema, path) => {
+    const nullable = schema["nullable"] === true;
+    const enumeration = schema["enum"];
+    if (enumeration !== undefined) {
+        const matches = enumeration.some((allowed) => jsonEquals(allowed, value));
+        if (!matches)
+            return `${at(path)} must be one of ${renderDiagnosticList(enumeration)}.`;
+    }
+    const type = schema["type"];
+    if (!(nullable && value === null) && type !== undefined) {
+        const typeComplaint = type === "object"
+            ? isObject(value) ? undefined : `${at(path)} must be an object.`
+            : type === "array"
+                ? Array.isArray(value) ? undefined : `${at(path)} must be an array.`
+                : type === "integer"
+                    ? Number.isInteger(value) ? undefined : `${at(path)} must be an integer.`
+                    : type === "number"
+                        // Bounded JSON admission already rejected every non-finite number.
+                        ? typeof value === "number" ? undefined : `${at(path)} must be a number.`
+                        : type === "string"
+                            ? typeof value === "string" ? undefined : `${at(path)} must be a string.`
+                            : type === "boolean"
+                                ? typeof value === "boolean" ? undefined : `${at(path)} must be a boolean.`
+                                : value === null
+                                    ? undefined
+                                    : `${at(path)} must be null.`;
+        if (typeComplaint !== undefined)
+            return typeComplaint;
+    }
+    // Object and array keywords are independent constraints. JSON Schema does
+    // not require a sibling `type`; they apply whenever the instance has the
+    // relevant shape and are otherwise ignored.
+    if (isObject(value)) {
+        const required = schema["required"];
+        if (Array.isArray(required)) {
+            const missing = required.find((key) => !Object.hasOwn(value, key));
+            if (missing !== undefined) {
+                return `${at(path)} is missing the required property "${truncateDiagnostic(String(missing))}".`;
+            }
+        }
+        const properties = schema["properties"];
+        if (isObject(properties)) {
+            for (const [key, property] of Object.entries(properties)) {
+                if (!Object.hasOwn(value, key))
+                    continue;
+                const rejection = checkAt(value[key], property, [...path, key]);
+                if (rejection !== undefined)
+                    return rejection;
+            }
+        }
+    }
+    if (Array.isArray(value)) {
+        const items = schema["items"];
+        if (items !== undefined) {
+            for (const [index, element] of value.entries()) {
+                const rejection = checkAt(element, items, [...path, String(index)]);
+                if (rejection !== undefined)
+                    return rejection;
+            }
+        }
+    }
+    return undefined;
+};
+/** Checks schema validity and snapshots both inputs before walking them together.
+ * @private
+ * @since 1.0.0
+ */
+export const check = (value, schema) => {
+    const admittedSchema = BoundedJson.admit(schema, schemaLimits);
+    if (!admittedSchema.ok)
+        return admittedSchema.complaint;
+    const schemaComplaint = validateSchemaAt(admittedSchema.value, [], 0, { visited: 0 });
+    if (schemaComplaint !== undefined)
+        return schemaComplaint;
+    const admittedAnswer = BoundedJson.admit(value, answerLimits);
+    if (!admittedAnswer.ok)
+        return admittedAnswer.complaint;
+    return checkAt(admittedAnswer.value, admittedSchema.value, []);
+};
+/** Walks one schema node under a shared depth and node budget. */
+const validateSchemaAt = (schema, path, depth, budget) => {
+    if (depth > maxSchemaDepth) {
+        return `${at(path)} exceeds the maximum JSON Schema depth of ${maxSchemaDepth}.`;
+    }
+    budget.visited++;
+    if (budget.visited > maxSchemaNodes) {
+        return `${at(path)} exceeds the maximum JSON Schema node count of ${maxSchemaNodes}.`;
+    }
+    if (!isObject(schema))
+        return `${at(path)} is described by something that is not a JSON Schema object.`;
+    const unsupported = Object.keys(schema).find((keyword) => !supportedKeywords.includes(keyword));
+    if (unsupported !== undefined) {
+        return `${at(path)} uses the unsupported JSON Schema keyword "${truncateDiagnostic(unsupported)}".`;
+    }
+    const enumeration = schema["enum"];
+    if (enumeration !== undefined && !Array.isArray(enumeration)) {
+        return `${at(path)} declares an "enum" that is not an array.`;
+    }
+    if (Array.isArray(enumeration) && enumeration.length === 0) {
+        return `${at(path)} declares an empty "enum".`;
+    }
+    if (Object.hasOwn(schema, "required")) {
+        const required = schema["required"];
+        if (!Array.isArray(required))
+            return `${at([...path, "required"])} is not an array.`;
+        const invalid = required.findIndex((key) => typeof key !== "string");
+        if (invalid !== -1)
+            return `${at([...path, "required", String(invalid)])} is not a string.`;
+        if (new Set(required).size !== required.length) {
+            return `${at([...path, "required"])} contains a duplicate property name.`;
+        }
+    }
+    if (Object.hasOwn(schema, "nullable") && typeof schema["nullable"] !== "boolean") {
+        return `${at([...path, "nullable"])} is not a boolean.`;
+    }
+    const type = schema["type"];
+    if (type !== undefined && (typeof type !== "string" || !supportedTypes.has(type))) {
+        return `${at(path)} declares the unsupported JSON Schema type ${renderDiagnostic(type)}.`;
+    }
+    for (const keyword of ["description", "title"]) {
+        if (Object.hasOwn(schema, keyword) && typeof schema[keyword] !== "string") {
+            return `${at([...path, keyword])} is not a string.`;
+        }
+    }
+    const properties = schema["properties"];
+    if (properties !== undefined) {
+        if (!isObject(properties))
+            return `${at(path)} declares "properties" that is not an object.`;
+        for (const [key, property] of Object.entries(properties)) {
+            const complaint = validateSchemaAt(property, [...path, key], depth + 1, budget);
+            if (complaint !== undefined)
+                return complaint;
+        }
+    }
+    const items = schema["items"];
+    return items === undefined ? undefined : validateSchemaAt(items, [...path, "items"], depth + 1, budget);
+};
+/**
+ * Checks that a JSON Schema stays inside the bounded subset, at every depth.
+ *
+ * Returns the first reason the schema is out of bounds, or `undefined` when the
+ * whole tree is inside it.
+ *
+ * @private
+ * @since 1.0.0
+ */
+export const validateSchema = (schema, path) => {
+    const admitted = BoundedJson.admit(schema, schemaLimits);
+    return admitted.ok
+        ? validateSchemaAt(admitted.value, path, 0, { visited: 0 })
+        : admitted.complaint;
+};
+//# sourceMappingURL=JsonSchemaSubset.js.map

package/dist/esm/internal/JsonSchemaSubset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"JsonSchemaSubset.js","sourceRoot":"","sources":["../../../src/internal/JsonSchemaSubset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAE/C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAA;AAEhC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAA;AAEjC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,MAAM,CAAA;AAEzC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAA;AAErC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAA;AAEpC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,GAAG,IAAI,CAAA;AAExC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,GAAG,IAAI,CAAA;AAExC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,EAAE,CAAA;AAEhC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,GAAG,IAAI,CAAA;AAE5C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,GAAG,IAAI,CAAA;AAEvC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAA;AAEpC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAErC,4DAA4D;AAC5D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;AAErG,+DAA+D;AAC/D,MAAM,iBAAiB,GAAG;IACxB,MAAM;IACN,MAAM;IACN,YAAY;IACZ,UAAU;IACV,OAAO;IACP,UAAU;IACV,aAAa;IACb,OAAO;CACR,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,QAAgB,EAAU,EAAE;IAC7D,MAAM,MAAM,GAAG,WAAW,CAAC,YAAY,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAA;IACrE,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;QACtC,CAAC,CAAC,MAAM;QACR,CAAC,CAAC,GAAG,MAAM,KAAK,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,sBAAsB,CAAA;AACzE,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAc,EAAU,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAA;AAEzG;;;;;GAKG;AACH,MAAM,oBAAoB,GAAG,CAAC,MAA8B,EAAU,EAAE,CACtE,kBAAkB,CAChB,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAC7G,CAAA;AAEH,+DAA+D;AAC/D,MAAM,EAAE,GAAG,CAAC,IAA2B,EAAU,EAAE,CACjD,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAA;AAE9E,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,CAAC,KAAc,EAAoC,EAAE,CACpE,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAEtE,mFAAmF;AACnF,MAAM,UAAU,GAAG,CAAC,IAAa,EAAE,KAAc,EAAW,EAAE;IAC5D,MAAM,OAAO,GAAuC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;IACnE,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,EAAG,CAAA;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,SAAQ;QACrB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAA;YAC5D,KAAK,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YACtF,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACnC,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAA;QAC/C,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAE,CAAA;YAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAE,CAAA;YAC1B,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAA;YAC/B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAuB;IAC9C,QAAQ,EAAE,cAAc;IACxB,QAAQ,EAAE,cAAc;IACxB,QAAQ,EAAE,cAAc;IACxB,cAAc,EAAE,kBAAkB;IAClC,WAAW,EAAE,eAAe;IAC5B,UAAU,EAAE,cAAc;CAC3B,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAuB;IAC9C,QAAQ,EAAE,mBAAmB;IAC7B,QAAQ,EAAE,mBAAmB;IAC7B,QAAQ,EAAE,cAAc;IACxB,cAAc,EAAE,kBAAkB;IAClC,WAAW,EAAE,eAAe;IAC5B,UAAU,EAAE,cAAc;CAC3B,CAAA;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,GAAG,CACd,KAAc,EACd,MAA+B,EAC/B,IAA2B,EACP,EAAE;IACtB,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,IAAI,CAAA;IAC5C,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAI,WAAsC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;QACrG,IAAI,CAAC,OAAO;YAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,mBAAmB,oBAAoB,CAAC,WAAqC,CAAC,GAAG,CAAA;IACnH,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC3B,IAAI,CAAC,CAAC,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,aAAa,GAAG,IAAI,KAAK,QAAQ;YACrC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,qBAAqB;YAChE,CAAC,CAAC,IAAI,KAAK,OAAO;gBAClB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB;gBACpE,CAAC,CAAC,IAAI,KAAK,SAAS;oBACpB,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,sBAAsB;oBACzE,CAAC,CAAC,IAAI,KAAK,QAAQ;wBACnB,mEAAmE;wBACnE,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB;wBACzE,CAAC,CAAC,IAAI,KAAK,QAAQ;4BACnB,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB;4BACzE,CAAC,CAAC,IAAI,KAAK,SAAS;gCACpB,CAAC,CAAC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,qBAAqB;gCAC3E,CAAC,CAAC,KAAK,KAAK,IAAI;oCAChB,CAAC,CAAC,SAAS;oCACX,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAA;QAC/B,IAAI,aAAa,KAAK,SAAS;YAAE,OAAO,aAAa,CAAA;IACvD,CAAC;IAED,0EAA0E;IAC1E,yEAAyE;IACzE,4CAA4C;IAC5C,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAA;QACnC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAa,CAAC,CAAC,CAAA;YAC5E,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,sCAAsC,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAA;YACjG,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,CAAA;QACvC,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC;oBAAE,SAAQ;gBACxC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,QAAmC,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAA;gBAC1F,IAAI,SAAS,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAA;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;QAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC/C,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,KAAgC,EAAE,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;gBAC9F,IAAI,SAAS,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAA;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,KAAc,EAAE,MAAe,EAAsB,EAAE;IAC3E,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IAC9D,IAAI,CAAC,cAAc,CAAC,EAAE;QAAE,OAAO,cAAc,CAAC,SAAS,CAAA;IACvD,MAAM,eAAe,GAAG,gBAAgB,CAAC,cAAc,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAA;IACrF,IAAI,eAAe,KAAK,SAAS;QAAE,OAAO,eAAe,CAAA;IACzD,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;IAC7D,IAAI,CAAC,cAAc,CAAC,EAAE;QAAE,OAAO,cAAc,CAAC,SAAS,CAAA;IACvD,OAAO,OAAO,CAAC,cAAc,CAAC,KAAK,EAAE,cAAc,CAAC,KAAgC,EAAE,EAAE,CAAC,CAAA;AAC3F,CAAC,CAAA;AAMD,kEAAkE;AAClE,MAAM,gBAAgB,GAAG,CACvB,MAAe,EACf,IAA2B,EAC3B,KAAa,EACb,MAAoB,EACA,EAAE;IACtB,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC;QAC3B,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,6CAA6C,cAAc,GAAG,CAAA;IAClF,CAAC;IACD,MAAM,CAAC,OAAO,EAAE,CAAA;IAChB,IAAI,MAAM,CAAC,OAAO,GAAG,cAAc,EAAE,CAAC;QACpC,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,kDAAkD,cAAc,GAAG,CAAA;IACvF,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,8DAA8D,CAAA;IACvG,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAA;IAC/F,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,8CAA8C,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAA;IACrG,CAAC;IACD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC7D,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,2CAA2C,CAAA;IAC/D,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,4BAA4B,CAAA;IAChD,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,mBAAmB,CAAA;QACpF,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAA;QACpE,IAAI,OAAO,KAAK,CAAC,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAmB,CAAA;QAC3F,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC/C,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,sCAAsC,CAAA;QAC3E,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,SAAS,EAAE,CAAC;QACjF,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,oBAAoB,CAAA;IACzD,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAClF,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,8CAA8C,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAA;IAC3F,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,CAAC,aAAa,EAAE,OAAO,CAAU,EAAE,CAAC;QACxD,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;YAC1E,OAAO,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC,mBAAmB,CAAA;QACrD,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,CAAA;IACvC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,+CAA+C,CAAA;QAC5F,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACzD,MAAM,SAAS,GAAG,gBAAgB,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;YAC/E,IAAI,SAAS,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAA;QAC/C,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;IAC7B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAA;AACzG,CAAC,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,MAAe,EACf,IAA2B,EACP,EAAE;IACtB,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;IACxD,OAAO,QAAQ,CAAC,EAAE;QAChB,CAAC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QAC3D,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAA;AACxB,CAAC,CAAA","sourcesContent":["/**\n * The bounded JSON Schema subset a human-task answer is checked against.\n *\n * `HumanTask` asks a person for a value and refuses one that does not fit the\n * question. The fit for a `json` question is decided here: a schema is kept\n * inside a deliberately small subset, an answer is checked against it under\n * the same size bounds every human-task value is admitted under, and every\n * rejection is rendered within one diagnostic budget. `HumanTask` re-exports\n * the limits and the two public entry points; this file is the mechanism.\n *\n * @since 1.0.0\n */\n\nimport * as BoundedJson from \"./BoundedJson.ts\"\n\n/**\n * The deepest supported JSON Schema path, counting the root as depth zero.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaDepth = 32\n\n/**\n * The most schema objects one human-task request may contain.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaNodes = 512\n\n/**\n * The most JSON values embedded across schema keywords such as `enum`.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaValueNodes = 10_000\n\n/**\n * The deepest JSON value embedded in a schema, including enum members.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaValueDepth = 64\n\n/**\n * The most JSON values one answer validation may visit.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerNodes = 10_000\n\n/**\n * The largest encoded JSON answer that can enter the durable store.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerBytes = 256 * 1024\n\n/**\n * The largest encoded JSON Schema carried by one question.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxSchemaBytes = 256 * 1024\n\n/**\n * The deepest admitted answer tree.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxAnswerDepth = 64\n\n/**\n * The largest encoded string value admitted in a request or answer.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonStringBytes = 128 * 1024\n\n/**\n * The largest encoded object key admitted in a request or answer.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonKeyBytes = 4 * 1024\n\n/**\n * The most members admitted in one JSON array or object.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxJsonMembers = 10_000\n\n/**\n * The most caller-supplied characters retained in one rendered diagnostic.\n *\n * @private\n * @since 1.0.0\n */\nexport const maxDiagnosticChars = 512\n\n/** The JSON Schema types the bounded subset understands. */\nconst supportedTypes = new Set([\"object\", \"array\", \"string\", \"number\", \"integer\", \"boolean\", \"null\"])\n\n/** The JSON Schema keywords the bounded subset understands. */\nconst supportedKeywords = [\n  \"type\",\n  \"enum\",\n  \"properties\",\n  \"required\",\n  \"items\",\n  \"nullable\",\n  \"description\",\n  \"title\"\n]\n\n/** Truncates a caller-supplied diagnostic while stating exactly what was dropped.\n * @private\n * @since 1.0.0\n */\nexport const truncateDiagnostic = (rendered: string): string => {\n  const prefix = BoundedJson.scalarPrefix(rendered, maxDiagnosticChars)\n  return prefix.length === rendered.length\n    ? prefix\n    : `${prefix} [${rendered.length - prefix.length} characters dropped]`\n}\n\n/** Renders one JSON value for a bounded rejection message.\n * @private\n * @since 1.0.0\n */\nexport const renderDiagnostic = (value: unknown): string => BoundedJson.render(value, maxDiagnosticChars)\n\n/**\n * Renders a value list in its comma-separated diagnostic shape.\n *\n * Every member renders to at least one character, so members past the\n * diagnostic budget can never survive truncation and are not rendered at all.\n */\nconst renderDiagnosticList = (values: ReadonlyArray<unknown>): string =>\n  truncateDiagnostic(\n    values.slice(0, maxDiagnosticChars).map((value) => BoundedJson.render(value, maxDiagnosticChars)).join(\", \")\n  )\n\n/** Renders a JSON pointer-ish path for a rejection message. */\nconst at = (path: ReadonlyArray<string>): string =>\n  path.length === 0 ? \"the answer\" : `\"${truncateDiagnostic(path.join(\".\"))}\"`\n\n/** Whether a value is a plain JSON object rather than an array or a null. */\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value)\n\n/** Compares two JSON values structurally without depending on object key order. */\nconst jsonEquals = (left: unknown, right: unknown): boolean => {\n  const pending: Array<readonly [unknown, unknown]> = [[left, right]]\n  while (pending.length > 0) {\n    const [a, b] = pending.pop()!\n    if (a === b) continue\n    if (Array.isArray(a)) {\n      if (!Array.isArray(b) || a.length !== b.length) return false\n      for (let index = a.length - 1; index >= 0; index--) pending.push([a[index], b[index]])\n      continue\n    }\n    if (!isObject(a) || !isObject(b)) return false\n    const aKeys = Object.keys(a).sort()\n    const bKeys = Object.keys(b).sort()\n    if (aKeys.length !== bKeys.length) return false\n    for (let index = aKeys.length - 1; index >= 0; index--) {\n      const aKey = aKeys[index]!\n      const bKey = bKeys[index]!\n      if (aKey !== bKey) return false\n      pending.push([a[aKey], b[bKey]])\n    }\n  }\n  return true\n}\n\n/** The bounds one answer is admitted under.\n * @private\n * @since 1.0.0\n */\nexport const answerLimits: BoundedJson.Limits = {\n  maxNodes: maxAnswerNodes,\n  maxDepth: maxAnswerDepth,\n  maxBytes: maxAnswerBytes,\n  maxStringBytes: maxJsonStringBytes,\n  maxKeyBytes: maxJsonKeyBytes,\n  maxMembers: maxJsonMembers\n}\n\n/** The bounds one schema is admitted under, enum members included.\n * @private\n * @since 1.0.0\n */\nexport const schemaLimits: BoundedJson.Limits = {\n  maxNodes: maxSchemaValueNodes,\n  maxDepth: maxSchemaValueDepth,\n  maxBytes: maxSchemaBytes,\n  maxStringBytes: maxJsonStringBytes,\n  maxKeyBytes: maxJsonKeyBytes,\n  maxMembers: maxJsonMembers\n}\n\n/**\n * Checks a value against the bounded JSON Schema subset, returning the first\n * reason it does not fit.\n *\n * The subset is `type` (`object`, `array`, `string`, `number`, `integer`,\n * `boolean`, `null`), `enum`, `properties`, `required`, `items`, and\n * `nullable`. It is deliberately small: a human-task schema exists to say what\n * shape an answer takes, and every keyword beyond these describes a constraint\n * a person cannot be usefully re-asked about. A schema that reaches outside it\n * is refused as `request_invalid` rather than silently ignored, because a\n * quietly dropped constraint reads as a validation that passed.\n *\n * Presence is `Object.hasOwn`, never the `in` operator. An answer is a decoded\n * JSON object, so every property it really has is its own; `in` also reports\n * `Object.prototype`'s members, which would accept a missing required\n * `toString` and check a `constructor` nobody answered against the schema for\n * one.\n *\n * @private\n */\nconst checkAt = (\n  value: unknown,\n  schema: Record<string, unknown>,\n  path: ReadonlyArray<string>\n): string | undefined => {\n  const nullable = schema[\"nullable\"] === true\n  const enumeration = schema[\"enum\"]\n  if (enumeration !== undefined) {\n    const matches = (enumeration as ReadonlyArray<unknown>).some((allowed) => jsonEquals(allowed, value))\n    if (!matches) return `${at(path)} must be one of ${renderDiagnosticList(enumeration as ReadonlyArray<unknown>)}.`\n  }\n  const type = schema[\"type\"]\n  if (!(nullable && value === null) && type !== undefined) {\n    const typeComplaint = type === \"object\"\n      ? isObject(value) ? undefined : `${at(path)} must be an object.`\n      : type === \"array\"\n      ? Array.isArray(value) ? undefined : `${at(path)} must be an array.`\n      : type === \"integer\"\n      ? Number.isInteger(value) ? undefined : `${at(path)} must be an integer.`\n      : type === \"number\"\n      // Bounded JSON admission already rejected every non-finite number.\n      ? typeof value === \"number\" ? undefined : `${at(path)} must be a number.`\n      : type === \"string\"\n      ? typeof value === \"string\" ? undefined : `${at(path)} must be a string.`\n      : type === \"boolean\"\n      ? typeof value === \"boolean\" ? undefined : `${at(path)} must be a boolean.`\n      : value === null\n      ? undefined\n      : `${at(path)} must be null.`\n    if (typeComplaint !== undefined) return typeComplaint\n  }\n\n  // Object and array keywords are independent constraints. JSON Schema does\n  // not require a sibling `type`; they apply whenever the instance has the\n  // relevant shape and are otherwise ignored.\n  if (isObject(value)) {\n    const required = schema[\"required\"]\n    if (Array.isArray(required)) {\n      const missing = required.find((key) => !Object.hasOwn(value, key as string))\n      if (missing !== undefined) {\n        return `${at(path)} is missing the required property \"${truncateDiagnostic(String(missing))}\".`\n      }\n    }\n    const properties = schema[\"properties\"]\n    if (isObject(properties)) {\n      for (const [key, property] of Object.entries(properties)) {\n        if (!Object.hasOwn(value, key)) continue\n        const rejection = checkAt(value[key], property as Record<string, unknown>, [...path, key])\n        if (rejection !== undefined) return rejection\n      }\n    }\n  }\n  if (Array.isArray(value)) {\n    const items = schema[\"items\"]\n    if (items !== undefined) {\n      for (const [index, element] of value.entries()) {\n        const rejection = checkAt(element, items as Record<string, unknown>, [...path, String(index)])\n        if (rejection !== undefined) return rejection\n      }\n    }\n  }\n  return undefined\n}\n\n/** Checks schema validity and snapshots both inputs before walking them together.\n * @private\n * @since 1.0.0\n */\nexport const check = (value: unknown, schema: unknown): string | undefined => {\n  const admittedSchema = BoundedJson.admit(schema, schemaLimits)\n  if (!admittedSchema.ok) return admittedSchema.complaint\n  const schemaComplaint = validateSchemaAt(admittedSchema.value, [], 0, { visited: 0 })\n  if (schemaComplaint !== undefined) return schemaComplaint\n  const admittedAnswer = BoundedJson.admit(value, answerLimits)\n  if (!admittedAnswer.ok) return admittedAnswer.complaint\n  return checkAt(admittedAnswer.value, admittedSchema.value as Record<string, unknown>, [])\n}\n\ninterface SchemaBudget {\n  visited: number\n}\n\n/** Walks one schema node under a shared depth and node budget. */\nconst validateSchemaAt = (\n  schema: unknown,\n  path: ReadonlyArray<string>,\n  depth: number,\n  budget: SchemaBudget\n): string | undefined => {\n  if (depth > maxSchemaDepth) {\n    return `${at(path)} exceeds the maximum JSON Schema depth of ${maxSchemaDepth}.`\n  }\n  budget.visited++\n  if (budget.visited > maxSchemaNodes) {\n    return `${at(path)} exceeds the maximum JSON Schema node count of ${maxSchemaNodes}.`\n  }\n  if (!isObject(schema)) return `${at(path)} is described by something that is not a JSON Schema object.`\n  const unsupported = Object.keys(schema).find((keyword) => !supportedKeywords.includes(keyword))\n  if (unsupported !== undefined) {\n    return `${at(path)} uses the unsupported JSON Schema keyword \"${truncateDiagnostic(unsupported)}\".`\n  }\n  const enumeration = schema[\"enum\"]\n  if (enumeration !== undefined && !Array.isArray(enumeration)) {\n    return `${at(path)} declares an \"enum\" that is not an array.`\n  }\n  if (Array.isArray(enumeration) && enumeration.length === 0) {\n    return `${at(path)} declares an empty \"enum\".`\n  }\n  if (Object.hasOwn(schema, \"required\")) {\n    const required = schema[\"required\"]\n    if (!Array.isArray(required)) return `${at([...path, \"required\"])} is not an array.`\n    const invalid = required.findIndex((key) => typeof key !== \"string\")\n    if (invalid !== -1) return `${at([...path, \"required\", String(invalid)])} is not a string.`\n    if (new Set(required).size !== required.length) {\n      return `${at([...path, \"required\"])} contains a duplicate property name.`\n    }\n  }\n  if (Object.hasOwn(schema, \"nullable\") && typeof schema[\"nullable\"] !== \"boolean\") {\n    return `${at([...path, \"nullable\"])} is not a boolean.`\n  }\n  const type = schema[\"type\"]\n  if (type !== undefined && (typeof type !== \"string\" || !supportedTypes.has(type))) {\n    return `${at(path)} declares the unsupported JSON Schema type ${renderDiagnostic(type)}.`\n  }\n  for (const keyword of [\"description\", \"title\"] as const) {\n    if (Object.hasOwn(schema, keyword) && typeof schema[keyword] !== \"string\") {\n      return `${at([...path, keyword])} is not a string.`\n    }\n  }\n  const properties = schema[\"properties\"]\n  if (properties !== undefined) {\n    if (!isObject(properties)) return `${at(path)} declares \"properties\" that is not an object.`\n    for (const [key, property] of Object.entries(properties)) {\n      const complaint = validateSchemaAt(property, [...path, key], depth + 1, budget)\n      if (complaint !== undefined) return complaint\n    }\n  }\n  const items = schema[\"items\"]\n  return items === undefined ? undefined : validateSchemaAt(items, [...path, \"items\"], depth + 1, budget)\n}\n\n/**\n * Checks that a JSON Schema stays inside the bounded subset, at every depth.\n *\n * Returns the first reason the schema is out of bounds, or `undefined` when the\n * whole tree is inside it.\n *\n * @private\n * @since 1.0.0\n */\nexport const validateSchema = (\n  schema: unknown,\n  path: ReadonlyArray<string>\n): string | undefined => {\n  const admitted = BoundedJson.admit(schema, schemaLimits)\n  return admitted.ok\n    ? validateSchemaAt(admitted.value, path, 0, { visited: 0 })\n    : admitted.complaint\n}\n"]}

package/dist/esm/internal/OutcomeMarker.d.ts

@@ -0,0 +1,18 @@
+/**
+ * The two markers that let `Flow.isOutcome` tell an authored `done`/`to`/`park`
+ * from ordinary data. `Flow/Outcome.ts` stamps the node marker, `Graph.build`
+ * and the interpreter stamp the value marker, and `isOutcome` reads it.
+ *
+ * @since 0.1.0
+ */
+/** Stamped on the AST of a node built by `done`/`to`/`park`.
+ * @private
+ * @since 0.1.0
+ */
+export declare const OutcomeNodeTypeId: unique symbol;
+/** Stamped on a resolved outcome value.
+ * @private
+ * @since 0.1.0
+ */
+export declare const OutcomeValueTypeId: unique symbol;
+//# sourceMappingURL=OutcomeMarker.d.ts.map

package/dist/esm/internal/OutcomeMarker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OutcomeMarker.d.ts","sourceRoot":"","sources":["../../../src/internal/OutcomeMarker.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,eAAO,MAAM,iBAAiB,EAAE,OAAO,MAAoD,CAAA;AAE3F;;;GAGG;AACH,eAAO,MAAM,kBAAkB,EAAE,OAAO,MAAqD,CAAA"}

package/dist/esm/internal/OutcomeMarker.js

@@ -0,0 +1,18 @@
+/**
+ * The two markers that let `Flow.isOutcome` tell an authored `done`/`to`/`park`
+ * from ordinary data. `Flow/Outcome.ts` stamps the node marker, `Graph.build`
+ * and the interpreter stamp the value marker, and `isOutcome` reads it.
+ *
+ * @since 0.1.0
+ */
+/** Stamped on the AST of a node built by `done`/`to`/`park`.
+ * @private
+ * @since 0.1.0
+ */
+export const OutcomeNodeTypeId = Symbol.for("@smthrs/flow/Flow/OutcomeNode");
+/** Stamped on a resolved outcome value.
+ * @private
+ * @since 0.1.0
+ */
+export const OutcomeValueTypeId = Symbol.for("@smthrs/flow/Flow/OutcomeValue");
+//# sourceMappingURL=OutcomeMarker.js.map

package/dist/esm/internal/OutcomeMarker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OutcomeMarker.js","sourceRoot":"","sources":["../../../src/internal/OutcomeMarker.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAkB,MAAM,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAA;AAE3F;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAkB,MAAM,CAAC,GAAG,CAAC,gCAAgC,CAAC,CAAA","sourcesContent":["/**\n * The two markers that let `Flow.isOutcome` tell an authored `done`/`to`/`park`\n * from ordinary data. `Flow/Outcome.ts` stamps the node marker, `Graph.build`\n * and the interpreter stamp the value marker, and `isOutcome` reads it.\n *\n * @since 0.1.0\n */\n\n/** Stamped on the AST of a node built by `done`/`to`/`park`.\n * @private\n * @since 0.1.0\n */\nexport const OutcomeNodeTypeId: unique symbol = Symbol.for(\"@smthrs/flow/Flow/OutcomeNode\")\n\n/** Stamped on a resolved outcome value.\n * @private\n * @since 0.1.0\n */\nexport const OutcomeValueTypeId: unique symbol = Symbol.for(\"@smthrs/flow/Flow/OutcomeValue\")\n"]}