@json-schema-engine/core 0.0.1

package/dist/records.d.ts

@@ -0,0 +1,71 @@
+import { AnnotationRecord, ErrorRecord, KeywordTrace, PathNode, TraceNode } from "./engine.js";
+import { type AnnotationSelection, type AnnotationUnit, type ErrorUnit, type RenderInput, type RenderNode } from "./output.js";
+/** The two fields of a schema reference that locate it; `node` is not needed. */
+export interface LocationRef {
+    baseUri: string;
+    pointer: string;
+}
+/** Canonical schema location of a schema object, or of one of its keywords. */
+export declare const schemaLocationOf: (ref: LocationRef, keywordName: string | null) => string;
+/** Renders one error record into its native unit. */
+export declare function renderError(record: ErrorRecord, includeParams?: boolean): ErrorUnit;
+/** Renders one annotation record into its native unit. */
+export declare function renderAnnotation(record: AnnotationRecord): AnnotationUnit;
+/**
+ * Selects and renders annotation records in one pass: each candidate is
+ * rendered once and `keep` sees that unit. The survivors' records stay
+ * positionally paired with their units so {@link toRenderInput} can index
+ * them.
+ */
+export declare function renderSelected(records: readonly AnnotationRecord[], selection: boolean | AnnotationSelection): {
+    records: AnnotationRecord[];
+    units: AnnotationUnit[];
+};
+/** The record arrays the flat surface was rendered from, positionally paired with {@link UnitSets}. */
+export interface RecordSets {
+    errors: readonly ErrorRecord[];
+    droppedErrors: readonly ErrorRecord[];
+    annotations: readonly AnnotationRecord[];
+    droppedAnnotations: readonly AnnotationRecord[];
+}
+/** The flat surface's unit arrays, positionally paired with {@link RecordSets}. */
+export interface UnitSets {
+    errors: readonly ErrorUnit[];
+    droppedErrors: readonly ErrorUnit[];
+    annotations: readonly AnnotationUnit[];
+    droppedAnnotations: readonly AnnotationUnit[];
+}
+/**
+ * Adapts the interpreter's trace into the located tree, materializing every
+ * location once per application; the index lists point into the unit
+ * arrays paired with `records`.
+ */
+export declare function toRenderNode(root: TraceNode, records: RecordSets): RenderNode;
+/**
+ * A {@link RenderNode} still being filled by its producer: the index lists
+ * grow as records are attributed, `valid` is settled when the application
+ * ends. Assignable to `RenderNode` once complete.
+ */
+export interface MutableRenderNode extends RenderNode {
+    valid: boolean;
+    keywords: KeywordTrace[];
+    errors: number[];
+    droppedErrors: number[];
+    annotations: number[];
+    droppedAnnotations: number[];
+    children: MutableRenderNode[];
+}
+/**
+ * Converts a traced fragment into producer-side nodes. The evaluation path
+ * comes from the fragment's path chain (a compiled caller seeds it with its
+ * own prefix), the input location gets the caller's prefix, and `at` maps
+ * each path node to the nodes sharing it so the caller can attribute the
+ * fragment's records to their owners the way the interpreter's adapter does.
+ */
+export declare function traceToRenderNodes(root: TraceNode, inputPrefix: string): {
+    root: MutableRenderNode;
+    at: Map<PathNode | null, MutableRenderNode[]>;
+};
+/** The located tree with its paired unit arrays: the renderers' input. */
+export declare function toRenderInput(root: TraceNode, records: RecordSets, units: UnitSets): RenderInput;
+//# sourceMappingURL=records.d.ts.map

package/dist/records.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"records.d.ts","sourceRoot":"","sources":["../src/records.ts"],"names":[],"mappings":"AAQA,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,YAAY,EACZ,QAAQ,EACR,SAAS,EAEV,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,KAAK,mBAAmB,EACxB,KAAK,cAAc,EACnB,KAAK,SAAS,EACd,KAAK,WAAW,EAChB,KAAK,UAAU,EAGhB,MAAM,aAAa,CAAC;AAErB,iFAAiF;AACjF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAUD,+EAA+E;AAC/E,eAAO,MAAM,gBAAgB,GAC3B,KAAK,WAAW,EAChB,aAAa,MAAM,GAAG,IAAI,KACzB,MAAsE,CAAC;AAE1E,qDAAqD;AACrD,wBAAgB,WAAW,CACzB,MAAM,EAAE,WAAW,EACnB,aAAa,UAAQ,GACpB,SAAS,CAaX;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,GAAG,cAAc,CAWzE;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,SAAS,gBAAgB,EAAE,EACpC,SAAS,EAAE,OAAO,GAAG,mBAAmB,GACvC;IAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAAC,KAAK,EAAE,cAAc,EAAE,CAAA;CAAE,CAe1D;AAED,uGAAuG;AACvG,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IAC/B,aAAa,EAAE,SAAS,WAAW,EAAE,CAAC;IACtC,WAAW,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACzC,kBAAkB,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACjD;AAED,mFAAmF;AACnF,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,SAAS,SAAS,EAAE,CAAC;IAC7B,aAAa,EAAE,SAAS,SAAS,EAAE,CAAC;IACpC,WAAW,EAAE,SAAS,cAAc,EAAE,CAAC;IACvC,kBAAkB,EAAE,SAAS,cAAc,EAAE,CAAC;CAC/C;AAmBD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,GAAG,UAAU,CAkB7E;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAkB,SAAQ,UAAU;IACnD,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;CAC/B;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,MAAM,GAClB;IAAE,IAAI,EAAE,iBAAiB,CAAC;IAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,GAAG,IAAI,EAAE,iBAAiB,EAAE,CAAC,CAAA;CAAE,CAsB5E;AAED,0EAA0E;AAC1E,wBAAgB,aAAa,CAC3B,IAAI,EAAE,SAAS,EACf,OAAO,EAAE,UAAU,EACnB,KAAK,EAAE,QAAQ,GACd,WAAW,CAQb"}

