forge-server 0.1.0

package/dist/pipeline/state-machine.d.ts

@@ -0,0 +1,65 @@
+import type { Phase, PipelineTier } from '../util/types.js';
+/**
+ * Returns true when the requested phase transition is legal for the given tier.
+ *
+ * Rules:
+ *  - A phase may always transition to itself (idempotent re-start is handled
+ *    at the engine layer, but the state machine permits it).
+ *  - Otherwise the transition must appear in the table for the given tier.
+ *
+ * Note: cycle limit enforcement is NOT done here — call `canCycle()` in
+ * addition when the engine detects a backward edge.
+ */
+export declare function isValidTransition(from: Phase, to: Phase, tier: PipelineTier): boolean;
+/**
+ * Returns the set of phases that are legal next steps from `phase` for the
+ * given tier. This is used to populate `available_transitions` in API
+ * responses so callers know what actions are currently available.
+ */
+export declare function getAvailableTransitions(phase: Phase, tier: PipelineTier): Phase[];
+/**
+ * Maximum number of times each backward edge may be traversed before the
+ * engine forces a forward skip.
+ *
+ * Key format: '<from>_to_<to>'.
+ */
+export declare const MAX_CYCLES: Readonly<Record<string, number>>;
+/**
+ * Returns true if the backward (cycle) edge from -> to may be traversed given
+ * the current number of times it has already been traversed for this project.
+ *
+ * When the limit is exceeded the engine should force-advance to the next
+ * forward phase instead of looping.
+ *
+ * For transitions that are not tracked as cycles (i.e., not in MAX_CYCLES),
+ * this returns true unconditionally — those are ordinary forward transitions
+ * and cycle tracking does not apply.
+ */
+export declare function canCycle(from: Phase, to: Phase, currentCycleCount: number): boolean;
+/**
+ * Derives the cycle key used in the engine's cycle-count map for a given
+ * backward transition pair.
+ *
+ * Returns null when the pair is not a recognised cycle edge.
+ */
+export declare function getCycleKey(from: Phase, to: Phase): string | null;
+/**
+ * Determines whether a transition is a backward (cycle) edge, as opposed to a
+ * forward progression edge. This is needed by the engine to know when to
+ * increment the cycle counter.
+ *
+ * A transition is considered a cycle when:
+ *  - The `to` phase appears earlier in the canonical phase order than `from`.
+ *  - AND the key is present in MAX_CYCLES (meaning it is a recognised loop).
+ */
+export declare function isCycleTransition(from: Phase, to: Phase): boolean;
+/**
+ * Returns the phase the engine should force-advance to when a cycle limit is
+ * exceeded.
+ *
+ * Per the architecture spec:
+ *  - inspection -> implementation exceeded: force to knowledge_collection
+ *  - requirements -> architecture exceeded: force to implementation
+ */
+export declare function getForcedAdvancePhase(from: Phase, to: Phase): Phase | null;
+//# sourceMappingURL=state-machine.d.ts.map

package/dist/pipeline/state-machine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-machine.d.ts","sourceRoot":"","sources":["../../src/pipeline/state-machine.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AA0E5D;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,KAAK,EACX,EAAE,EAAE,KAAK,EACT,IAAI,EAAE,YAAY,GACjB,OAAO,CAQT;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,GAAG,KAAK,EAAE,CAGjF;AAMD;;;;;GAKG;AACH,eAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAGvD,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CACtB,IAAI,EAAE,KAAK,EACX,EAAE,EAAE,KAAK,EACT,iBAAiB,EAAE,MAAM,GACxB,OAAO,CAQT;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,CAGjE;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO,CAEjE;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,KAAK,GAAG,IAAI,CAO1E"}

package/dist/pipeline/state-machine.js

