@json-schema-engine/core 0.0.1

package/dist/result.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.js","sourceRoot":"","sources":["../src/result.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,uEAAuE;AACvE,yEAAyE;AACzE,0EAA0E;AAC1E,uEAAuE;AAEvE,OAAO,EAYL,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,UAAU,EACV,WAAW,EACX,aAAa,GACd,MAAM,aAAa,CAAC;AAUrB,MAAM,cAAc,GAAwB,IAAI,GAAG,CAAe;IAChE,MAAM;IACN,OAAO;IACP,UAAU;IACV,SAAS;IACT,MAAM;IACN,cAAc;CACf,CAAC,CAAC;AAEH,0GAA0G;AAC1G,MAAM,OAAO,kBAAmB,SAAQ,KAAK;CAAG;AAiFhD;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAwB;IAC1D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC;IACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,kBAAkB,CAAC,0BAA0B,MAAM,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,KAAK,CAAC;IACjD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,SAAS,GAAwB;YACrC,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,KAAK,IAAI,CAAC;YACrC,CAAC,aAAa,EAAE,WAAW,KAAK,KAAK,CAAC;YACtC,CAAC,aAAa,EAAE,OAAO,CAAC,WAAW,KAAK,IAAI,CAAC;YAC7C,CAAC,WAAW,EAAE,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC;YACzC,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC;SAClC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACnC,IAAI,EAAE,EAAE,CAAC;gBACP,MAAM,IAAI,kBAAkB,CAC1B,IAAI,IAAI,uDAAuD;oBAC7D,+DAA+D,CAClE,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,IACE,OAAO,CAAC,OAAO,KAAK,IAAI;QACxB,CAAC,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,UAAU,CAAC,EAC7C,CAAC;QACD,MAAM,IAAI,kBAAkB,CAC1B,uCAAuC,MAAM,sBAAsB;YACjE,gEAAgE;YAChE,0CAA0C,CAC7C,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACtD,MAAM,IAAI,kBAAkB,CAC1B,uDAAuD;YACrD,iCAAiC,CACpC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,MAAM;QACN,OAAO,EAAE,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,KAAK,IAAI;QACzD,OAAO,EACL,MAAM,KAAK,MAAM,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC;QACrE,WAAW;KACZ,CAAC;AACJ,CAAC;AAeD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAoB,EACpB,KAAc,EACd,KAAkB,EAClB,IAAuB,EACvB,YAAoB,EACpB,KAAc;IAEd,MAAM,MAAM,GAAW,EAAE,KAAK,EAAE,CAAC;IACjC,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC;IAC5C,IAAI,CAAC,KAAK;QAAE,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IACzC,IAAI,KAAK,IAAI,MAAM,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IACzC,CAAC;IACD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,MAAM,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QAC3C,IAAI,MAAM,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YACjC,MAAM,CAAC,kBAAkB,GAAG,KAAK,CAAC,kBAAkB,CAAC;QACvD,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAuB,MAAM,CAAC,OAAO;QAC9C,CAAC,CAAC;YACE,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;YAC5C,IAAI,EAAE,IAAK;SACZ;QACH,CAAC,CAAC,IAAI,CAAC;IACT,IAAI,KAAK;QAAE,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC;IAEnD,MAAM,UAAU,GAAwB,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IACzE,QAAQ,MAAM,CAAC,MAAM,EAAE,CAAC;QACtB,KAAK,OAAO;YACV,MAAM,CAAC,cAAc,GAAG,WAAW,CACjC,KAAK,EACL,YAAY,EACZ,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,WAAW,CAClB,CAAC;YACF,MAAM;QACR,KAAK,MAAM;YACT,MAAM,CAAC,cAAc,GAAG,UAAU,CAAC,KAAM,EAAE,UAAU,CAAC,CAAC;YACvD,MAAM;QACR,KAAK,cAAc;YACjB,MAAM,CAAC,cAAc,GAAG,kBAAkB,CAAC,KAAM,EAAE,UAAU,CAAC,CAAC;YAC/D,MAAM;QACR,KAAK,UAAU;YACb,MAAM,CAAC,cAAc,GAAG,cAAc,CAAC,KAAM,CAAC,CAAC;YAC/C,MAAM;QACR,KAAK,SAAS;YACZ,MAAM,CAAC,cAAc,GAAG,aAAa,CAAC,KAAM,CAAC,CAAC;YAC9C,MAAM;IACV,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/uri.d.ts