package/dist/records.js

@@ -0,0 +1,150 @@
+// Interpreter-side rendering: the engine's evaluation records (path-node
+// chains, schema refs, cursors) become the string-located units of the flat
+// surface here, and its trace becomes the located tree the document
+// renderers in output.ts consume — so those renderers stay free of engine
+// internals and serve any producer of a RenderInput.
+import { escapeSegment } from "./json.js";
+import { instancePointer } from "./cursor.js";
+import { materializePath, } from "./engine.js";
+import { NO_INDEXES, makeRecordPredicate, } from "./output.js";
+const keywordSuffix = (name) => name === null ? "" : "/" + escapeSegment(name);
+const evaluationPathOf = (pathNode, keywordName) => materializePath(pathNode) + keywordSuffix(keywordName);
+/** Canonical schema location of a schema object, or of one of its keywords. */
+export const schemaLocationOf = (ref, keywordName) => `${ref.baseUri}#${ref.pointer}${keywordSuffix(keywordName)}`;
+/** Renders one error record into its native unit. */
+export function renderError(record, includeParams = false) {
+    const unit = {
+        evaluationPath: evaluationPathOf(record.pathNode, record.keywordName),
+        schemaLocation: schemaLocationOf(record.schemaRef, record.keywordName),
+        inputLocation: instancePointer(record.cursor),
+        error: record.message,
+    };
+    if (includeParams) {
+        if (record.keywordName !== null)
+            unit.keyword = record.keywordName;
+        if (record.vocabularyUri !== null)
+            unit.vocabulary = record.vocabularyUri;
+        unit.params = record.params ?? {};
+    }
+    return unit;
+}
+/** Renders one annotation record into its native unit. */
+export function renderAnnotation(record) {
+    return {
+        keyword: record.keywordName,
+        ...(record.vocabularyUri === null
+            ? {}
+            : { vocabulary: record.vocabularyUri }),
+        evaluationPath: evaluationPathOf(record.pathNode, record.keywordName),
+        schemaLocation: schemaLocationOf(record.schemaRef, record.keywordName),
+        inputLocation: instancePointer(record.cursor),
+        annotation: record.value,
+    };
+}
+/**
+ * Selects and renders annotation records in one pass: each candidate is
+ * rendered once and `keep` sees that unit. The survivors' records stay
+ * positionally paired with their units so {@link toRenderInput} can index
+ * them.
+ */
+export function renderSelected(records, selection) {
+    const byLists = makeRecordPredicate(selection);
+    const keep = typeof selection === "object" ? selection.keep : undefined;
+    const kept = [];
+    const units = [];
+    for (const record of records) {
+        if (!byLists(record.behaviorId, record.keywordName, record.vocabularyUri)) {
+            continue;
+        }
+        const unit = renderAnnotation(record);
+        if (keep !== undefined && !keep(unit))
+            continue;
+        kept.push(record);
+        units.push(unit);
+    }
+    return { records: kept, units };
+}
+// Records attach to applications by path-node identity: every application
+// mints its own PathNode, so identity is finer than the evaluation-path
+// string (repeated applications of one keyword share the string). A custom
+// keyword applying with no segment of its own shares its parent's node and
+// therefore its parent's record group.
+function indexByPath(records) {
+    const at = new Map();
+    records.forEach((r, i) => {
+        const list = at.get(r.pathNode);
+        if (list)
+            list.push(i);
+        else
+            at.set(r.pathNode, [i]);
+    });
+    return at;
+}
+/**
+ * Adapts the interpreter's trace into the located tree, materializing every
+ * location once per application; the index lists point into the unit
+ * arrays paired with `records`.
+ */
+export function toRenderNode(root, records) {
+    const errorsAt = indexByPath(records.errors);
+    const droppedErrorsAt = indexByPath(records.droppedErrors);
+    const annotationsAt = indexByPath(records.annotations);
+    const droppedAnnotationsAt = indexByPath(records.droppedAnnotations);
+    const toNode = (node) => ({
+        evaluationPath: materializePath(node.pathNode),
+        schemaLocation: schemaLocationOf(node.schemaRef, null),
+        inputLocation: instancePointer(node.cursor),
+        valid: node.valid,
+        keywords: node.keywords,
+        errors: errorsAt.get(node.pathNode) ?? NO_INDEXES,
+        droppedErrors: droppedErrorsAt.get(node.pathNode) ?? NO_INDEXES,
+        annotations: annotationsAt.get(node.pathNode) ?? NO_INDEXES,
+        droppedAnnotations: droppedAnnotationsAt.get(node.pathNode) ?? NO_INDEXES,
+        children: node.children.map(toNode),
+    });
+    return toNode(root);
+}
+/**
+ * Converts a traced fragment into producer-side nodes. The evaluation path
+ * comes from the fragment's path chain (a compiled caller seeds it with its
+ * own prefix), the input location gets the caller's prefix, and `at` maps
+ * each path node to the nodes sharing it so the caller can attribute the
+ * fragment's records to their owners the way the interpreter's adapter does.
+ */
+export function traceToRenderNodes(root, inputPrefix) {
+    const at = new Map();
+    const toNode = (node) => {
+        const out = {
+            evaluationPath: materializePath(node.pathNode),
+            schemaLocation: schemaLocationOf(node.schemaRef, null),
+            inputLocation: inputPrefix + instancePointer(node.cursor),
+            valid: node.valid,
+            keywords: node.keywords,
+            errors: [],
+            droppedErrors: [],
+            annotations: [],
+            droppedAnnotations: [],
+            children: [],
+        };
+        const sharing = at.get(node.pathNode);
+        if (sharing)
+            sharing.push(out);
+        else
+            at.set(node.pathNode, [out]);
+        for (const child of node.children)
+            out.children.push(toNode(child));
+        return out;
+    };
+    return { root: toNode(root), at };
+}
+/** The located tree with its paired unit arrays: the renderers' input. */
+export function toRenderInput(root, records, units) {
+    return {
+        errors: units.errors,
+        droppedErrors: units.droppedErrors,
+        annotations: units.annotations,
+        droppedAnnotations: units.droppedAnnotations,
+        root: toRenderNode(root, records),
+    };
+}
+//# sourceMappingURL=records.js.map

