@jamesaphoenix/tx-core 0.4.1

package/dist/services/deduplication-service.js

@@ -0,0 +1,145 @@
+import { Context, Effect, Layer } from "effect";
+import { DeduplicationRepository } from "../repo/deduplication-repo.js";
+import { hashContent } from "../mappers/deduplication.js";
+/**
+ * Default batch size for hash checking operations.
+ * Balances between query efficiency and memory usage.
+ */
+const DEFAULT_BATCH_SIZE = 100;
+/**
+ * DeduplicationService handles JSONL line deduplication via SHA256 hashing.
+ * Tracks processed content hashes to skip already-seen lines.
+ * Supports incremental processing by tracking file progress.
+ */
+export class DeduplicationService extends Context.Tag("DeduplicationService")() {
+}
+export const DeduplicationServiceLive = Layer.effect(DeduplicationService, Effect.gen(function* () {
+    const repo = yield* DeduplicationRepository;
+    return {
+        processLine: (content, filePath, lineNumber) => Effect.gen(function* () {
+            const hash = hashContent(content);
+            const exists = yield* repo.hashExists(hash);
+            if (exists) {
+                return {
+                    hash,
+                    isNew: false,
+                    lineNumber,
+                    content
+                };
+            }
+            // Record the new hash
+            yield* repo.insertHash({
+                contentHash: hash,
+                sourceFile: filePath,
+                sourceLine: lineNumber
+            });
+            return {
+                hash,
+                isNew: true,
+                lineNumber,
+                content
+            };
+        }),
+        processLines: (lines, filePath, options = {}) => Effect.gen(function* () {
+            const startTime = Date.now();
+            const batchSize = options.batchSize ?? DEFAULT_BATCH_SIZE;
+            const startLine = options.startLine ?? 1;
+            const maxLines = options.maxLines;
+            // Filter to lines we should process
+            let linesToProcess = lines.filter(l => l.lineNumber >= startLine);
+            if (maxLines !== undefined) {
+                linesToProcess = linesToProcess.slice(0, maxLines);
+            }
+            if (linesToProcess.length === 0) {
+                return {
+                    filePath,
+                    totalLines: lines.length,
+                    newLines: 0,
+                    skippedLines: 0,
+                    startLine,
+                    endLine: startLine - 1,
+                    duration: Date.now() - startTime
+                };
+            }
+            // Compute hashes for all lines
+            const lineHashes = linesToProcess.map(l => ({
+                ...l,
+                hash: hashContent(l.content)
+            }));
+            // Check existing hashes in batches
+            let existingHashes = new Set();
+            for (let i = 0; i < lineHashes.length; i += batchSize) {
+                const batch = lineHashes.slice(i, i + batchSize);
+                const batchHashes = batch.map(l => l.hash);
+                const batchExisting = yield* repo.hashesExist(batchHashes);
+                existingHashes = new Set([...existingHashes, ...batchExisting]);
+            }
+            // Separate new and existing lines
+            const newLines = lineHashes.filter(l => !existingHashes.has(l.hash));
+            const skippedLines = lineHashes.filter(l => existingHashes.has(l.hash));
+            // Insert new hashes in batches
+            if (newLines.length > 0) {
+                const hashInputs = newLines.map(l => ({
+                    contentHash: l.hash,
+                    sourceFile: filePath,
+                    sourceLine: l.lineNumber
+                }));
+                yield* repo.insertHashes(hashInputs);
+            }
+            // Calculate end line
+            const lastLine = linesToProcess[linesToProcess.length - 1];
+            const endLine = lastLine?.lineNumber ?? startLine - 1;
+            return {
+                filePath,
+                totalLines: lines.length,
+                newLines: newLines.length,
+                skippedLines: skippedLines.length,
+                startLine,
+                endLine,
+                duration: Date.now() - startTime
+            };
+        }),
+        isProcessed: (content) => Effect.gen(function* () {
+            const hash = hashContent(content);
+            return yield* repo.hashExists(hash);
+        }),
+        filterProcessed: (contents) => Effect.gen(function* () {
+            if (contents.length === 0)
+                return new Set();
+            // Compute hashes and check
+            const contentHashMap = new Map();
+            for (const content of contents) {
+                contentHashMap.set(hashContent(content), content);
+            }
+            const existingHashes = yield* repo.hashesExist([...contentHashMap.keys()]);
+            // Return the original content strings that have been processed
+            const processedContents = new Set();
+            for (const hash of existingHashes) {
+                const content = contentHashMap.get(hash);
+                if (content)
+                    processedContents.add(content);
+            }
+            return processedContents;
+        }),
+        getProgress: (filePath) => repo.getFileProgress(filePath),
+        updateProgress: (filePath, lastLineProcessed, lastByteOffset, fileSize, fileChecksum) => repo.upsertFileProgress({
+            filePath,
+            lastLineProcessed,
+            lastByteOffset,
+            fileSize,
+            fileChecksum
+        }),
+        resetFile: (filePath) => Effect.gen(function* () {
+            const hashesDeleted = yield* repo.deleteHashesForFile(filePath);
+            yield* repo.deleteFileProgress(filePath);
+            return { hashesDeleted };
+        }),
+        getStats: () => Effect.gen(function* () {
+            const totalHashes = yield* repo.countHashes();
+            const trackedFiles = yield* repo.countFiles();
+            return { totalHashes, trackedFiles };
+        }),
+        computeHash: hashContent
+    };
+}));
+//# sourceMappingURL=deduplication-service.js.map