@@ -0,0 +1,18 @@
+/** Thrown when a reference cannot be resolved to an absolute URI. */
+export declare class UnresolvableRefError extends Error {
+}
+/**
+ * Resolves a reference URI against a base URI to an absolute URI.
+ * @throws UnresolvableRefError if the pair does not form a valid URI.
+ */
+export declare function resolveUri(ref: string, base: string): string;
+/** A URI split into its resource part and decoded fragment. */
+export interface SplitUri {
+    /** URI without fragment. */
+    resource: string;
+    /** Decoded fragment, `null` if absent. */
+    fragment: string | null;
+}
+/** Splits a URI into its resource and decoded fragment parts. */
+export declare function splitFragment(uri: string): SplitUri;
+//# sourceMappingURL=uri.d.ts.map

package/dist/uri.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uri.d.ts","sourceRoot":"","sources":["../src/uri.ts"],"names":[],"mappings":"AAEA,qEAAqE;AACrE,qBAAa,oBAAqB,SAAQ,KAAK;CAAG;AAElD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAM5D;AAED,+DAA+D;AAC/D,MAAM,WAAW,QAAQ;IACvB,4BAA4B;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,0CAA0C;IAC1C,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,iEAAiE;AACjE,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAQnD"}

package/dist/uri.js

@@ -0,0 +1,27 @@
+// URI handling for schema identification and reference resolution.
+/** Thrown when a reference cannot be resolved to an absolute URI. */
+export class UnresolvableRefError extends Error {
+}
+/**
+ * Resolves a reference URI against a base URI to an absolute URI.
+ * @throws UnresolvableRefError if the pair does not form a valid URI.
+ */
+export function resolveUri(ref, base) {
+    try {
+        return new URL(ref, base).href;
+    }
+    catch {
+        throw new UnresolvableRefError(`cannot resolve '${ref}' against '${base}'`);
+    }
+}
+/** Splits a URI into its resource and decoded fragment parts. */
+export function splitFragment(uri) {
+    const i = uri.indexOf("#");
+    return i === -1
+        ? { resource: uri, fragment: null }
+        : {
+            resource: uri.slice(0, i),
+            fragment: decodeURIComponent(uri.slice(i + 1)),
+        };
+}
+//# sourceMappingURL=uri.js.map

package/dist/uri.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uri.js","sourceRoot":"","sources":["../src/uri.ts"],"names":[],"mappings":"AAAA,mEAAmE;AAEnE,qEAAqE;AACrE,MAAM,OAAO,oBAAqB,SAAQ,KAAK;CAAG;AAElD;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,IAAY;IAClD,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,GAAG,cAAc,IAAI,GAAG,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAUD,iEAAiE;AACjE,MAAM,UAAU,aAAa,CAAC,GAAW;IACvC,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,OAAO,CAAC,KAAK,CAAC,CAAC;QACb,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;QACnC,CAAC,CAAC;YACE,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,QAAQ,EAAE,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SAC/C,CAAC;AACR,CAAC"}

package/dist/walk.d.ts

