memento-mcp-server 1.16.1-a → 1.16.2-a

package/dist/domains/anchor/services/anchor/n-hop-search-service.d.ts

@@ -0,0 +1,90 @@
+/**
+ * N-hop 검색 서비스 인터페이스 및 구현
+ * Phase 2.3: anchor-search-service.ts 분리
+ */
+import type Database from 'better-sqlite3';
+import type { VectorSearchEngine } from '../../../search/algorithms/vector-search-engine.js';
+import type { IAnchorCacheService } from './anchor-interfaces.js';
+import type { RelationGraph } from '../../../relation/services/relation-graph.js';
+/**
+ * N-hop 검색 결과
+ */
+export interface NHopSearchResult {
+    memory_id: string;
+    content: string;
+    type: string;
+    similarity: number;
+    hop_distance: number;
+    importance: number;
+    created_at: string;
+    tags?: string[];
+    hasRelation?: boolean;
+}
+/**
+ * 1-hop 검색 결과
+ */
+export interface OneHopSearchResult {
+    memory_id: string;
+    content: string;
+    type: string;
+    similarity: number;
+    importance: number;
+    created_at: string;
+    tags?: string[];
+}
+/**
+ * N-hop 검색 서비스 인터페이스
+ */
+export interface INHopSearchService {
+    /**
+     * 1-hop 검색: 앵커와 직접적으로 유사한 메모리 검색
+     */
+    searchOneHop(anchorEmbedding: number[], provider: string, anchorMemoryId: string, threshold: number, limit: number): Promise<OneHopSearchResult[]>;
+    /**
+     * N-hop 검색: 앵커를 기준으로 최대 N-hop까지 확장 검색
+     */
+    searchNHop(anchorEmbedding: number[], provider: string, anchorMemoryId: string, threshold: number, maxHops: number, limit: number, useRelations?: boolean): Promise<NHopSearchResult[]>;
+}
+/**
+ * N-hop 검색 서비스 구현
+ */
+export declare class NHopSearchService implements INHopSearchService {
+    private db;
+    private cacheService;
+    private vectorSearchEngine;
+    private relationGraph;
+    constructor(cacheService: IAnchorCacheService);
+    /**
+     * 데이터베이스 설정
+     */
+    setDatabase(db: Database.Database): void;
+    /**
+     * 벡터 검색 엔진 설정
+     */
+    setVectorSearchEngine(vectorSearchEngine: VectorSearchEngine): void;
+    /**
+     * 관계 그래프 설정
+     */
+    setRelationGraph(relationGraph: RelationGraph): void;
+    /**
+     * 1-hop 검색: 앵커와 직접적으로 유사한 메모리 검색
+     */
+    searchOneHop(anchorEmbedding: number[], provider: string, anchorMemoryId: string, threshold: number, limit: number): Promise<OneHopSearchResult[]>;
+    /**
+     * N-hop 검색: 앵커를 기준으로 최대 N-hop까지 확장 검색
+     */
+    searchNHop(anchorEmbedding: number[], provider: string, anchorMemoryId: string, threshold: number, maxHops: number, limit: number, useRelations?: boolean): Promise<NHopSearchResult[]>;
+    /**
+     * 연결된 메모리 조회 (관계 그래프 또는 memory_link 사용)
+     */
+    private getLinkedMemories;
+    /**
+     * 관계 유형별 부스트 가중치 반환
+     */
+    private getRelationTypeBoost;
+    /**
+     * 검색 결과 랭킹 점수 계산
+     */
+    private calculateRankingScore;
+}
+//# sourceMappingURL=n-hop-search-service.d.ts.map

package/dist/domains/anchor/services/anchor/n-hop-search-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"n-hop-search-service.d.ts","sourceRoot":"","sources":["../../../../../src/domains/anchor/services/anchor/n-hop-search-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAC3C,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oDAAoD,CAAC;AAC7F,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,8CAA8C,CAAC;AAIlF;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;OAEG;IACH,YAAY,CACV,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;OAEG;IACH,UAAU,CACR,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,YAAY,CAAC,EAAE,OAAO,GACrB,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB;IAC1D,OAAO,CAAC,EAAE,CAAkC;IAC5C,OAAO,CAAC,YAAY,CAAsB;IAC1C,OAAO,CAAC,kBAAkB,CAAmC;IAC7D,OAAO,CAAC,aAAa,CAA8B;gBAEvC,YAAY,EAAE,mBAAmB;IAI7C;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI;IAOxC;;OAEG;IACH,qBAAqB,CAAC,kBAAkB,EAAE,kBAAkB,GAAG,IAAI;IAYnE;;OAEG;IACH,gBAAgB,CAAC,aAAa,EAAE,aAAa,GAAG,IAAI;IAIpD;;OAEG;IACG,YAAY,CAChB,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,EAAE,CAAC;IA4ChC;;OAEG;IACG,UAAU,CACd,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,YAAY,GAAE,OAAc,GAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAkO9B;;OAEG;YACW,iBAAiB;IA2G/B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAY5B;;OAEG;IACH,OAAO,CAAC,qBAAqB;CA8B9B"}