package/dist/services/deduplication-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deduplication-service.js","sourceRoot":"","sources":["../../src/services/deduplication-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAA;AACvE,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAA;AASzD;;;GAGG;AACH,MAAM,kBAAkB,GAAG,GAAG,CAAA;AAE9B;;;;GAIG;AACH,MAAM,OAAO,oBAAqB,SAAQ,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,EAwE1E;CAAG;AAEN,MAAM,CAAC,MAAM,wBAAwB,GAAG,KAAK,CAAC,MAAM,CAClD,oBAAoB,EACpB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,uBAAuB,CAAA;IAE3C,OAAO;QACL,WAAW,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,CAC7C,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAA;YACjC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YAE3C,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO;oBACL,IAAI;oBACJ,KAAK,EAAE,KAAK;oBACZ,UAAU;oBACV,OAAO;iBACR,CAAA;YACH,CAAC;YAED,sBAAsB;YACtB,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;gBACrB,WAAW,EAAE,IAAI;gBACjB,UAAU,EAAE,QAAQ;gBACpB,UAAU,EAAE,UAAU;aACvB,CAAC,CAAA;YAEF,OAAO;gBACL,IAAI;gBACJ,KAAK,EAAE,IAAI;gBACX,UAAU;gBACV,OAAO;aACR,CAAA;QACH,CAAC,CAAC;QAEJ,YAAY,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,GAAG,EAAE,EAAE,EAAE,CAC9C,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;YAC5B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAA;YACzD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAA;YACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAA;YAEjC,oCAAoC;YACpC,IAAI,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,SAAS,CAAC,CAAA;YACjE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YACpD,CAAC;YAED,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO;oBACL,QAAQ;oBACR,UAAU,EAAE,KAAK,CAAC,MAAM;oBACxB,QAAQ,EAAE,CAAC;oBACX,YAAY,EAAE,CAAC;oBACf,SAAS;oBACT,OAAO,EAAE,SAAS,GAAG,CAAC;oBACtB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;iBACjC,CAAA;YACH,CAAC;YAED,+BAA+B;YAC/B,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC1C,GAAG,CAAC;gBACJ,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;aAC7B,CAAC,CAAC,CAAA;YAEH,mCAAmC;YACnC,IAAI,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;gBACtD,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAA;gBAChD,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBAC1C,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAA;gBAC1D,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,aAAa,CAAC,CAAC,CAAA;YACjE,CAAC;YAED,kCAAkC;YAClC,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;YACpE,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;YAEvE,+BAA+B;YAC/B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACpC,WAAW,EAAE,CAAC,CAAC,IAAI;oBACnB,UAAU,EAAE,QAAQ;oBACpB,UAAU,EAAE,CAAC,CAAC,UAAU;iBACzB,CAAC,CAAC,CAAA;gBACH,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAA;YACtC,CAAC;YAED,qBAAqB;YACrB,MAAM,QAAQ,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAC1D,MAAM,OAAO,GAAG,QAAQ,EAAE,UAAU,IAAI,SAAS,GAAG,CAAC,CAAA;YAErD,OAAO;gBACL,QAAQ;gBACR,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,QAAQ,EAAE,QAAQ,CAAC,MAAM;gBACzB,YAAY,EAAE,YAAY,CAAC,MAAM;gBACjC,SAAS;gBACT,OAAO;gBACP,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACjC,CAAA;QACH,CAAC,CAAC;QAEJ,WAAW,EAAE,CAAC,OAAO,EAAE,EAAE,CACvB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAA;YACjC,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACrC,CAAC,CAAC;QAEJ,eAAe,EAAE,CAAC,QAAQ,EAAE,EAAE,CAC5B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,GAAG,EAAU,CAAA;YAEnD,2BAA2B;YAC3B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA;YAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAA;YACnD,CAAC;YAED,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAE1E,+DAA+D;YAC/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAA;YAC3C,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACxC,IAAI,OAAO;oBAAE,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAC7C,CAAC;YAED,OAAO,iBAAiB,CAAA;QAC1B,CAAC,CAAC;QAEJ,WAAW,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC;QAEzD,cAAc,EAAE,CAAC,QAAQ,EAAE,iBAAiB,EAAE,cAAc,EAAE,QAAQ,EAAE,YAAY,EAAE,EAAE,CACtF,IAAI,CAAC,kBAAkB,CAAC;YACtB,QAAQ;YACR,iBAAiB;YACjB,cAAc;YACd,QAAQ;YACR,YAAY;SACb,CAAC;QAEJ,SAAS,EAAE,CAAC,QAAQ,EAAE,EAAE,CACtB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAA;YAC/D,KAAK,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAA;YACxC,OAAO,EAAE,aAAa,EAAE,CAAA;QAC1B,CAAC,CAAC;QAEJ,QAAQ,EAAE,GAAG,EAAE,CACb,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAA;YAC7C,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;YAC7C,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,CAAA;QACtC,CAAC,CAAC;QAEJ,WAAW,EAAE,WAAW;KACzB,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

