@graphrefly/ts 0.0.0 → 0.0.2

package/dist/{reactive-map-BcB4KsQR.d.ts → reactive-map-C_8sOfdS.d.cts}

@@ -1,5 +1,6 @@
-import { N as Node } from './types-h12mNYbq.js';
-import { J as CollectionCoreOptions, s as ReactiveOpt, L as ListChange, V as ViewCachePolicy, c as LogChange, t as ReactiveView, u as RetentionPolicy, M as MapChange } from './reactive-collection-Cb1II1Fi.js';
+import { N as Node } from './types-BS6CyR-x.cjs';
+import { R as ReactiveOpt, V as ViewCachePolicy, a as RetentionPolicy } from './types-XDoqxYO9.cjs';
+import { F as CollectionCoreOptions, L as ListChange, c as LogChange, s as ReactiveView, M as MapChange } from './reactive-collection-B9R0Bl1P.cjs';
 
 /**
  * Reactive positional list (CSP-2.8, D54/D60) — the two-port collection template.
@@ -7,7 +8,7 @@ import { J as CollectionCoreOptions, s as ReactiveOpt, L as ListChange, V as Vie
  * Shape (D60 + review #2): a mutable array BACKEND (the single materialized state) + the shared
  * {@link collectionCore} two ports — a DELTA stream ({@link ReactiveList.delta}, one event per
  * mutation, O(1)) and a lazy pull SNAPSHOT ({@link ReactiveList.snapshot}, materialized only on a
- * cone-routed RESUME demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the
+ * cone-routed PULL demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the
  * external boundary, state-verb-legitimate, D4) + `appendFrom(src)` widening (an in-graph producer
  * drives the list with zero imperative glue). Synchronous quick-reads (`at`/`size`/`toArray`) are
  * the deliberately-non-reactive peek for cold/imperative reads (D60).
@@ -26,9 +27,9 @@ interface ReactiveListOptions extends CollectionCoreOptions {
 interface ReactiveList<T> {
     /** DELTA stream: one {@link ListChange} per mutation (O(1)). Subscribe to observe events. */
     readonly delta: Node<ListChange<T>>;
-    /** SNAPSHOT pull node: demand via `ctx.upNext([[RESUME, pullId]])` → one `readonly T[]` (lazy O(n)). */
+    /** SNAPSHOT pull node: demand via `ctx.upNext([["PULL", { pullId }]])` → one `readonly T[]` (lazy O(n)). */
     readonly snapshot: Node<readonly T[]>;
-    /** The snapshot node's pullId — write it verbatim into the demander's fn (D59). */
+    /** The snapshot node's pullId — write it verbatim into the demander's fn (D269). */
     readonly pullId: symbol;
     /** Current entry count (O(1), synchronous non-reactive read). */
     readonly size: number;