package/dist/domains/anchor/services/anchor/n-hop-search-service.js

@@ -0,0 +1,385 @@
+/**
+ * N-hop 검색 서비스 인터페이스 및 구현
+ * Phase 2.3: anchor-search-service.ts 분리
+ */
+import { isInitializableVectorSearchEngine } from './vector-search-engine-types.js';
+import { logger } from '../../../../shared/utils/logger.js';
+/**
+ * N-hop 검색 서비스 구현
+ */
+export class NHopSearchService {
+    db = null;
+    cacheService;
+    vectorSearchEngine = null;
+    relationGraph = null;
+    constructor(cacheService) {
+        this.cacheService = cacheService;
+    }
+    /**
+     * 데이터베이스 설정
+     */
+    setDatabase(db) {
+        if (!db) {
+            throw new Error('Database instance is required');
+        }
+        this.db = db;
+    }
+    /**
+     * 벡터 검색 엔진 설정
+     */
+    setVectorSearchEngine(vectorSearchEngine) {
+        if (!vectorSearchEngine) {
+            throw new Error('VectorSearchEngine is required');
+        }
+        this.vectorSearchEngine = vectorSearchEngine;
+        if (this.db) {
+            if (isInitializableVectorSearchEngine(this.vectorSearchEngine)) {
+                this.vectorSearchEngine.initialize(this.db);
+            }
+        }
+    }
+    /**
+     * 관계 그래프 설정
+     */
+    setRelationGraph(relationGraph) {
+        this.relationGraph = relationGraph;
+    }
+    /**
+     * 1-hop 검색: 앵커와 직접적으로 유사한 메모리 검색
+     */
+    async searchOneHop(anchorEmbedding, provider, anchorMemoryId, threshold, limit) {
+        if (!this.vectorSearchEngine || !this.db) {
+            throw new Error('VectorSearchEngine or Database is not set.');
+        }
+        try {
+            // VectorSearchEngine 초기화 확인
+            if (isInitializableVectorSearchEngine(this.vectorSearchEngine)) {
+                this.vectorSearchEngine.initialize(this.db);
+            }
+            // 벡터 검색 실행 (임계값은 낮게 설정하고 나중에 필터링)
+            const searchResults = await this.vectorSearchEngine.search(anchorEmbedding, {
+                limit: limit + 1, // 자기 자신 제외를 위해 +1
+                threshold: 0.0, // 임계값은 나중에 필터링에서 적용
+                includeContent: true,
+                includeMetadata: true
+            }, provider);
+            // 결과 필터링: 앵커 메모리 제외, 유사도 임계값 이상만 반환
+            const filteredResults = searchResults
+                .filter(result => {
+                // 앵커 메모리 제외
+                if (result.memory_id === anchorMemoryId) {
+                    return false;
+                }
+                // 유사도 임계값 이상만 반환
+                return result.similarity >= threshold;
+            })
+                .slice(0, limit); // 최종 limit 적용
+            return filteredResults;
+        }
+        catch (error) {
+            logger.error('1-hop search failed', {
+                error: error instanceof Error ? error.message : String(error)
+            });
+            throw new Error(`Failed to perform 1-hop search: ${error instanceof Error ? error.message : 'Unknown error'}`);
+        }
+    }
+    /**
+     * N-hop 검색: 앵커를 기준으로 최대 N-hop까지 확장 검색
+     */
+    async searchNHop(anchorEmbedding, provider, anchorMemoryId, threshold, maxHops, limit, useRelations = true) {
+        if (!this.vectorSearchEngine || !this.db) {
+            throw new Error('VectorSearchEngine or Database is not set.');
+        }
+        // VectorSearchEngine 초기화 확인
+        if (typeof this.vectorSearchEngine.initialize === 'function') {
+            this.vectorSearchEngine.initialize(this.db);
+        }
+        // 이미 발견된 메모리 ID 추적 (중복 방지)
+        const discoveredMemoryIds = new Set([anchorMemoryId]);
+        // 각 hop 레벨의 결과를 저장
+        const allResults = [];
+        // 현재 hop 레벨의 메모리들 (임베딩 포함)
+        // 1-hop: 앵커 임베딩을 사용
+        let currentHopMemories = [
+            { memory_id: anchorMemoryId, embedding: anchorEmbedding }
+        ];
+        // 각 hop 레벨별로 검색 수행
+        for (let hop = 1; hop <= maxHops; hop++) {
+            const nextHopMemories = [];
+            const hopResults = [];
+            // 현재 hop의 각 메모리에 대해 검색 수행
+            for (const currentMemory of currentHopMemories) {
+                try {
+                    // 관계 그래프 또는 memory_link를 활용한 직접 연결된 메모리 조회
+                    // use_relations가 false이면 관계 그래프를 사용하지 않음
+                    const linkedMemories = useRelations
+                        ? await this.getLinkedMemories(currentMemory.memory_id)
+                        : [];
+                    // 벡터 검색 실행
+                    const vectorSearchResults = await this.vectorSearchEngine.search(currentMemory.embedding, {
+                        limit: Math.ceil(limit / maxHops) + 10, // 각 hop당 충분한 결과 가져오기
+                        threshold: 0.0, // 임계값은 나중에 필터링에서 적용
+                        includeContent: true,
+                        includeMetadata: true
+                    }, provider);
+                    // memory_link 결과와 벡터 검색 결과를 병합
+                    const allCandidates = new Map();
+                    // memory_link 결과 추가 (우선순위 높음)
+                    for (const linked of linkedMemories) {
+                        if (!discoveredMemoryIds.has(linked.memory_id)) {
+                            allCandidates.set(linked.memory_id, {
+                                ...linked,
+                                isLinked: true
+                            });
+                        }
+                    }
+                    // 벡터 검색 결과 추가
+                    const relaxedThreshold = threshold * 0.5;
+                    for (const result of vectorSearchResults) {
+                        if (!allCandidates.has(result.memory_id) && !discoveredMemoryIds.has(result.memory_id)) {
+                            if (result.similarity >= relaxedThreshold) {
+                                allCandidates.set(result.memory_id, {
+                                    ...result,
+                                    isLinked: false
+                                });
+                            }
+                        }
+                        else if (allCandidates.has(result.memory_id)) {
+                            // memory_link로 이미 추가된 경우, 유사도 정보 업데이트
+                            const existing = allCandidates.get(result.memory_id);
+                            existing.similarity = Math.max(existing.similarity, result.similarity);
+                        }
+                    }
+                    // 결과 필터링 및 추가
+                    for (const [memoryId, candidate] of allCandidates.entries()) {
+                        if (discoveredMemoryIds.has(memoryId)) {
+                            continue;
+                        }
+                        const effectiveThreshold = candidate.isLinked
+                            ? threshold * 0.8
+                            : threshold;
+                        if (candidate.similarity < effectiveThreshold) {
+                            continue;
+                        }
+                        discoveredMemoryIds.add(memoryId);
+                        hopResults.push({
+                            memory_id: candidate.memory_id,
+                            content: candidate.content,
+                            type: candidate.type,
+                            similarity: candidate.similarity,
+                            hop_distance: hop,
+                            importance: candidate.importance,
+                            created_at: candidate.created_at,
+                            tags: candidate.tags,
+                            hasRelation: candidate.isLinked
+                        });
+                        // 다음 hop을 위한 임베딩 조회
+                        if (hop < maxHops) {
+                            try {
+                                const nextEmbedding = await this.cacheService.getAnchorEmbedding(candidate.memory_id);
+                                if (nextEmbedding && nextEmbedding.embedding) {
+                                    nextHopMemories.push({
+                                        memory_id: candidate.memory_id,
+                                        embedding: nextEmbedding.embedding
+                                    });
+                                }
+                            }
+                            catch (error) {
+                                // 임베딩 조회 실패 시 다음 hop에서 제외
+                                logger.debug('Skipping memory for next hop (no embedding)', {
+                                    memoryId: candidate.memory_id,
+                                    error: error instanceof Error ? error.message : String(error)
+                                });
+                            }
+                        }
+                    }
+                }
+                catch (error) {
+                    logger.error('Hop search failed', {
+                        hop,
+                        memoryId: currentMemory.memory_id,
+                        error: error instanceof Error ? error.message : String(error)
+                    });
+                    continue;
+                }
+            }
+            // 현재 hop의 결과를 전체 결과에 추가
+            allResults.push(...hopResults);
+            // limit에 도달했으면 중단
+            if (allResults.length >= limit) {
+                break;
+            }
+            // 다음 hop을 위한 메모리가 없으면 중단
+            if (nextHopMemories.length === 0) {
+                break;
+            }
+            // 다음 hop을 위한 메모리로 업데이트
+            currentHopMemories = nextHopMemories;
+        }
+        // 랭킹 점수 계산 및 적용 (관계 그래프 가중치 포함)
+        const rankedResults = await Promise.all(allResults.map(async (result) => {
+            // 관계 가중치 계산 (관계 그래프가 있고 use_relations가 true인 경우)
+            let relationWeight = 0;
+            let hasRelation = result.hasRelation ?? false;
+            if (useRelations && this.relationGraph) {
+                try {
+                    const relations = await this.relationGraph.getRelations(result.memory_id, {
+                        direction: 'both',
+                        minConfidence: 0.5
+                    });
+                    if (relations.length > 0) {
+                        hasRelation = true;
+                        // 관계 가중치 계산 (간단한 평균)
+                        const avgConfidence = relations.reduce((sum, r) => sum + r.confidence, 0) / relations.length;
+                        const avgBoost = relations.reduce((sum, r) => sum + this.getRelationTypeBoost(r.relation_type), 0) / relations.length;
+                        relationWeight = Math.min(1.0, avgConfidence * avgBoost);
+                    }
+                }
+                catch (error) {
+                    // 관계 조회 실패는 무시
+                    logger.debug('Relation weight calculation failed', {
+                        memoryId: result.memory_id,
+                        error: error instanceof Error ? error.message : String(error)
+                    });
+                }
+            }
+            const rankingScore = this.calculateRankingScore(result.similarity, result.hop_distance, result.importance, relationWeight, hasRelation);
+            return {
+                ...result,
+                similarity: rankingScore,
+                hasRelation
+            };
+        }));
+        // 랭킹 점수 기준으로 정렬 (관계가 있는 기억 우선)
+        rankedResults.sort((a, b) => {
+            // 관계가 있는 기억에 우선순위 부여
+            if (a.hasRelation && !b.hasRelation) {
+                return -1;
+            }
+            if (!a.hasRelation && b.hasRelation) {
+                return 1;
+            }
+            // 둘 다 관계가 있거나 둘 다 없는 경우, similarity 기준 정렬
+            if (Math.abs(a.similarity - b.similarity) < 0.001) {
+                return a.hop_distance - b.hop_distance;
+            }
+            return b.similarity - a.similarity;
+        });
+        // 최종 limit 적용
+        return rankedResults.slice(0, limit);
+    }
+    /**
+     * 연결된 메모리 조회 (관계 그래프 또는 memory_link 사용)
+     */
+    async getLinkedMemories(memoryId) {
+        if (!this.db) {
+            return [];
+        }
+        try {
+            // 관계 그래프가 있으면 우선 사용
+            if (this.relationGraph) {
+                const relations = await this.relationGraph.getRelations(memoryId, {
+                    direction: 'outgoing',
+                    minConfidence: 0.5
+                });
+                if (relations.length > 0) {
+                    // 관계를 메모리 정보와 결합
+                    const memoryIds = relations.map(r => r.target_id);
+                    const placeholders = memoryIds.map(() => '?').join(',');
+                    const memoryRecords = this.db.prepare(`
+            SELECT id, content, type, importance, created_at, tags
+            FROM memory_item
+            WHERE id IN (${placeholders})
+          `).all(...memoryIds);
+                    // 관계 정보와 메모리 정보 결합
+                    const memoryMap = new Map(memoryRecords.map(m => [m.id, m]));
+                    return relations.map(relation => {
+                        const memory = memoryMap.get(relation.target_id);
+                        if (!memory) {
+                            return null;
+                        }
+                        // 관계 confidence를 similarity로 사용 (관계가 있으면 높은 유사도)
+                        // 관계 유형별 부스트 적용
+                        const typeBoost = this.getRelationTypeBoost(relation.relation_type);
+                        const similarity = Math.min(1.0, relation.confidence * typeBoost);
+                        return {
+                            memory_id: memory.id,
+                            content: memory.content,
+                            type: memory.type,
+                            similarity,
+                            importance: memory.importance,
+                            created_at: memory.created_at,
+                            tags: memory.tags ? JSON.parse(memory.tags) : undefined
+                        };
+                    }).filter((item) => item !== null);
+                }
+            }
+            // 관계 그래프가 없거나 관계가 없으면 memory_link 사용 (하위 호환성)
+            const linkedRecords = this.db.prepare(`
+        SELECT 
+          ml.target_id as memory_id,
+          mi.content,
+          mi.type,
+          mi.importance,
+          mi.created_at,
+          mi.tags,
+          ml.relation_type
+        FROM memory_link ml
+        JOIN memory_item mi ON mi.id = ml.target_id
+        WHERE ml.source_id = ?
+        ORDER BY ml.created_at DESC
+      `).all(memoryId);
+            return linkedRecords.map(record => ({
+                memory_id: record.memory_id,
+                content: record.content,
+                type: record.type,
+                similarity: 0.9, // memory_link는 기본 유사도 0.9
+                importance: record.importance,
+                created_at: record.created_at,
+                tags: record.tags ? (typeof record.tags === 'string' ? JSON.parse(record.tags) : record.tags) : undefined
+            }));
+        }
+        catch (error) {
+            logger.error('memory_link retrieval failed', {
+                memoryId,
+                error: error instanceof Error ? error.message : String(error)
+            });
+            return [];
+        }
+    }
+    /**
+     * 관계 유형별 부스트 가중치 반환
+     */
+    getRelationTypeBoost(relationType) {
+        const boostMap = {
+            'CAUSES': 1.2,
+            'DEPENDS_ON': 1.1,
+            'FOLLOWS': 1.0,
+            'CONTRASTS_WITH': 0.9,
+            'REFERENCES': 0.8,
+            'BELONGS_TO': 1.0
+        };
+        return boostMap[relationType] || 1.0;
+    }
+    /**
+     * 검색 결과 랭킹 점수 계산
+     */
+    calculateRankingScore(similarity, hopDistance, importance = 0.5, relationWeight = 0, hasRelation = false) {
+        const hopDecayFactor = 1.0 / (1.0 + (hopDistance - 1) * 0.3);
+        const anchorProximityBoost = hopDistance === 1 ? 1.2 : 1.0;
+        const importanceWeight = 0.1;
+        const importanceBoost = 1.0 + (importance - 0.5) * importanceWeight;
+        // 관계 가중치가 있으면 벡터 유사도와 결합
+        let combinedSimilarity = similarity;
+        if (relationWeight > 0) {
+            // 관계 가중치와 벡터 유사도를 가중 평균으로 결합
+            // 관계 가중치: 30%, 벡터 유사도: 70%
+            combinedSimilarity = similarity * 0.7 + relationWeight * 0.3;
+        }
+        // 관계가 있는 기억에 우선순위 부스트 적용
+        const relationPriorityBoost = hasRelation ? 1.15 : 1.0; // 15% 부스트
+        const rankingScore = Math.min(1.0, combinedSimilarity * hopDecayFactor * anchorProximityBoost * importanceBoost * relationPriorityBoost);
+        return rankingScore;
+    }
+}
+//# sourceMappingURL=n-hop-search-service.js.map