package/dist/services/dep-service.d.ts

@@ -0,0 +1,14 @@
+import { Context, Effect, Layer } from "effect";
+import { DependencyRepository } from "../repo/dep-repo.js";
+import { TaskRepository } from "../repo/task-repo.js";
+import { ValidationError, CircularDependencyError, TaskNotFoundError, DatabaseError } from "../errors.js";
+import type { TaskId } from "@jamesaphoenix/tx-types";
+declare const DependencyService_base: Context.TagClass<DependencyService, "DependencyService", {
+    readonly addBlocker: (taskId: TaskId, blockerId: TaskId) => Effect.Effect<void, ValidationError | CircularDependencyError | TaskNotFoundError | DatabaseError>;
+    readonly removeBlocker: (taskId: TaskId, blockerId: TaskId) => Effect.Effect<void, DatabaseError>;
+}>;
+export declare class DependencyService extends DependencyService_base {
+}
+export declare const DependencyServiceLive: Layer.Layer<DependencyService, never, TaskRepository | DependencyRepository>;
+export {};
+//# sourceMappingURL=dep-service.d.ts.map

package/dist/services/dep-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-service.d.ts","sourceRoot":"","sources":["../../src/services/dep-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAA;AAC1D,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACrD,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AACzG,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAA;;yBAK5B,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,eAAe,GAAG,uBAAuB,GAAG,iBAAiB,GAAG,aAAa,CAAC;4BACtI,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC;;AAJrG,qBAAa,iBAAkB,SAAQ,sBAMpC;CAAG;AAEN,eAAO,MAAM,qBAAqB,8EAqCjC,CAAA"}

package/dist/services/dep-service.js

@@ -0,0 +1,34 @@
+import { Context, Effect, Layer } from "effect";
+import { DependencyRepository } from "../repo/dep-repo.js";
+import { TaskRepository } from "../repo/task-repo.js";
+import { ValidationError, CircularDependencyError, TaskNotFoundError } from "../errors.js";
+export class DependencyService extends Context.Tag("DependencyService")() {
+}
+export const DependencyServiceLive = Layer.effect(DependencyService, Effect.gen(function* () {
+    const depRepo = yield* DependencyRepository;
+    const taskRepo = yield* TaskRepository;
+    return {
+        addBlocker: (taskId, blockerId) => Effect.gen(function* () {
+            if (taskId === blockerId) {
+                return yield* Effect.fail(new ValidationError({ reason: "A task cannot block itself" }));
+            }
+            const task = yield* taskRepo.findById(taskId);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id: taskId }));
+            }
+            const blocker = yield* taskRepo.findById(blockerId);
+            if (!blocker) {
+                return yield* Effect.fail(new TaskNotFoundError({ id: blockerId }));
+            }
+            // Cycle detection: check if there's already a path from taskId to blockerId
+            // (i.e., blockerId is transitively blocked by taskId)
+            const wouldCycle = yield* depRepo.hasPath(blockerId, taskId);
+            if (wouldCycle) {
+                return yield* Effect.fail(new CircularDependencyError({ taskId, blockerId }));
+            }
+            yield* depRepo.insert(blockerId, taskId);
+        }),
+        removeBlocker: (taskId, blockerId) => depRepo.remove(blockerId, taskId)
+    };
+}));
+//# sourceMappingURL=dep-service.js.map