@@ -0,0 +1,176 @@
+// Pipeline state machine: transition table, validation, and cycle tracking.
+//
+// Design notes:
+// - The Phase type from types.ts uses the forge-graph-rag naming convention
+//   ('idle', 'interview', 'requirements', 'architecture', 'design', 'qa_strategy',
+//   'implementation', 'inspection', 'knowledge_collection', 'completed').
+// - PipelineTier determines which edges are legal.
+// - Cycle edges (inspection -> implementation, requirements -> architecture) are
+//   separate from the forward table so callers can track iteration counts.
+// ---------------------------------------------------------------------------
+// Transition table: maps each (Phase, PipelineTier) pair to the set of phases
+// that may legally be transitioned to.
+// ---------------------------------------------------------------------------
+// For 'full' and 'abbreviated' tiers we share the same edge set — abbreviated
+// is full minus the interview/requirements/design/qa phases, so we model it as
+// a separate entry below.
+const FULL_FORWARD_TRANSITIONS = {
+    idle: ['interview'],
+    interview: ['architecture'],
+    requirements: ['architecture'],
+    architecture: ['design', 'qa_strategy', 'implementation'],
+    design: ['qa_strategy', 'implementation'],
+    qa_strategy: ['implementation'],
+    implementation: ['inspection'],
+    inspection: ['knowledge_collection', 'implementation'],
+    knowledge_collection: ['completed'],
+    completed: [],
+};
+// Bug-fix (abbreviated) pipeline: idle -> architecture -> implementation ->
+// inspection -> (completed | implementation). No interview/requirements/design/qa.
+const BUG_FIX_FORWARD_TRANSITIONS = {
+    idle: ['architecture'],
+    interview: [],
+    requirements: ['architecture'],
+    architecture: ['implementation'],
+    design: [],
+    qa_strategy: [],
+    implementation: ['inspection'],
+    inspection: ['implementation', 'completed'],
+    knowledge_collection: [],
+    completed: [],
+};
+// Trivial: idle -> completed directly.
+const TRIVIAL_FORWARD_TRANSITIONS = {
+    idle: ['completed'],
+    interview: [],
+    requirements: [],
+    architecture: [],
+    design: [],
+    qa_strategy: [],
+    implementation: [],
+    inspection: [],
+    knowledge_collection: [],
+    completed: [],
+};
+// Internal lookup by tier.
+function getTable(tier) {
+    switch (tier) {
+        case 'full':
+            return FULL_FORWARD_TRANSITIONS;
+        case 'abbreviated':
+            return BUG_FIX_FORWARD_TRANSITIONS;
+        case 'trivial':
+            return TRIVIAL_FORWARD_TRANSITIONS;
+        default: {
+            // Exhaustiveness guard — TypeScript will catch unhandled tiers at
+            // compile time, but the runtime guard prevents silent misbehaviour.
+            const _exhaustive = tier;
+            throw new Error(`Unknown PipelineTier: ${_exhaustive}`);
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Returns true when the requested phase transition is legal for the given tier.
+ *
+ * Rules:
+ *  - A phase may always transition to itself (idempotent re-start is handled
+ *    at the engine layer, but the state machine permits it).
+ *  - Otherwise the transition must appear in the table for the given tier.
+ *
+ * Note: cycle limit enforcement is NOT done here — call `canCycle()` in
+ * addition when the engine detects a backward edge.
+ */
+export function isValidTransition(from, to, tier) {
+    if (from === to) {
+        // Re-entering the same phase is permitted (e.g., retrying a failed start).
+        return true;
+    }
+    const table = getTable(tier);
+    const legalTargets = table[from];
+    return legalTargets !== undefined && legalTargets.includes(to);
+}
+/**
+ * Returns the set of phases that are legal next steps from `phase` for the
+ * given tier. This is used to populate `available_transitions` in API
+ * responses so callers know what actions are currently available.
+ */
+export function getAvailableTransitions(phase, tier) {
+    const table = getTable(tier);
+    return [...(table[phase] ?? [])];
+}
+// ---------------------------------------------------------------------------
+// Cycle limits
+// ---------------------------------------------------------------------------
+/**
+ * Maximum number of times each backward edge may be traversed before the
+ * engine forces a forward skip.
+ *
+ * Key format: '<from>_to_<to>'.
+ */
+export const MAX_CYCLES = {
+    inspection_to_implementation: 3,
+    requirements_to_architecture: 2,
+};
+/**
+ * Returns true if the backward (cycle) edge from -> to may be traversed given
+ * the current number of times it has already been traversed for this project.
+ *
+ * When the limit is exceeded the engine should force-advance to the next
+ * forward phase instead of looping.
+ *
+ * For transitions that are not tracked as cycles (i.e., not in MAX_CYCLES),
+ * this returns true unconditionally — those are ordinary forward transitions
+ * and cycle tracking does not apply.
+ */
+export function canCycle(from, to, currentCycleCount) {
+    const key = `${from}_to_${to}`;
+    const max = MAX_CYCLES[key];
+    if (max === undefined) {
+        // Not a tracked cycle edge — no limit applies.
+        return true;
+    }
+    return currentCycleCount < max;
+}
+/**
+ * Derives the cycle key used in the engine's cycle-count map for a given
+ * backward transition pair.
+ *
+ * Returns null when the pair is not a recognised cycle edge.
+ */
+export function getCycleKey(from, to) {
+    const key = `${from}_to_${to}`;
+    return key in MAX_CYCLES ? key : null;
+}
+/**
+ * Determines whether a transition is a backward (cycle) edge, as opposed to a
+ * forward progression edge. This is needed by the engine to know when to
+ * increment the cycle counter.
+ *
+ * A transition is considered a cycle when:
+ *  - The `to` phase appears earlier in the canonical phase order than `from`.
+ *  - AND the key is present in MAX_CYCLES (meaning it is a recognised loop).
+ */
+export function isCycleTransition(from, to) {
+    return getCycleKey(from, to) !== null;
+}
+/**
+ * Returns the phase the engine should force-advance to when a cycle limit is
+ * exceeded.
+ *
+ * Per the architecture spec:
+ *  - inspection -> implementation exceeded: force to knowledge_collection
+ *  - requirements -> architecture exceeded: force to implementation
+ */
+export function getForcedAdvancePhase(from, to) {
+    const key = `${from}_to_${to}`;
+    const forced = {
+        inspection_to_implementation: 'knowledge_collection',
+        requirements_to_architecture: 'implementation',
+    };
+    return forced[key] ?? null;
+}
+//# sourceMappingURL=state-machine.js.map

package/dist/pipeline/state-machine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-machine.js","sourceRoot":"","sources":["../../src/pipeline/state-machine.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,EAAE;AACF,gBAAgB;AAChB,4EAA4E;AAC5E,mFAAmF;AACnF,0EAA0E;AAC1E,mDAAmD;AACnD,iFAAiF;AACjF,2EAA2E;AAI3E,8EAA8E;AAC9E,8EAA8E;AAC9E,uCAAuC;AACvC,8EAA8E;AAE9E,8EAA8E;AAC9E,+EAA+E;AAC/E,0BAA0B;AAC1B,MAAM,wBAAwB,GAA8C;IAC1E,IAAI,EAAkB,CAAC,WAAW,CAAC;IACnC,SAAS,EAAa,CAAC,cAAc,CAAC;IACtC,YAAY,EAAU,CAAC,cAAc,CAAC;IACtC,YAAY,EAAU,CAAC,QAAQ,EAAE,aAAa,EAAE,gBAAgB,CAAC;IACjE,MAAM,EAAgB,CAAC,aAAa,EAAE,gBAAgB,CAAC;IACvD,WAAW,EAAW,CAAC,gBAAgB,CAAC;IACxC,cAAc,EAAQ,CAAC,YAAY,CAAC;IACpC,UAAU,EAAY,CAAC,sBAAsB,EAAE,gBAAgB,CAAC;IAChE,oBAAoB,EAAE,CAAC,WAAW,CAAC;IACnC,SAAS,EAAa,EAAE;CACzB,CAAC;AAEF,4EAA4E;AAC5E,mFAAmF;AACnF,MAAM,2BAA2B,GAA8C;IAC7E,IAAI,EAAkB,CAAC,cAAc,CAAC;IACtC,SAAS,EAAa,EAAE;IACxB,YAAY,EAAU,CAAC,cAAc,CAAC;IACtC,YAAY,EAAU,CAAC,gBAAgB,CAAC;IACxC,MAAM,EAAgB,EAAE;IACxB,WAAW,EAAW,EAAE;IACxB,cAAc,EAAQ,CAAC,YAAY,CAAC;IACpC,UAAU,EAAY,CAAC,gBAAgB,EAAE,WAAW,CAAC;IACrD,oBAAoB,EAAE,EAAE;IACxB,SAAS,EAAa,EAAE;CACzB,CAAC;AAEF,uCAAuC;AACvC,MAAM,2BAA2B,GAA8C;IAC7E,IAAI,EAAkB,CAAC,WAAW,CAAC;IACnC,SAAS,EAAa,EAAE;IACxB,YAAY,EAAU,EAAE;IACxB,YAAY,EAAU,EAAE;IACxB,MAAM,EAAgB,EAAE;IACxB,WAAW,EAAW,EAAE;IACxB,cAAc,EAAQ,EAAE;IACxB,UAAU,EAAY,EAAE;IACxB,oBAAoB,EAAE,EAAE;IACxB,SAAS,EAAa,EAAE;CACzB,CAAC;AAEF,2BAA2B;AAC3B,SAAS,QAAQ,CAAC,IAAkB;IAClC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM;YACT,OAAO,wBAAwB,CAAC;QAClC,KAAK,aAAa;YAChB,OAAO,2BAA2B,CAAC;QACrC,KAAK,SAAS;YACZ,OAAO,2BAA2B,CAAC;QACrC,OAAO,CAAC,CAAC,CAAC;YACR,kEAAkE;YAClE,oEAAoE;YACpE,MAAM,WAAW,GAAU,IAAI,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,yBAAyB,WAAW,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAW,EACX,EAAS,EACT,IAAkB;IAElB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,2EAA2E;QAC3E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,OAAO,YAAY,KAAK,SAAS,IAAK,YAAiC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACvF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAY,EAAE,IAAkB;IACtE,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAqC;IAC1D,4BAA4B,EAAE,CAAC;IAC/B,4BAA4B,EAAE,CAAC;CAChC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CACtB,IAAW,EACX,EAAS,EACT,iBAAyB;IAEzB,MAAM,GAAG,GAAG,GAAG,IAAI,OAAO,EAAE,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,+CAA+C;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,iBAAiB,GAAG,GAAG,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAAW,EAAE,EAAS;IAChD,MAAM,GAAG,GAAG,GAAG,IAAI,OAAO,EAAE,EAAE,CAAC;IAC/B,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACxC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAW,EAAE,EAAS;IACtD,OAAO,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAW,EAAE,EAAS;IAC1D,MAAM,GAAG,GAAG,GAAG,IAAI,OAAO,EAAE,EAAE,CAAC;IAC/B,MAAM,MAAM,GAA0B;QACpC,4BAA4B,EAAE,sBAAsB;QACpD,4BAA4B,EAAE,gBAAgB;KAC/C,CAAC;IACF,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;AAC7B,CAAC"}

package/dist/query/graph-queries.d.ts

@@ -0,0 +1,84 @@
+/**
+ * Cypher query templates for FalkorDB graph operations.
+ * Centralizes all graph query patterns used by tools.
+ */
+export declare const INDEX_QUERIES: readonly ["CREATE INDEX ON :File(path, repo_id)", "CREATE INDEX ON :Function(name, repo_id)", "CREATE INDEX ON :Class(name, repo_id)", "CREATE INDEX ON :Interface(name, repo_id)", "CREATE INDEX ON :Module(name, repo_id)", "CREATE INDEX ON :Observation(id)", "CREATE INDEX ON :Observation(session_id)"];
+export declare const QUERY_TOTAL_NODES = "MATCH (n) RETURN count(n) as cnt";
+export declare const QUERY_TOTAL_EDGES = "MATCH ()-[r]->() RETURN count(r) as cnt";
+export declare const QUERY_NODES_BY_LABEL: (label: string) => string;
+/**
+ * Get all entities contained in a file.
+ */
+export declare const QUERY_FILE_ENTITIES: (filePath: string, repoId: string) => string;
+/**
+ * Get all files in a repo.
+ */
+export declare const QUERY_REPO_FILES: (repoId: string) => string;
+/**
+ * Get files in a directory.
+ */
+export declare const QUERY_DIRECTORY_FILES: (dirPath: string, repoId: string) => string;
+/**
+ * Inbound: who calls/imports/uses this symbol?
+ */
+export declare const QUERY_INBOUND_IMPACT: (symbolName: string, repoId: string, depth: number) => string;
+/**
+ * Outbound: what does this symbol depend on?
+ */
+export declare const QUERY_OUTBOUND_IMPACT: (symbolName: string, repoId: string, depth: number) => string;
+/**
+ * Shortest path between two symbols in the call graph.
+ */
+export declare const QUERY_SHORTEST_PATH: (fromSymbol: string, toSymbol: string, repoId: string, maxDepth: number) => string;
+/**
+ * Get graph neighbors of a file (imports, tests, co-modified).
+ * Used to boost vector search results with graph connectivity.
+ */
+export declare const QUERY_FILE_NEIGHBORS: (filePath: string, repoId: string, depth: number) => string;
+/**
+ * Get import graph for a file.
+ */
+export declare const QUERY_FILE_IMPORTS: (filePath: string, repoId: string) => string;
+/**
+ * Get test files for a source file.
+ */
+export declare const QUERY_FILE_TESTS: (filePath: string, repoId: string) => string;
+/**
+ * Create or update an Observation node.
+ */
+export declare const UPSERT_OBSERVATION: (id: string, content: string, sessionId: string, importance: number) => string;
+/**
+ * Link an observation to a code symbol via REFERENCES edge.
+ */
+export declare const LINK_OBSERVATION_TO_SYMBOL: (observationId: string, symbolName: string, repoId: string) => string;
+/**
+ * Get recent observations by session.
+ */
+export declare const QUERY_SESSION_OBSERVATIONS: (sessionId: string, limit: number) => string;
+/**
+ * Mark observations as stale when a symbol changes.
+ */
+export declare const MARK_SYMBOL_OBSERVATIONS_STALE: (symbolName: string, repoId: string) => string;
+/**
+ * Get top files by commit_count (change hotspots) for a repo.
+ * Requires File nodes to have commit_count property set by git enrichment.
+ */
+export declare const QUERY_FILE_HOTSPOTS: (repoId: string, limit?: number) => string;
+/**
+ * Get git stats for a single file.
+ */
+export declare const QUERY_FILE_STATS: (filePath: string, repoId: string) => string;
+/**
+ * Upsert a co-modification relationship between two files.
+ */
+export declare const UPSERT_CO_MODIFIED: (fileA: string, fileB: string, repoId: string, count: number, lastCommit: string) => string;
+/**
+ * Upsert a CALLS relationship between two functions.
+ * Uses MERGE to avoid duplicate edges.
+ */
+export declare const UPSERT_CALLS: (callerName: string, callerFilePath: string, calleeName: string, calleeFilePath: string, repoId: string, callCount: number) => string;
+/**
+ * Upsert a TESTS relationship from a test file to its source file.
+ */
+export declare const UPSERT_TESTS: (testFilePath: string, sourceFilePath: string, repoId: string) => string;
+//# sourceMappingURL=graph-queries.d.ts.map

package/dist/query/graph-queries.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-queries.d.ts","sourceRoot":"","sources":["../../src/query/graph-queries.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,eAAO,MAAM,aAAa,+SAQhB,CAAC;AAMX,eAAO,MAAM,iBAAiB,qCAAqC,CAAC;AACpE,eAAO,MAAM,iBAAiB,4CAA4C,CAAC;AAE3E,eAAO,MAAM,oBAAoB,GAAI,OAAO,MAAM,WACL,CAAC;AAM9C;;GAEG;AACH,eAAO,MAAM,mBAAmB,GAAI,UAAU,MAAM,EAAE,QAAQ,MAAM,WAGnE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,gBAAgB,GAAI,QAAQ,MAAM,WAG9C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,qBAAqB,GAAI,SAAS,MAAM,EAAE,QAAQ,MAAM,WAIpE,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAAI,YAAY,MAAM,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,WAKrF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,qBAAqB,GAAI,YAAY,MAAM,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,WAKtF,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,mBAAmB,GAAI,YAAY,MAAM,EAAE,UAAU,MAAM,EAAE,QAAQ,MAAM,EAAE,UAAU,MAAM,WAMzG,CAAC;AAMF;;;GAGG;AACH,eAAO,MAAM,oBAAoB,GAAI,UAAU,MAAM,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,WAKnF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,UAAU,MAAM,EAAE,QAAQ,MAAM,WAGlE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,gBAAgB,GAAI,UAAU,MAAM,EAAE,QAAQ,MAAM,WAGhE,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAC7B,IAAI,MAAM,EACV,SAAS,MAAM,EACf,WAAW,MAAM,EACjB,YAAY,MAAM,WAQnB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,0BAA0B,GAAI,eAAe,MAAM,EAAE,YAAY,MAAM,EAAE,QAAQ,MAAM,WAInG,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,0BAA0B,GAAI,WAAW,MAAM,EAAE,OAAO,MAAM,WAG1E,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,8BAA8B,GAAI,YAAY,MAAM,EAAE,QAAQ,MAAM,WAGhF,CAAC;AAMF;;;GAGG;AACH,eAAO,MAAM,mBAAmB,GAAI,QAAQ,MAAM,EAAE,QAAO,MAAY,WAMtE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,gBAAgB,GAAI,UAAU,MAAM,EAAE,QAAQ,MAAM,WAGhE,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,OAAO,MAAM,EAAE,OAAO,MAAM,EAAE,QAAQ,MAAM,EAAE,OAAO,MAAM,EAAE,YAAY,MAAM,WAKjH,CAAC;AAMF;;;GAGG;AACH,eAAO,MAAM,YAAY,GACvB,YAAY,MAAM,EAClB,gBAAgB,MAAM,EACtB,YAAY,MAAM,EAClB,gBAAgB,MAAM,EACtB,QAAQ,MAAM,EACd,WAAW,MAAM,WAMlB,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,YAAY,GAAI,cAAc,MAAM,EAAE,gBAAgB,MAAM,EAAE,QAAQ,MAAM,WAIxF,CAAC"}

package/dist/query/graph-queries.js

@@ -0,0 +1,216 @@
+/**
+ * Cypher query templates for FalkorDB graph operations.
+ * Centralizes all graph query patterns used by tools.
+ */
+// ============================================================
+// Index Creation Queries
+// ============================================================
+export const INDEX_QUERIES = [
+    'CREATE INDEX ON :File(path, repo_id)',
+    'CREATE INDEX ON :Function(name, repo_id)',
+    'CREATE INDEX ON :Class(name, repo_id)',
+    'CREATE INDEX ON :Interface(name, repo_id)',
+    'CREATE INDEX ON :Module(name, repo_id)',
+    'CREATE INDEX ON :Observation(id)',
+    'CREATE INDEX ON :Observation(session_id)',
+];
+// ============================================================
+// Node Count Queries
+// ============================================================
+export const QUERY_TOTAL_NODES = 'MATCH (n) RETURN count(n) as cnt';
+export const QUERY_TOTAL_EDGES = 'MATCH ()-[r]->() RETURN count(r) as cnt';
+export const QUERY_NODES_BY_LABEL = (label) => `MATCH (n:${label}) RETURN count(n) as cnt`;
+// ============================================================
+// File Queries
+// ============================================================
+/**
+ * Get all entities contained in a file.
+ */
+export const QUERY_FILE_ENTITIES = (filePath, repoId) => `
+  MATCH (f:File {path: "${esc(filePath)}", repo_id: "${esc(repoId)}"})-[:CONTAINS]->(s)
+  RETURN s, labels(s) as label
+`;
+/**
+ * Get all files in a repo.
+ */
+export const QUERY_REPO_FILES = (repoId) => `
+  MATCH (f:File {repo_id: "${esc(repoId)}"})
+  RETURN f.path as path, f.content_hash as hash, f.last_indexed as indexed_at
+`;
+/**
+ * Get files in a directory.
+ */
+export const QUERY_DIRECTORY_FILES = (dirPath, repoId) => `
+  MATCH (f:File {repo_id: "${esc(repoId)}"})
+  WHERE f.path STARTS WITH "${esc(dirPath)}"
+  RETURN f.path as path, f.language as language
+`;
+// ============================================================
+// Impact Graph Queries
+// ============================================================
+/**
+ * Inbound: who calls/imports/uses this symbol?
+ */
+export const QUERY_INBOUND_IMPACT = (symbolName, repoId, depth) => `
+  MATCH (center {name: "${esc(symbolName)}", repo_id: "${esc(repoId)}"})
+  MATCH path = (caller)-[r*1..${depth}]->(center)
+  RETURN caller, r, length(path) as depth
+  LIMIT 50
+`;
+/**
+ * Outbound: what does this symbol depend on?
+ */
+export const QUERY_OUTBOUND_IMPACT = (symbolName, repoId, depth) => `
+  MATCH (center {name: "${esc(symbolName)}", repo_id: "${esc(repoId)}"})
+  MATCH path = (center)-[r*1..${depth}]->(dep)
+  RETURN dep, r, length(path) as depth
+  LIMIT 50
+`;
+// ============================================================
+// Logic Flow Queries
+// ============================================================
+/**
+ * Shortest path between two symbols in the call graph.
+ */
+export const QUERY_SHORTEST_PATH = (fromSymbol, toSymbol, repoId, maxDepth) => `
+  MATCH (a {name: "${esc(fromSymbol)}", repo_id: "${esc(repoId)}"}),
+        (b {name: "${esc(toSymbol)}", repo_id: "${esc(repoId)}"})
+  MATCH path = shortestPath((a)-[*..${maxDepth}]->(b))
+  RETURN path
+  LIMIT 3
+`;
+// ============================================================
+// Graph Neighbor Queries (for hybrid search boost)
+// ============================================================
+/**
+ * Get graph neighbors of a file (imports, tests, co-modified).
+ * Used to boost vector search results with graph connectivity.
+ */
+export const QUERY_FILE_NEIGHBORS = (filePath, repoId, depth) => `
+  MATCH (f:File {path: "${esc(filePath)}", repo_id: "${esc(repoId)}"})
+  MATCH (f)-[r*1..${depth}]-(neighbor:File)
+  RETURN neighbor.path as path, type(r[0]) as rel_type, length(r) as depth
+  LIMIT 20
+`;
+/**
+ * Get import graph for a file.
+ */
+export const QUERY_FILE_IMPORTS = (filePath, repoId) => `
+  MATCH (f:File {path: "${esc(filePath)}", repo_id: "${esc(repoId)}"})-[:IMPORTS]->(dep:File)
+  RETURN dep.path as path
+`;
+/**
+ * Get test files for a source file.
+ */
+export const QUERY_FILE_TESTS = (filePath, repoId) => `
+  MATCH (test:File)-[:TESTS]->(src:File {path: "${esc(filePath)}", repo_id: "${esc(repoId)}"})
+  RETURN test.path as path
+`;
+// ============================================================
+// Observation Queries
+// ============================================================
+/**
+ * Create or update an Observation node.
+ */
+export const UPSERT_OBSERVATION = (id, content, sessionId, importance) => `
+  MERGE (o:Observation {id: "${esc(id)}"})
+  SET o.content = "${esc(content)}",
+      o.session_id = "${esc(sessionId)}",
+      o.importance = ${importance},
+      o.is_stale = false,
+      o.created_at = ${Date.now()}
+`;
+/**
+ * Link an observation to a code symbol via REFERENCES edge.
+ */
+export const LINK_OBSERVATION_TO_SYMBOL = (observationId, symbolName, repoId) => `
+  MATCH (o:Observation {id: "${esc(observationId)}"})
+  MATCH (s {name: "${esc(symbolName)}", repo_id: "${esc(repoId)}"})
+  MERGE (o)-[:REFERENCES]->(s)
+`;
+/**
+ * Get recent observations by session.
+ */
+export const QUERY_SESSION_OBSERVATIONS = (sessionId, limit) => `
+  MATCH (o:Observation {session_id: "${esc(sessionId)}"})
+  RETURN o ORDER BY o.created_at DESC LIMIT ${limit}
+`;
+/**
+ * Mark observations as stale when a symbol changes.
+ */
+export const MARK_SYMBOL_OBSERVATIONS_STALE = (symbolName, repoId) => `
+  MATCH (o:Observation)-[:REFERENCES]->(s {name: "${esc(symbolName)}", repo_id: "${esc(repoId)}"})
+  SET o.is_stale = true
+`;
+// ============================================================
+// File Hotspot Queries (Phase 3 - git enrichment)
+// ============================================================
+/**
+ * Get top files by commit_count (change hotspots) for a repo.
+ * Requires File nodes to have commit_count property set by git enrichment.
+ */
+export const QUERY_FILE_HOTSPOTS = (repoId, limit = 100) => `
+  MATCH (f:File {repo_id: "${esc(repoId)}"})
+  WHERE f.commit_count IS NOT NULL AND f.commit_count > 0
+  RETURN f.path as path, f.commit_count as commit_count, f.stability_score as stability_score, f.change_velocity as change_velocity
+  ORDER BY f.commit_count DESC
+  LIMIT ${limit}
+`;
+/**
+ * Get git stats for a single file.
+ */
+export const QUERY_FILE_STATS = (filePath, repoId) => `
+  MATCH (f:File {path: "${esc(filePath)}", repo_id: "${esc(repoId)}"})
+  RETURN f.path as path, f.commit_count as commit_count, f.stability_score as stability_score, f.change_velocity as change_velocity, f.last_commit_hash as last_commit_hash, f.last_commit_ts as last_commit_ts
+`;
+// ============================================================
+// Co-modification Queries
+// ============================================================
+/**
+ * Upsert a co-modification relationship between two files.
+ */
+export const UPSERT_CO_MODIFIED = (fileA, fileB, repoId, count, lastCommit) => `
+  MATCH (a:File {path: "${esc(fileA)}", repo_id: "${esc(repoId)}"})
+  MATCH (b:File {path: "${esc(fileB)}", repo_id: "${esc(repoId)}"})
+  MERGE (a)-[r:CO_MODIFIED]-(b)
+  SET r.count = ${count}, r.last_commit = "${esc(lastCommit)}"
+`;
+// ============================================================
+// CALLS Edge Queries
+// ============================================================
+/**
+ * Upsert a CALLS relationship between two functions.
+ * Uses MERGE to avoid duplicate edges.
+ */
+export const UPSERT_CALLS = (callerName, callerFilePath, calleeName, calleeFilePath, repoId, callCount) => `
+  MATCH (caller:Function {name: "${esc(callerName)}", file_path: "${esc(callerFilePath)}", repo_id: "${esc(repoId)}"})
+  MATCH (callee:Function {name: "${esc(calleeName)}", file_path: "${esc(calleeFilePath)}", repo_id: "${esc(repoId)}"})
+  MERGE (caller)-[r:CALLS]->(callee)
+  SET r.call_count = ${callCount}
+`;
+// ============================================================
+// TESTS Edge Queries
+// ============================================================
+/**
+ * Upsert a TESTS relationship from a test file to its source file.
+ */
+export const UPSERT_TESTS = (testFilePath, sourceFilePath, repoId) => `
+  MATCH (test:File {path: "${esc(testFilePath)}", repo_id: "${esc(repoId)}"})
+  MATCH (src:File {path: "${esc(sourceFilePath)}", repo_id: "${esc(repoId)}"})
+  MERGE (test)-[:TESTS]->(src)
+`;
+// ============================================================
+// Utility
+// ============================================================
+/**
+ * Escape a string for safe embedding in Cypher queries.
+ * FalkorDB uses double-quoted strings.
+ */
+function esc(s) {
+    return s
+        .replace(/\\/g, '\\\\')
+        .replace(/"/g, '\\"')
+        .replace(/\n/g, '\\n')
+        .replace(/\r/g, '');
+}
+//# sourceMappingURL=graph-queries.js.map

package/dist/query/graph-queries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-queries.js","sourceRoot":"","sources":["../../src/query/graph-queries.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAE/D,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,sCAAsC;IACtC,0CAA0C;IAC1C,uCAAuC;IACvC,2CAA2C;IAC3C,wCAAwC;IACxC,kCAAkC;IAClC,0CAA0C;CAClC,CAAC;AAEX,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAE/D,MAAM,CAAC,MAAM,iBAAiB,GAAG,kCAAkC,CAAC;AACpE,MAAM,CAAC,MAAM,iBAAiB,GAAG,yCAAyC,CAAC;AAE3E,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,KAAa,EAAE,EAAE,CACpD,YAAY,KAAK,0BAA0B,CAAC;AAE9C,+DAA+D;AAC/D,eAAe;AACf,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,QAAgB,EAAE,MAAc,EAAE,EAAE,CAAC;0BAC/C,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAEjE,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,MAAc,EAAE,EAAE,CAAC;6BACvB,GAAG,CAAC,MAAM,CAAC;;CAEvC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,OAAe,EAAE,MAAc,EAAE,EAAE,CAAC;6BAC7C,GAAG,CAAC,MAAM,CAAC;8BACV,GAAG,CAAC,OAAO,CAAC;;CAEzC,CAAC;AAEF,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,UAAkB,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE,CAAC;0BACjE,GAAG,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;gCACpC,KAAK;;;CAGpC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,UAAkB,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE,CAAC;0BAClE,GAAG,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;gCACpC,KAAK;;;CAGpC,CAAC;AAEF,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,UAAkB,EAAE,QAAgB,EAAE,MAAc,EAAE,QAAgB,EAAE,EAAE,CAAC;qBAC1F,GAAG,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;qBAC1C,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;sCACvB,QAAQ;;;CAG7C,CAAC;AAEF,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAE/D;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,QAAgB,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE,CAAC;0BAC/D,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;oBAC9C,KAAK;;;CAGxB,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,QAAgB,EAAE,MAAc,EAAE,EAAE,CAAC;0BAC9C,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAEjE,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,QAAgB,EAAE,MAAc,EAAE,EAAE,CAAC;kDACpB,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAEzF,CAAC;AAEF,+DAA+D;AAC/D,sBAAsB;AACtB,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,EAAU,EACV,OAAe,EACf,SAAiB,EACjB,UAAkB,EAClB,EAAE,CAAC;+BAC0B,GAAG,CAAC,EAAE,CAAC;qBACjB,GAAG,CAAC,OAAO,CAAC;wBACT,GAAG,CAAC,SAAS,CAAC;uBACf,UAAU;;uBAEV,IAAI,CAAC,GAAG,EAAE;CAChC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,aAAqB,EAAE,UAAkB,EAAE,MAAc,EAAE,EAAE,CAAC;+BAC1E,GAAG,CAAC,aAAa,CAAC;qBAC5B,GAAG,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAE9D,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,SAAiB,EAAE,KAAa,EAAE,EAAE,CAAC;uCACzC,GAAG,CAAC,SAAS,CAAC;8CACP,KAAK;CAClD,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAAC,UAAkB,EAAE,MAAc,EAAE,EAAE,CAAC;oDAClC,GAAG,CAAC,UAAU,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAE7F,CAAC;AAEF,+DAA+D;AAC/D,kDAAkD;AAClD,+DAA+D;AAE/D;;;GAGG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,MAAc,EAAE,QAAgB,GAAG,EAAE,EAAE,CAAC;6BAC/C,GAAG,CAAC,MAAM,CAAC;;;;UAI9B,KAAK;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,QAAgB,EAAE,MAAc,EAAE,EAAE,CAAC;0BAC5C,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAEjE,CAAC;AAEF,+DAA+D;AAC/D,0BAA0B;AAC1B,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,MAAc,EAAE,KAAa,EAAE,UAAkB,EAAE,EAAE,CAAC;0BAC7F,GAAG,CAAC,KAAK,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;0BACrC,GAAG,CAAC,KAAK,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;kBAE7C,KAAK,sBAAsB,GAAG,CAAC,UAAU,CAAC;CAC3D,CAAC;AAEF,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAE/D;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,UAAkB,EAClB,cAAsB,EACtB,UAAkB,EAClB,cAAsB,EACtB,MAAc,EACd,SAAiB,EACjB,EAAE,CAAC;mCAC8B,GAAG,CAAC,UAAU,CAAC,kBAAkB,GAAG,CAAC,cAAc,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;mCAC/E,GAAG,CAAC,UAAU,CAAC,kBAAkB,GAAG,CAAC,cAAc,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;uBAE3F,SAAS;CAC/B,CAAC;AAEF,+DAA+D;AAC/D,qBAAqB;AACrB,+DAA+D;AAE/D;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,YAAoB,EAAE,cAAsB,EAAE,MAAc,EAAE,EAAE,CAAC;6BACjE,GAAG,CAAC,YAAY,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;4BAC7C,GAAG,CAAC,cAAc,CAAC,gBAAgB,GAAG,CAAC,MAAM,CAAC;;CAEzE,CAAC;AAEF,+DAA+D;AAC/D,UAAU;AACV,+DAA+D;AAE/D;;;GAGG;AACH,SAAS,GAAG,CAAC,CAAS;IACpB,OAAO,CAAC;SACL,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;SACtB,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC;SACpB,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;SACrB,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACxB,CAAC"}

package/dist/query/hybrid-search.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Hybrid search engine combining vector similarity + graph neighbor boost.
+ * Final scoring: 0.6 * vector_score + 0.3 * graph_centrality + 0.1 * recency_boost
+ *
+ * Phase 2: Full graph neighbor expansion.
+ * For each vector hit, traverse graph neighbors (IMPORTS, CALLS, TESTS, CO_MODIFIED)
+ * up to pivot_depth hops, collect neighbor file paths, and boost their scores.
+ * Graph centrality = number of times a file appears as a neighbor / max neighbor appearances.
+ */
+import type { VectorStore, GraphStore } from '../storage/interfaces.js';
+import type { QueryIntent } from '../util/types.js';
+import { type ScoredResult } from './ranking.js';
+export interface HybridSearchOptions {
+    query: string;
+    repoId?: string;
+    limit?: number;
+    includeTests?: boolean;
+    pivotDepth?: number;
+    vectorWeight?: number;
+    graphWeight?: number;
+    /** Query intent — affects whether hotspot scoring is applied */
+    intent?: QueryIntent;
+}
+export interface HybridSearchResult {
+    results: ScoredResult[];
+    cacheHits: number;
+    executionTimeMs: number;
+}
+/**
+ * Perform hybrid search over indexed code chunks.
+ * Returns deduplicated, ranked results by file.
+ */
+export declare function hybridSearch(vectorStore: VectorStore, graphStore: GraphStore, options: HybridSearchOptions): Promise<HybridSearchResult>;
+//# sourceMappingURL=hybrid-search.d.ts.map

package/dist/query/hybrid-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-search.d.ts","sourceRoot":"","sources":["../../src/query/hybrid-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACxE,OAAO,KAAK,EAAoB,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EAAqD,KAAK,YAAY,EAAE,MAAM,cAAc,CAAC;AAIpG,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gEAAgE;IAChE,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAChC,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,UAAU,EACtB,OAAO,EAAE,mBAAmB,GAC3B,OAAO,CAAC,kBAAkB,CAAC,CA0O7B"}