@skillsmith/core 0.1.0

package/dist/src/benchmarks/stats.d.ts

@@ -0,0 +1,56 @@
+/**
+ * SMI-632/SMI-677: Shared statistical utilities for benchmark calculations
+ *
+ * This module provides consistent statistical calculations across
+ * BenchmarkRunner and IndexBenchmark.
+ */
+/**
+ * Calculate percentile value from sorted array using linear interpolation
+ *
+ * Uses the percentile rank method with linear interpolation between adjacent values.
+ * This provides more accurate percentile estimates than simple nearest-rank method.
+ *
+ * @param sorted - Sorted array of values (ascending order)
+ * @param p - Percentile to calculate (0-100)
+ * @returns The interpolated percentile value, rounded to 3 decimal places
+ *
+ * @example
+ * percentile([1, 2, 3, 4, 5], 50) // returns 3
+ * percentile([1, 2, 3, 4, 5], 95) // returns 4.8 (interpolated)
+ */
+export declare function percentile(sorted: number[], p: number): number;
+/**
+ * Calculate mean of an array of values
+ *
+ * @param values - Array of numeric values
+ * @returns The arithmetic mean, or 0 for empty array
+ */
+export declare function mean(values: number[]): number;
+/**
+ * Calculate sample standard deviation
+ *
+ * Uses Bessel's correction (n-1 denominator) for sample standard deviation,
+ * which provides an unbiased estimate of population standard deviation.
+ *
+ * @param values - Array of numeric values
+ * @returns The sample standard deviation, or 0 for arrays with less than 2 elements
+ */
+export declare function sampleStddev(values: number[]): number;
+/**
+ * Calculate all common statistics from a set of latencies
+ *
+ * @param latencies - Array of latency measurements
+ * @returns Statistical summary including percentiles, mean, stddev, min, max
+ */
+export interface LatencyStats {
+    count: number;
+    p50: number;
+    p95: number;
+    p99: number;
+    mean: number;
+    stddev: number;
+    min: number;
+    max: number;
+}
+export declare function calculateLatencyStats(latencies: number[]): LatencyStats;
+//# sourceMappingURL=stats.d.ts.map

package/dist/src/benchmarks/stats.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stats.d.ts","sourceRoot":"","sources":["../../../src/benchmarks/stats.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAW9D;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAG7C;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAOrD;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,IAAI,EAAE,MAAM,CAAA;IACZ,MAAM,EAAE,MAAM,CAAA;IACd,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;CACZ;AAED,wBAAgB,qBAAqB,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,YAAY,CA2BvE"}

package/dist/src/benchmarks/stats.js

@@ -0,0 +1,86 @@
+/**
+ * SMI-632/SMI-677: Shared statistical utilities for benchmark calculations
+ *
+ * This module provides consistent statistical calculations across
+ * BenchmarkRunner and IndexBenchmark.
+ */
+/**
+ * Calculate percentile value from sorted array using linear interpolation
+ *
+ * Uses the percentile rank method with linear interpolation between adjacent values.
+ * This provides more accurate percentile estimates than simple nearest-rank method.
+ *
+ * @param sorted - Sorted array of values (ascending order)
+ * @param p - Percentile to calculate (0-100)
+ * @returns The interpolated percentile value, rounded to 3 decimal places
+ *
+ * @example
+ * percentile([1, 2, 3, 4, 5], 50) // returns 3
+ * percentile([1, 2, 3, 4, 5], 95) // returns 4.8 (interpolated)
+ */
+export function percentile(sorted, p) {
+    if (sorted.length === 0)
+        return 0;
+    if (sorted.length === 1)
+        return sorted[0];
+    const rank = (p / 100) * (sorted.length - 1);
+    const lower = Math.floor(rank);
+    const upper = Math.ceil(rank);
+    const weight = rank - lower;
+    const value = sorted[lower] * (1 - weight) + sorted[upper] * weight;
+    return Math.round(value * 1000) / 1000;
+}
+/**
+ * Calculate mean of an array of values
+ *
+ * @param values - Array of numeric values
+ * @returns The arithmetic mean, or 0 for empty array
+ */
+export function mean(values) {
+    if (values.length === 0)
+        return 0;
+    return values.reduce((sum, val) => sum + val, 0) / values.length;
+}
+/**
+ * Calculate sample standard deviation
+ *
+ * Uses Bessel's correction (n-1 denominator) for sample standard deviation,
+ * which provides an unbiased estimate of population standard deviation.
+ *
+ * @param values - Array of numeric values
+ * @returns The sample standard deviation, or 0 for arrays with less than 2 elements
+ */
+export function sampleStddev(values) {
+    if (values.length < 2)
+        return 0;
+    const avg = mean(values);
+    const variance = values.reduce((sum, val) => sum + Math.pow(val - avg, 2), 0) / (values.length - 1);
+    return Math.sqrt(variance);
+}
+export function calculateLatencyStats(latencies) {
+    if (latencies.length === 0) {
+        return {
+            count: 0,
+            p50: 0,
+            p95: 0,
+            p99: 0,
+            mean: 0,
+            stddev: 0,
+            min: 0,
+            max: 0,
+        };
+    }
+    const sorted = [...latencies].sort((a, b) => a - b);
+    const n = sorted.length;
+    return {
+        count: n,
+        p50: percentile(sorted, 50),
+        p95: percentile(sorted, 95),
+        p99: percentile(sorted, 99),
+        mean: Math.round(mean(sorted) * 1000) / 1000,
+        stddev: Math.round(sampleStddev(sorted) * 1000) / 1000,
+        min: sorted[0],
+        max: sorted[n - 1],
+    };
+}
+//# sourceMappingURL=stats.js.map