package/dist/domains/anchor/services/anchor/n-hop-search-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"n-hop-search-service.js","sourceRoot":"","sources":["../../../../../src/domains/anchor/services/anchor/n-hop-search-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAE,iCAAiC,EAAE,MAAM,iCAAiC,CAAC;AACpF,OAAO,EAAE,MAAM,EAAE,MAAM,oCAAoC,CAAC;AA2D5D;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACpB,EAAE,GAA6B,IAAI,CAAC;IACpC,YAAY,CAAsB;IAClC,kBAAkB,GAA8B,IAAI,CAAC;IACrD,aAAa,GAAyB,IAAI,CAAC;IAEnD,YAAY,YAAiC;QAC3C,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,EAAqB;QAC/B,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IAED;;OAEG;IACH,qBAAqB,CAAC,kBAAsC;QAC1D,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAC7C,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACZ,IAAI,iCAAiC,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBAC/D,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,aAA4B;QAC3C,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,eAAyB,EACzB,QAAgB,EAChB,cAAsB,EACtB,SAAiB,EACjB,KAAa;QAEb,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,CAAC;YACH,4BAA4B;YAC5B,IAAI,iCAAiC,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBAC/D,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC;YAED,kCAAkC;YAClC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,CACxD,eAAe,EACf;gBACE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,kBAAkB;gBACpC,SAAS,EAAE,GAAG,EAAE,oBAAoB;gBACpC,cAAc,EAAE,IAAI;gBACpB,eAAe,EAAE,IAAI;aACtB,EACD,QAAQ,CACT,CAAC;YAEF,oCAAoC;YACpC,MAAM,eAAe,GAAG,aAAa;iBAClC,MAAM,CAAC,MAAM,CAAC,EAAE;gBACf,YAAY;gBACZ,IAAI,MAAM,CAAC,SAAS,KAAK,cAAc,EAAE,CAAC;oBACxC,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,iBAAiB;gBACjB,OAAO,MAAM,CAAC,UAAU,IAAI,SAAS,CAAC;YACxC,CAAC,CAAC;iBACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,cAAc;YAElC,OAAO,eAAe,CAAC;QACzB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,qBAAqB,EAAE;gBAClC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;aAC9D,CAAC,CAAC;YACH,MAAM,IAAI,KAAK,CAAC,mCAAmC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACjH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,eAAyB,EACzB,QAAgB,EAChB,cAAsB,EACtB,SAAiB,EACjB,OAAe,EACf,KAAa,EACb,eAAwB,IAAI;QAE5B,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,4BAA4B;QAC5B,IAAI,OAAQ,IAAI,CAAC,kBAA0B,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;YACrE,IAAI,CAAC,kBAA0B,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;QAED,2BAA2B;QAC3B,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,cAAc,CAAC,CAAC,CAAC;QAE9D,mBAAmB;QACnB,MAAM,UAAU,GAAuB,EAAE,CAAC;QAE1C,2BAA2B;QAC3B,oBAAoB;QACpB,IAAI,kBAAkB,GAAsD;YAC1E,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,eAAe,EAAE;SAC1D,CAAC;QAEF,mBAAmB;QACnB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACxC,MAAM,eAAe,GAAsD,EAAE,CAAC;YAC9E,MAAM,UAAU,GAAuB,EAAE,CAAC;YAE1C,0BAA0B;YAC1B,KAAK,MAAM,aAAa,IAAI,kBAAkB,EAAE,CAAC;gBAC/C,IAAI,CAAC;oBACH,2CAA2C;oBAC3C,yCAAyC;oBACzC,MAAM,cAAc,GAAG,YAAY;wBACjC,CAAC,CAAC,MAAM,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,SAAS,CAAC;wBACvD,CAAC,CAAC,EAAE,CAAC;oBAEP,WAAW;oBACX,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAC9D,aAAa,CAAC,SAAS,EACvB;wBACE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,qBAAqB;wBAC7D,SAAS,EAAE,GAAG,EAAE,oBAAoB;wBACpC,cAAc,EAAE,IAAI;wBACpB,eAAe,EAAE,IAAI;qBACtB,EACD,QAAQ,CACT,CAAC;oBAEF,+BAA+B;oBAC/B,MAAM,aAAa,GAAG,IAAI,GAAG,EASzB,CAAC;oBAEL,8BAA8B;oBAC9B,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;wBACpC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC/C,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE;gCAClC,GAAG,MAAM;gCACT,QAAQ,EAAE,IAAI;6BACf,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;oBAED,cAAc;oBACd,MAAM,gBAAgB,GAAG,SAAS,GAAG,GAAG,CAAC;oBACzC,KAAK,MAAM,MAAM,IAAI,mBAAmB,EAAE,CAAC;wBACzC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;4BACvF,IAAI,MAAM,CAAC,UAAU,IAAI,gBAAgB,EAAE,CAAC;gCAC1C,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE;oCAClC,GAAG,MAAM;oCACT,QAAQ,EAAE,KAAK;iCAChB,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;6BAAM,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC/C,sCAAsC;4BACtC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAE,CAAC;4BACtD,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;wBACzE,CAAC;oBACH,CAAC;oBAED,cAAc;oBACd,KAAK,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;wBAC5D,IAAI,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;4BACtC,SAAS;wBACX,CAAC;wBAED,MAAM,kBAAkB,GAAG,SAAS,CAAC,QAAQ;4BAC3C,CAAC,CAAC,SAAS,GAAG,GAAG;4BACjB,CAAC,CAAC,SAAS,CAAC;wBAEd,IAAI,SAAS,CAAC,UAAU,GAAG,kBAAkB,EAAE,CAAC;4BAC9C,SAAS;wBACX,CAAC;wBAED,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBAClC,UAAU,CAAC,IAAI,CAAC;4BACd,SAAS,EAAE,SAAS,CAAC,SAAS;4BAC9B,OAAO,EAAE,SAAS,CAAC,OAAO;4BAC1B,IAAI,EAAE,SAAS,CAAC,IAAI;4BACpB,UAAU,EAAE,SAAS,CAAC,UAAU;4BAChC,YAAY,EAAE,GAAG;4BACjB,UAAU,EAAE,SAAS,CAAC,UAAU;4BAChC,UAAU,EAAE,SAAS,CAAC,UAAU;4BAChC,IAAI,EAAE,SAAS,CAAC,IAAI;4BACpB,WAAW,EAAE,SAAS,CAAC,QAAQ;yBAChC,CAAC,CAAC;wBAEH,oBAAoB;wBACpB,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;4BAClB,IAAI,CAAC;gCACH,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gCACtF,IAAI,aAAa,IAAI,aAAa,CAAC,SAAS,EAAE,CAAC;oCAC7C,eAAe,CAAC,IAAI,CAAC;wCACnB,SAAS,EAAE,SAAS,CAAC,SAAS;wCAC9B,SAAS,EAAE,aAAa,CAAC,SAAS;qCACnC,CAAC,CAAC;gCACL,CAAC;4BACH,CAAC;4BAAC,OAAO,KAAK,EAAE,CAAC;gCACf,0BAA0B;gCAC1B,MAAM,CAAC,KAAK,CAAC,6CAA6C,EAAE;oCAC1D,QAAQ,EAAE,SAAS,CAAC,SAAS;oCAC7B,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;iCAC9D,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,MAAM,CAAC,KAAK,CAAC,mBAAmB,EAAE;wBAChC,GAAG;wBACH,QAAQ,EAAE,aAAa,CAAC,SAAS;wBACjC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;qBAC9D,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;YACH,CAAC;YAED,wBAAwB;YACxB,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YAE/B,kBAAkB;YAClB,IAAI,UAAU,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;gBAC/B,MAAM;YACR,CAAC;YAED,yBAAyB;YACzB,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjC,MAAM;YACR,CAAC;YAED,uBAAuB;YACvB,kBAAkB,GAAG,eAAe,CAAC;QACvC,CAAC;QAED,gCAAgC;QAChC,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CACrC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;YAC9B,iDAAiD;YACjD,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,KAAK,CAAC;YAE9C,IAAI,YAAY,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvC,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,EAAE;wBACxE,SAAS,EAAE,MAAM;wBACjB,aAAa,EAAE,GAAG;qBACnB,CAAC,CAAC;oBAEH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACzB,WAAW,GAAG,IAAI,CAAC;wBACnB,qBAAqB;wBACrB,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;wBAC7F,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;wBACtH,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,GAAG,QAAQ,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,eAAe;oBACf,MAAM,CAAC,KAAK,CAAC,oCAAoC,EAAE;wBACjD,QAAQ,EAAE,MAAM,CAAC,SAAS;wBAC1B,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;qBAC9D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAC7C,MAAM,CAAC,UAAU,EACjB,MAAM,CAAC,YAAY,EACnB,MAAM,CAAC,UAAU,EACjB,cAAc,EACd,WAAW,CACZ,CAAC;YACF,OAAO;gBACL,GAAG,MAAM;gBACT,UAAU,EAAE,YAAY;gBACxB,WAAW;aACZ,CAAC;QACJ,CAAC,CAAC,CACH,CAAC;QAEF,+BAA+B;QAC/B,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,qBAAqB;YACrB,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;gBACpC,OAAO,CAAC,CAAC,CAAC;YACZ,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBACpC,OAAO,CAAC,CAAC;YACX,CAAC;YAED,0CAA0C;YAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,KAAK,EAAE,CAAC;gBAClD,OAAO,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;YACzC,CAAC;YACD,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,cAAc;QACd,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB,CAAC,QAAgB;QAS9C,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC;YACH,oBAAoB;YACpB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE;oBAChE,SAAS,EAAE,UAAU;oBACrB,aAAa,EAAE,GAAG;iBACnB,CAAC,CAAC;gBAEH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,iBAAiB;oBACjB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAClD,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACxD,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;2BAGrB,YAAY;WAC5B,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAOjB,CAAC;oBAEH,mBAAmB;oBACnB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE7D,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;wBAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;wBACjD,IAAI,CAAC,MAAM,EAAE,CAAC;4BACZ,OAAO,IAAI,CAAC;wBACd,CAAC;wBAED,iDAAiD;wBACjD,gBAAgB;wBAChB,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;wBACpE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;wBAElE,OAAO;4BACL,SAAS,EAAE,MAAM,CAAC,EAAE;4BACpB,OAAO,EAAE,MAAM,CAAC,OAAO;4BACvB,IAAI,EAAE,MAAM,CAAC,IAAI;4BACjB,UAAU;4BACV,UAAU,EAAE,MAAM,CAAC,UAAU;4BAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;4BAC7B,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;yBACxD,CAAC;oBACJ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAoC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;gBACvE,CAAC;YACH,CAAC;YAED,8CAA8C;YAC9C,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;OAarC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAQb,CAAC;YAEH,OAAO,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAClC,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,UAAU,EAAE,GAAG,EAAE,0BAA0B;gBAC3C,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;aAC1G,CAAC,CAAC,CAAC;QACN,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE;gBAC3C,QAAQ;gBACR,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;aAC9D,CAAC,CAAC;YACH,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,YAAoB;QAC/C,MAAM,QAAQ,GAA2B;YACvC,QAAQ,EAAE,GAAG;YACb,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,GAAG;YACd,gBAAgB,EAAE,GAAG;YACrB,YAAY,EAAE,GAAG;YACjB,YAAY,EAAE,GAAG;SAClB,CAAC;QACF,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,UAAkB,EAClB,WAAmB,EACnB,aAAqB,GAAG,EACxB,iBAAyB,CAAC,EAC1B,cAAuB,KAAK;QAE5B,MAAM,cAAc,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7D,MAAM,oBAAoB,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAC3D,MAAM,gBAAgB,GAAG,GAAG,CAAC;QAC7B,MAAM,eAAe,GAAG,GAAG,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,gBAAgB,CAAC;QAEpE,yBAAyB;QACzB,IAAI,kBAAkB,GAAG,UAAU,CAAC;QACpC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YACvB,6BAA6B;YAC7B,2BAA2B;YAC3B,kBAAkB,GAAG,UAAU,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,CAAC;QAC/D,CAAC;QAED,yBAAyB;QACzB,MAAM,qBAAqB,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU;QAElE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,GAAG,EACH,kBAAkB,GAAG,cAAc,GAAG,oBAAoB,GAAG,eAAe,GAAG,qBAAqB,CACrG,CAAC;QAEF,OAAO,YAAY,CAAC;IACtB,CAAC;CACF"}