package/dist/services/dep-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-service.js","sourceRoot":"","sources":["../../src/services/dep-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAA;AAC1D,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACrD,OAAO,EAAE,eAAe,EAAE,uBAAuB,EAAE,iBAAiB,EAAiB,MAAM,cAAc,CAAA;AAGzG,MAAM,OAAO,iBAAkB,SAAQ,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAMpE;CAAG;AAEN,MAAM,CAAC,MAAM,qBAAqB,GAAG,KAAK,CAAC,MAAM,CAC/C,iBAAiB,EACjB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,oBAAoB,CAAA;IAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,cAAc,CAAA;IAEtC,OAAO;QACL,UAAU,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC,CAAC,CAAA;YAC1F,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAC7C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;YAClE,CAAC;YAED,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;YACnD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAA;YACrE,CAAC;YAED,4EAA4E;YAC5E,sDAAsD;YACtD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;YAC5D,IAAI,UAAU,EAAE,CAAC;gBACf,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,uBAAuB,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAA;YAC/E,CAAC;YAED,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;QAC1C,CAAC,CAAC;QAEJ,aAAa,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CACnC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC;KACpC,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

package/dist/services/diversifier-service.d.ts

@@ -0,0 +1,46 @@
+import { Context, Effect, Layer } from "effect";
+import type { LearningWithScore } from "@jamesaphoenix/tx-types";
+declare const DiversifierService_base: Context.TagClass<DiversifierService, "DiversifierService", {
+    /**
+     * Apply MMR diversification to scored candidates.
+     *
+     * @param candidates - Learnings with scores, sorted by relevance (highest first)
+     * @param limit - Maximum number of results to return
+     * @param lambda - Balance between relevance (1.0) and diversity (0.0), default 0.7
+     * @returns Diversified list of learnings, maintaining score order within diversity constraints
+     */
+    readonly mmrDiversify: (candidates: readonly LearningWithScore[], limit: number, lambda?: number) => Effect.Effect<readonly LearningWithScore[]>;
+}>;
+/**
+ * DiversifierService provides Maximal Marginal Relevance (MMR) diversification
+ * for search results to balance relevance and diversity.
+ *
+ * MMR iteratively selects items that are both relevant to the query AND
+ * dissimilar to already-selected items, preventing redundant results.
+ *
+ * Design: PRD-010 specifies diversity as a key quality metric for learning retrieval.
+ * The service also applies category-based limits to prevent over-representation.
+ */
+export declare class DiversifierService extends DiversifierService_base {
+}
+/**
+ * Noop implementation - returns candidates unchanged (just truncated to limit).
+ * Used when diversification is not needed or for testing.
+ */
+export declare const DiversifierServiceNoop: Layer.Layer<DiversifierService, never, never>;
+/**
+ * Live implementation with full MMR algorithm and category limits.
+ *
+ * Algorithm:
+ * 1. If no embeddings available, fallback to relevance-only ordering with category limits
+ * 2. Start with the highest-relevance item
+ * 3. Iteratively select the item with highest MMR score that doesn't violate category limits
+ * 4. Repeat until limit reached or no candidates remain
+ */
+export declare const DiversifierServiceLive: Layer.Layer<DiversifierService, never, never>;
+/**
+ * Auto layer - uses Live implementation since MMR has no external dependencies.
+ */
+export declare const DiversifierServiceAuto: Layer.Layer<DiversifierService, never, never>;
+export {};
+//# sourceMappingURL=diversifier-service.d.ts.map

package/dist/services/diversifier-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diversifier-service.d.ts","sourceRoot":"","sources":["../../src/services/diversifier-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAA;;IAgB5D;;;;;;;OAOG;2BACoB,CACrB,UAAU,EAAE,SAAS,iBAAiB,EAAE,EACxC,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM,KACZ,MAAM,CAAC,MAAM,CAAC,SAAS,iBAAiB,EAAE,CAAC;;AAzBpD;;;;;;;;;GASG;AACH,qBAAa,kBAAmB,SAAQ,uBAiBrC;CAAG;AAmGN;;;GAGG;AACH,eAAO,MAAM,sBAAsB,+CAMlC,CAAA;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,sBAAsB,+CAyElC,CAAA;AA4CD;;GAEG;AACH,eAAO,MAAM,sBAAsB,+CAAyB,CAAA"}

package/dist/services/diversifier-service.js

