@legioncodeinc/nectar 0.0.1

package/dist/hive-graph/deeplake-transport.js

@@ -0,0 +1,145 @@
+/**
+ * Minimal Deep Lake HTTP transport for nectar (PRD-005).
+ *
+ * Per ADR-0002, nectar is an independent daemon that reaches Deep Lake
+ * over the network through its OWN client, never by importing the honeycomb
+ * runtime in-process. This module mirrors the shape of honeycomb's
+ * `HttpDeepLakeTransport` (`src/daemon/storage/transport.ts`), scoped down to
+ * exactly what the two hive-graph tables need: one method that posts a SQL
+ * statement to the Deep Lake query endpoint and returns rows, or throws a
+ * typed `TransportError`.
+ *
+ * Node built-ins only (`fetch` is global on Node >=22); no new runtime
+ * dependency, matching nectar's zero-runtime-dependency rule (AGENTS.md).
+ *
+ * The transport is deliberately thin: no retry, no concurrency bounding.
+ * Nectar's write volume (one file-registration event at a time, from a
+ * single daemon worker loop per `worker.ts`) does not need honeycomb's
+ * `Semaphore(5)` + 429/5xx retry client layer that exists to bound a
+ * high-concurrency multi-harness workload; a future PRD can add that layer
+ * here without changing this transport's contract if nectar's write
+ * volume grows to need it.
+ */
+/**
+ * A typed failure raised by {@link HttpDeepLakeTransport}. `status` carries
+ * the HTTP status for query failures (e.g. 404, 500) so heal logic
+ * (`deeplake-heal.ts`) can classify the failure message.
+ */
+export class TransportError extends Error {
+    kind;
+    status;
+    constructor(kind, message, status) {
+        super(message);
+        this.name = "TransportError";
+        this.kind = kind;
+        if (status !== undefined)
+            this.status = status;
+    }
+}
+/** Header name Deep Lake reads to attribute traffic by client family. */
+export const DEEPLAKE_CLIENT_HEADER = "X-Deeplake-Client";
+/** Header name Deep Lake reads to scope a request to an org partition. */
+export const DEEPLAKE_ORG_HEADER = "X-Activeloop-Org-Id";
+/** Default per-statement timeout when the caller does not override it. */
+export const DEFAULT_TRANSPORT_TIMEOUT_MS = 15_000;
+/**
+ * Real HTTP transport against the Deep Lake SQL endpoint. POSTs
+ * `{ query: sql }` to `${endpoint}/workspaces/${workspaceId}/tables/query`
+ * with a bearer token, the org header, and a client-family header, exactly
+ * mirroring honeycomb's `HttpDeepLakeTransport.query` shape. Maps a fetch
+ * failure / abort / non-ok response into a typed `TransportError` the heal
+ * logic and the store can branch on.
+ */
+export class HttpDeepLakeTransport {
+    endpoint;
+    token;
+    orgId;
+    workspaceId;
+    timeoutMs;
+    constructor(config) {
+        this.endpoint = config.endpoint.replace(/\/+$/, "");
+        this.token = config.token;
+        this.orgId = config.orgId;
+        this.workspaceId = config.workspaceId;
+        this.timeoutMs = config.timeoutMs ?? DEFAULT_TRANSPORT_TIMEOUT_MS;
+    }
+    /**
+     * Run one SQL statement against the configured workspace.
+     *
+     * Transient failures (HTTP 429 and 5xx, e.g. the backend's intermittent
+     * 'failed to get database connection' 500) are retried with bounded
+     * exponential backoff plus jitter before the TransportError propagates:
+     * a single upstream blip must not abort a minutes-long brood or an
+     * enricher cycle. Non-transient failures (4xx other than 429: schema
+     * errors, bad SQL, auth) fail fast on the first attempt so heal and
+     * fail-soft classification see them unchanged.
+     */
+    async query(sql) {
+        let lastTransient = null;
+        for (let attempt = 0; attempt < QUERY_TRANSIENT_MAX_ATTEMPTS; attempt += 1) {
+            if (attempt > 0) {
+                const backoff = QUERY_TRANSIENT_BASE_BACKOFF_MS * 2 ** (attempt - 1);
+                await new Promise((resolve) => setTimeout(resolve, backoff + Math.random() * backoff));
+            }
+            try {
+                return await this.queryOnce(sql);
+            }
+            catch (err) {
+                if (err instanceof TransportError &&
+                    err.kind === "query" &&
+                    err.status !== undefined &&
+                    (err.status === 429 || err.status >= 500)) {
+                    lastTransient = err;
+                    continue;
+                }
+                throw err;
+            }
+        }
+        // lastTransient is always set when the loop exhausts.
+        throw lastTransient ?? new TransportError("query", "transient retry loop exhausted without an error");
+    }
+    async queryOnce(sql) {
+        const controller = new AbortController();
+        const timer = setTimeout(() => controller.abort(), this.timeoutMs);
+        let resp;
+        try {
+            resp = await fetch(`${this.endpoint}/workspaces/${encodeURIComponent(this.workspaceId)}/tables/query`, {
+                method: "POST",
+                headers: {
+                    Authorization: `Bearer ${this.token}`,
+                    "Content-Type": "application/json",
+                    [DEEPLAKE_ORG_HEADER]: this.orgId,
+                    [DEEPLAKE_CLIENT_HEADER]: "nectar",
+                },
+                signal: controller.signal,
+                body: JSON.stringify({ query: sql }),
+            });
+        }
+        catch (e) {
+            // AbortError fires when our own timeout aborts the request. Map it to
+            // the timeout kind so callers can distinguish it from a dropped socket.
+            if (e instanceof Error && e.name === "AbortError") {
+                throw new TransportError("timeout", `request aborted after ${this.timeoutMs}ms`);
+            }
+            const message = e instanceof Error ? e.message : String(e);
+            throw new TransportError("connection", message);
+        }
+        finally {
+            clearTimeout(timer);
+        }
+        if (!resp.ok) {
+            const text = await resp.text().catch(() => "");
+            throw new TransportError("query", `${resp.status}: ${text.slice(0, 200)}`, resp.status);
+        }
+        const raw = (await resp.json().catch(() => null));
+        if (!raw?.rows || !raw?.columns)
+            return [];
+        const columns = raw.columns;
+        return raw.rows.map((row) => Object.fromEntries(columns.map((col, i) => [col, row[i]])));
+    }
+}
+/** Bounded attempts for transient (429/5xx) query failures. */
+export const QUERY_TRANSIENT_MAX_ATTEMPTS = 4;
+/** First-retry backoff; doubles per attempt, with up-to-equal jitter added. */
+export const QUERY_TRANSIENT_BASE_BACKOFF_MS = 500;
+//# sourceMappingURL=deeplake-transport.js.map

