stellavault 0.4.4 → 0.5.0

package/packages/core/dist/intelligence/ingest-pipeline.js

@@ -1,245 +0,0 @@
-// 통합 인제스트 파이프라인
-// 어떤 입력이든 → Stellavault 포맷으로 자동 변환 + 분류 + 연결
-//
-// 지원 입력: URL, PDF 텍스트, 마크다운, 플레인텍스트, YouTube
-// 출력: frontmatter 포맷 .md → raw/ → compile → lint
-import { writeFileSync, mkdirSync, existsSync, readFileSync } from 'node:fs';
-import { join, resolve, basename } from 'node:path';
-import { scanFrontmatter, assignIndexCodes, archiveFile } from './zettelkasten.js';
-import { compileWiki } from './wiki-compiler.js';
-import { autoLink } from './auto-linker.js';
-import { DEFAULT_FOLDERS } from '../config.js';
-/** HTML 엔티티 디코딩 */
-function decodeHtmlEntities(text) {
-    return text
-        .replace(/'/g, "'").replace(/'/g, "'")
-        .replace(/"/g, '"').replace(/&/g, '&')
-        .replace(/&lt;/g, '<').replace(/&gt;/g, '>')
-        .replace(/&nbsp;/g, ' ');
-}
-/** YAML 값에서 위험한 문자를 이스케이프 */
-function sanitizeYaml(val) {
-    return decodeHtmlEntities(val).replace(/["\\]/g, '\\$&').replace(/\n/g, ' ').slice(0, 200);
-}
-/**
- * 어떤 입력이든 Stellavault 표준 포맷으로 변환하여 저장.
- */
-export function ingest(vaultPath, input, folders = DEFAULT_FOLDERS) {
-    const stage = input.stage ?? 'fleeting';
-    const title = decodeHtmlEntities(input.title ?? extractTitleFromContent(input.content, input.type));
-    const tags = input.tags ?? extractAutoTags(input.content, input.type);
-    const source = input.source ?? (input.type === 'url' || input.type === 'youtube' ? input.content.split('\n')[0] : 'manual');
-    // 본문 정리
-    const body = cleanContent(input.content, input.type);
-    const wordCount = body.split(/\s+/).length;
-    // 자동 분류: 길이/구조에 따라 stage 결정
-    const autoStage = classifyStage(body, stage, wordCount);
-    // 폴더 결정 (config-driven)
-    const folderMap = {
-        fleeting: folders.fleeting,
-        literature: folders.literature,
-        permanent: folders.permanent,
-    };
-    const folder = folderMap[autoStage];
-    const dir = resolve(vaultPath, folder);
-    if (!existsSync(dir))
-        mkdirSync(dir, { recursive: true });
-    // 파일명 생성
-    const now = new Date();
-    const timestamp = now.toISOString().replace(/[:.]/g, '-').slice(0, 19);
-    const slug = title.slice(0, 50).replace(/[^a-zA-Z0-9가-힣\s]/g, '').replace(/\s+/g, '-').toLowerCase();
-    const filename = `${timestamp}-${slug}.md`;
-    const filePath = join(folder, filename);
-    const fullPath = resolve(vaultPath, filePath);
-    // path traversal 방지
-    if (!fullPath.startsWith(resolve(vaultPath))) {
-        throw new Error('Invalid path');
-    }
-    // 인덱스 코드 생성 (lazy — 전체 스캔 건너뛸 수 있음)
-    let indexCode;
-    try {
-        // 성능: raw/ 폴더만 스캔 (전체 vault 스캔 대신)
-        const rawEntries = scanFrontmatter(resolve(vaultPath, folder));
-        const assignments = assignIndexCodes([...rawEntries, {
-                filePath, title, tags, connections: [], wordCount,
-            }]);
-        indexCode = assignments.get(filePath);
-    }
-    catch (err) {
-        console.warn('[ingest] Index code skipped:', err instanceof Error ? err.message : err);
-    }
-    // Stellavault 표준 포맷으로 저장
-    let md = buildStandardNote({
-        title,
-        body,
-        tags,
-        stage: autoStage,
-        source,
-        indexCode,
-        created: now.toISOString(),
-        inputType: input.type,
-    });
-    // wikilink 자동 삽입: 기존 노트 제목과 매칭
-    try {
-        md = autoLink(md, vaultPath, title, folders);
-    }
-    catch (err) {
-        console.warn('[ingest] Auto-link skipped:', err instanceof Error ? err.message : err);
-    }
-    writeFileSync(fullPath, md, 'utf-8');
-    // 자동 compile: fleeting → wiki (rule-based, <100ms)
-    try {
-        const rawDir = resolve(vaultPath, folders.fleeting);
-        const wikiDir = resolve(vaultPath, folders.wiki);
-        if (existsSync(rawDir)) {
-            compileWiki(rawDir, wikiDir);
-        }
-    }
-    catch { /* compile 실패해도 ingest 성공 */ }
-    return {
-        savedTo: filePath,
-        stage: autoStage,
-        title,
-        indexCode,
-        tags,
-        wordCount,
-    };
-}
-/**
- * 여러 입력을 배치 처리.
- */
-export function ingestBatch(vaultPath, inputs) {
-    return inputs.map(input => ingest(vaultPath, input));
-}
-/**
- * 노트 승격: fleeting → literature → permanent.
- * 내용이 충분히 정제되면 다음 단계로 이동.
- */
-export function promoteNote(vaultPath, filePath, targetStage, folders = DEFAULT_FOLDERS) {
-    const fullPath = resolve(vaultPath, filePath);
-    if (!existsSync(fullPath))
-        throw new Error(`File not found: ${filePath}`);
-    const content = readFileSync(fullPath, 'utf-8');
-    // frontmatter의 type 변경
-    const updated = content.replace(/^type:\s*.+$/m, `type: ${targetStage}`);
-    // 대상 폴더로 이동 (config-driven)
-    const folderMap = {
-        fleeting: folders.fleeting,
-        literature: folders.literature,
-        permanent: folders.permanent,
-    };
-    const newDir = resolve(vaultPath, folderMap[targetStage]);
-    if (!existsSync(newDir))
-        mkdirSync(newDir, { recursive: true });
-    const newPath = join(folderMap[targetStage], basename(filePath));
-    const newFullPath = resolve(vaultPath, newPath);
-    if (!newFullPath.startsWith(resolve(vaultPath))) {
-        throw new Error('Invalid path');
-    }
-    writeFileSync(newFullPath, updated, 'utf-8');
-    // 원본에 archive 플래그
-    archiveFile(fullPath);
-    return newPath;
-}
-// ─── 내부 헬퍼 ───
-function extractTitleFromContent(content, type) {
-    if (type === 'url' || type === 'youtube') {
-        // URL에서 도메인 + 경로 추출
-        try {
-            const url = new URL(content.split('\n')[0]);
-            return url.hostname + url.pathname.slice(0, 40);
-        }
-        catch {
-            return 'Untitled Clip';
-        }
-    }
-    // 첫 heading 또는 첫 줄
-    const heading = content.match(/^#\s+(.+)$/m);
-    if (heading)
-        return heading[1];
-    const firstLine = content.split('\n')[0].trim();
-    return firstLine.slice(0, 80) || 'Untitled';
-}
-function extractAutoTags(content, type) {
-    const tags = new Set();
-    // 입력 타입 태그
-    if (type === 'url')
-        tags.add('web-clip');
-    if (type === 'youtube')
-        tags.add('youtube');
-    if (type === 'pdf-text' || type === 'pdf')
-        tags.add('pdf');
-    if (type === 'docx')
-        tags.add('document');
-    if (type === 'pptx')
-        tags.add('presentation');
-    if (type === 'xlsx' || type === 'xls')
-        tags.add('spreadsheet');
-    // 인라인 #태그 추출
-    const inline = content.match(/#([a-zA-Z가-힣][a-zA-Z0-9가-힣_-]{2,})/g) ?? [];
-    inline.forEach(t => tags.add(t.slice(1)));
-    // 스마트 자동 태깅: 문서 내용 분석 → 카테고리 분류
-    const lc = content.toLowerCase();
-    if (/회의|meeting|minutes|참석자|agenda/.test(lc))
-        tags.add('meeting-notes');
-    if (/기획|prd|요구사항|spec|feature|유저\s*스토리/.test(lc))
-        tags.add('planning');
-    if (/api|endpoint|서버|backend|database|쿼리/.test(lc))
-        tags.add('technical');
-    if (/디자인|design|ui|ux|figma|wireframe|mockup/.test(lc))
-        tags.add('design');
-    if (/논문|paper|abstract|methodology|conclusion|참고문헌/.test(lc))
-        tags.add('research');
-    if (/tutorial|강의|강좌|배우|learn|course/.test(lc))
-        tags.add('learning');
-    if (/경쟁|competitor|시장|market|swot|분석/.test(lc))
-        tags.add('analysis');
-    if (/일기|diary|journal|오늘|today|daily/.test(lc))
-        tags.add('journal');
-    return [...tags].slice(0, 15);
-}
-function cleanContent(content, type) {
-    if (type === 'url' || type === 'youtube') {
-        // URL은 첫 줄이 URL, 나머지가 내용
-        const lines = content.split('\n');
-        return lines.slice(1).join('\n').trim() || lines[0];
-    }
-    return content.trim();
-}
-function classifyStage(body, requestedStage, wordCount) {
-    // 요청된 단계가 permanent면 그대로
-    if (requestedStage === 'permanent')
-        return 'permanent';
-    // 자동 분류 기준:
-    // - 200단어 미만 + 구조 없음 → fleeting
-    // - 200-1000단어 + 출처 있음 → literature
-    // - 1000단어+ + 구조 있음 → permanent 후보 (but 수동 승격 권장)
-    if (wordCount < 200 && !body.includes('## '))
-        return 'fleeting';
-    if (wordCount >= 200 && (body.includes('## ') || body.includes('> ')))
-        return 'literature';
-    return requestedStage;
-}
-function buildStandardNote(params) {
-    const lines = [
-        '---',
-        `title: "${sanitizeYaml(params.title)}"`,
-        `type: ${params.stage}`,
-        `source: "${sanitizeYaml(params.source)}"`,
-        `input_type: ${params.inputType}`,
-        params.indexCode ? `zettel_id: "${params.indexCode}"` : null,
-        `tags: [${params.tags.map(t => `"${sanitizeYaml(t)}"`).join(', ')}]`,
-        `created: ${params.created}`,
-        `summary: "${sanitizeYaml(params.body.slice(0, 100))}"`,
-        '---',
-        '',
-        `# ${params.title}`,
-        '',
-        params.body,
-        '',
-        '---',
-        `*Ingested via \`stellavault ingest\` (${params.inputType}) at ${params.created}*`,
-    ];
-    return lines.filter(l => l !== null).join('\n');
-}
-//# sourceMappingURL=ingest-pipeline.js.map

package/packages/core/dist/intelligence/knowledge-lint.d.ts

@@ -1,27 +0,0 @@
-import type { VectorStore } from '../store/types.js';
-export interface LintResult {
-    score: number;
-    issues: LintIssue[];
-    suggestions: string[];
-    stats: {
-        totalDocs: number;
-        gaps: number;
-        duplicates: number;
-        contradictions: number;
-        isolatedNodes: number;
-        orphanTags: number;
-    };
-}
-export interface LintIssue {
-    type: 'gap' | 'duplicate' | 'contradiction' | 'isolated' | 'stale' | 'empty';
-    severity: 'critical' | 'warning' | 'info';
-    message: string;
-    filePath?: string;
-    suggestion?: string;
-}
-/**
- * vault 전체를 스캔하여 지식 건강도를 평가.
- * 기존 gap-detector, duplicate-detector, contradiction-detector를 통합.
- */
-export declare function lintKnowledge(store: VectorStore): Promise<LintResult>;
-//# sourceMappingURL=knowledge-lint.d.ts.map

package/packages/core/dist/intelligence/knowledge-lint.js

@@ -1,132 +0,0 @@
-// Feature: stellavault lint — 자동 지식 건강 검사
-// 불일치, 누락, 연결 제안, 고립 노드 등을 종합 리포트
-import { detectKnowledgeGaps } from './gap-detector.js';
-import { detectDuplicates } from './duplicate-detector.js';
-import { detectContradictions } from './contradiction-detector.js';
-/**
- * vault 전체를 스캔하여 지식 건강도를 평가.
- * 기존 gap-detector, duplicate-detector, contradiction-detector를 통합.
- */
-export async function lintKnowledge(store) {
-    const issues = [];
-    const suggestions = [];
-    const docs = await store.getAllDocuments();
-    const totalDocs = docs.length;
-    // 1. 갭 탐지
-    let gapCount = 0;
-    let isolatedCount = 0;
-    try {
-        const gapReport = await detectKnowledgeGaps(store);
-        gapCount = gapReport.totalGaps;
-        isolatedCount = gapReport.isolatedNodes.length;
-        for (const gap of gapReport.gaps.filter(g => g.severity !== 'low')) {
-            issues.push({
-                type: 'gap',
-                severity: gap.severity === 'high' ? 'critical' : 'warning',
-                message: `Knowledge gap: ${gap.clusterA} ↔ ${gap.clusterB} (${gap.bridgeCount} connections)`,
-                suggestion: gap.suggestedTopic,
-            });
-        }
-        for (const node of gapReport.isolatedNodes.slice(0, 10)) {
-            issues.push({
-                type: 'isolated',
-                severity: 'warning',
-                message: `Isolated note: "${node.title}" (${node.connections} connections)`,
-                filePath: node.id,
-                suggestion: 'Add links to related topics or tags to integrate this note.',
-            });
-        }
-    }
-    catch (err) {
-        console.error('[lint] Gap detection failed:', err instanceof Error ? err.message : err);
-    }
-    // 2. 중복 탐지
-    let dupCount = 0;
-    try {
-        const dups = await detectDuplicates(store, 0.88, 10);
-        dupCount = dups.length;
-        for (const dup of dups) {
-            issues.push({
-                type: 'duplicate',
-                severity: 'warning',
-                message: `Possible duplicate: "${dup.docA.title}" ≈ "${dup.docB.title}" (${Math.round(dup.similarity * 100)}%)`,
-                suggestion: 'Consider merging these notes.',
-            });
-        }
-    }
-    catch (err) {
-        console.error('[lint] Detection failed:', err instanceof Error ? err.message : err);
-    }
-    // 3. 모순 탐지
-    let contradictionCount = 0;
-    try {
-        const contradictions = await detectContradictions(store, 5);
-        contradictionCount = contradictions.length;
-        for (const c of contradictions) {
-            issues.push({
-                type: 'contradiction',
-                severity: 'warning',
-                message: `Potential contradiction: "${c.docA.title}" vs "${c.docB.title}"`,
-                suggestion: 'Review these documents for conflicting information.',
-            });
-        }
-    }
-    catch (err) {
-        console.error('[lint] Detection failed:', err instanceof Error ? err.message : err);
-    }
-    // 4. 빈 문서 / 매우 짧은 문서
-    for (const doc of docs) {
-        if (doc.content.trim().length < 50) {
-            issues.push({
-                type: 'empty',
-                severity: 'info',
-                message: `Very short note: "${doc.title}" (${doc.content.trim().length} chars)`,
-                filePath: doc.filePath,
-                suggestion: 'Consider expanding or removing this note.',
-            });
-        }
-    }
-    // 5. 오래된 문서 (180일 이상 미수정)
-    const now = Date.now();
-    const staleDocs = docs.filter(d => {
-        if (!d.lastModified)
-            return false;
-        const age = (now - new Date(d.lastModified).getTime()) / 86400000;
-        return age > 180;
-    });
-    if (staleDocs.length > totalDocs * 0.3) {
-        suggestions.push(`${staleDocs.length} documents haven't been modified in 6+ months. Run \`stellavault decay\` to review.`);
-    }
-    // 6. 건강도 점수 계산
-    const criticalCount = issues.filter(i => i.severity === 'critical').length;
-    const warningCount = issues.filter(i => i.severity === 'warning').length;
-    const penalty = criticalCount * 10 + warningCount * 3;
-    const score = Math.max(0, Math.min(100, 100 - penalty));
-    // 7. 종합 제안
-    if (gapCount > 5) {
-        suggestions.push(`${gapCount} knowledge gaps found. Start filling the most critical ones.`);
-    }
-    if (dupCount > 3) {
-        suggestions.push(`${dupCount} duplicate documents detected. Run \`stellavault duplicates\` to merge.`);
-    }
-    if (isolatedCount > 10) {
-        suggestions.push(`${isolatedCount} isolated notes found. Add tags or links to connect them.`);
-    }
-    if (totalDocs > 0 && issues.length === 0) {
-        suggestions.push('Your knowledge base is healthy! Keep it up.');
-    }
-    return {
-        score,
-        issues,
-        suggestions,
-        stats: {
-            totalDocs,
-            gaps: gapCount,
-            duplicates: dupCount,
-            contradictions: contradictionCount,
-            isolatedNodes: isolatedCount,
-            orphanTags: 0,
-        },
-    };
-}
-//# sourceMappingURL=knowledge-lint.js.map

package/packages/core/dist/intelligence/learning-path.d.ts

@@ -1,31 +0,0 @@
-import type { DecayReport } from './types.js';
-export interface LearningItem {
-    documentId: string;
-    title: string;
-    reason: string;
-    priority: 'critical' | 'important' | 'suggested';
-    score: number;
-    category: 'review' | 'explore' | 'bridge';
-}
-export interface LearningPath {
-    items: LearningItem[];
-    summary: {
-        reviewCount: number;
-        exploreCount: number;
-        bridgeCount: number;
-        estimatedMinutes: number;
-    };
-    generatedAt: string;
-}
-export interface LearningPathInput {
-    decayReport: DecayReport;
-    gaps?: Array<{
-        clusterA: string;
-        clusterB: string;
-        severity: string;
-        suggestedTopic: string;
-    }>;
-    recentSearches?: string[];
-}
-export declare function generateLearningPath(input: LearningPathInput, limit?: number): LearningPath;
-//# sourceMappingURL=learning-path.d.ts.map

package/packages/core/dist/intelligence/learning-path.js

@@ -1,53 +0,0 @@
-// AI Learning Path Generator (F-A11)
-// Analyzes decay + gaps + relationships to recommend what to review/learn next
-export function generateLearningPath(input, limit = 15) {
-    const items = [];
-    // 1. Review: decaying notes (highest priority)
-    if (input.decayReport.topDecaying) {
-        for (const d of input.decayReport.topDecaying) {
-            const r = d.retrievability ?? 0;
-            const urgency = (1 - r) * 100;
-            items.push({
-                documentId: d.documentId,
-                title: d.title,
-                reason: r < 0.3
-                    ? `Critical: ${Math.round(r * 100)}% retrievability, ${d.daysSinceAccess}d since last access`
-                    : `Fading: ${Math.round(r * 100)}% retrievability, review to strengthen memory`,
-                priority: r < 0.3 ? 'critical' : r < 0.5 ? 'important' : 'suggested',
-                score: Math.round(urgency),
-                category: 'review',
-            });
-        }
-    }
-    // 2. Bridge: knowledge gaps
-    if (input.gaps) {
-        for (const gap of input.gaps) {
-            const severityScore = gap.severity === 'high' ? 80 : gap.severity === 'medium' ? 60 : 40;
-            items.push({
-                documentId: '',
-                title: gap.suggestedTopic || `${gap.clusterA} × ${gap.clusterB}`,
-                reason: `Gap between "${gap.clusterA}" and "${gap.clusterB}" — creating a bridge note strengthens your knowledge network`,
-                priority: gap.severity === 'high' ? 'important' : 'suggested',
-                score: severityScore,
-                category: 'bridge',
-            });
-        }
-    }
-    // Sort by score descending
-    items.sort((a, b) => b.score - a.score);
-    const selected = items.slice(0, limit);
-    const reviewCount = selected.filter(i => i.category === 'review').length;
-    const exploreCount = selected.filter(i => i.category === 'explore').length;
-    const bridgeCount = selected.filter(i => i.category === 'bridge').length;
-    return {
-        items: selected,
-        summary: {
-            reviewCount,
-            exploreCount,
-            bridgeCount,
-            estimatedMinutes: reviewCount * 3 + exploreCount * 5 + bridgeCount * 8,
-        },
-        generatedAt: new Date().toISOString(),
-    };
-}
-//# sourceMappingURL=learning-path.js.map

package/packages/core/dist/intelligence/notifications.d.ts

@@ -1,31 +0,0 @@
-import type { DecayReport } from './types.js';
-export interface NotificationConfig {
-    decay: {
-        enabled: boolean;
-        criticalThreshold: number;
-        warningThreshold: number;
-    };
-    gaps: {
-        enabled: boolean;
-        minSeverity: 'low' | 'medium' | 'high';
-    };
-    digest: {
-        enabled: boolean;
-        frequency: 'daily' | 'weekly' | 'off';
-    };
-}
-export interface Notification {
-    id: string;
-    type: 'decay_critical' | 'decay_warning' | 'gap_detected' | 'digest';
-    title: string;
-    message: string;
-    timestamp: string;
-    priority: 'high' | 'medium' | 'low';
-    data?: Record<string, unknown>;
-}
-export declare function checkNotifications(decayReport: DecayReport, gaps: Array<{
-    severity: string;
-    clusterA: string;
-    clusterB: string;
-}>, config?: Partial<NotificationConfig>): Notification[];
-//# sourceMappingURL=notifications.d.ts.map

package/packages/core/dist/intelligence/notifications.js

@@ -1,65 +0,0 @@
-// Notification Center (F-A05)
-// Configurable alerts for decay thresholds, gap detection, weekly digest
-const DEFAULT_CONFIG = {
-    decay: { enabled: true, criticalThreshold: 0.3, warningThreshold: 0.5 },
-    gaps: { enabled: true, minSeverity: 'medium' },
-    digest: { enabled: true, frequency: 'weekly' },
-};
-export function checkNotifications(decayReport, gaps, config = {}) {
-    const cfg = {
-        decay: { ...DEFAULT_CONFIG.decay, ...config.decay },
-        gaps: { ...DEFAULT_CONFIG.gaps, ...config.gaps },
-        digest: { ...DEFAULT_CONFIG.digest, ...config.digest },
-    };
-    const notifications = [];
-    const now = new Date().toISOString();
-    // Decay alerts
-    if (cfg.decay.enabled && decayReport.topDecaying) {
-        const criticals = decayReport.topDecaying.filter(d => d.retrievability < cfg.decay.criticalThreshold);
-        const warnings = decayReport.topDecaying.filter(d => d.retrievability >= cfg.decay.criticalThreshold && d.retrievability < cfg.decay.warningThreshold);
-        if (criticals.length > 0) {
-            notifications.push({
-                id: `decay-critical-${Date.now()}`,
-                type: 'decay_critical',
-                title: `${criticals.length} notes critically fading`,
-                message: criticals.slice(0, 3).map(d => `"${d.title}" (${Math.round(d.retrievability * 100)}%)`).join(', '),
-                timestamp: now,
-                priority: 'high',
-                data: { count: criticals.length, notes: criticals.slice(0, 5).map(d => d.title) },
-            });
-        }
-        if (warnings.length > 0) {
-            notifications.push({
-                id: `decay-warning-${Date.now()}`,
-                type: 'decay_warning',
-                title: `${warnings.length} notes starting to fade`,
-                message: `Average retrievability: ${Math.round(decayReport.averageR * 100)}%`,
-                timestamp: now,
-                priority: 'medium',
-                data: { count: warnings.length },
-            });
-        }
-    }
-    // Gap alerts
-    if (cfg.gaps.enabled) {
-        const severityOrder = { high: 3, medium: 2, low: 1 };
-        const minLevel = severityOrder[cfg.gaps.minSeverity] ?? 2;
-        const significantGaps = gaps.filter(g => (severityOrder[g.severity] ?? 0) >= minLevel);
-        if (significantGaps.length > 0) {
-            notifications.push({
-                id: `gap-${Date.now()}`,
-                type: 'gap_detected',
-                title: `${significantGaps.length} knowledge gaps detected`,
-                message: significantGaps.slice(0, 2).map(g => `${g.clusterA} ↔ ${g.clusterB}`).join(', '),
-                timestamp: now,
-                priority: significantGaps.some(g => g.severity === 'high') ? 'high' : 'medium',
-                data: { count: significantGaps.length },
-            });
-        }
-    }
-    return notifications.sort((a, b) => {
-        const p = { high: 3, medium: 2, low: 1 };
-        return (p[b.priority] ?? 0) - (p[a.priority] ?? 0);
-    });
-}
-//# sourceMappingURL=notifications.js.map

package/packages/core/dist/intelligence/predictive-gaps.d.ts

@@ -1,14 +0,0 @@
-import type { VectorStore } from '../store/types.js';
-export interface PredictedGap {
-    topic: string;
-    reason: string;
-    confidence: number;
-    relatedTopics: string[];
-    category: 'adjacent' | 'bridging' | 'deepening';
-}
-/**
- * Analyze graph topology to predict knowledge worth acquiring.
- * Uses degree centrality, cluster density, and tag co-occurrence.
- */
-export declare function predictKnowledgeGaps(store: VectorStore, limit?: number): Promise<PredictedGap[]>;
-//# sourceMappingURL=predictive-gaps.d.ts.map

package/packages/core/dist/intelligence/predictive-gaps.js

@@ -1,74 +0,0 @@
-// Predictive Gap Analysis (F-A14)
-// Based on graph topology, predict knowledge areas worth exploring
-/**
- * Analyze graph topology to predict knowledge worth acquiring.
- * Uses degree centrality, cluster density, and tag co-occurrence.
- */
-export async function predictKnowledgeGaps(store, limit = 10) {
-    const docs = await store.getAllDocuments();
-    const topics = await store.getTopics();
-    if (docs.length < 10)
-        return [];
-    const predictions = [];
-    // 1. Find isolated tags (topics that appear rarely and could be expanded)
-    const topicCounts = new Map(topics.map(t => [t.topic, t.count]));
-    const avgCount = topics.reduce((s, t) => s + t.count, 0) / (topics.length || 1);
-    // Tags that appear 1-2 times — potential deepening opportunities
-    const sparseTopics = topics.filter(t => t.count <= 2 && t.count > 0);
-    for (const t of sparseTopics.slice(0, 5)) {
-        predictions.push({
-            topic: t.topic,
-            reason: `Only ${t.count} note(s) on "${t.topic}" — deepening this area would strengthen your knowledge network`,
-            confidence: 0.6,
-            relatedTopics: findCoOccurring(t.topic, docs),
-            category: 'deepening',
-        });
-    }
-    // 2. Find tag pairs that never co-occur but are both frequent
-    const frequentTopics = topics.filter(t => t.count >= avgCount).slice(0, 20);
-    const coOccurrence = new Map();
-    for (const doc of docs) {
-        for (const tagA of doc.tags) {
-            if (!coOccurrence.has(tagA))
-                coOccurrence.set(tagA, new Set());
-            for (const tagB of doc.tags) {
-                if (tagA !== tagB)
-                    coOccurrence.get(tagA).add(tagB);
-            }
-        }
-    }
-    for (let i = 0; i < frequentTopics.length; i++) {
-        for (let j = i + 1; j < frequentTopics.length; j++) {
-            const a = frequentTopics[i].topic;
-            const b = frequentTopics[j].topic;
-            const aCoOccurs = coOccurrence.get(a) ?? new Set();
-            if (!aCoOccurs.has(b)) {
-                predictions.push({
-                    topic: `${a} × ${b}`,
-                    reason: `"${a}" (${frequentTopics[i].count} notes) and "${b}" (${frequentTopics[j].count} notes) are both well-known but never connected — bridging them could reveal insights`,
-                    confidence: 0.7,
-                    relatedTopics: [a, b],
-                    category: 'bridging',
-                });
-            }
-        }
-    }
-    // 3. Adjacent topics — topics that co-occur with many of your topics but you don't have
-    // (This would ideally use external knowledge, but we approximate with tag patterns)
-    return predictions
-        .sort((a, b) => b.confidence - a.confidence)
-        .slice(0, limit);
-}
-function findCoOccurring(topic, docs) {
-    const coTopics = new Map();
-    for (const doc of docs) {
-        if (doc.tags.includes(topic)) {
-            for (const t of doc.tags) {
-                if (t !== topic)
-                    coTopics.set(t, (coTopics.get(t) ?? 0) + 1);
-            }
-        }
-    }
-    return [...coTopics.entries()].sort((a, b) => b[1] - a[1]).slice(0, 5).map(([t]) => t);
-}
-//# sourceMappingURL=predictive-gaps.js.map