@@ -0,0 +1,197 @@
+import { Context, Effect, Layer } from "effect";
+import { cosineSimilarity } from "../utils/math.js";
+/**
+ * DiversifierService provides Maximal Marginal Relevance (MMR) diversification
+ * for search results to balance relevance and diversity.
+ *
+ * MMR iteratively selects items that are both relevant to the query AND
+ * dissimilar to already-selected items, preventing redundant results.
+ *
+ * Design: PRD-010 specifies diversity as a key quality metric for learning retrieval.
+ * The service also applies category-based limits to prevent over-representation.
+ */
+export class DiversifierService extends Context.Tag("DiversifierService")() {
+}
+/**
+ * Default lambda value for MMR.
+ * 0.7 weights relevance higher than diversity (70/30 split).
+ * Higher values = more relevant results, lower values = more diverse.
+ */
+const DEFAULT_LAMBDA = 0.7;
+/**
+ * Maximum items from the same category allowed in top N results.
+ * Per task spec: max 2 results from same category in top 5.
+ */
+const CATEGORY_LIMIT_TOP_N = 5;
+const CATEGORY_MAX_PER_TOP_N = 2;
+/**
+ * Calculate maximum cosine similarity between a candidate and selected items.
+ * Returns 0 if candidate has no embedding or selected set is empty.
+ */
+const maxSimilarityToSelected = (candidate, selected) => {
+    // No embedding means we can't compute similarity
+    if (!candidate.embedding) {
+        return 0;
+    }
+    // No selected items yet
+    if (selected.length === 0) {
+        return 0;
+    }
+    let maxSim = -Infinity;
+    for (const item of selected) {
+        // Skip items without embeddings
+        if (!item.embedding) {
+            continue;
+        }
+        const sim = cosineSimilarity(candidate.embedding, item.embedding);
+        if (sim > maxSim) {
+            maxSim = sim;
+        }
+    }
+    // If no valid comparisons were made, return 0
+    return maxSim === -Infinity ? 0 : maxSim;
+};
+/**
+ * Calculate MMR score for a candidate.
+ *
+ * Formula: λ * relevance(item) - (1-λ) * max_similarity(item, selected_items)
+ *
+ * Higher lambda means more weight on relevance.
+ * Lower lambda means more weight on diversity (dissimilarity).
+ */
+const mmrScore = (candidate, selected, lambda) => {
+    const relevance = candidate.relevanceScore;
+    const maxSim = maxSimilarityToSelected(candidate, selected);
+    return lambda * relevance - (1 - lambda) * maxSim;
+};
+/**
+ * Check if adding a candidate would violate category limits in top N.
+ *
+ * Per spec: max 2 results from same category in top 5.
+ * This prevents over-representation of any single category.
+ */
+const wouldViolateCategoryLimit = (candidate, selected, topN = CATEGORY_LIMIT_TOP_N, maxPerTopN = CATEGORY_MAX_PER_TOP_N) => {
+    // No category = no limit
+    if (!candidate.category) {
+        return false;
+    }
+    // Only check if we're still in the top N range
+    if (selected.length >= topN) {
+        return false;
+    }
+    // Count items with the same category in current selection
+    const categoryCount = selected.filter(item => item.category === candidate.category).length;
+    return categoryCount >= maxPerTopN;
+};
+/**
+ * Noop implementation - returns candidates unchanged (just truncated to limit).
+ * Used when diversification is not needed or for testing.
+ */
+export const DiversifierServiceNoop = Layer.succeed(DiversifierService, {
+    mmrDiversify: (candidates, limit, _lambda) => Effect.succeed(candidates.slice(0, limit))
+});
+/**
+ * Live implementation with full MMR algorithm and category limits.
+ *
+ * Algorithm:
+ * 1. If no embeddings available, fallback to relevance-only ordering with category limits
+ * 2. Start with the highest-relevance item
+ * 3. Iteratively select the item with highest MMR score that doesn't violate category limits
+ * 4. Repeat until limit reached or no candidates remain
+ */
+export const DiversifierServiceLive = Layer.succeed(DiversifierService, {
+    mmrDiversify: (candidates, limit, lambda = DEFAULT_LAMBDA) => Effect.sync(() => {
+        // Edge case: empty candidates
+        if (candidates.length === 0) {
+            return [];
+        }
+        // Edge case: limit <= 0
+        if (limit <= 0) {
+            return [];
+        }
+        // Edge case: only one candidate or limit is 1
+        if (candidates.length === 1 || limit === 1) {
+            return candidates.slice(0, 1);
+        }
+        // Check if any candidates have embeddings
+        const hasEmbeddings = candidates.some(c => c.embedding !== null);
+        // Fallback: if no embeddings, just apply category limits to relevance-sorted list
+        if (!hasEmbeddings) {
+            return applyFallbackWithCategoryLimits(candidates, limit);
+        }
+        // Full MMR algorithm
+        const selected = [];
+        const remaining = new Set(candidates);
+        while (selected.length < limit && remaining.size > 0) {
+            let bestCandidate = null;
+            let bestScore = -Infinity;
+            for (const candidate of remaining) {
+                // Skip if would violate category limit
+                if (wouldViolateCategoryLimit(candidate, selected)) {
+                    continue;
+                }
+                const score = mmrScore(candidate, selected, lambda);
+                if (score > bestScore) {
+                    bestScore = score;
+                    bestCandidate = candidate;
+                }
+            }
+            // If no valid candidate found (all remaining violate category limits),
+            // try to find any candidate without category limit check
+            if (!bestCandidate) {
+                for (const candidate of remaining) {
+                    const score = mmrScore(candidate, selected, lambda);
+                    if (score > bestScore) {
+                        bestScore = score;
+                        bestCandidate = candidate;
+                    }
+                }
+            }
+            // Still no candidate? We're done
+            if (!bestCandidate) {
+                break;
+            }
+            selected.push(bestCandidate);
+            remaining.delete(bestCandidate);
+        }
+        return selected;
+    })
+});
+/**
+ * Fallback diversification when no embeddings are available.
+ * Applies category limits to the relevance-sorted list.
+ *
+ * Returns candidates in original order, skipping items that would
+ * violate the category limit in top N.
+ */
+const applyFallbackWithCategoryLimits = (candidates, limit) => {
+    const selected = [];
+    for (const candidate of candidates) {
+        if (selected.length >= limit) {
+            break;
+        }
+        // Skip if would violate category limit
+        if (wouldViolateCategoryLimit(candidate, selected)) {
+            continue;
+        }
+        selected.push(candidate);
+    }
+    // If we didn't get enough due to category limits, fill with remaining
+    if (selected.length < limit) {
+        const selectedSet = new Set(selected);
+        for (const candidate of candidates) {
+            if (selected.length >= limit) {
+                break;
+            }
+            if (!selectedSet.has(candidate)) {
+                selected.push(candidate);
+            }
+        }
+    }
+    return selected;
+};
+/**
+ * Auto layer - uses Live implementation since MMR has no external dependencies.
+ */
+export const DiversifierServiceAuto = DiversifierServiceLive;
+//# sourceMappingURL=diversifier-service.js.map

