@jamesaphoenix/tx-core 0.4.3 → 0.4.5

package/dist/services/feedback-tracker.d.ts

@@ -1,64 +0,0 @@
-import { Context, Effect, Layer } from "effect";
-import { DatabaseError } from "../errors.js";
-import { EdgeService } from "./edge-service.js";
-/**
- * Input for recording which learnings were used in a run.
- */
-export interface LearningUsageFeedback {
-    readonly id: number;
-    readonly helpful: boolean;
-}
-declare const FeedbackTrackerService_base: Context.TagClass<FeedbackTrackerService, "FeedbackTrackerService", {
-    /**
-     * Record which learnings were shown to an agent and whether they were helpful.
-     * Creates USED_IN_RUN edges in the graph for each learning.
-     *
-     * @param runId - Unique identifier for the agent run
-     * @param learnings - Array of learnings with their helpfulness feedback
-     */
-    readonly recordUsage: (runId: string, learnings: readonly LearningUsageFeedback[]) => Effect.Effect<void, DatabaseError>;
-    /**
-     * Get the feedback score for a learning based on historical usage.
-     * Uses Bayesian averaging: (successes + prior) / (total + 2*prior)
-     *
-     * @param learningId - The learning ID to get feedback score for
-     * @returns Score between 0 and 1, with 0.5 being neutral (no feedback)
-     */
-    readonly getFeedbackScore: (learningId: number) => Effect.Effect<number, DatabaseError>;
-    /**
-     * Get feedback scores for multiple learnings in a single batch query.
-     * Uses EdgeService.findFromMultipleSources() to avoid N+1 queries.
-     *
-     * @param learningIds - Array of learning IDs to get feedback scores for
-     * @returns Map from learningId to score (0-1, 0.5 is neutral)
-     */
-    readonly getFeedbackScores: (learningIds: readonly number[]) => Effect.Effect<ReadonlyMap<number, number>, DatabaseError>;
-}>;
-/**
- * FeedbackTrackerService tracks which learnings were helpful in agent runs
- * via USED_IN_RUN edges. Uses Bayesian scoring to weight future retrievals.
- *
- * Design: DD-016 specifies feedback tracking as part of the graph-expanded
- * retrieval pipeline. Learnings that are marked helpful receive score boosts.
- */
-export declare class FeedbackTrackerService extends FeedbackTrackerService_base {
-}
-/**
- * Noop implementation - returns neutral scores and does nothing on record.
- * Used when feedback tracking is disabled or for testing.
- */
-export declare const FeedbackTrackerServiceNoop: Layer.Layer<FeedbackTrackerService, never, never>;
-/**
- * Live implementation that stores feedback as USED_IN_RUN edges.
- *
- * recordUsage: Creates USED_IN_RUN edges from learning to run.
- * - Weight: 1.0 if helpful, 0.0 if not helpful
- * - Metadata: { position, recordedAt }
- *
- * getFeedbackScore: Calculates Bayesian average from historical edges.
- * - Formula: (helpfulCount + prior * priorWeight) / (totalCount + priorWeight)
- * - Returns 0.5 (neutral) for learnings with no feedback.
- */
-export declare const FeedbackTrackerServiceLive: Layer.Layer<FeedbackTrackerService, never, EdgeService>;
-export {};
-//# sourceMappingURL=feedback-tracker.d.ts.map

package/dist/services/feedback-tracker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feedback-tracker.d.ts","sourceRoot":"","sources":["../../src/services/feedback-tracker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAE/C;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;CAC1B;;IAYG;;;;;;OAMG;0BACmB,CACpB,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,SAAS,qBAAqB,EAAE,KACxC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC;IAEvC;;;;;;OAMG;+BACwB,CACzB,UAAU,EAAE,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAEzC;;;;;;OAMG;gCACyB,CAC1B,WAAW,EAAE,SAAS,MAAM,EAAE,KAC3B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,aAAa,CAAC;;AA1ClE;;;;;;GAMG;AACH,qBAAa,sBAAuB,SAAQ,2BAqCzC;CAAG;AAUN;;;GAGG;AACH,eAAO,MAAM,0BAA0B,mDAUtC,CAAA;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,0BAA0B,yDA0FtC,CAAA"}