package/dist/records.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"records.js","sourceRoot":"","sources":["../src/records.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,4EAA4E;AAC5E,oEAAoE;AACpE,0EAA0E;AAC1E,qDAAqD;AAErD,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAML,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,OAAO,EAML,UAAU,EACV,mBAAmB,GACpB,MAAM,aAAa,CAAC;AAQrB,MAAM,aAAa,GAAG,CAAC,IAAmB,EAAU,EAAE,CACpD,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;AAEjD,MAAM,gBAAgB,GAAG,CACvB,QAAyB,EACzB,WAA0B,EAClB,EAAE,CAAC,eAAe,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;AAEpE,+EAA+E;AAC/E,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,GAAgB,EAChB,WAA0B,EAClB,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,OAAO,GAAG,aAAa,CAAC,WAAW,CAAC,EAAE,CAAC;AAE1E,qDAAqD;AACrD,MAAM,UAAU,WAAW,CACzB,MAAmB,EACnB,aAAa,GAAG,KAAK;IAErB,MAAM,IAAI,GAAc;QACtB,cAAc,EAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC;QACrE,cAAc,EAAE,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,WAAW,CAAC;QACtE,aAAa,EAAE,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7C,KAAK,EAAE,MAAM,CAAC,OAAO;KACtB,CAAC;IACF,IAAI,aAAa,EAAE,CAAC;QAClB,IAAI,MAAM,CAAC,WAAW,KAAK,IAAI;YAAE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC;QACnE,IAAI,MAAM,CAAC,aAAa,KAAK,IAAI;YAAE,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC;QAC1E,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;IACpC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,gBAAgB,CAAC,MAAwB;IACvD,OAAO;QACL,OAAO,EAAE,MAAM,CAAC,WAAW;QAC3B,GAAG,CAAC,MAAM,CAAC,aAAa,KAAK,IAAI;YAC/B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,aAAa,EAAE,CAAC;QACzC,cAAc,EAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC;QACrE,cAAc,EAAE,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,WAAW,CAAC;QACtE,aAAa,EAAE,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7C,UAAU,EAAE,MAAM,CAAC,KAAK;KACzB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAoC,EACpC,SAAwC;IAExC,MAAM,OAAO,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACxE,MAAM,IAAI,GAAuB,EAAE,CAAC;IACpC,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;YAC1E,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAChD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAClC,CAAC;AAkBD,0EAA0E;AAC1E,wEAAwE;AACxE,2EAA2E;AAC3E,2EAA2E;AAC3E,uCAAuC;AACvC,SAAS,WAAW,CAClB,OAAiD;IAEjD,MAAM,EAAE,GAAG,IAAI,GAAG,EAA6B,CAAC;IAChD,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAClB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAe,EAAE,OAAmB;IAC/D,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAC3D,MAAM,aAAa,GAAG,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACvD,MAAM,oBAAoB,GAAG,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,CAAC,IAAe,EAAc,EAAE,CAAC,CAAC;QAC/C,cAAc,EAAE,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC9C,cAAc,EAAE,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC;QACtD,aAAa,EAAE,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3C,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU;QACjD,aAAa,EAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU;QAC/D,WAAW,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU;QAC3D,kBAAkB,EAAE,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU;QACzE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;KACpC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;AACtB,CAAC;AAiBD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAe,EACf,WAAmB;IAEnB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAwC,CAAC;IAC3D,MAAM,MAAM,GAAG,CAAC,IAAe,EAAqB,EAAE;QACpD,MAAM,GAAG,GAAsB;YAC7B,cAAc,EAAE,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC9C,cAAc,EAAE,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC;YACtD,aAAa,EAAE,WAAW,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;YACzD,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,EAAE;YACV,aAAa,EAAE,EAAE;YACjB,WAAW,EAAE,EAAE;YACf,kBAAkB,EAAE,EAAE;YACtB,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,MAAM,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,OAAO;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAC1B,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACpE,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC;AACpC,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,aAAa,CAC3B,IAAe,EACf,OAAmB,EACnB,KAAe;IAEf,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;QAC5C,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC;KAClC,CAAC;AACJ,CAAC"}