@@ -0,0 +1,25 @@
+import { JsonValue } from "./json.js";
+import { Dialect } from "./dialect.js";
+/**
+ * One schema position visited by {@link walkSchema}.
+ */
+export interface SchemaWalkVisit {
+    /** The value in schema position: an object or a boolean. */
+    readonly node: JsonValue;
+    /** JSON Pointer from the walk root. */
+    readonly pointer: string;
+    /** Applying keyword in the parent schema object; `null` at the root. */
+    readonly keyword: string | null;
+}
+/**
+ * Walks every schema position of `schema` reachable through the dialect's
+ * keyword facts (`analyze().subschemas`), visiting parents before children.
+ *
+ * Tolerant by design: values in schema position that are neither objects
+ * nor booleans are skipped, as are positions under keyword values whose
+ * `analyze()` rejects them — unknown keywords' values are never descended.
+ * Nesting beyond `maxDepth` still throws {@link MaxDepthExceededError}: the
+ * depth bound is a security posture, not a validity judgment.
+ */
+export declare function walkSchema(schema: JsonValue, dialect: Pick<Dialect, "keywords">, visit: (v: SchemaWalkVisit) => void, maxDepth?: number): void;
+//# sourceMappingURL=walk.d.ts.map

package/dist/walk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"walk.d.ts","sourceRoot":"","sources":["../src/walk.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,SAAS,EAA2B,MAAM,WAAW,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAGvC;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,4DAA4D;IAC5D,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,uCAAuC;IACvC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,wEAAwE;IACxE,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACjC;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,EAClC,KAAK,EAAE,CAAC,CAAC,EAAE,eAAe,KAAK,IAAI,EACnC,QAAQ,GAAE,MAA0B,GACnC,IAAI,CAgDN"}

package/dist/walk.js

@@ -0,0 +1,65 @@
+// Public schema-position walk (M8.6): the descent knowledge lives in each
+// keyword's analyze() facts, so adapters and tools stop hardcoding their own
+// applicator tables. Unlike the registry's registration walk (which owns
+// base-URI rebasing, anchor indexing, and reference collection), this walk
+// is deliberately tolerant: it runs on unvalidated input — e.g. a strict-
+// mode check before registration — where a malformed keyword value must be
+// skipped, not thrown. Registration keeps its InvalidSchemaError job.
+import { isObject, escapeSegment } from "./json.js";
+import { DEFAULT_MAX_DEPTH, MaxDepthExceededError } from "./registry.js";
+/**
+ * Walks every schema position of `schema` reachable through the dialect's
+ * keyword facts (`analyze().subschemas`), visiting parents before children.
+ *
+ * Tolerant by design: values in schema position that are neither objects
+ * nor booleans are skipped, as are positions under keyword values whose
+ * `analyze()` rejects them — unknown keywords' values are never descended.
+ * Nesting beyond `maxDepth` still throws {@link MaxDepthExceededError}: the
+ * depth bound is a security posture, not a validity judgment.
+ */
+export function walkSchema(schema, dialect, visit, maxDepth = DEFAULT_MAX_DEPTH) {
+    const step = (node, pointer, keyword, depth) => {
+        if (depth > maxDepth) {
+            throw new MaxDepthExceededError(`schema nesting exceeds maxDepth (${maxDepth}) at '#${pointer}'`);
+        }
+        if (typeof node === "boolean") {
+            visit({ node, pointer, keyword });
+            return;
+        }
+        if (!isObject(node))
+            return;
+        visit({ node, pointer, keyword });
+        for (const [name, value] of Object.entries(node)) {
+            const behavior = dialect.keywords.get(name)?.behavior;
+            if (!behavior?.analyze)
+                continue;
+            let positions;
+            try {
+                positions = behavior.analyze(value, { schema: node }).subschemas;
+            }
+            catch {
+                continue;
+            }
+            if (!positions)
+                continue;
+            for (const relPath of positions) {
+                let child = value;
+                let suffix = "/" + escapeSegment(name);
+                for (const seg of relPath) {
+                    child =
+                        child === null || typeof child !== "object"
+                            ? undefined
+                            : Array.isArray(child)
+                                ? child[seg]
+                                : child[seg];
+                    suffix += "/" + escapeSegment(String(seg));
+                }
+                if (child !== undefined) {
+                    step(child, pointer + suffix, name, depth + 1);
+                }
+            }
+        }
+    };
+    step(schema, "", null, 0);
+}
+//# sourceMappingURL=walk.js.map