package/dist/hive-graph/deeplake-transport.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deeplake-transport.js","sourceRoot":"","sources":["../../src/hive-graph/deeplake-transport.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAKH;;;;GAIG;AACH,MAAM,OAAO,cAAe,SAAQ,KAAK;IAC9B,IAAI,CAAqB;IACzB,MAAM,CAAU;IACzB,YAAY,IAAwB,EAAE,OAAe,EAAE,MAAe;QACpE,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACjD,CAAC;CACF;AAKD,yEAAyE;AACzE,MAAM,CAAC,MAAM,sBAAsB,GAAG,mBAAmB,CAAC;AAC1D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,mBAAmB,GAAG,qBAAqB,CAAC;AACzD,0EAA0E;AAC1E,MAAM,CAAC,MAAM,4BAA4B,GAAG,MAAM,CAAC;AAgBnD;;;;;;;GAOG;AACH,MAAM,OAAO,qBAAqB;IACf,QAAQ,CAAS;IACjB,KAAK,CAAS;IACd,KAAK,CAAS;IACd,WAAW,CAAS;IACpB,SAAS,CAAS;IAEnC,YAAY,MAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,4BAA4B,CAAC;IACpE,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,KAAK,CAAC,GAAW;QACrB,IAAI,aAAa,GAA0B,IAAI,CAAC;QAChD,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,4BAA4B,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;YAC3E,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;gBAChB,MAAM,OAAO,GAAG,+BAA+B,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBACrE,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;YACzF,CAAC;YACD,IAAI,CAAC;gBACH,OAAO,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACnC,CAAC;YAAC,OAAO,GAAY,EAAE,CAAC;gBACtB,IACE,GAAG,YAAY,cAAc;oBAC7B,GAAG,CAAC,IAAI,KAAK,OAAO;oBACpB,GAAG,CAAC,MAAM,KAAK,SAAS;oBACxB,CAAC,GAAG,CAAC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,EACzC,CAAC;oBACD,aAAa,GAAG,GAAG,CAAC;oBACpB,SAAS;gBACX,CAAC;gBACD,MAAM,GAAG,CAAC;YACZ,CAAC;QACH,CAAC;QACD,sDAAsD;QACtD,MAAM,aAAa,IAAI,IAAI,cAAc,CAAC,OAAO,EAAE,iDAAiD,CAAC,CAAC;IACxG,CAAC;IAEO,KAAK,CAAC,SAAS,CAAC,GAAW;QACjC,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACnE,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,eAAe,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,EAAE;gBACrG,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE;oBACP,aAAa,EAAE,UAAU,IAAI,CAAC,KAAK,EAAE;oBACrC,cAAc,EAAE,kBAAkB;oBAClC,CAAC,mBAAmB,CAAC,EAAE,IAAI,CAAC,KAAK;oBACjC,CAAC,sBAAsB,CAAC,EAAE,QAAQ;iBACnC;gBACD,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;aACrC,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,CAAU,EAAE,CAAC;YACpB,sEAAsE;YACtE,wEAAwE;YACxE,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAClD,MAAM,IAAI,cAAc,CAAC,SAAS,EAAE,yBAAyB,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC;YACnF,CAAC;YACD,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,IAAI,cAAc,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/C,MAAM,IAAI,cAAc,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1F,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAsD,CAAC;QACvG,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,OAAO;YAAE,OAAO,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;QAC5B,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC;CACF;AAED,+DAA+D;AAC/D,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAC9C,+EAA+E;AAC/E,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC"}

