hippo-memory 1.44.0 → 1.46.0

package/dist/src/autolearn.js

@@ -1,174 +0,0 @@
-/**
- * Auto-learn from errors and git history.
- * Agents learn from failures without explicit hippo remember calls.
- */
-import { execSync, execFileSync, spawn } from 'child_process';
-import { createMemory, Layer } from './memory.js';
-import { loadAllEntries } from './store.js';
-import { textOverlap } from './search.js';
-import { isContentWorthStoring } from './audit.js';
-/**
- * Create a MemoryEntry capturing a command failure.
- * Content format: "Command '<cmd>' failed: <truncated stderr>"
- */
-export function captureError(exitCode, stderr, command) {
-    // Truncate to first 500 chars to avoid storing megabytes of build logs
-    const wasTruncated = stderr.length > 500;
-    const truncated = stderr.slice(0, 500).trim();
-    const suffix = wasTruncated ? ' [truncated]' : '';
-    // Strip leading env var assignments (KEY=val or key=val) before the actual command name
-    const safeCmd = command.replace(/^([A-Za-z_][A-Za-z0-9_]*=\S+\s+)+/, '').trim() || '(redacted)';
-    const content = `Command '${safeCmd}' failed (exit ${exitCode}): ${truncated}${suffix}`;
-    // Derive a sanitized tag from the command name (first word, strip path)
-    const cmdBase = safeCmd.split(/\s+/)[0].replace(/[^a-zA-Z0-9-]/g, '');
-    const tags = ['error', 'autolearn'];
-    if (cmdBase)
-        tags.push(cmdBase.toLowerCase().slice(0, 30));
-    return createMemory(content, {
-        layer: Layer.Episodic,
-        tags,
-        source: 'autolearn',
-        confidence: 'observed',
-    });
-}
-/**
- * Parse git log output for actionable lessons.
- * Looks for fix:, revert:, bug:, error:, hotfix: commit messages.
- */
-export function extractLessons(gitLog, customPatterns) {
-    const lessons = [];
-    const lines = gitLog.split('\n');
-    // Patterns that indicate a lesson to learn from
-    // Covers: fix, revert, bug, error, hotfix, refactor, perf, chore, breaking, deprecate
-    const prefixes = customPatterns?.join('|') ?? 'fix|revert|bug|error|hotfix|bugfix|refactor|perf|chore|breaking|deprecate';
-    const patterns = [
-        new RegExp(`^[a-f0-9]+\\s+(${prefixes})(\\(.+?\\))?:?\\s+(.+)`, 'i'),
-        new RegExp(`^(${prefixes})(\\(.+?\\))?:?\\s+(.+)`, 'i'),
-        /^(Fix|Revert|Bug|Hotfix|Bugfix|Refactor|Perf)\s+(.+)/,
-        /\b(fixed|reverted|corrected|resolved|refactored|optimized|deprecated)\b.{3,100}/i,
-    ];
-    for (const line of lines) {
-        const trimmed = line.trim();
-        if (!trimmed || trimmed.startsWith('commit ') || trimmed.startsWith('Author:') || trimmed.startsWith('Date:')) {
-            continue;
-        }
-        // Strip leading git hash if present (real hashes are hex, but be lenient with alphanumeric prefixes)
-        const subject = trimmed.replace(/^[a-z0-9]{6,40}\s+/i, '');
-        for (const pat of patterns) {
-            const m = subject.match(pat);
-            if (m) {
-                // For conventional commits: use group 3 (message after prefix), group 2, or full match
-                const lesson = (m[3] ?? m[2] ?? m[0]).trim();
-                if (lesson.length > 5 && lesson.length < 500) {
-                    lessons.push(lesson);
-                }
-                break;
-            }
-        }
-    }
-    // Deduplicate exact matches at extraction time
-    return [...new Set(lessons)];
-}
-/**
- * Split parsed lessons into ones worth storing and low-information ones.
- *
- * `extractLessons` is a published API surface (exported from src/index.ts)
- * and does one job: parse a git log into candidate lesson strings. Adding a
- * quality check inside it would break that contract and silently change
- * what external callers get back. So parsing and admission are separate
- * steps: this function is the write-path gate, called by each caller that
- * actually stores a lesson, not by the parser itself.
- *
- * Order is preserved in both output arrays.
- */
-export function partitionLessons(lessons) {
-    const kept = [];
-    const dropped = [];
-    for (const lesson of lessons) {
-        if (isContentWorthStoring(lesson)) {
-            kept.push(lesson);
-        }
-        else {
-            dropped.push(lesson);
-        }
-    }
-    return { kept, dropped };
-}
-/**
- * Check if a substantially similar memory already exists.
- * Returns true if overlap > threshold (default 0.7).
- *
- * L9: `tenantId` is opt-in. Only takes effect when the first argument is a
- * root string (string-overload path). When the first argument is a
- * pre-loaded MemoryEntry[], the caller has already scoped — tenantId is
- * ignored on that path.
- */
-export function deduplicateLesson(hippoRootOrEntries, lesson, threshold = 0.7, tenantId) {
-    const entries = Array.isArray(hippoRootOrEntries)
-        ? hippoRootOrEntries
-        : loadAllEntries(hippoRootOrEntries, tenantId);
-    for (const entry of entries) {
-        const overlap = textOverlap(lesson, entry.content);
-        if (overlap > threshold)
-            return true;
-    }
-    return false;
-}
-/**
- * Run a command, streaming stdout/stderr to the terminal in real time.
- * Returns: { exitCode, stderr }.
- */
-export function runWatched(command) {
-    return new Promise((resolve) => {
-        // Use shell: true so the command string is handled by the shell as-is
-        const child = spawn(command, { shell: true, stdio: ['inherit', 'inherit', 'pipe'] });
-        const stderrChunks = [];
-        child.stderr.on('data', (chunk) => {
-            stderrChunks.push(chunk);
-            // Also pass through to terminal
-            process.stderr.write(chunk);
-        });
-        child.on('close', (code) => {
-            resolve({
-                exitCode: code ?? 1,
-                stderr: Buffer.concat(stderrChunks).toString('utf8'),
-            });
-        });
-        child.on('error', (err) => {
-            resolve({ exitCode: 1, stderr: err.message });
-        });
-    });
-}
-/**
- * Check whether a directory is a git work tree.
- */
-export function isGitRepo(cwd) {
-    try {
-        const raw = execSync('git rev-parse --is-inside-work-tree', {
-            encoding: 'utf8',
-            cwd,
-            timeout: 10000,
-            stdio: ['ignore', 'pipe', 'ignore'],
-        });
-        return raw.trim() === 'true';
-    }
-    catch {
-        return false;
-    }
-}
-/**
- * Fetch recent git log lines (subject lines only).
- * days: how many days of history to include.
- */
-export function fetchGitLog(cwd, days) {
-    try {
-        const raw = execFileSync('git', [
-            'log', `--since=${days} days ago`, '--pretty=format:%s',
-        ], { encoding: 'utf8', cwd, timeout: 10000, stdio: ['pipe', 'pipe', 'pipe'] });
-        return raw;
-    }
-    catch {
-        return '';
-    }
-}
-//# sourceMappingURL=autolearn.js.map

