@legioncodeinc/nectar 0.0.1

package/dist/source-graph/deeplake-store.js

@@ -0,0 +1,389 @@
+import { DESCRIBE_STATUSES } from "./model.js";
+import { SOURCE_GRAPH_TABLE, SOURCE_GRAPH_VERSIONS_TABLE } from "./schema.js";
+import { HttpDeepLakeTransport, TransportError } from "./deeplake-transport.js";
+import { isMissingTableError, withHeal } from "./deeplake-heal.js";
+import { eLiteral, sLiteral, sqlFloat4Array, sqlIdent, sqlNum } from "./sql-guards.js";
+const SOURCE_GRAPH_TABLE_NAME = sqlIdent(SOURCE_GRAPH_TABLE.name);
+const SOURCE_GRAPH_VERSIONS_TABLE_NAME = sqlIdent(SOURCE_GRAPH_VERSIONS_TABLE.name);
+function toStr(value) {
+    return typeof value === "string" ? value : String(value ?? "");
+}
+function toNum(value) {
+    const n = typeof value === "number" ? value : Number(value);
+    return Number.isFinite(n) ? n : 0;
+}
+function toDescribeStatus(value) {
+    if (typeof value === "string" && DESCRIBE_STATUSES.includes(value)) {
+        return value;
+    }
+    throw new Error(`invalid describe_status value from Deep Lake: ${JSON.stringify(value)}`);
+}
+function toEmbedding(value) {
+    if (!Array.isArray(value))
+        return null;
+    return value.map((v) => toNum(v));
+}
+function toConfidence(value) {
+    if (value === null || value === undefined)
+        return null;
+    const n = typeof value === "number" ? value : Number(value);
+    return Number.isFinite(n) ? n : null;
+}
+/** Map a raw `source_graph` row into the domain `SourceGraphRow`. */
+function toIdentityRow(row) {
+    return {
+        nectar: toStr(row.nectar),
+        kind: row.kind === "directory" ? "directory" : "file",
+        createdAt: toStr(row.created_at),
+        derivedFromNectar: toStr(row.derived_from_nectar),
+        forkContentHash: toStr(row.fork_content_hash),
+        orgId: toStr(row.org_id),
+        workspaceId: toStr(row.workspace_id),
+        projectId: toStr(row.project_id),
+        lastUpdateDate: toStr(row.last_update_date),
+    };
+}
+/** Map a raw `source_graph_versions` row into the domain `SourceGraphVersionRow`. */
+function toVersionRow(row) {
+    return {
+        nectar: toStr(row.nectar),
+        contentHash: toStr(row.content_hash),
+        seq: toNum(row.seq),
+        path: toStr(row.path),
+        filename: toStr(row.filename),
+        ext: toStr(row.ext),
+        sizeBytes: toNum(row.size_bytes),
+        mtimeObserved: toStr(row.mtime_observed),
+        title: toStr(row.title),
+        description: toStr(row.description),
+        concepts: toStr(row.concepts),
+        embedding: toEmbedding(row.embedding),
+        confidence: toConfidence(row.confidence),
+        fingerprint: typeof row.fingerprint === "string" ? row.fingerprint : null,
+        describedAt: toStr(row.described_at),
+        describeModel: toStr(row.describe_model),
+        describeStatus: toDescribeStatus(row.describe_status),
+        observedAt: toStr(row.observed_at),
+        orgId: toStr(row.org_id),
+        workspaceId: toStr(row.workspace_id),
+        projectId: toStr(row.project_id),
+        lastUpdateDate: toStr(row.last_update_date),
+    };
+}
+/**
+ * Reduce a set of raw `source_graph_versions` rows for ONE nectar to the one
+ * with the highest `seq` (client-side MAX(seq)), returning `undefined` for an
+ * empty set. This is the real "MAX(seq) selection" logic `nextSeq`,
+ * `latestVersion`, and `listLatestVersions` all share - it does not trust the
+ * Deep Lake backend to have already applied an `ORDER BY seq DESC LIMIT 1`
+ * correctly, since this same file documents (`touchIdentity`'s docblock,
+ * citing honeycomb `src/daemon/storage/catalog/tenancy.ts:475-489`) that this
+ * backend has known point-read/ordering quirks under load. Fetching every
+ * version row for a nectar and reducing here is a small, testable function
+ * instead of an opaque SQL clause, and a nectar's version history (one row
+ * per observed edit of a single file) is not expected to be large enough for
+ * the extra rows to matter.
+ */
+function reduceLatestVersion(rows) {
+    let latest;
+    for (const raw of rows) {
+        const version = toVersionRow(raw);
+        if (latest === undefined || version.seq > latest.seq)
+            latest = version;
+    }
+    return latest;
+}
+/** Build the `INSERT INTO "source_graph" (...) VALUES (...)` statement for one identity row. */
+function buildInsertIdentitySql(row) {
+    const cols = [
+        "nectar",
+        "kind",
+        "created_at",
+        "derived_from_nectar",
+        "fork_content_hash",
+        "org_id",
+        "workspace_id",
+        "project_id",
+        "last_update_date",
+    ];
+    const vals = [
+        sLiteral(row.nectar),
+        sLiteral(row.kind),
+        sLiteral(row.createdAt),
+        sLiteral(row.derivedFromNectar),
+        sLiteral(row.forkContentHash),
+        sLiteral(row.orgId),
+        sLiteral(row.workspaceId),
+        sLiteral(row.projectId),
+        sLiteral(row.lastUpdateDate),
+    ];
+    return `INSERT INTO "${SOURCE_GRAPH_TABLE_NAME}" (${cols.join(", ")}) VALUES (${vals.join(", ")})`;
+}
+/** Build the `INSERT INTO "source_graph_versions" (...) VALUES (...)` statement for one version row. */
+function buildInsertVersionSql(row) {
+    const cols = [
+        "nectar",
+        "content_hash",
+        "seq",
+        "path",
+        "filename",
+        "ext",
+        "size_bytes",
+        "mtime_observed",
+        "title",
+        "description",
+        "concepts",
+        "embedding",
+        "confidence",
+        "fingerprint",
+        "described_at",
+        "describe_model",
+        "describe_status",
+        "observed_at",
+        "org_id",
+        "workspace_id",
+        "project_id",
+        "last_update_date",
+    ];
+    const vals = [
+        sLiteral(row.nectar),
+        sLiteral(row.contentHash),
+        sqlNum(row.seq),
+        sLiteral(row.path),
+        sLiteral(row.filename),
+        sLiteral(row.ext),
+        sqlNum(row.sizeBytes),
+        sLiteral(row.mtimeObserved),
+        // Free-text fields may carry backslashes/newlines; use the E'...' form.
+        eLiteral(row.title),
+        eLiteral(row.description),
+        eLiteral(row.concepts),
+        row.embedding !== null ? sqlFloat4Array(row.embedding) : "NULL",
+        row.confidence !== null ? sqlNum(row.confidence) : "NULL",
+        row.fingerprint !== null ? sLiteral(row.fingerprint) : "NULL",
+        sLiteral(row.describedAt),
+        sLiteral(row.describeModel),
+        sLiteral(row.describeStatus),
+        sLiteral(row.observedAt),
+        sLiteral(row.orgId),
+        sLiteral(row.workspaceId),
+        sLiteral(row.projectId),
+        sLiteral(row.lastUpdateDate),
+    ];
+    return `INSERT INTO "${SOURCE_GRAPH_VERSIONS_TABLE_NAME}" (${cols.join(", ")}) VALUES (${vals.join(", ")})`;
+}
+/** The `AND`-joined tenancy predicate (`org_id`/`workspace_id`/`project_id`), never omitting `project_id`. */
+function tenancyPredicate(tenancy) {
+    return (`org_id = ${sLiteral(tenancy.orgId)} AND ` +
+        `workspace_id = ${sLiteral(tenancy.workspaceId)} AND ` +
+        `project_id = ${sLiteral(tenancy.projectId)}`);
+}
+export class DeepLakeSourceGraphStore {
+    transport;
+    constructor(options) {
+        this.transport =
+            options.transport ??
+                new HttpDeepLakeTransport({
+                    endpoint: options.credentials.apiUrl,
+                    token: options.credentials.token,
+                    orgId: options.credentials.orgId,
+                    workspaceId: options.credentials.workspaceId,
+                    ...(options.timeoutMs !== undefined ? { timeoutMs: options.timeoutMs } : {}),
+                });
+    }
+    /**
+     * Run a READ statement, tolerating a missing-table failure as "no data yet"
+     * (an empty result), exactly like honeycomb's read-path guard
+     * (`tableExists`, `src/daemon/storage/heal.ts:171-175`) fails OPEN rather
+     * than provoking a CREATE. Only the missing-table shape is tolerated; a
+     * genuine connection/timeout/permission/syntax failure still propagates.
+     * Reads never create a table - only a write does, via `withHeal`.
+     */
+    async readTolerant(sql) {
+        try {
+            return await this.transport.query(sql);
+        }
+        catch (err) {
+            if (err instanceof TransportError && isMissingTableError(err))
+                return [];
+            throw err;
+        }
+    }
+    /**
+     * Insert-only mint, mirroring honeycomb's SELECT-before-INSERT write
+     * pattern (`selectBeforeInsert`, `src/daemon/storage/writes.ts:325-360`)
+     * rather than relying on a Deep Lake UNIQUE constraint: the Deep Lake SQL
+     * surface this adapter targets has no reliably-enforced uniqueness
+     * constraint to lean on, so "does the nectar already exist" is answered by
+     * probing first. Both the probe and the insert are heal-aware (a fresh
+     * tenancy's tables may not exist yet).
+     *
+     * After the insert, a best-effort re-verify SELECT counts the rows for the
+     * nectar; more than one means a race doubled it. Deep Lake offers no
+     * transactions, so this cannot PREVENT a race, only make it observable
+     * (the same limitation honeycomb documents). In practice a real race here
+     * is a near-zero-probability event - a nectar is a 26-char ULID with 80
+     * bits of randomness (`ulid.ts`), not a narrow key space two writers could
+     * plausibly collide on - so a failure of the re-verify SELECT itself
+     * (e.g. a transient network hiccup immediately after a successful insert)
+     * does not fail the whole call; the insert already succeeded and the
+     * re-verify is an observability nicety, not the source of truth.
+     */
+    async insertIdentity(row) {
+        const probeSql = `SELECT nectar FROM "${SOURCE_GRAPH_TABLE_NAME}" WHERE nectar = ${sLiteral(row.nectar)} LIMIT 1`;
+        const probeRows = await withHeal(this.transport, SOURCE_GRAPH_TABLE, () => this.transport.query(probeSql));
+        if (probeRows.length > 0) {
+            throw new Error(`identity already exists for nectar ${row.nectar}`);
+        }
+        const insertSql = buildInsertIdentitySql(row);
+        await withHeal(this.transport, SOURCE_GRAPH_TABLE, () => this.transport.query(insertSql));
+        const verifySql = `SELECT nectar FROM "${SOURCE_GRAPH_TABLE_NAME}" WHERE nectar = ${sLiteral(row.nectar)}`;
+        const verifyRows = await this.transport.query(verifySql).catch(() => []);
+        if (verifyRows.length > 1) {
+            throw new Error(`race detected inserting identity for nectar ${row.nectar}: ${verifyRows.length} rows present after insert`);
+        }
+    }
+    async getIdentity(nectar) {
+        const sql = `SELECT * FROM "${SOURCE_GRAPH_TABLE_NAME}" WHERE nectar = ${sLiteral(nectar)} LIMIT 1`;
+        const rows = await this.readTolerant(sql);
+        return rows.length > 0 ? toIdentityRow(rows[0]) : undefined;
+    }
+    /**
+     * Bump `last_update_date` via an in-place `UPDATE`.
+     *
+     * KNOWN CAVEAT: honeycomb's own operational history found that an in-place
+     * `UPDATE ... WHERE id = ...` does not reliably land on this backend under
+     * load - a by-id point read can still return a pre-update snapshot from a
+     * stale segment (see honeycomb `src/daemon/storage/catalog/tenancy.ts:475-489`,
+     * where the equivalent revoke-by-UPDATE was RETIRED in favor of an
+     * append-only version-bump for that reason). `source_graph`'s catalog entry
+     * (`schema.ts`) nonetheless declares `writePattern: "update-or-insert"` for
+     * this exact field, and `last_update_date` is a low-stakes denormalized
+     * "last observed change" timestamp (not an authorization-bearing flag like
+     * the retired revoke), so this adapter uses `UPDATE` as declared rather than
+     * inventing an append-based scheme the schema does not define. If
+     * `last_update_date` staleness proves to be a real problem in practice, a
+     * future PRD should revisit this the same way honeycomb did - not this
+     * adapter, which mirrors the declared write pattern faithfully.
+     */
+    async touchIdentity(nectar, lastUpdateDate) {
+        const sql = `UPDATE "${SOURCE_GRAPH_TABLE_NAME}" SET last_update_date = ${sLiteral(lastUpdateDate)} ` +
+            `WHERE nectar = ${sLiteral(nectar)}`;
+        await withHeal(this.transport, SOURCE_GRAPH_TABLE, () => this.transport.query(sql));
+    }
+    async appendVersion(row) {
+        const insertSql = buildInsertVersionSql(row);
+        await withHeal(this.transport, SOURCE_GRAPH_VERSIONS_TABLE, () => this.transport.query(insertSql));
+    }
+    /**
+     * The next monotonic seq for a nectar: MAX(seq)+1 over every version row,
+     * computed client-side by {@link reduceLatestVersion} rather than trusted
+     * to an SQL `ORDER BY`/`LIMIT`/`MAX()` clause. See that function's docblock
+     * for why.
+     */
+    async nextSeq(nectar) {
+        const sql = `SELECT seq FROM "${SOURCE_GRAPH_VERSIONS_TABLE_NAME}" WHERE nectar = ${sLiteral(nectar)}`;
+        const rows = await this.readTolerant(sql);
+        if (rows.length === 0)
+            return 0;
+        let maxSeq = toNum(rows[0]?.seq);
+        for (const row of rows) {
+            const seq = toNum(row.seq);
+            if (seq > maxSeq)
+                maxSeq = seq;
+        }
+        return maxSeq + 1;
+    }
+    /** The latest (MAX seq) version row for a nectar; see {@link reduceLatestVersion}. */
+    async latestVersion(nectar) {
+        const sql = `SELECT * FROM "${SOURCE_GRAPH_VERSIONS_TABLE_NAME}" WHERE nectar = ${sLiteral(nectar)}`;
+        const rows = await this.readTolerant(sql);
+        return reduceLatestVersion(rows);
+    }
+    /**
+     * Every nectar's latest version, scoped by the full tenancy predicate
+     * (`org_id`/`workspace_id`/`project_id`, PRD-005c). Fetches every identity
+     * and every version row for the tenancy and reduces to "latest per nectar"
+     * in application code, mirroring `InMemorySourceGraphStore.listLatestVersions`'s
+     * iterate-and-reduce shape rather than pushing a `GROUP BY`/window-function
+     * reduction into SQL. This is not optimized for a very large per-tenant
+     * row count; a future PRD could push the "latest per nectar" reduction into
+     * SQL if that becomes the bottleneck. It is not this adapter's job to
+     * diverge from the reference in-memory implementation's behavior to chase
+     * that optimization prematurely.
+     */
+    async listLatestVersions(tenancy) {
+        const predicate = tenancyPredicate(tenancy);
+        const identitiesSql = `SELECT * FROM "${SOURCE_GRAPH_TABLE_NAME}" WHERE ${predicate}`;
+        const versionsSql = `SELECT * FROM "${SOURCE_GRAPH_VERSIONS_TABLE_NAME}" WHERE ${predicate}`;
+        const [identityRows, versionRows] = await Promise.all([
+            this.readTolerant(identitiesSql),
+            this.readTolerant(versionsSql),
+        ]);
+        // Group raw version rows by nectar first, then reduce each group with the
+        // SAME `reduceLatestVersion` helper `nextSeq`/`latestVersion` use, so
+        // there is exactly one "pick the highest seq" implementation in this file.
+        const rowsByNectar = new Map();
+        for (const raw of versionRows) {
+            const nectar = toStr(raw.nectar);
+            const group = rowsByNectar.get(nectar);
+            if (group === undefined)
+                rowsByNectar.set(nectar, [raw]);
+            else
+                group.push(raw);
+        }
+        const out = [];
+        for (const raw of identityRows) {
+            const identity = toIdentityRow(raw);
+            const group = rowsByNectar.get(identity.nectar);
+            const version = group !== undefined ? reduceLatestVersion(group) : undefined;
+            if (version !== undefined)
+                out.push({ identity, version });
+        }
+        return out;
+    }
+    async latestVersionByPath(tenancy, path) {
+        const all = await this.listLatestVersions(tenancy);
+        return all.find((lv) => lv.version.path === path);
+    }
+    async latestVersionByHash(tenancy, contentHash) {
+        const all = await this.listLatestVersions(tenancy);
+        return all.find((lv) => lv.version.contentHash === contentHash);
+    }
+    /**
+     * Delete a nectar (identity + versions) scoped to `tenancy`, the SOLE deletion
+     * path (`prune --confirm`, PRD-006d). Both DELETE statements carry the full
+     * tenancy predicate (`org_id`/`workspace_id`/`project_id`, never omitting
+     * `project_id`) alongside the nectar key, so a nectar minted under another
+     * project is never removed by a delete issued in this tenancy (AC-20).
+     *
+     * The delete path deliberately does NOT go through `withHeal`: a missing table
+     * means there is nothing to delete, so it is a harmless no-op, NOT a reason to
+     * CREATE a fresh (empty) table. `deleteTolerant` therefore swallows only the
+     * missing-table transport error (via `isMissingTableError`, the same
+     * classification the read path uses) and lets every other failure propagate.
+     */
+    async deleteNectar(tenancy, nectar) {
+        const predicate = tenancyPredicate(tenancy);
+        const nectarKey = sLiteral(nectar);
+        const deleteVersionsSql = `DELETE FROM "${SOURCE_GRAPH_VERSIONS_TABLE_NAME}" WHERE nectar = ${nectarKey} AND ${predicate}`;
+        const deleteIdentitySql = `DELETE FROM "${SOURCE_GRAPH_TABLE_NAME}" WHERE nectar = ${nectarKey} AND ${predicate}`;
+        await this.deleteTolerant(deleteVersionsSql);
+        await this.deleteTolerant(deleteIdentitySql);
+    }
+    /**
+     * Run a DELETE, tolerating a missing-table failure as "nothing to delete" (a
+     * no-op). Never creates a table. Any other transport failure propagates.
+     */
+    async deleteTolerant(sql) {
+        try {
+            await this.transport.query(sql);
+        }
+        catch (err) {
+            if (err instanceof TransportError && isMissingTableError(err))
+                return;
+            throw err;
+        }
+    }
+}
+//# sourceMappingURL=deeplake-store.js.map