package/dist/src/benchmarks/stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stats.js","sourceRoot":"","sources":["../../../src/benchmarks/stats.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,MAAgB,EAAE,CAAS;IACpD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACjC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAA;IAEzC,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,KAAK,CAAA;IAE3B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAA;IACnE,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAA;AACxC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAC,MAAgB;IACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACjC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAA;AAClE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,MAAgB;IAC3C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAA;IAE/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAA;IACxB,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACpF,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;AAC5B,CAAC;AAmBD,MAAM,UAAU,qBAAqB,CAAC,SAAmB;IACvD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,KAAK,EAAE,CAAC;YACR,GAAG,EAAE,CAAC;YACN,GAAG,EAAE,CAAC;YACN,GAAG,EAAE,CAAC;YACN,IAAI,EAAE,CAAC;YACP,MAAM,EAAE,CAAC;YACT,GAAG,EAAE,CAAC;YACN,GAAG,EAAE,CAAC;SACP,CAAA;IACH,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACnD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAA;IAEvB,OAAO;QACL,KAAK,EAAE,CAAC;QACR,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,GAAG,EAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;QAC5C,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;QACtD,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;QACd,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;KACnB,CAAA;AACH,CAAC"}

package/dist/src/cache/CacheEntry.d.ts

@@ -0,0 +1,101 @@
+/**
+ * SMI-644: Cache Entry Data Structure
+ * Enhanced cache entry with TTL tracking and hit count for popularity detection
+ */
+import type { SearchResult } from './lru.js';
+/**
+ * TTL tiers based on query popularity
+ */
+export declare enum TTLTier {
+    /** Popular queries (>10 hits/hour): 4 hours */
+    POPULAR = 14400000,
+    /** Standard queries: 1 hour */
+    STANDARD = 3600000,
+    /** Rare queries (<1 hit/day): 15 minutes */
+    RARE = 900000
+}
+/**
+ * Popularity thresholds for TTL determination
+ */
+export declare const POPULARITY_THRESHOLDS: {
+    /** Hits per hour to be considered "popular" */
+    readonly POPULAR_HITS_PER_HOUR: 10;
+    /** Minimum age (ms) before evaluating popularity */
+    readonly MIN_AGE_FOR_EVALUATION: number;
+};
+/**
+ * Enhanced cache entry with TTL and popularity tracking
+ */
+export interface CacheEntry<T = SearchResult[]> {
+    /** Unique cache key */
+    key: string;
+    /** Cached data */
+    data: T;
+    /** Total count for search results */
+    totalCount: number;
+    /** Creation timestamp (ms) */
+    createdAt: number;
+    /** Expiration timestamp (ms) */
+    expiresAt: number;
+    /** Number of cache hits */
+    hitCount: number;
+    /** Last access timestamp (ms) */
+    lastAccessedAt: number;
+    /** Current TTL tier */
+    ttlTier: TTLTier;
+}
+/**
+ * Serialized format for persistent storage
+ */
+export interface SerializedCacheEntry {
+    key: string;
+    data_json: string;
+    total_count: number;
+    created_at: number;
+    expires_at: number;
+    hit_count: number;
+    last_accessed_at: number;
+    ttl_tier: number;
+}
+/**
+ * Create a new cache entry with default TTL
+ */
+export declare function createCacheEntry<T = SearchResult[]>(key: string, data: T, totalCount: number, ttlTier?: TTLTier): CacheEntry<T>;
+/**
+ * Record a hit on a cache entry
+ * Returns updated entry (immutable pattern)
+ */
+export declare function recordHit<T>(entry: CacheEntry<T>): CacheEntry<T>;
+/**
+ * Calculate TTL tier based on hit rate
+ */
+export declare function calculateTTLTier(createdAt: number, hitCount: number, now?: number): TTLTier;
+/**
+ * Check if cache entry is expired
+ */
+export declare function isExpired<T>(entry: CacheEntry<T>, now?: number): boolean;
+/**
+ * Check if entry should be refreshed (approaching expiration)
+ * Returns true if within 10% of TTL remaining
+ */
+export declare function shouldRefresh<T>(entry: CacheEntry<T>, now?: number): boolean;
+/**
+ * Validate cache key for security (standards.md §4)
+ * Prevents injection attacks through cache keys
+ */
+export declare function isValidCacheKey(key: string): boolean;
+/**
+ * Serialize cache entry for persistence
+ * Uses safe JSON serialization to prevent prototype pollution
+ */
+export declare function serializeCacheEntry<T>(entry: CacheEntry<T>): SerializedCacheEntry;
+/**
+ * Deserialize cache entry from persistence
+ * Validates data to prevent prototype pollution (security: standards.md §4)
+ */
+export declare function deserializeCacheEntry<T = SearchResult[]>(serialized: SerializedCacheEntry): CacheEntry<T>;
+/**
+ * Get human-readable TTL tier name
+ */
+export declare function getTTLTierName(tier: TTLTier): string;
+//# sourceMappingURL=CacheEntry.d.ts.map

