@directive-run/core 1.22.0 → 1.23.1

package/dist/{plugins-5Supk7it.d.ts → plugins-CaPMTICa.d.ts}

@@ -1075,6 +1075,60 @@ type EventsDef<S extends Schema> = Record<string, FlexibleEventHandler<S>>;
 type JitterStrategy = "none" | "full" | "equal" | {
     maxMs: number;
 };
+/**
+ * Why a resolver attempt was aborted, surfaced to {@link RetryPolicy.shouldRetry}
+ * so the policy can distinguish "retry on race-loss" from "fail loud on bug."
+ *
+ * - `"clobbered"` — an `abortOn`-listed fact was written by something
+ *   outside the resolver between the resolver's baseline read and its
+ *   next write (RFC 0003 optimistic-concurrency check). The retry is
+ *   typically safe — the resolver re-reads the current value and tries
+ *   again with fresh context.
+ * - `"timeout"` — the resolver's `timeout` ms elapsed. Retrying may
+ *   succeed if the underlying I/O was just slow; may fail again if the
+ *   timeout is set too tight for the workload.
+ * - `"cancelled"` — `system.stop()` was called, or external code aborted
+ *   the resolver's `ctx.signal`. Retrying is almost always wrong — the
+ *   cancellation was the caller's explicit intent.
+ * - `"error"` — the resolver threw. Default for back-compat: any abort
+ *   without a more specific reason maps here.
+ *
+ * Core has no supersession concept today; if a future package wants to
+ * surface supersession, it can widen the union additively without
+ * breaking back-compat.
+ *
+ * @public
+ */
+type ResolverAbortReason = "clobbered" | "timeout" | "cancelled" | "error";
+/**
+ * Context object passed as the optional third argument to
+ * {@link RetryPolicy.shouldRetry}. Lets the policy decide based on WHY
+ * the attempt failed — not just the thrown error.
+ *
+ * Two-argument `shouldRetry(error, attempt)` continues to work; the
+ * context argument is additive. Existing callers see no behavior change.
+ *
+ * @public
+ */
+interface ShouldRetryContext {
+    /**
+     * Why the attempt was aborted. Undefined when the engine couldn't
+     * classify the cause (very rare — defaults to `"error"` in practice).
+     */
+    reason?: ResolverAbortReason;
+    /**
+     * Populated only when `reason === "clobbered"`. Names the `abortOn`
+     * fact whose mid-flight change tripped the binding, plus the expected
+     * baseline value and the actual current value. Useful for
+     * `shouldRetry: (_, _, ctx) => ctx?.clobber?.fact === "cart.discount"`
+     * patterns that only retry contention on specific facts.
+     */
+    clobber?: {
+        fact: string;
+        expected: unknown;
+        actual: unknown;
+    };
+}
 /** Retry policy configuration */
 interface RetryPolicy {
     /** Maximum number of attempts */
@@ -1101,10 +1155,24 @@ interface RetryPolicy {
      * Return `true` to retry, `false` to stop immediately.
      * If omitted, all errors are retried (up to `attempts`).
      *
+     * The optional third `context` argument carries the abort reason and,
+     * for clobbers, the fact + expected/actual values. Existing two-arg
+     * callers continue to work — the third arg is undefined when omitted.
+     *
+     * @example Retry on contention, fail loud on bug
+     * ```ts
+     * shouldRetry: (err, attempt, ctx) => {
+     *   if (ctx?.reason === "clobbered") return attempt < 5;
+     *   if (ctx?.reason === "timeout") return attempt < 2;
+     *   return false; // "error" / "cancelled" → don't retry
+     * }
+     * ```
+     *
      * @param error - The error that occurred
      * @param attempt - The attempt number that just failed (1-based)
+     * @param context - Optional abort context (added v1.23.0); undefined for callers that don't pass it
      */
-    shouldRetry?: (error: Error, attempt: number) => boolean;
+    shouldRetry?: (error: Error, attempt: number, context?: ShouldRetryContext) => boolean;
 }
 /** Batch configuration */
 interface BatchConfig {
@@ -1315,6 +1383,128 @@ type ResolverStatus = {
     canceledAt: number;
 };
 
+/**
+ * Structural diff between two snapshots of a system's constraint `whenSpec`
+ * map. The "git diff for business rules" — operates on the predicate AST
+ * instead of source-text lines.
+ *
+ * A predicate is a tree of leaf clauses (`{ fact: operator(value) }`) and
+ * combinators (`$all` / `$any` / `$not`). `diffRules` flattens both trees
+ * into path-keyed leaf lists and compares: missing path → added/removed,
+ * same path with different operand → changed (with relaxed/tightened
+ * classification for numeric thresholds).
+ *
+ * Pure module — imports only utils. No engine / store / predicate-runtime
+ * dependency: predicates are walked as plain JSON.
+ */
+/** A leaf clause extracted from a predicate tree, keyed by its dotted path. */
+interface LeafClause {
+    /** Dotted path through the predicate. E.g. `phase`, `$all[0].elapsed`, `$not.paused`. */
+    path: string;
+    /** Operator name. `$eq` is implied for bare-value equality. */
+    op: string;
+    /** Operand. */
+    value: unknown;
+}
+/** Kind of change observed for a single clause. */
+type ChangeKind = "added" | "removed" | "changed" | "relaxed" | "tightened";
+/** A single change between two predicates at a specific path. */
+interface Change {
+    path: string;
+    kind: ChangeKind;
+    before?: {
+        op: string;
+        value: unknown;
+    };
+    after?: {
+        op: string;
+        value: unknown;
+    };
+}
+/** Status of a single constraint across the two snapshots. */
+type ConstraintStatus = "added" | "removed" | "changed" | "unchanged";
+interface ConstraintDiff {
+    id: string;
+    status: ConstraintStatus;
+    /** Empty for `unchanged`. For `added` / `removed`, every leaf is listed once. */
+    changes: Change[];
+}
+interface RulesDiffReport {
+    constraints: ConstraintDiff[];
+    summary: {
+        added: number;
+        removed: number;
+        changed: number;
+        unchanged: number;
+        totalClauseChanges: number;
+    };
+}
+interface DiffRulesOptions {
+    before: RulesMapInput;
+    after: RulesMapInput;
+}
+/**
+ * Accepted shapes for the `before` / `after` predicate maps:
+ *   - A plain map `{ [constraintId]: whenSpec }`
+ *   - The `system.inspect().constraints` array form `Array<{ id, whenSpec? }>`
+ *   - Either wrapped as `{ constraints: <one-of-the-above> }`
+ *
+ * Anything else throws at `toRulesMap` so a bad input fails loud.
+ */
+type RulesMapInput = unknown;
+/**
+ * Coerce supported input shapes into a flat `Record<constraintId, whenSpec>`.
+ * Constraints without a `whenSpec` (function-form `when`) are dropped with
+ * an undefined entry so callers can distinguish them from absent constraints
+ * if they care; the diff treats `undefined` as "no data" and skips clause
+ * walking.
+ */
+declare function toRulesMap(raw: RulesMapInput): Record<string, unknown>;
+/**
+ * Walk a predicate tree and emit every leaf clause with its dotted path.
+ * Combinators (`$all` / `$any` / `$not`) become indexed path segments.
+ * Bare-value equality (`{ phase: "red" }`) emits as `op: "$eq"`.
+ *
+ * Array-form predicates (`[{ fact, op, value }, ...]`) are also accepted —
+ * each clause's `fact` becomes the path, the operator is `op`, and the
+ * value is `value`.
+ *
+ * **What gets dropped:** non-object combinator children (e.g. `$not: "red"`
+ * with a string operand instead of a predicate object), function-form
+ * predicates (the engine accepts a function for `when`; this walker only
+ * sees data), and bare primitive predicates (a top-level `true` or `"x"`).
+ * The walker is a tree visitor — anything not shaped like a predicate node
+ * is silently skipped, never thrown on.
+ */
+declare function flattenPredicate(spec: unknown, pathPrefix?: string, out?: LeafClause[]): LeafClause[];
+/**
+ * Diff two snapshots of a system's constraint whenSpec map.
+ *
+ * @example
+ * ```ts
+ * const report = diffRules({
+ *   before: { blockCheckout: { cartTotal: { $gte: 100 } } },
+ *   after:  { blockCheckout: { cartTotal: { $gte: 50 } } },
+ * });
+ *
+ * report.constraints[0].status;          // "changed"
+ * report.constraints[0].changes[0].kind; // "relaxed"
+ * report.summary.totalClauseChanges;     // 1
+ * ```
+ *
+ * The input shape is forgiving — either a flat `{ id: whenSpec }` map, the
+ * `system.inspect().constraints` array form, or either wrapped as
+ * `{ constraints: ... }`. Constraints whose `when` is a function (no
+ * `whenSpec`) are tracked as added/removed but cannot be clause-diffed
+ * (the function form is opaque).
+ */
+declare function diffRules(options: DiffRulesOptions): RulesDiffReport;
+/**
+ * Diff two predicate trees and return the list of leaf-level changes.
+ * Exported for reuse beyond the full per-constraint report.
+ */
+declare function diffClauses(before: unknown, after: unknown): Change[];
+
 /**
  * Error Types - Type definitions for error handling
  */
@@ -3077,6 +3267,46 @@ interface MetaAccessor {
     /** Find all definitions matching a tag across all types. */
     byTag(tag: string): MetaMatch[];
 }
+/**
+ * Discriminated proof of why two resolvers' `when:` predicates fire on
+ * the same state — attached to `resolver.clobber.loop.detected` events
+ * so the warning can point at the specific clauses that co-fire instead
+ * of stopping at "these resolvers fight."
+ *
+ * - `matched` — both predicates have identical structural clauses.
+ *   The strongest verdict; the rules are syntactic duplicates.
+ * - `overlap` — clauses share at least one path and at least one
+ *   pairwise comparison says they co-fire (with no direct
+ *   contradictions). Strong verdict, slightly weaker than `matched`.
+ * - `indeterminate` — a non-COMPARABLE operator (`$regex`, `$elemMatch`,
+ *   `$matches`, custom) appeared. The proof builder declines to assert
+ *   overlap; the message says so explicitly rather than falsely
+ *   reporting a contradiction.
+ * - `function-form-opaque` — at least one constraint uses a function
+ *   `when:` (`(facts) => ...`), so structural comparison is impossible.
+ *   The warning text disclaims; if audit-ledger is mounted and its
+ *   `whenSourceCache` is available, identifying hashes of the function
+ *   source are included for cross-version diffing.
+ *
+ * @public
+ */
+type PredicateOverlapProof = {
+    verdict: "matched";
+    coFireClauses: readonly LeafClause[];
+    conflictingClauses: readonly never[];
+} | {
+    verdict: "overlap";
+    coFireClauses: readonly LeafClause[];
+    conflictingClauses: readonly LeafClause[];
+} | {
+    verdict: "indeterminate";
+    reason: "non-comparable-operator";
+    coFireClauses: readonly LeafClause[];
+} | {
+    verdict: "function-form-opaque";
+    reason: "one-or-both-when-is-a-function";
+    whenSourceHashes?: readonly string[];
+};
 /** Typed events emitted by system.observe(). */
 type ObservationEvent = {
     type: "fact.change";
@@ -3188,6 +3418,52 @@ type ObservationEvent = {
     requirementId: string;
     reason: "clobbered";
     dropped: number;
+}
+/**
+ * v1.23.0 — fires when `clobberLoopPlugin` detects a sustained pattern
+ * of clobbers on a fact involving the same set of resolvers above
+ * threshold within a time window. A single clobber is fine; the
+ * binding catches the race and the audit ledger records it. A *loop*
+ * is two or more resolvers whose `when:` predicates both satisfy a
+ * shared state and rewrite the fact every reconcile tick.
+ *
+ * `participants` is the unordered, distinct set of resolver IDs
+ * contributing to the loop. `predicateOverlap` (when both sides use a
+ * data-form `when:`) explains WHY the loop occurs — which clauses
+ * co-fire — so the suggested fix (add `priority:`, narrow `when:`,
+ * merge) is grounded in the actual rules, not a guess.
+ */
+ | {
+    type: "resolver.clobber.loop.detected";
+    systemId: string;
+    fact: string;
+    participants: readonly string[];
+    participantModules: readonly string[];
+    count: number;
+    windowMs: number;
+    firstAt: number;
+    lastAt: number;
+    predicateOverlap?: PredicateOverlapProof;
+    severity: "warn" | "error";
+    factTags: readonly string[];
+    suppressedSinceLastEmit: number;
+    rejectionSeqs: readonly number[];
+}
+/**
+ * v1.23.0 — fires when a previously-detected clobber loop closes
+ * cleanly, so dashboards can show "5 active loops" not "47
+ * historical loops". A loop is considered resolved when the
+ * `(fact, participantSet)` goes a quiet window without further
+ * `resolver.write.rejected` events, OR a participant is unregistered,
+ * OR a constraint re-registration changes a participant's `whenSpec`.
+ */
+ | {
+    type: "resolver.clobber.loop.resolved";
+    systemId: string;
+    fact: string;
+    participants: readonly string[];
+    durationMs: number;
+    resolution: "no-recurrence-in-window" | "participant-disabled" | "predicate-narrowed";
 } | {
     type: "effect.run";
     id: string;
@@ -3375,6 +3651,31 @@ interface System<M extends ModuleSchema = ModuleSchema> {
      */
     readonly notify: {
         guardrailBlocked(plugin: string, key: string, kind: "redact" | "alert" | "detect", count: number, category?: string): void;
+        /**
+         * v1.23.0 — plugin authoring surface for emitting the
+         * `"resolver.clobber.loop.detected"` ObservationEvent. Used by
+         * `clobberLoopPlugin` (and any compatible third-party detector). The
+         * call fans out to all registered plugins' `onClobberLoopDetected`
+         * hooks (including the synthetic plugins that back `system.observe()`)
+         * so audit-ledger, devtools, and OTel exporters capture the event
+         * without taking a dependency on the originating detector.
+         *
+         * Application code should never call this directly — use
+         * `system.observe()` to subscribe.
+         */
+        clobberLoopDetected(event: ObservationEvent & {
+            type: "resolver.clobber.loop.detected";
+        }): void;
+        /**
+         * v1.23.0 — companion to {@link clobberLoopDetected}. Fires when a
+         * previously-detected loop is considered resolved (quiet window
+         * elapsed, participant unregistered, or predicate narrowed). Lets
+         * monitoring dashboards show "active loops" rather than
+         * "historical loops."
+         */
+        clobberLoopResolved(event: ObservationEvent & {
+            type: "resolver.clobber.loop.resolved";
+        }): void;
     };
     /** Per-run trace entries (null if trace is not enabled) */
     readonly trace: TraceEntry[] | null;
@@ -3874,6 +4175,26 @@ interface Plugin<M extends ModuleSchema = ModuleSchema> {
      *   payloads.
      */
     onGuardrailBlocked?: (plugin: string, key: string, kind: "redact" | "alert" | "detect", count: number, category?: string) => void;
+    /**
+     * Called when `clobberLoopPlugin` (or any equivalent detector) publishes
+     * a structured loop event through `system.notify.clobberLoopDetected(...)`.
+     * Surfaces as the `"resolver.clobber.loop.detected"` `ObservationEvent`
+     * for `system.observe()` subscribers + audit-ledger + devtools, so
+     * downstream backends can capture loops without taking a direct
+     * dependency on `clobberLoopPlugin`.
+     */
+    onClobberLoopDetected?: (event: ObservationEvent & {
+        type: "resolver.clobber.loop.detected";
+    }) => void;
+    /**
+     * Called when a previously-detected loop is considered resolved (quiet
+     * window elapsed, participant unregistered, or predicate narrowed).
+     * Pairs with `onClobberLoopDetected` so dashboards can show "active
+     * loops" rather than "historical loops."
+     */
+    onClobberLoopResolved?: (event: ObservationEvent & {
+        type: "resolver.clobber.loop.resolved";
+    }) => void;
     /**
      * Called when a history snapshot is taken.
      * @param snapshot - The snapshot that was captured
@@ -3932,4 +4253,4 @@ interface Plugin<M extends ModuleSchema = ModuleSchema> {
     onTraceComplete?: (entry: TraceEntry) => void;
 }
 
-export { type InferSchemaType as $, type AnySystem as A, type BatchConfig as B, type ClauseResult as C, type DefinitionMeta as D, type EffectsDef as E, type FactPredicate as F, type DynamicConstraintDef as G, type DynamicEffectDef as H, type DynamicResolverDef as I, type EffectDef as J, type EventsDef as K, type FactTemplate as L, type ModuleSchema as M, type NamespacedSystem as N, type FactsSnapshot as O, type Plugin as P, type HistoryAPI as Q, type RequirementWithId as R, type SchemaType as S, type TypedDerivationsDef as T, type HistoryOption as U, type HistoryState as V, type InferDerivations as W, type InferEvents as X, type InferFacts as Y, type InferRequirementTypes as Z, type InferRequirements as _, type Facts as a, type FactReturnType as a$, type InferSelectorState as a0, type KeySelector as a1, type MetaAccessor as a2, type MetaMatch as a3, type ObservationEvent as a4, type OperatorObject as a5, type PatchSpec as a6, type PatchValue as a7, type PayloadRef as a8, type PredicateClause as a9, isSingleModuleSystem as aA, type FactsStore as aB, type ConstraintState as aC, type ResolverStatus as aD, type FactChange as aE, type ReconcileResult as aF, type RecoveryStrategy as aG, type ErrorSource as aH, type RetryLaterConfig as aI, type BatchItemResult as aJ, type BatchResolveResults as aK, type ConstraintsControl as aL, type CrossModuleDerivationFn as aM, type CrossModuleFactsWithSelf as aN, type DerivationKeys as aO, type DerivationReturnType as aP, type DerivationsControl as aQ, type DerivationsSchema as aR, type DeriveAccessor as aS, type DispatchEventsFromSchema as aT, type EffectCleanup as aU, type EffectsControl as aV, type EventPayloadSchema as aW, type EventsAccessor as aX, type EventsAccessorFromSchema as aY, type EventsSchema as aZ, type FactKeys as a_, type PredicateCombinator as aa, type PredicateCombinatorKey as ab, type PredicateObject as ac, type PredicateOp as ad, type ResolverDef as ae, type ResolversDef as af, type RetryPolicy as ag, type Schema as ah, type SchemaTypedResolversDef as ai, type Snapshot as aj, type SourceDef as ak, type SourceDropReason as al, type SourcePublish as am, type SourceReportError as an, type SourceUnsubscribe as ao, type System as ap, type SystemConfig as aq, type SystemDerived as ar, type SystemFacts as as, type SystemInspection as at, type SystemMode as au, type SystemSnapshot as av, type TraceEntry as aw, type TypedConstraintDef as ax, type TypedResolverDef as ay, isNamespacedSystem as az, type TypedEventsDef as b, type FlexibleEventHandler as b0, type HistoryConfig as b1, type InferEventPayloadFromSchema as b2, type InferRequirementPayloadFromSchema as b3, type InferSchema as b4, type MutableNamespacedFacts as b5, type NamespacedDerivations as b6, type NamespacedEventsAccessor as b7, type NamespacedFacts as b8, type ObservableKeys as b9, type RequirementExplanation as ba, type RequirementOutput as bb, type RequirementPayloadSchema$1 as bc, type RequirementsSchema as bd, type ResolverContext as be, type ResolversControl as bf, type SnapshotMeta as bg, type SystemEvent as bh, type TraceConfig as bi, type TypedResolverContext as bj, type UnionEvents as bk, type RequirementOutput$1 as bl, type SourcesDef as c, type TypedConstraintsDef as d, type TypedResolversDef as e, type ModuleHooks as f, type CrossModuleDeps as g, type CrossModuleDerivationsDef as h, type CrossModuleEffectsDef as i, type CrossModuleConstraintsDef as j, type ModuleDef as k, type CreateSystemOptionsSingle as l, type SingleModuleSystem as m, type ModulesMap as n, type CreateSystemOptionsNamed as o, type TraceOption as p, type ErrorBoundaryConfig as q, type Requirement as r, type RequirementKeyFn as s, type ConstraintDef as t, type ConstraintsDef as u, type CrossModuleConstraintDef as v, type CrossModuleEffectDef as w, DirectiveError as x, type DistributableSnapshot as y, type DistributableSnapshotOptions as z };
+export { type InferDerivations as $, type AnySystem as A, type BatchConfig as B, type ClauseResult as C, type DefinitionMeta as D, type EffectsDef as E, type FactPredicate as F, type CrossModuleEffectDef as G, type DiffRulesOptions as H, DirectiveError as I, type DistributableSnapshot as J, type DistributableSnapshotOptions as K, type DynamicConstraintDef as L, type ModuleSchema as M, type NamespacedSystem as N, type DynamicEffectDef as O, type Plugin as P, type DynamicResolverDef as Q, type RequirementWithId as R, type SchemaType as S, type TypedDerivationsDef as T, type EffectDef as U, type EventsDef as V, type FactTemplate as W, type FactsSnapshot as X, type HistoryAPI as Y, type HistoryOption as Z, type HistoryState as _, type Facts as a, type CrossModuleDerivationFn as a$, type InferEvents as a0, type InferFacts as a1, type InferRequirementTypes as a2, type InferRequirements as a3, type InferSchemaType as a4, type InferSelectorState as a5, type KeySelector as a6, type LeafClause as a7, type MetaAccessor as a8, type MetaMatch as a9, type System as aA, type SystemConfig as aB, type SystemDerived as aC, type SystemFacts as aD, type SystemInspection as aE, type SystemMode as aF, type SystemSnapshot as aG, type TraceEntry as aH, type TypedConstraintDef as aI, type TypedResolverDef as aJ, diffClauses as aK, diffRules as aL, flattenPredicate as aM, isNamespacedSystem as aN, isSingleModuleSystem as aO, toRulesMap as aP, type FactsStore as aQ, type ConstraintState as aR, type ResolverStatus as aS, type FactChange as aT, type ReconcileResult as aU, type RecoveryStrategy as aV, type ErrorSource as aW, type RetryLaterConfig as aX, type BatchItemResult as aY, type BatchResolveResults as aZ, type ConstraintsControl as a_, type ObservationEvent as aa, type OperatorObject as ab, type PatchSpec as ac, type PatchValue as ad, type PayloadRef as ae, type PredicateClause as af, type PredicateCombinator as ag, type PredicateCombinatorKey as ah, type PredicateObject as ai, type PredicateOp as aj, type PredicateOverlapProof as ak, type ResolverAbortReason as al, type ResolverDef as am, type ResolversDef as an, type RetryPolicy as ao, type RulesDiffReport as ap, type RulesMapInput as aq, type Schema as ar, type SchemaTypedResolversDef as as, type ShouldRetryContext as at, type Snapshot as au, type SourceDef as av, type SourceDropReason as aw, type SourcePublish as ax, type SourceReportError as ay, type SourceUnsubscribe as az, type TypedEventsDef as b, type CrossModuleFactsWithSelf as b0, type DerivationKeys as b1, type DerivationReturnType as b2, type DerivationsControl as b3, type DerivationsSchema as b4, type DeriveAccessor as b5, type DispatchEventsFromSchema as b6, type EffectCleanup as b7, type EffectsControl as b8, type EventPayloadSchema as b9, type RequirementOutput$1 as bA, type EventsAccessor as ba, type EventsAccessorFromSchema as bb, type EventsSchema as bc, type FactKeys as bd, type FactReturnType as be, type FlexibleEventHandler as bf, type HistoryConfig as bg, type InferEventPayloadFromSchema as bh, type InferRequirementPayloadFromSchema as bi, type InferSchema as bj, type MutableNamespacedFacts as bk, type NamespacedDerivations as bl, type NamespacedEventsAccessor as bm, type NamespacedFacts as bn, type ObservableKeys as bo, type RequirementExplanation as bp, type RequirementOutput as bq, type RequirementPayloadSchema$1 as br, type RequirementsSchema as bs, type ResolverContext as bt, type ResolversControl as bu, type SnapshotMeta as bv, type SystemEvent as bw, type TraceConfig as bx, type TypedResolverContext as by, type UnionEvents as bz, type SourcesDef as c, type TypedConstraintsDef as d, type TypedResolversDef as e, type ModuleHooks as f, type CrossModuleDeps as g, type CrossModuleDerivationsDef as h, type CrossModuleEffectsDef as i, type CrossModuleConstraintsDef as j, type ModuleDef as k, type CreateSystemOptionsSingle as l, type SingleModuleSystem as m, type ModulesMap as n, type CreateSystemOptionsNamed as o, type TraceOption as p, type ErrorBoundaryConfig as q, type Requirement as r, type RequirementKeyFn as s, type Change as t, type ChangeKind as u, type ConstraintDef as v, type ConstraintDiff as w, type ConstraintStatus as x, type ConstraintsDef as y, type CrossModuleConstraintDef as z };

package/dist/{predicate-DYb-3Mvl.d.cts → predicate-CU0YC1i6.d.cts}

@@ -1,4 +1,4 @@
-import { ah as Schema, a as Facts, F as FactPredicate, b4 as InferSchema, L as FactTemplate, D as DefinitionMeta, r as Requirement, bl as RequirementOutput, ag as RetryPolicy, B as BatchConfig, be as ResolverContext, ad as PredicateOp, a6 as PatchSpec, C as ClauseResult } from './plugins-5Supk7it.cjs';
+import { ar as Schema, a as Facts, F as FactPredicate, bj as InferSchema, W as FactTemplate, D as DefinitionMeta, r as Requirement, bA as RequirementOutput, ao as RetryPolicy, B as BatchConfig, bt as ResolverContext, aj as PredicateOp, ac as PatchSpec, C as ClauseResult } from './plugins-CaPMTICa.cjs';
 
 /**
  * Derivation Types - Type definitions for derivations

package/dist/{predicate-C9oMO_ny.d.ts → predicate-CgpwJqf4.d.ts}

@@ -1,4 +1,4 @@
-import { ah as Schema, a as Facts, F as FactPredicate, b4 as InferSchema, L as FactTemplate, D as DefinitionMeta, r as Requirement, bl as RequirementOutput, ag as RetryPolicy, B as BatchConfig, be as ResolverContext, ad as PredicateOp, a6 as PatchSpec, C as ClauseResult } from './plugins-5Supk7it.js';
+import { ar as Schema, a as Facts, F as FactPredicate, bj as InferSchema, W as FactTemplate, D as DefinitionMeta, r as Requirement, bA as RequirementOutput, ao as RetryPolicy, B as BatchConfig, bt as ResolverContext, aj as PredicateOp, ac as PatchSpec, C as ClauseResult } from './plugins-CaPMTICa.js';
 
 /**
  * Derivation Types - Type definitions for derivations

package/dist/system-T6EZ6EYN.js

@@ -0,0 +1,2 @@
+export{a as createSystem}from'./chunk-SERVIHA3.js';import'./chunk-C3FW27S5.js';import'./chunk-LN5H74CU.js';import'./chunk-WD47DB52.js';import'./chunk-IZNOPHPL.js';//# sourceMappingURL=system-T6EZ6EYN.js.map
+//# sourceMappingURL=system-T6EZ6EYN.js.map

package/dist/{system-6YWCXQOQ.js.map → system-T6EZ6EYN.js.map}

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"system-6YWCXQOQ.js"}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"system-T6EZ6EYN.js"}

package/dist/system-V7B4YUIR.cjs

@@ -0,0 +1,2 @@
+'use strict';var chunkUDSP7U54_cjs=require('./chunk-UDSP7U54.cjs');require('./chunk-WU4AXN3P.cjs'),require('./chunk-S6W6Y44G.cjs'),require('./chunk-RD2HO5NZ.cjs'),require('./chunk-PTT4MWNL.cjs');Object.defineProperty(exports,"createSystem",{enumerable:true,get:function(){return chunkUDSP7U54_cjs.a}});//# sourceMappingURL=system-V7B4YUIR.cjs.map
+//# sourceMappingURL=system-V7B4YUIR.cjs.map

package/dist/{system-5FKUBLLV.cjs.map → system-V7B4YUIR.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"system-5FKUBLLV.cjs"}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"system-V7B4YUIR.cjs"}

package/dist/testing.cjs

@@ -1,2 +1,2 @@
-'use strict';var chunkOAPD3HIG_cjs=require('./chunk-OAPD3HIG.cjs');require('./chunk-QTY2FXZY.cjs'),require('./chunk-GACC2DMS.cjs'),require('./chunk-GKMJ7NMP.cjs'),require('./chunk-GBCWXTXW.cjs');async function R(){for(let e=0;e<10;e++)await Promise.resolve();}async function T(){for(let e=0;e<10;e++)await Promise.resolve();await new Promise(e=>setTimeout(e,0));for(let e=0;e<10;e++)await Promise.resolve();await new Promise(e=>setTimeout(e,0));for(let e=0;e<10;e++)await Promise.resolve();}async function D(e,s,r={}){let{totalTime:o=5e3,stepSize:c=10,maxIterations:l=1e3}=r,m=0,d=0;for(;m<o&&d<l;){if(await R(),e.inspect().inflight.length===0){await R();return}s(c),m+=c,d++;}let v=e.inspect();if(v.inflight.length>0){let f=v.inflight.map(p=>p.resolverId).join(", ");throw new Error(`[Directive] settleWithFakeTimers did not settle after ${o}ms. ${v.inflight.length} resolvers still inflight: ${f}`)}}function C(){let e=0,s=[];return {async advance(r){let o=e+r;for(;s.length>0&&s[0].time<=o;){let c=s.shift();e=c.time,c.callback(),await Promise.resolve();}e=o;},async next(){if(s.length===0)return;let r=s.shift();e=r.time,r.callback(),await Promise.resolve();},async runAll(){for(;s.length>0;)await this.next();},now(){return e},reset(){e=0,s.length=0;}}}function b(e){let s=typeof e=="string"?{requirement:(o=>o.type===e)}:e,r=s.calls??[];return {requirement:s.requirement??(o=>true),async resolve(o,c){if(r.push(o),s.delay&&await new Promise(l=>setTimeout(l,s.delay)),s.error)throw typeof s.error=="string"?new Error(s.error):s.error;s.resolve&&await s.resolve(o,c);}}}function E(e){let s=[],r=[];return {...{get calls(){return s},get pending(){return r},resolve(l){let m=r.shift();m&&m.resolve(l);},reject(l){let m=r.shift();m&&m.reject(l);},resolveAll(l){for(;r.length>0;)this.resolve(l);},rejectAll(l){for(;r.length>0;)this.reject(l);},reset(){s.length=0,r.length=0;}},handler:(l,m)=>(s.push(l),new Promise((d,v)=>{r.push({requirement:l,resolve:f=>d(f),reject:v});}))}}function P(e){return "module"in e?x(e):M(e)}function x(e){let s=[],r=new Map,o=[],c=[],l={};if(e.mocks?.resolvers)for(let[i,t]of Object.entries(e.mocks.resolvers)){let n=[];r.set(i,n),l[i]=b({...t,calls:n});}let m={...e.module,resolvers:{...e.module.resolvers,...l}},v=chunkOAPD3HIG_cjs.a({...e,module:m,plugins:[{name:"__test-tracking__",onFactSet:(i,t,n)=>{c.push({key:i,fullKey:i,namespace:void 0,previousValue:n,newValue:t,timestamp:Date.now()});},onRequirementCreated:i=>{o.push(i);}},...e.plugins??[]]}),f=v.dispatch.bind(v);return v.dispatch=i=>{s.push(i),f(i);},{...v,eventHistory:s,resolverCalls:r,get allRequirements(){return o},getFactsHistory(){return [...c]},resetFactsHistory(){c.length=0;},async waitForIdle(i=5e3){let t=Date.now(),n=async()=>{await new Promise(u=>setTimeout(u,0));let a=v.inspect();if(a.inflight.length>0){if(Date.now()-t>i){let u=a.inflight.map(g=>g.id).join(", ");throw new Error(`[Directive] waitForIdle timed out after ${i}ms. ${a.inflight.length} resolvers still inflight: ${u}`)}return await new Promise(u=>setTimeout(u,10)),n()}};return n()},assertRequirement(i){if(!o.some(n=>n.requirement.type===i))throw new Error(`[Directive] Expected requirement of type "${i}" but none found`)},assertResolverCalled(i,t){let n=r.get(i)??[];if(t!==void 0){if(n.length!==t)throw new Error(`[Directive] Expected resolver "${i}" to be called ${t} times but was called ${n.length} times`)}else if(n.length===0)throw new Error(`[Directive] Expected resolver "${i}" to be called but it was not`)},assertFactSet(i,t){let n=c.filter(a=>a.key===i);if(n.length===0)throw new Error(`[Directive] Expected fact "${i}" to be set but it was not`);if(t!==void 0&&!n.some(u=>u.newValue===t)){let u=n.map(g=>JSON.stringify(g.newValue)).join(", ");throw new Error(`[Directive] Expected fact "${i}" to be set to ${JSON.stringify(t)} but got: ${u}`)}},assertFactChanges(i,t){let n=c.filter(a=>a.key===i);if(n.length!==t)throw new Error(`[Directive] Expected fact "${i}" to change ${t} times but it changed ${n.length} times`)}}}function M(e){let s=[],r=new Map,o=[],c=[],l={};if(e.mocks?.resolvers)for(let[t,n]of Object.entries(e.mocks.resolvers)){let a=[];r.set(t,a),l[t]=b({...n,calls:a});}let m={};for(let[t,n]of Object.entries(e.modules))m[t]={...n,resolvers:{...n.resolvers,...l}};let d=new Set(Object.keys(e.modules)),f=chunkOAPD3HIG_cjs.a({...e,modules:m,plugins:[{name:"__test-tracking__",onFactSet:(t,n,a)=>{let g=t.indexOf("::"),y,h;if(g>0){let S=t.substring(0,g);d.has(S)?(y=S,h=t.substring(g+2)):h=t;}else h=t;c.push({key:h,fullKey:t,namespace:y,previousValue:a,newValue:n,timestamp:Date.now()});},onRequirementCreated:t=>{o.push(t);}},...e.plugins??[]]}),p=f.dispatch.bind(f);return f.dispatch=t=>{s.push(t),p(t);},{...f,eventHistory:s,resolverCalls:r,get allRequirements(){return o},getFactsHistory(){return [...c]},resetFactsHistory(){c.length=0;},async waitForIdle(t=5e3){let n=Date.now(),a=async()=>{await new Promise(g=>setTimeout(g,0));let u=f.inspect();if(u.inflight.length>0){if(Date.now()-n>t){let g=u.inflight.map(y=>y.id).join(", ");throw new Error(`[Directive] waitForIdle timed out after ${t}ms. ${u.inflight.length} resolvers still inflight: ${g}`)}return await new Promise(g=>setTimeout(g,10)),a()}};return a()},assertRequirement(t){if(!o.some(a=>a.requirement.type===t))throw new Error(`[Directive] Expected requirement of type "${t}" but none found`)},assertResolverCalled(t,n){let a=r.get(t)??[];if(n!==void 0){if(a.length!==n)throw new Error(`[Directive] Expected resolver "${t}" to be called ${n} times but was called ${a.length} times`)}else if(a.length===0)throw new Error(`[Directive] Expected resolver "${t}" to be called but it was not`)},assertFactSet(t,n){let a=c.filter(u=>u.key===t);if(a.length===0)throw new Error(`[Directive] Expected fact "${t}" to be set but it was not`);if(n!==void 0&&!a.some(g=>g.newValue===n)){let g=a.map(y=>JSON.stringify(y.newValue)).join(", ");throw new Error(`[Directive] Expected fact "${t}" to be set to ${JSON.stringify(n)} but got: ${g}`)}},assertFactChanges(t,n){let a=c.filter(u=>u.key===t);if(a.length!==n)throw new Error(`[Directive] Expected fact "${t}" to change ${n} times but it changed ${a.length} times`)}}}function O(e,s,r){if(!k(e,s,r))throw new Error(`[Directive] Expected ${s} "${r}" to be dynamic, but it is not.`)}function $(e,s,r){if(k(e,s,r))throw new Error(`[Directive] Expected ${s} "${r}" to NOT be dynamic, but it is.`)}function k(e,s,r){switch(s){case "constraint":return e.constraints.isDynamic(r);case "resolver":return e.resolvers.isDynamic(r);case "derivation":return e.derive.isDynamic(r);case "effect":return e.effects.isDynamic(r)}}function F(e){let s=new Set,r=new Set,o=new Set,c=new Set,l=null;return {async run(m){l=e.observe(d=>{switch(d.type){case "constraint.evaluate":d.active&&s.add(d.id);break;case "resolver.start":r.add(d.resolver);break;case "effect.run":o.add(d.id);break;case "derivation.compute":c.add(d.id);break}});try{await m();}finally{l?.(),l=null;}},report(){let m=e.inspect(),d=new Set(m.constraints.map(i=>i.id)),v=new Set(m.resolverDefs.map(i=>i.id)),f=new Set;for(let i of d)s.has(i)||f.add(i);let p=new Set;for(let i of v)r.has(i)||p.add(i);return {constraintsHit:s,constraintsMissed:f,resolversRun:r,resolversMissed:p,effectsRun:o,derivationsComputed:c,constraintCoverage:d.size===0?1:s.size/d.size,resolverCoverage:v.size===0?1:r.size/v.size,effectCoverage:m.effects.length===0?1:o.size/m.effects.length,derivationCoverage:m.derivations.length===0?1:c.size/m.derivations.length}}}}function I(e){let s=[],r=e.observe(o=>s.push(o));return {events:s,ofType(o){return s.filter(c=>c.type===o)},clear(){s.length=0;},dispose(){r();}}}exports.assertDynamic=O;exports.assertNotDynamic=$;exports.createCoverageTracker=F;exports.createFakeTimers=C;exports.createMockResolver=b;exports.createTestObserver=I;exports.createTestSystem=P;exports.flushAsync=T;exports.flushMicrotasks=R;exports.mockResolver=E;exports.settleWithFakeTimers=D;//# sourceMappingURL=testing.cjs.map
+'use strict';var chunkUDSP7U54_cjs=require('./chunk-UDSP7U54.cjs');require('./chunk-WU4AXN3P.cjs'),require('./chunk-S6W6Y44G.cjs'),require('./chunk-RD2HO5NZ.cjs'),require('./chunk-PTT4MWNL.cjs');async function R(){for(let e=0;e<10;e++)await Promise.resolve();}async function T(){for(let e=0;e<10;e++)await Promise.resolve();await new Promise(e=>setTimeout(e,0));for(let e=0;e<10;e++)await Promise.resolve();await new Promise(e=>setTimeout(e,0));for(let e=0;e<10;e++)await Promise.resolve();}async function D(e,s,r={}){let{totalTime:o=5e3,stepSize:c=10,maxIterations:l=1e3}=r,m=0,d=0;for(;m<o&&d<l;){if(await R(),e.inspect().inflight.length===0){await R();return}s(c),m+=c,d++;}let v=e.inspect();if(v.inflight.length>0){let f=v.inflight.map(p=>p.resolverId).join(", ");throw new Error(`[Directive] settleWithFakeTimers did not settle after ${o}ms. ${v.inflight.length} resolvers still inflight: ${f}`)}}function C(){let e=0,s=[];return {async advance(r){let o=e+r;for(;s.length>0&&s[0].time<=o;){let c=s.shift();e=c.time,c.callback(),await Promise.resolve();}e=o;},async next(){if(s.length===0)return;let r=s.shift();e=r.time,r.callback(),await Promise.resolve();},async runAll(){for(;s.length>0;)await this.next();},now(){return e},reset(){e=0,s.length=0;}}}function b(e){let s=typeof e=="string"?{requirement:(o=>o.type===e)}:e,r=s.calls??[];return {requirement:s.requirement??(o=>true),async resolve(o,c){if(r.push(o),s.delay&&await new Promise(l=>setTimeout(l,s.delay)),s.error)throw typeof s.error=="string"?new Error(s.error):s.error;s.resolve&&await s.resolve(o,c);}}}function E(e){let s=[],r=[];return {...{get calls(){return s},get pending(){return r},resolve(l){let m=r.shift();m&&m.resolve(l);},reject(l){let m=r.shift();m&&m.reject(l);},resolveAll(l){for(;r.length>0;)this.resolve(l);},rejectAll(l){for(;r.length>0;)this.reject(l);},reset(){s.length=0,r.length=0;}},handler:(l,m)=>(s.push(l),new Promise((d,v)=>{r.push({requirement:l,resolve:f=>d(f),reject:v});}))}}function P(e){return "module"in e?x(e):M(e)}function x(e){let s=[],r=new Map,o=[],c=[],l={};if(e.mocks?.resolvers)for(let[i,t]of Object.entries(e.mocks.resolvers)){let n=[];r.set(i,n),l[i]=b({...t,calls:n});}let m={...e.module,resolvers:{...e.module.resolvers,...l}},v=chunkUDSP7U54_cjs.a({...e,module:m,plugins:[{name:"__test-tracking__",onFactSet:(i,t,n)=>{c.push({key:i,fullKey:i,namespace:void 0,previousValue:n,newValue:t,timestamp:Date.now()});},onRequirementCreated:i=>{o.push(i);}},...e.plugins??[]]}),f=v.dispatch.bind(v);return v.dispatch=i=>{s.push(i),f(i);},{...v,eventHistory:s,resolverCalls:r,get allRequirements(){return o},getFactsHistory(){return [...c]},resetFactsHistory(){c.length=0;},async waitForIdle(i=5e3){let t=Date.now(),n=async()=>{await new Promise(u=>setTimeout(u,0));let a=v.inspect();if(a.inflight.length>0){if(Date.now()-t>i){let u=a.inflight.map(g=>g.id).join(", ");throw new Error(`[Directive] waitForIdle timed out after ${i}ms. ${a.inflight.length} resolvers still inflight: ${u}`)}return await new Promise(u=>setTimeout(u,10)),n()}};return n()},assertRequirement(i){if(!o.some(n=>n.requirement.type===i))throw new Error(`[Directive] Expected requirement of type "${i}" but none found`)},assertResolverCalled(i,t){let n=r.get(i)??[];if(t!==void 0){if(n.length!==t)throw new Error(`[Directive] Expected resolver "${i}" to be called ${t} times but was called ${n.length} times`)}else if(n.length===0)throw new Error(`[Directive] Expected resolver "${i}" to be called but it was not`)},assertFactSet(i,t){let n=c.filter(a=>a.key===i);if(n.length===0)throw new Error(`[Directive] Expected fact "${i}" to be set but it was not`);if(t!==void 0&&!n.some(u=>u.newValue===t)){let u=n.map(g=>JSON.stringify(g.newValue)).join(", ");throw new Error(`[Directive] Expected fact "${i}" to be set to ${JSON.stringify(t)} but got: ${u}`)}},assertFactChanges(i,t){let n=c.filter(a=>a.key===i);if(n.length!==t)throw new Error(`[Directive] Expected fact "${i}" to change ${t} times but it changed ${n.length} times`)}}}function M(e){let s=[],r=new Map,o=[],c=[],l={};if(e.mocks?.resolvers)for(let[t,n]of Object.entries(e.mocks.resolvers)){let a=[];r.set(t,a),l[t]=b({...n,calls:a});}let m={};for(let[t,n]of Object.entries(e.modules))m[t]={...n,resolvers:{...n.resolvers,...l}};let d=new Set(Object.keys(e.modules)),f=chunkUDSP7U54_cjs.a({...e,modules:m,plugins:[{name:"__test-tracking__",onFactSet:(t,n,a)=>{let g=t.indexOf("::"),y,h;if(g>0){let S=t.substring(0,g);d.has(S)?(y=S,h=t.substring(g+2)):h=t;}else h=t;c.push({key:h,fullKey:t,namespace:y,previousValue:a,newValue:n,timestamp:Date.now()});},onRequirementCreated:t=>{o.push(t);}},...e.plugins??[]]}),p=f.dispatch.bind(f);return f.dispatch=t=>{s.push(t),p(t);},{...f,eventHistory:s,resolverCalls:r,get allRequirements(){return o},getFactsHistory(){return [...c]},resetFactsHistory(){c.length=0;},async waitForIdle(t=5e3){let n=Date.now(),a=async()=>{await new Promise(g=>setTimeout(g,0));let u=f.inspect();if(u.inflight.length>0){if(Date.now()-n>t){let g=u.inflight.map(y=>y.id).join(", ");throw new Error(`[Directive] waitForIdle timed out after ${t}ms. ${u.inflight.length} resolvers still inflight: ${g}`)}return await new Promise(g=>setTimeout(g,10)),a()}};return a()},assertRequirement(t){if(!o.some(a=>a.requirement.type===t))throw new Error(`[Directive] Expected requirement of type "${t}" but none found`)},assertResolverCalled(t,n){let a=r.get(t)??[];if(n!==void 0){if(a.length!==n)throw new Error(`[Directive] Expected resolver "${t}" to be called ${n} times but was called ${a.length} times`)}else if(a.length===0)throw new Error(`[Directive] Expected resolver "${t}" to be called but it was not`)},assertFactSet(t,n){let a=c.filter(u=>u.key===t);if(a.length===0)throw new Error(`[Directive] Expected fact "${t}" to be set but it was not`);if(n!==void 0&&!a.some(g=>g.newValue===n)){let g=a.map(y=>JSON.stringify(y.newValue)).join(", ");throw new Error(`[Directive] Expected fact "${t}" to be set to ${JSON.stringify(n)} but got: ${g}`)}},assertFactChanges(t,n){let a=c.filter(u=>u.key===t);if(a.length!==n)throw new Error(`[Directive] Expected fact "${t}" to change ${n} times but it changed ${a.length} times`)}}}function O(e,s,r){if(!k(e,s,r))throw new Error(`[Directive] Expected ${s} "${r}" to be dynamic, but it is not.`)}function $(e,s,r){if(k(e,s,r))throw new Error(`[Directive] Expected ${s} "${r}" to NOT be dynamic, but it is.`)}function k(e,s,r){switch(s){case "constraint":return e.constraints.isDynamic(r);case "resolver":return e.resolvers.isDynamic(r);case "derivation":return e.derive.isDynamic(r);case "effect":return e.effects.isDynamic(r)}}function F(e){let s=new Set,r=new Set,o=new Set,c=new Set,l=null;return {async run(m){l=e.observe(d=>{switch(d.type){case "constraint.evaluate":d.active&&s.add(d.id);break;case "resolver.start":r.add(d.resolver);break;case "effect.run":o.add(d.id);break;case "derivation.compute":c.add(d.id);break}});try{await m();}finally{l?.(),l=null;}},report(){let m=e.inspect(),d=new Set(m.constraints.map(i=>i.id)),v=new Set(m.resolverDefs.map(i=>i.id)),f=new Set;for(let i of d)s.has(i)||f.add(i);let p=new Set;for(let i of v)r.has(i)||p.add(i);return {constraintsHit:s,constraintsMissed:f,resolversRun:r,resolversMissed:p,effectsRun:o,derivationsComputed:c,constraintCoverage:d.size===0?1:s.size/d.size,resolverCoverage:v.size===0?1:r.size/v.size,effectCoverage:m.effects.length===0?1:o.size/m.effects.length,derivationCoverage:m.derivations.length===0?1:c.size/m.derivations.length}}}}function I(e){let s=[],r=e.observe(o=>s.push(o));return {events:s,ofType(o){return s.filter(c=>c.type===o)},clear(){s.length=0;},dispose(){r();}}}exports.assertDynamic=O;exports.assertNotDynamic=$;exports.createCoverageTracker=F;exports.createFakeTimers=C;exports.createMockResolver=b;exports.createTestObserver=I;exports.createTestSystem=P;exports.flushAsync=T;exports.flushMicrotasks=R;exports.mockResolver=E;exports.settleWithFakeTimers=D;//# sourceMappingURL=testing.cjs.map
 //# sourceMappingURL=testing.cjs.map