package/dist/services/feedback-tracker.js

@@ -1,110 +0,0 @@
-import { Context, Effect, Layer } from "effect";
-import { DatabaseError } from "../errors.js";
-import { EdgeService } from "./edge-service.js";
-/**
- * FeedbackTrackerService tracks which learnings were helpful in agent runs
- * via USED_IN_RUN edges. Uses Bayesian scoring to weight future retrievals.
- *
- * Design: DD-016 specifies feedback tracking as part of the graph-expanded
- * retrieval pipeline. Learnings that are marked helpful receive score boosts.
- */
-export class FeedbackTrackerService extends Context.Tag("FeedbackTrackerService")() {
-}
-/**
- * Bayesian scoring constants.
- * Prior of 0.5 means neutral (neither helpful nor unhelpful).
- * Prior weight of 2 provides moderate regularization toward the prior.
- */
-const BAYESIAN_PRIOR = 0.5;
-const BAYESIAN_PRIOR_WEIGHT = 2;
-/**
- * Noop implementation - returns neutral scores and does nothing on record.
- * Used when feedback tracking is disabled or for testing.
- */
-export const FeedbackTrackerServiceNoop = Layer.succeed(FeedbackTrackerService, {
-    recordUsage: (_runId, _learnings) => Effect.void,
-    getFeedbackScore: (_learningId) => Effect.succeed(0.5),
-    getFeedbackScores: (learningIds) => Effect.succeed(new Map(learningIds.map((id) => [id, 0.5])))
-});
-/**
- * Live implementation that stores feedback as USED_IN_RUN edges.
- *
- * recordUsage: Creates USED_IN_RUN edges from learning to run.
- * - Weight: 1.0 if helpful, 0.0 if not helpful
- * - Metadata: { position, recordedAt }
- *
- * getFeedbackScore: Calculates Bayesian average from historical edges.
- * - Formula: (helpfulCount + prior * priorWeight) / (totalCount + priorWeight)
- * - Returns 0.5 (neutral) for learnings with no feedback.
- */
-export const FeedbackTrackerServiceLive = Layer.effect(FeedbackTrackerService, Effect.gen(function* () {
-    const edgeService = yield* EdgeService;
-    return {
-        recordUsage: (runId, learnings) => Effect.gen(function* () {
-            const recordedAt = new Date().toISOString();
-            for (let i = 0; i < learnings.length; i++) {
-                const learning = learnings[i];
-                yield* edgeService.createEdge({
-                    edgeType: "USED_IN_RUN",
-                    sourceType: "learning",
-                    sourceId: learning.id.toString(),
-                    targetType: "run",
-                    targetId: runId,
-                    weight: learning.helpful ? 1.0 : 0.0,
-                    metadata: {
-                        position: i,
-                        recordedAt
-                    }
-                }).pipe(
-                // Map ValidationError to DatabaseError - validation errors here would be internal issues
-                Effect.mapError(e => e._tag === "ValidationError"
-                    ? new DatabaseError({ cause: e.reason })
-                    : e));
-            }
-        }),
-        getFeedbackScore: (learningId) => Effect.gen(function* () {
-            // Find all USED_IN_RUN edges from this learning
-            const edges = yield* edgeService.findFromSource("learning", learningId.toString());
-            const usedInRunEdges = edges.filter(e => e.edgeType === "USED_IN_RUN");
-            // No feedback = neutral score
-            if (usedInRunEdges.length === 0) {
-                return BAYESIAN_PRIOR;
-            }
-            // Count helpful (weight > 0) edges
-            const totalCount = usedInRunEdges.length;
-            const helpfulCount = usedInRunEdges.filter(e => e.weight > 0).length;
-            // Bayesian average: (successes + prior * priorWeight) / (total + priorWeight)
-            // = (helpfulCount + 0.5 * 2) / (totalCount + 2)
-            // = (helpfulCount + 1) / (totalCount + 2)
-            return (helpfulCount + BAYESIAN_PRIOR * BAYESIAN_PRIOR_WEIGHT) / (totalCount + BAYESIAN_PRIOR_WEIGHT);
-        }),
-        getFeedbackScores: (learningIds) => Effect.gen(function* () {
-            // Handle empty input
-            if (learningIds.length === 0) {
-                return new Map();
-            }
-            // Batch fetch all edges from all learnings
-            const sourceIds = learningIds.map(id => id.toString());
-            const edgesBySource = yield* edgeService.findFromMultipleSources("learning", sourceIds);
-            // Compute Bayesian score for each learning
-            const result = new Map();
-            for (const learningId of learningIds) {
-                const edges = edgesBySource.get(learningId.toString()) ?? [];
-                const usedInRunEdges = edges.filter(e => e.edgeType === "USED_IN_RUN");
-                // No feedback = neutral score
-                if (usedInRunEdges.length === 0) {
-                    result.set(learningId, BAYESIAN_PRIOR);
-                    continue;
-                }
-                // Count helpful (weight > 0) edges
-                const totalCount = usedInRunEdges.length;
-                const helpfulCount = usedInRunEdges.filter(e => e.weight > 0).length;
-                // Bayesian average
-                const score = (helpfulCount + BAYESIAN_PRIOR * BAYESIAN_PRIOR_WEIGHT) / (totalCount + BAYESIAN_PRIOR_WEIGHT);
-                result.set(learningId, score);
-            }
-            return result;
-        })
-    };
-}));
-//# sourceMappingURL=feedback-tracker.js.map

