@uniforge/core 0.1.0-alpha.2

package/dist/performance/index.d.cts

@@ -0,0 +1,34 @@
+import { CacheManagerConfig, CacheManager, QueryCostConfig, QueryCostTracker, BatchConfig, QueryBatcher } from '@uniforge/platform-core/performance';
+
+/**
+ * In-memory cache manager implementation.
+ *
+ * Provides TTL-based caching with strategy-based TTL matching,
+ * LRU-style eviction, and performance metrics tracking.
+ */
+
+/** Create an in-memory CacheManager. */
+declare function createCacheManager(config: CacheManagerConfig): CacheManager;
+
+/**
+ * Query cost tracker implementation.
+ *
+ * Tracks GraphQL query costs within a sliding time window
+ * and provides budget monitoring to prevent API throttling.
+ */
+
+/** Create a QueryCostTracker that monitors query costs within a sliding window. */
+declare function createQueryCostTracker(config: QueryCostConfig): QueryCostTracker;
+
+/**
+ * Query batcher implementation.
+ *
+ * Collects individual queries into batches and executes them together,
+ * reducing the number of API round-trips. Batches are flushed either
+ * when they reach the configured size or after a delay timeout.
+ */
+
+/** Create a QueryBatcher that groups queries and executes them in batches. */
+declare function createQueryBatcher<TQuery, TResult>(config: BatchConfig, executor: (queries: TQuery[]) => Promise<TResult[]>): QueryBatcher<TQuery, TResult>;
+
+export { createCacheManager, createQueryBatcher, createQueryCostTracker };

package/dist/performance/index.d.ts

@@ -0,0 +1,34 @@
+import { CacheManagerConfig, CacheManager, QueryCostConfig, QueryCostTracker, BatchConfig, QueryBatcher } from '@uniforge/platform-core/performance';
+
+/**
+ * In-memory cache manager implementation.
+ *
+ * Provides TTL-based caching with strategy-based TTL matching,
+ * LRU-style eviction, and performance metrics tracking.
+ */
+
+/** Create an in-memory CacheManager. */
+declare function createCacheManager(config: CacheManagerConfig): CacheManager;
+
+/**
+ * Query cost tracker implementation.
+ *
+ * Tracks GraphQL query costs within a sliding time window
+ * and provides budget monitoring to prevent API throttling.
+ */
+
+/** Create a QueryCostTracker that monitors query costs within a sliding window. */
+declare function createQueryCostTracker(config: QueryCostConfig): QueryCostTracker;
+
+/**
+ * Query batcher implementation.
+ *
+ * Collects individual queries into batches and executes them together,
+ * reducing the number of API round-trips. Batches are flushed either
+ * when they reach the configured size or after a delay timeout.
+ */
+
+/** Create a QueryBatcher that groups queries and executes them in batches. */
+declare function createQueryBatcher<TQuery, TResult>(config: BatchConfig, executor: (queries: TQuery[]) => Promise<TResult[]>): QueryBatcher<TQuery, TResult>;
+
+export { createCacheManager, createQueryBatcher, createQueryCostTracker };

package/dist/performance/index.js