package/dist/domains/anchor/services/anchor/n-hop-search-strategy.d.ts

@@ -0,0 +1,24 @@
+/**
+ * N-hop 검색 전략 구현
+ * Phase 3.4: searchLocal 메서드 분리 - 전략 패턴 적용
+ */
+import type { INHopSearchStrategy, NHopSearchResult } from './search-strategy-interfaces.js';
+import { NHopSearchService } from './n-hop-search-service.js';
+/**
+ * N-hop 검색 전략 구현
+ * Phase 2.3의 NHopSearchService를 래핑하여 전략 패턴 적용
+ */
+export declare class NHopSearchStrategy implements INHopSearchStrategy {
+    readonly name = "NHopSearchStrategy";
+    private nHopSearchService;
+    constructor(nHopSearchService: NHopSearchService);
+    /**
+     * N-hop 검색 수행
+     */
+    search(anchorEmbedding: number[], provider: string, anchorMemoryId: string, threshold: number, maxHops: number, limit: number, useRelations?: boolean): Promise<NHopSearchResult[]>;
+    /**
+     * 전략 실행 (ISearchStrategy 인터페이스 구현)
+     */
+    execute(...args: any[]): Promise<NHopSearchResult[]>;
+}
+//# sourceMappingURL=n-hop-search-strategy.d.ts.map