package/dist/walk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"walk.js","sourceRoot":"","sources":["../src/walk.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,6EAA6E;AAC7E,yEAAyE;AACzE,2EAA2E;AAC3E,0EAA0E;AAC1E,2EAA2E;AAC3E,sEAAsE;AAEtE,OAAO,EAAa,QAAQ,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAE/D,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,eAAe,CAAC;AAczE;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CACxB,MAAiB,EACjB,OAAkC,EAClC,KAAmC,EACnC,WAAmB,iBAAiB;IAEpC,MAAM,IAAI,GAAG,CACX,IAAe,EACf,OAAe,EACf,OAAsB,EACtB,KAAa,EACP,EAAE;QACR,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;YACrB,MAAM,IAAI,qBAAqB,CAC7B,oCAAoC,QAAQ,UAAU,OAAO,GAAG,CACjE,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC9B,KAAK,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;YAClC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO;QAC5B,KAAK,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAElC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;YACtD,IAAI,CAAC,QAAQ,EAAE,OAAO;gBAAE,SAAS;YACjC,IAAI,SAAS,CAAC;YACd,IAAI,CAAC;gBACH,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,UAAU,CAAC;YACnE,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,CAAC,SAAS;gBAAE,SAAS;YACzB,KAAK,MAAM,OAAO,IAAI,SAAS,EAAE,CAAC;gBAChC,IAAI,KAAK,GAA0B,KAAK,CAAC;gBACzC,IAAI,MAAM,GAAG,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;gBACvC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;oBAC1B,KAAK;wBACH,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;4BACzC,CAAC,CAAC,SAAS;4BACX,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gCACpB,CAAC,CAAC,KAAK,CAAC,GAAa,CAAC;gCACtB,CAAC,CAAE,KAAmC,CAAC,GAAa,CAAC,CAAC;oBAC5D,MAAM,IAAI,GAAG,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,IAAI,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC"}

package/package.json

@@ -0,0 +1,32 @@
+{
+  "name": "@json-schema-engine/core",
+  "version": "0.0.1",
+  "description": "Interpreter core: registry, dialects, evaluation, annotations, and output rendering for draft 2020-12/2019-09/draft-07/draft-06",
+  "type": "module",
+  "main": "./dist/index.js",
+  "exports": {
+    ".": {
+      "jse-source": "./src/index.ts",
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "engines": {
+    "node": ">=22"
+  },
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist",
+    "src"
+  ],
+  "sideEffects": false,
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/handrews/json-schema-engine.git",
+    "directory": "packages/core"
+  }
+}

package/src/coverage.ts