package/dist/src/cache/CacheEntry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CacheEntry.d.ts","sourceRoot":"","sources":["../../../src/cache/CacheEntry.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAA;AAE5C;;GAEG;AACH,oBAAY,OAAO;IACjB,+CAA+C;IAC/C,OAAO,WAAqB;IAC5B,+BAA+B;IAC/B,QAAQ,UAAiB;IACzB,4CAA4C;IAC5C,IAAI,SAAiB;CACtB;AAED;;GAEG;AACH,eAAO,MAAM,qBAAqB;IAChC,+CAA+C;;IAE/C,oDAAoD;;CAE5C,CAAA;AAEV;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,GAAG,YAAY,EAAE;IAC5C,uBAAuB;IACvB,GAAG,EAAE,MAAM,CAAA;IACX,kBAAkB;IAClB,IAAI,EAAE,CAAC,CAAA;IACP,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAA;IAClB,8BAA8B;IAC9B,SAAS,EAAE,MAAM,CAAA;IACjB,gCAAgC;IAChC,SAAS,EAAE,MAAM,CAAA;IACjB,2BAA2B;IAC3B,QAAQ,EAAE,MAAM,CAAA;IAChB,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAA;IACtB,uBAAuB;IACvB,OAAO,EAAE,OAAO,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,GAAG,EAAE,MAAM,CAAA;IACX,SAAS,EAAE,MAAM,CAAA;IACjB,WAAW,EAAE,MAAM,CAAA;IACnB,UAAU,EAAE,MAAM,CAAA;IAClB,UAAU,EAAE,MAAM,CAAA;IAClB,SAAS,EAAE,MAAM,CAAA;IACjB,gBAAgB,EAAE,MAAM,CAAA;IACxB,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,GAAG,YAAY,EAAE,EACjD,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,CAAC,EACP,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE,OAA0B,GAClC,UAAU,CAAC,CAAC,CAAC,CAiBf;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAiBhE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,GAAG,GAAE,MAAmB,GACvB,OAAO,CAuBT;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAE,MAAmB,GAAG,OAAO,CAEpF;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,GAAE,MAAmB,GAAG,OAAO,CAIxF;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAkBpD;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,oBAAoB,CAWjF;AA8CD;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,GAAG,YAAY,EAAE,EACtD,UAAU,EAAE,oBAAoB,GAC/B,UAAU,CAAC,CAAC,CAAC,CA+Cf;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAWpD"}

package/dist/src/cache/CacheEntry.js