package/dist/domains/anchor/services/anchor/n-hop-search-strategy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"n-hop-search-strategy.d.ts","sourceRoot":"","sources":["../../../../../src/domains/anchor/services/anchor/n-hop-search-strategy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AAC7F,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,mBAAmB;IAC5D,QAAQ,CAAC,IAAI,wBAAwB;IACrC,OAAO,CAAC,iBAAiB,CAAoB;gBAEjC,iBAAiB,EAAE,iBAAiB;IAOhD;;OAEG;IACG,MAAM,CACV,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,EACb,YAAY,GAAE,OAAc,GAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAY9B;;OAEG;IACG,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;CAW3D"}

package/dist/domains/anchor/services/anchor/n-hop-search-strategy.js

@@ -0,0 +1,39 @@
+/**
+ * N-hop 검색 전략 구현
+ * Phase 3.4: searchLocal 메서드 분리 - 전략 패턴 적용
+ */
+import { NHopSearchService } from './n-hop-search-service.js';
+/**
+ * N-hop 검색 전략 구현
+ * Phase 2.3의 NHopSearchService를 래핑하여 전략 패턴 적용
+ */
+export class NHopSearchStrategy {
+    name = 'NHopSearchStrategy';
+    nHopSearchService;
+    constructor(nHopSearchService) {
+        if (!nHopSearchService) {
+            throw new Error('NHopSearchService is required');
+        }
+        this.nHopSearchService = nHopSearchService;
+    }
+    /**
+     * N-hop 검색 수행
+     */
+    async search(anchorEmbedding, provider, anchorMemoryId, threshold, maxHops, limit, useRelations = true) {
+        return this.nHopSearchService.searchNHop(anchorEmbedding, provider, anchorMemoryId, threshold, maxHops, limit, useRelations);
+    }
+    /**
+     * 전략 실행 (ISearchStrategy 인터페이스 구현)
+     */
+    async execute(...args) {
+        return this.search(args[0], // anchorEmbedding
+        args[1], // provider
+        args[2], // anchorMemoryId
+        args[3], // threshold
+        args[4], // maxHops
+        args[5], // limit
+        args[6] // useRelations
+        );
+    }
+}
+//# sourceMappingURL=n-hop-search-strategy.js.map