package/dist/ref.d.ts

@@ -0,0 +1,10 @@
+import { JsonValue } from "./json.js";
+/** A schema node plus its canonical location. */
+export interface SchemaRef {
+    node: JsonValue;
+    /** Canonical base URI, no fragment. */
+    baseUri: string;
+    /** JSON Pointer from the base's root schema. */
+    pointer: string;
+}
+//# sourceMappingURL=ref.d.ts.map

package/dist/ref.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ref.d.ts","sourceRoot":"","sources":["../src/ref.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,iDAAiD;AACjD,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,SAAS,CAAC;IAChB,uCAAuC;IACvC,OAAO,EAAE,MAAM,CAAC;IAChB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CACjB"}

package/dist/ref.js

@@ -0,0 +1,5 @@
+// A schema position: the node plus its canonical location (lexical base URI
+// and JSON Pointer from that base's root schema). Kept dependency-free; both
+// the dialect layer and the registry build on it.
+export {};
+//# sourceMappingURL=ref.js.map

package/dist/ref.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ref.js","sourceRoot":"","sources":["../src/ref.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,6EAA6E;AAC7E,kDAAkD"}

package/dist/regex.d.ts

@@ -0,0 +1,45 @@
+/** A compiled pattern: only membership testing is needed. */
+export interface CompiledRegex {
+    test(input: string): boolean;
+}
+/** Compiles a JSON Schema `pattern` string into a {@link CompiledRegex}. */
+export interface RegexEngine {
+    compile(pattern: string): CompiledRegex;
+}
+/**
+ * The built-in engine: ECMA-262 semantics via the native `RegExp` (unicode
+ * mode where valid). Fast, but subject to catastrophic backtracking on
+ * adversarial patterns — see {@link RegexEngine} for the linear-time opt-out.
+ */
+export declare const defaultRegexEngine: RegexEngine;
+/**
+ * Compiles patterns through a {@link RegexEngine}, caching by pattern string.
+ * One cache lives per {@link Engine}, so a pattern that appears in many
+ * schemas — or is tested against many instances — compiles once even when the
+ * engine's own compilation is expensive.
+ */
+export declare class RegexCache {
+    private engine;
+    private cache;
+    constructor(engine?: RegexEngine);
+    compile(pattern: string): CompiledRegex;
+}
+/** A pattern was rejected by {@link EngineOptions.rejectUnsafeRegex}. */
+export declare class UnsafeRegexError extends Error {
+}
+/**
+ * Flags regular expressions whose structure admits exponential-time
+ * backtracking (ReDoS). The test is star height: a repetition applied to a
+ * subexpression that itself contains an unbounded repetition — `(a+)+`,
+ * `(a*)*`, `(.*)+` — is the classic exponential shape.
+ *
+ * This is a conservative heuristic, not a proof. It targets nested unbounded
+ * quantifiers; it does not catch every dangerous pattern (e.g. overlapping
+ * alternation such as `(a|a)*`), and a linear-time engine remains the only
+ * hard guarantee. Safe by default when the pattern cannot be parsed.
+ */
+export declare function detectUnsafeRegex(pattern: string): {
+    safe: boolean;
+    reason?: string;
+};
+//# sourceMappingURL=regex.d.ts.map