package/dist/services/diversifier-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diversifier-service.js","sourceRoot":"","sources":["../../src/services/diversifier-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAE/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEnD;;;;;;;;;GASG;AACH,MAAM,OAAO,kBAAmB,SAAQ,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,EAiBtE;CAAG;AAEN;;;;GAIG;AACH,MAAM,cAAc,GAAG,GAAG,CAAA;AAE1B;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAAC,CAAA;AAC9B,MAAM,sBAAsB,GAAG,CAAC,CAAA;AAEhC;;;GAGG;AACH,MAAM,uBAAuB,GAAG,CAC9B,SAA4B,EAC5B,QAAsC,EAC9B,EAAE;IACV,iDAAiD;IACjD,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QACzB,OAAO,CAAC,CAAA;IACV,CAAC;IAED,wBAAwB;IACxB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAA;IACV,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAA;IACtB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,gCAAgC;QAChC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,SAAQ;QACV,CAAC;QACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;QACjE,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,CAAA;QACd,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,OAAO,MAAM,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;AAC1C,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAG,CACf,SAA4B,EAC5B,QAAsC,EACtC,MAAc,EACN,EAAE;IACV,MAAM,SAAS,GAAG,SAAS,CAAC,cAAc,CAAA;IAC1C,MAAM,MAAM,GAAG,uBAAuB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;IAE3D,OAAO,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAA;AACnD,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,yBAAyB,GAAG,CAChC,SAA4B,EAC5B,QAAsC,EACtC,OAAe,oBAAoB,EACnC,aAAqB,sBAAsB,EAClC,EAAE;IACX,yBAAyB;IACzB,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;QACxB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,+CAA+C;IAC/C,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAA;IACd,CAAC;IAED,0DAA0D;IAC1D,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CACnC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,CAC7C,CAAC,MAAM,CAAA;IAER,OAAO,aAAa,IAAI,UAAU,CAAA;AACpC,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAK,CAAC,OAAO,CACjD,kBAAkB,EAClB;IACE,YAAY,EAAE,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAC3C,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;CAC7C,CACF,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAK,CAAC,OAAO,CACjD,kBAAkB,EAClB;IACE,YAAY,EAAE,CAAC,UAAU,EAAE,KAAK,EAAE,MAAM,GAAG,cAAc,EAAE,EAAE,CAC3D,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;QACf,8BAA8B;QAC9B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,CAAA;QACX,CAAC;QAED,wBAAwB;QACxB,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,OAAO,EAAE,CAAA;QACX,CAAC;QAED,8CAA8C;QAC9C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC/B,CAAC;QAED,0CAA0C;QAC1C,MAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,CAAA;QAEhE,kFAAkF;QAClF,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,OAAO,+BAA+B,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;QAC3D,CAAC;QAED,qBAAqB;QACrB,MAAM,QAAQ,GAAwB,EAAE,CAAA;QACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;QAErC,OAAO,QAAQ,CAAC,MAAM,GAAG,KAAK,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrD,IAAI,aAAa,GAA6B,IAAI,CAAA;YAClD,IAAI,SAAS,GAAG,CAAC,QAAQ,CAAA;YAEzB,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;gBAClC,uCAAuC;gBACvC,IAAI,yBAAyB,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC;oBACnD,SAAQ;gBACV,CAAC;gBAED,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;gBACnD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;oBACtB,SAAS,GAAG,KAAK,CAAA;oBACjB,aAAa,GAAG,SAAS,CAAA;gBAC3B,CAAC;YACH,CAAC;YAED,uEAAuE;YACvE,yDAAyD;YACzD,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;oBAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;oBACnD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;wBACtB,SAAS,GAAG,KAAK,CAAA;wBACjB,aAAa,GAAG,SAAS,CAAA;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,iCAAiC;YACjC,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,MAAK;YACP,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;YAC5B,SAAS,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QACjC,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC,CAAC;CACL,CACF,CAAA;AAED;;;;;;GAMG;AACH,MAAM,+BAA+B,GAAG,CACtC,UAAwC,EACxC,KAAa,EACiB,EAAE;IAChC,MAAM,QAAQ,GAAwB,EAAE,CAAA;IAExC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,QAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;YAC7B,MAAK;QACP,CAAC;QAED,uCAAuC;QACvC,IAAI,yBAAyB,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC;YACnD,SAAQ;QACV,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC1B,CAAC;IAED,sEAAsE;IACtE,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAA;QACrC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,QAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC7B,MAAK;YACP,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAChC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAA;AACjB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,sBAAsB,CAAA"}

