@jamesaphoenix/tx-core 0.5.10 → 0.6.0

package/dist/services/memory-retriever-service.js

@@ -0,0 +1,332 @@
+/**
+ * MemoryRetrieverService — Retrieval pipeline for memory documents
+ *
+ * Provides BM25 + vector + graph (via memory_links) search with RRF fusion.
+ * Follows the same architecture as RetrieverService for learnings.
+ *
+ * Pipeline:
+ *   1. BM25 via memory_fts (three-tier FTS5 query)
+ *   2. Vector similarity (when embeddings available)
+ *   3. RRF fusion (k=60)
+ *   4. Recency boost (30-day decay on file mtime)
+ *   5. Tag filter (case-insensitive, when specified)
+ *   6. Property filter (key=value or key-exists, when specified)
+ *   7. Graph expansion via memory_links (BFS with decay, when --expand)
+ *   8. Re-filter expanded docs against tag/prop filters
+ *   9. Sort + filter by minScore + limit
+ */
+import { Context, Effect, Layer, Option } from "effect";
+import { MemoryDocumentRepository, MemoryLinkRepository, MemoryPropertyRepository } from "../repo/memory-repo.js";
+import { EmbeddingService } from "./embedding-service.js";
+import { cosineSimilarity } from "../utils/math.js";
+/** RRF constant — standard value from the original paper */
+const RRF_K = 60;
+/** Default weight for recency boost */
+const DEFAULT_RECENCY_WEIGHT = 0.1;
+const MAX_AGE_DAYS = 30;
+/** Cap on embeddings fetched for vector similarity scan */
+const MAX_VECTOR_CANDIDATES = 500;
+/** Floor on vector candidates to prevent tiny pools when limit is small */
+const MIN_VECTOR_CANDIDATES = 50;
+/** Graph expansion defaults */
+const DEFAULT_EXPANSION_DEPTH = 2;
+const DEFAULT_DECAY_FACTOR = 0.5;
+const MAX_EXPANSION_NODES = 50;
+/**
+ * MemoryRetrieverService provides pluggable retrieval for memory documents.
+ */
+export class MemoryRetrieverService extends Context.Tag("MemoryRetrieverService")() {
+}
+/**
+ * Calculate recency score (0-1) based on file modification time.
+ * More recently modified files get higher scores.
+ */
+const calculateRecencyScore = (fileMtime) => {
+    const mtimeMs = new Date(fileMtime).getTime();
+    // Guard against invalid/empty fileMtime producing NaN (propagates through all arithmetic)
+    if (isNaN(mtimeMs))
+        return 0;
+    const nowMs = Date.now();
+    // Clamp future-dated files to now (prevents score > 1)
+    const ageMs = Math.max(0, nowMs - Math.min(mtimeMs, nowMs));
+    const ageDays = ageMs / (1000 * 60 * 60 * 24);
+    return Math.max(0, 1 - ageDays / MAX_AGE_DAYS);
+};
+/**
+ * Compute vector similarity scores and return ranked results.
+ * Dimension mismatches are skipped gracefully.
+ */
+const computeVectorRanking = (documents, queryEmbedding) => {
+    if (!queryEmbedding) {
+        return Effect.succeed([]);
+    }
+    const docsWithEmbeddings = documents.filter((d) => d.embedding !== null);
+    // Skip per-document dimension mismatches gracefully (e.g., stale embeddings from a different model)
+    return Effect.forEach(docsWithEmbeddings, document => cosineSimilarity(queryEmbedding, document.embedding).pipe(Effect.map(similarity => {
+        // Normalize cosine similarity from [-1, 1] to [0, 1]
+        const score = (similarity + 1) / 2;
+        return Option.some({ document, score });
+    }), Effect.catchTag("EmbeddingDimensionMismatchError", () => Effect.succeed(Option.none())), Effect.catchTag("ZeroMagnitudeVectorError", () => Effect.succeed(Option.none())))).pipe(Effect.map(results => {
+        const withScores = results.filter(Option.isSome).map(o => o.value);
+        const sorted = [...withScores].sort((a, b) => b.score - a.score);
+        return sorted.map((item, idx) => ({
+            ...item,
+            rank: idx + 1
+        }));
+    }));
+};
+/**
+ * RRF score calculation.
+ * Formula: RRF(d) = Σ 1/(k + rank_i(d))
+ */
+const rrfScore = (k, ...ranks) => {
+    return ranks.reduce((sum, rank) => {
+        if (rank === 0)
+            return sum; // Not present in this list
+        return sum + 1 / (k + rank);
+    }, 0);
+};
+/**
+ * Combine BM25 and vector results using RRF.
+ */
+const computeRRFScoring = (bm25Results, vectorRanking) => {
+    const bm25Map = new Map();
+    bm25Results.forEach((result, idx) => {
+        bm25Map.set(result.document.id, { score: result.score, rank: idx + 1 });
+    });
+    const vectorMap = new Map();
+    vectorRanking.forEach(item => {
+        vectorMap.set(item.document.id, { score: item.score, rank: item.rank });
+    });
+    // Collect all unique documents
+    const allDocuments = new Map();
+    for (const result of bm25Results) {
+        allDocuments.set(result.document.id, result.document);
+    }
+    for (const item of vectorRanking) {
+        allDocuments.set(item.document.id, item.document);
+    }
+    const candidates = [];
+    for (const [id, document] of allDocuments) {
+        const bm25Info = bm25Map.get(id);
+        const vectorInfo = vectorMap.get(id);
+        const bm25Rank = bm25Info?.rank ?? 0;
+        const vectorRank = vectorInfo?.rank ?? 0;
+        const bm25Score = bm25Info?.score ?? 0;
+        const vectorScore = vectorInfo?.score ?? 0;
+        const recencyScore = calculateRecencyScore(document.fileMtime);
+        const rrf = rrfScore(RRF_K, bm25Rank, vectorRank);
+        candidates.push({
+            document,
+            bm25Score,
+            bm25Rank,
+            vectorScore,
+            vectorRank,
+            rrfScore: rrf,
+            recencyScore
+        });
+    }
+    return candidates.sort((a, b) => b.rrfScore - a.rrfScore);
+};
+/**
+ * Apply final scoring: RRF + recency boost.
+ */
+const applyFinalScoring = (candidates, recencyWeight, activeLists) => {
+    // Dynamically normalize based on how many ranking lists contributed (1 or 2).
+    // Max RRF = activeLists * 1/(k+1). Without this, BM25-only mode caps at ~0.5.
+    const rrfMax = activeLists > 0 ? activeLists / (RRF_K + 1) : 1;
+    return candidates.map(candidate => {
+        const { document, bm25Score, bm25Rank, vectorScore, vectorRank, rrfScore: rrf, recencyScore } = candidate;
+        const normalizedRRF = Math.min(1.0, rrf / rrfMax);
+        // Weighted blend (not additive) to preserve rank differentiation.
+        // Additive formula would clamp top-ranked recent docs to 1.0, destroying ordering.
+        const relevanceScore = (1 - recencyWeight) * normalizedRRF + recencyWeight * recencyScore;
+        return {
+            ...document,
+            relevanceScore,
+            bm25Score,
+            vectorScore,
+            recencyScore,
+            rrfScore: rrf,
+            bm25Rank,
+            vectorRank,
+        };
+    }).sort((a, b) => b.relevanceScore - a.relevanceScore);
+};
+/**
+ * Noop fallback — returns empty results.
+ */
+export const MemoryRetrieverServiceNoop = Layer.succeed(MemoryRetrieverService, {
+    search: (_query, _options) => Effect.succeed([]),
+    isAvailable: () => Effect.succeed(false)
+});
+/**
+ * Live implementation with BM25 + vector + RRF + graph expansion pipeline.
+ *
+ * Graph expansion uses memory_links (wikilinks, frontmatter.related, explicit)
+ * to find related documents via BFS traversal with score decay.
+ */
+export const MemoryRetrieverServiceLive = Layer.effect(MemoryRetrieverService, Effect.gen(function* () {
+    const docRepo = yield* MemoryDocumentRepository;
+    const linkRepo = yield* MemoryLinkRepository;
+    const propRepo = yield* MemoryPropertyRepository;
+    // EmbeddingService is optional — graceful degradation when unavailable
+    const embeddingServiceOption = yield* Effect.serviceOption(EmbeddingService);
+    const embeddingService = Option.getOrNull(embeddingServiceOption);
+    /**
+     * Expand search results through memory_links graph.
+     * BFS traversal: follow outgoing links from seed documents.
+     */
+    const expandViaGraph = (seeds, depth, decayFactor, maxNodes) => Effect.gen(function* () {
+        if (seeds.length === 0 || depth === 0)
+            return seeds.map(s => ({ ...s, expansionHops: 0 }));
+        const visited = new Set(seeds.map(s => s.id));
+        const expanded = [];
+        // BFS frontier: documents to expand from
+        let frontier = seeds.map(s => ({ docId: s.id, score: s.relevanceScore, hops: 0 }));
+        for (let hop = 1; hop <= depth; hop++) {
+            if (frontier.length === 0)
+                break;
+            if (seeds.length + expanded.length >= maxNodes)
+                break;
+            const nextFrontier = [];
+            for (const node of frontier) {
+                if (seeds.length + expanded.length >= maxNodes)
+                    break;
+                // Get outgoing links from this document
+                const links = yield* linkRepo.findOutgoing(node.docId);
+                for (const link of links) {
+                    if (seeds.length + expanded.length >= maxNodes)
+                        break;
+                    if (!link.targetDocId)
+                        continue; // Unresolved link
+                    if (visited.has(link.targetDocId))
+                        continue;
+                    visited.add(link.targetDocId);
+                    // Fetch the document
+                    const doc = yield* docRepo.findById(link.targetDocId);
+                    if (!doc)
+                        continue;
+                    const decayedScore = node.score * decayFactor;
+                    const recencyScore = calculateRecencyScore(doc.fileMtime);
+                    expanded.push({
+                        ...doc,
+                        relevanceScore: decayedScore,
+                        bm25Score: 0,
+                        vectorScore: 0,
+                        rrfScore: 0,
+                        recencyScore,
+                        bm25Rank: 0,
+                        vectorRank: 0,
+                        expansionHops: hop,
+                    });
+                    nextFrontier.push({
+                        docId: link.targetDocId,
+                        score: decayedScore,
+                        hops: hop,
+                    });
+                }
+            }
+            frontier = nextFrontier;
+        }
+        // Merge seeds and expanded, sort by relevance
+        const merged = [
+            ...seeds.map(s => ({ ...s, expansionHops: 0 })),
+            ...expanded,
+        ];
+        return merged.sort((a, b) => b.relevanceScore - a.relevanceScore);
+    });
+    return {
+        search: (query, options) => Effect.gen(function* () {
+            const limit = Math.max(1, options?.limit ?? 10);
+            const minScore = options?.minScore ?? 0;
+            const useSemantic = options?.semantic ?? false;
+            const useExpand = options?.expand ?? false;
+            // Over-fetch when filters are present: tag/prop filters reduce the
+            // scored pool before graph expansion. A larger BM25/vector candidate pool
+            // ensures enough documents survive filtering to produce quality expansion
+            // seeds and to deliver the requested limit.
+            const hasFilters = (options?.tags && options.tags.length > 0) ||
+                (options?.props && options.props.length > 0);
+            const fetchMultiplier = hasFilters ? 10 : 3;
+            // 1. BM25 search (always available)
+            const bm25Results = yield* docRepo.searchBM25(query, limit * fetchMultiplier);
+            // 2. Vector search (when --semantic and embeddings available)
+            let vectorRanking = [];
+            if (useSemantic && embeddingService) {
+                const queryEmbedding = yield* Effect.option(embeddingService.embed(query));
+                const queryEmbeddingValue = Option.getOrNull(queryEmbedding);
+                if (queryEmbeddingValue) {
+                    const vectorCandidateLimit = Math.min(Math.max(MIN_VECTOR_CANDIDATES, limit * fetchMultiplier), MAX_VECTOR_CANDIDATES);
+                    const docsWithEmbeddings = yield* docRepo.findWithEmbeddings(vectorCandidateLimit);
+                    vectorRanking = yield* computeVectorRanking(docsWithEmbeddings, queryEmbeddingValue);
+                }
+            }
+            // 3. RRF fusion
+            const candidates = computeRRFScoring(bm25Results, vectorRanking);
+            // 4. Final scoring with recency boost
+            // Count active ranking lists for correct RRF normalization
+            const activeLists = (bm25Results.length > 0 ? 1 : 0) + (vectorRanking.length > 0 ? 1 : 0);
+            let scored = applyFinalScoring(candidates, DEFAULT_RECENCY_WEIGHT, activeLists);
+            // 5. Filter by tags if specified (case-insensitive)
+            // Applied BEFORE graph expansion so seeds are relevant to the filter,
+            // preventing expansion from irrelevant pre-filter documents.
+            if (options?.tags && options.tags.length > 0) {
+                const tagFilterLower = options.tags.map((t) => t.toLowerCase());
+                scored = scored.filter(r => tagFilterLower.every((t) => r.tags.some((rt) => String(rt).toLowerCase() === t)));
+            }
+            // 6. Filter by properties if specified
+            // Prop filter sets are computed once and cached for reuse in step 8 (post-expansion re-filter)
+            // to avoid duplicate DB queries when both --expand and --prop are active.
+            const propFilterSets = [];
+            if (options?.props && options.props.length > 0) {
+                for (const propFilter of options.props) {
+                    const eqIdx = propFilter.indexOf("=");
+                    const key = eqIdx >= 0 ? propFilter.slice(0, eqIdx) : propFilter;
+                    const value = eqIdx >= 0 ? propFilter.slice(eqIdx + 1) : undefined;
+                    if (!key || key.trim().length === 0)
+                        continue;
+                    const matchingDocIds = new Set(yield* propRepo.findByProperty(key.trim(), value));
+                    propFilterSets.push(matchingDocIds);
+                    scored = scored.filter(r => matchingDocIds.has(r.id));
+                }
+            }
+            // 7. Graph expansion (when --expand)
+            // Runs AFTER tag/prop filtering so seeds are already relevant.
+            // Uses a fixed seed count independent of limit so expansion can contribute
+            // new documents even when limit is small (e.g. default 10).
+            // After expansion, re-merge with non-seed results to avoid silently
+            // dropping documents ranked 11+ from the original scored list.
+            if (useExpand) {
+                const EXPANSION_SEED_COUNT = 10;
+                const seedIds = new Set(scored.slice(0, Math.min(EXPANSION_SEED_COUNT, scored.length)).map(s => s.id));
+                const topSeeds = scored.slice(0, Math.min(EXPANSION_SEED_COUNT, scored.length));
+                const expandedResults = yield* expandViaGraph(topSeeds, DEFAULT_EXPANSION_DEPTH, DEFAULT_DECAY_FACTOR, MAX_EXPANSION_NODES);
+                // 8. Re-filter expanded documents against tag/prop filters.
+                // Seeds already passed filters; only newly discovered docs need checking.
+                // Reuses cached propFilterSets from step 6 to avoid duplicate DB queries.
+                let filtered = expandedResults;
+                if (options?.tags && options.tags.length > 0) {
+                    const tagFilterLower = options.tags.map((t) => t.toLowerCase());
+                    filtered = filtered.filter(r => seedIds.has(r.id) ||
+                        tagFilterLower.every((t) => r.tags.some((rt) => String(rt).toLowerCase() === t)));
+                }
+                for (const matchingDocIds of propFilterSets) {
+                    filtered = filtered.filter(r => seedIds.has(r.id) || matchingDocIds.has(r.id));
+                }
+                // Re-merge: add back non-seed original results that weren't already included via expansion
+                const expandedIds = new Set(filtered.map(r => r.id));
+                const nonSeedRemainder = scored.slice(EXPANSION_SEED_COUNT)
+                    .filter(r => !expandedIds.has(r.id));
+                scored = [...filtered, ...nonSeedRemainder]
+                    .sort((a, b) => b.relevanceScore - a.relevanceScore);
+            }
+            // 9. Filter by minScore and limit
+            return scored
+                .filter(r => r.relevanceScore >= minScore)
+                .slice(0, limit);
+        }),
+        isAvailable: () => Effect.succeed(true)
+    };
+}));
+//# sourceMappingURL=memory-retriever-service.js.map

