@nicia-ai/typegraph 0.37.0 → 0.38.0

package/dist/graph-merge/index.d.cts

@@ -1,15 +1,14 @@
-import { G as GraphDef, t as NodeKinds, u as GetNodeType } from '../manager-nU1vTJLy.cjs';
-import { S as Store, N as Node, U as UniqueIntrospection } from '../store-view-X96Rd00T.cjs';
-import { d as NodeId, N as NodeType, e as EdgeId, J as JsonValue, f as KindAnnotations, g as EdgeType, D as DeleteBehavior, T as TemporalMode, h as GraphExtensionVersion, i as ExtensionNodeDef, j as ExtensionEdgeDef, k as ExtensionOntologyRelation, l as ExtensionIndex } from '../extension-types-BM2ACfYO.cjs';
-import { T as TypeGraphError } from '../index-BPM59vsg.cjs';
+import { G as GraphDef, N as NodeKinds, c as GetNodeType } from '../define-graph-CzEvA_8F.cjs';
+import { a as Store, ar as Node, bO as UniqueIntrospection } from '../store-view-BoHqdHjB.cjs';
+import { m as NodeId, a as NodeType, g as EdgeId, J as JsonValue, l as KindAnnotations, d as EdgeType, D as DeleteBehavior, T as TemporalMode, k as GraphExtensionVersion, u as ExtensionNodeDef, v as ExtensionEdgeDef, w as ExtensionOntologyRelation, x as ExtensionIndex } from '../extension-types-BLEVH4SG.cjs';
+import { $ as TypeGraphError } from '../index-BihFPsPu.cjs';
 import { R as Result } from '../result-DWo6mUVz.cjs';
 export { i as isErr, a as isOk, u as unwrap } from '../result-DWo6mUVz.cjs';
-import { G as GraphBackend, M as MetaEdge, I as IndexDeclaration } from '../fulltext-strategy-C27vXaeB.cjs';
+import { G as GraphBackend, at as MetaEdge, I as IndexDeclaration } from '../index-CrFL_ENI.cjs';
 import { z } from 'zod';
-import '../materialize-indexes-CuR3gAZb.cjs';
-import 'drizzle-orm';
-import 'drizzle-orm/pg-core';
-import 'drizzle-orm/sqlite-core';
+import '../temporal-BC_NQV5Y.cjs';
+import '../manager-nCEJiYBb.cjs';
+import '../materialize-indexes-ExQ6OrAh.cjs';
 
 /**
  * Core type model for the graph-merge primitive.
@@ -837,48 +836,6 @@ type CandidatePair<K extends NodeType = NodeType> = Readonly<{
     right: Node<K>;
 }>;
 
-/**
- * `merge()` orchestrator (design §7.2, T11).
- *
- * Composes every phase built in T3–T10 into one DB-agnostic primitive:
- *
- *   1. PRECONDITION — compute the target's `base@V` and reject any branch whose
- *      `base` token does not match it (`BaseVersionMismatchError`). A branch
- *      forked from a divergent schema or base revision cannot be merged
- *      safely (design §5.2 / §13.6).
- *   2. STAGE — `stageBranches` (T7): the provenance-tagged UNION of every
- *      branch's state-diff against the immutable base.
- *   3. CANDIDATE-GEN — per resolved kind: build node-shaped objects from the
- *      staged NEW nodes, `blockNodes` (T5, folding in unique constraints from
- *      `introspect()`), `generateCandidates` (T6, fulltext Dice + custom; vector/
- *      hybrid guarded). Kinds NOT in `options.resolve` merge by id only.
- *   4. CLUSTER — `connectedComponents` (T8) over the accumulated candidate edges
- *      and every staged new-node id, with the optional diameter guard.
- *   5. CANONICALIZE — `canonicalizeCluster` (T8): min-id survivor + commutative
- *      property union under the stable, non-wall-clock conflict policy.
- *   6. DELETE/MODIFY — `resolveDeleteModify` (T8a): the authoritative final
- *      liveness of every inherited node + the delete/modify conflicts.
- *   7. TYPE-RECONCILE — `reconcileTypes` (T10) over the public-closure glue when
- *      `reconcileTypes: "ontology"`; otherwise a no-op.
- *   8. EDGE REPOINT — `repointEdges` (T9): repoint every staged edge onto its
- *      cluster canonical, drop edges to finally-deleted endpoints, dedupe + union
- *      edge props under the same conflict policy.
- *   9. COMMIT — apply everything to `target` (default = base store) in a single
- *      `store.transaction` when the backend is transactional, else non-atomically
- *      with a report warning (out of the P0 acceptance path — SQLite + Postgres
- *      are both transactional).
- *  10. REPORT — assemble the {@link MergeReport} with merged counts, every
- *      resolution / conflict / reconciliation / drop, and the in-memory
- *      {@link ProvenanceIndex}. With `persistProvenance`, ALSO upsert the
- *      `{branch, sourceId}` records to a sidecar provenance graph (post-commit,
- *      best-effort — a failure surfaces as a report warning, never a failed merge).
- *
- * DETERMINISM: every phase is order-independent (pure functions over the
- * unordered branch / staged sets, with a branch order captured ONCE for
- * conflict resolution), so shuffling `branches` yields a deep-equal report and an
- * identical committed graph. T12 proves this with a fast-check shuffle property.
- */
-
 /**
  * Merges a set of branches back into a target store (design §7.2).
  *
@@ -1084,44 +1041,6 @@ type ProvenanceQuery = Readonly<{
  */
 declare function readProvenance(store: Store<ProvenanceGraph>, query?: ProvenanceQuery): Promise<readonly ProvenanceNode[]>;
 