package/dist/services/edge-service.d.ts

@@ -0,0 +1,78 @@
+import { Context, Effect, Layer } from "effect";
+import { EdgeRepository } from "../repo/edge-repo.js";
+import { DatabaseError, EdgeNotFoundError, ValidationError } from "../errors.js";
+import type { Edge, EdgeType, NodeType, CreateEdgeInput, UpdateEdgeInput, NeighborNode } from "@jamesaphoenix/tx-types";
+/** Extended neighbor with depth information */
+export interface NeighborWithDepth extends NeighborNode {
+    readonly depth: number;
+}
+/** Options for multi-hop neighbor finding */
+export interface FindNeighborsOptions {
+    /** Maximum depth to traverse (default: 1) */
+    readonly depth?: number;
+    /** Direction of traversal */
+    readonly direction?: "outgoing" | "incoming" | "both";
+    /** Filter by edge types */
+    readonly edgeTypes?: readonly EdgeType[];
+    /** Include the path of edges that led to this neighbor */
+    readonly includePath?: boolean;
+}
+/** Neighbor with path information */
+export interface NeighborWithPath extends NeighborWithDepth {
+    readonly path: readonly Edge[];
+}
+declare const EdgeService_base: Context.TagClass<EdgeService, "EdgeService", {
+    /**
+     * Create an edge between two nodes.
+     * Validates edge type, node types, and ensures weight is in [0, 1].
+     */
+    readonly createEdge: (input: CreateEdgeInput) => Effect.Effect<Edge, ValidationError | DatabaseError>;
+    /**
+     * Find neighbors of a node with optional multi-hop traversal.
+     * Supports depth, direction, and edge type filtering.
+     */
+    readonly findNeighbors: (nodeType: NodeType, nodeId: string, options?: FindNeighborsOptions) => Effect.Effect<readonly NeighborWithDepth[], DatabaseError>;
+    /**
+     * Find a path between two nodes.
+     * Returns the sequence of edges, or null if no path exists.
+     */
+    readonly findPath: (fromType: NodeType, fromId: string, toType: NodeType, toId: string, maxDepth?: number) => Effect.Effect<readonly Edge[] | null, DatabaseError>;
+    /**
+     * Invalidate (soft delete) an edge.
+     */
+    readonly invalidateEdge: (id: number) => Effect.Effect<boolean, EdgeNotFoundError | DatabaseError>;
+    /**
+     * Get an edge by ID.
+     */
+    readonly get: (id: number) => Effect.Effect<Edge, EdgeNotFoundError | DatabaseError>;
+    /**
+     * Update an edge's weight or metadata.
+     */
+    readonly update: (id: number, input: UpdateEdgeInput) => Effect.Effect<Edge, EdgeNotFoundError | ValidationError | DatabaseError>;
+    /**
+     * Find all edges of a specific type.
+     */
+    readonly findByType: (edgeType: EdgeType) => Effect.Effect<readonly Edge[], ValidationError | DatabaseError>;
+    /**
+     * Find all edges from a source node.
+     */
+    readonly findFromSource: (sourceType: NodeType, sourceId: string) => Effect.Effect<readonly Edge[], DatabaseError>;
+    /**
+     * Find all edges from multiple source nodes in a single batch query.
+     * Eliminates N+1 queries when fetching edges for multiple nodes.
+     */
+    readonly findFromMultipleSources: (sourceType: NodeType, sourceIds: readonly string[]) => Effect.Effect<ReadonlyMap<string, readonly Edge[]>, DatabaseError>;
+    /**
+     * Find all edges to a target node.
+     */
+    readonly findToTarget: (targetType: NodeType, targetId: string) => Effect.Effect<readonly Edge[], DatabaseError>;
+    /**
+     * Count edges by type.
+     */
+    readonly countByType: () => Effect.Effect<Map<EdgeType, number>, DatabaseError>;
+}>;
+export declare class EdgeService extends EdgeService_base {
+}
+export declare const EdgeServiceLive: Layer.Layer<EdgeService, never, EdgeRepository>;
+export {};
+//# sourceMappingURL=edge-service.d.ts.map