@@ -0,0 +1,319 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/performance/index.ts
+var performance_exports = {};
+__export(performance_exports, {
+  createCacheManager: () => createCacheManager,
+  createQueryBatcher: () => createQueryBatcher,
+  createQueryCostTracker: () => createQueryCostTracker
+});
+module.exports = __toCommonJS(performance_exports);
+
+// src/performance/cache-manager.ts
+function createCacheManager(config) {
+  const store = /* @__PURE__ */ new Map();
+  let hits = 0;
+  let misses = 0;
+  let evictions = 0;
+  function resolveTTL(key, ttlOverride) {
+    if (ttlOverride !== void 0) return ttlOverride;
+    if (config.strategies !== void 0) {
+      for (const strategy of config.strategies) {
+        if (key.startsWith(strategy.pattern)) {
+          return strategy.ttl;
+        }
+      }
+    }
+    return config.defaultTTL;
+  }
+  function prefixKey(key) {
+    if (config.keyPrefix !== void 0) {
+      return `${config.keyPrefix}:${key}`;
+    }
+    return key;
+  }
+  function isExpired(entry) {
+    return Date.now() >= entry.expiresAt;
+  }
+  function evictOldest() {
+    let oldestKey;
+    let oldestTime = Infinity;
+    for (const [k, v] of store) {
+      if (v.createdAt < oldestTime) {
+        oldestTime = v.createdAt;
+        oldestKey = k;
+      }
+    }
+    if (oldestKey !== void 0) {
+      store.delete(oldestKey);
+      evictions++;
+    }
+  }
+  const manager = {
+    config,
+    async get(key) {
+      const fullKey = prefixKey(key);
+      const entry = store.get(fullKey);
+      if (!entry) {
+        misses++;
+        return void 0;
+      }
+      if (isExpired(entry)) {
+        store.delete(fullKey);
+        misses++;
+        return void 0;
+      }
+      entry.hits++;
+      hits++;
+      return {
+        key: entry.key,
+        value: entry.value,
+        createdAt: entry.createdAt,
+        expiresAt: entry.expiresAt,
+        hits: entry.hits
+      };
+    },
+    async set(key, value, ttl) {
+      const fullKey = prefixKey(key);
+      const resolvedTTL = resolveTTL(key, ttl);
+      const now = Date.now();
+      if (!store.has(fullKey) && store.size >= config.maxEntries) {
+        evictOldest();
+      }
+      const entry = {
+        key,
+        value,
+        createdAt: now,
+        expiresAt: now + resolvedTTL,
+        hits: 0
+      };
+      store.set(fullKey, entry);
+    },
+    async delete(key) {
+      const fullKey = prefixKey(key);
+      return store.delete(fullKey);
+    },
+    async invalidate(pattern) {
+      let count = 0;
+      const prefixed = prefixKey(pattern);
+      for (const key of [...store.keys()]) {
+        if (key.startsWith(prefixed)) {
+          store.delete(key);
+          count++;
+        }
+      }
+      return count;
+    },
+    async has(key) {
+      const fullKey = prefixKey(key);
+      const entry = store.get(fullKey);
+      if (!entry) return false;
+      if (isExpired(entry)) {
+        store.delete(fullKey);
+        return false;
+      }
+      return true;
+    },
+    async warm(entries) {
+      for (const entry of entries) {
+        await manager.set(entry.key, entry.value, entry.ttl);
+      }
+    },
+    getMetrics() {
+      const total = hits + misses;
+      return {
+        hits,
+        misses,
+        hitRate: total === 0 ? 0 : hits / total,
+        totalEntries: store.size,
+        evictions
+      };
+    },
+    resetMetrics() {
+      hits = 0;
+      misses = 0;
+      evictions = 0;
+    },
+    async clear() {
+      store.clear();
+    }
+  };
+  return manager;
+}
+
+// src/performance/query-cost-tracker.ts
+function createQueryCostTracker(config) {
+  let entries = [];
+  function pruneExpired() {
+    const cutoff = Date.now() - config.trackingWindowMs;
+    entries = entries.filter((e) => e.timestamp >= cutoff);
+  }
+  function computeCostPerSecond() {
+    if (entries.length === 0) return 0;
+    let totalCost = 0;
+    for (const entry of entries) {
+      totalCost += entry.actualCost;
+    }
+    const windowSeconds = config.trackingWindowMs / 1e3;
+    return totalCost / windowSeconds;
+  }
+  const tracker = {
+    config,
+    track(query, actualCost, requestedCost) {
+      entries.push({
+        query,
+        actualCost,
+        requestedCost,
+        timestamp: Date.now()
+      });
+      pruneExpired();
+    },
+    getReport() {
+      pruneExpired();
+      if (entries.length === 0) {
+        return {
+          totalCost: 0,
+          averageCost: 0,
+          maxCost: 0,
+          queryCount: 0,
+          costPerSecond: 0,
+          topQueries: [],
+          isOverBudget: false
+        };
+      }
+      let totalCost = 0;
+      let maxCost = 0;
+      for (const entry of entries) {
+        totalCost += entry.actualCost;
+        if (entry.actualCost > maxCost) {
+          maxCost = entry.actualCost;
+        }
+      }
+      const queryCount = entries.length;
+      const averageCost = totalCost / queryCount;
+      const costPerSecond = computeCostPerSecond();
+      const topQueries = [...entries].sort((a, b) => b.actualCost - a.actualCost).slice(0, 10);
+      return {
+        totalCost,
+        averageCost,
+        maxCost,
+        queryCount,
+        costPerSecond,
+        topQueries,
+        isOverBudget: costPerSecond > config.maxCostPerSecond
+      };
+    },
+    isWithinBudget() {
+      pruneExpired();
+      return computeCostPerSecond() <= config.maxCostPerSecond;
+    },
+    getCostPerSecond() {
+      pruneExpired();
+      return computeCostPerSecond();
+    },
+    reset() {
+      entries = [];
+    }
+  };
+  return tracker;
+}
+
+// src/performance/query-batcher.ts
+function createQueryBatcher(config, executor) {
+  let pending = [];
+  let timer;
+  function scheduleFlush() {
+    if (timer !== void 0) return;
+    const delay = config.maxDelayMs !== void 0 ? Math.min(config.delayMs, config.maxDelayMs) : config.delayMs;
+    timer = setTimeout(() => {
+      timer = void 0;
+      void batcher.flush();
+    }, delay);
+  }
+  function clearTimer() {
+    if (timer !== void 0) {
+      clearTimeout(timer);
+      timer = void 0;
+    }
+  }
+  const batcher = {
+    config,
+    add(query) {
+      return new Promise((resolve, reject) => {
+        pending.push({ query, resolve, reject });
+        if (pending.length >= config.maxBatchSize) {
+          clearTimer();
+          void batcher.flush();
+        } else {
+          scheduleFlush();
+        }
+      });
+    },
+    async flush() {
+      clearTimer();
+      const batch = pending;
+      pending = [];
+      if (batch.length === 0) {
+        return {
+          results: [],
+          batchSize: 0,
+          executionTimeMs: 0
+        };
+      }
+      const queries = batch.map((p) => p.query);
+      const startTime = Date.now();
+      try {
+        const results = await executor(queries);
+        const executionTimeMs = Date.now() - startTime;
+        for (let i = 0; i < batch.length; i++) {
+          const item = batch[i];
+          if (item) {
+            item.resolve(results[i]);
+          }
+        }
+        return {
+          results,
+          batchSize: batch.length,
+          executionTimeMs
+        };
+      } catch (error) {
+        for (const item of batch) {
+          item.reject(error);
+        }
+        return {
+          results: [],
+          batchSize: batch.length,
+          executionTimeMs: Date.now() - startTime
+        };
+      }
+    },
+    pending() {
+      return pending.length;
+    }
+  };
+  return batcher;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  createCacheManager,
+  createQueryBatcher,
+  createQueryCostTracker
+});
+//# sourceMappingURL=index.js.map