package/dist/domains/anchor/services/anchor/n-hop-search-strategy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"n-hop-search-strategy.js","sourceRoot":"","sources":["../../../../../src/domains/anchor/services/anchor/n-hop-search-strategy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACpB,IAAI,GAAG,oBAAoB,CAAC;IAC7B,iBAAiB,CAAoB;IAE7C,YAAY,iBAAoC;QAC9C,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,eAAyB,EACzB,QAAgB,EAChB,cAAsB,EACtB,SAAiB,EACjB,OAAe,EACf,KAAa,EACb,eAAwB,IAAI;QAE5B,OAAO,IAAI,CAAC,iBAAiB,CAAC,UAAU,CACtC,eAAe,EACf,QAAQ,EACR,cAAc,EACd,SAAS,EACT,OAAO,EACP,KAAK,EACL,YAAY,CACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,GAAG,IAAW;QAC1B,OAAO,IAAI,CAAC,MAAM,CAChB,IAAI,CAAC,CAAC,CAAC,EAAE,kBAAkB;QAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW;QACpB,IAAI,CAAC,CAAC,CAAC,EAAE,iBAAiB;QAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,YAAY;QACrB,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU;QACnB,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ;QACjB,IAAI,CAAC,CAAC,CAAC,CAAE,eAAe;SACzB,CAAC;IACJ,CAAC;CACF"}