package/dist/source-graph/deeplake-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deeplake-store.js","sourceRoot":"","sources":["../../src/source-graph/deeplake-store.ts"],"names":[],"mappings":"AA8BA,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,2BAA2B,EAAE,MAAM,aAAa,CAAC;AAG9E,OAAO,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEhF,OAAO,EAAE,mBAAmB,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEvF,MAAM,uBAAuB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAClE,MAAM,gCAAgC,GAAG,QAAQ,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;AAsBpF,SAAS,KAAK,CAAC,KAAc;IAC3B,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,KAAK,CAAC,KAAc;IAC3B,MAAM,CAAC,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5D,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAc;IACtC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAK,iBAAuC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1F,OAAO,KAAuB,CAAC;IACjC,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,iDAAiD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC5F,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,CAAC,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5D,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC;AAED,qEAAqE;AACrE,SAAS,aAAa,CAAC,GAAgB;IACrC,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QACzB,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM;QACrD,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAChC,iBAAiB,EAAE,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC;QACjD,eAAe,EAAE,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC;QAC7C,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QACxB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;QACpC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAChC,cAAc,EAAE,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED,qFAAqF;AACrF,SAAS,YAAY,CAAC,GAAgB;IACpC,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QACzB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;QACpC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;QACnB,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;QACrB,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC7B,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;QACnB,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAChC,aAAa,EAAE,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC;QACxC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;QACvB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC;QACnC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC7B,SAAS,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;QACrC,UAAU,EAAE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC;QACxC,WAAW,EAAE,OAAO,GAAG,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI;QACzE,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;QACpC,aAAa,EAAE,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC;QACxC,cAAc,EAAE,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC;QACrD,UAAU,EAAE,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC;QAClC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QACxB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;QACpC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;QAChC,cAAc,EAAE,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,mBAAmB,CAAC,IAA4B;IACvD,IAAI,MAAyC,CAAC;IAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG;YAAE,MAAM,GAAG,OAAO,CAAC;IACzE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gGAAgG;AAChG,SAAS,sBAAsB,CAAC,GAAmB;IACjD,MAAM,IAAI,GAAG;QACX,QAAQ;QACR,MAAM;QACN,YAAY;QACZ,qBAAqB;QACrB,mBAAmB;QACnB,QAAQ;QACR,cAAc;QACd,YAAY;QACZ,kBAAkB;KACnB,CAAC;IACF,MAAM,IAAI,GAAG;QACX,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;QACpB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;QAClB,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC;QAC7B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC;KAC7B,CAAC;IACF,OAAO,gBAAgB,uBAAuB,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACrG,CAAC;AAED,wGAAwG;AACxG,SAAS,qBAAqB,CAAC,GAA0B;IACvD,MAAM,IAAI,GAAG;QACX,QAAQ;QACR,cAAc;QACd,KAAK;QACL,MAAM;QACN,UAAU;QACV,KAAK;QACL,YAAY;QACZ,gBAAgB;QAChB,OAAO;QACP,aAAa;QACb,UAAU;QACV,WAAW;QACX,YAAY;QACZ,aAAa;QACb,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,aAAa;QACb,QAAQ;QACR,cAAc;QACd,YAAY;QACZ,kBAAkB;KACnB,CAAC;IACF,MAAM,IAAI,GAAG;QACX,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;QACpB,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QACf,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;QAClB,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;QACtB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC;QAC3B,wEAAwE;QACxE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;QACtB,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM;QAC/D,GAAG,CAAC,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM;QACzD,GAAG,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM;QAC7D,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC;QACxB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;QACnB,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC;KAC7B,CAAC;IACF,OAAO,gBAAgB,gCAAgC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AAC9G,CAAC;AAED,8GAA8G;AAC9G,SAAS,gBAAgB,CAAC,OAAgB;IACxC,OAAO,CACL,YAAY,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO;QAC1C,kBAAkB,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO;QACtD,gBAAgB,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAC9C,CAAC;AACJ,CAAC;AAED,MAAM,OAAO,wBAAwB;IAClB,SAAS,CAAc;IAExC,YAAY,OAAwC;QAClD,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,SAAS;gBACjB,IAAI,qBAAqB,CAAC;oBACxB,QAAQ,EAAE,OAAO,CAAC,WAAW,CAAC,MAAM;oBACpC,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK;oBAChC,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK;oBAChC,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC,WAAW;oBAC5C,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC7E,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;OAOG;IACK,KAAK,CAAC,YAAY,CAAC,GAAW;QACpC,IAAI,CAAC;YACH,OAAO,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC;QAAC,OAAO,GAAY,EAAE,CAAC;YACtB,IAAI,GAAG,YAAY,cAAc,IAAI,mBAAmB,CAAC,GAAG,CAAC;gBAAE,OAAO,EAAE,CAAC;YACzE,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,KAAK,CAAC,cAAc,CAAC,GAAmB;QACtC,MAAM,QAAQ,GAAG,uBAAuB,uBAAuB,oBAAoB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC;QAClH,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3G,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,SAAS,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;QAE1F,MAAM,SAAS,GAAG,uBAAuB,uBAAuB,oBAAoB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3G,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAkB,EAAE,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACb,+CAA+C,GAAG,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,4BAA4B,CAC5G,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,MAAM,GAAG,GAAG,kBAAkB,uBAAuB,oBAAoB,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC;QACpG,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAgB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7E,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,KAAK,CAAC,aAAa,CAAC,MAAc,EAAE,cAAsB;QACxD,MAAM,GAAG,GACP,WAAW,uBAAuB,4BAA4B,QAAQ,CAAC,cAAc,CAAC,GAAG;YACzF,kBAAkB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACvC,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,GAA0B;QAC5C,MAAM,SAAS,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,2BAA2B,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;IACrG,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CAAC,MAAc;QAC1B,MAAM,GAAG,GAAG,oBAAoB,gCAAgC,oBAAoB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACvG,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAChC,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,GAAG,GAAG,MAAM;gBAAE,MAAM,GAAG,GAAG,CAAC;QACjC,CAAC;QACD,OAAO,MAAM,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,sFAAsF;IACtF,KAAK,CAAC,aAAa,CAAC,MAAc;QAChC,MAAM,GAAG,GAAG,kBAAkB,gCAAgC,oBAAoB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACrG,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAC1C,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,kBAAkB,CAAC,OAAgB;QACvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,kBAAkB,uBAAuB,WAAW,SAAS,EAAE,CAAC;QACtF,MAAM,WAAW,GAAG,kBAAkB,gCAAgC,WAAW,SAAS,EAAE,CAAC;QAC7F,MAAM,CAAC,YAAY,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACpD,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC;YAChC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC;SAC/B,CAAC,CAAC;QAEH,0EAA0E;QAC1E,sEAAsE;QACtE,2EAA2E;QAC3E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;QACtD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS;gBAAE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;gBACpD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,GAAG,GAAoB,EAAE,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChD,MAAM,OAAO,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7E,IAAI,OAAO,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,OAAgB,EAAE,IAAY;QACtD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACnD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,OAAgB,EAAE,WAAmB;QAC7D,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACnD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,WAAW,KAAK,WAAW,CAAC,CAAC;IAClE,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,YAAY,CAAC,OAAgB,EAAE,MAAc;QACjD,MAAM,SAAS,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,iBAAiB,GACrB,gBAAgB,gCAAgC,oBAAoB,SAAS,QAAQ,SAAS,EAAE,CAAC;QACnG,MAAM,iBAAiB,GACrB,gBAAgB,uBAAuB,oBAAoB,SAAS,QAAQ,SAAS,EAAE,CAAC;QAC1F,MAAM,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC;QAC7C,MAAM,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,cAAc,CAAC,GAAW;QACtC,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QAAC,OAAO,GAAY,EAAE,CAAC;YACtB,IAAI,GAAG,YAAY,cAAc,IAAI,mBAAmB,CAAC,GAAG,CAAC;gBAAE,OAAO;YACtE,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;CACF"}