package/dist/performance/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/performance/index.ts","../../src/performance/cache-manager.ts","../../src/performance/query-cost-tracker.ts","../../src/performance/query-batcher.ts"],"sourcesContent":["/**\n * @uniforge/core/performance\n *\n * Core performance utilities: cache management, query cost tracking,\n * and query batching.\n */\n\nexport { createCacheManager } from './cache-manager.js';\nexport { createQueryCostTracker } from './query-cost-tracker.js';\nexport { createQueryBatcher } from './query-batcher.js';\n","/**\n * In-memory cache manager implementation.\n *\n * Provides TTL-based caching with strategy-based TTL matching,\n * LRU-style eviction, and performance metrics tracking.\n */\n\nimport type {\n  CacheManagerConfig,\n  CacheEntry,\n  CacheMetrics,\n} from '@uniforge/platform-core/performance';\nimport type { CacheManager } from '@uniforge/platform-core/performance';\n\ninterface InternalEntry<T = unknown> {\n  key: string;\n  value: T;\n  createdAt: number;\n  expiresAt: number;\n  hits: number;\n}\n\n/** Create an in-memory CacheManager. */\nexport function createCacheManager(config: CacheManagerConfig): CacheManager {\n  const store = new Map<string, InternalEntry>();\n\n  let hits = 0;\n  let misses = 0;\n  let evictions = 0;\n\n  function resolveTTL(key: string, ttlOverride?: number): number {\n    if (ttlOverride !== undefined) return ttlOverride;\n\n    if (config.strategies !== undefined) {\n      for (const strategy of config.strategies) {\n        if (key.startsWith(strategy.pattern)) {\n          return strategy.ttl;\n        }\n      }\n    }\n\n    return config.defaultTTL;\n  }\n\n  function prefixKey(key: string): string {\n    if (config.keyPrefix !== undefined) {\n      return `${config.keyPrefix}:${key}`;\n    }\n    return key;\n  }\n\n  function isExpired(entry: InternalEntry): boolean {\n    return Date.now() >= entry.expiresAt;\n  }\n\n  function evictOldest(): void {\n    // Evict the oldest entry by createdAt\n    let oldestKey: string | undefined;\n    let oldestTime = Infinity;\n\n    for (const [k, v] of store) {\n      if (v.createdAt < oldestTime) {\n        oldestTime = v.createdAt;\n        oldestKey = k;\n      }\n    }\n\n    if (oldestKey !== undefined) {\n      store.delete(oldestKey);\n      evictions++;\n    }\n  }\n\n  const manager: CacheManager = {\n    config,\n\n    async get<T = unknown>(key: string): Promise<CacheEntry<T> | undefined> {\n      const fullKey = prefixKey(key);\n      const entry = store.get(fullKey) as InternalEntry<T> | undefined;\n\n      if (!entry) {\n        misses++;\n        return undefined;\n      }\n\n      if (isExpired(entry)) {\n        store.delete(fullKey);\n        misses++;\n        return undefined;\n      }\n\n      entry.hits++;\n      hits++;\n\n      return {\n        key: entry.key,\n        value: entry.value,\n        createdAt: entry.createdAt,\n        expiresAt: entry.expiresAt,\n        hits: entry.hits,\n      };\n    },\n\n    async set<T = unknown>(key: string, value: T, ttl?: number): Promise<void> {\n      const fullKey = prefixKey(key);\n      const resolvedTTL = resolveTTL(key, ttl);\n      const now = Date.now();\n\n      // If the key already exists, update in place (no eviction needed)\n      if (!store.has(fullKey) && store.size >= config.maxEntries) {\n        evictOldest();\n      }\n\n      const entry: InternalEntry<T> = {\n        key,\n        value,\n        createdAt: now,\n        expiresAt: now + resolvedTTL,\n        hits: 0,\n      };\n\n      store.set(fullKey, entry as InternalEntry);\n    },\n\n    async delete(key: string): Promise<boolean> {\n      const fullKey = prefixKey(key);\n      return store.delete(fullKey);\n    },\n\n    async invalidate(pattern: string): Promise<number> {\n      let count = 0;\n      const prefixed = prefixKey(pattern);\n\n      for (const key of [...store.keys()]) {\n        if (key.startsWith(prefixed)) {\n          store.delete(key);\n          count++;\n        }\n      }\n\n      return count;\n    },\n\n    async has(key: string): Promise<boolean> {\n      const fullKey = prefixKey(key);\n      const entry = store.get(fullKey);\n\n      if (!entry) return false;\n\n      if (isExpired(entry)) {\n        store.delete(fullKey);\n        return false;\n      }\n\n      return true;\n    },\n\n    async warm(entries: Array<{ key: string; value: unknown; ttl?: number }>): Promise<void> {\n      for (const entry of entries) {\n        await manager.set(entry.key, entry.value, entry.ttl);\n      }\n    },\n\n    getMetrics(): CacheMetrics {\n      const total = hits + misses;\n      return {\n        hits,\n        misses,\n        hitRate: total === 0 ? 0 : hits / total,\n        totalEntries: store.size,\n        evictions,\n      };\n    },\n\n    resetMetrics(): void {\n      hits = 0;\n      misses = 0;\n      evictions = 0;\n    },\n\n    async clear(): Promise<void> {\n      store.clear();\n    },\n  };\n\n  return manager;\n}\n","/**\n * Query cost tracker implementation.\n *\n * Tracks GraphQL query costs within a sliding time window\n * and provides budget monitoring to prevent API throttling.\n */\n\nimport type {\n  QueryCostConfig,\n  QueryCostEntry,\n  QueryCostReport,\n} from '@uniforge/platform-core/performance';\nimport type { QueryCostTracker } from '@uniforge/platform-core/performance';\n\n/** Create a QueryCostTracker that monitors query costs within a sliding window. */\nexport function createQueryCostTracker(config: QueryCostConfig): QueryCostTracker {\n  let entries: QueryCostEntry[] = [];\n\n  function pruneExpired(): void {\n    const cutoff = Date.now() - config.trackingWindowMs;\n    entries = entries.filter((e) => e.timestamp >= cutoff);\n  }\n\n  function computeCostPerSecond(): number {\n    if (entries.length === 0) return 0;\n\n    let totalCost = 0;\n    for (const entry of entries) {\n      totalCost += entry.actualCost;\n    }\n\n    const windowSeconds = config.trackingWindowMs / 1000;\n    return totalCost / windowSeconds;\n  }\n\n  const tracker: QueryCostTracker = {\n    config,\n\n    track(query: string, actualCost: number, requestedCost: number): void {\n      entries.push({\n        query,\n        actualCost,\n        requestedCost,\n        timestamp: Date.now(),\n      });\n\n      pruneExpired();\n    },\n\n    getReport(): QueryCostReport {\n      pruneExpired();\n\n      if (entries.length === 0) {\n        return {\n          totalCost: 0,\n          averageCost: 0,\n          maxCost: 0,\n          queryCount: 0,\n          costPerSecond: 0,\n          topQueries: [],\n          isOverBudget: false,\n        };\n      }\n\n      let totalCost = 0;\n      let maxCost = 0;\n\n      for (const entry of entries) {\n        totalCost += entry.actualCost;\n        if (entry.actualCost > maxCost) {\n          maxCost = entry.actualCost;\n        }\n      }\n\n      const queryCount = entries.length;\n      const averageCost = totalCost / queryCount;\n      const costPerSecond = computeCostPerSecond();\n\n      // Top queries sorted by actualCost descending, take top 10\n      const topQueries = [...entries]\n        .sort((a, b) => b.actualCost - a.actualCost)\n        .slice(0, 10);\n\n      return {\n        totalCost,\n        averageCost,\n        maxCost,\n        queryCount,\n        costPerSecond,\n        topQueries,\n        isOverBudget: costPerSecond > config.maxCostPerSecond,\n      };\n    },\n\n    isWithinBudget(): boolean {\n      pruneExpired();\n      return computeCostPerSecond() <= config.maxCostPerSecond;\n    },\n\n    getCostPerSecond(): number {\n      pruneExpired();\n      return computeCostPerSecond();\n    },\n\n    reset(): void {\n      entries = [];\n    },\n  };\n\n  return tracker;\n}\n","/**\n * Query batcher implementation.\n *\n * Collects individual queries into batches and executes them together,\n * reducing the number of API round-trips. Batches are flushed either\n * when they reach the configured size or after a delay timeout.\n */\n\nimport type { BatchConfig, BatchResult } from '@uniforge/platform-core/performance';\nimport type { QueryBatcher } from '@uniforge/platform-core/performance';\n\ninterface PendingQuery<TQuery, TResult> {\n  query: TQuery;\n  resolve: (result: TResult) => void;\n  reject: (error: unknown) => void;\n}\n\n/** Create a QueryBatcher that groups queries and executes them in batches. */\nexport function createQueryBatcher<TQuery, TResult>(\n  config: BatchConfig,\n  executor: (queries: TQuery[]) => Promise<TResult[]>,\n): QueryBatcher<TQuery, TResult> {\n  let pending: Array<PendingQuery<TQuery, TResult>> = [];\n  let timer: ReturnType<typeof setTimeout> | undefined;\n\n  function scheduleFlush(): void {\n    if (timer !== undefined) return;\n\n    const delay = config.maxDelayMs !== undefined\n      ? Math.min(config.delayMs, config.maxDelayMs)\n      : config.delayMs;\n\n    timer = setTimeout(() => {\n      timer = undefined;\n      void batcher.flush();\n    }, delay);\n  }\n\n  function clearTimer(): void {\n    if (timer !== undefined) {\n      clearTimeout(timer);\n      timer = undefined;\n    }\n  }\n\n  const batcher: QueryBatcher<TQuery, TResult> = {\n    config,\n\n    add(query: TQuery): Promise<TResult> {\n      return new Promise<TResult>((resolve, reject) => {\n        pending.push({ query, resolve, reject });\n\n        if (pending.length >= config.maxBatchSize) {\n          clearTimer();\n          void batcher.flush();\n        } else {\n          scheduleFlush();\n        }\n      });\n    },\n\n    async flush(): Promise<BatchResult<TResult>> {\n      clearTimer();\n\n      const batch = pending;\n      pending = [];\n\n      if (batch.length === 0) {\n        return {\n          results: [],\n          batchSize: 0,\n          executionTimeMs: 0,\n        };\n      }\n\n      const queries = batch.map((p) => p.query);\n      const startTime = Date.now();\n\n      try {\n        const results = await executor(queries);\n        const executionTimeMs = Date.now() - startTime;\n\n        for (let i = 0; i < batch.length; i++) {\n          const item = batch[i];\n          if (item) {\n            item.resolve(results[i] as TResult);\n          }\n        }\n\n        return {\n          results,\n          batchSize: batch.length,\n          executionTimeMs,\n        };\n      } catch (error) {\n        for (const item of batch) {\n          item.reject(error);\n        }\n\n        return {\n          results: [],\n          batchSize: batch.length,\n          executionTimeMs: Date.now() - startTime,\n        };\n      }\n    },\n\n    pending(): number {\n      return pending.length;\n    },\n  };\n\n  return batcher;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACuBO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,QAAQ,oBAAI,IAA2B;AAE7C,MAAI,OAAO;AACX,MAAI,SAAS;AACb,MAAI,YAAY;AAEhB,WAAS,WAAW,KAAa,aAA8B;AAC7D,QAAI,gBAAgB,OAAW,QAAO;AAEtC,QAAI,OAAO,eAAe,QAAW;AACnC,iBAAW,YAAY,OAAO,YAAY;AACxC,YAAI,IAAI,WAAW,SAAS,OAAO,GAAG;AACpC,iBAAO,SAAS;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,OAAO;AAAA,EAChB;AAEA,WAAS,UAAU,KAAqB;AACtC,QAAI,OAAO,cAAc,QAAW;AAClC,aAAO,GAAG,OAAO,SAAS,IAAI,GAAG;AAAA,IACnC;AACA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,OAA+B;AAChD,WAAO,KAAK,IAAI,KAAK,MAAM;AAAA,EAC7B;AAEA,WAAS,cAAoB;AAE3B,QAAI;AACJ,QAAI,aAAa;AAEjB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC1B,UAAI,EAAE,YAAY,YAAY;AAC5B,qBAAa,EAAE;AACf,oBAAY;AAAA,MACd;AAAA,IACF;AAEA,QAAI,cAAc,QAAW;AAC3B,YAAM,OAAO,SAAS;AACtB;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAwB;AAAA,IAC5B;AAAA,IAEA,MAAM,IAAiB,KAAiD;AACtE,YAAM,UAAU,UAAU,GAAG;AAC7B,YAAM,QAAQ,MAAM,IAAI,OAAO;AAE/B,UAAI,CAAC,OAAO;AACV;AACA,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,KAAK,GAAG;AACpB,cAAM,OAAO,OAAO;AACpB;AACA,eAAO;AAAA,MACT;AAEA,YAAM;AACN;AAEA,aAAO;AAAA,QACL,KAAK,MAAM;AAAA,QACX,OAAO,MAAM;AAAA,QACb,WAAW,MAAM;AAAA,QACjB,WAAW,MAAM;AAAA,QACjB,MAAM,MAAM;AAAA,MACd;AAAA,IACF;AAAA,IAEA,MAAM,IAAiB,KAAa,OAAU,KAA6B;AACzE,YAAM,UAAU,UAAU,GAAG;AAC7B,YAAM,cAAc,WAAW,KAAK,GAAG;AACvC,YAAM,MAAM,KAAK,IAAI;AAGrB,UAAI,CAAC,MAAM,IAAI,OAAO,KAAK,MAAM,QAAQ,OAAO,YAAY;AAC1D,oBAAY;AAAA,MACd;AAEA,YAAM,QAA0B;AAAA,QAC9B;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX,WAAW,MAAM;AAAA,QACjB,MAAM;AAAA,MACR;AAEA,YAAM,IAAI,SAAS,KAAsB;AAAA,IAC3C;AAAA,IAEA,MAAM,OAAO,KAA+B;AAC1C,YAAM,UAAU,UAAU,GAAG;AAC7B,aAAO,MAAM,OAAO,OAAO;AAAA,IAC7B;AAAA,IAEA,MAAM,WAAW,SAAkC;AACjD,UAAI,QAAQ;AACZ,YAAM,WAAW,UAAU,OAAO;AAElC,iBAAW,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,GAAG;AACnC,YAAI,IAAI,WAAW,QAAQ,GAAG;AAC5B,gBAAM,OAAO,GAAG;AAChB;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,IAEA,MAAM,IAAI,KAA+B;AACvC,YAAM,UAAU,UAAU,GAAG;AAC7B,YAAM,QAAQ,MAAM,IAAI,OAAO;AAE/B,UAAI,CAAC,MAAO,QAAO;AAEnB,UAAI,UAAU,KAAK,GAAG;AACpB,cAAM,OAAO,OAAO;AACpB,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAAA,IAEA,MAAM,KAAK,SAA8E;AACvF,iBAAW,SAAS,SAAS;AAC3B,cAAM,QAAQ,IAAI,MAAM,KAAK,MAAM,OAAO,MAAM,GAAG;AAAA,MACrD;AAAA,IACF;AAAA,IAEA,aAA2B;AACzB,YAAM,QAAQ,OAAO;AACrB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,SAAS,UAAU,IAAI,IAAI,OAAO;AAAA,QAClC,cAAc,MAAM;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAAA,IAEA,eAAqB;AACnB,aAAO;AACP,eAAS;AACT,kBAAY;AAAA,IACd;AAAA,IAEA,MAAM,QAAuB;AAC3B,YAAM,MAAM;AAAA,IACd;AAAA,EACF;AAEA,SAAO;AACT;;;AC3KO,SAAS,uBAAuB,QAA2C;AAChF,MAAI,UAA4B,CAAC;AAEjC,WAAS,eAAqB;AAC5B,UAAM,SAAS,KAAK,IAAI,IAAI,OAAO;AACnC,cAAU,QAAQ,OAAO,CAAC,MAAM,EAAE,aAAa,MAAM;AAAA,EACvD;AAEA,WAAS,uBAA+B;AACtC,QAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAI,YAAY;AAChB,eAAW,SAAS,SAAS;AAC3B,mBAAa,MAAM;AAAA,IACrB;AAEA,UAAM,gBAAgB,OAAO,mBAAmB;AAChD,WAAO,YAAY;AAAA,EACrB;AAEA,QAAM,UAA4B;AAAA,IAChC;AAAA,IAEA,MAAM,OAAe,YAAoB,eAA6B;AACpE,cAAQ,KAAK;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA,WAAW,KAAK,IAAI;AAAA,MACtB,CAAC;AAED,mBAAa;AAAA,IACf;AAAA,IAEA,YAA6B;AAC3B,mBAAa;AAEb,UAAI,QAAQ,WAAW,GAAG;AACxB,eAAO;AAAA,UACL,WAAW;AAAA,UACX,aAAa;AAAA,UACb,SAAS;AAAA,UACT,YAAY;AAAA,UACZ,eAAe;AAAA,UACf,YAAY,CAAC;AAAA,UACb,cAAc;AAAA,QAChB;AAAA,MACF;AAEA,UAAI,YAAY;AAChB,UAAI,UAAU;AAEd,iBAAW,SAAS,SAAS;AAC3B,qBAAa,MAAM;AACnB,YAAI,MAAM,aAAa,SAAS;AAC9B,oBAAU,MAAM;AAAA,QAClB;AAAA,MACF;AAEA,YAAM,aAAa,QAAQ;AAC3B,YAAM,cAAc,YAAY;AAChC,YAAM,gBAAgB,qBAAqB;AAG3C,YAAM,aAAa,CAAC,GAAG,OAAO,EAC3B,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU,EAC1C,MAAM,GAAG,EAAE;AAEd,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,cAAc,gBAAgB,OAAO;AAAA,MACvC;AAAA,IACF;AAAA,IAEA,iBAA0B;AACxB,mBAAa;AACb,aAAO,qBAAqB,KAAK,OAAO;AAAA,IAC1C;AAAA,IAEA,mBAA2B;AACzB,mBAAa;AACb,aAAO,qBAAqB;AAAA,IAC9B;AAAA,IAEA,QAAc;AACZ,gBAAU,CAAC;AAAA,IACb;AAAA,EACF;AAEA,SAAO;AACT;;;AC5FO,SAAS,mBACd,QACA,UAC+B;AAC/B,MAAI,UAAgD,CAAC;AACrD,MAAI;AAEJ,WAAS,gBAAsB;AAC7B,QAAI,UAAU,OAAW;AAEzB,UAAM,QAAQ,OAAO,eAAe,SAChC,KAAK,IAAI,OAAO,SAAS,OAAO,UAAU,IAC1C,OAAO;AAEX,YAAQ,WAAW,MAAM;AACvB,cAAQ;AACR,WAAK,QAAQ,MAAM;AAAA,IACrB,GAAG,KAAK;AAAA,EACV;AAEA,WAAS,aAAmB;AAC1B,QAAI,UAAU,QAAW;AACvB,mBAAa,KAAK;AAClB,cAAQ;AAAA,IACV;AAAA,EACF;AAEA,QAAM,UAAyC;AAAA,IAC7C;AAAA,IAEA,IAAI,OAAiC;AACnC,aAAO,IAAI,QAAiB,CAAC,SAAS,WAAW;AAC/C,gBAAQ,KAAK,EAAE,OAAO,SAAS,OAAO,CAAC;AAEvC,YAAI,QAAQ,UAAU,OAAO,cAAc;AACzC,qBAAW;AACX,eAAK,QAAQ,MAAM;AAAA,QACrB,OAAO;AACL,wBAAc;AAAA,QAChB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,MAAM,QAAuC;AAC3C,iBAAW;AAEX,YAAM,QAAQ;AACd,gBAAU,CAAC;AAEX,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO;AAAA,UACL,SAAS,CAAC;AAAA,UACV,WAAW;AAAA,UACX,iBAAiB;AAAA,QACnB;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,IAAI,CAAC,MAAM,EAAE,KAAK;AACxC,YAAM,YAAY,KAAK,IAAI;AAE3B,UAAI;AACF,cAAM,UAAU,MAAM,SAAS,OAAO;AACtC,cAAM,kBAAkB,KAAK,IAAI,IAAI;AAErC,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,OAAO,MAAM,CAAC;AACpB,cAAI,MAAM;AACR,iBAAK,QAAQ,QAAQ,CAAC,CAAY;AAAA,UACpC;AAAA,QACF;AAEA,eAAO;AAAA,UACL;AAAA,UACA,WAAW,MAAM;AAAA,UACjB;AAAA,QACF;AAAA,MACF,SAAS,OAAO;AACd,mBAAW,QAAQ,OAAO;AACxB,eAAK,OAAO,KAAK;AAAA,QACnB;AAEA,eAAO;AAAA,UACL,SAAS,CAAC;AAAA,UACV,WAAW,MAAM;AAAA,UACjB,iBAAiB,KAAK,IAAI,IAAI;AAAA,QAChC;AAAA,MACF;AAAA,IACF;AAAA,IAEA,UAAkB;AAChB,aAAO,QAAQ;AAAA,IACjB;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}