-/**
- * Candidate SOURCES (design §4 / §6.1) — the RECALL layer of candidate generation.
- *
- * Candidate generation is three layers — sources → scoring → reconciler (§4). This
- * module is the FIRST layer: each source PROPOSES candidates and decides nothing
- * about a fuzzy match. A source emits three things:
- *
- *   - `pairs`       — unscored `(a, b)` node pairs handed to the shared scoring
- *                     stage (`scoring.ts`), which makes every fuzzy match decision.
- *   - `forcedEdges` — DEFINITIONAL matches (a shared unique value) that bypass
- *                     scoring at {@link FORCED_MATCH_SCORE}.
- *   - `baseMembers` — committed base nodes the source pulled into scope, so the
- *                     reconciler can seed + canonicalize a base endpoint without
- *                     re-querying the backend. EMPTY for staged-only sources.
- *
- * Two sources ship here — today's two blocking strategies (`blocking.ts`),
- * refactored behind the source interface:
- *
- *   - {@link exactKeySource} (`exactKey`, §6.1) — the `block(node) => string`
- *     bucket: same-bucket node pairs become fuzzy `pairs`. Staged-vs-staged.
- *   - {@link uniqueSource} (`unique`, §6.1) — the unique-constraint signature
- *     buckets: every same-signature pair is a FORCED edge (a shared unique value
- *     is definitionally the same entity). Staged-vs-staged.
- *
- * Both read the SAME pre-computed `blockNodes` map off the scope (the UNION of the
- * `block()` key and the per-constraint signatures, `blocking.ts`), filtering it by
- * {@link isUniqueBucketKey}: `exactKey` owns the non-unique buckets, `unique` owns
- * the unique buckets. Sharing one blocked map (vs. re-blocking per source) keeps the
- * source split byte-identical to the old fused `generateCandidates` — a node with a
- * unique signature but no `block()` key lands ONLY in its unique bucket, never the
- * all-vs-all `unblocked` bucket.
- *
- * Determinism: the extraction visits buckets in sorted-key order over id-sorted
- * members and enumerates `i < j`, so proposals are emitted in a canonical order;
- * the scoring stage additionally dedups + sorts, so neither source's emission order
- * leaks into the merge result.
- */
-
 /**
  * A committed BASE node a source pulled into the cluster universe (design §4
  * member contribution / §6.4-D). It carries the same `(id, kind, props)` a staged

package/dist/graph-merge/index.d.ts

@@ -1,15 +1,14 @@
-import { G as GraphDef, t as NodeKinds, u as GetNodeType } from '../manager-D00_NXvT.js';
-import { S as Store, N as Node, U as UniqueIntrospection } from '../store-view-ANL6mTph.js';
-import { d as NodeId, N as NodeType, e as EdgeId, J as JsonValue, f as KindAnnotations, g as EdgeType, D as DeleteBehavior, T as TemporalMode, h as GraphExtensionVersion, i as ExtensionNodeDef, j as ExtensionEdgeDef, k as ExtensionOntologyRelation, l as ExtensionIndex } from '../extension-types-BM2ACfYO.js';
-import { T as TypeGraphError } from '../index-BeacbPoe.js';
+import { G as GraphDef, N as NodeKinds, c as GetNodeType } from '../define-graph-DRo9xpYN.js';
+import { a as Store, ar as Node, bO as UniqueIntrospection } from '../store-view-Ctq-3OHy.js';
+import { m as NodeId, a as NodeType, g as EdgeId, J as JsonValue, l as KindAnnotations, d as EdgeType, D as DeleteBehavior, T as TemporalMode, k as GraphExtensionVersion, u as ExtensionNodeDef, v as ExtensionEdgeDef, w as ExtensionOntologyRelation, x as ExtensionIndex } from '../extension-types-BLEVH4SG.js';
+import { $ as TypeGraphError } from '../index-BD_3TCgh.js';
 import { R as Result } from '../result-DWo6mUVz.js';
 export { i as isErr, a as isOk, u as unwrap } from '../result-DWo6mUVz.js';
-import { G as GraphBackend, M as MetaEdge, I as IndexDeclaration } from '../fulltext-strategy-DebsMrqg.js';
+import { G as GraphBackend, at as MetaEdge, I as IndexDeclaration } from '../index-Bq7vSPHy.js';
 import { z } from 'zod';
-import '../materialize-indexes-zK2J_flP.js';
-import 'drizzle-orm';
-import 'drizzle-orm/pg-core';
-import 'drizzle-orm/sqlite-core';
+import '../temporal-DqtOEo_B.js';
+import '../manager-CASfhmzV.js';
+import '../materialize-indexes-D4iei4Kp.js';
 
 /**
  * Core type model for the graph-merge primitive.
@@ -837,48 +836,6 @@ type CandidatePair<K extends NodeType = NodeType> = Readonly<{
     right: Node<K>;
 }>;
 
-/**
- * `merge()` orchestrator (design §7.2, T11).
- *
- * Composes every phase built in T3–T10 into one DB-agnostic primitive:
- *
- *   1. PRECONDITION — compute the target's `base@V` and reject any branch whose
- *      `base` token does not match it (`BaseVersionMismatchError`). A branch
- *      forked from a divergent schema or base revision cannot be merged
- *      safely (design §5.2 / §13.6).
- *   2. STAGE — `stageBranches` (T7): the provenance-tagged UNION of every
- *      branch's state-diff against the immutable base.
- *   3. CANDIDATE-GEN — per resolved kind: build node-shaped objects from the
- *      staged NEW nodes, `blockNodes` (T5, folding in unique constraints from
- *      `introspect()`), `generateCandidates` (T6, fulltext Dice + custom; vector/
- *      hybrid guarded). Kinds NOT in `options.resolve` merge by id only.
- *   4. CLUSTER — `connectedComponents` (T8) over the accumulated candidate edges
- *      and every staged new-node id, with the optional diameter guard.
- *   5. CANONICALIZE — `canonicalizeCluster` (T8): min-id survivor + commutative
- *      property union under the stable, non-wall-clock conflict policy.
- *   6. DELETE/MODIFY — `resolveDeleteModify` (T8a): the authoritative final
- *      liveness of every inherited node + the delete/modify conflicts.
- *   7. TYPE-RECONCILE — `reconcileTypes` (T10) over the public-closure glue when
- *      `reconcileTypes: "ontology"`; otherwise a no-op.
- *   8. EDGE REPOINT — `repointEdges` (T9): repoint every staged edge onto its
- *      cluster canonical, drop edges to finally-deleted endpoints, dedupe + union
- *      edge props under the same conflict policy.
- *   9. COMMIT — apply everything to `target` (default = base store) in a single
- *      `store.transaction` when the backend is transactional, else non-atomically
- *      with a report warning (out of the P0 acceptance path — SQLite + Postgres
- *      are both transactional).
- *  10. REPORT — assemble the {@link MergeReport} with merged counts, every
- *      resolution / conflict / reconciliation / drop, and the in-memory
- *      {@link ProvenanceIndex}. With `persistProvenance`, ALSO upsert the
- *      `{branch, sourceId}` records to a sidecar provenance graph (post-commit,
- *      best-effort — a failure surfaces as a report warning, never a failed merge).
- *
- * DETERMINISM: every phase is order-independent (pure functions over the
- * unordered branch / staged sets, with a branch order captured ONCE for
- * conflict resolution), so shuffling `branches` yields a deep-equal report and an
- * identical committed graph. T12 proves this with a fast-check shuffle property.
- */
-
 /**
  * Merges a set of branches back into a target store (design §7.2).
  *
@@ -1084,44 +1041,6 @@ type ProvenanceQuery = Readonly<{
  */
 declare function readProvenance(store: Store<ProvenanceGraph>, query?: ProvenanceQuery): Promise<readonly ProvenanceNode[]>;
 