package/dist/services/edge-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-service.d.ts","sourceRoot":"","sources":["../../src/services/edge-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACrD,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAChF,OAAO,KAAK,EACV,IAAI,EACJ,QAAQ,EACR,QAAQ,EACR,eAAe,EACf,eAAe,EACf,YAAY,EACb,MAAM,yBAAyB,CAAA;AAiBhC,+CAA+C;AAC/C,MAAM,WAAW,iBAAkB,SAAQ,YAAY;IACrD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AAED,6CAA6C;AAC7C,MAAM,WAAW,oBAAoB;IACnC,6CAA6C;IAC7C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,6BAA6B;IAC7B,QAAQ,CAAC,SAAS,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,MAAM,CAAA;IACrD,2BAA2B;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAA;IACxC,0DAA0D;IAC1D,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAA;CAC/B;AAED,qCAAqC;AACrC,MAAM,WAAW,gBAAiB,SAAQ,iBAAiB;IACzD,QAAQ,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAA;CAC/B;;IAKG;;;OAGG;yBACkB,CAAC,KAAK,EAAE,eAAe,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,eAAe,GAAG,aAAa,CAAC;IAErG;;;OAGG;4BACqB,CACtB,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,oBAAoB,KAC3B,MAAM,CAAC,MAAM,CAAC,SAAS,iBAAiB,EAAE,EAAE,aAAa,CAAC;IAE/D;;;OAGG;uBACgB,CACjB,QAAQ,EAAE,QAAQ,EAClB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,MAAM,EACZ,QAAQ,CAAC,EAAE,MAAM,KACd,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,GAAG,IAAI,EAAE,aAAa,CAAC;IAEzD;;OAEG;6BACsB,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,iBAAiB,GAAG,aAAa,CAAC;IAElG;;OAEG;kBACW,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAAC;IAEpF;;OAEG;qBACc,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,iBAAiB,GAAG,eAAe,GAAG,aAAa,CAAC;IAEjI;;OAEG;yBACkB,CAAC,QAAQ,EAAE,QAAQ,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,eAAe,GAAG,aAAa,CAAC;IAE5G;;OAEG;6BACsB,CAAC,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,aAAa,CAAC;IAElH;;;OAGG;sCAC+B,CAChC,UAAU,EAAE,QAAQ,EACpB,SAAS,EAAE,SAAS,MAAM,EAAE,KACzB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC;IAEvE;;OAEG;2BACoB,CAAC,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,aAAa,CAAC;IAEhH;;OAEG;0BACmB,MAAM,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,aAAa,CAAC;;AAzEnF,qBAAa,WAAY,SAAQ,gBA2E9B;CAAG;AAuDN,eAAO,MAAM,eAAe,iDAiI3B,CAAA"}