package/dist/source-graph/deeplake-transport.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Minimal Deep Lake HTTP transport for hivenectar (PRD-005).
+ *
+ * Per ADR-0002, hivenectar 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 source-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 hivenectar's zero-runtime-dependency rule (AGENTS.md).
+ *
+ * The transport is deliberately thin: no retry, no concurrency bounding.
+ * Hivenectar'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 hivenectar's write
+ * volume grows to need it.
+ */
+/** What kind of failure the transport hit. */
+export type TransportErrorKind = "query" | "connection" | "timeout";
+/**
+ * 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 declare class TransportError extends Error {
+    readonly kind: TransportErrorKind;
+    readonly status?: number;
+    constructor(kind: TransportErrorKind, message: string, status?: number);
+}
+/** One row of a Deep Lake query result: column name -> raw JSON value. */
+export type DeepLakeRow = Record<string, unknown>;
+/** Header name Deep Lake reads to attribute traffic by client family. */
+export declare const DEEPLAKE_CLIENT_HEADER = "X-Deeplake-Client";
+/** Header name Deep Lake reads to scope a request to an org partition. */
+export declare const DEEPLAKE_ORG_HEADER = "X-Activeloop-Org-Id";
+/** Default per-statement timeout when the caller does not override it. */
+export declare const DEFAULT_TRANSPORT_TIMEOUT_MS = 15000;
+/** Fixed connection details a transport instance targets for its lifetime. */
+export interface DeepLakeTransportConfig {
+    /** Deep Lake HTTP query endpoint, e.g. https://api.deeplake.ai. */
+    readonly endpoint: string;
+    /** Bearer token. Never logged in full; see `deeplake-credentials.ts#redactToken`. */
+    readonly token: string;
+    /** Org id sent as a request header so Deep Lake enforces tenancy. */
+    readonly orgId: string;
+    /** Workspace/partition the statement targets (the URL path segment). */
+    readonly workspaceId: string;
+    /** Per-statement timeout in ms; defaults to {@link DEFAULT_TRANSPORT_TIMEOUT_MS}. */
+    readonly timeoutMs?: number;
+}
+/**
+ * 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 declare class HttpDeepLakeTransport {
+    private readonly endpoint;
+    private readonly token;
+    private readonly orgId;
+    private readonly workspaceId;
+    private readonly timeoutMs;
+    constructor(config: DeepLakeTransportConfig);
+    /** Run one SQL statement against the configured workspace. */
+    query(sql: string): Promise<DeepLakeRow[]>;
+}
+//# sourceMappingURL=deeplake-transport.d.ts.map