package/dist/regex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.d.ts","sourceRoot":"","sources":["../src/regex.ts"],"names":[],"mappings":"AAaA,6DAA6D;AAC7D,MAAM,WAAW,aAAa;IAC5B,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;CAC9B;AAED,4EAA4E;AAC5E,MAAM,WAAW,WAAW;IAC1B,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,CAAC;CACzC;AAED;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,EAAE,WAEhC,CAAC;AAEF;;;;;GAKG;AACH,qBAAa,UAAU;IAGT,OAAO,CAAC,MAAM;IAF1B,OAAO,CAAC,KAAK,CAAoC;gBAE7B,MAAM,GAAE,WAAgC;IAE5D,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa;CAQxC;AAED,yEAAyE;AACzE,qBAAa,gBAAiB,SAAQ,KAAK;CAAG;AAE9C;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG;IAClD,IAAI,EAAE,OAAO,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAoGA"}

package/dist/regex.js

@@ -0,0 +1,163 @@
+// Regular-expression handling for `pattern`/`patternProperties`: a pluggable
+// compile hook, a per-engine compiled-pattern cache, and a conservative
+// static detector for exponential-backtracking (ReDoS) shapes.
+//
+// `pattern`/`patternProperties` compile untrusted regex from the schema and
+// run it against untrusted instance strings. The native RegExp engine is
+// vulnerable to catastrophic backtracking; callers who evaluate untrusted
+// schemas can inject a linear-time engine (e.g. RE2) through `regexEngine`,
+// and/or reject unsafe patterns at registration with `rejectUnsafeRegex`
+// (backed by {@link detectUnsafeRegex}). See docs/guide/security.md.
+import { schemaRegExp } from "./json.js";
+/**
+ * The built-in engine: ECMA-262 semantics via the native `RegExp` (unicode
+ * mode where valid). Fast, but subject to catastrophic backtracking on
+ * adversarial patterns — see {@link RegexEngine} for the linear-time opt-out.
+ */
+export const defaultRegexEngine = {
+    compile: (pattern) => schemaRegExp(pattern),
+};
+/**
+ * Compiles patterns through a {@link RegexEngine}, caching by pattern string.
+ * One cache lives per {@link Engine}, so a pattern that appears in many
+ * schemas — or is tested against many instances — compiles once even when the
+ * engine's own compilation is expensive.
+ */
+export class RegexCache {
+    engine;
+    cache = new Map();
+    constructor(engine = defaultRegexEngine) {
+        this.engine = engine;
+    }
+    compile(pattern) {
+        let compiled = this.cache.get(pattern);
+        if (compiled === undefined) {
+            compiled = this.engine.compile(pattern);
+            this.cache.set(pattern, compiled);
+        }
+        return compiled;
+    }
+}
+/** A pattern was rejected by {@link EngineOptions.rejectUnsafeRegex}. */
+export class UnsafeRegexError extends Error {
+}
+/**
+ * Flags regular expressions whose structure admits exponential-time
+ * backtracking (ReDoS). The test is star height: a repetition applied to a
+ * subexpression that itself contains an unbounded repetition — `(a+)+`,
+ * `(a*)*`, `(.*)+` — is the classic exponential shape.
+ *
+ * This is a conservative heuristic, not a proof. It targets nested unbounded
+ * quantifiers; it does not catch every dangerous pattern (e.g. overlapping
+ * alternation such as `(a|a)*`), and a linear-time engine remains the only
+ * hard guarantee. Safe by default when the pattern cannot be parsed.
+ */
+export function detectUnsafeRegex(pattern) {
+    let i = 0;
+    // Parses a sequence (alternation of concatenations) up to a closing `)` or
+    // end of input, returning its star height.
+    const parseSeq = () => {
+        let maxHeight = 0;
+        while (i < pattern.length) {
+            const c = pattern[i];
+            if (c === "|") {
+                i++;
+                continue;
+            }
+            if (c === ")")
+                break;
+            let atomHeight = 0;
+            if (c === "\\") {
+                i += 2; // escaped atom
+            }
+            else if (c === "[") {
+                skipCharClass();
+            }
+            else if (c === "(") {
+                i++;
+                skipGroupPrefix();
+                atomHeight = parseSeq();
+                if (pattern[i] === ")")
+                    i++;
+            }
+            else {
+                i++; // literal
+            }
+            const height = atomHeight + (consumeQuantifier() ? 1 : 0);
+            if (height > maxHeight)
+                maxHeight = height;
+        }
+        return maxHeight;
+    };
+    // Consumes a trailing quantifier if present; returns whether it was
+    // unbounded (`*`, `+`, `{n,}`). Bounded quantifiers (`?`, `{n}`, `{n,m}`)
+    // do not raise star height.
+    const consumeQuantifier = () => {
+        let unbounded = false;
+        const q = pattern[i];
+        if (q === "*" || q === "+") {
+            unbounded = true;
+            i++;
+        }
+        else if (q === "?") {
+            i++;
+        }
+        else if (q === "{") {
+            const close = pattern.indexOf("}", i);
+            if (close !== -1) {
+                const body = pattern.slice(i + 1, close);
+                i = close + 1;
+                unbounded = /^\s*\d+\s*,\s*$/.test(body);
+            }
+        }
+        // Lazy/possessive suffix does not change star height.
+        if (pattern[i] === "?" || pattern[i] === "+")
+            i++;
+        return unbounded;
+    };
+    const skipCharClass = () => {
+        i++; // opening [
+        if (pattern[i] === "^")
+            i++;
+        if (pattern[i] === "]")
+            i++; // a leading ] is literal
+        while (i < pattern.length && pattern[i] !== "]") {
+            if (pattern[i] === "\\")
+                i++;
+            i++;
+        }
+        i++; // closing ]
+    };
+    // Skips `(?:`, `(?=`, `(?!`, `(?<=`, `(?<!`, `(?<name>` prefixes.
+    const skipGroupPrefix = () => {
+        if (pattern[i] !== "?")
+            return;
+        i++;
+        if (pattern[i] === "<" &&
+            pattern[i + 1] !== "=" &&
+            pattern[i + 1] !== "!") {
+            const close = pattern.indexOf(">", i);
+            if (close !== -1)
+                i = close + 1;
+            return;
+        }
+        // ?:, ?=, ?!, ?<=, ?<!
+        i++;
+        if (pattern[i] === "=" || pattern[i] === "!")
+            i++;
+    };
+    let height;
+    try {
+        height = parseSeq();
+    }
+    catch {
+        return { safe: true };
+    }
+    return height >= 2
+        ? {
+            safe: false,
+            reason: `nested unbounded quantifier (star height ${height})`,
+        }
+        : { safe: true };
+}
+//# sourceMappingURL=regex.js.map