package/dist/domains/anchor/services/anchor/query-filter-service.d.ts

@@ -0,0 +1,52 @@
+/**
+ * 쿼리 필터 서비스 인터페이스 및 구현
+ * Phase 2.4: anchor-search-service.ts 분리
+ */
+import type { IAnchorCacheService } from './anchor-interfaces.js';
+/**
+ * 필터링 대상 결과 타입
+ */
+export interface FilterableResult {
+    memory_id: string;
+    content: string;
+    type: string;
+    similarity: number;
+    hop_distance: number;
+    importance: number;
+    created_at: string;
+    tags?: string[];
+}
+/**
+ * 쿼리 필터 서비스 인터페이스
+ */
+export interface IQueryFilterService {
+    /**
+     * 쿼리 기반 필터링
+     */
+    filterByQuery(query: string, results: FilterableResult[], provider: string): Promise<FilterableResult[]>;
+}
+/**
+ * 쿼리 필터 서비스 구현
+ */
+export declare class QueryFilterService implements IQueryFilterService {
+    private cacheService;
+    private queryEmbeddingService;
+    constructor(cacheService: IAnchorCacheService);
+    /**
+     * 쿼리 기반 필터링
+     */
+    filterByQuery(query: string, results: FilterableResult[], provider: string): Promise<FilterableResult[]>;
+    /**
+     * 코사인 유사도 계산
+     */
+    private cosineSimilarity;
+    /**
+     * 텍스트 기반 유사도 계산
+     */
+    private calculateTextSimilarity;
+    /**
+     * 기본 랭킹 점수 계산
+     */
+    private calculateBaseRankingScore;
+}
+//# sourceMappingURL=query-filter-service.d.ts.map

package/dist/domains/anchor/services/anchor/query-filter-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-filter-service.d.ts","sourceRoot":"","sources":["../../../../../src/domains/anchor/services/anchor/query-filter-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAIlE;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC;;OAEG;IACH,aAAa,CACX,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,gBAAgB,EAAE,EAC3B,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,kBAAmB,YAAW,mBAAmB;IAC5D,OAAO,CAAC,YAAY,CAAsB;IAC1C,OAAO,CAAC,qBAAqB,CAA0B;gBAE3C,YAAY,EAAE,mBAAmB;IAK7C;;OAEG;IACG,aAAa,CACjB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,gBAAgB,EAAE,EAC3B,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,gBAAgB,EAAE,CAAC;IA2F9B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAqBxB;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAQ/B;;OAEG;IACH,OAAO,CAAC,yBAAyB;CAelC"}