package/dist/src/autolearn.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"autolearn.js","sourceRoot":"","sources":["../../src/autolearn.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EAAe,YAAY,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEnD;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,MAAc,EACd,OAAe;IAEf,uEAAuE;IACvE,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;IACzC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,wFAAwF;IACxF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,mCAAmC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,YAAY,CAAC;IAChG,MAAM,OAAO,GAAG,YAAY,OAAO,kBAAkB,QAAQ,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;IAExF,wEAAwE;IACxE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACpC,IAAI,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE3D,OAAO,YAAY,CAAC,OAAO,EAAE;QAC3B,KAAK,EAAE,KAAK,CAAC,QAAQ;QACrB,IAAI;QACJ,MAAM,EAAE,WAAW;QACnB,UAAU,EAAE,UAAU;KACvB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,cAAyB;IACtE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEjC,gDAAgD;IAChD,sFAAsF;IACtF,MAAM,QAAQ,GAAG,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,2EAA2E,CAAC;IAC1H,MAAM,QAAQ,GAAG;QACf,IAAI,MAAM,CAAC,kBAAkB,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACpE,IAAI,MAAM,CAAC,KAAK,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACvD,sDAAsD;QACtD,kFAAkF;KACnF,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9G,SAAS;QACX,CAAC;QAED,qGAAqG;QACrG,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAE3D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,EAAE,CAAC;gBACN,uFAAuF;gBACvF,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAiB;IAChD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,kBAA0C,EAC1C,MAAc,EACd,SAAS,GAAG,GAAG,EACf,QAAiB;IAEjB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC/C,CAAC,CAAC,kBAAkB;QACpB,CAAC,CAAC,cAAc,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAC;IAEjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,OAAO,GAAG,SAAS;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe;IACxC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,sEAAsE;QACtE,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAErF,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YACxC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,gCAAgC;YAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAmB,EAAE,EAAE;YACxC,OAAO,CAAC;gBACN,QAAQ,EAAE,IAAI,IAAI,CAAC;gBACnB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;aACrD,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAU,EAAE,EAAE;YAC/B,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,GAAW;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,qCAAqC,EAAE;YAC1D,QAAQ,EAAE,MAAM;YAChB,GAAG;YACH,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC;SACpC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,IAAY;IACnD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,EAAE;YAC9B,KAAK,EAAE,WAAW,IAAI,WAAW,EAAE,oBAAoB;SACxD,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/E,OAAO,GAAG,CAAC;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC"}