package/dist/services/memory-retriever-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-retriever-service.js","sourceRoot":"","sources":["../../src/services/memory-retriever-service.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACvD,OAAO,EAAE,wBAAwB,EAAE,oBAAoB,EAAE,wBAAwB,EAAyB,MAAM,wBAAwB,CAAA;AACxI,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AAGzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEnD,4DAA4D;AAC5D,MAAM,KAAK,GAAG,EAAE,CAAA;AAEhB,uCAAuC;AACvC,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAClC,MAAM,YAAY,GAAG,EAAE,CAAA;AAEvB,2DAA2D;AAC3D,MAAM,qBAAqB,GAAG,GAAG,CAAA;AACjC,2EAA2E;AAC3E,MAAM,qBAAqB,GAAG,EAAE,CAAA;AAEhC,+BAA+B;AAC/B,MAAM,uBAAuB,GAAG,CAAC,CAAA;AACjC,MAAM,oBAAoB,GAAG,GAAG,CAAA;AAChC,MAAM,mBAAmB,GAAG,EAAE,CAAA;AAE9B;;GAEG;AACH,MAAM,OAAO,sBAAuB,SAAQ,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,EAc9E;CAAG;AAEN;;;GAGG;AACH,MAAM,qBAAqB,GAAG,CAAC,SAAiB,EAAU,EAAE;IAC1D,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAA;IAC7C,0FAA0F;IAC1F,IAAI,KAAK,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,CAAA;IAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;IACxB,uDAAuD;IACvD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;IAC3D,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,YAAY,CAAC,CAAA;AAChD,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,SAAoC,EACpC,cAAmC,EACgD,EAAE;IACrF,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,OAAO,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAC3B,CAAC;IAED,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CACzC,CAAC,CAAC,EAAqD,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAC/E,CAAA;IAED,oGAAoG;IACpG,OAAO,MAAM,CAAC,OAAO,CAAC,kBAAkB,EAAE,QAAQ,CAAC,EAAE,CACnD,gBAAgB,CAAC,cAAc,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,IAAI,CACvD,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;QACtB,qDAAqD;QACrD,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAClC,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAA;IACzC,CAAC,CAAC,EACF,MAAM,CAAC,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE,CACtD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAA+C,CAAC,CAC3E,EACD,MAAM,CAAC,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE,CAC/C,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAA+C,CAAC,CAC3E,CACF,CACF,CAAC,IAAI,CACJ,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;QACnB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;QAClE,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QAChE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YAChC,GAAG,IAAI;YACP,IAAI,EAAE,GAAG,GAAG,CAAC;SACd,CAAC,CAAC,CAAA;IACL,CAAC,CAAC,CACH,CAAA;AACH,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,GAAG,KAAe,EAAU,EAAE;IACzD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QAChC,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,GAAG,CAAA,CAAC,2BAA2B;QACtD,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IAC7B,CAAC,EAAE,CAAC,CAAC,CAAA;AACP,CAAC,CAAA;AAaD;;GAEG;AACH,MAAM,iBAAiB,GAAG,CACxB,WAAwC,EACxC,aAA0E,EACpD,EAAE;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2C,CAAA;IAClE,WAAW,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;QAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;IAEF,MAAM,SAAS,GAAG,IAAI,GAAG,EAA2C,CAAA;IACpE,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC3B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;IAEF,+BAA+B;IAC/B,MAAM,YAAY,GAAG,IAAI,GAAG,EAA0B,CAAA;IACtD,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;IACvD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;IACnD,CAAC;IAED,MAAM,UAAU,GAAyB,EAAE,CAAA;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,YAAY,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAChC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAEpC,MAAM,QAAQ,GAAG,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAA;QACpC,MAAM,UAAU,GAAG,UAAU,EAAE,IAAI,IAAI,CAAC,CAAA;QACxC,MAAM,SAAS,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAA;QACtC,MAAM,WAAW,GAAG,UAAU,EAAE,KAAK,IAAI,CAAC,CAAA;QAC1C,MAAM,YAAY,GAAG,qBAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;QAE9D,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAA;QAEjD,UAAU,CAAC,IAAI,CAAC;YACd,QAAQ;YACR,SAAS;YACT,QAAQ;YACR,WAAW;YACX,UAAU;YACV,QAAQ,EAAE,GAAG;YACb,YAAY;SACb,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;AAC3D,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,iBAAiB,GAAG,CACxB,UAAgC,EAChC,aAAqB,EACrB,WAAmB,EACQ,EAAE;IAC7B,8EAA8E;IAC9E,8EAA8E;IAC9E,MAAM,MAAM,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAE9D,OAAO,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;QAChC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,SAAS,CAAA;QAEzG,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,CAAA;QAEjD,kEAAkE;QAClE,mFAAmF;QACnF,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,aAAa,GAAG,aAAa,GAAG,YAAY,CAAA;QAEzF,OAAO;YACL,GAAG,QAAQ;YACX,cAAc;YACd,SAAS;YACT,WAAW;YACX,YAAY;YACZ,QAAQ,EAAE,GAAG;YACb,QAAQ;YACR,UAAU;SACX,CAAA;IACH,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;AACxD,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,KAAK,CAAC,OAAO,CACrD,sBAAsB,EACtB;IACE,MAAM,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAChD,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;CACzC,CACF,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,KAAK,CAAC,MAAM,CACpD,sBAAsB,EACtB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,wBAAwB,CAAA;IAC/C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,oBAAoB,CAAA;IAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,wBAAwB,CAAA;IAChD,uEAAuE;IACvE,MAAM,sBAAsB,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAA;IAC5E,MAAM,gBAAgB,GAAG,MAAM,CAAC,SAAS,CAAC,sBAAsB,CAAC,CAAA;IAEjE;;;OAGG;IACH,MAAM,cAAc,GAAG,CACrB,KAAgC,EAChC,KAAa,EACb,WAAmB,EACnB,QAAgB,EAChB,EAAE,CACF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAE1F,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACrD,MAAM,QAAQ,GAA8B,EAAE,CAAA;QAE9C,yCAAyC;QACzC,IAAI,QAAQ,GACV,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,cAAc,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QAErE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;YACtC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAK;YAChC,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ;gBAAE,MAAK;YAErD,MAAM,YAAY,GAAqD,EAAE,CAAA;YAEzE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ;oBAAE,MAAK;gBAErD,wCAAwC;gBACxC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAEtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ;wBAAE,MAAK;oBACrD,IAAI,CAAC,IAAI,CAAC,WAAW;wBAAE,SAAQ,CAAC,kBAAkB;oBAClD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC;wBAAE,SAAQ;oBAE3C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;oBAE7B,qBAAqB;oBACrB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;oBACrD,IAAI,CAAC,GAAG;wBAAE,SAAQ;oBAElB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,GAAG,WAAW,CAAA;oBAC7C,MAAM,YAAY,GAAG,qBAAqB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBAEzD,QAAQ,CAAC,IAAI,CAAC;wBACZ,GAAG,GAAG;wBACN,cAAc,EAAE,YAAY;wBAC5B,SAAS,EAAE,CAAC;wBACZ,WAAW,EAAE,CAAC;wBACd,QAAQ,EAAE,CAAC;wBACX,YAAY;wBACZ,QAAQ,EAAE,CAAC;wBACX,UAAU,EAAE,CAAC;wBACb,aAAa,EAAE,GAAG;qBACnB,CAAC,CAAA;oBAEF,YAAY,CAAC,IAAI,CAAC;wBAChB,KAAK,EAAE,IAAI,CAAC,WAAW;wBACvB,KAAK,EAAE,YAAY;wBACnB,IAAI,EAAE,GAAG;qBACV,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,QAAQ,GAAG,YAAY,CAAA;QACzB,CAAC;QAED,8CAA8C;QAC9C,MAAM,MAAM,GAAG;YACb,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/C,GAAG,QAAQ;SACZ,CAAA;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;IACnE,CAAC,CAAC,CAAA;IAEJ,OAAO;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CACzB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC,CAAA;YAC/C,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,CAAC,CAAA;YACvC,MAAM,WAAW,GAAG,OAAO,EAAE,QAAQ,IAAI,KAAK,CAAA;YAC9C,MAAM,SAAS,GAAG,OAAO,EAAE,MAAM,IAAI,KAAK,CAAA;YAE1C,mEAAmE;YACnE,0EAA0E;YAC1E,0EAA0E;YAC1E,4CAA4C;YAC5C,MAAM,UAAU,GAAG,CAAC,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC1C,CAAC,OAAO,EAAE,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAC/D,MAAM,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAE3C,oCAAoC;YACpC,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,eAAe,CAAC,CAAA;YAE7E,8DAA8D;YAC9D,IAAI,aAAa,GAAgE,EAAE,CAAA;YACnF,IAAI,WAAW,IAAI,gBAAgB,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;gBAC1E,MAAM,mBAAmB,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,CAAA;gBAE5D,IAAI,mBAAmB,EAAE,CAAC;oBACxB,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,KAAK,GAAG,eAAe,CAAC,EAAE,qBAAqB,CAAC,CAAA;oBACtH,MAAM,kBAAkB,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,oBAAoB,CAAC,CAAA;oBAClF,aAAa,GAAG,KAAK,CAAC,CAAC,oBAAoB,CAAC,kBAAkB,EAAE,mBAAmB,CAAC,CAAA;gBACtF,CAAC;YACH,CAAC;YAED,gBAAgB;YAChB,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;YAEhE,sCAAsC;YACtC,2DAA2D;YAC3D,MAAM,WAAW,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACzF,IAAI,MAAM,GAAG,iBAAiB,CAAC,UAAU,EAAE,sBAAsB,EAAE,WAAW,CAAC,CAAA;YAE/E,oDAAoD;YACpD,sEAAsE;YACtE,6DAA6D;YAC7D,IAAI,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7C,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAA;gBACvE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACzB,cAAc,CAAC,KAAK,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAU,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CACjG,CAAA;YACH,CAAC;YAED,uCAAuC;YACvC,+FAA+F;YAC/F,0EAA0E;YAC1E,MAAM,cAAc,GAAkB,EAAE,CAAA;YACxC,IAAI,OAAO,EAAE,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/C,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBACvC,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;oBACrC,MAAM,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAA;oBAChE,MAAM,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;oBAClE,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;wBAAE,SAAQ;oBAC7C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;oBACjF,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;oBACnC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBACvD,CAAC;YACH,CAAC;YAED,qCAAqC;YACrC,+DAA+D;YAC/D,2EAA2E;YAC3E,4DAA4D;YAC5D,oEAAoE;YACpE,+DAA+D;YAC/D,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,oBAAoB,GAAG,EAAE,CAAA;gBAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBACtG,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;gBAC/E,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,cAAc,CAC3C,QAAQ,EACR,uBAAuB,EACvB,oBAAoB,EACpB,mBAAmB,CACpB,CAAA;gBAED,4DAA4D;gBAC5D,0EAA0E;gBAC1E,0EAA0E;gBAC1E,IAAI,QAAQ,GAAG,eAAe,CAAA;gBAC9B,IAAI,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC7C,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAA;oBACvE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBACjB,cAAc,CAAC,KAAK,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAU,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CACjG,CAAA;gBACH,CAAC;gBACD,KAAK,MAAM,cAAc,IAAI,cAAc,EAAE,CAAC;oBAC5C,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAChF,CAAC;gBAED,2FAA2F;gBAC3F,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBACpD,MAAM,gBAAgB,GAAG,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC;qBACxD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBACtC,MAAM,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,gBAAgB,CAAC;qBACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;YACxD,CAAC;YAED,kCAAkC;YAClC,OAAO,MAAM;iBACV,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,IAAI,QAAQ,CAAC;iBACzC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACpB,CAAC,CAAC;QAEJ,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;KACxC,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

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