package/dist/hive-graph/hash.d.ts

@@ -0,0 +1,3 @@
+/** Lowercase hex sha256 of the given data. */
+export declare function sha256Hex(data: string | Uint8Array): string;
+//# sourceMappingURL=hash.d.ts.map

package/dist/hive-graph/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../src/hive-graph/hash.ts"],"names":[],"mappings":"AAQA,8CAA8C;AAC9C,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,MAAM,CAE3D"}

package/dist/hive-graph/hash.js

@@ -0,0 +1,12 @@
+/**
+ * Content hashing for the Hive Graph (PRD-005 / PRD-006).
+ *
+ * `content_hash` is the sha256 of file content at observation, and the composite
+ * key part 2 on `hive_graph_versions`. Node built-ins only (`node:crypto`).
+ */
+import { createHash } from "node:crypto";
+/** Lowercase hex sha256 of the given data. */
+export function sha256Hex(data) {
+    return createHash("sha256").update(data).digest("hex");
+}
+//# sourceMappingURL=hash.js.map

package/dist/hive-graph/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/hive-graph/hash.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,8CAA8C;AAC9C,MAAM,UAAU,SAAS,CAAC,IAAyB;IACjD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACzD,CAAC"}

package/dist/hive-graph/memory-store.d.ts

@@ -0,0 +1,39 @@
+/**
+ * In-memory HiveGraphStore adapter (PRD-005).
+ *
+ * A complete, correct implementation of the store seam backed by plain Maps.
+ * It is the store the file-registration ladder (PRD-006), brooding (PRD-007),
+ * and the search engine (PRD-012) run against in tests and local dev. The Deep
+ * Lake adapter (the durable substrate, reached through nectar's own client
+ * per ADR-0002) implements the same interface and is a drop-in replacement; no
+ * consumer changes when it lands.
+ *
+ * "latest version" is always MAX(seq) for a nectar. All reads are tenancy-scoped
+ * (org+workspace+project); project_id is a plain column predicate here, exactly
+ * as the soft-filter contract (PRD-005c) specifies.
+ */
+import type { HiveGraphRow, HiveGraphVersionRow, Tenancy } from "./model.js";
+import type { LatestVersion, HiveGraphStore } from "./store.js";
+export declare class InMemoryHiveGraphStore implements HiveGraphStore {
+    private readonly identities;
+    /** nectar -> version rows in append order (seq ascending). */
+    private readonly versions;
+    insertIdentity(row: HiveGraphRow): void;
+    getIdentity(nectar: string): HiveGraphRow | undefined;
+    touchIdentity(nectar: string, lastUpdateDate: string): void;
+    appendVersion(row: HiveGraphVersionRow): void;
+    nextSeq(nectar: string): number;
+    latestVersion(nectar: string): HiveGraphVersionRow | undefined;
+    listLatestVersions(tenancy: Tenancy): LatestVersion[];
+    listLatestDescribedVersions(tenancy: Tenancy): LatestVersion[];
+    /** The highest-seq version whose `describeStatus` is `described`, or undefined. */
+    private latestDescribedVersion;
+    latestVersionByPath(tenancy: Tenancy, path: string): LatestVersion | undefined;
+    latestVersionByHash(tenancy: Tenancy, contentHash: string): LatestVersion | undefined;
+    deleteNectar(tenancy: Tenancy, nectar: string): void;
+    /** Every identity row in scope, including one with zero version rows (PRD-018d repair sweep). */
+    listIdentities(tenancy: Tenancy): HiveGraphRow[];
+    /** Every nectar with at least one version row in scope, including one with NO identity row (CodeRabbit PR-18 finding #8 repair sweep). Scoped via the version row's own tenancy columns, since an orphan has no identity to scope against. */
+    listVersionNectars(tenancy: Tenancy): string[];
+}
+//# sourceMappingURL=memory-store.d.ts.map