package/dist/source-graph/deeplake-transport.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deeplake-transport.d.ts","sourceRoot":"","sources":["../../src/source-graph/deeplake-transport.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,8CAA8C;AAC9C,MAAM,MAAM,kBAAkB,GAAG,OAAO,GAAG,YAAY,GAAG,SAAS,CAAC;AAEpE;;;;GAIG;AACH,qBAAa,cAAe,SAAQ,KAAK;IACvC,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAClC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;gBACb,IAAI,EAAE,kBAAkB,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM;CAMvE;AAED,0EAA0E;AAC1E,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAElD,yEAAyE;AACzE,eAAO,MAAM,sBAAsB,sBAAsB,CAAC;AAC1D,0EAA0E;AAC1E,eAAO,MAAM,mBAAmB,wBAAwB,CAAC;AACzD,0EAA0E;AAC1E,eAAO,MAAM,4BAA4B,QAAS,CAAC;AAEnD,8EAA8E;AAC9E,MAAM,WAAW,uBAAuB;IACtC,mEAAmE;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,qFAAqF;IACrF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,qEAAqE;IACrE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,wEAAwE;IACxE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,qFAAqF;IACrF,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;GAOG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEvB,MAAM,EAAE,uBAAuB;IAQ3C,8DAA8D;IACxD,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;CAoCjD"}

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

@@ -0,0 +1,107 @@
+/**
+ * Minimal Deep Lake HTTP transport for hivenectar (PRD-005).
+ *
+ * Per ADR-0002, hivenectar 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 source-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 hivenectar's zero-runtime-dependency rule (AGENTS.md).
+ *
+ * The transport is deliberately thin: no retry, no concurrency bounding.
+ * Hivenectar'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 hivenectar'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. */
+    async query(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]: "hivenectar",
+                },
+                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]])));
+    }
+}
+//# sourceMappingURL=deeplake-transport.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"deeplake-transport.js","sourceRoot":"","sources":["../../src/source-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,8DAA8D;IAC9D,KAAK,CAAC,KAAK,CAAC,GAAW;QACrB,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,YAAY;iBACvC;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"}

package/dist/source-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/source-graph/hash.d.ts.map

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

package/dist/source-graph/hash.js

@@ -0,0 +1,12 @@
+/**
+ * Content hashing for the Source Graph (PRD-005 / PRD-006).
+ *
+ * `content_hash` is the sha256 of file content at observation, and the composite
+ * key part 2 on `source_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/source-graph/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/source-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"}