@@ -0,0 +1,238 @@
+/**
+ * SMI-644: Cache Entry Data Structure
+ * Enhanced cache entry with TTL tracking and hit count for popularity detection
+ */
+/**
+ * TTL tiers based on query popularity
+ */
+export var TTLTier;
+(function (TTLTier) {
+    /** Popular queries (>10 hits/hour): 4 hours */
+    TTLTier[TTLTier["POPULAR"] = 14400000] = "POPULAR";
+    /** Standard queries: 1 hour */
+    TTLTier[TTLTier["STANDARD"] = 3600000] = "STANDARD";
+    /** Rare queries (<1 hit/day): 15 minutes */
+    TTLTier[TTLTier["RARE"] = 900000] = "RARE";
+})(TTLTier || (TTLTier = {}));
+/**
+ * Popularity thresholds for TTL determination
+ */
+export const POPULARITY_THRESHOLDS = {
+    /** Hits per hour to be considered "popular" */
+    POPULAR_HITS_PER_HOUR: 10,
+    /** Minimum age (ms) before evaluating popularity */
+    MIN_AGE_FOR_EVALUATION: 60 * 1000, // 1 minute
+};
+/**
+ * Create a new cache entry with default TTL
+ */
+export function createCacheEntry(key, data, totalCount, ttlTier = TTLTier.STANDARD) {
+    // Validate key to prevent injection (security: standards.md §4)
+    if (!isValidCacheKey(key)) {
+        throw new Error('Invalid cache key: contains disallowed characters');
+    }
+    const now = Date.now();
+    return {
+        key,
+        data,
+        totalCount,
+        createdAt: now,
+        expiresAt: now + ttlTier,
+        hitCount: 0,
+        lastAccessedAt: now,
+        ttlTier,
+    };
+}
+/**
+ * Record a hit on a cache entry
+ * Returns updated entry (immutable pattern)
+ */
+export function recordHit(entry) {
+    const now = Date.now();
+    const newHitCount = entry.hitCount + 1;
+    // Calculate new TTL tier based on popularity
+    const newTier = calculateTTLTier(entry.createdAt, newHitCount, now);
+    // If tier upgraded, extend expiration
+    const newExpiresAt = newTier > entry.ttlTier ? now + newTier : entry.expiresAt;
+    return {
+        ...entry,
+        hitCount: newHitCount,
+        lastAccessedAt: now,
+        ttlTier: newTier,
+        expiresAt: newExpiresAt,
+    };
+}
+/**
+ * Calculate TTL tier based on hit rate
+ */
+export function calculateTTLTier(createdAt, hitCount, now = Date.now()) {
+    const ageMs = now - createdAt;
+    // Need minimum age to evaluate popularity
+    if (ageMs < POPULARITY_THRESHOLDS.MIN_AGE_FOR_EVALUATION) {
+        return TTLTier.STANDARD;
+    }
+    // Calculate hits per hour
+    const ageHours = ageMs / (60 * 60 * 1000);
+    const hitsPerHour = hitCount / Math.max(ageHours, 1 / 60); // Min 1 minute
+    if (hitsPerHour >= POPULARITY_THRESHOLDS.POPULAR_HITS_PER_HOUR) {
+        return TTLTier.POPULAR;
+    }
+    // Check for rare: less than 1 hit per day equivalent
+    const hitsPerDay = hitsPerHour * 24;
+    if (hitsPerDay < 1 && ageHours >= 1) {
+        return TTLTier.RARE;
+    }
+    return TTLTier.STANDARD;
+}
+/**
+ * Check if cache entry is expired
+ */
+export function isExpired(entry, now = Date.now()) {
+    return now >= entry.expiresAt;
+}
+/**
+ * Check if entry should be refreshed (approaching expiration)
+ * Returns true if within 10% of TTL remaining
+ */
+export function shouldRefresh(entry, now = Date.now()) {
+    const ttl = entry.expiresAt - entry.createdAt;
+    const remaining = entry.expiresAt - now;
+    return remaining > 0 && remaining < ttl * 0.1;
+}
+/**
+ * Validate cache key for security (standards.md §4)
+ * Prevents injection attacks through cache keys
+ */
+export function isValidCacheKey(key) {
+    // Max key length
+    if (key.length > 1024) {
+        return false;
+    }
+    // Must be non-empty string
+    if (!key || typeof key !== 'string') {
+        return false;
+    }
+    // Block null bytes and control characters
+    // eslint-disable-next-line no-control-regex
+    if (/[\x00-\x1f\x7f]/.test(key)) {
+        return false;
+    }
+    return true;
+}
+/**
+ * Serialize cache entry for persistence
+ * Uses safe JSON serialization to prevent prototype pollution
+ */
+export function serializeCacheEntry(entry) {
+    return {
+        key: entry.key,
+        data_json: JSON.stringify(entry.data),
+        total_count: entry.totalCount,
+        created_at: entry.createdAt,
+        expires_at: entry.expiresAt,
+        hit_count: entry.hitCount,
+        last_accessed_at: entry.lastAccessedAt,
+        ttl_tier: entry.ttlTier,
+    };
+}
+/** Pattern to detect prototype pollution attempts (standards.md §4.4) */
+const PROTOTYPE_POLLUTION_PATTERN = /"(__proto__|prototype|constructor)"\s*:/i;
+/**
+ * SMI-684: Recursively check for dangerous keys in parsed objects
+ * Prevents prototype pollution bypass via unicode escapes (e.g., \u005f\u005fproto\u005f\u005f)
+ * which are decoded by JSON.parse before we can detect them with regex
+ */
+function hasDangerousKeys(obj, depth = 0) {
+    // Prevent stack overflow on deeply nested objects
+    if (depth > 100)
+        return false;
+    // Handle null, primitives
+    if (typeof obj !== 'object' || obj === null)
+        return false;
+    // Handle arrays - check each element
+    if (Array.isArray(obj)) {
+        for (const item of obj) {
+            if (hasDangerousKeys(item, depth + 1)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    // Handle objects - check keys and recurse into values
+    const keys = Object.keys(obj);
+    for (const key of keys) {
+        // Check for dangerous keys
+        if (key === '__proto__' || key === 'prototype' || key === 'constructor') {
+            return true;
+        }
+        // Recursively check nested objects
+        if (hasDangerousKeys(obj[key], depth + 1)) {
+            return true;
+        }
+    }
+    return false;
+}
+/** Valid TTL tier values */
+const VALID_TTL_TIERS = new Set([TTLTier.POPULAR, TTLTier.STANDARD, TTLTier.RARE]);
+/**
+ * Deserialize cache entry from persistence
+ * Validates data to prevent prototype pollution (security: standards.md §4)
+ */
+export function deserializeCacheEntry(serialized) {
+    // Check for prototype pollution before parsing (standards.md §4.4)
+    // This catches simple cases like {"__proto__": {}}
+    if (PROTOTYPE_POLLUTION_PATTERN.test(serialized.data_json)) {
+        throw new Error('Prototype pollution attempt detected in cache data');
+    }
+    // Parse JSON safely
+    let data;
+    try {
+        data = JSON.parse(serialized.data_json);
+    }
+    catch {
+        throw new Error('Failed to deserialize cache entry data');
+    }
+    // SMI-684: Post-parse validation to catch unicode escape bypasses
+    // e.g., {"\\u005f\\u005fproto\\u005f\\u005f": {}} becomes {"__proto__": {}} after parse
+    if (hasDangerousKeys(data)) {
+        throw new Error('Prototype pollution attempt detected in cache data');
+    }
+    // Validate all numeric fields
+    if (typeof serialized.created_at !== 'number' ||
+        typeof serialized.expires_at !== 'number' ||
+        typeof serialized.hit_count !== 'number' ||
+        typeof serialized.last_accessed_at !== 'number' ||
+        typeof serialized.total_count !== 'number') {
+        throw new Error('Invalid cache entry: numeric fields must be numbers');
+    }
+    // Validate TTL tier is a known value
+    if (!VALID_TTL_TIERS.has(serialized.ttl_tier)) {
+        throw new Error('Invalid cache entry: unknown TTL tier');
+    }
+    return {
+        key: serialized.key,
+        data,
+        totalCount: serialized.total_count,
+        createdAt: serialized.created_at,
+        expiresAt: serialized.expires_at,
+        hitCount: serialized.hit_count,
+        lastAccessedAt: serialized.last_accessed_at,
+        ttlTier: serialized.ttl_tier,
+    };
+}
+/**
+ * Get human-readable TTL tier name
+ */
+export function getTTLTierName(tier) {
+    switch (tier) {
+        case TTLTier.POPULAR:
+            return 'popular';
+        case TTLTier.STANDARD:
+            return 'standard';
+        case TTLTier.RARE:
+            return 'rare';
+        default:
+            return 'unknown';
+    }
+}
+//# sourceMappingURL=CacheEntry.js.map

package/dist/src/cache/CacheEntry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CacheEntry.js","sourceRoot":"","sources":["../../../src/cache/CacheEntry.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;GAEG;AACH,MAAM,CAAN,IAAY,OAOX;AAPD,WAAY,OAAO;IACjB,+CAA+C;IAC/C,kDAA4B,CAAA;IAC5B,+BAA+B;IAC/B,mDAAyB,CAAA;IACzB,4CAA4C;IAC5C,0CAAqB,CAAA;AACvB,CAAC,EAPW,OAAO,KAAP,OAAO,QAOlB;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG;IACnC,+CAA+C;IAC/C,qBAAqB,EAAE,EAAE;IACzB,oDAAoD;IACpD,sBAAsB,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW;CACtC,CAAA;AAsCV;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,GAAW,EACX,IAAO,EACP,UAAkB,EAClB,UAAmB,OAAO,CAAC,QAAQ;IAEnC,gEAAgE;IAChE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAA;IACtE,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;IACtB,OAAO;QACL,GAAG;QACH,IAAI;QACJ,UAAU;QACV,SAAS,EAAE,GAAG;QACd,SAAS,EAAE,GAAG,GAAG,OAAO;QACxB,QAAQ,EAAE,CAAC;QACX,cAAc,EAAE,GAAG;QACnB,OAAO;KACR,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAI,KAAoB;IAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;IACtB,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAA;IAEtC,6CAA6C;IAC7C,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,WAAW,EAAE,GAAG,CAAC,CAAA;IAEnE,sCAAsC;IACtC,MAAM,YAAY,GAAG,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAA;IAE9E,OAAO;QACL,GAAG,KAAK;QACR,QAAQ,EAAE,WAAW;QACrB,cAAc,EAAE,GAAG;QACnB,OAAO,EAAE,OAAO;QAChB,SAAS,EAAE,YAAY;KACxB,CAAA;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAiB,EACjB,QAAgB,EAChB,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,MAAM,KAAK,GAAG,GAAG,GAAG,SAAS,CAAA;IAE7B,0CAA0C;IAC1C,IAAI,KAAK,GAAG,qBAAqB,CAAC,sBAAsB,EAAE,CAAC;QACzD,OAAO,OAAO,CAAC,QAAQ,CAAA;IACzB,CAAC;IAED,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAA;IACzC,MAAM,WAAW,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA,CAAC,eAAe;IAEzE,IAAI,WAAW,IAAI,qBAAqB,CAAC,qBAAqB,EAAE,CAAC;QAC/D,OAAO,OAAO,CAAC,OAAO,CAAA;IACxB,CAAC;IAED,qDAAqD;IACrD,MAAM,UAAU,GAAG,WAAW,GAAG,EAAE,CAAA;IACnC,IAAI,UAAU,GAAG,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QACpC,OAAO,OAAO,CAAC,IAAI,CAAA;IACrB,CAAC;IAED,OAAO,OAAO,CAAC,QAAQ,CAAA;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAI,KAAoB,EAAE,MAAc,IAAI,CAAC,GAAG,EAAE;IACzE,OAAO,GAAG,IAAI,KAAK,CAAC,SAAS,CAAA;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAI,KAAoB,EAAE,MAAc,IAAI,CAAC,GAAG,EAAE;IAC7E,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAC7C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,GAAG,GAAG,CAAA;IACvC,OAAO,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,GAAG,GAAG,GAAG,CAAA;AAC/C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,iBAAiB;IACjB,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;QACtB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,2BAA2B;IAC3B,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QACpC,OAAO,KAAK,CAAA;IACd,CAAC;IAED,0CAA0C;IAC1C,4CAA4C;IAC5C,IAAI,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,KAAK,CAAA;IACd,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAI,KAAoB;IACzD,OAAO;QACL,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;QACrC,WAAW,EAAE,KAAK,CAAC,UAAU;QAC7B,UAAU,EAAE,KAAK,CAAC,SAAS;QAC3B,UAAU,EAAE,KAAK,CAAC,SAAS;QAC3B,SAAS,EAAE,KAAK,CAAC,QAAQ;QACzB,gBAAgB,EAAE,KAAK,CAAC,cAAc;QACtC,QAAQ,EAAE,KAAK,CAAC,OAAO;KACxB,CAAA;AACH,CAAC;AAED,yEAAyE;AACzE,MAAM,2BAA2B,GAAG,0CAA0C,CAAA;AAE9E;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,GAAY,EAAE,KAAK,GAAG,CAAC;IAC/C,kDAAkD;IAClD,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,KAAK,CAAA;IAE7B,0BAA0B;IAC1B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAEzD,qCAAqC;IACrC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,gBAAgB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,sDAAsD;IACtD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,2BAA2B;QAC3B,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,WAAW,IAAI,GAAG,KAAK,aAAa,EAAE,CAAC;YACxE,OAAO,IAAI,CAAA;QACb,CAAC;QACD,mCAAmC;QACnC,IAAI,gBAAgB,CAAE,GAA+B,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;YACvE,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,4BAA4B;AAC5B,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;AAElF;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAgC;IAEhC,mEAAmE;IACnE,mDAAmD;IACnD,IAAI,2BAA2B,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAA;IACvE,CAAC;IAED,oBAAoB;IACpB,IAAI,IAAO,CAAA;IACX,IAAI,CAAC;QACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAM,CAAA;IAC9C,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IAC3D,CAAC;IAED,kEAAkE;IAClE,wFAAwF;IACxF,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAA;IACvE,CAAC;IAED,8BAA8B;IAC9B,IACE,OAAO,UAAU,CAAC,UAAU,KAAK,QAAQ;QACzC,OAAO,UAAU,CAAC,UAAU,KAAK,QAAQ;QACzC,OAAO,UAAU,CAAC,SAAS,KAAK,QAAQ;QACxC,OAAO,UAAU,CAAC,gBAAgB,KAAK,QAAQ;QAC/C,OAAO,UAAU,CAAC,WAAW,KAAK,QAAQ,EAC1C,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAA;IACxE,CAAC;IAED,qCAAqC;IACrC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,QAAmB,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;IAC1D,CAAC;IAED,OAAO;QACL,GAAG,EAAE,UAAU,CAAC,GAAG;QACnB,IAAI;QACJ,UAAU,EAAE,UAAU,CAAC,WAAW;QAClC,SAAS,EAAE,UAAU,CAAC,UAAU;QAChC,SAAS,EAAE,UAAU,CAAC,UAAU;QAChC,QAAQ,EAAE,UAAU,CAAC,SAAS;QAC9B,cAAc,EAAE,UAAU,CAAC,gBAAgB;QAC3C,OAAO,EAAE,UAAU,CAAC,QAAmB;KACxC,CAAA;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAa;IAC1C,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,OAAO,CAAC,OAAO;YAClB,OAAO,SAAS,CAAA;QAClB,KAAK,OAAO,CAAC,QAAQ;YACnB,OAAO,UAAU,CAAA;QACnB,KAAK,OAAO,CAAC,IAAI;YACf,OAAO,MAAM,CAAA;QACf;YACE,OAAO,SAAS,CAAA;IACpB,CAAC;AACH,CAAC"}

package/dist/src/cache/CacheManager.d.ts

@@ -0,0 +1,167 @@
+/**
+ * SMI-644: Unified Cache Manager
+ * Provides high-level cache operations with:
+ * - Popular query detection (dynamic TTL)
+ * - Background refresh for hot entries
+ * - Cache invalidation coordination
+ * - Statistics and monitoring
+ */
+import type { SearchResult } from './lru.js';
+import { TTLTier, POPULARITY_THRESHOLDS, getTTLTierName } from './CacheEntry.js';
+import { type TieredCacheConfig, type TieredCacheStats } from './TieredCache.js';
+/**
+ * Search options for cache key generation
+ */
+export interface SearchOptions {
+    query: string;
+    filters?: Record<string, unknown>;
+    limit?: number;
+    offset?: number;
+}
+/**
+ * Refresh callback type
+ */
+export type RefreshCallback = (options: SearchOptions) => Promise<{
+    results: SearchResult[];
+    totalCount: number;
+}>;
+/**
+ * Cache manager configuration
+ */
+export interface CacheManagerConfig extends TieredCacheConfig {
+    /** Enable background refresh for hot entries (default: true) */
+    enableBackgroundRefresh?: boolean;
+    /** Background refresh interval in ms (default: 30 seconds) */
+    refreshIntervalMs?: number;
+    /** Maximum concurrent refreshes (default: 3) */
+    maxConcurrentRefreshes?: number;
+    /** Callback to refresh cache entries */
+    refreshCallback?: RefreshCallback;
+}
+/**
+ * Unified Cache Manager
+ * Coordinates L1/L2 caching with intelligent TTL management
+ */
+export declare class CacheManager {
+    private cache;
+    private readonly config;
+    private queryFrequencies;
+    private refreshTimer;
+    /** SMI-683: Use Map<key, Promise> for proper deduplication of concurrent refreshes */
+    private activeRefreshes;
+    private refreshCallback;
+    private lastInvalidation;
+    private invalidationCallbacks;
+    constructor(config?: CacheManagerConfig);
+    /**
+     * Generate cache key from search options
+     */
+    static generateKey(options: SearchOptions): string;
+    /**
+     * Parse search options from cache key
+     * SMI-683: Fixed regex to handle empty filters (was: .+? requires at least 1 char)
+     */
+    static parseKey(key: string): SearchOptions | null;
+    /**
+     * Get cached results for search options
+     */
+    get(options: SearchOptions): {
+        results: SearchResult[];
+        totalCount: number;
+    } | undefined;
+    /**
+     * Get or compute cached results
+     * @param options Search options
+     * @param compute Function to compute results if not cached
+     */
+    getOrCompute(options: SearchOptions, compute: () => Promise<{
+        results: SearchResult[];
+        totalCount: number;
+    }>): Promise<{
+        results: SearchResult[];
+        totalCount: number;
+    }>;
+    /**
+     * Store results in cache with automatic TTL detection
+     */
+    set(options: SearchOptions, results: SearchResult[], totalCount: number): void;
+    /**
+     * Check if results are cached
+     */
+    has(options: SearchOptions): boolean;
+    /**
+     * Delete specific cached result
+     */
+    delete(options: SearchOptions): boolean;
+    /**
+     * Invalidate all cached results
+     * Should be called when the skill index is updated
+     */
+    invalidateAll(): void;
+    /**
+     * Register callback for invalidation events
+     */
+    onInvalidate(callback: () => void): () => void;
+    /**
+     * Get time since last invalidation
+     */
+    getTimeSinceInvalidation(): number;
+    /**
+     * Prune expired entries
+     */
+    prune(): number;
+    /**
+     * Get comprehensive cache statistics
+     */
+    getStats(): TieredCacheStats & {
+        queryFrequencies: {
+            popular: number;
+            standard: number;
+            rare: number;
+        };
+        backgroundRefresh: {
+            active: number;
+            lastRun: number;
+        };
+    };
+    /**
+     * Get detailed hit rate by TTL tier
+     */
+    getHitRateByTier(): Record<string, number>;
+    /**
+     * Set the refresh callback for background refresh
+     */
+    setRefreshCallback(callback: RefreshCallback): void;
+    /**
+     * Close cache manager and cleanup resources
+     */
+    close(): void;
+    /**
+     * Record a hit for query frequency tracking
+     */
+    private recordQueryHit;
+    /**
+     * Determine TTL tier based on query frequency
+     */
+    private determineTTLTier;
+    /**
+     * Prune old query frequency entries
+     */
+    private pruneQueryFrequencies;
+    /**
+     * Start background refresh loop
+     */
+    private startBackgroundRefresh;
+    /**
+     * Perform background refresh for entries approaching expiration
+     */
+    private performBackgroundRefresh;
+    /**
+     * Refresh a single cache entry
+     * SMI-683: Fixed race condition by using Map<string, Promise<void>> for proper deduplication.
+     * Concurrent calls for the same key now return the same promise instance.
+     */
+    private refreshEntry;
+}
+export { TTLTier, getTTLTierName, POPULARITY_THRESHOLDS };
+//# sourceMappingURL=CacheManager.d.ts.map

package/dist/src/cache/CacheManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CacheManager.d.ts","sourceRoot":"","sources":["../../../src/cache/CacheManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAA;AAC5C,OAAO,EAAE,OAAO,EAAE,qBAAqB,EAAoB,cAAc,EAAE,MAAM,iBAAiB,CAAA;AAClG,OAAO,EAEL,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACtB,MAAM,kBAAkB,CAAA;AAEzB;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IACjC,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;CAChB;AAED;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,CAC5B,OAAO,EAAE,aAAa,KACnB,OAAO,CAAC;IAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,CAAA;AAE7D;;GAEG;AACH,MAAM,WAAW,kBAAmB,SAAQ,iBAAiB;IAC3D,gEAAgE;IAChE,uBAAuB,CAAC,EAAE,OAAO,CAAA;IACjC,8DAA8D;IAC9D,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,gDAAgD;IAChD,sBAAsB,CAAC,EAAE,MAAM,CAAA;IAC/B,wCAAwC;IACxC,eAAe,CAAC,EAAE,eAAe,CAAA;CAClC;AAoBD;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAqB;IAClC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuB;IAC9C,OAAO,CAAC,gBAAgB,CAAyC;IACjE,OAAO,CAAC,YAAY,CAA8C;IAClE,sFAAsF;IACtF,OAAO,CAAC,eAAe,CAAmC;IAC1D,OAAO,CAAC,eAAe,CAA+B;IAGtD,OAAO,CAAC,gBAAgB,CAAI;IAC5B,OAAO,CAAC,qBAAqB,CAAwB;gBAEzC,MAAM,GAAE,kBAAuB;IAiB3C;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,aAAa,GAAG,MAAM;IAyBlD;;;OAGG;IACH,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;IAsBlD;;OAEG;IACH,GAAG,CAAC,OAAO,EAAE,aAAa,GAAG;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS;IAYxF;;;;OAIG;IACG,YAAY,CAChB,OAAO,EAAE,aAAa,EACtB,OAAO,EAAE,MAAM,OAAO,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,GACtE,OAAO,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IAW3D;;OAEG;IACH,GAAG,CAAC,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI;IAS9E;;OAEG;IACH,GAAG,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO;IAKpC;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,aAAa,GAAG,OAAO;IAMvC;;;OAGG;IACH,aAAa,IAAI,IAAI;IAerB;;OAEG;IACH,YAAY,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI;IAU9C;;OAEG;IACH,wBAAwB,IAAI,MAAM;IAIlC;;OAEG;IACH,KAAK,IAAI,MAAM;IAKf;;OAEG;IACH,QAAQ,IAAI,gBAAgB,GAAG;QAC7B,gBAAgB,EAAE;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAA;QACrE,iBAAiB,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAA;KACvD;IA0BD;;OAEG;IACH,gBAAgB,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAW1C;;OAEG;IACH,kBAAkB,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;IASnD;;OAEG;IACH,KAAK,IAAI,IAAI;IAYb;;OAEG;IACH,OAAO,CAAC,cAAc;IAgBtB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IASxB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAW7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAY9B;;OAEG;YACW,wBAAwB;IAoBtC;;;;OAIG;IACH,OAAO,CAAC,YAAY;CA0BrB;AAGD,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,qBAAqB,EAAE,CAAA"}