@@ -62,7 +63,7 @@ interface ReactiveList<T> {
  * list.delta.subscribe((m) => { if (m[0] === "DATA") console.log("Δ", m[1]); });
  * list.append(2);                 // delta: {kind:"append", value:2}
  * // demand the snapshot (a downstream consumer, holding `list.snapshot` upstream, runs):
- * //   ctx.upNext([["RESUME", list.pullId]]);  → SNAPSHOT delivers [1, 2]
+ * //   ctx.upNext([["PULL", { pullId: list.pullId }]]);  → SNAPSHOT delivers [1, 2]
  * list.toArray();                 // [1, 2]   (synchronous non-reactive read)
  * ```
  */

package/dist/{reactive-map-D-g3dv8I.d.cts → reactive-map-jle5dnok.d.ts}

@@ -1,5 +1,6 @@
-import { N as Node } from './types-bNMSWKqF.cjs';
-import { J as CollectionCoreOptions, s as ReactiveOpt, L as ListChange, V as ViewCachePolicy, c as LogChange, t as ReactiveView, u as RetentionPolicy, M as MapChange } from './reactive-collection-BxBqtIOE.cjs';
+import { N as Node } from './types-C9NOgNJw.js';
+import { R as ReactiveOpt, V as ViewCachePolicy, a as RetentionPolicy } from './types-DL_05n2M.js';
+import { F as CollectionCoreOptions, L as ListChange, c as LogChange, s as ReactiveView, M as MapChange } from './reactive-collection-BXFrH0U2.js';
 
 /**
  * Reactive positional list (CSP-2.8, D54/D60) — the two-port collection template.
@@ -7,7 +8,7 @@ import { J as CollectionCoreOptions, s as ReactiveOpt, L as ListChange, V as Vie
  * Shape (D60 + review #2): a mutable array BACKEND (the single materialized state) + the shared
  * {@link collectionCore} two ports — a DELTA stream ({@link ReactiveList.delta}, one event per
  * mutation, O(1)) and a lazy pull SNAPSHOT ({@link ReactiveList.snapshot}, materialized only on a
- * cone-routed RESUME demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the
+ * cone-routed PULL demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the
  * external boundary, state-verb-legitimate, D4) + `appendFrom(src)` widening (an in-graph producer
  * drives the list with zero imperative glue). Synchronous quick-reads (`at`/`size`/`toArray`) are
  * the deliberately-non-reactive peek for cold/imperative reads (D60).
@@ -26,9 +27,9 @@ interface ReactiveListOptions extends CollectionCoreOptions {
 interface ReactiveList<T> {
     /** DELTA stream: one {@link ListChange} per mutation (O(1)). Subscribe to observe events. */
     readonly delta: Node<ListChange<T>>;
-    /** SNAPSHOT pull node: demand via `ctx.upNext([[RESUME, pullId]])` → one `readonly T[]` (lazy O(n)). */
+    /** SNAPSHOT pull node: demand via `ctx.upNext([["PULL", { pullId }]])` → one `readonly T[]` (lazy O(n)). */
     readonly snapshot: Node<readonly T[]>;
-    /** The snapshot node's pullId — write it verbatim into the demander's fn (D59). */
+    /** The snapshot node's pullId — write it verbatim into the demander's fn (D269). */
     readonly pullId: symbol;
     /** Current entry count (O(1), synchronous non-reactive read). */
     readonly size: number;
@@ -62,7 +63,7 @@ interface ReactiveList<T> {
  * list.delta.subscribe((m) => { if (m[0] === "DATA") console.log("Δ", m[1]); });
  * list.append(2);                 // delta: {kind:"append", value:2}
  * // demand the snapshot (a downstream consumer, holding `list.snapshot` upstream, runs):
- * //   ctx.upNext([["RESUME", list.pullId]]);  → SNAPSHOT delivers [1, 2]
+ * //   ctx.upNext([["PULL", { pullId: list.pullId }]]);  → SNAPSHOT delivers [1, 2]
  * list.toArray();                 // [1, 2]   (synchronous non-reactive read)
  * ```
  */

package/dist/render/index.d.cts

@@ -1,6 +1,6 @@
-import { c as DescribeSnapshot } from '../describe-Ciu8SUnN.cjs';
-import '../types-bNMSWKqF.cjs';
-import '../messages-BZqrGGm1.cjs';
+import { c as DescribeSnapshot } from '../describe-CQRrkv-Q.cjs';
+import '../types-BS6CyR-x.cjs';
+import '../messages-CAzUPPJM.cjs';
 
 /**
  * Pure renderers over `DescribeSnapshot` (D39 / D40 tail).

package/dist/render/index.d.ts

@@ -1,6 +1,6 @@
-import { c as DescribeSnapshot } from '../describe-BZb7AS2y.js';
-import '../types-h12mNYbq.js';
-import '../messages-BZqrGGm1.js';
+import { c as DescribeSnapshot } from '../describe-B_A5fbXH.js';
+import '../types-C9NOgNJw.js';
+import '../messages-CAzUPPJM.js';
 
 /**
  * Pure renderers over `DescribeSnapshot` (D39 / D40 tail).

package/dist/render/index.js

@@ -8,6 +8,7 @@ import {
   describeToPretty,
   mermaidLiveUrl
 } from "../chunk-HDRL4VQQ.js";
+import "../chunk-DGUM43GV.js";
 export {
   describeToAscii,
   describeToD2,

package/dist/scheduled-readiness-5rwQlyjV.d.ts

@@ -0,0 +1,91 @@
+import { DataIssue } from './data/index.js';
+import { d as Graph } from './graph-ho5sotHP.js';
+import { N as Node } from './types-C9NOgNJw.js';
+import { S as SourceRef, a as AgentRuntimeAuditRecord } from './agent-runtime-types-core-hU299uIC.js';
+
+interface ScheduledReadinessRequested {
+    readonly kind: "scheduled-readiness-requested";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly reason?: string;
+    readonly policyRefs?: readonly SourceRef[];
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessClock {
+    readonly kind: "scheduled-readiness-clock";
+    readonly clockId: string;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessPending {
+    readonly kind: "scheduled-readiness-pending";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly nowMs?: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessReady {
+    readonly kind: "scheduled-readiness-ready";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessOverdue {
+    readonly kind: "scheduled-readiness-overdue";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs: number;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+type ScheduledReadinessStatusState = "pending" | "ready" | "overdue" | "issue";
+interface ScheduledReadinessStatus {
+    readonly kind: "scheduled-readiness-status";
+    readonly statusId: string;
+    readonly scheduleId: string;
+    readonly state: ScheduledReadinessStatusState;
+    readonly subjectRefs?: readonly SourceRef[];
+    readonly readyAtMs?: number;
+    readonly deadlineMs?: number;
+    readonly nowMs?: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly issueCodes?: readonly string[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessViews {
+    readonly schedulesById: ReadonlyMap<string, ScheduledReadinessRequested>;
+    readonly pendingById: ReadonlyMap<string, ScheduledReadinessPending>;
+    readonly readyById: ReadonlyMap<string, ScheduledReadinessReady>;
+    readonly overdueById: ReadonlyMap<string, ScheduledReadinessOverdue>;
+    readonly statusById: ReadonlyMap<string, ScheduledReadinessStatus>;
+    readonly nowMs?: number;
+}
+interface ScheduledReadinessBundle {
+    readonly pending: Node<ScheduledReadinessPending>;
+    readonly ready: Node<ScheduledReadinessReady>;
+    readonly overdue: Node<ScheduledReadinessOverdue>;
+    readonly status: Node<ScheduledReadinessStatus>;
+    readonly issues: Node<DataIssue>;
+    readonly audit: Node<AgentRuntimeAuditRecord>;
+    readonly views: Node<ScheduledReadinessViews>;
+}
+declare function scheduledReadinessProjector(graph: Graph, opts: {
+    readonly name?: string;
+    readonly schedules: readonly Node<ScheduledReadinessRequested>[];
+    readonly clocks?: readonly Node<ScheduledReadinessClock>[];
+}): ScheduledReadinessBundle;
+
+export { type ScheduledReadinessRequested as S, type ScheduledReadinessReady as a, type ScheduledReadinessOverdue as b, type ScheduledReadinessBundle as c, type ScheduledReadinessClock as d, type ScheduledReadinessPending as e, type ScheduledReadinessStatus as f, type ScheduledReadinessStatusState as g, type ScheduledReadinessViews as h, scheduledReadinessProjector as s };

package/dist/scheduled-readiness-DpRY8jI0.d.cts

@@ -0,0 +1,91 @@
+import { DataIssue } from './data/index.cjs';
+import { d as Graph } from './graph-CWK3HLPB.cjs';
+import { N as Node } from './types-BS6CyR-x.cjs';
+import { S as SourceRef, a as AgentRuntimeAuditRecord } from './agent-runtime-types-core-CaXfKNtY.cjs';
+
+interface ScheduledReadinessRequested {
+    readonly kind: "scheduled-readiness-requested";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly reason?: string;
+    readonly policyRefs?: readonly SourceRef[];
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessClock {
+    readonly kind: "scheduled-readiness-clock";
+    readonly clockId: string;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessPending {
+    readonly kind: "scheduled-readiness-pending";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly nowMs?: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessReady {
+    readonly kind: "scheduled-readiness-ready";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs?: number;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessOverdue {
+    readonly kind: "scheduled-readiness-overdue";
+    readonly scheduleId: string;
+    readonly subjectRefs: readonly SourceRef[];
+    readonly readyAtMs: number;
+    readonly deadlineMs: number;
+    readonly nowMs: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly metadata?: Record<string, unknown>;
+}
+type ScheduledReadinessStatusState = "pending" | "ready" | "overdue" | "issue";
+interface ScheduledReadinessStatus {
+    readonly kind: "scheduled-readiness-status";
+    readonly statusId: string;
+    readonly scheduleId: string;
+    readonly state: ScheduledReadinessStatusState;
+    readonly subjectRefs?: readonly SourceRef[];
+    readonly readyAtMs?: number;
+    readonly deadlineMs?: number;
+    readonly nowMs?: number;
+    readonly sourceRefs?: readonly SourceRef[];
+    readonly issueCodes?: readonly string[];
+    readonly metadata?: Record<string, unknown>;
+}
+interface ScheduledReadinessViews {
+    readonly schedulesById: ReadonlyMap<string, ScheduledReadinessRequested>;
+    readonly pendingById: ReadonlyMap<string, ScheduledReadinessPending>;
+    readonly readyById: ReadonlyMap<string, ScheduledReadinessReady>;
+    readonly overdueById: ReadonlyMap<string, ScheduledReadinessOverdue>;
+    readonly statusById: ReadonlyMap<string, ScheduledReadinessStatus>;
+    readonly nowMs?: number;
+}
+interface ScheduledReadinessBundle {
+    readonly pending: Node<ScheduledReadinessPending>;
+    readonly ready: Node<ScheduledReadinessReady>;
+    readonly overdue: Node<ScheduledReadinessOverdue>;
+    readonly status: Node<ScheduledReadinessStatus>;
+    readonly issues: Node<DataIssue>;
+    readonly audit: Node<AgentRuntimeAuditRecord>;
+    readonly views: Node<ScheduledReadinessViews>;
+}
+declare function scheduledReadinessProjector(graph: Graph, opts: {
+    readonly name?: string;
+    readonly schedules: readonly Node<ScheduledReadinessRequested>[];
+    readonly clocks?: readonly Node<ScheduledReadinessClock>[];
+}): ScheduledReadinessBundle;
+
+export { type ScheduledReadinessRequested as S, type ScheduledReadinessReady as a, type ScheduledReadinessOverdue as b, type ScheduledReadinessBundle as c, type ScheduledReadinessClock as d, type ScheduledReadinessPending as e, type ScheduledReadinessStatus as f, type ScheduledReadinessStatusState as g, type ScheduledReadinessViews as h, scheduledReadinessProjector as s };

package/dist/semantic-memory-graph-C2ZUwIlq.d.ts

@@ -0,0 +1,30 @@
+import { d as Graph } from './graph-ho5sotHP.js';
+import { k as KnowledgeGraphReducerBundleOptions, j as KnowledgeGraphReducerBundle, B as MemoryRetrievalBundleOptions, z as MemoryRetrievalBundle } from './semantic-memory-graph-types-Ci-OtahO.js';
+
+/**
+ * Graph-visible semantic-memory retrieval patterns.
+ *
+ * D158 allows horizontal semantic-memory patterns when they are ordinary graph
+ * nodes with declared deps and graph-visible facts. This file intentionally
+ * owns no storage restore/hydration, scheduler, hidden subscription, vector DB,
+ * retention loop, consolidation loop, Graph subclass, or protocol behavior.
+ */
+
+/**
+ * Build a graph-visible memory retrieval bundle from explicit fragment/query deps.
+ *
+ * Invalid fragments and ranking status are emitted as ordinary DATA facts. The
+ * bundle never owns storage restore or hidden mutation; callers that need
+ * persistence compose D161 collection/storage sidecars outside this pattern.
+ */
+declare function memoryRetrievalBundle<T = unknown>(graph: Graph, opts: MemoryRetrievalBundleOptions): MemoryRetrievalBundle<T>;
+/**
+ * D170 lower semantic-memory KG materializer.
+ *
+ * Assertion, entity, relation, and topic ids remain DATA keys. The bundle has
+ * static describe-visible topology and owns no storage, LLM extraction,
+ * scheduler, agent runtime, or dynamic graph node lifecycle.
+ */
+declare function knowledgeGraphReducerBundle(graph: Graph, opts: KnowledgeGraphReducerBundleOptions): KnowledgeGraphReducerBundle;
+
+export { knowledgeGraphReducerBundle as k, memoryRetrievalBundle as m };

package/dist/semantic-memory-graph-DlZBD_Eu.d.cts

@@ -0,0 +1,30 @@
+import { d as Graph } from './graph-CWK3HLPB.cjs';
+import { k as KnowledgeGraphReducerBundleOptions, j as KnowledgeGraphReducerBundle, B as MemoryRetrievalBundleOptions, z as MemoryRetrievalBundle } from './semantic-memory-graph-types-BvzdqmkY.cjs';
+
+/**
+ * Graph-visible semantic-memory retrieval patterns.
+ *
+ * D158 allows horizontal semantic-memory patterns when they are ordinary graph
+ * nodes with declared deps and graph-visible facts. This file intentionally
+ * owns no storage restore/hydration, scheduler, hidden subscription, vector DB,
+ * retention loop, consolidation loop, Graph subclass, or protocol behavior.
+ */
+
+/**
+ * Build a graph-visible memory retrieval bundle from explicit fragment/query deps.
+ *
+ * Invalid fragments and ranking status are emitted as ordinary DATA facts. The
+ * bundle never owns storage restore or hidden mutation; callers that need
+ * persistence compose D161 collection/storage sidecars outside this pattern.
+ */
+declare function memoryRetrievalBundle<T = unknown>(graph: Graph, opts: MemoryRetrievalBundleOptions): MemoryRetrievalBundle<T>;
+/**
+ * D170 lower semantic-memory KG materializer.
+ *
+ * Assertion, entity, relation, and topic ids remain DATA keys. The bundle has
+ * static describe-visible topology and owns no storage, LLM extraction,
+ * scheduler, agent runtime, or dynamic graph node lifecycle.
+ */
+declare function knowledgeGraphReducerBundle(graph: Graph, opts: KnowledgeGraphReducerBundleOptions): KnowledgeGraphReducerBundle;
+
+export { knowledgeGraphReducerBundle as k, memoryRetrievalBundle as m };

package/dist/{semantic-memory-graph-BYoIlP35.d.cts → semantic-memory-graph-types-BvzdqmkY.d.cts}

@@ -1,5 +1,4 @@
-import { d as Graph } from './graph-s23RbbFO.cjs';
-import { N as Node } from './types-bNMSWKqF.cjs';
+import { N as Node } from './types-BS6CyR-x.cjs';
 import { b as StrictJsonValue } from './codec-BB7p8fJc.cjs';
 
 /**
@@ -185,15 +184,6 @@ declare function admissionFilter3D(opts: AdmissionScore3DOptions): (raw: unknown
 /** Build a passive `{ shardBy, shardCount }` pair for tenant-isolated sharding. */
 declare function shardByTenant<T>(tenantOf: (fragment: MemoryFragment<T>) => string, opts?: ShardByTenantOptions): ShardByTenantConfig<T>;
 
-/**
- * Graph-visible semantic-memory retrieval patterns.
- *
- * D158 allows horizontal semantic-memory patterns when they are ordinary graph
- * nodes with declared deps and graph-visible facts. This file intentionally
- * owns no storage restore/hydration, scheduler, hidden subscription, vector DB,
- * retention loop, consolidation loop, Graph subclass, or protocol behavior.
- */
-
 /** Query shape for the first graph-visible retrieval bundle. */
 interface MemoryRetrievalQuery extends MemoryQuery {
     /** Optional dense embedding used only for deterministic in-memory ranking. */
@@ -336,21 +326,5 @@ interface MemoryRetrievalBundleOptions {
     readonly fragments: Node<readonly unknown[]>;
     readonly query: Node<MemoryRetrievalQuery>;
 }
-/**
- * Build a graph-visible memory retrieval bundle from explicit fragment/query deps.
- *
- * Invalid fragments and ranking status are emitted as ordinary DATA facts. The
- * bundle never owns storage restore or hidden mutation; callers that need
- * persistence compose D161 collection/storage sidecars outside this pattern.
- */
-declare function memoryRetrievalBundle<T = unknown>(graph: Graph, opts: MemoryRetrievalBundleOptions): MemoryRetrievalBundle<T>;
-/**
- * D170 lower semantic-memory KG materializer.
- *
- * Assertion, entity, relation, and topic ids remain DATA keys. The bundle has
- * static describe-visible topology and owns no storage, LLM extraction,
- * scheduler, agent runtime, or dynamic graph node lifecycle.
- */
-declare function knowledgeGraphReducerBundle(graph: Graph, opts: KnowledgeGraphReducerBundleOptions): KnowledgeGraphReducerBundle;
 
-export { type VectorSearchResult as $, type AdmissionFilter as A, type MemoryRetrievalBundle as B, type CollectionEntry as C, type DecayPolicy as D, type MemoryRetrievalBundleOptions as E, type FactId as F, type MemoryRetrievalCursor as G, type MemoryRetrievalError as H, type MemoryRetrievalErrorCode as I, type MemoryRetrievalFact as J, type KnowledgeAssertion as K, type MemoryRetrievalIndex as L, type MemoryAnswer as M, type MemoryRetrievalQuery as N, type MemoryRetrievalSnapshot as O, type MemoryRetrievalStatus as P, type MemoryRetrievalStatusState as Q, type OutcomeSignal as R, type RankedCollectionEntry as S, type RetrievalEntry as T, type RetrievalQuery as U, type RetrievalTrace as V, type ScoringPolicy as W, type ShardByTenantConfig as X, type ShardByTenantOptions as Y, type ShardKey as Z, type StoreReadHandle as _, type KnowledgeAssertionObject as a, admissionFilter3D as a0, admissionScored as a1, cosineSimilarity as a2, filterMemoryFragments as a3, isMemoryFragment as a4, memoryFragmentMatchesQuery as a5, memoryFragmentValidAt as a6, memoryRetrievalBundle as a7, shardByTenant as a8, validateMemoryFragment as a9, type KnowledgeAssertionStrictJsonValue as b, type KnowledgeAssertionSubject as c, type KnowledgeGraphCursor as d, type KnowledgeGraphEntity as e, type KnowledgeGraphError as f, type KnowledgeGraphErrorCode as g, type KnowledgeGraphIndex as h, type KnowledgeGraphPolicy as i, type KnowledgeGraphReducerBundle as j, type KnowledgeGraphReducerBundleOptions as k, type KnowledgeGraphRelation as l, type KnowledgeGraphSnapshot as m, type KnowledgeGraphStatus as n, type KnowledgeGraphStatusState as o, type KnowledgeGraphTopic as p, knowledgeGraphReducerBundle as q, type AdmissionScore3DOptions as r, type AdmissionScoredOptions as s, type AdmissionScores as t, type AdmissionThresholds as u, type CollectionScoreFn as v, type FactStore as w, type MemoryFragment as x, type MemoryFragmentValidation as y, type MemoryQuery as z };
+export { admissionFilter3D as $, type AdmissionFilter as A, type MemoryRetrievalBundleOptions as B, type CollectionEntry as C, type DecayPolicy as D, type MemoryRetrievalCursor as E, type FactId as F, type MemoryRetrievalError as G, type MemoryRetrievalErrorCode as H, type MemoryRetrievalFact as I, type MemoryRetrievalIndex as J, type KnowledgeAssertion as K, type MemoryRetrievalQuery as L, type MemoryAnswer as M, type MemoryRetrievalSnapshot as N, type MemoryRetrievalStatus as O, type MemoryRetrievalStatusState as P, type OutcomeSignal as Q, type RankedCollectionEntry as R, type RetrievalEntry as S, type RetrievalQuery as T, type RetrievalTrace as U, type ScoringPolicy as V, type ShardByTenantConfig as W, type ShardByTenantOptions as X, type ShardKey as Y, type StoreReadHandle as Z, type VectorSearchResult as _, type KnowledgeAssertionObject as a, admissionScored as a0, cosineSimilarity as a1, filterMemoryFragments as a2, isMemoryFragment as a3, memoryFragmentMatchesQuery as a4, memoryFragmentValidAt as a5, shardByTenant as a6, validateMemoryFragment as a7, type KnowledgeAssertionStrictJsonValue as b, type KnowledgeAssertionSubject as c, type KnowledgeGraphCursor as d, type KnowledgeGraphEntity as e, type KnowledgeGraphError as f, type KnowledgeGraphErrorCode as g, type KnowledgeGraphIndex as h, type KnowledgeGraphPolicy as i, type KnowledgeGraphReducerBundle as j, type KnowledgeGraphReducerBundleOptions as k, type KnowledgeGraphRelation as l, type KnowledgeGraphSnapshot as m, type KnowledgeGraphStatus as n, type KnowledgeGraphStatusState as o, type KnowledgeGraphTopic as p, type AdmissionScore3DOptions as q, type AdmissionScoredOptions as r, type AdmissionScores as s, type AdmissionThresholds as t, type CollectionScoreFn as u, type FactStore as v, type MemoryFragment as w, type MemoryFragmentValidation as x, type MemoryQuery as y, type MemoryRetrievalBundle as z };

package/dist/{semantic-memory-graph-CxyXLms3.d.ts → semantic-memory-graph-types-Ci-OtahO.d.ts}

@@ -1,5 +1,4 @@
-import { d as Graph } from './graph-DfdF9zy4.js';
-import { N as Node } from './types-h12mNYbq.js';
+import { N as Node } from './types-C9NOgNJw.js';
 import { b as StrictJsonValue } from './codec-BB7p8fJc.js';
 
 /**
@@ -185,15 +184,6 @@ declare function admissionFilter3D(opts: AdmissionScore3DOptions): (raw: unknown
 /** Build a passive `{ shardBy, shardCount }` pair for tenant-isolated sharding. */
 declare function shardByTenant<T>(tenantOf: (fragment: MemoryFragment<T>) => string, opts?: ShardByTenantOptions): ShardByTenantConfig<T>;
 
-/**
- * Graph-visible semantic-memory retrieval patterns.
- *
- * D158 allows horizontal semantic-memory patterns when they are ordinary graph
- * nodes with declared deps and graph-visible facts. This file intentionally
- * owns no storage restore/hydration, scheduler, hidden subscription, vector DB,
- * retention loop, consolidation loop, Graph subclass, or protocol behavior.
- */
-
 /** Query shape for the first graph-visible retrieval bundle. */
 interface MemoryRetrievalQuery extends MemoryQuery {
     /** Optional dense embedding used only for deterministic in-memory ranking. */
@@ -336,21 +326,5 @@ interface MemoryRetrievalBundleOptions {
     readonly fragments: Node<readonly unknown[]>;
     readonly query: Node<MemoryRetrievalQuery>;
 }
-/**
- * Build a graph-visible memory retrieval bundle from explicit fragment/query deps.
- *
- * Invalid fragments and ranking status are emitted as ordinary DATA facts. The
- * bundle never owns storage restore or hidden mutation; callers that need
- * persistence compose D161 collection/storage sidecars outside this pattern.
- */
-declare function memoryRetrievalBundle<T = unknown>(graph: Graph, opts: MemoryRetrievalBundleOptions): MemoryRetrievalBundle<T>;
-/**
- * D170 lower semantic-memory KG materializer.
- *
- * Assertion, entity, relation, and topic ids remain DATA keys. The bundle has
- * static describe-visible topology and owns no storage, LLM extraction,
- * scheduler, agent runtime, or dynamic graph node lifecycle.
- */
-declare function knowledgeGraphReducerBundle(graph: Graph, opts: KnowledgeGraphReducerBundleOptions): KnowledgeGraphReducerBundle;
 
-export { type VectorSearchResult as $, type AdmissionFilter as A, type MemoryRetrievalBundle as B, type CollectionEntry as C, type DecayPolicy as D, type MemoryRetrievalBundleOptions as E, type FactId as F, type MemoryRetrievalCursor as G, type MemoryRetrievalError as H, type MemoryRetrievalErrorCode as I, type MemoryRetrievalFact as J, type KnowledgeAssertion as K, type MemoryRetrievalIndex as L, type MemoryAnswer as M, type MemoryRetrievalQuery as N, type MemoryRetrievalSnapshot as O, type MemoryRetrievalStatus as P, type MemoryRetrievalStatusState as Q, type OutcomeSignal as R, type RankedCollectionEntry as S, type RetrievalEntry as T, type RetrievalQuery as U, type RetrievalTrace as V, type ScoringPolicy as W, type ShardByTenantConfig as X, type ShardByTenantOptions as Y, type ShardKey as Z, type StoreReadHandle as _, type KnowledgeAssertionObject as a, admissionFilter3D as a0, admissionScored as a1, cosineSimilarity as a2, filterMemoryFragments as a3, isMemoryFragment as a4, memoryFragmentMatchesQuery as a5, memoryFragmentValidAt as a6, memoryRetrievalBundle as a7, shardByTenant as a8, validateMemoryFragment as a9, type KnowledgeAssertionStrictJsonValue as b, type KnowledgeAssertionSubject as c, type KnowledgeGraphCursor as d, type KnowledgeGraphEntity as e, type KnowledgeGraphError as f, type KnowledgeGraphErrorCode as g, type KnowledgeGraphIndex as h, type KnowledgeGraphPolicy as i, type KnowledgeGraphReducerBundle as j, type KnowledgeGraphReducerBundleOptions as k, type KnowledgeGraphRelation as l, type KnowledgeGraphSnapshot as m, type KnowledgeGraphStatus as n, type KnowledgeGraphStatusState as o, type KnowledgeGraphTopic as p, knowledgeGraphReducerBundle as q, type AdmissionScore3DOptions as r, type AdmissionScoredOptions as s, type AdmissionScores as t, type AdmissionThresholds as u, type CollectionScoreFn as v, type FactStore as w, type MemoryFragment as x, type MemoryFragmentValidation as y, type MemoryQuery as z };
+export { admissionFilter3D as $, type AdmissionFilter as A, type MemoryRetrievalBundleOptions as B, type CollectionEntry as C, type DecayPolicy as D, type MemoryRetrievalCursor as E, type FactId as F, type MemoryRetrievalError as G, type MemoryRetrievalErrorCode as H, type MemoryRetrievalFact as I, type MemoryRetrievalIndex as J, type KnowledgeAssertion as K, type MemoryRetrievalQuery as L, type MemoryAnswer as M, type MemoryRetrievalSnapshot as N, type MemoryRetrievalStatus as O, type MemoryRetrievalStatusState as P, type OutcomeSignal as Q, type RankedCollectionEntry as R, type RetrievalEntry as S, type RetrievalQuery as T, type RetrievalTrace as U, type ScoringPolicy as V, type ShardByTenantConfig as W, type ShardByTenantOptions as X, type ShardKey as Y, type StoreReadHandle as Z, type VectorSearchResult as _, type KnowledgeAssertionObject as a, admissionScored as a0, cosineSimilarity as a1, filterMemoryFragments as a2, isMemoryFragment as a3, memoryFragmentMatchesQuery as a4, memoryFragmentValidAt as a5, shardByTenant as a6, validateMemoryFragment as a7, type KnowledgeAssertionStrictJsonValue as b, type KnowledgeAssertionSubject as c, type KnowledgeGraphCursor as d, type KnowledgeGraphEntity as e, type KnowledgeGraphError as f, type KnowledgeGraphErrorCode as g, type KnowledgeGraphIndex as h, type KnowledgeGraphPolicy as i, type KnowledgeGraphReducerBundle as j, type KnowledgeGraphReducerBundleOptions as k, type KnowledgeGraphRelation as l, type KnowledgeGraphSnapshot as m, type KnowledgeGraphStatus as n, type KnowledgeGraphStatusState as o, type KnowledgeGraphTopic as p, type AdmissionScore3DOptions as q, type AdmissionScoredOptions as r, type AdmissionScores as s, type AdmissionThresholds as t, type CollectionScoreFn as u, type FactStore as v, type MemoryFragment as w, type MemoryFragmentValidation as x, type MemoryQuery as y, type MemoryRetrievalBundle as z };