@@ -0,0 +1,49 @@
+/**
+ * MemoryService - Core service for filesystem-backed memory
+ *
+ * Manages indexing, searching, and CRUD operations on markdown files.
+ * Filesystem is the source of truth; SQLite is a derived index.
+ */
+import { Context, Effect, Layer } from "effect";
+import { MemoryDocumentRepository } from "../repo/memory-repo.js";
+import { MemoryLinkRepository } from "../repo/memory-repo.js";
+import { MemoryPropertyRepository } from "../repo/memory-repo.js";
+import { MemorySourceRepository } from "../repo/memory-repo.js";
+import { DatabaseError, MemoryDocumentNotFoundError, MemorySourceNotFoundError, ValidationError } from "../errors.js";
+import type { MemoryDocument, MemoryDocumentWithScore, MemoryLink, MemorySource, MemoryProperty, MemoryIndexStatus, MemorySearchOptions, CreateMemoryDocumentInput } from "@jamesaphoenix/tx-types";
+declare const MemoryService_base: Context.TagClass<MemoryService, "MemoryService", {
+    readonly addSource: (dir: string, label?: string) => Effect.Effect<MemorySource, DatabaseError | ValidationError>;
+    readonly removeSource: (dir: string) => Effect.Effect<void, DatabaseError | MemorySourceNotFoundError>;
+    readonly listSources: () => Effect.Effect<readonly MemorySource[], DatabaseError>;
+    readonly createDocument: (input: CreateMemoryDocumentInput) => Effect.Effect<MemoryDocument, DatabaseError | ValidationError>;
+    readonly updateFrontmatter: (id: string, updates: {
+        addTags?: readonly string[];
+        removeTags?: readonly string[];
+        addRelated?: readonly string[];
+    }) => Effect.Effect<MemoryDocument, DatabaseError | MemoryDocumentNotFoundError | ValidationError>;
+    readonly setProperty: (id: string, key: string, value: string) => Effect.Effect<void, DatabaseError | MemoryDocumentNotFoundError | ValidationError>;
+    readonly getProperties: (id: string) => Effect.Effect<readonly MemoryProperty[], DatabaseError>;
+    readonly removeProperty: (id: string, key: string) => Effect.Effect<void, DatabaseError | MemoryDocumentNotFoundError | ValidationError>;
+    readonly index: (options?: {
+        incremental?: boolean;
+    }) => Effect.Effect<{
+        indexed: number;
+        skipped: number;
+        removed: number;
+    }, DatabaseError>;
+    readonly indexStatus: () => Effect.Effect<MemoryIndexStatus, DatabaseError>;
+    readonly search: (query: string, options?: MemorySearchOptions) => Effect.Effect<readonly MemoryDocumentWithScore[], DatabaseError>;
+    readonly getDocument: (id: string) => Effect.Effect<MemoryDocument, DatabaseError | MemoryDocumentNotFoundError>;
+    readonly getLinks: (id: string) => Effect.Effect<readonly MemoryLink[], DatabaseError>;
+    readonly getBacklinks: (id: string) => Effect.Effect<readonly MemoryLink[], DatabaseError>;
+    readonly addLink: (sourceId: string, targetRef: string) => Effect.Effect<void, DatabaseError | MemoryDocumentNotFoundError>;
+    readonly listDocuments: (filter?: {
+        source?: string;
+        tags?: readonly string[];
+    }) => Effect.Effect<readonly MemoryDocument[], DatabaseError>;
+}>;
+export declare class MemoryService extends MemoryService_base {
+}
+export declare const MemoryServiceLive: Layer.Layer<MemoryService, never, MemoryDocumentRepository | MemoryLinkRepository | MemoryPropertyRepository | MemorySourceRepository>;
+export {};
+//# sourceMappingURL=memory-service.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-service.d.ts","sourceRoot":"","sources":["../../src/services/memory-service.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAI/C,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAA;AACjE,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAA;AAC7D,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAA;AACjE,OAAO,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAA;AAC/D,OAAO,EAAE,aAAa,EAAE,2BAA2B,EAAE,yBAAyB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AACrH,OAAO,KAAK,EACV,cAAc,EACd,uBAAuB,EACvB,UAAU,EACV,YAAY,EACZ,cAAc,EACd,iBAAiB,EACjB,mBAAmB,EACnB,yBAAyB,EAC1B,MAAM,yBAAyB,CAAA;;wBA4fR,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,aAAa,GAAG,eAAe,CAAC;2BAC1F,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,yBAAyB,CAAC;0BAChF,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,YAAY,EAAE,EAAE,aAAa,CAAC;6BAGxD,CAAC,KAAK,EAAE,yBAAyB,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,aAAa,GAAG,eAAe,CAAC;gCAGjG,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,aAAa,GAAG,2BAA2B,GAAG,eAAe,CAAC;0BAG5N,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,2BAA2B,GAAG,eAAe,CAAC;4BAC5H,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,cAAc,EAAE,EAAE,aAAa,CAAC;6BACtE,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,2BAA2B,GAAG,eAAe,CAAC;oBAGxH,CAAC,OAAO,CAAC,EAAE;QAAE,WAAW,CAAC,EAAE,OAAO,CAAA;KAAE,KAAK,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE,aAAa,CAAC;0BACtH,MAAM,MAAM,CAAC,MAAM,CAAC,iBAAiB,EAAE,aAAa,CAAC;qBAG1D,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,mBAAmB,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,uBAAuB,EAAE,EAAE,aAAa,CAAC;0BAC7G,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,aAAa,GAAG,2BAA2B,CAAC;uBAC7F,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,UAAU,EAAE,EAAE,aAAa,CAAC;2BAC/D,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,UAAU,EAAE,EAAE,aAAa,CAAC;sBACxE,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,2BAA2B,CAAC;4BACnG,CAAC,MAAM,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,cAAc,EAAE,EAAE,aAAa,CAAC;;AA7B/I,qBAAa,aAAc,SAAQ,kBA+BhC;CAAG;AAEN,eAAO,MAAM,iBAAiB,wIA+lB7B,CAAA"}