package/dist/regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"regex.js","sourceRoot":"","sources":["../src/regex.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,wEAAwE;AACxE,+DAA+D;AAC/D,EAAE;AACF,4EAA4E;AAC5E,yEAAyE;AACzE,0EAA0E;AAC1E,4EAA4E;AAC5E,yEAAyE;AACzE,qEAAqE;AAErE,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAYzC;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAgB;IAC7C,OAAO,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC;CAC5C,CAAC;AAEF;;;;;GAKG;AACH,MAAM,OAAO,UAAU;IAGD;IAFZ,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEjD,YAAoB,SAAsB,kBAAkB;QAAxC,WAAM,GAAN,MAAM,CAAkC;IAAG,CAAC;IAEhE,OAAO,CAAC,OAAe;QACrB,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAED,yEAAyE;AACzE,MAAM,OAAO,gBAAiB,SAAQ,KAAK;CAAG;AAE9C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAe;IAI/C,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,2EAA2E;IAC3E,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,GAAW,EAAE;QAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACd,CAAC,EAAE,CAAC;gBACJ,SAAS;YACX,CAAC;YACD,IAAI,CAAC,KAAK,GAAG;gBAAE,MAAM;YAErB,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe;YACzB,CAAC;iBAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACrB,aAAa,EAAE,CAAC;YAClB,CAAC;iBAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACrB,CAAC,EAAE,CAAC;gBACJ,eAAe,EAAE,CAAC;gBAClB,UAAU,GAAG,QAAQ,EAAE,CAAC;gBACxB,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;oBAAE,CAAC,EAAE,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,CAAC,EAAE,CAAC,CAAC,UAAU;YACjB,CAAC;YAED,MAAM,MAAM,GAAG,UAAU,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,GAAG,SAAS;gBAAE,SAAS,GAAG,MAAM,CAAC;QAC7C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,oEAAoE;IACpE,0EAA0E;IAC1E,4BAA4B;IAC5B,MAAM,iBAAiB,GAAG,GAAY,EAAE;QACtC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,SAAS,GAAG,IAAI,CAAC;YACjB,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACrB,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;gBACjB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;gBACzC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;gBACd,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,sDAAsD;QACtD,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,CAAC,EAAE,CAAC;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,GAAS,EAAE;QAC/B,CAAC,EAAE,CAAC,CAAC,YAAY;QACjB,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,CAAC,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,CAAC,EAAE,CAAC,CAAC,yBAAyB;QACtD,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAChD,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,CAAC,EAAE,CAAC;YAC7B,CAAC,EAAE,CAAC;QACN,CAAC;QACD,CAAC,EAAE,CAAC,CAAC,YAAY;IACnB,CAAC,CAAC;IAEF,kEAAkE;IAClE,MAAM,eAAe,GAAG,GAAS,EAAE;QACjC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO;QAC/B,CAAC,EAAE,CAAC;QACJ,IACE,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAClB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;YACtB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EACtB,CAAC;YACD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QACD,uBAAuB;QACvB,CAAC,EAAE,CAAC;QACJ,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,CAAC,EAAE,CAAC;IACpD,CAAC,CAAC;IAEF,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,QAAQ,EAAE,CAAC;IACtB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC;IACD,OAAO,MAAM,IAAI,CAAC;QAChB,CAAC,CAAC;YACE,IAAI,EAAE,KAAK;YACX,MAAM,EAAE,4CAA4C,MAAM,GAAG;SAC9D;QACH,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACrB,CAAC"}