@@ -0,0 +1,88 @@
+// Compiled-tier port of the consumer keywords' channel-reading semantics
+// (COMPILED-CONSUMERS.md). The runtime coverage channel is a flat array of
+// RAW DEPENDENCY DATA — the same values `ctx.produce` yields — merged with
+// mark/truncate at application boundaries by the serializer (phase B). These
+// helpers fold that channel exactly as the interpreter's `unevaluated*`
+// evaluate() folds visible dependency records, dispatching on VALUE SHAPE
+// (the shape is unambiguous, so one mixed names+indexes channel is sound):
+//
+// - `string[]`  evaluated property names (properties/patternProperties/
+//               additionalProperties/unevaluatedProperties values); folds
+//               into name coverage. Empty array is a no-op.
+// - `true`      full index coverage (items / contains-all /
+//               prefixItems-covered-whole-array / unevaluatedItems values).
+// - `number` n  prefix coverage of indexes 0..n, i.e. coveredPrefix = n+1
+//               (prefixItems' largest-applied-index value).
+// - `number[]`  individual covered indexes (contains' matched list).
+//
+// Name folding ignores non-`string[]` entries; index folding ignores
+// `string[]` entries; `[]` is a no-op for both.
+
+import { DependencyRecord } from "./engine.js";
+import { Cursor } from "./cursor.js";
+
+/**
+ * Folded name coverage: the set of evaluated property names. Ports
+ * `unevaluatedProperties.evaluate`'s seen-set union — every `string[]` entry
+ * contributes its names; other shapes are ignored.
+ */
+export function foldNameCoverage(channel: readonly unknown[]): Set<string> {
+  const seen = new Set<string>();
+  for (const entry of channel) {
+    if (Array.isArray(entry)) {
+      for (const el of entry) {
+        if (typeof el === "string") seen.add(el);
+      }
+    }
+  }
+  return seen;
+}
+
+/**
+ * Folded index coverage over an array of the given length. Ports
+ * `unevaluatedItems.evaluate`'s coveredPrefix/coveredIdx computation: `true`
+ * covers the whole array, a `number` extends the covered prefix to value+1
+ * (max-folded), a `number[]` marks individual indexes.
+ */
+export function foldIndexCoverage(
+  channel: readonly unknown[],
+  length: number,
+): { coveredPrefix: number; coveredIdx: Set<number> } {
+  let coveredPrefix = 0;
+  const coveredIdx = new Set<number>();
+  for (const entry of channel) {
+    if (entry === true) {
+      coveredPrefix = length;
+    } else if (typeof entry === "number") {
+      coveredPrefix = Math.max(coveredPrefix, entry + 1);
+    } else if (Array.isArray(entry)) {
+      // number[] (contains' matched list); string[] contributes no indexes.
+      for (const el of entry) {
+        if (typeof el === "number") coveredIdx.add(el);
+      }
+    }
+  }
+  return { coveredPrefix, coveredIdx };
+}
+
+/**
+ * Channel entries a fragment (interpreted island) contributes: the data of
+ * coverage-producer dependency records at the island's root cursor.
+ * `evaluateFragment` returns root-frame surviving records with cursor
+ * identity intact; filtering to the fragment's root `cursor` keeps coverage
+ * per-instance-location, and filtering to `coverageIds`
+ * (SchemaRegistry.coverageIds) keeps only the producers whose data the
+ * shape-dispatching folds above understand — other dependency data (an
+ * `if` outcome, say) never reaches the channel. Data passes through untouched.
+ */
+export function harvestCoverage(
+  dependencies: readonly DependencyRecord[],
+  cursor: Cursor,
+  coverageIds: ReadonlySet<string>,
+): unknown[] {
+  const out: unknown[] = [];
+  for (const d of dependencies) {
+    if (d.cursor === cursor && coverageIds.has(d.behaviorId)) out.push(d.data);
+  }
+  return out;
+}

package/src/cursor.ts

@@ -0,0 +1,42 @@
+// Instance cursor: a parent-linked position in the instance document.
+//
+// Cursor identity carries semantic weight: in-place applicators ($ref, allOf,
+// if, ...) apply subschemas to the *same* cursor object, while child
+// applicators (properties, items, ...) create child cursors. The channel's
+// visibility query keys on this identity (engine.ts). JSON Pointer strings
+// are materialized lazily, only when output units escape.
+
+import { JsonValue, escapeSegment } from "./json.js";
+
+/** A parent-linked position in the instance document. */
+export interface Cursor {
+  readonly value: JsonValue;
+  readonly parent: Cursor | null;
+  readonly segment: string | number | null;
+  /** Lazily cached JSON Pointer; use {@link instancePointer}. */
+  ptr?: string;
+}
+
+/** Creates a cursor at the instance document root. */
+export const rootCursor = (value: JsonValue): Cursor => ({
+  value,
+  parent: null,
+  segment: null,
+});
+
+/** Creates a cursor for a named or indexed child of `parent`. */
+export const childCursor = (
+  parent: Cursor,
+  segment: string | number,
+  value: JsonValue,
+): Cursor => ({ value, parent, segment });
+
+/** Computes the JSON Pointer for a cursor's instance location, caching the result. */
+export function instancePointer(cursor: Cursor): string {
+  if (cursor.ptr !== undefined) return cursor.ptr;
+  if (cursor.parent === null) return (cursor.ptr = "");
+  return (cursor.ptr =
+    instancePointer(cursor.parent) +
+    "/" +
+    escapeSegment(String(cursor.segment)));
+}