package/dist/src/availability.js

@@ -1,94 +0,0 @@
-// ---------------------------------------------------------------------------
-// J2 — Availability-bias detector (Track J: biases-over-memory-state)
-// ---------------------------------------------------------------------------
-//
-// Flags when a recall's returned top-K is dominated by recent entries while
-// substantially older relevant candidates in the same MATCHED pool were passed
-// over. This is the availability / recency heuristic (Tversky-Kahneman): what
-// is most mentally available (recent) gets over-weighted relative to what is
-// most relevant. Hippo's substrate makes this measurable: every entry carries a
-// creation timestamp, so we can compare the age distribution of what was
-// RETURNED against the age distribution of the pool it was drawn from.
-//
-// Soft warning ONLY (ROADMAP-RESEARCH.md Track J discipline note): this never
-// filters, reorders, or suppresses a result. It surfaces a hint the calling
-// agent may choose to act on, exactly like J1 anchoringHint / J3
-// planningFallacyHint / C5 suppressionSummary.
-//
-// PURE: no I/O, no env reads. The env gate (HIPPO_AVAILABILITY=off) and the
-// audit emission live in the callers (api.recall, cmdRecall, MCP), mirroring
-// detectAnchoring in recall-history.ts.
-export const DEFAULT_RECENCY_WINDOW_MS = 24 * 60 * 60 * 1000;
-export const DEFAULT_RECENT_FRACTION_THRESHOLD = 0.7;
-export const DEFAULT_MIN_RETURNED = 3;
-export const DEFAULT_MIN_POOL = 10;
-export const DEFAULT_MIN_OLDER_PASSED_OVER = 3;
-const MS_PER_DAY = 24 * 60 * 60 * 1000;
-const MS_PER_HOUR = 60 * 60 * 1000;
-function median(nums) {
-    if (nums.length === 0)
-        return 0;
-    const sorted = [...nums].sort((a, b) => a - b);
-    const mid = Math.floor(sorted.length / 2);
-    return sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
-}
-/**
- * Detect availability/recency bias in a recall result.
- *
- * Returns an AvailabilityHint when ALL of the following hold:
- *   1. topK.length >= minReturned AND pool.length >= minPool (enough signal);
- *   2. recentFraction > recentFractionThreshold (returned slice is recency-dominated);
- *   3. poolMedianAgeDays > topKMedianAgeDays (the pool genuinely skews older,
- *      so recency is not just the corpus being young);
- *   4. olderCandidatesPassedOver >= minOlderPassedOver (older matched memories
- *      actually existed and were not returned).
- * Otherwise returns null.
- *
- * Entries with an unparseable `created` are dropped defensively so a malformed
- * row cannot poison the medians with NaN.
- */
-export function detectAvailabilityBias(opts) {
-    const now = opts.now ?? Date.now();
-    const recencyWindowMs = opts.recencyWindowMs ?? DEFAULT_RECENCY_WINDOW_MS;
-    const recentFractionThreshold = opts.recentFractionThreshold ?? DEFAULT_RECENT_FRACTION_THRESHOLD;
-    const minReturned = opts.minReturned ?? DEFAULT_MIN_RETURNED;
-    const minPool = opts.minPool ?? DEFAULT_MIN_POOL;
-    const minOlderPassedOver = opts.minOlderPassedOver ?? DEFAULT_MIN_OLDER_PASSED_OVER;
-    const topK = opts.topK
-        .map((e) => ({ id: e.id, ts: Date.parse(e.created) }))
-        .filter((e) => Number.isFinite(e.ts));
-    const pool = opts.pool
-        .map((e) => ({ id: e.id, ts: Date.parse(e.created) }))
-        .filter((e) => Number.isFinite(e.ts));
-    if (topK.length < minReturned || pool.length < minPool)
-        return null;
-    const recentCount = topK.filter((e) => now - e.ts <= recencyWindowMs).length;
-    const recentFraction = recentCount / topK.length;
-    if (recentFraction <= recentFractionThreshold)
-        return null;
-    const topKMedianAgeDays = median(topK.map((e) => (now - e.ts) / MS_PER_DAY));
-    const poolMedianAgeDays = median(pool.map((e) => (now - e.ts) / MS_PER_DAY));
-    if (poolMedianAgeDays <= topKMedianAgeDays)
-        return null;
-    const topKIds = new Set(topK.map((e) => e.id));
-    const olderCandidatesPassedOver = pool.filter((e) => !topKIds.has(e.id) && (now - e.ts) / MS_PER_DAY > topKMedianAgeDays).length;
-    if (olderCandidatesPassedOver < minOlderPassedOver)
-        return null;
-    const pct = Math.round(recentFraction * 100);
-    const windowHours = Math.round(recencyWindowMs / MS_PER_HOUR);
-    const summary = `Availability bias risk: ${recentCount} of ${topK.length} returned results are from the ` +
-        `last ${windowHours}h (${pct}%), but ${olderCandidatesPassedOver} older matched memories ` +
-        `were passed over. Returned median age ${topKMedianAgeDays.toFixed(1)}d vs pool median ` +
-        `${poolMedianAgeDays.toFixed(1)}d. The most relevant answer may not be the most recent.`;
-    return {
-        recentCount,
-        returnedCount: topK.length,
-        recentFraction,
-        topKMedianAgeDays,
-        poolMedianAgeDays,
-        olderCandidatesPassedOver,
-        summary,
-        source: 'j2-recency',
-    };
-}
-//# sourceMappingURL=availability.js.map