package/dist/registry.d.ts

@@ -0,0 +1,141 @@
+import { JsonValue } from "./json.js";
+import { SchemaRef } from "./ref.js";
+import { Dialect, DialectRegistry } from "./dialect.js";
+import { SourceRange } from "./loader.js";
+/**
+ * Where a schema resource physically lives: the registered document
+ * containing it and the JSON Pointer from that document's root to the
+ * resource's root (D17 bridge; see loader.ts).
+ */
+export interface DocumentLocation {
+    documentUri: string;
+    pointer: string;
+}
+/**
+ * A value that is not a schema (neither an object nor a boolean) was found
+ * where a schema is required (D19): in a keyword-claimed schema position at
+ * registration, or applied as a schema during evaluation. Keyword-value
+ * validity beyond schema shape is not checked here — that is metaschema
+ * validation's job ({@link EngineOptions.validateSchemas}).
+ *
+ * When thrown during registration, the document may be partially indexed;
+ * re-register a corrected document under the same URI, or discard the
+ * engine.
+ */
+export declare class InvalidSchemaError extends Error {
+}
+/**
+ * Schema nesting (at registration) or schema-application nesting (at
+ * evaluation) exceeded {@link EngineOptions.maxDepth}. A bounded, catchable
+ * failure that replaces the native stack overflow deep input would otherwise
+ * cause; the engine remains usable afterward (each evaluation runs in fresh
+ * state). Raise `maxDepth` for legitimately deep documents, within what the
+ * runtime's own stack allows.
+ */
+export declare class MaxDepthExceededError extends Error {
+}
+/**
+ * Default schema/application nesting bound. Chosen below the native
+ * call-stack ceiling so the typed {@link MaxDepthExceededError} fires before
+ * a `RangeError`, while staying generous for real-world documents.
+ */
+export declare const DEFAULT_MAX_DEPTH = 512;
+/** One-line description of a non-schema value for error messages. */
+export declare function describeNonSchema(node: JsonValue): string;
+/** Schema registration, identifier indexing, and reference resolution. */
+export declare class SchemaRegistry {
+    private dialectRegistry;
+    private defaultDialectUri;
+    private maxDepth;
+    private documents;
+    private anchors;
+    private dynamicAnchors;
+    private recursiveRoots;
+    private producedBehaviorIds;
+    private consumedBehaviorIds;
+    private coverageProducerIds;
+    private coverageConsumedIds;
+    private documentDialects;
+    private resourceLocations;
+    private aliases;
+    private pendingResources;
+    private documentRanges;
+    /**
+     * Called for each `pattern`/`patternProperties` regex during a
+     * registration walk, when set. The Engine installs this (after registering
+     * its trusted metaschemas) to enforce `rejectUnsafeRegex`.
+     */
+    onRegex?: (pattern: string, location: string) => void;
+    private shared;
+    private readOnly;
+    constructor(dialectRegistry: DialectRegistry, defaultDialectUri: string, maxDepth?: number);
+    /**
+     * A read-only view of the registry's current contents, over a view of the
+     * dialect registry. Later registrations on this registry are invisible to
+     * the view, and registering into the view throws
+     * {@link ReadOnlyRegistryError}. A compiled artifact binds to one so that
+     * a compilation boundary cannot change reference resolution (E1).
+     */
+    snapshot(): SchemaRegistry;
+    private mutable;
+    /**
+     * Register a schema document. The dialect comes from `$schema` when present
+     * (and must already be registered), else `dialectUri`, else the default.
+     * Returns the document's canonical base URI.
+     */
+    register(schema: JsonValue, retrievalUri: string, dialectUri?: string, getRange?: (pointer: string) => SourceRange | undefined): string;
+    private walk;
+    /**
+     * The registered document containing a schema resource, and the resource
+     * root's pointer from that document's root (D17 bridge; see loader.ts).
+     * Undefined for resources the registration walk never saw (e.g. an `$id`
+     * inside an unknown keyword reached only by pointer navigation).
+     */
+    documentLocation(resourceUri: string): DocumentLocation | undefined;
+    /** Source range for a document-rooted pointer, when the loader supplied one (D17). */
+    range(documentUri: string, pointer: string): SourceRange | undefined;
+    /** True if a resource is registered, directly or via a retrieval-URI alias. */
+    has(resourceUri: string): boolean;
+    /** The schema node at a resource's root, if registered. */
+    document(resourceUri: string): JsonValue | undefined;
+    /** External resources referenced but not yet registered; drained per call. */
+    takeUnresolved(): string[];
+    /** The `$dynamicAnchor` target for a name in a resource, if one was registered (D8). */
+    dynamicAnchor(resourceUri: string, name: string): SchemaRef | undefined;
+    /** True if a resource's root carries 2019-09 `$recursiveAnchor: true`. */
+    hasRecursiveRoot(resourceUri: string): boolean;
+    /** Behavior ids some registered keyword declares it produces dependency data under. */
+    producedIds(): ReadonlySet<string>;
+    /** Behavior ids some registered keyword declares it consumes. */
+    consumedIds(): ReadonlySet<string>;
+    /** The consumed subset of {@link consumedIds} whose producer declares evaluated coverage: what the coverage channel carries. */
+    coverageIds(): ReadonlySet<string>;
+    private canonical;
+    /**
+     * The dialect URI a resource was registered under.
+     * @throws UnresolvableRefError if the resource is not registered.
+     */
+    dialectUriFor(baseUri: string): string;
+    /**
+     * The dialect a resource was registered under.
+     * @throws UnresolvableRefError if the resource is not registered.
+     */
+    dialectFor(baseUri: string): Dialect;
+    /**
+     * Resolves a URI to its resource's root schema.
+     * @throws UnresolvableRefError if the resource is not registered.
+     */
+    rootRef(uri: string): SchemaRef;
+    /**
+     * Resolves a reference value against the referring schema's base URI.
+     * @throws UnresolvableRefError if the resource, anchor, or pointer target
+     * does not exist.
+     */
+    resolveRef(ref: string, currentBase: string): SchemaRef;
+    /**
+     * Descend from a schema position into keyword/index children, maintaining
+     * canonical location and lexical base.
+     */
+    child(ref: SchemaRef, segments: readonly (string | number)[]): SchemaRef;
+}
+//# sourceMappingURL=registry.d.ts.map