-/**
- * Candidate SOURCES (design §4 / §6.1) — the RECALL layer of candidate generation.
- *
- * Candidate generation is three layers — sources → scoring → reconciler (§4). This
- * module is the FIRST layer: each source PROPOSES candidates and decides nothing
- * about a fuzzy match. A source emits three things:
- *
- *   - `pairs`       — unscored `(a, b)` node pairs handed to the shared scoring
- *                     stage (`scoring.ts`), which makes every fuzzy match decision.
- *   - `forcedEdges` — DEFINITIONAL matches (a shared unique value) that bypass
- *                     scoring at {@link FORCED_MATCH_SCORE}.
- *   - `baseMembers` — committed base nodes the source pulled into scope, so the
- *                     reconciler can seed + canonicalize a base endpoint without
- *                     re-querying the backend. EMPTY for staged-only sources.
- *
- * Two sources ship here — today's two blocking strategies (`blocking.ts`),
- * refactored behind the source interface:
- *
- *   - {@link exactKeySource} (`exactKey`, §6.1) — the `block(node) => string`
- *     bucket: same-bucket node pairs become fuzzy `pairs`. Staged-vs-staged.
- *   - {@link uniqueSource} (`unique`, §6.1) — the unique-constraint signature
- *     buckets: every same-signature pair is a FORCED edge (a shared unique value
- *     is definitionally the same entity). Staged-vs-staged.
- *
- * Both read the SAME pre-computed `blockNodes` map off the scope (the UNION of the
- * `block()` key and the per-constraint signatures, `blocking.ts`), filtering it by
- * {@link isUniqueBucketKey}: `exactKey` owns the non-unique buckets, `unique` owns
- * the unique buckets. Sharing one blocked map (vs. re-blocking per source) keeps the
- * source split byte-identical to the old fused `generateCandidates` — a node with a
- * unique signature but no `block()` key lands ONLY in its unique bucket, never the
- * all-vs-all `unblocked` bucket.
- *
- * Determinism: the extraction visits buckets in sorted-key order over id-sorted
- * members and enumerates `i < j`, so proposals are emitted in a canonical order;
- * the scoring stage additionally dedups + sorts, so neither source's emission order
- * leaks into the merge result.
- */
-
 /**
  * A committed BASE node a source pulled into the cluster universe (design §4
  * member contribution / §6.4-D). It carries the same `(id, kind, props)` a staged