package/dist/src/availability.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"availability.js","sourceRoot":"","sources":["../../src/availability.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,sEAAsE;AACtE,8EAA8E;AAC9E,EAAE;AACF,4EAA4E;AAC5E,+EAA+E;AAC/E,8EAA8E;AAC9E,6EAA6E;AAC7E,gFAAgF;AAChF,yEAAyE;AACzE,uEAAuE;AACvE,EAAE;AACF,8EAA8E;AAC9E,4EAA4E;AAC5E,iEAAiE;AACjE,+CAA+C;AAC/C,EAAE;AACF,4EAA4E;AAC5E,6EAA6E;AAC7E,wCAAwC;AAgDxC,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAC7D,MAAM,CAAC,MAAM,iCAAiC,GAAG,GAAG,CAAC;AACrD,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC;AACtC,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AACnC,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,CAAC;AAE/C,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AACvC,MAAM,WAAW,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEnC,SAAS,MAAM,CAAC,IAAuB;IACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AACrF,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAgC;IACrE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACnC,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,yBAAyB,CAAC;IAC1E,MAAM,uBAAuB,GAC3B,IAAI,CAAC,uBAAuB,IAAI,iCAAiC,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC;IAC7D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,gBAAgB,CAAC;IACjD,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,IAAI,6BAA6B,CAAC;IAEpF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;SACrD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;SACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;SACrD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExC,IAAI,IAAI,CAAC,MAAM,GAAG,WAAW,IAAI,IAAI,CAAC,MAAM,GAAG,OAAO;QAAE,OAAO,IAAI,CAAC;IAEpE,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,eAAe,CAAC,CAAC,MAAM,CAAC;IAC7E,MAAM,cAAc,GAAG,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;IACjD,IAAI,cAAc,IAAI,uBAAuB;QAAE,OAAO,IAAI,CAAC;IAE3D,MAAM,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAC7E,MAAM,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAC7E,IAAI,iBAAiB,IAAI,iBAAiB;QAAE,OAAO,IAAI,CAAC;IAExD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,MAAM,yBAAyB,GAAG,IAAI,CAAC,MAAM,CAC3C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,iBAAiB,CAC3E,CAAC,MAAM,CAAC;IACT,IAAI,yBAAyB,GAAG,kBAAkB;QAAE,OAAO,IAAI,CAAC;IAEhE,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC;IAC9D,MAAM,OAAO,GACX,2BAA2B,WAAW,OAAO,IAAI,CAAC,MAAM,iCAAiC;QACzF,QAAQ,WAAW,MAAM,GAAG,WAAW,yBAAyB,0BAA0B;QAC1F,yCAAyC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAmB;QACxF,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,yDAAyD,CAAC;IAE3F,OAAO;QACL,WAAW;QACX,aAAa,EAAE,IAAI,CAAC,MAAM;QAC1B,cAAc;QACd,iBAAiB;QACjB,iBAAiB;QACjB,yBAAyB;QACzB,OAAO;QACP,MAAM,EAAE,YAAY;KACrB,CAAC;AACJ,CAAC"}