package/dist/services/feedback-tracker.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"feedback-tracker.js","sourceRoot":"","sources":["../../src/services/feedback-tracker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAU/C;;;;;;GAMG;AACH,MAAM,OAAO,sBAAuB,SAAQ,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,EAqC9E;CAAG;AAEN;;;;GAIG;AACH,MAAM,cAAc,GAAG,GAAG,CAAA;AAC1B,MAAM,qBAAqB,GAAG,CAAC,CAAA;AAE/B;;;GAGG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,KAAK,CAAC,OAAO,CACrD,sBAAsB,EACtB;IACE,WAAW,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI;IAChD,gBAAgB,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;IACtD,iBAAiB,EAAE,CAAC,WAAW,EAAE,EAAE,CACjC,MAAM,CAAC,OAAO,CACZ,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAgC,CAC3E;CACJ,CACF,CAAA;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,KAAK,CAAC,MAAM,CACpD,sBAAsB,EACtB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,WAAW,CAAA;IAEtC,OAAO;QACL,WAAW,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;YAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;gBAC7B,KAAK,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC;oBAC5B,QAAQ,EAAE,aAAa;oBACvB,UAAU,EAAE,UAAU;oBACtB,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE;oBAChC,UAAU,EAAE,KAAK;oBACjB,QAAQ,EAAE,KAAK;oBACf,MAAM,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;oBACpC,QAAQ,EAAE;wBACR,QAAQ,EAAE,CAAC;wBACX,UAAU;qBACX;iBACF,CAAC,CAAC,IAAI;gBACL,yFAAyF;gBACzF,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,iBAAiB;oBAC/C,CAAC,CAAC,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;oBACxC,CAAC,CAAC,CAAC,CAAC,CACP,CAAA;YACH,CAAC;QACH,CAAC,CAAC;QAEJ,gBAAgB,EAAE,CAAC,UAAU,EAAE,EAAE,CAC/B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,gDAAgD;YAChD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAA;YAClF,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAA;YAEtE,8BAA8B;YAC9B,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,cAAc,CAAA;YACvB,CAAC;YAED,mCAAmC;YACnC,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAA;YACxC,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAA;YAEpE,8EAA8E;YAC9E,gDAAgD;YAChD,0CAA0C;YAC1C,OAAO,CAAC,YAAY,GAAG,cAAc,GAAG,qBAAqB,CAAC,GAAG,CAAC,UAAU,GAAG,qBAAqB,CAAC,CAAA;QACvG,CAAC,CAAC;QAEJ,iBAAiB,EAAE,CAAC,WAAW,EAAE,EAAE,CACjC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,qBAAqB;YACrB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,OAAO,IAAI,GAAG,EAAiC,CAAA;YACjD,CAAC;YAED,2CAA2C;YAC3C,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAA;YACtD,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,uBAAuB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAA;YAEvF,2CAA2C;YAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;YAExC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAA;gBAC5D,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAA;gBAEtE,8BAA8B;gBAC9B,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAA;oBACtC,SAAQ;gBACV,CAAC;gBAED,mCAAmC;gBACnC,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAA;gBACxC,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAA;gBAEpE,mBAAmB;gBACnB,MAAM,KAAK,GAAG,CAAC,YAAY,GAAG,cAAc,GAAG,qBAAqB,CAAC,GAAG,CAAC,UAAU,GAAG,qBAAqB,CAAC,CAAA;gBAC5G,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YAC/B,CAAC;YAED,OAAO,MAAqC,CAAA;QAC9C,CAAC,CAAC;KACL,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

package/dist/services/graph-expansion.d.ts

@@ -1,158 +0,0 @@
-import { Context, Effect, Layer } from "effect";
-import { EdgeService } from "./edge-service.js";
-import { LearningRepository } from "../repo/learning-repo.js";
-import { AnchorRepository } from "../repo/anchor-repo.js";
-import { DatabaseError, ValidationError } from "../errors.js";
-import type { Learning, EdgeType, LearningId } from "@jamesaphoenix/tx-types";
-/**
- * Seed learning with an initial score for graph expansion.
- * Typically the RRF score from hybrid search.
- */
-export interface SeedLearning {
-    readonly learning: Learning;
-    readonly score: number;
-}
-/**
- * Expanded learning with graph traversal metadata.
- */
-export interface ExpandedLearning {
-    readonly learning: Learning;
-    /** Number of hops from the nearest seed (0 = direct seed) */
-    readonly hops: number;
-    /** Score after applying weight decay per hop */
-    readonly decayedScore: number;
-    /** Path of learning IDs from seed to this learning */
-    readonly path: readonly LearningId[];
-    /** Edge type that connected this learning (null for seeds) */
-    readonly sourceEdge: EdgeType | null;
-    /** The edge weight that led to this learning (null for seeds) */
-    readonly edgeWeight: number | null;
-}
-/**
- * Filter configuration for edge types during graph traversal.
- * Supports include/exclude lists and per-hop overrides.
- */
-export interface EdgeTypeFilter {
-    /** Only traverse these edge types (mutually exclusive with exclude for same types) */
-    readonly include?: readonly EdgeType[];
-    /** Traverse all edge types except these (mutually exclusive with include for same types) */
-    readonly exclude?: readonly EdgeType[];
-    /** Depth-specific filter overrides (1-indexed, matching hop number) */
-    readonly perHop?: Readonly<Record<number, EdgeTypeFilter>>;
-}
-/**
- * Options for graph expansion algorithm.
- */
-export interface GraphExpansionOptions {
-    /** Maximum traversal depth (default: 2) */
-    readonly depth?: number;
-    /** Score decay factor per hop (default: 0.7) */
-    readonly decayFactor?: number;
-    /** Maximum nodes to return (default: 100) */
-    readonly maxNodes?: number;
-    /** Filter by specific edge types (default: all types).
-     * Accepts either a simple array for backwards compatibility or EdgeTypeFilter for advanced filtering. */
-    readonly edgeTypes?: EdgeTypeFilter | readonly EdgeType[];
-    /** Direction of edge traversal (default: "both") */
-    readonly direction?: "outbound" | "inbound" | "both";
-}
-/**
- * Result of graph expansion operation.
- */
-export interface GraphExpansionResult {
-    /** Seeds that were provided as input */
-    readonly seeds: readonly ExpandedLearning[];
-    /** Learnings discovered through graph expansion (excludes seeds) */
-    readonly expanded: readonly ExpandedLearning[];
-    /** Total learnings (seeds + expanded) */
-    readonly all: readonly ExpandedLearning[];
-    /** Statistics about the expansion */
-    readonly stats: {
-        readonly seedCount: number;
-        readonly expandedCount: number;
-        readonly maxDepthReached: number;
-        readonly nodesVisited: number;
-        readonly maxNodesReached: boolean;
-    };
-}
-/**
- * Options for file-based graph expansion.
- * Expands from files via IMPORTS and CO_CHANGES_WITH edges to find related learnings.
- * See PRD-016 for specification.
- */
-export interface FileExpansionOptions {
-    /** Maximum traversal depth for file relationships (default: 2) */
-    readonly depth?: number;
-    /** Score decay factor per hop (default: 0.7) */
-    readonly decayFactor?: number;
-    /** Maximum learnings to return (default: 100) */
-    readonly maxNodes?: number;
-}
-/**
- * A learning discovered through file-based graph expansion.
- * Contains metadata about how the learning was found via file relationships.
- */
-export interface FileExpandedLearning {
-    readonly learning: Learning;
-    /** The source file path that led to this learning */
-    readonly sourceFile: string;
-    /** Number of hops from the source file (0 = directly anchored to input file) */
-    readonly hops: number;
-    /** Score after applying weight decay per hop */
-    readonly decayedScore: number;
-    /** Edge type that connected this learning (ANCHORED_TO for direct, IMPORTS or CO_CHANGES_WITH for expanded) */
-    readonly sourceEdge: EdgeType;
-    /** Edge weight (null for directly anchored learnings, weight value for IMPORTS/CO_CHANGES_WITH) */
-    readonly edgeWeight: number | null;
-}
-/**
- * Result of file-based graph expansion operation.
- */
-export interface FileExpansionResult {
-    /** Learnings directly anchored to the input files (hop 0) */
-    readonly anchored: readonly FileExpandedLearning[];
-    /** Learnings discovered through file expansion (hops > 0 via IMPORTS/CO_CHANGES_WITH) */
-    readonly expanded: readonly FileExpandedLearning[];
-    /** All learnings (anchored + expanded), sorted by decayedScore */
-    readonly all: readonly FileExpandedLearning[];
-    /** Statistics about the expansion */
-    readonly stats: {
-        readonly inputFileCount: number;
-        readonly anchoredCount: number;
-        readonly expandedCount: number;
-        readonly maxDepthReached: number;
-        readonly filesVisited: number;
-    };
-}
-declare const GraphExpansionService_base: Context.TagClass<GraphExpansionService, "GraphExpansionService", {
-    /**
-     * Expand from seed learnings through the knowledge graph.
-     * Uses BFS traversal with weight decay per hop.
-     * Bidirectional traversal (both incoming and outgoing edges).
-     *
-     * @param seeds - Learnings to start expansion from, with initial scores
-     * @param options - Expansion configuration (depth, decay, limits)
-     * @returns Seeds and expanded learnings with traversal metadata
-     */
-    readonly expand: (seeds: readonly SeedLearning[], options?: GraphExpansionOptions) => Effect.Effect<GraphExpansionResult, ValidationError | DatabaseError>;
-    /**
-     * Expand from file paths to find related learnings.
-     * First finds learnings ANCHORED_TO the input files, then expands via
-     * IMPORTS and CO_CHANGES_WITH edges to find learnings anchored to related files.
-     *
-     * @param files - File paths to expand from (e.g., ["src/auth.ts", "src/jwt.ts"])
-     * @param options - Expansion configuration (depth, decay, limits)
-     * @returns Anchored and expanded learnings with file relationship metadata
-     */
-    readonly expandFromFiles: (files: readonly string[], options?: FileExpansionOptions) => Effect.Effect<FileExpansionResult, ValidationError | DatabaseError>;
-}>;
-export declare class GraphExpansionService extends GraphExpansionService_base {
-}
-/**
- * Noop implementation that returns seeds without expansion.
- * Used when graph expansion is disabled or for testing.
- */
-export declare const GraphExpansionServiceNoop: Layer.Layer<GraphExpansionService, never, never>;
-export declare const GraphExpansionServiceLive: Layer.Layer<GraphExpansionService, never, LearningRepository | AnchorRepository | EdgeService>;
-export {};
-//# sourceMappingURL=graph-expansion.d.ts.map

package/dist/services/graph-expansion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-expansion.d.ts","sourceRoot":"","sources":["../../src/services/graph-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,WAAW,EAA0B,MAAM,mBAAmB,CAAA;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AACzD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAC7D,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AAG7E;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;IAC3B,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,gDAAgD;IAChD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,CAAA;IACpC,8DAA8D;IAC9D,QAAQ,CAAC,UAAU,EAAE,QAAQ,GAAG,IAAI,CAAA;IACpC,iEAAiE;IACjE,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAA;CACnC;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,sFAAsF;IACtF,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAA;IACtC,4FAA4F;IAC5F,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAA;IACtC,uEAAuE;IACvE,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAA;CAC3D;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,2CAA2C;IAC3C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,gDAAgD;IAChD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,6CAA6C;IAC7C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;IAC1B;6GACyG;IACzG,QAAQ,CAAC,SAAS,CAAC,EAAE,cAAc,GAAG,SAAS,QAAQ,EAAE,CAAA;IACzD,oDAAoD;IACpD,QAAQ,CAAC,SAAS,CAAC,EAAE,UAAU,GAAG,SAAS,GAAG,MAAM,CAAA;CACrD;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,wCAAwC;IACxC,QAAQ,CAAC,KAAK,EAAE,SAAS,gBAAgB,EAAE,CAAA;IAC3C,oEAAoE;IACpE,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAA;IAC9C,yCAAyC;IACzC,QAAQ,CAAC,GAAG,EAAE,SAAS,gBAAgB,EAAE,CAAA;IACzC,qCAAqC;IACrC,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;QAC1B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;QAC9B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;QAChC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;QAC7B,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAA;KAClC,CAAA;CACF;AAED;;;;GAIG;AACH,MAAM,WAAW,oBAAoB;IACnC,kEAAkE;IAClE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;IACvB,gDAAgD;IAChD,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;IAC3B,qDAAqD;IACrD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,gFAAgF;IAChF,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,gDAAgD;IAChD,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,+GAA+G;IAC/G,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAA;IAC7B,mGAAmG;IACnG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAA;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,6DAA6D;IAC7D,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAA;IAClD,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAA;IAClD,kEAAkE;IAClE,QAAQ,CAAC,GAAG,EAAE,SAAS,oBAAoB,EAAE,CAAA;IAC7C,qCAAqC;IACrC,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;QAC/B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;QAC9B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;QAC9B,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;QAChC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;KAC9B,CAAA;CACF;;IAKG;;;;;;;;OAQG;qBACc,CACf,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,OAAO,CAAC,EAAE,qBAAqB,KAC5B,MAAM,CAAC,MAAM,CAAC,oBAAoB,EAAE,eAAe,GAAG,aAAa,CAAC;IAEzE;;;;;;;;OAQG;8BACuB,CACxB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,OAAO,CAAC,EAAE,oBAAoB,KAC3B,MAAM,CAAC,MAAM,CAAC,mBAAmB,EAAE,eAAe,GAAG,aAAa,CAAC;;AA7B5E,qBAAa,qBAAsB,SAAQ,0BA+BxC;CAAG;AAEN;;;GAGG;AACH,eAAO,MAAM,yBAAyB,kDA6CrC,CAAA;AA+HD,eAAO,MAAM,yBAAyB,gGAoZrC,CAAA"}