@astrale-os/kernel-dsl 1.0.0-beta.16 → 1.0.0-beta.18

package/dist/v1/language/policy/analysis/typing.js

@@ -16,9 +16,7 @@ export class PolicyTyping {
     // paths; for that to merge distinct variables, the Policy expands deeper than
     // `limits.policy.patternDepth`.
     #expansions = new Map();
-    #nodeClasses;
-    #concreteClasses;
-    #satisfaction;
+    #index;
     constructor(scope) {
         this.scope = scope;
     }
@@ -31,9 +29,7 @@ export class PolicyTyping {
     }
     /** Whether the Policy accepts every concrete source and target pair the Edge Class accepts. */
     policyAcceptsEdgeClass(name, declaration) {
-        const endpoints = declaration.orientation === 'directed'
-            ? [declaration.endpoints.source, declaration.endpoints.target]
-            : declaration.endpoints;
+        const endpoints = endpointPair(declaration);
         const sources = this.#concreteEndpointClasses(endpoints[0].accepts);
         const targets = this.#concreteEndpointClasses(endpoints[1].accepts);
         return sources.every((source) => targets.every((target) => this.#policyAcceptsEdge(name, { kind: 'exact', ref: source }, { kind: 'exact', ref: target })));
@@ -73,10 +69,13 @@ export class PolicyTyping {
         return branches !== undefined && branches.every((branch) => this.branchIsTyped(branch, use));
     }
     #concreteEndpointClasses(accepts) {
-        this.#concreteClasses ??= new Set(this.scope.concreteNodeClasses.map(definitionRefIndex));
-        const concrete = this.#concreteClasses;
+        const { concrete } = this.#nodeClassIndex();
         return this.#satisfyingOneOf(accepts).filter((ref) => concrete.has(definitionRefIndex(ref)));
     }
+    #nodeClassIndex() {
+        this.#index ??= nodeClassIndex(this.scope);
+        return this.#index;
+    }
     #expandedBranches(name, visiting, namespace) {
         if (visiting.has(name))
             return undefined;
@@ -164,11 +163,7 @@ export class PolicyTyping {
             if (contract.kind === 'exact')
                 return this.#applyExact(candidates, contract.ref);
             if (contract.kind === 'default') {
-                return uniqueCandidates(candidates.flatMap((candidate) => candidate.kind === 'exact'
-                    ? this.#isNodeClass(candidate.ref)
-                        ? [candidate]
-                        : []
-                    : this.#nodeCandidates(candidate)));
+                return this.#applyAnyNodeClass(candidates).filter((candidate) => candidate.kind !== 'exact' || this.#isNodeClass(candidate.ref));
             }
             return candidates;
         }
@@ -202,10 +197,10 @@ export class PolicyTyping {
                 result.push({ kind: 'exact', ref: exact });
             }
         }
-        return uniqueCandidates(result);
+        return uniqueBy(result, candidateKey);
     }
     #applyAnyNodeClass(candidates) {
-        return uniqueCandidates(candidates.flatMap((candidate) => candidate.kind === 'exact' ? [candidate] : this.#nodeCandidates(candidate)));
+        return uniqueBy(candidates.flatMap((candidate) => candidate.kind === 'exact' ? [candidate] : this.#nodeCandidates(candidate)), candidateKey);
     }
     #applyRequirement(candidates, required) {
         const result = [];
@@ -220,11 +215,11 @@ export class PolicyTyping {
             else {
                 result.push({
                     kind: 'open',
-                    requirements: uniqueClasses([...candidate.requirements, required]),
+                    requirements: uniqueBy([...candidate.requirements, required], definitionRefIndex),
                 });
             }
         }
-        return uniqueCandidates(result);
+        return uniqueBy(result, candidateKey);
     }
     #applyEndpoint(candidates, accepts) {
         const result = [];
@@ -242,11 +237,11 @@ export class PolicyTyping {
             for (const accept of accepts) {
                 result.push({
                     kind: 'open',
-                    requirements: uniqueClasses([...candidate.requirements, accept]),
+                    requirements: uniqueBy([...candidate.requirements, accept], definitionRefIndex),
                 });
             }
         }
-        return uniqueCandidates(result);
+        return uniqueBy(result, candidateKey);
     }
     #classSatisfiesEndpoint(candidate, accepts) {
         return accepts.some((accept) => this.#classExtends(candidate, accept));
@@ -263,7 +258,7 @@ export class PolicyTyping {
      * `#classSatisfiesEndpoint` accepts, read from the index rather than tested one by one.
      */
     #satisfyingOneOf(accepts) {
-        const index = (this.#satisfaction ??= satisfactionIndex(this.scope));
+        const index = this.#nodeClassIndex();
         const positions = new Set();
         for (const accept of accepts) {
             const required = this.scope.resolveClass(accept);
@@ -271,7 +266,7 @@ export class PolicyTyping {
                 continue;
             if (isGraphRoot(required))
                 return index.nodeClasses;
-            for (const position of index.satisfying.get(ancestryKey(required.ref)) ?? []) {
+            for (const position of index.satisfying.get(definitionRefIndex(required.ref)) ?? []) {
                 positions.add(position);
             }
         }
@@ -281,8 +276,7 @@ export class PolicyTyping {
         return lists.every((accepts) => this.#classSatisfiesEndpoint(ref, accepts));
     }
     #isNodeClass(ref) {
-        this.#nodeClasses ??= new Set(this.scope.allNodeClasses.map(definitionRefIndex));
-        return this.#nodeClasses.has(definitionRefIndex(ref));
+        return this.#nodeClassIndex().nodes.has(definitionRefIndex(ref));
     }
     /** The Node Classes an open or `node` candidate can be. */
     #nodeCandidates(candidate) {
@@ -307,16 +301,14 @@ export class PolicyTyping {
         return inhabited ? [{ kind: 'node', lists }] : [];
     }
 }
-/** Classes are satisfied by origin and name, as `classSatisfies` compares them. */
-function ancestryKey(ref) {
-    return `${ref.origin}\u0000${ref.name}`;
-}
 /**
  * Index each Node Class of the closure under every Class its ancestry reaches, walked as
  * `classSatisfies` walks it: the Class itself, then each declared parent that resolves to a Node
  * Class. A Class then satisfies a non-root Node Class exactly when it is indexed under it.
+ * `classSatisfies` compares origin and name; every ClassRef has kind `class`, so the definition
+ * index of a ref keys it as that comparison does.
  */
-function satisfactionIndex(scope) {
+function nodeClassIndex(scope) {
     const nodeClasses = [];
     const satisfying = new Map();
     for (const ref of scope.allNodeClasses) {
@@ -324,30 +316,38 @@ function satisfactionIndex(scope) {
         if (actual?.kind !== 'node')
             continue;
         const position = nodeClasses.push(ref) - 1;
-        const seen = new Set();
-        const keys = new Set();
-        const pending = [actual];
-        for (let value = pending.pop(); value !== undefined; value = pending.pop()) {
-            if (seen.has(value))
-                continue;
-            seen.add(value);
-            const key = ancestryKey(value.ref);
-            if (!keys.has(key)) {
-                keys.add(key);
-                const positions = satisfying.get(key);
-                if (positions === undefined)
-                    satisfying.set(key, [position]);
-                else
-                    positions.push(position);
-            }
-            for (const parent of value.extends) {
-                const resolved = scope.resolveClass(parent);
-                if (resolved?.kind === 'node')
-                    pending.push(resolved);
-            }
+        for (const key of ancestryKeys(actual, scope)) {
+            const positions = satisfying.get(key);
+            if (positions === undefined)
+                satisfying.set(key, [position]);
+            else
+                positions.push(position);
+        }
+    }
+    return {
+        nodeClasses,
+        nodes: new Set(nodeClasses.map(definitionRefIndex)),
+        concrete: new Set(scope.concreteNodeClasses.map(definitionRefIndex)),
+        satisfying,
+    };
+}
+/** The keys of the Node Classes a Node Class's ancestry reaches, itself included. */
+function ancestryKeys(actual, scope) {
+    const seen = new Set();
+    const keys = new Set();
+    const pending = [actual];
+    for (let value = pending.pop(); value !== undefined; value = pending.pop()) {
+        if (seen.has(value))
+            continue;
+        seen.add(value);
+        keys.add(definitionRefIndex(value.ref));
+        for (const parent of value.extends) {
+            const resolved = scope.resolveClass(parent);
+            if (resolved?.kind === 'node')
+                pending.push(resolved);
         }
     }
-    return { nodeClasses, satisfying };
+    return keys;
 }
 function targetContract(term, use) {
     if (use.kind === 'object')
@@ -378,9 +378,7 @@ function variantsForEdge(use, typing) {
     const declaration = typing.scope.edgeDeclaration(edge.class);
     if (declaration === undefined)
         return [];
-    const endpoints = declaration.orientation === 'directed'
-        ? [declaration.endpoints.source, declaration.endpoints.target]
-        : declaration.endpoints;
+    const endpoints = endpointPair(declaration);
     const bounds = edge.repeat ?? { min: 1, max: 1 };
     if (!Number.isInteger(bounds.min) ||
         !Number.isInteger(bounds.max) ||
@@ -422,7 +420,13 @@ function variantsForEdge(use, typing) {
             });
         }
     }
-    return uniqueEdgeVariants(variants);
+    return uniqueBy(variants, edgeVariantKey);
+}
+/** The two endpoints of an Edge Class, a directed one's as source then target. */
+function endpointPair(declaration) {
+    return declaration.orientation === 'directed'
+        ? [declaration.endpoints.source, declaration.endpoints.target]
+        : declaration.endpoints;
 }
 function startEndpoint(endpoints, reversed) {
     return reversed ? endpoints[1] : endpoints[0];
@@ -430,31 +434,22 @@ function startEndpoint(endpoints, reversed) {
 function endEndpoint(endpoints, reversed) {
     return reversed ? endpoints[0] : endpoints[1];
 }
-function uniqueEdgeVariants(values) {
-    const result = new Map();
-    for (const value of values) {
-        const key = `${value.constraints
-            .map(([term, accepts]) => `${term}:${accepts.map(definitionRefIndex).sort().join(',')}`)
-            .join('|')}=${value.equalities.map(([left, right]) => `${left}:${right}`).join('|')}`;
-        result.set(key, value);
-    }
-    return [...result.values()];
+/** The values with distinct keys, each at its key's first position and holding its last value. */
+function uniqueBy(values, key) {
+    return [...new Map(values.map((value) => [key(value), value])).values()];
 }
-function uniqueCandidates(values) {
-    const result = new Map();
-    for (const value of values) {
-        const key = value.kind === 'exact'
-            ? `exact:${definitionRefIndex(value.ref)}`
-            : value.kind === 'open'
-                ? `open:${value.requirements.map(definitionRefIndex).sort().join('|')}`
-                : `node:${value.lists
-                    .map((accepts) => accepts.map(definitionRefIndex).sort().join(','))
-                    .sort()
-                    .join('|')}`;
-        result.set(key, value);
-    }
-    return [...result.values()];
+function edgeVariantKey(variant) {
+    const constraints = variant.constraints.map(([term, accepts]) => `${term}:${classSetKey(accepts)}`);
+    const equalities = variant.equalities.map(([left, right]) => `${left}:${right}`);
+    return `${constraints.join('|')}=${equalities.join('|')}`;
+}
+function candidateKey(candidate) {
+    if (candidate.kind === 'exact')
+        return `exact:${definitionRefIndex(candidate.ref)}`;
+    if (candidate.kind === 'open')
+        return `open:${classSetKey(candidate.requirements)}`;
+    return `node:${candidate.lists.map(classSetKey).sort().join('|')}`;
 }
-function uniqueClasses(values) {
-    return [...new Map(values.map((value) => [definitionRefIndex(value), value])).values()];
+function classSetKey(refs) {
+    return refs.map(definitionRefIndex).sort().join(',');
 }

package/dist/v1/language/policy/model/policy.d.ts

@@ -90,23 +90,63 @@ export type PolicyObjectRef = ClassRef | FunctionRef | PolicyRef | ViewRef | Cor
 export declare function policyObjectKey(ref: PolicyObjectRef): string;
 export declare function policyObjectOrigin(ref: PolicyObjectRef): string;
 export declare function projectedMemberClass(ref: Exclude<PolicyObjectRef, CoreRef>): ClassRef;
+export type ClassObservation = 'read' | 'traverse';
+export type ClassWrite = 'create' | 'update' | 'delete';
+export type ClassOperation = ClassObservation | ClassWrite;
+/**
+ * Every Class slot: the observations, which admit every caller when absent, then the writes, which
+ * admit only the Domain that declares the Class when absent.
+ */
+export declare const CLASS_OPERATIONS: readonly ClassOperation[];
+export declare function isClassObservation(operation: ClassOperation): operation is ClassObservation;
 /**
  * One Class observation slot: a named Policy, or `false`, the rule no caller satisfies. Its other
  * value has no spelling there: an absent observation Policy already means `true`.
  */
 export type ClassPolicy = PolicyRef | false;
-/** What a Node Class rule may check: the observed Node, or one exact projected member. */
+/**
+ * One Class write slot: a named Policy, or `true`, the rule every Identity satisfies. Its other
+ * value has no spelling there: an absent write Policy already means the owning Domain only.
+ */
+export type ClassWritePolicy = PolicyRef | true;
+/** What a Class rule may check: the observed or written instance, or one exact projected member. */
 export type ClassRuleObject = Extract<PolicyCheckObject, {
     readonly kind: 'self' | 'ref';
 }>;
 /**
- * Policy checks deciding one Node Class observation. `self` is the observed Node; a `ref` object
- * is the same Node for every candidate. A lone check of `self` is spelled as its Policy reference.
+ * Policy checks deciding one Node Class slot. `self` is the observed or written Node; a `ref`
+ * object is the same Node for every candidate. A lone check of `self` is spelled as its Policy
+ * reference.
  */
 export type ClassRuleChecks = PolicyCheckExpression<PolicyRef, ClassRuleObject>;
+/**
+ * Policy checks deciding one Edge Class slot. `self` is the observed or written Edge, checked by a
+ * Policy whose source and target are its endpoints; a `ref` object is one exact member, the same
+ * Node for every candidate. A lone check of `self` is spelled as its Policy reference.
+ */
+export type EdgeRuleChecks = ClassRuleChecks;
+/** What a Node create rule may check: one exact projected member, since the Node is not yet. */
+export type CreateRuleObject = Extract<PolicyCheckObject, {
+    readonly kind: 'ref';
+}>;
+/** Policy checks deciding the creation of a Node: every object is a `ref` member. */
+export type CreateRuleChecks = PolicyCheckExpression<PolicyRef, CreateRuleObject>;
 /** One Node Class observation slot: a Class Policy, or Policy checks over the observed Node. */
 export type NodeClassPolicy = ClassPolicy | ClassRuleChecks;
-export declare function isClassRuleChecks(value: ClassPolicy | ClassRuleChecks | undefined): value is ClassRuleChecks;
+/** One Node Class update or delete slot: a write Policy, or Policy checks over the written Node. */
+export type NodeClassWritePolicy = ClassWritePolicy | ClassRuleChecks;
+/**
+ * The Node Class create slot: `true`, or Policy checks over members. A named Policy alone has no
+ * object there, so it has no spelling.
+ */
+export type NodeClassCreatePolicy = true | CreateRuleChecks;
+/** One Edge Class observation slot: a Class Policy, or Policy checks over the observed Edge. */
+export type EdgeClassPolicy = ClassPolicy | EdgeRuleChecks;
+/** One Edge Class write slot: a write Policy, or Policy checks over the written Edge. */
+export type EdgeClassWritePolicy = ClassWritePolicy | EdgeRuleChecks;
+/** The value of any Class slot. */
+export type ClassSlotPolicy = PolicyRef | boolean | ClassRuleChecks;
+export declare function isClassRuleChecks(value: ClassSlotPolicy | undefined): value is ClassRuleChecks;
 /**
  * Whether every way Policy checks can hold passes through a check, so that the caller decides each
  * admission. `sameNode` compares two objects and names no caller.

package/dist/v1/language/policy/model/policy.js

@@ -33,6 +33,20 @@ export function projectedMemberClass(ref) {
 function kernelClassRef(name) {
     return Object.freeze({ origin: 'kernel.astrale.ai', kind: 'class', name });
 }
+/**
+ * Every Class slot: the observations, which admit every caller when absent, then the writes, which
+ * admit only the Domain that declares the Class when absent.
+ */
+export const CLASS_OPERATIONS = Object.freeze([
+    'read',
+    'traverse',
+    'create',
+    'update',
+    'delete',
+]);
+export function isClassObservation(operation) {
+    return operation === 'read' || operation === 'traverse';
+}
 export function isClassRuleChecks(value) {
     return (typeof value === 'object' &&
         ('check' in value || 'sameNode' in value || 'allOf' in value || 'anyOf' in value));

package/dist/v1/language/policy/normalization/normalize.d.ts

@@ -1,4 +1,4 @@
-import type { NodeClassPolicy, PolicyCheckExpression, PolicyExpression, PolicyPatternExpression } from '../model/policy.js';
+import type { ClassSlotPolicy, PolicyCheckExpression, PolicyExpression, PolicyPatternExpression } from '../model/policy.js';
 export declare function normalizePolicyExpression(value: PolicyExpression): PolicyExpression;
 /**
  * The fixed point of the single pass: a Pattern the single pass reproduces is returned unchanged,
@@ -6,10 +6,10 @@ export declare function normalizePolicyExpression(value: PolicyExpression): Poli
  */
 export declare function normalizePolicyPattern(value: PolicyPatternExpression): PolicyPatternExpression;
 /**
- * The one spelling of a Node Class observation rule: normalized Policy checks without a composition
- * of one operand, or the Policy that a lone check of `self` names, which is how a Class has always
- * declared one. Callable checks keep their compositions of one operand: their revisions predate
- * this rule.
+ * The one spelling of a Class rule: normalized Policy checks without a composition of one operand,
+ * or the Policy that a lone check of `self` names, which is how a Class has always declared one.
+ * Callable checks keep their compositions of one operand: their revisions predate this rule. A
+ * create rule checks no `self`, so it keeps its checks.
  */
-export declare function normalizeClassRule(value: NodeClassPolicy): NodeClassPolicy;
+export declare function normalizeClassRule<Slot extends ClassSlotPolicy>(value: Slot): Slot;
 export declare function normalizePolicyChecks(value: PolicyCheckExpression): PolicyCheckExpression;

package/dist/v1/language/policy/normalization/normalize.js

@@ -40,16 +40,16 @@ function normalizePatternOnce(value) {
     return normalizePatternNode(rewritten);
 }
 /**
- * The one spelling of a Node Class observation rule: normalized Policy checks without a composition
- * of one operand, or the Policy that a lone check of `self` names, which is how a Class has always
- * declared one. Callable checks keep their compositions of one operand: their revisions predate
- * this rule.
+ * The one spelling of a Class rule: normalized Policy checks without a composition of one operand,
+ * or the Policy that a lone check of `self` names, which is how a Class has always declared one.
+ * Callable checks keep their compositions of one operand: their revisions predate this rule. A
+ * create rule checks no `self`, so it keeps its checks.
  */
 export function normalizeClassRule(value) {
     if (!isClassRuleChecks(value))
         return value;
     const checks = unwrapSingleOperands(normalizePolicyChecks(value));
-    return 'check' in checks && checks.object.kind === 'self' ? checks.check : checks;
+    return ('check' in checks && checks.object.kind === 'self' ? checks.check : checks);
 }
 /** Replace each composition of one operand by that operand, merging what it then nests. */
 function unwrapSingleOperands(value) {

package/dist/v1/language/validation/rule.d.ts

@@ -8,13 +8,15 @@ import type { DiagnosticCode } from './diagnostic.js';
  * `warning`: a value schema, which the rule reports without refusing it.
  */
 export type ValueRuleStage = 'schema' | 'context' | 'value' | 'warning';
-/** The rule one value diagnostic code reports. */
-export interface ValueRule {
-    readonly stage: ValueRuleStage;
+/**
+ * The rule one diagnostic code reports, whatever it checks: what `schema.RULES` and `VALUE_RULES`
+ * say of every code, each with the stages of its own checks.
+ */
+export interface DiagnosticRule {
     /**
-     * The positions the rule constrains, which its diagnostics point at, relative to the value
-     * schema, the value or the Domain input it checks: JSON Pointer templates in which a `{name}`
-     * token stands for one token of the kind it names and `{/path*}` for any number of tokens.
+     * The positions the rule constrains, which its diagnostics point at: JSON Pointer templates in
+     * which a `{name}` token stands for one token of the kind it names and `{/path*}` for any number
+     * of tokens.
      */
     readonly positions: readonly [string, ...string[]];
     /** The rule, in one plain sentence. */
@@ -23,11 +25,19 @@ export interface ValueRule {
     readonly limits?: readonly [LimitKey, ...LimitKey[]];
     /**
      * The conditions of the published JSON Schema of the document that state the rule, where some
-     * do: the URI fragment of each `if` or `not` subschema whose failure refuses a value schema of
-     * the document with `DV_VALUE_SCHEMA` and this rule's code as its `valueCode`.
+     * do: the URI fragment of each `if` or `not` subschema whose failure refuses the document with
+     * this rule's code.
      */
     readonly conditions?: readonly [string, ...string[]];
 }
+/**
+ * The rule one value diagnostic code reports. Its positions are relative to the value schema, the
+ * value or the Domain input it checks. A condition refuses a value schema of the document with
+ * `DV_VALUE_SCHEMA` and this rule's code as its `valueCode`.
+ */
+export interface ValueRule extends DiagnosticRule {
+    readonly stage: ValueRuleStage;
+}
 /**
  * Every value diagnostic code with the rule it reports. A code added to the language does not
  * compile until it is described here.

package/dist/v1/language/validation/rule.js

@@ -1,8 +1,9 @@
+import { deepFreeze } from '../freeze.js';
 /**
  * Every value diagnostic code with the rule it reports. A code added to the language does not
  * compile until it is described here.
  */
-export const VALUE_RULES = frozen({
+export const VALUE_RULES = deepFreeze({
     CALLABLE_INPUT_FIELD_UNKNOWN: {
         stage: 'value',
         positions: [''],
@@ -106,13 +107,3 @@ export const VALUE_RULES = frozen({
         statement: 'A Property of value kind json is filtered by equality only, so its author is warned.',
     },
 });
-function frozen(rules) {
-    for (const rule of Object.values(rules)) {
-        Object.freeze(Object.freeze(rule).positions);
-        if (rule.limits !== undefined)
-            Object.freeze(rule.limits);
-        if (rule.conditions !== undefined)
-            Object.freeze(rule.conditions);
-    }
-    return Object.freeze(rules);
-}

package/dist/v1/language/value/evaluate/program.d.ts

@@ -1,3 +1,4 @@
+import type { Options } from '@astrale-os/kernel-dsl/value';
 import type { Diagnostic } from '../../validation/diagnostic.js';
 import type { ValueProgram } from '../compile/model.js';
-export declare function validateValueProgram(program: ValueProgram, input: unknown, roots?: readonly number[]): readonly Diagnostic[];
+export declare function validateValueProgram(program: ValueProgram, input: unknown, roots?: readonly number[], options?: Options): readonly Diagnostic[];

package/dist/v1/language/value/evaluate/program.js

@@ -1,8 +1,8 @@
 import { loadValueProgram } from '../compile/load.js';
 import { validateCanonicalJsonDomain } from '../profile/json.validate.js';
 import { evaluateInstance } from './evaluator.js';
-export function validateValueProgram(program, input, roots = [program.root]) {
-    const canonical = validateCanonicalJsonDomain(input, '');
+export function validateValueProgram(program, input, roots = [program.root], options) {
+    const canonical = validateCanonicalJsonDomain(input, '', options);
     if (canonical.length > 0)
         return canonical;
     return roots.flatMap((root) => {

package/dist/v1/language/value/evaluate/validate.d.ts

@@ -1,4 +1,4 @@
-import type { Value as JsonValue } from '@astrale-os/kernel-dsl/value';
+import type { Value as JsonValue, Options } from '@astrale-os/kernel-dsl/value';
 import type { Diagnostic } from '../../validation/diagnostic.js';
 import type { JsonSchema } from '../model/schema.js';
 import type { ValueSchemaRegistry } from '../reference/registry.js';
@@ -13,4 +13,4 @@ import { type PatternPool } from './preparation.js';
  */
 export declare function validateJsonInstance(schema: JsonSchema, value: JsonValue, registry: ValueSchemaRegistry, pointer?: string, patterns?: PatternPool): Diagnostic[];
 /** Validate with the exact preparation already retained by a source-resolved Property or Callable. */
-export declare function validatePreparedInstance(compiled: CompiledInstanceSchema, value: unknown): Diagnostic[];
+export declare function validatePreparedInstance(compiled: CompiledInstanceSchema, value: unknown, options?: Options): Diagnostic[];

package/dist/v1/language/value/evaluate/validate.js

@@ -24,8 +24,8 @@ export function validateJsonInstance(schema, value, registry, pointer = '', patt
     return instanceDiagnostics(prepared.value, value, pointer);
 }
 /** Validate with the exact preparation already retained by a source-resolved Property or Callable. */
-export function validatePreparedInstance(compiled, value) {
-    const diagnostics = [...validateCanonicalJsonDomain(value, '')];
+export function validatePreparedInstance(compiled, value, options) {
+    const diagnostics = [...validateCanonicalJsonDomain(value, '', options)];
     return diagnostics.length > 0
         ? diagnostics
         : instanceDiagnostics(compiled, value, '');

package/dist/v1/language/value/profile/json.validate.d.ts

@@ -1,2 +1,4 @@
+import { type Options } from '@astrale-os/kernel-dsl/value';
 import type { Diagnostic } from '../../validation/diagnostic.js';
-export declare function validateCanonicalJsonDomain(value: unknown, pointer: string): readonly Diagnostic[];
+/** Whether `value` is a portable JSON Value, within the portable limits `options` overrides. */
+export declare function validateCanonicalJsonDomain(value: unknown, pointer: string, options?: Options): readonly Diagnostic[];

package/dist/v1/language/value/profile/json.validate.js

@@ -1,8 +1,9 @@
 import { acceptForRead as acceptJsonValue, BoundaryError as JsonBoundaryError, } from '@astrale-os/kernel-dsl/value';
 import { diagnostic } from '../../validation/diagnostic.js';
-export function validateCanonicalJsonDomain(value, pointer) {
+/** Whether `value` is a portable JSON Value, within the portable limits `options` overrides. */
+export function validateCanonicalJsonDomain(value, pointer, options) {
     try {
-        acceptJsonValue(value);
+        acceptJsonValue(value, options);
         return [];
     }
     catch (error) {