package/dist/registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../src/registry.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,SAAS,EAA4C,MAAM,WAAW,CAAC;AAEhF,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,eAAe,EAAyB,MAAM,cAAc,CAAC;AAC/E,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;;GAUG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;CAAG;AAEhD;;;;;;;GAOG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;CAAG;AAEnD;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,MAAM,CAAC;AAErC,qEAAqE;AACrE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,CAGzD;AAED,0EAA0E;AAC1E,qBAAa,cAAc;IAwCvB,OAAO,CAAC,eAAe;IACvB,OAAO,CAAC,iBAAiB;IACzB,OAAO,CAAC,QAAQ;IAzClB,OAAO,CAAC,SAAS,CAAgC;IACjD,OAAO,CAAC,OAAO,CAAgC;IAC/C,OAAO,CAAC,cAAc,CAAgC;IACtD,OAAO,CAAC,cAAc,CAAqB;IAI3C,OAAO,CAAC,mBAAmB,CAAqB;IAChD,OAAO,CAAC,mBAAmB,CAAqB;IAIhD,OAAO,CAAC,mBAAmB,CAAqB;IAChD,OAAO,CAAC,mBAAmB,CAAqB;IAChD,OAAO,CAAC,gBAAgB,CAA6B;IACrD,OAAO,CAAC,iBAAiB,CAAuC;IAGhE,OAAO,CAAC,OAAO,CAA6B;IAG5C,OAAO,CAAC,gBAAgB,CAAqB;IAC7C,OAAO,CAAC,cAAc,CAGlB;IACJ;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;IAItD,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,QAAQ,CAAS;gBAGf,eAAe,EAAE,eAAe,EAChC,iBAAiB,EAAE,MAAM,EACzB,QAAQ,GAAE,MAA0B;IAG9C;;;;;;OAMG;IACH,QAAQ,IAAI,cAAc;IAuB1B,OAAO,CAAC,OAAO;IAoBf;;;;OAIG;IACH,QAAQ,CACN,MAAM,EAAE,SAAS,EACjB,YAAY,EAAE,MAAM,EACpB,UAAU,CAAC,EAAE,MAAM,EACnB,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,WAAW,GAAG,SAAS,GACtD,MAAM;IA8BT,OAAO,CAAC,IAAI;IAwGZ;;;;;OAKG;IACH,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,gBAAgB,GAAG,SAAS;IAInE,sFAAsF;IACtF,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAIpE,+EAA+E;IAC/E,GAAG,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAIjC,2DAA2D;IAC3D,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAIpD,8EAA8E;IAC9E,cAAc,IAAI,MAAM,EAAE;IAM1B,wFAAwF;IACxF,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS;IAIvE,0EAA0E;IAC1E,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAI9C,uFAAuF;IACvF,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC;IAIlC,iEAAiE;IACjE,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC;IAIlC,gIAAgI;IAChI,WAAW,IAAI,WAAW,CAAC,MAAM,CAAC;IAIlC,OAAO,CAAC,SAAS;IAIjB;;;OAGG;IACH,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAOtC;;;OAGG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAIpC;;;OAGG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS;IAY/B;;;;OAIG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,SAAS;IAqDvD;;;OAGG;IACH,KAAK,CAAC,GAAG,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GAAG,SAAS;CAqBzE"}