package/dist/hive-graph/memory-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.d.ts","sourceRoot":"","sources":["../../src/hive-graph/memory-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE7E,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEhE,qBAAa,sBAAuB,YAAW,cAAc;IAC3D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAmC;IAC9D,8DAA8D;IAC9D,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA4C;IAErE,cAAc,CAAC,GAAG,EAAE,YAAY,GAAG,IAAI;IAOvC,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAKrD,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;IAK3D,aAAa,CAAC,GAAG,EAAE,mBAAmB,GAAG,IAAI;IAM7C,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAQ/B,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,mBAAmB,GAAG,SAAS;IAQ9D,kBAAkB,CAAC,OAAO,EAAE,OAAO,GAAG,aAAa,EAAE;IAUrD,2BAA2B,CAAC,OAAO,EAAE,OAAO,GAAG,aAAa,EAAE;IAU9D,mFAAmF;IACnF,OAAO,CAAC,sBAAsB;IAW9B,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAO9E,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAOrF,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAQpD,iGAAiG;IACjG,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,YAAY,EAAE;IAQhD,8OAA8O;IAC9O,kBAAkB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,EAAE;CAQ/C"}

package/dist/hive-graph/memory-store.js

@@ -0,0 +1,125 @@
+import { inTenancy } from "./model.js";
+export class InMemoryHiveGraphStore {
+    identities = new Map();
+    /** nectar -> version rows in append order (seq ascending). */
+    versions = new Map();
+    insertIdentity(row) {
+        if (this.identities.has(row.nectar)) {
+            throw new Error(`identity already exists for nectar ${row.nectar}`);
+        }
+        this.identities.set(row.nectar, { ...row });
+    }
+    getIdentity(nectar) {
+        const row = this.identities.get(nectar);
+        return row ? { ...row } : undefined;
+    }
+    touchIdentity(nectar, lastUpdateDate) {
+        const row = this.identities.get(nectar);
+        if (row !== undefined)
+            row.lastUpdateDate = lastUpdateDate;
+    }
+    appendVersion(row) {
+        const list = this.versions.get(row.nectar) ?? [];
+        list.push({ ...row });
+        this.versions.set(row.nectar, list);
+    }
+    nextSeq(nectar) {
+        const list = this.versions.get(nectar);
+        if (list === undefined || list.length === 0)
+            return 0;
+        let max = -1;
+        for (const v of list)
+            if (v.seq > max)
+                max = v.seq;
+        return max + 1;
+    }
+    latestVersion(nectar) {
+        const list = this.versions.get(nectar);
+        if (list === undefined || list.length === 0)
+            return undefined;
+        let latest = list[0];
+        for (const v of list)
+            if (v.seq > latest.seq)
+                latest = v;
+        return { ...latest };
+    }
+    listLatestVersions(tenancy) {
+        const out = [];
+        for (const [nectar, identity] of this.identities) {
+            if (!inTenancy(identity, tenancy))
+                continue;
+            const version = this.latestVersion(nectar);
+            if (version !== undefined)
+                out.push({ identity: { ...identity }, version });
+        }
+        return out;
+    }
+    listLatestDescribedVersions(tenancy) {
+        const out = [];
+        for (const [nectar, identity] of this.identities) {
+            if (!inTenancy(identity, tenancy))
+                continue;
+            const described = this.latestDescribedVersion(nectar);
+            if (described !== undefined)
+                out.push({ identity: { ...identity }, version: described });
+        }
+        return out;
+    }
+    /** The highest-seq version whose `describeStatus` is `described`, or undefined. */
+    latestDescribedVersion(nectar) {
+        const list = this.versions.get(nectar);
+        if (list === undefined || list.length === 0)
+            return undefined;
+        let latest;
+        for (const v of list) {
+            if (v.describeStatus !== "described")
+                continue;
+            if (latest === undefined || v.seq > latest.seq)
+                latest = v;
+        }
+        return latest === undefined ? undefined : { ...latest };
+    }
+    latestVersionByPath(tenancy, path) {
+        for (const lv of this.listLatestVersions(tenancy)) {
+            if (lv.version.path === path)
+                return lv;
+        }
+        return undefined;
+    }
+    latestVersionByHash(tenancy, contentHash) {
+        for (const lv of this.listLatestVersions(tenancy)) {
+            if (lv.version.contentHash === contentHash)
+                return lv;
+        }
+        return undefined;
+    }
+    deleteNectar(tenancy, nectar) {
+        const identity = this.identities.get(nectar);
+        if (identity === undefined)
+            return; // unknown nectar: no-op
+        if (!inTenancy(identity, tenancy))
+            return; // refuse a cross-project delete (AC-20)
+        this.identities.delete(nectar);
+        this.versions.delete(nectar);
+    }
+    /** Every identity row in scope, including one with zero version rows (PRD-018d repair sweep). */
+    listIdentities(tenancy) {
+        const out = [];
+        for (const identity of this.identities.values()) {
+            if (inTenancy(identity, tenancy))
+                out.push({ ...identity });
+        }
+        return out;
+    }
+    /** Every nectar with at least one version row in scope, including one with NO identity row (CodeRabbit PR-18 finding #8 repair sweep). Scoped via the version row's own tenancy columns, since an orphan has no identity to scope against. */
+    listVersionNectars(tenancy) {
+        const out = [];
+        for (const [nectar, list] of this.versions) {
+            const first = list[0];
+            if (first !== undefined && inTenancy(first, tenancy))
+                out.push(nectar);
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=memory-store.js.map

package/dist/hive-graph/memory-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-store.js","sourceRoot":"","sources":["../../src/hive-graph/memory-store.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAGvC,MAAM,OAAO,sBAAsB;IAChB,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC9D,8DAA8D;IAC7C,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAC;IAErE,cAAc,CAAC,GAAiB;QAC9B,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,WAAW,CAAC,MAAc;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACtC,CAAC;IAED,aAAa,CAAC,MAAc,EAAE,cAAsB;QAClD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,SAAS;YAAE,GAAG,CAAC,cAAc,GAAG,cAAc,CAAC;IAC7D,CAAC;IAED,aAAa,CAAC,GAAwB;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,MAAc;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACtD,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;QACnD,OAAO,GAAG,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,aAAa,CAAC,MAAc;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9D,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,CAAwB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG;gBAAE,MAAM,GAAG,CAAC,CAAC;QACzD,OAAO,EAAE,GAAG,MAAM,EAAE,CAAC;IACvB,CAAC;IAED,kBAAkB,CAAC,OAAgB;QACjC,MAAM,GAAG,GAAoB,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACjD,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;gBAAE,SAAS;YAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAI,OAAO,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2BAA2B,CAAC,OAAgB;QAC1C,MAAM,GAAG,GAAoB,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACjD,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;gBAAE,SAAS;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;YACtD,IAAI,SAAS,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,mFAAmF;IAC3E,sBAAsB,CAAC,MAAc;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9D,IAAI,MAAuC,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,cAAc,KAAK,WAAW;gBAAE,SAAS;YAC/C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG;gBAAE,MAAM,GAAG,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC;IAC1D,CAAC;IAED,mBAAmB,CAAC,OAAgB,EAAE,IAAY;QAChD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC;YAClD,IAAI,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,mBAAmB,CAAC,OAAgB,EAAE,WAAmB;QACvD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC;YAClD,IAAI,EAAE,CAAC,OAAO,CAAC,WAAW,KAAK,WAAW;gBAAE,OAAO,EAAE,CAAC;QACxD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,YAAY,CAAC,OAAgB,EAAE,MAAc;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,CAAC,wBAAwB;QAC5D,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;YAAE,OAAO,CAAC,wCAAwC;QACnF,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,iGAAiG;IACjG,cAAc,CAAC,OAAgB;QAC7B,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,IAAI,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8OAA8O;IAC9O,kBAAkB,CAAC,OAAgB;QACjC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/hive-graph/model.d.ts

@@ -0,0 +1,109 @@
+/**
+ * The Hive Graph domain model (PRD-005).
+ *
+ * Two tables, one purpose each, straight from the corpus
+ * (`library/knowledge/private/data/hive-graph-schema.md`):
+ *   - `hive_graph`          one row per logical file, keyed by nectar (ULID). Identity + provenance.
+ *   - `hive_graph_versions` append-only, keyed by (nectar, content_hash). Content + lazy description.
+ *
+ * These types are the frozen contract the store adapters (PRD-005) and the
+ * file-registration ladder (PRD-006) both build against. Column names match the
+ * DDL exactly so the future Deep Lake adapter maps 1:1.
+ */
+/** Tenancy triple. Scope is org+workspace at the storage layer; project_id is a soft column filter (PRD-005c / decision #3). */
+export interface Tenancy {
+    readonly orgId: string;
+    readonly workspaceId: string;
+    readonly projectId: string;
+}
+/**
+ * True when a row's tenancy columns match `t` exactly on all three of
+ * `orgId`/`workspaceId`/`projectId`. The single scoping predicate re-used by
+ * the in-memory store, the ladder's carry guard, and the delete/prune/review
+ * paths so no identity mutation ever crosses a project boundary (AC-20).
+ */
+export declare function inTenancy(row: {
+    orgId: string;
+    workspaceId: string;
+    projectId: string;
+}, t: Tenancy): boolean;
+/** `hive_graph.kind` discriminator. Only `file` is minted in v1; `directory` reserves the namespace (schema doc YAGNI note). */
+export type NectarKind = "file" | "directory";
+/**
+ * `hive_graph_versions.describe_status`. Exactly the six values in the schema
+ * doc column table (including `skipped-deleted`, the decisions-doc #14 addition).
+ */
+export type DescribeStatus = "pending" | "described" | "failed" | "skipped-too-large" | "skipped-binary" | "skipped-deleted";
+export declare const DESCRIBE_STATUSES: readonly DescribeStatus[];
+/** A row of `hive_graph` (identity + provenance only; no content, no description). */
+export interface HiveGraphRow {
+    /** 26-char ULID, minted once, never derived from content. Primary key. */
+    nectar: string;
+    kind: NectarKind;
+    /** ISO 8601 minting time (the decoded ULID timestamp). */
+    createdAt: string;
+    /** Copy-paste provenance; empty for an originally-minted file. */
+    derivedFromNectar: string;
+    /** Content hash at the fork point; empty unless derived. */
+    forkContentHash: string;
+    orgId: string;
+    workspaceId: string;
+    projectId: string;
+    /** Denormalized "last observed change" timestamp; bumped on every appended version. */
+    lastUpdateDate: string;
+}
+/** A row of `hive_graph_versions` (one per observed content state of a nectar). */
+export interface HiveGraphVersionRow {
+    /** FK -> hive_graph.nectar. Composite key part 1. */
+    nectar: string;
+    /** sha256 of file content at observation. Composite key part 2. */
+    contentHash: string;
+    /** Monotonic per-nectar version counter (0, 1, 2, ...). "latest" = MAX(seq). */
+    seq: number;
+    /** Repo-relative path (forward slashes) at observation time. Mutable across a nectar's versions -> records moves. */
+    path: string;
+    filename: string;
+    /** Lowercased extension without the dot (`ts`, `md`, `json`). */
+    ext: string;
+    sizeBytes: number;
+    /** File mtime at observation (ISO 8601). Not authoritative; a fast-path cache key only. */
+    mtimeObserved: string;
+    /** LLM-minted, <=80 chars. Empty while pending. */
+    title: string;
+    /** LLM-minted, 1-3 sentences. Empty while pending. */
+    description: string;
+    /** JSON-encoded string array, e.g. '["auth","session"]'. Defaults to '[]'. */
+    concepts: string;
+    /** 768-dim vector over title+description. Null until enriched (or if embeddings off). */
+    embedding: number[] | null;
+    /** Set only on ladder step-4 (TLSH fuzzy) rows: 1 - normalizedTLSHDistance. Null otherwise. */
+    confidence: number | null;
+    /**
+     * TLSH-family fingerprint of the content (the `computeFingerprint` "H1"-prefixed
+     * digest); set on every content-bearing row, consulted by ladder step 4 for
+     * missing files so cold-catch-up fuzzy matching survives a daemon restart. Null
+     * on pre-fingerprint rows (they self-heal on next observation).
+     */
+    fingerprint: string | null;
+    describedAt: string;
+    describeModel: string;
+    /**
+     * The embedding model that produced {@link embedding} (PRD-018i / NEC-018).
+     * Null when the row carries no embedding (`embedding === null`) or was written
+     * before this column existed (the catalog heal path backfills old rows as
+     * null). Additive nullable column; the ONLY schema change in PRD-018.
+     */
+    embedModel?: string | null;
+    describeStatus: DescribeStatus;
+    /** Timestamp the version row was appended (distinct from mtimeObserved). */
+    observedAt: string;
+    orgId: string;
+    workspaceId: string;
+    projectId: string;
+    lastUpdateDate: string;
+}
+/** The embedding contract: 768 dims, tied to the FLOAT4[] column (ADR-0001 / PRD-014). A different dimension is rejected upstream. */
+export declare const EMBED_DIMS = 768;
+/** True if a vector honors the 768-dim contract. Recall's `embed.dim_rejected` guard discards anything else. */
+export declare function isValidEmbedding(vec: number[] | null): boolean;
+//# sourceMappingURL=model.d.ts.map

package/dist/hive-graph/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../src/hive-graph/model.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,gIAAgI;AAChI,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAE7G;AAED,gIAAgI;AAChI,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,WAAW,CAAC;AAE9C;;;GAGG;AACH,MAAM,MAAM,cAAc,GACtB,SAAS,GACT,WAAW,GACX,QAAQ,GACR,mBAAmB,GACnB,gBAAgB,GAChB,iBAAiB,CAAC;AAEtB,eAAO,MAAM,iBAAiB,EAAE,SAAS,cAAc,EAOtD,CAAC;AAEF,sFAAsF;AACtF,MAAM,WAAW,YAAY;IAC3B,0EAA0E;IAC1E,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,UAAU,CAAC;IACjB,0DAA0D;IAC1D,SAAS,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,iBAAiB,EAAE,MAAM,CAAC;IAC1B,4DAA4D;IAC5D,eAAe,EAAE,MAAM,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,uFAAuF;IACvF,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,mFAAmF;AACnF,MAAM,WAAW,mBAAmB;IAClC,qDAAqD;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,GAAG,EAAE,MAAM,CAAC;IACZ,qHAAqH;IACrH,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,iEAAiE;IACjE,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,2FAA2F;IAC3F,aAAa,EAAE,MAAM,CAAC;IACtB,mDAAmD;IACnD,KAAK,EAAE,MAAM,CAAC;IACd,sDAAsD;IACtD,WAAW,EAAE,MAAM,CAAC;IACpB,8EAA8E;IAC9E,QAAQ,EAAE,MAAM,CAAC;IACjB,yFAAyF;IACzF,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAC3B,+FAA+F;IAC/F,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B;;;;;OAKG;IACH,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,cAAc,EAAE,cAAc,CAAC;IAC/B,4EAA4E;IAC5E,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,sIAAsI;AACtI,eAAO,MAAM,UAAU,MAAM,CAAC;AAE9B,gHAAgH;AAChH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,GAAG,OAAO,CAE9D"}

package/dist/hive-graph/model.js

@@ -0,0 +1,36 @@
+/**
+ * The Hive Graph domain model (PRD-005).
+ *
+ * Two tables, one purpose each, straight from the corpus
+ * (`library/knowledge/private/data/hive-graph-schema.md`):
+ *   - `hive_graph`          one row per logical file, keyed by nectar (ULID). Identity + provenance.
+ *   - `hive_graph_versions` append-only, keyed by (nectar, content_hash). Content + lazy description.
+ *
+ * These types are the frozen contract the store adapters (PRD-005) and the
+ * file-registration ladder (PRD-006) both build against. Column names match the
+ * DDL exactly so the future Deep Lake adapter maps 1:1.
+ */
+/**
+ * True when a row's tenancy columns match `t` exactly on all three of
+ * `orgId`/`workspaceId`/`projectId`. The single scoping predicate re-used by
+ * the in-memory store, the ladder's carry guard, and the delete/prune/review
+ * paths so no identity mutation ever crosses a project boundary (AC-20).
+ */
+export function inTenancy(row, t) {
+    return row.orgId === t.orgId && row.workspaceId === t.workspaceId && row.projectId === t.projectId;
+}
+export const DESCRIBE_STATUSES = [
+    "pending",
+    "described",
+    "failed",
+    "skipped-too-large",
+    "skipped-binary",
+    "skipped-deleted",
+];
+/** The embedding contract: 768 dims, tied to the FLOAT4[] column (ADR-0001 / PRD-014). A different dimension is rejected upstream. */
+export const EMBED_DIMS = 768;
+/** True if a vector honors the 768-dim contract. Recall's `embed.dim_rejected` guard discards anything else. */
+export function isValidEmbedding(vec) {
+    return vec === null || vec.length === EMBED_DIMS;
+}
+//# sourceMappingURL=model.js.map

package/dist/hive-graph/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../src/hive-graph/model.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AASH;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,GAA8D,EAAE,CAAU;IAClG,OAAO,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,IAAI,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,CAAC;AACrG,CAAC;AAiBD,MAAM,CAAC,MAAM,iBAAiB,GAA8B;IAC1D,SAAS;IACT,WAAW;IACX,QAAQ;IACR,mBAAmB;IACnB,gBAAgB;IAChB,iBAAiB;CAClB,CAAC;AAuEF,sIAAsI;AACtI,MAAM,CAAC,MAAM,UAAU,GAAG,GAAG,CAAC;AAE9B,gHAAgH;AAChH,MAAM,UAAU,gBAAgB,CAAC,GAAoB;IACnD,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU,CAAC;AACnD,CAAC"}

package/dist/hive-graph/paths.d.ts

@@ -0,0 +1,7 @@
+/** Repo-relative, forward-slashed path. `root` is the project root; `absOrRel` may be absolute or already relative. */
+export declare function toRepoRelative(absOrRel: string, root: string): string;
+/** Bare filename (`a.ts`) from a path. */
+export declare function filenameOf(p: string): string;
+/** Lowercased extension without the leading dot (`ts`, `md`, `json`); empty string if none. */
+export declare function extOf(p: string): string;
+//# sourceMappingURL=paths.d.ts.map

package/dist/hive-graph/paths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.d.ts","sourceRoot":"","sources":["../../src/hive-graph/paths.ts"],"names":[],"mappings":"AASA,uHAAuH;AACvH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAMrE;AAED,0CAA0C;AAC1C,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED,+FAA+F;AAC/F,wBAAgB,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAGvC"}

package/dist/hive-graph/paths.js

@@ -0,0 +1,26 @@
+/**
+ * Path helpers for building version rows (PRD-005 / PRD-006).
+ *
+ * Paths in `hive_graph_versions.path` are repo-relative with forward slashes,
+ * regardless of OS. `filename` and `ext` are denormalized from the path for fast
+ * filename-only search and extractor routing (per hive-graph-schema.md).
+ */
+import { relative, basename, extname } from "node:path";
+/** Repo-relative, forward-slashed path. `root` is the project root; `absOrRel` may be absolute or already relative. */
+export function toRepoRelative(absOrRel, root) {
+    const rel = relative(root, absOrRel);
+    // If `absOrRel` was already relative to cwd and not under root, `relative` may
+    // return it unchanged; normalize separators either way.
+    const forward = (rel === "" ? absOrRel : rel).replace(/\\/g, "/");
+    return forward.replace(/^\.\//, "");
+}
+/** Bare filename (`a.ts`) from a path. */
+export function filenameOf(p) {
+    return basename(p.replace(/\\/g, "/"));
+}
+/** Lowercased extension without the leading dot (`ts`, `md`, `json`); empty string if none. */
+export function extOf(p) {
+    const ext = extname(p);
+    return ext.startsWith(".") ? ext.slice(1).toLowerCase() : ext.toLowerCase();
+}
+//# sourceMappingURL=paths.js.map

package/dist/hive-graph/paths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.js","sourceRoot":"","sources":["../../src/hive-graph/paths.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAExD,uHAAuH;AACvH,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,IAAY;IAC3D,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACrC,+EAA+E;IAC/E,wDAAwD;IACxD,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAClE,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACtC,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,+FAA+F;AAC/F,MAAM,UAAU,KAAK,CAAC,CAAS;IAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACvB,OAAO,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;AAC9E,CAAC"}