@getworkbench/core 0.3.0 → 0.3.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (9) hide show
  1. package/dist/hono.d.ts +1 -1
  2. package/dist/index.d.ts +2 -2
  3. package/dist/index.js +60 -22
  4. package/dist/index.js.map +1 -1
  5. package/dist/ui/assets/index.css +1 -1
  6. package/dist/ui/assets/index.js +73 -73
  7. package/dist/{workbench-CRdU4cB7.d.ts → workbench-Btnvit1t.d.ts} +5 -1
  8. package/package.json +2 -2
  9. package/dist/workbench-DMfd1JuA.d.ts +0 -692
package/dist/index.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/core/discover.ts","../src/core/queue-manager.ts","../src/core/workbench.ts","../src/api/fetch-handler.ts","../src/server/basic-auth.ts"],"sourcesContent":["import { Queue, type RedisOptions } from \"bullmq\";\nimport { Redis } from \"ioredis\";\n\n/**\n * Discover BullMQ queues on a Redis connection by scanning for `<prefix>:*:meta`\n * keys. Returns one `Queue` instance per discovered queue, each constructed\n * with a fresh clone of the connection options.\n *\n * Used by `WorkbenchCore.fromOptions` for the desktop client where the user\n * supplies a Redis URL but no explicit queue list.\n */\nexport async function discoverQueues(\n connection: string | RedisOptions,\n prefix = \"bull\",\n): Promise<Queue[]> {\n const normalized = normalizeConnection(connection);\n const client = createScanClient(normalized);\n\n // Surface the underlying connection error (ECONNREFUSED, NOAUTH, EAI_AGAIN,\n // ENOTFOUND, TLS errors, etc.) rather than letting ioredis bury it under a\n // \"max retries per request\" wrapper. We swap the first error in via the\n // event listener and reject the ping promise with it.\n const firstError = captureFirstError(client);\n\n try {\n await Promise.race([client.ping(), firstError.promise]);\n const names = await scanQueueNames(client, prefix);\n return names.map(\n (name) =>\n new Queue(name, {\n connection: { ...normalized },\n prefix,\n }),\n );\n } finally {\n firstError.dispose();\n client.disconnect();\n }\n}\n\nfunction captureFirstError(client: Redis): {\n promise: Promise<never>;\n dispose: () => void;\n} {\n let onError: ((err: Error) => void) | null = null;\n const promise = new Promise<never>((_, reject) => {\n onError = (err) => reject(err);\n client.once(\"error\", onError);\n });\n // Swallow further errors after the first so ioredis doesn't kill the\n // process with an \"unhandled error event\" once we've already rejected.\n client.on(\"error\", () => {});\n return {\n promise,\n dispose: () => {\n if (onError) client.off(\"error\", onError);\n },\n };\n}\n\n/**\n * Normalize a `string | RedisOptions` connection into a single `RedisOptions`\n * shape with `{ url }` (when a URL string was passed). BullMQ's `Queue`\n * accepts `{ url: \"redis://...\" }` but not a bare URL string, so this is the\n * canonical adapter form.\n */\nfunction normalizeConnection(\n connection: string | RedisOptions,\n): RedisOptions & { url?: string } {\n if (typeof connection === \"string\") {\n return { url: connection } as RedisOptions & { url?: string };\n }\n return { ...connection };\n}\n\nfunction createScanClient(opts: RedisOptions & { url?: string }): Redis {\n // ioredis accepts the `url` field directly via its constructor; we pass it\n // explicitly to make the `bun build --compile` static analysis happy.\n const { url, ...rest } = opts;\n if (url) {\n return new Redis(url, {\n ...rest,\n lazyConnect: false,\n maxRetriesPerRequest: 1,\n });\n }\n return new Redis({ ...rest, lazyConnect: false, maxRetriesPerRequest: 1 });\n}\n\n/**\n * Cursored SCAN for `<prefix>:*:meta` keys. BullMQ writes a meta key for each\n * queue on first use; using that as the discovery signal avoids matching\n * jobs, locks, or other namespaced sub-keys.\n */\nasync function scanQueueNames(\n client: Redis,\n prefix: string,\n): Promise<string[]> {\n const pattern = `${prefix}:*:meta`;\n const names = new Set<string>();\n let cursor = \"0\";\n\n do {\n const [next, batch] = await client.scan(\n cursor,\n \"MATCH\",\n pattern,\n \"COUNT\",\n 500,\n );\n cursor = next;\n for (const key of batch) {\n const name = parseQueueName(key, prefix);\n if (name) names.add(name);\n }\n } while (cursor !== \"0\");\n\n return Array.from(names).sort();\n}\n\nfunction parseQueueName(key: string, prefix: string): string | null {\n const head = `${prefix}:`;\n const tail = \":meta\";\n if (!key.startsWith(head) || !key.endsWith(tail)) return null;\n return key.slice(head.length, key.length - tail.length);\n}\n","import { FlowProducer, type Job, type Queue } from \"bullmq\";\nimport { LRUCache } from \"lru-cache\";\nimport type {\n ActivityBucket,\n ActivityStatsResponse,\n CreateFlowChildRequest,\n CreateFlowRequest,\n DelayedJobInfo,\n FlowNode,\n FlowSummary,\n HourlyBucket,\n JobInfo,\n JobStatus,\n JobTags,\n MetricsResponse,\n OverviewStats,\n PaginatedResponse,\n QueueInfo,\n RunInfo,\n RunInfoList,\n SchedulerInfo,\n SearchResult,\n SortOptions,\n TestJobRequest,\n} from \"./types\";\n\n/**\n * Manages queue operations for the Workbench dashboard\n */\nexport class QueueManager {\n private queues: Map<string, Queue> = new Map();\n private tagFields: string[] = [];\n private flowProducer: FlowProducer | null = null;\n\n // LRU cache for expensive operations\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n private cache = new LRUCache<string, any>({\n max: 100, // Max 100 entries\n ttl: 1000 * 60, // Default 1 minute TTL\n allowStale: false, // Don't return stale entries\n updateAgeOnGet: true, // Reset TTL on access\n });\n\n private readonly CACHE_TTL = {\n metrics: 5 * 60 * 1000, // 5 minutes - metrics are expensive\n overview: 2 * 60 * 1000, // 2 minutes\n queues: 2 * 60 * 1000, // 2 minutes\n flows: 2 * 60 * 1000, // 2 minutes\n activity: 5 * 60 * 1000, // 5 minutes - activity timeline\n };\n\n constructor(queues: Queue[], tagFields: string[] = []) {\n for (const queue of queues) {\n this.queues.set(queue.name, queue);\n }\n this.tagFields = tagFields;\n\n // Initialize FlowProducer using connection from first queue\n const firstQueue = queues[0];\n if (firstQueue) {\n const connection = firstQueue.opts?.connection;\n if (connection) {\n this.flowProducer = new FlowProducer({ connection });\n }\n }\n }\n\n /**\n * Get cached value or compute and cache\n */\n private async cached<T>(\n key: string,\n ttl: number,\n compute: () => Promise<T>,\n ): Promise<T> {\n const cached = this.cache.get(key);\n if (cached !== undefined) {\n return cached as T;\n }\n\n const data = await compute();\n this.cache.set(key, data, { ttl });\n return data;\n }\n\n /**\n * Execute a promise with a timeout\n */\n private async withTimeout<T>(\n promise: Promise<T>,\n timeoutMs: number,\n errorMessage: string,\n ): Promise<T> {\n let timeoutId: ReturnType<typeof setTimeout> | undefined;\n\n const timeoutPromise = new Promise<T>((_, reject) => {\n timeoutId = setTimeout(() => reject(new Error(errorMessage)), timeoutMs);\n });\n\n try {\n return await Promise.race([promise, timeoutPromise]);\n } finally {\n clearTimeout(timeoutId);\n }\n }\n\n /**\n * Get jobs by time range using Redis sorted sets (ZRANGEBYSCORE)\n * This is more efficient than fetching all jobs and filtering in memory\n */\n private async getJobsByTimeRange(\n queue: Queue,\n status: \"completed\" | \"failed\",\n startTime: number,\n endTime: number,\n limit: number,\n ): Promise<Job[]> {\n try {\n // Access BullMQ's Redis client\n const client = (queue as any).client;\n if (!client) {\n // Fallback to regular getJobs if client not available\n const jobs = await queue.getJobs([status], 0, limit * 2);\n return jobs.filter(\n (job) =>\n job.finishedOn &&\n job.finishedOn >= startTime &&\n job.finishedOn <= endTime,\n );\n }\n\n // BullMQ stores jobs in sorted sets: bull:queueName:completed, bull:queueName:failed\n // The score is the finishedOn timestamp\n const queueKey = `bull:${queue.name}:${status}`;\n const jobIds = await client.zrangebyscore(\n queueKey,\n startTime,\n endTime,\n \"LIMIT\",\n 0,\n limit,\n );\n\n if (!jobIds || jobIds.length === 0) {\n return [];\n }\n\n // Fetch job data for the IDs in parallel\n const jobPromises = jobIds.map((jobId: string) => queue.getJob(jobId));\n const jobs = await Promise.all(jobPromises);\n\n // Filter out null/undefined results\n return jobs.filter(\n (job): job is Job => job !== null && job !== undefined,\n );\n } catch (_error) {\n // Fallback to regular getJobs on error\n const jobs = await queue.getJobs([status], 0, limit * 2);\n return jobs.filter(\n (job) =>\n job.finishedOn &&\n job.finishedOn >= startTime &&\n job.finishedOn <= endTime,\n );\n }\n }\n\n /**\n * Cache for job state lookups to avoid repeated Redis calls\n */\n private jobStateCache = new LRUCache<string, JobStatus>({\n max: 1000,\n ttl: 1000 * 30, // 30 second TTL - job states don't change frequently\n });\n\n /**\n * Cache for job counts to avoid repeated Redis calls\n * Short TTL since counts change frequently but are expensive to fetch\n */\n private countCache = new LRUCache<\n string,\n Awaited<ReturnType<Queue[\"getJobCounts\"]>>\n >({\n max: 100, // Cache counts for up to 100 queues\n ttl: 1000 * 5, // 5 second TTL - counts change but not instantly\n });\n\n /**\n * Get job counts with caching\n */\n private async getCachedJobCounts(\n queue: Queue,\n ): Promise<Awaited<ReturnType<Queue[\"getJobCounts\"]>>> {\n const cacheKey = queue.name;\n const cached = this.countCache.get(cacheKey);\n if (cached !== undefined) {\n return cached;\n }\n\n const counts = await queue.getJobCounts();\n this.countCache.set(cacheKey, counts);\n return counts;\n }\n\n /**\n * Invalidate caches related to a job or queue\n */\n private invalidateJobCache(queueName: string, jobId?: string): void {\n // Invalidate count cache for the queue\n this.countCache.delete(queueName);\n\n // Invalidate job state cache if jobId provided\n if (jobId) {\n const stateCacheKey = `${queueName}:${jobId}`;\n this.jobStateCache.delete(stateCacheKey);\n }\n\n // Invalidate main cache entries that might be affected\n // These are expensive to recompute, so we invalidate them\n // to ensure accuracy after mutations\n this.cache.delete(\"metrics\");\n this.cache.delete(\"overview\");\n this.cache.delete(\"activity\");\n }\n\n /**\n * Clear cache (useful after mutations)\n */\n clearCache(prefix?: string): void {\n if (prefix) {\n for (const key of this.cache.keys()) {\n if (key.startsWith(prefix)) {\n this.cache.delete(key);\n }\n }\n } else {\n this.cache.clear();\n }\n }\n\n /**\n * Get quick job counts across all queues (lightweight, for smart polling)\n * Returns total counts per status - cached and very fast\n */\n async getQuickCounts(): Promise<{\n waiting: number;\n active: number;\n completed: number;\n failed: number;\n delayed: number;\n total: number;\n timestamp: number;\n }> {\n // Use short cache for counts - they change frequently\n return this.cached(\"quick-counts\", 2000, async () => {\n const totals = {\n waiting: 0,\n active: 0,\n completed: 0,\n failed: 0,\n delayed: 0,\n total: 0,\n timestamp: Date.now(),\n };\n\n await Promise.all(\n Array.from(this.queues.values()).map(async (queue) => {\n const counts = await this.getCachedJobCounts(queue);\n totals.waiting += counts.waiting || 0;\n totals.active += counts.active || 0;\n totals.completed += counts.completed || 0;\n totals.failed += counts.failed || 0;\n totals.delayed += counts.delayed || 0;\n }),\n );\n\n totals.total =\n totals.waiting +\n totals.active +\n totals.completed +\n totals.failed +\n totals.delayed;\n\n return totals;\n });\n }\n\n /**\n * Get configured tag field names\n */\n getTagFields(): string[] {\n return this.tagFields;\n }\n\n /**\n * Get just queue names (very fast, no Redis calls)\n * Used for sidebar initial render\n */\n getQueueNames(): string[] {\n return Array.from(this.queues.keys());\n }\n\n /**\n * Get a queue by name\n */\n getQueue(name: string): Queue | undefined {\n return this.queues.get(name);\n }\n\n /**\n * Get information for all queues (cached)\n */\n async getQueues(): Promise<QueueInfo[]> {\n return this.cached(\"queues\", this.CACHE_TTL.queues, async () => {\n // Parallelize queue info fetching\n const queueEntries = Array.from(this.queues.entries());\n const results = await Promise.all(\n queueEntries.map(async ([name, queue]) => {\n const [counts, isPaused] = await Promise.all([\n this.getCachedJobCounts(queue),\n queue.isPaused(),\n ]);\n\n return {\n name,\n counts: {\n waiting: counts.waiting || 0,\n active: counts.active || 0,\n completed: counts.completed || 0,\n failed: counts.failed || 0,\n delayed: counts.delayed || 0,\n paused: counts.paused || 0,\n },\n isPaused,\n };\n }),\n );\n\n return results;\n });\n }\n\n /**\n * Get overview statistics (cached)\n */\n async getOverview(): Promise<OverviewStats> {\n return this.cached(\"overview\", this.CACHE_TTL.overview, async () => {\n const queues = await this.getQueues();\n\n let totalJobs = 0;\n let activeJobs = 0;\n let failedJobs = 0;\n\n for (const queue of queues) {\n totalJobs +=\n queue.counts.waiting + queue.counts.active + queue.counts.delayed;\n activeJobs += queue.counts.active;\n failedJobs += queue.counts.failed;\n }\n\n // Get completed jobs from today (approximation based on completed count)\n const completedToday = queues.reduce(\n (sum, q) => sum + q.counts.completed,\n 0,\n );\n\n return {\n totalJobs,\n activeJobs,\n failedJobs,\n completedToday,\n avgDuration: 0, // Would need metrics tracking\n queues,\n };\n });\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Queue Control (Pause/Resume)\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Pause a queue - stops processing new jobs\n */\n async pauseQueue(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n await queue.pause();\n }\n\n /**\n * Resume a paused queue\n */\n async resumeQueue(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n await queue.resume();\n }\n\n /**\n * Check if a queue is paused\n */\n async isQueuePaused(queueName: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n return queue.isPaused();\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Metrics\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Get metrics for the last 24 hours (cached - expensive operation)\n */\n async getMetrics(): Promise<MetricsResponse> {\n return this.cached(\"metrics\", this.CACHE_TTL.metrics, async () => {\n return this.withTimeout(\n (async () => {\n const now = Date.now();\n const twentyFourHoursAgo = now - 24 * 60 * 60 * 1000;\n\n // Initialize hourly buckets for last 24 hours\n const createEmptyBuckets = (): HourlyBucket[] => {\n const buckets: HourlyBucket[] = [];\n const startHour =\n Math.floor(twentyFourHoursAgo / (60 * 60 * 1000)) *\n (60 * 60 * 1000);\n for (let i = 0; i < 24; i++) {\n buckets.push({\n hour: startHour + i * 60 * 60 * 1000,\n completed: 0,\n failed: 0,\n avgDuration: 0,\n avgWaitTime: 0,\n });\n }\n return buckets;\n };\n\n const queueMetricsMap = new Map<\n string,\n {\n buckets: HourlyBucket[];\n durations: number[][];\n waitTimes: number[][];\n }\n >();\n\n // Initialize per-queue metrics\n for (const queueName of this.queues.keys()) {\n queueMetricsMap.set(queueName, {\n buckets: createEmptyBuckets(),\n durations: Array.from({ length: 24 }, () => []),\n waitTimes: Array.from({ length: 24 }, () => []),\n });\n }\n\n // Track slowest jobs and failing job types\n const allJobs: Array<{\n name: string;\n queueName: string;\n duration: number;\n jobId: string;\n }> = [];\n const jobTypeStats = new Map<\n string,\n {\n name: string;\n queueName: string;\n completed: number;\n failed: number;\n }\n >();\n\n // Fetch completed and failed jobs from each queue IN PARALLEL\n // Use time-based filtering to only get jobs within the 24-hour window\n const queueEntries = Array.from(this.queues.entries());\n\n // First, check which queues have relevant jobs using getJobCounts\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n return {\n queueName,\n queue,\n hasRelevantJobs:\n (counts.completed || 0) > 0 || (counts.failed || 0) > 0,\n };\n }),\n );\n\n // Only process queues with relevant jobs\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queueName, queue }) => {\n // Use time-based filtering - only fetch jobs within the 24-hour window\n // Reduced limit since we're filtering by time in Redis\n const [completedJobs, failedJobs] = await Promise.all([\n this.getJobsByTimeRange(\n queue,\n \"completed\",\n twentyFourHoursAgo,\n now,\n 100, // Reduced from 200 - only recent jobs needed\n ),\n this.getJobsByTimeRange(\n queue,\n \"failed\",\n twentyFourHoursAgo,\n now,\n 100, // Reduced from 200 - only recent jobs needed\n ),\n ]);\n return { queueName, completedJobs, failedJobs };\n }),\n );\n\n // Process results\n for (const { queueName, completedJobs, failedJobs } of queueResults) {\n const metrics = queueMetricsMap.get(queueName)!;\n\n // Process completed jobs\n for (const job of completedJobs) {\n if (!job?.finishedOn || job.finishedOn < twentyFourHoursAgo)\n continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - (metrics.buckets[0]?.hour || 0)) /\n (60 * 60 * 1000),\n );\n if (bucketIndex >= 0 && bucketIndex < 24) {\n metrics.buckets[bucketIndex].completed++;\n\n const duration = job.processedOn\n ? job.finishedOn - job.processedOn\n : 0;\n const waitTime = job.processedOn\n ? job.processedOn - job.timestamp\n : 0;\n\n if (duration > 0) {\n metrics.durations[bucketIndex].push(duration);\n allJobs.push({\n name: job.name,\n queueName,\n duration,\n jobId: job.id || \"\",\n });\n }\n if (waitTime > 0) {\n metrics.waitTimes[bucketIndex].push(waitTime);\n }\n }\n\n // Track job type stats\n const key = `${queueName}:${job.name}`;\n const stats = jobTypeStats.get(key) || {\n name: job.name,\n queueName,\n completed: 0,\n failed: 0,\n };\n stats.completed++;\n jobTypeStats.set(key, stats);\n }\n\n // Process failed jobs\n for (const job of failedJobs) {\n if (!job?.finishedOn || job.finishedOn < twentyFourHoursAgo)\n continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - (metrics.buckets[0]?.hour || 0)) /\n (60 * 60 * 1000),\n );\n if (bucketIndex >= 0 && bucketIndex < 24) {\n metrics.buckets[bucketIndex].failed++;\n }\n\n // Track job type stats\n const key = `${queueName}:${job.name}`;\n const stats = jobTypeStats.get(key) || {\n name: job.name,\n queueName,\n completed: 0,\n failed: 0,\n };\n stats.failed++;\n jobTypeStats.set(key, stats);\n }\n }\n\n // Calculate averages for each bucket\n for (const metrics of queueMetricsMap.values()) {\n for (let i = 0; i < 24; i++) {\n const durations = metrics.durations[i];\n const waitTimes = metrics.waitTimes[i];\n if (durations.length > 0) {\n metrics.buckets[i].avgDuration = Math.round(\n durations.reduce((a, b) => a + b, 0) / durations.length,\n );\n }\n if (waitTimes.length > 0) {\n metrics.buckets[i].avgWaitTime = Math.round(\n waitTimes.reduce((a, b) => a + b, 0) / waitTimes.length,\n );\n }\n }\n }\n\n // Skip per-queue metrics - not used by frontend (only aggregate is displayed)\n // Return empty array to maintain API compatibility\n\n // Build aggregate metrics\n const aggregateBuckets = createEmptyBuckets();\n const aggregateDurations: number[][] = Array.from(\n { length: 24 },\n () => [],\n );\n const aggregateWaitTimes: number[][] = Array.from(\n { length: 24 },\n () => [],\n );\n\n for (const metrics of queueMetricsMap.values()) {\n for (let i = 0; i < 24; i++) {\n aggregateBuckets[i].completed += metrics.buckets[i].completed;\n aggregateBuckets[i].failed += metrics.buckets[i].failed;\n aggregateDurations[i].push(...metrics.durations[i]);\n aggregateWaitTimes[i].push(...metrics.waitTimes[i]);\n }\n }\n\n // Calculate aggregate averages\n for (let i = 0; i < 24; i++) {\n if (aggregateDurations[i].length > 0) {\n aggregateBuckets[i].avgDuration = Math.round(\n aggregateDurations[i].reduce((a, b) => a + b, 0) /\n aggregateDurations[i].length,\n );\n }\n if (aggregateWaitTimes[i].length > 0) {\n aggregateBuckets[i].avgWaitTime = Math.round(\n aggregateWaitTimes[i].reduce((a, b) => a + b, 0) /\n aggregateWaitTimes[i].length,\n );\n }\n }\n\n const totalCompleted = aggregateBuckets.reduce(\n (sum, b) => sum + b.completed,\n 0,\n );\n const totalFailed = aggregateBuckets.reduce(\n (sum, b) => sum + b.failed,\n 0,\n );\n const allDurations = aggregateDurations.flat();\n const allWaitTimes = aggregateWaitTimes.flat();\n\n // Get top 10 slowest jobs\n const slowestJobs = allJobs\n .sort((a, b) => b.duration - a.duration)\n .slice(0, 10);\n\n // Get top 10 most failing job types\n const mostFailingTypes = Array.from(jobTypeStats.values())\n .filter((s) => s.failed > 0)\n .map((s) => ({\n name: s.name,\n queueName: s.queueName,\n failCount: s.failed,\n totalCount: s.completed + s.failed,\n errorRate: s.failed / (s.completed + s.failed),\n }))\n .sort((a, b) => b.failCount - a.failCount)\n .slice(0, 10);\n\n return {\n queues: [], // Empty - per-queue metrics not used by frontend\n aggregate: {\n queueName: \"all\",\n buckets: aggregateBuckets,\n summary: {\n totalCompleted,\n totalFailed,\n errorRate:\n totalCompleted + totalFailed > 0\n ? totalFailed / (totalCompleted + totalFailed)\n : 0,\n avgDuration:\n allDurations.length > 0\n ? Math.round(\n allDurations.reduce((a, b) => a + b, 0) /\n allDurations.length,\n )\n : 0,\n avgWaitTime:\n allWaitTimes.length > 0\n ? Math.round(\n allWaitTimes.reduce((a, b) => a + b, 0) /\n allWaitTimes.length,\n )\n : 0,\n throughputPerHour: Math.round(\n (totalCompleted + totalFailed) / 24,\n ),\n },\n },\n slowestJobs,\n mostFailingTypes,\n computedAt: now,\n };\n })(),\n 45000, // 45 second timeout (before proxy timeout)\n \"Metrics computation timed out after 45 seconds\",\n );\n });\n }\n\n /**\n * Get activity stats for the last 7 days (cached)\n * Returns 4-hour buckets for the activity timeline\n */\n async getActivityStats(): Promise<ActivityStatsResponse> {\n return this.cached(\"activity\", this.CACHE_TTL.activity, async () => {\n const now = Date.now();\n const bucketSize = 4 * 60 * 60 * 1000; // 4 hours\n const bucketCount = 42; // 7 days * 6 buckets per day\n\n // Start from midnight 7 days ago\n const startDate = new Date(now);\n startDate.setHours(0, 0, 0, 0);\n startDate.setDate(startDate.getDate() - 6);\n const startTime = startDate.getTime();\n\n // Initialize buckets\n const buckets: ActivityBucket[] = [];\n for (let i = 0; i < bucketCount; i++) {\n buckets.push({\n time: startTime + i * bucketSize,\n completed: 0,\n failed: 0,\n });\n }\n\n // Fetch completed and failed jobs from each queue IN PARALLEL\n // Use time-based filtering to only get jobs within the 7-day window\n const queueEntries = Array.from(this.queues.entries());\n\n // First, check which queues have relevant jobs\n const queueChecks = await Promise.all(\n queueEntries.map(async ([, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n return {\n queue,\n hasRelevantJobs:\n (counts.completed || 0) > 0 || (counts.failed || 0) > 0,\n };\n }),\n );\n\n // Only process queues with relevant jobs\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queue }) => {\n // Use time-based filtering - only fetch jobs within the 7-day window\n // Reduced limit since we're filtering by time in Redis\n const [completedJobs, failedJobs] = await Promise.all([\n this.getJobsByTimeRange(\n queue,\n \"completed\",\n startTime,\n now,\n 200, // Reduced from 500 - only jobs in time range needed\n ),\n this.getJobsByTimeRange(\n queue,\n \"failed\",\n startTime,\n now,\n 200, // Reduced from 500 - only jobs in time range needed\n ),\n ]);\n return { completedJobs, failedJobs };\n }),\n );\n\n // Process results\n for (const { completedJobs, failedJobs } of queueResults) {\n // Process completed jobs\n for (const job of completedJobs) {\n if (!job?.finishedOn || job.finishedOn < startTime) continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - startTime) / bucketSize,\n );\n if (bucketIndex >= 0 && bucketIndex < bucketCount) {\n buckets[bucketIndex].completed++;\n }\n }\n\n // Process failed jobs\n for (const job of failedJobs) {\n if (!job?.finishedOn || job.finishedOn < startTime) continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - startTime) / bucketSize,\n );\n if (bucketIndex >= 0 && bucketIndex < bucketCount) {\n buckets[bucketIndex].failed++;\n }\n }\n }\n\n const totalCompleted = buckets.reduce((sum, b) => sum + b.completed, 0);\n const totalFailed = buckets.reduce((sum, b) => sum + b.failed, 0);\n\n return {\n buckets,\n startTime,\n endTime: now,\n bucketSize,\n totalCompleted,\n totalFailed,\n computedAt: now,\n };\n });\n }\n\n /**\n * Get jobs for a specific queue with pagination and sorting\n */\n async getJobs(\n queueName: string,\n status?: JobStatus,\n limit = 50,\n start = 0,\n sort?: SortOptions,\n ): Promise<PaginatedResponse<JobInfo>> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n return { data: [], total: 0, hasMore: false };\n }\n\n const types = status\n ? [status]\n : [\"waiting\", \"active\", \"completed\", \"failed\", \"delayed\"];\n\n // Fetch counts once before the loop (same for all types in a queue)\n const counts = await this.getCachedJobCounts(queue);\n\n // Track jobs with their known state to avoid getState() calls\n const jobsWithState: { job: Job; state: JobStatus }[] = [];\n let total = 0;\n\n for (const type of types) {\n const typeJobs = await queue.getJobs(type as any, start, start + limit);\n jobsWithState.push(\n ...typeJobs.map((job) => ({ job, state: type as JobStatus })),\n );\n\n const typeCount = counts[type as keyof typeof counts] || 0;\n total += typeCount;\n }\n\n // Convert to JobInfo - pass known state to skip expensive getState() calls\n const jobInfos = (await Promise.all(\n jobsWithState.map(({ job, state }) => this.jobToInfo(job, \"full\", state)),\n )) as JobInfo[];\n\n // Apply sorting\n const sortField = sort?.field ?? \"timestamp\";\n const sortDir = sort?.direction === \"asc\" ? 1 : -1;\n\n jobInfos.sort((a, b) => {\n const aVal = this.getSortValue(a, sortField);\n const bVal = this.getSortValue(b, sortField);\n if (aVal < bVal) return -1 * sortDir;\n if (aVal > bVal) return 1 * sortDir;\n return 0;\n });\n\n // Take only the requested limit\n const data = jobInfos.slice(0, limit);\n\n return {\n data,\n total,\n hasMore: start + limit < total,\n cursor: start + limit < total ? String(start + limit) : undefined,\n };\n }\n\n /**\n * Get a single job by ID\n */\n async getJob(queueName: string, jobId: string): Promise<JobInfo | null> {\n const queue = this.queues.get(queueName);\n if (!queue) return null;\n\n const job = await queue.getJob(jobId);\n if (!job) return null;\n\n return this.jobToInfo(job, \"full\") as Promise<JobInfo>;\n }\n\n /**\n * Retry a failed job\n */\n async retryJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.retry();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Remove a job\n */\n async removeJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.remove();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Promote a delayed job to waiting\n */\n async promoteJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.promote();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Parse search query for field:value filters\n * Returns { filters: { field: value }, text: remainingText }\n */\n private parseSearchQuery(query: string): {\n filters: Record<string, string>;\n text: string;\n } {\n const filters: Record<string, string> = {};\n const textParts: string[] = [];\n const len = query.length;\n let i = 0;\n\n while (i < len) {\n while (i < len && query[i] === \" \") i++;\n if (i >= len) break;\n\n let j = i;\n while (j < len && /\\w/.test(query[j]!)) j++;\n\n if (j > i && j < len && query[j] === \":\") {\n const field = query.slice(i, j);\n j++;\n\n let value: string;\n if (j < len && query[j] === '\"') {\n j++;\n const closeQuote = query.indexOf('\"', j);\n if (closeQuote !== -1) {\n value = query.slice(j, closeQuote);\n j = closeQuote + 1;\n } else {\n value = query.slice(j);\n j = len;\n }\n } else {\n const valueStart = j;\n while (j < len && query[j] !== \" \") j++;\n value = query.slice(valueStart, j);\n }\n\n if (value) {\n filters[field] = value;\n } else {\n textParts.push(`${field}:`);\n }\n i = j;\n } else {\n const start = i;\n while (i < len && query[i] !== \" \") i++;\n textParts.push(query.slice(start, i));\n }\n }\n\n return {\n filters,\n text: textParts.filter(Boolean).join(\" \"),\n };\n }\n\n /**\n * Check if a raw job matches all provided filters (before conversion)\n * This is more efficient than converting to JobInfo first\n */\n private jobMatchesAllFilters(\n job: Job,\n filters: {\n status?: JobStatus;\n tags?: Record<string, string>;\n text?: string;\n timeRange?: { start: number; end: number };\n },\n ): boolean {\n // Status filter is handled by fetching only the requested status types\n // So we don't need to check it here - jobs are already filtered by type\n\n // Check time range filter (cheap - uses raw timestamps)\n if (filters.timeRange) {\n const jobTime = job.processedOn || job.finishedOn || job.timestamp || 0;\n if (\n jobTime < filters.timeRange.start ||\n jobTime > filters.timeRange.end\n ) {\n return false;\n }\n }\n\n // Check tag filters (extract only needed fields from job.data)\n if (filters.tags && Object.keys(filters.tags).length > 0) {\n if (!job.data || typeof job.data !== \"object\") {\n return false;\n }\n const dataObj = job.data as Record<string, unknown>;\n for (const [field, value] of Object.entries(filters.tags)) {\n const jobValue = dataObj[field];\n if (jobValue === undefined || jobValue === null) {\n return false;\n }\n // Case-insensitive comparison for strings\n const strJobValue = String(jobValue).toLowerCase();\n const strFilterValue = value.toLowerCase();\n if (!strJobValue.includes(strFilterValue)) {\n return false;\n }\n }\n }\n\n // Check text search (only stringify if needed)\n if (filters.text) {\n const lowerText = filters.text.toLowerCase();\n const matchesId = job.id?.toLowerCase().includes(lowerText);\n const matchesName = job.name?.toLowerCase().includes(lowerText);\n\n if (!matchesId && !matchesName) {\n // Only stringify job.data if ID and name don't match\n const stringifiedData = JSON.stringify(job.data).toLowerCase();\n if (!stringifiedData.includes(lowerText)) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n /**\n * Check if a job matches the given tag filters\n */\n private jobMatchesFilters(\n job: Job,\n filters: Record<string, string>,\n ): boolean {\n if (!job.data || typeof job.data !== \"object\") {\n return Object.keys(filters).length === 0;\n }\n\n const dataObj = job.data as Record<string, unknown>;\n for (const [field, value] of Object.entries(filters)) {\n const jobValue = dataObj[field];\n if (jobValue === undefined || jobValue === null) {\n return false;\n }\n // Case-insensitive comparison for strings\n const strJobValue = String(jobValue).toLowerCase();\n const strFilterValue = value.toLowerCase();\n if (!strJobValue.includes(strFilterValue)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Search jobs across all queues\n * Supports field:value syntax (e.g., \"teamId:abc-123 invoice\")\n * Optimized with parallel processing, early exits, and count checks\n */\n async search(query: string, limit = 20): Promise<SearchResult[]> {\n const { filters, text } = this.parseSearchQuery(query);\n const lowerText = text.toLowerCase();\n const hasFilters = Object.keys(filters).length > 0;\n const hasText = lowerText.length > 0;\n\n // Early exit if no search criteria\n if (!hasFilters && !hasText) {\n return [];\n }\n\n // Check counts first to skip empty queues\n const queueEntries = Array.from(this.queues.entries());\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n const hasJobs =\n (counts.waiting || 0) > 0 ||\n (counts.active || 0) > 0 ||\n (counts.completed || 0) > 0 ||\n (counts.failed || 0) > 0 ||\n (counts.delayed || 0) > 0;\n return { queueName, queue, hasJobs };\n }),\n );\n\n const relevantQueues = queueChecks.filter((q) => q.hasJobs);\n if (relevantQueues.length === 0) {\n return [];\n }\n\n // Process all queues in parallel instead of sequentially\n const types = [\"waiting\", \"active\", \"completed\", \"failed\", \"delayed\"];\n const fetchLimit = Math.min(limit * 2, 50); // Reduced from 100 - only fetch what we need\n\n // WeakMap for caching stringified job data\n const stringifiedDataCache = new WeakMap<Job, string>();\n\n // Process all queues concurrently\n const queueResults = await Promise.allSettled(\n relevantQueues.map(async ({ queueName, queue }) => {\n // Search in all job states in parallel\n const typeResults = await Promise.all(\n types.map(async (type) => {\n try {\n const jobs = await queue.getJobs(type as any, 0, fetchLimit);\n const matches: SearchResult[] = [];\n\n for (const job of jobs) {\n // Check field:value filters first\n if (hasFilters && !this.jobMatchesFilters(job, filters)) {\n continue;\n }\n\n // If there's text search, match by job ID, name, or data\n if (hasText) {\n const matchesId = job.id?.toLowerCase().includes(lowerText);\n const matchesName = job.name\n ?.toLowerCase()\n .includes(lowerText);\n\n // Only stringify if ID and name don't match (expensive operation)\n let matchesData = false;\n if (!matchesId && !matchesName) {\n // Use cached stringified data if available\n let stringifiedData = stringifiedDataCache.get(job);\n if (!stringifiedData) {\n stringifiedData = JSON.stringify(job.data).toLowerCase();\n stringifiedDataCache.set(job, stringifiedData);\n }\n matchesData = stringifiedData.includes(lowerText);\n }\n\n if (!matchesId && !matchesName && !matchesData) {\n continue;\n }\n }\n\n // Pass known state to skip expensive getState() calls\n matches.push({\n queue: queueName,\n job: (await this.jobToInfo(\n job,\n \"full\",\n type as JobStatus,\n )) as JobInfo,\n });\n }\n\n return matches;\n } catch {\n return [];\n }\n }),\n );\n\n return typeResults.flat();\n }),\n );\n\n // Collect all matches from all queues\n const allMatches: SearchResult[] = [];\n for (const result of queueResults) {\n if (result.status === \"fulfilled\") {\n allMatches.push(...result.value);\n }\n }\n\n // Return limited results\n return allMatches.slice(0, limit);\n }\n\n /**\n * Clean jobs from a queue\n */\n async cleanJobs(\n queueName: string,\n status: \"completed\" | \"failed\",\n grace = 0,\n ): Promise<number> {\n const queue = this.queues.get(queueName);\n if (!queue) return 0;\n\n const removed = await queue.clean(grace, 1000, status);\n return removed.length;\n }\n\n /**\n * FAST PATH: Get latest runs without filters\n * Optimized for the common case of viewing newest jobs (timestamp desc, no filters)\n * - Single getJobs call per queue (not per status type)\n * - No count checks needed\n * - Minimal Redis round-trips\n */\n private async getLatestRuns(\n limit: number,\n start: number,\n ): Promise<PaginatedResponse<RunInfoList>> {\n const queueEntries = Array.from(this.queues.entries());\n const numQueues = queueEntries.length;\n\n if (numQueues === 0) {\n return { data: [], total: -1, hasMore: false, cursor: undefined };\n }\n\n // Fetch a small number of recent jobs from each queue\n // We need enough to fill the page after sorting by timestamp\n const perQueueFetch = Math.max(5, Math.ceil((limit + 10) / numQueues) + 2);\n\n // Fetch from all queues in parallel - single call per queue with all types\n const allTypes: JobStatus[] = [\n \"waiting\",\n \"active\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n\n const results = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n // Single getJobs call with all types - much faster than 5 separate calls\n const jobs = await queue.getJobs(allTypes as any, 0, perQueueFetch);\n return jobs.map((job) => ({ job, queueName }));\n }),\n );\n\n // Flatten and sort by timestamp desc\n const allJobs = results.flat();\n allJobs.sort((a, b) => {\n const timeDiff = (b.job.timestamp || 0) - (a.job.timestamp || 0);\n if (timeDiff !== 0) return timeDiff;\n // Secondary sort for stability\n return a.queueName.localeCompare(b.queueName);\n });\n\n // Apply pagination\n const jobsToConvert = allJobs.slice(start, start + limit);\n\n // Convert to RunInfoList - infer state from job properties\n const runInfos = await Promise.all(\n jobsToConvert.map(async ({ job, queueName }) => {\n // Infer state from job properties to avoid getState() Redis call\n let state: JobStatus = \"waiting\";\n if (job.finishedOn) {\n state = job.failedReason ? \"failed\" : \"completed\";\n } else if (job.processedOn) {\n state = \"active\";\n } else if (job.delay && job.delay > 0) {\n state = \"delayed\";\n }\n\n const info = await this.jobToInfo(job, \"list\", state);\n return { ...info, queueName } as RunInfoList;\n }),\n );\n\n // Determine if there are more results\n const hasMore = allJobs.length > start + limit;\n\n return {\n data: runInfos,\n total: -1, // Don't calculate total for fast path - not needed for UI\n hasMore,\n cursor: hasMore ? String(start + runInfos.length) : undefined,\n };\n }\n\n /**\n * Get all runs (jobs) across all queues with sorting and filtering\n * Uses fast path for common case (no filters, timestamp desc)\n */\n async getAllRuns(\n limit = 50,\n start = 0,\n sort?: SortOptions,\n filters?: {\n status?: JobStatus;\n tags?: Record<string, string>;\n text?: string;\n timeRange?: { start: number; end: number };\n },\n ): Promise<PaginatedResponse<RunInfoList>> {\n const sortField = sort?.field ?? \"timestamp\";\n const sortDir = sort?.direction === \"asc\" ? 1 : -1;\n const hasFilters = !!(\n filters?.status ||\n filters?.tags ||\n filters?.text ||\n filters?.timeRange\n );\n const isTimestampSort = sortField === \"timestamp\";\n\n // FAST PATH: No filters, timestamp desc = just get newest jobs\n // This is the most common use case and should be instant\n if (!hasFilters && isTimestampSort && sortDir === -1) {\n return this.getLatestRuns(limit, start);\n }\n\n // FILTERED PATH: More complex queries need full filtering logic\n const queueEntries = Array.from(this.queues.entries());\n\n // Determine which job types to fetch based on status filter\n const types = filters?.status\n ? [filters.status]\n : [\"waiting\", \"active\", \"completed\", \"failed\", \"delayed\"];\n\n const hasTimeRange = !!filters?.timeRange;\n const numQueues = Math.max(queueEntries.length, 1);\n\n if (queueEntries.length === 0) {\n return {\n data: [],\n total: 0,\n hasMore: false,\n cursor: undefined,\n };\n }\n\n // For filtered queries, fetch enough to likely fill one page after filtering\n // Reduced from 50 to be smarter about distribution\n const baseFetchPerQueue = Math.max(\n Math.ceil((limit * 2) / numQueues) + 3,\n 5,\n );\n\n let allJobs: { job: Job; queueName: string; state: JobStatus }[] = [];\n\n // Helper function to fetch from a single queue\n const fetchFromQueue = async (\n queueName: string,\n queue: Queue,\n fetchCount: number,\n ) => {\n // Use time-range queries for completed/failed jobs when time range is specified\n if (hasTimeRange && filters?.timeRange) {\n const timeRangeJobs: { job: Job; state: JobStatus }[] = [];\n\n // Use efficient time-range queries for completed/failed\n if (types.includes(\"completed\")) {\n const completedJobs = await this.getJobsByTimeRange(\n queue,\n \"completed\",\n filters.timeRange.start,\n filters.timeRange.end,\n fetchCount,\n );\n timeRangeJobs.push(\n ...completedJobs.map((job) => ({\n job,\n state: \"completed\" as JobStatus,\n })),\n );\n }\n\n if (types.includes(\"failed\")) {\n const failedJobs = await this.getJobsByTimeRange(\n queue,\n \"failed\",\n filters.timeRange.start,\n filters.timeRange.end,\n fetchCount,\n );\n timeRangeJobs.push(\n ...failedJobs.map((job) => ({\n job,\n state: \"failed\" as JobStatus,\n })),\n );\n }\n\n // For other types, use regular getJobs\n const otherTypes = types.filter(\n (t) => t !== \"completed\" && t !== \"failed\",\n );\n if (otherTypes.length > 0) {\n const otherJobArrays = await Promise.all(\n otherTypes.map(async (type) => {\n const jobs = await queue.getJobs(type as any, 0, fetchCount);\n return jobs.map((job) => ({ job, state: type as JobStatus }));\n }),\n );\n timeRangeJobs.push(...otherJobArrays.flat());\n }\n\n return timeRangeJobs.map(({ job, state }) => ({\n job,\n queueName,\n state,\n }));\n }\n\n // For status filter, only fetch that type\n if (filters?.status) {\n const jobs = await queue.getJobs(filters.status as any, 0, fetchCount);\n return jobs.map((job) => ({\n job,\n queueName,\n state: filters.status as JobStatus,\n }));\n }\n\n // Regular fetching for all types - track state for each type\n const jobArrays = await Promise.all(\n types.map(async (type) => {\n const jobs = await queue.getJobs(type as any, 0, fetchCount);\n return jobs.map((job) => ({ job, state: type as JobStatus }));\n }),\n );\n return jobArrays\n .flat()\n .map(({ job, state }) => ({ job, queueName, state }));\n };\n\n // Fetch from ALL queues in parallel\n const results = await Promise.all(\n queueEntries.map(([queueName, queue]) =>\n fetchFromQueue(queueName, queue, baseFetchPerQueue),\n ),\n );\n allJobs = results.flat();\n\n // Apply filters BEFORE sorting and pagination\n if (filters) {\n allJobs = allJobs.filter(({ job }) =>\n this.jobMatchesAllFilters(job, filters),\n );\n }\n\n // Sort all filtered jobs to ensure consistent ordering\n // sortDir: 1 = asc (oldest first), -1 = desc (newest first, default)\n if (isTimestampSort) {\n allJobs.sort((a, b) => {\n const aTime = a.job.timestamp || 0;\n const bTime = b.job.timestamp || 0;\n // Primary sort by timestamp\n const timeDiff = sortDir === -1 ? bTime - aTime : aTime - bTime;\n if (timeDiff !== 0) return timeDiff;\n // Secondary sort by queueName for stability\n const queueDiff = a.queueName.localeCompare(b.queueName);\n if (queueDiff !== 0) return queueDiff;\n // Tertiary sort by job ID for complete stability\n return (a.job.id || \"\").localeCompare(b.job.id || \"\");\n });\n }\n\n // Apply pagination\n const jobsToConvert = allJobs.slice(start, start + limit);\n\n // Convert only the jobs we'll return\n const runInfos = await Promise.all(\n jobsToConvert.map(async ({ job, queueName, state }) => {\n const info = await this.jobToInfo(job, \"list\", state);\n return { ...info, queueName } as RunInfoList;\n }),\n );\n\n // For non-timestamp sorting, sort after conversion\n if (!isTimestampSort) {\n runInfos.sort((a, b) => {\n const aVal = this.getSortValueForList(a, sortField);\n const bVal = this.getSortValueForList(b, sortField);\n if (aVal < bVal) return -1 * sortDir;\n if (aVal > bVal) return 1 * sortDir;\n return 0;\n });\n }\n\n // Build cursor for next page\n const hasMore = allJobs.length > start + limit;\n\n return {\n data: runInfos,\n total: -1, // Don't calculate total - not needed for UI\n hasMore,\n cursor: hasMore ? String(start + runInfos.length) : undefined,\n };\n }\n\n /**\n * Get all schedulers (repeatable and delayed jobs) with sorting\n */\n async getSchedulers(\n repeatableSort?: SortOptions,\n delayedSort?: SortOptions,\n ): Promise<{\n repeatable: SchedulerInfo[];\n delayed: DelayedJobInfo[];\n }> {\n const repeatable: SchedulerInfo[] = [];\n const delayed: DelayedJobInfo[] = [];\n\n // Fetch from all queues in parallel\n const queueEntries = Array.from(this.queues.entries());\n const results = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const [repeatableJobs, delayedJobs] = await Promise.all([\n queue.getRepeatableJobs(),\n queue.getJobs(\"delayed\", 0, 50),\n ]);\n return { queueName, repeatableJobs, delayedJobs };\n }),\n );\n\n // Process results\n for (const { queueName, repeatableJobs, delayedJobs } of results) {\n for (const job of repeatableJobs) {\n repeatable.push({\n key: job.key,\n name: job.name || \"unnamed\",\n queueName,\n pattern: job.pattern ?? undefined,\n every: job.every ? Number(job.every) : undefined,\n next: job.next ?? undefined,\n endDate: job.endDate ?? undefined,\n tz: job.tz ?? undefined,\n });\n }\n\n for (const job of delayedJobs) {\n const delay = job.opts.delay || 0;\n delayed.push({\n id: job.id || \"\",\n name: job.name,\n queueName,\n delay,\n processAt: job.timestamp + delay,\n data: job.data,\n });\n }\n }\n\n // Sort repeatable jobs\n const repeatableField = repeatableSort?.field ?? \"name\";\n const repeatableDir = repeatableSort?.direction === \"desc\" ? -1 : 1;\n repeatable.sort((a, b) => {\n const aVal = this.getSchedulerSortValue(a, repeatableField);\n const bVal = this.getSchedulerSortValue(b, repeatableField);\n if (aVal < bVal) return -1 * repeatableDir;\n if (aVal > bVal) return 1 * repeatableDir;\n return 0;\n });\n\n // Sort delayed jobs\n const delayedField = delayedSort?.field ?? \"processAt\";\n const delayedDir = delayedSort?.direction === \"desc\" ? -1 : 1;\n delayed.sort((a, b) => {\n const aVal = this.getDelayedSortValue(a, delayedField);\n const bVal = this.getDelayedSortValue(b, delayedField);\n if (aVal < bVal) return -1 * delayedDir;\n if (aVal > bVal) return 1 * delayedDir;\n return 0;\n });\n\n return { repeatable, delayed };\n }\n\n /**\n * Enqueue a new job (for testing)\n */\n async enqueueJob(request: TestJobRequest): Promise<{ id: string }> {\n const queue = this.queues.get(request.queueName);\n if (!queue) {\n throw new Error(`Queue \"${request.queueName}\" not found`);\n }\n\n const job = await queue.add(request.jobName, request.data, {\n delay: request.opts?.delay,\n priority: request.opts?.priority,\n attempts: request.opts?.attempts,\n });\n\n return { id: job.id || \"\" };\n }\n\n /**\n * Extract tag values from job data based on configured tag fields\n */\n private extractTags(data: unknown): JobTags | undefined {\n if (!this.tagFields.length || !data || typeof data !== \"object\") {\n return undefined;\n }\n\n const tags: JobTags = {};\n const dataObj = data as Record<string, unknown>;\n\n for (const field of this.tagFields) {\n const value = dataObj[field];\n if (\n value !== undefined &&\n (typeof value === \"string\" ||\n typeof value === \"number\" ||\n typeof value === \"boolean\" ||\n value === null)\n ) {\n tags[field] = value as string | number | boolean | null;\n }\n }\n\n return Object.keys(tags).length > 0 ? tags : undefined;\n }\n\n /**\n * Get unique values for a specific tag field across all jobs\n */\n async getTagValues(\n field: string,\n limit = 50,\n ): Promise<{ value: string; count: number }[]> {\n const valueMap = new Map<string, number>();\n const types = [\"waiting\", \"active\", \"completed\", \"failed\", \"delayed\"];\n\n // Fetch jobs from all queues in parallel\n const queueEntries = Array.from(this.queues.entries());\n const queueResults = await Promise.all(\n queueEntries.map(async ([, queue]) => {\n const jobArrays = await Promise.all(\n types.map((type) => queue.getJobs(type as any, 0, 100)),\n );\n return jobArrays.flat();\n }),\n );\n\n // Process all jobs\n for (const jobs of queueResults) {\n for (const job of jobs) {\n if (job.data && typeof job.data === \"object\") {\n const dataObj = job.data as Record<string, unknown>;\n const value = dataObj[field];\n if (value !== undefined && value !== null) {\n const strValue = String(value);\n valueMap.set(strValue, (valueMap.get(strValue) || 0) + 1);\n }\n }\n }\n }\n\n // Sort by count descending and take top N\n const sorted = Array.from(valueMap.entries())\n .sort((a, b) => b[1] - a[1])\n .slice(0, limit)\n .map(([value, count]) => ({ value, count }));\n\n return sorted;\n }\n\n /**\n * Get sortable value from JobInfo/RunInfo\n */\n private getSortValue(\n item: JobInfo | RunInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"timestamp\":\n return item.timestamp ?? 0;\n case \"name\":\n return item.name.toLowerCase();\n case \"status\":\n return item.status;\n case \"duration\":\n return item.duration ?? 0;\n case \"queueName\":\n return \"queueName\" in item ? item.queueName.toLowerCase() : \"\";\n case \"processedOn\":\n return item.processedOn ?? 0;\n default:\n return item.timestamp ?? 0;\n }\n }\n\n /**\n * Get sortable value from RunInfoList (lightweight version)\n */\n private getSortValueForList(\n item: RunInfoList,\n field: string,\n ): string | number {\n switch (field) {\n case \"timestamp\":\n return item.timestamp ?? 0;\n case \"name\":\n return item.name.toLowerCase();\n case \"status\":\n return item.status;\n case \"duration\":\n return item.duration ?? 0;\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"processedOn\":\n return item.processedOn ?? 0;\n default:\n return item.timestamp ?? 0;\n }\n }\n\n /**\n * Get sortable value from SchedulerInfo\n */\n private getSchedulerSortValue(\n item: SchedulerInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"name\":\n return item.name.toLowerCase();\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"pattern\":\n return item.pattern?.toLowerCase() ?? \"\";\n case \"next\":\n return item.next ?? 0;\n case \"tz\":\n return item.tz?.toLowerCase() ?? \"\";\n default:\n return item.name.toLowerCase();\n }\n }\n\n /**\n * Get sortable value from DelayedJobInfo\n */\n private getDelayedSortValue(\n item: DelayedJobInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"name\":\n return item.name.toLowerCase();\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"processAt\":\n return item.processAt;\n case \"delay\":\n return item.delay;\n default:\n return item.processAt;\n }\n }\n\n /**\n * Convert a BullMQ Job to JobInfo or RunInfoList\n * @param job - The BullMQ job to convert\n * @param fields - \"list\" for lightweight list view, \"full\" for complete job details\n * @param knownState - Optional: skip getState() call if state is already known from fetch\n */\n private async jobToInfo(\n job: Job,\n _fields: \"list\" | \"full\" = \"full\",\n knownState?: JobStatus,\n ): Promise<JobInfo | RunInfoList> {\n // Use known state if provided (avoids expensive Redis getState() call)\n // Otherwise use cached state, or fetch and cache\n let state = knownState;\n if (!state) {\n const cacheKey = `${job.queueName}:${job.id}`;\n state = this.jobStateCache.get(cacheKey);\n if (!state) {\n state = (await job.getState()) as JobStatus;\n this.jobStateCache.set(cacheKey, state);\n }\n }\n const duration =\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined;\n\n // Normalize progress to number or object\n let progress: number | object = 0;\n if (typeof job.progress === \"number\") {\n progress = job.progress;\n } else if (typeof job.progress === \"object\" && job.progress !== null) {\n progress = job.progress;\n }\n\n // Extract configured tag fields from job data\n const tags = this.extractTags(job.data);\n\n // Extract parent info if this job is part of a flow\n let parent: { id: string; queueName: string } | undefined;\n if (job.parent?.id) {\n parent = {\n id: job.parent.id,\n queueName:\n job.parent.queueKey?.split(\":\")[1] || job.parent.queueKey || \"\",\n };\n } else if (job.parentKey) {\n // parentKey format: \"bull:queueName:jobId\"\n const parts = job.parentKey.split(\":\");\n if (parts.length >= 3) {\n parent = {\n id: parts[parts.length - 1] || \"\",\n queueName: parts[parts.length - 2] || \"\",\n };\n }\n }\n\n return {\n id: job.id || \"\",\n name: job.name,\n data: job.data,\n opts: {\n attempts: job.opts.attempts,\n delay: job.opts.delay,\n priority: job.opts.priority,\n },\n progress,\n attemptsMade: job.attemptsMade,\n processedOn: job.processedOn,\n finishedOn: job.finishedOn,\n timestamp: job.timestamp,\n failedReason: job.failedReason,\n stacktrace: job.stacktrace ?? undefined,\n returnvalue: job.returnvalue,\n status: state as JobStatus,\n duration,\n tags,\n parent,\n };\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Bulk Operations\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Retry multiple jobs across queues\n * Processed in parallel for better performance\n */\n async bulkRetry(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.retry();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n /**\n * Delete multiple jobs across queues\n * Processed in parallel for better performance\n */\n async bulkDelete(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.remove();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n /**\n * Promote multiple delayed jobs across queues (move to waiting)\n * Processed in parallel for better performance\n */\n async bulkPromote(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.promote();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Flow Operations\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Get all flows (jobs that have children or are part of a flow) - cached\n * Optimized to focus on waiting-children type first and early exit\n */\n async getFlows(limit = 50): Promise<FlowSummary[]> {\n if (!this.flowProducer) {\n return [];\n }\n\n return this.cached(`flows:${limit}`, this.CACHE_TTL.flows, async () => {\n const queueEntries = Array.from(this.queues.entries());\n\n // Check counts first to skip empty queues\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n const hasRelevantJobs =\n (counts.waiting || 0) > 0 ||\n (counts[\"waiting-children\"] || 0) > 0 ||\n (counts.active || 0) > 0;\n return { queueName, queue, hasRelevantJobs };\n }),\n );\n\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n if (relevantQueues.length === 0) {\n return [];\n }\n\n // Focus on waiting-children first (most likely to be flows)\n // Then check other types with reduced limits\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queueName, queue }) => {\n try {\n // Fetch waiting-children first (most likely flows) with higher limit\n const waitingChildrenJobs = await queue.getJobs(\n [\"waiting-children\"],\n 0,\n 50,\n );\n\n // If we already have enough flows, skip other types\n if (waitingChildrenJobs.length >= limit) {\n return { queueName, jobs: waitingChildrenJobs };\n }\n\n // Fetch other types with reduced limits\n const otherTypes = [\n \"waiting\",\n \"active\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n const otherJobArrays = await Promise.all(\n otherTypes.map(async (type) => {\n try {\n return await queue.getJobs(type as any, 0, 30); // Reduced from 100\n } catch {\n return [];\n }\n }),\n );\n\n const allJobs = [...waitingChildrenJobs, ...otherJobArrays.flat()];\n return { queueName, jobs: allJobs };\n } catch {\n return { queueName, jobs: [] };\n }\n }),\n );\n\n // Collect potential root jobs (no parent)\n // Early exit when we have enough flows\n const seenJobIds = new Set<string>();\n const potentialRoots: { queueName: string; job: Job }[] = [];\n\n for (const { queueName, jobs } of queueResults) {\n // Early exit if we have enough flows\n if (potentialRoots.length >= limit * 2) {\n break;\n }\n\n for (const job of jobs) {\n if (!job?.id) continue;\n\n const jobKey = `${queueName}:${job.id}`;\n if (seenJobIds.has(jobKey)) continue;\n seenJobIds.add(jobKey);\n\n // Check if this is a root job (has no parent)\n const hasParent = !!job.parent || !!job.parentKey;\n if (!hasParent) {\n potentialRoots.push({ queueName, job });\n\n // Early exit if we have enough potential roots\n if (potentialRoots.length >= limit * 2) {\n break;\n }\n }\n }\n }\n\n // Check flows in parallel (batch to avoid overwhelming Redis)\n const batchSize = 20;\n const flows: FlowSummary[] = [];\n\n for (\n let i = 0;\n i < potentialRoots.length && flows.length < limit;\n i += batchSize\n ) {\n const batch = potentialRoots.slice(i, i + batchSize);\n const batchResults = await Promise.all(\n batch.map(async ({ queueName, job }) => {\n try {\n const flowTree = await this.flowProducer!.getFlow({\n id: job.id!,\n queueName,\n });\n\n if (flowTree?.children && flowTree.children.length > 0) {\n const stats = this.countFlowStats(flowTree);\n const state = await job.getState();\n\n return {\n id: job.id!,\n name: job.name,\n queueName,\n status: state as JobStatus,\n totalJobs: stats.total,\n completedJobs: stats.completed,\n failedJobs: stats.failed,\n timestamp: job.timestamp,\n duration:\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined,\n } as FlowSummary;\n }\n } catch {\n // Job might not have a flow, skip\n }\n return null;\n }),\n );\n\n for (const result of batchResults) {\n if (result && flows.length < limit) {\n flows.push(result);\n }\n }\n }\n\n return flows.sort((a, b) => b.timestamp - a.timestamp);\n });\n }\n\n /**\n * Get a single flow tree by root job ID\n */\n async getFlow(queueName: string, jobId: string): Promise<FlowNode | null> {\n if (!this.flowProducer) {\n return null;\n }\n\n try {\n const flowTree = await this.flowProducer.getFlow({\n id: jobId,\n queueName,\n });\n\n if (!flowTree) {\n return null;\n }\n\n return this.convertFlowTree(flowTree);\n } catch {\n return null;\n }\n }\n\n /**\n * Create a new flow\n */\n async createFlow(request: CreateFlowRequest): Promise<{ id: string }> {\n if (!this.flowProducer) {\n throw new Error(\"FlowProducer not initialized\");\n }\n\n const flowJob = this.buildFlowJob(request);\n const result = await this.flowProducer.add(flowJob);\n\n return { id: result.job.id || \"\" };\n }\n\n /**\n * Build a FlowJob from CreateFlowRequest or CreateFlowChildRequest\n */\n private buildFlowJob(\n request: CreateFlowRequest | CreateFlowChildRequest,\n ): any {\n const result: any = {\n name: request.name,\n queueName: request.queueName,\n data: request.data || {},\n };\n\n if (request.children && request.children.length > 0) {\n result.children = request.children.map((child) =>\n this.buildFlowJob(child),\n );\n }\n\n return result;\n }\n\n /**\n * Convert BullMQ flow tree to our FlowNode structure\n */\n private async convertFlowTree(tree: any): Promise<FlowNode> {\n const job = tree.job;\n const state = await job.getState();\n const duration =\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined;\n\n const jobInfo: JobInfo = {\n id: job.id || \"\",\n name: job.name,\n data: job.data,\n opts: {\n attempts: job.opts?.attempts,\n delay: job.opts?.delay,\n priority: job.opts?.priority,\n },\n progress:\n typeof job.progress === \"number\"\n ? job.progress\n : typeof job.progress === \"object\"\n ? job.progress\n : 0,\n attemptsMade: job.attemptsMade || 0,\n processedOn: job.processedOn,\n finishedOn: job.finishedOn,\n timestamp: job.timestamp,\n failedReason: job.failedReason,\n stacktrace: job.stacktrace ?? undefined,\n returnvalue: job.returnvalue,\n status: state as JobStatus,\n duration,\n tags: this.extractTags(job.data),\n };\n\n const children: FlowNode[] = [];\n if (tree.children && tree.children.length > 0) {\n for (const child of tree.children) {\n children.push(await this.convertFlowTree(child));\n }\n }\n\n return {\n job: jobInfo,\n queueName: job.queueName || tree.queueName || \"\",\n children: children.length > 0 ? children : undefined,\n };\n }\n\n /**\n * Count statistics for a flow tree\n */\n private countFlowStats(tree: any): {\n total: number;\n completed: number;\n failed: number;\n } {\n let total = 1;\n let completed = 0;\n let failed = 0;\n\n // Check current job status (synchronously from available data)\n const job = tree.job;\n if (job.finishedOn && !job.failedReason) {\n completed = 1;\n } else if (job.failedReason) {\n failed = 1;\n }\n\n if (tree.children) {\n for (const child of tree.children) {\n const childStats = this.countFlowStats(child);\n total += childStats.total;\n completed += childStats.completed;\n failed += childStats.failed;\n }\n }\n\n return { total, completed, failed };\n }\n}\n","import type { Queue, RedisOptions } from \"bullmq\";\nimport { discoverQueues } from \"./discover\";\nimport { QueueManager } from \"./queue-manager\";\nimport type { WorkbenchOptions } from \"./types\";\n\n/**\n * Internal metadata produced by {@link WorkbenchCore.fromOptions} when queues\n * are auto-discovered from a Redis connection.\n */\nexport interface DiscoveryMeta {\n /** Total number of queues found on the connection (before capping). */\n total: number;\n /** True if the result was capped at `maxQueues`. */\n capped: boolean;\n /** The cap that was applied. */\n cap: number;\n}\n\n/**\n * Core Workbench class that manages the dashboard\n */\nexport class WorkbenchCore {\n readonly options: Required<Pick<WorkbenchOptions, \"title\" | \"readonly\">> &\n WorkbenchOptions;\n readonly queueManager: QueueManager;\n readonly discovery: DiscoveryMeta | null;\n\n constructor(\n options: WorkbenchOptions | Queue[],\n discovery: DiscoveryMeta | null = null,\n ) {\n const opts = Array.isArray(options) ? { queues: options } : options;\n\n this.options = {\n title: \"Workbench\",\n readonly: false,\n ...opts,\n };\n\n this.discovery = discovery;\n\n const explicit = this.options.queues ?? [];\n const allowEmpty = !!this.options.redis;\n\n if (explicit.length === 0 && !allowEmpty) {\n throw new Error(\n \"Workbench requires at least one queue. Pass queues directly or provide a redis connection for auto-discovery.\",\n );\n }\n\n this.queueManager = new QueueManager(explicit, this.options.tags || []);\n }\n\n /**\n * Async factory: build a `WorkbenchCore` from `WorkbenchOptions`, performing\n * BullMQ queue auto-discovery via `SCAN <prefix>:*:meta` when `queues` is\n * not provided.\n *\n * - When `queues` is set explicitly, behaves like `new WorkbenchCore(opts)`.\n * - When only `redis` is set, scans the connection for queues, caps at\n * `maxQueues` (default 100) to avoid connection storms with very large\n * deployments, and constructs the core with the resulting list.\n * - When no queues are discovered, the core is constructed with an empty\n * queue map so the dashboard can render an \"empty\" state instead of\n * erroring out.\n */\n static async fromOptions(opts: WorkbenchOptions): Promise<WorkbenchCore> {\n if (opts.queues?.length) {\n return new WorkbenchCore(opts);\n }\n if (!opts.redis) {\n throw new Error(\n \"WorkbenchCore.fromOptions requires either `queues` or `redis`\",\n );\n }\n\n const prefix = opts.prefix ?? \"bull\";\n const cap = opts.maxQueues ?? 100;\n const all = await discoverQueues(opts.redis, prefix);\n const queues = all.slice(0, cap);\n\n return new WorkbenchCore(\n { ...opts, queues },\n { total: all.length, capped: all.length > cap, cap },\n );\n }\n\n /**\n * Get the queue manager instance\n */\n getQueueManager(): QueueManager {\n return this.queueManager;\n }\n\n /**\n * Check if authentication is required\n */\n requiresAuth(): boolean {\n return !!(this.options.auth?.username && this.options.auth?.password);\n }\n\n /**\n * Validate authentication credentials\n */\n validateAuth(username: string, password: string): boolean {\n if (!this.requiresAuth()) return true;\n return (\n username === this.options.auth?.username &&\n password === this.options.auth?.password\n );\n }\n\n /**\n * Get dashboard configuration for the UI\n */\n getConfig() {\n return {\n title: this.options.title,\n logo: this.options.logo,\n readonly: this.options.readonly,\n queues: this.queueManager.getQueueNames(),\n tags: this.queueManager.getTagFields(),\n discovery: this.discovery,\n };\n }\n}\n\n// Re-export for convenience: callers using `WorkbenchOptions.redis` can also\n// import the underlying connection type without depending on `bullmq` directly.\nexport type { RedisOptions };\n","import type { Queue } from \"bullmq\";\nimport type { WorkbenchOptions } from \"../core/types\";\nimport { WorkbenchCore } from \"../core/workbench\";\nimport { buildWorkbenchApp } from \"../server/hono-app\";\n\nexport interface FetchHandlerResult {\n /**\n * Web-standard fetch handler. Accepts a `Request` and returns a `Response`.\n * Suitable for Elysia's `.mount(path, handler)`, Next.js route handlers,\n * Bun.serve, and any other web-standards-friendly runtime.\n */\n fetch: (req: Request) => Promise<Response>;\n /**\n * The underlying `WorkbenchCore` instance. Exposed so adapters can read\n * config, query state, or wire up custom auth strategies.\n */\n core: WorkbenchCore;\n}\n\n/**\n * Build a self-contained web-fetch handler for Workbench: API routes,\n * `/config`, static `/assets/:file`, an `index.html` catch-all with a\n * correct `<base href>`, CORS on `/api/*`, and optional Basic Auth on\n * everything.\n *\n * This is the engine shared by every fetch-native adapter (Elysia, Next.js).\n * Express and Fastify adapters use {@link buildRouteTable} directly instead.\n *\n * When `options.basePath` is set, the handler rewrites the incoming Request\n * URL to strip that prefix before routing. This makes the bridge work\n * uniformly for both fetch hosts:\n *\n * - `Elysia.mount()` already strips the prefix before calling us — the\n * strip below is a no-op in that case.\n * - Next.js App Router preserves the full path — the strip is what lets\n * our internal routes (`/api/*`, `/config`, …) match.\n */\nexport function createFetchHandler(\n options: WorkbenchOptions | Queue[],\n): FetchHandlerResult {\n const core = new WorkbenchCore(options);\n const app = buildWorkbenchApp(core);\n const basePath = normalizeBasePath(core.options.basePath);\n\n const fetchHandler = async (req: Request): Promise<Response> => {\n if (basePath) {\n const url = new URL(req.url);\n if (\n url.pathname === basePath ||\n url.pathname.startsWith(`${basePath}/`)\n ) {\n const rewritten = url.pathname.slice(basePath.length) || \"/\";\n url.pathname = rewritten;\n const init: RequestInit = {\n method: req.method,\n headers: req.headers,\n body:\n req.method === \"GET\" || req.method === \"HEAD\"\n ? undefined\n : req.body,\n // @ts-expect-error duplex is required for streaming bodies in Node 18+\n duplex: \"half\",\n redirect: req.redirect,\n };\n return app.fetch(new Request(url.toString(), init));\n }\n }\n return app.fetch(req);\n };\n\n return {\n fetch: fetchHandler,\n core,\n };\n}\n\n/**\n * Normalize a base path: trim trailing slashes so we can do exact prefix\n * comparisons without double-slashes. Returns `null` for the default mount\n * (`\"\"` or `\"/\"`) so the no-strip fast path runs.\n */\nfunction normalizeBasePath(value: string | undefined): string | null {\n if (!value) return null;\n const trimmed = value.endsWith(\"/\") ? value.slice(0, -1) : value;\n if (trimmed === \"\" || trimmed === \"/\") return null;\n return trimmed.startsWith(\"/\") ? trimmed : `/${trimmed}`;\n}\n","/**\n * Parse a `Basic` Authorization header and check it against the configured\n * credentials. Uses constant-time comparison to avoid leaking timing info\n * about which character mismatched.\n *\n * Returns `true` when credentials are valid, `false` otherwise. Both inputs\n * being undefined or empty count as a failed check — adapters should only\n * call this when `core.requiresAuth()` is true.\n */\nexport function checkBasicAuth(\n authHeader: string | undefined,\n username: string,\n password: string,\n): boolean {\n if (!authHeader) return false;\n\n const [scheme, encoded] = authHeader.split(\" \");\n if (!scheme || scheme.toLowerCase() !== \"basic\" || !encoded) return false;\n\n let decoded: string;\n try {\n decoded = Buffer.from(encoded, \"base64\").toString(\"utf-8\");\n } catch {\n return false;\n }\n\n const idx = decoded.indexOf(\":\");\n if (idx === -1) return false;\n const user = decoded.slice(0, idx);\n const pass = decoded.slice(idx + 1);\n\n return safeEqual(user, username) && safeEqual(pass, password);\n}\n\n/**\n * Constant-time string compare. Returns false immediately on length mismatch\n * (length itself is not secret — protecting against timing leaks on the\n * character-by-character compare is what matters).\n */\nfunction safeEqual(a: string, b: string): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) {\n diff |= a.charCodeAt(i) ^ b.charCodeAt(i);\n }\n return diff === 0;\n}\n\n/**\n * Standard 401 response body + header for an unauthenticated Basic auth\n * request. Adapters use this when `checkBasicAuth` returns false.\n */\nexport const BASIC_AUTH_CHALLENGE = {\n status: 401 as const,\n headers: { \"WWW-Authenticate\": 'Basic realm=\"Workbench\"' },\n body: \"Unauthorized\",\n};\n"],"mappings":";;;;;;;;;;;AAAA,SAAS,aAAgC;AACzC,SAAS,aAAa;AAUtB,eAAsB,eACpB,YACA,SAAS,QACS;AAClB,QAAM,aAAa,oBAAoB,UAAU;AACjD,QAAM,SAAS,iBAAiB,UAAU;AAM1C,QAAM,aAAa,kBAAkB,MAAM;AAE3C,MAAI;AACF,UAAM,QAAQ,KAAK,CAAC,OAAO,KAAK,GAAG,WAAW,OAAO,CAAC;AACtD,UAAM,QAAQ,MAAM,eAAe,QAAQ,MAAM;AACjD,WAAO,MAAM;AAAA,MACX,CAAC,SACC,IAAI,MAAM,MAAM;AAAA,QACd,YAAY,EAAE,GAAG,WAAW;AAAA,QAC5B;AAAA,MACF,CAAC;AAAA,IACL;AAAA,EACF,UAAE;AACA,eAAW,QAAQ;AACnB,WAAO,WAAW;AAAA,EACpB;AACF;AAEA,SAAS,kBAAkB,QAGzB;AACA,MAAI,UAAyC;AAC7C,QAAM,UAAU,IAAI,QAAe,CAAC,GAAG,WAAW;AAChD,cAAU,CAAC,QAAQ,OAAO,GAAG;AAC7B,WAAO,KAAK,SAAS,OAAO;AAAA,EAC9B,CAAC;AAGD,SAAO,GAAG,SAAS,MAAM;AAAA,EAAC,CAAC;AAC3B,SAAO;AAAA,IACL;AAAA,IACA,SAAS,MAAM;AACb,UAAI,QAAS,QAAO,IAAI,SAAS,OAAO;AAAA,IAC1C;AAAA,EACF;AACF;AAQA,SAAS,oBACP,YACiC;AACjC,MAAI,OAAO,eAAe,UAAU;AAClC,WAAO,EAAE,KAAK,WAAW;AAAA,EAC3B;AACA,SAAO,EAAE,GAAG,WAAW;AACzB;AAEA,SAAS,iBAAiB,MAA8C;AAGtE,QAAM,EAAE,KAAK,GAAG,KAAK,IAAI;AACzB,MAAI,KAAK;AACP,WAAO,IAAI,MAAM,KAAK;AAAA,MACpB,GAAG;AAAA,MACH,aAAa;AAAA,MACb,sBAAsB;AAAA,IACxB,CAAC;AAAA,EACH;AACA,SAAO,IAAI,MAAM,EAAE,GAAG,MAAM,aAAa,OAAO,sBAAsB,EAAE,CAAC;AAC3E;AAOA,eAAe,eACb,QACA,QACmB;AACnB,QAAM,UAAU,GAAG,MAAM;AACzB,QAAM,QAAQ,oBAAI,IAAY;AAC9B,MAAI,SAAS;AAEb,KAAG;AACD,UAAM,CAAC,MAAM,KAAK,IAAI,MAAM,OAAO;AAAA,MACjC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS;AACT,eAAW,OAAO,OAAO;AACvB,YAAM,OAAO,eAAe,KAAK,MAAM;AACvC,UAAI,KAAM,OAAM,IAAI,IAAI;AAAA,IAC1B;AAAA,EACF,SAAS,WAAW;AAEpB,SAAO,MAAM,KAAK,KAAK,EAAE,KAAK;AAChC;AAEA,SAAS,eAAe,KAAa,QAA+B;AAClE,QAAM,OAAO,GAAG,MAAM;AACtB,QAAM,OAAO;AACb,MAAI,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,IAAI,SAAS,IAAI,EAAG,QAAO;AACzD,SAAO,IAAI,MAAM,KAAK,QAAQ,IAAI,SAAS,KAAK,MAAM;AACxD;;;AC7HA,SAAS,oBAA0C;AACnD,SAAS,gBAAgB;AA4BlB,IAAM,eAAN,MAAmB;AAAA,EAChB,SAA6B,oBAAI,IAAI;AAAA,EACrC,YAAsB,CAAC;AAAA,EACvB,eAAoC;AAAA;AAAA;AAAA,EAIpC,QAAQ,IAAI,SAAsB;AAAA,IACxC,KAAK;AAAA;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,gBAAgB;AAAA;AAAA,EAClB,CAAC;AAAA,EAEgB,YAAY;AAAA,IAC3B,SAAS,IAAI,KAAK;AAAA;AAAA,IAClB,UAAU,IAAI,KAAK;AAAA;AAAA,IACnB,QAAQ,IAAI,KAAK;AAAA;AAAA,IACjB,OAAO,IAAI,KAAK;AAAA;AAAA,IAChB,UAAU,IAAI,KAAK;AAAA;AAAA,EACrB;AAAA,EAEA,YAAY,QAAiB,YAAsB,CAAC,GAAG;AACrD,eAAW,SAAS,QAAQ;AAC1B,WAAK,OAAO,IAAI,MAAM,MAAM,KAAK;AAAA,IACnC;AACA,SAAK,YAAY;AAGjB,UAAM,aAAa,OAAO,CAAC;AAC3B,QAAI,YAAY;AACd,YAAM,aAAa,WAAW,MAAM;AACpC,UAAI,YAAY;AACd,aAAK,eAAe,IAAI,aAAa,EAAE,WAAW,CAAC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,OACZ,KACA,KACA,SACY;AACZ,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AACjC,QAAI,WAAW,QAAW;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,MAAM,QAAQ;AAC3B,SAAK,MAAM,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC;AACjC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,YACZ,SACA,WACA,cACY;AACZ,QAAI;AAEJ,UAAM,iBAAiB,IAAI,QAAW,CAAC,GAAG,WAAW;AACnD,kBAAY,WAAW,MAAM,OAAO,IAAI,MAAM,YAAY,CAAC,GAAG,SAAS;AAAA,IACzE,CAAC;AAED,QAAI;AACF,aAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,IACrD,UAAE;AACA,mBAAa,SAAS;AAAA,IACxB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,mBACZ,OACA,QACA,WACA,SACA,OACgB;AAChB,QAAI;AAEF,YAAM,SAAU,MAAc;AAC9B,UAAI,CAAC,QAAQ;AAEX,cAAMA,QAAO,MAAM,MAAM,QAAQ,CAAC,MAAM,GAAG,GAAG,QAAQ,CAAC;AACvD,eAAOA,MAAK;AAAA,UACV,CAAC,QACC,IAAI,cACJ,IAAI,cAAc,aAClB,IAAI,cAAc;AAAA,QACtB;AAAA,MACF;AAIA,YAAM,WAAW,QAAQ,MAAM,IAAI,IAAI,MAAM;AAC7C,YAAM,SAAS,MAAM,OAAO;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,CAAC,UAAU,OAAO,WAAW,GAAG;AAClC,eAAO,CAAC;AAAA,MACV;AAGA,YAAM,cAAc,OAAO,IAAI,CAAC,UAAkB,MAAM,OAAO,KAAK,CAAC;AACrE,YAAM,OAAO,MAAM,QAAQ,IAAI,WAAW;AAG1C,aAAO,KAAK;AAAA,QACV,CAAC,QAAoB,QAAQ,QAAQ,QAAQ;AAAA,MAC/C;AAAA,IACF,SAAS,QAAQ;AAEf,YAAM,OAAO,MAAM,MAAM,QAAQ,CAAC,MAAM,GAAG,GAAG,QAAQ,CAAC;AACvD,aAAO,KAAK;AAAA,QACV,CAAC,QACC,IAAI,cACJ,IAAI,cAAc,aAClB,IAAI,cAAc;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,IAAI,SAA4B;AAAA,IACtD,KAAK;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,EACd,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,aAAa,IAAI,SAGvB;AAAA,IACA,KAAK;AAAA;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,EACd,CAAC;AAAA;AAAA;AAAA;AAAA,EAKD,MAAc,mBACZ,OACqD;AACrD,UAAM,WAAW,MAAM;AACvB,UAAM,SAAS,KAAK,WAAW,IAAI,QAAQ;AAC3C,QAAI,WAAW,QAAW;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,SAAS,MAAM,MAAM,aAAa;AACxC,SAAK,WAAW,IAAI,UAAU,MAAM;AACpC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,WAAmB,OAAsB;AAElE,SAAK,WAAW,OAAO,SAAS;AAGhC,QAAI,OAAO;AACT,YAAM,gBAAgB,GAAG,SAAS,IAAI,KAAK;AAC3C,WAAK,cAAc,OAAO,aAAa;AAAA,IACzC;AAKA,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,UAAU;AAC5B,SAAK,MAAM,OAAO,UAAU;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,QAAuB;AAChC,QAAI,QAAQ;AACV,iBAAW,OAAO,KAAK,MAAM,KAAK,GAAG;AACnC,YAAI,IAAI,WAAW,MAAM,GAAG;AAC1B,eAAK,MAAM,OAAO,GAAG;AAAA,QACvB;AAAA,MACF;AAAA,IACF,OAAO;AACL,WAAK,MAAM,MAAM;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAQH;AAED,WAAO,KAAK,OAAO,gBAAgB,KAAM,YAAY;AACnD,YAAM,SAAS;AAAA,QACb,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,OAAO;AAAA,QACP,WAAW,KAAK,IAAI;AAAA,MACtB;AAEA,YAAM,QAAQ;AAAA,QACZ,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,OAAO,UAAU;AACpD,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,iBAAO,WAAW,OAAO,WAAW;AACpC,iBAAO,UAAU,OAAO,UAAU;AAClC,iBAAO,aAAa,OAAO,aAAa;AACxC,iBAAO,UAAU,OAAO,UAAU;AAClC,iBAAO,WAAW,OAAO,WAAW;AAAA,QACtC,CAAC;AAAA,MACH;AAEA,aAAO,QACL,OAAO,UACP,OAAO,SACP,OAAO,YACP,OAAO,SACP,OAAO;AAET,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,eAAyB;AACvB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAA0B;AACxB,WAAO,MAAM,KAAK,KAAK,OAAO,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,MAAiC;AACxC,WAAO,KAAK,OAAO,IAAI,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAkC;AACtC,WAAO,KAAK,OAAO,UAAU,KAAK,UAAU,QAAQ,YAAY;AAE9D,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,aAAa,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM;AACxC,gBAAM,CAAC,QAAQ,QAAQ,IAAI,MAAM,QAAQ,IAAI;AAAA,YAC3C,KAAK,mBAAmB,KAAK;AAAA,YAC7B,MAAM,SAAS;AAAA,UACjB,CAAC;AAED,iBAAO;AAAA,YACL;AAAA,YACA,QAAQ;AAAA,cACN,SAAS,OAAO,WAAW;AAAA,cAC3B,QAAQ,OAAO,UAAU;AAAA,cACzB,WAAW,OAAO,aAAa;AAAA,cAC/B,QAAQ,OAAO,UAAU;AAAA,cACzB,SAAS,OAAO,WAAW;AAAA,cAC3B,QAAQ,OAAO,UAAU;AAAA,YAC3B;AAAA,YACA;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cAAsC;AAC1C,WAAO,KAAK,OAAO,YAAY,KAAK,UAAU,UAAU,YAAY;AAClE,YAAM,SAAS,MAAM,KAAK,UAAU;AAEpC,UAAI,YAAY;AAChB,UAAI,aAAa;AACjB,UAAI,aAAa;AAEjB,iBAAW,SAAS,QAAQ;AAC1B,qBACE,MAAM,OAAO,UAAU,MAAM,OAAO,SAAS,MAAM,OAAO;AAC5D,sBAAc,MAAM,OAAO;AAC3B,sBAAc,MAAM,OAAO;AAAA,MAC7B;AAGA,YAAM,iBAAiB,OAAO;AAAA,QAC5B,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO;AAAA,QAC3B;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,aAAa;AAAA;AAAA,QACb;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAAW,WAAkC;AACjD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,UAAM,MAAM,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAY,WAAkC;AAClD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,UAAM,MAAM,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cAAc,WAAqC;AACvD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,WAAO,MAAM,SAAS;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,aAAuC;AAC3C,WAAO,KAAK,OAAO,WAAW,KAAK,UAAU,SAAS,YAAY;AAChE,aAAO,KAAK;AAAA,SACT,YAAY;AACX,gBAAM,MAAM,KAAK,IAAI;AACrB,gBAAM,qBAAqB,MAAM,KAAK,KAAK,KAAK;AAGhD,gBAAM,qBAAqB,MAAsB;AAC/C,kBAAM,UAA0B,CAAC;AACjC,kBAAM,YACJ,KAAK,MAAM,sBAAsB,KAAK,KAAK,IAAK,KAC/C,KAAK,KAAK;AACb,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,sBAAQ,KAAK;AAAA,gBACX,MAAM,YAAY,IAAI,KAAK,KAAK;AAAA,gBAChC,WAAW;AAAA,gBACX,QAAQ;AAAA,gBACR,aAAa;AAAA,gBACb,aAAa;AAAA,cACf,CAAC;AAAA,YACH;AACA,mBAAO;AAAA,UACT;AAEA,gBAAM,kBAAkB,oBAAI,IAO1B;AAGF,qBAAW,aAAa,KAAK,OAAO,KAAK,GAAG;AAC1C,4BAAgB,IAAI,WAAW;AAAA,cAC7B,SAAS,mBAAmB;AAAA,cAC5B,WAAW,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,cAC9C,WAAW,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,YAChD,CAAC;AAAA,UACH;AAGA,gBAAM,UAKD,CAAC;AACN,gBAAM,eAAe,oBAAI,IAQvB;AAIF,gBAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,gBAAM,cAAc,MAAM,QAAQ;AAAA,YAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,oBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,gBACA,kBACG,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,KAAK;AAAA,cAC1D;AAAA,YACF,CAAC;AAAA,UACH;AAGA,gBAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAElE,gBAAM,eAAe,MAAM,QAAQ;AAAA,YACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AAGjD,oBAAM,CAAC,eAAe,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,gBACpD,KAAK;AAAA,kBACH;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA;AAAA,gBACF;AAAA,gBACA,KAAK;AAAA,kBACH;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA;AAAA,gBACF;AAAA,cACF,CAAC;AACD,qBAAO,EAAE,WAAW,eAAe,WAAW;AAAA,YAChD,CAAC;AAAA,UACH;AAGA,qBAAW,EAAE,WAAW,eAAe,WAAW,KAAK,cAAc;AACnE,kBAAM,UAAU,gBAAgB,IAAI,SAAS;AAG7C,uBAAW,OAAO,eAAe;AAC/B,kBAAI,CAAC,KAAK,cAAc,IAAI,aAAa;AACvC;AAEF,oBAAM,cAAc,KAAK;AAAA,iBACtB,IAAI,cAAc,QAAQ,QAAQ,CAAC,GAAG,QAAQ,OAC5C,KAAK,KAAK;AAAA,cACf;AACA,kBAAI,eAAe,KAAK,cAAc,IAAI;AACxC,wBAAQ,QAAQ,WAAW,EAAE;AAE7B,sBAAM,WAAW,IAAI,cACjB,IAAI,aAAa,IAAI,cACrB;AACJ,sBAAM,WAAW,IAAI,cACjB,IAAI,cAAc,IAAI,YACtB;AAEJ,oBAAI,WAAW,GAAG;AAChB,0BAAQ,UAAU,WAAW,EAAE,KAAK,QAAQ;AAC5C,0BAAQ,KAAK;AAAA,oBACX,MAAM,IAAI;AAAA,oBACV;AAAA,oBACA;AAAA,oBACA,OAAO,IAAI,MAAM;AAAA,kBACnB,CAAC;AAAA,gBACH;AACA,oBAAI,WAAW,GAAG;AAChB,0BAAQ,UAAU,WAAW,EAAE,KAAK,QAAQ;AAAA,gBAC9C;AAAA,cACF;AAGA,oBAAM,MAAM,GAAG,SAAS,IAAI,IAAI,IAAI;AACpC,oBAAM,QAAQ,aAAa,IAAI,GAAG,KAAK;AAAA,gBACrC,MAAM,IAAI;AAAA,gBACV;AAAA,gBACA,WAAW;AAAA,gBACX,QAAQ;AAAA,cACV;AACA,oBAAM;AACN,2BAAa,IAAI,KAAK,KAAK;AAAA,YAC7B;AAGA,uBAAW,OAAO,YAAY;AAC5B,kBAAI,CAAC,KAAK,cAAc,IAAI,aAAa;AACvC;AAEF,oBAAM,cAAc,KAAK;AAAA,iBACtB,IAAI,cAAc,QAAQ,QAAQ,CAAC,GAAG,QAAQ,OAC5C,KAAK,KAAK;AAAA,cACf;AACA,kBAAI,eAAe,KAAK,cAAc,IAAI;AACxC,wBAAQ,QAAQ,WAAW,EAAE;AAAA,cAC/B;AAGA,oBAAM,MAAM,GAAG,SAAS,IAAI,IAAI,IAAI;AACpC,oBAAM,QAAQ,aAAa,IAAI,GAAG,KAAK;AAAA,gBACrC,MAAM,IAAI;AAAA,gBACV;AAAA,gBACA,WAAW;AAAA,gBACX,QAAQ;AAAA,cACV;AACA,oBAAM;AACN,2BAAa,IAAI,KAAK,KAAK;AAAA,YAC7B;AAAA,UACF;AAGA,qBAAW,WAAW,gBAAgB,OAAO,GAAG;AAC9C,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,oBAAM,YAAY,QAAQ,UAAU,CAAC;AACrC,oBAAM,YAAY,QAAQ,UAAU,CAAC;AACrC,kBAAI,UAAU,SAAS,GAAG;AACxB,wBAAQ,QAAQ,CAAC,EAAE,cAAc,KAAK;AAAA,kBACpC,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAAA,gBACnD;AAAA,cACF;AACA,kBAAI,UAAU,SAAS,GAAG;AACxB,wBAAQ,QAAQ,CAAC,EAAE,cAAc,KAAK;AAAA,kBACpC,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAAA,gBACnD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAMA,gBAAM,mBAAmB,mBAAmB;AAC5C,gBAAM,qBAAiC,MAAM;AAAA,YAC3C,EAAE,QAAQ,GAAG;AAAA,YACb,MAAM,CAAC;AAAA,UACT;AACA,gBAAM,qBAAiC,MAAM;AAAA,YAC3C,EAAE,QAAQ,GAAG;AAAA,YACb,MAAM,CAAC;AAAA,UACT;AAEA,qBAAW,WAAW,gBAAgB,OAAO,GAAG;AAC9C,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,+BAAiB,CAAC,EAAE,aAAa,QAAQ,QAAQ,CAAC,EAAE;AACpD,+BAAiB,CAAC,EAAE,UAAU,QAAQ,QAAQ,CAAC,EAAE;AACjD,iCAAmB,CAAC,EAAE,KAAK,GAAG,QAAQ,UAAU,CAAC,CAAC;AAClD,iCAAmB,CAAC,EAAE,KAAK,GAAG,QAAQ,UAAU,CAAC,CAAC;AAAA,YACpD;AAAA,UACF;AAGA,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,gBAAI,mBAAmB,CAAC,EAAE,SAAS,GAAG;AACpC,+BAAiB,CAAC,EAAE,cAAc,KAAK;AAAA,gBACrC,mBAAmB,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAC7C,mBAAmB,CAAC,EAAE;AAAA,cAC1B;AAAA,YACF;AACA,gBAAI,mBAAmB,CAAC,EAAE,SAAS,GAAG;AACpC,+BAAiB,CAAC,EAAE,cAAc,KAAK;AAAA,gBACrC,mBAAmB,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAC7C,mBAAmB,CAAC,EAAE;AAAA,cAC1B;AAAA,YACF;AAAA,UACF;AAEA,gBAAM,iBAAiB,iBAAiB;AAAA,YACtC,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,YACpB;AAAA,UACF;AACA,gBAAM,cAAc,iBAAiB;AAAA,YACnC,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,YACpB;AAAA,UACF;AACA,gBAAM,eAAe,mBAAmB,KAAK;AAC7C,gBAAM,eAAe,mBAAmB,KAAK;AAG7C,gBAAM,cAAc,QACjB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ,EACtC,MAAM,GAAG,EAAE;AAGd,gBAAM,mBAAmB,MAAM,KAAK,aAAa,OAAO,CAAC,EACtD,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,OAAO;AAAA,YACX,MAAM,EAAE;AAAA,YACR,WAAW,EAAE;AAAA,YACb,WAAW,EAAE;AAAA,YACb,YAAY,EAAE,YAAY,EAAE;AAAA,YAC5B,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE;AAAA,UACzC,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EACxC,MAAM,GAAG,EAAE;AAEd,iBAAO;AAAA,YACL,QAAQ,CAAC;AAAA;AAAA,YACT,WAAW;AAAA,cACT,WAAW;AAAA,cACX,SAAS;AAAA,cACT,SAAS;AAAA,gBACP;AAAA,gBACA;AAAA,gBACA,WACE,iBAAiB,cAAc,IAC3B,eAAe,iBAAiB,eAChC;AAAA,gBACN,aACE,aAAa,SAAS,IAClB,KAAK;AAAA,kBACH,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IACpC,aAAa;AAAA,gBACjB,IACA;AAAA,gBACN,aACE,aAAa,SAAS,IAClB,KAAK;AAAA,kBACH,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IACpC,aAAa;AAAA,gBACjB,IACA;AAAA,gBACN,mBAAmB,KAAK;AAAA,mBACrB,iBAAiB,eAAe;AAAA,gBACnC;AAAA,cACF;AAAA,YACF;AAAA,YACA;AAAA,YACA;AAAA,YACA,YAAY;AAAA,UACd;AAAA,QACF,GAAG;AAAA,QACH;AAAA;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,mBAAmD;AACvD,WAAO,KAAK,OAAO,YAAY,KAAK,UAAU,UAAU,YAAY;AAClE,YAAM,MAAM,KAAK,IAAI;AACrB,YAAM,aAAa,IAAI,KAAK,KAAK;AACjC,YAAM,cAAc;AAGpB,YAAM,YAAY,IAAI,KAAK,GAAG;AAC9B,gBAAU,SAAS,GAAG,GAAG,GAAG,CAAC;AAC7B,gBAAU,QAAQ,UAAU,QAAQ,IAAI,CAAC;AACzC,YAAM,YAAY,UAAU,QAAQ;AAGpC,YAAM,UAA4B,CAAC;AACnC,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,gBAAQ,KAAK;AAAA,UACX,MAAM,YAAY,IAAI;AAAA,UACtB,WAAW;AAAA,UACX,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAIA,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,YAAM,cAAc,MAAM,QAAQ;AAAA,QAChC,aAAa,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM;AACpC,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,iBAAO;AAAA,YACL;AAAA,YACA,kBACG,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,KAAK;AAAA,UAC1D;AAAA,QACF,CAAC;AAAA,MACH;AAGA,YAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAElE,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,eAAe,IAAI,OAAO,EAAE,MAAM,MAAM;AAGtC,gBAAM,CAAC,eAAe,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,YACpD,KAAK;AAAA,cACH;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAAA,YACF;AAAA,YACA,KAAK;AAAA,cACH;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAAA,YACF;AAAA,UACF,CAAC;AACD,iBAAO,EAAE,eAAe,WAAW;AAAA,QACrC,CAAC;AAAA,MACH;AAGA,iBAAW,EAAE,eAAe,WAAW,KAAK,cAAc;AAExD,mBAAW,OAAO,eAAe;AAC/B,cAAI,CAAC,KAAK,cAAc,IAAI,aAAa,UAAW;AAEpD,gBAAM,cAAc,KAAK;AAAA,aACtB,IAAI,aAAa,aAAa;AAAA,UACjC;AACA,cAAI,eAAe,KAAK,cAAc,aAAa;AACjD,oBAAQ,WAAW,EAAE;AAAA,UACvB;AAAA,QACF;AAGA,mBAAW,OAAO,YAAY;AAC5B,cAAI,CAAC,KAAK,cAAc,IAAI,aAAa,UAAW;AAEpD,gBAAM,cAAc,KAAK;AAAA,aACtB,IAAI,aAAa,aAAa;AAAA,UACjC;AACA,cAAI,eAAe,KAAK,cAAc,aAAa;AACjD,oBAAQ,WAAW,EAAE;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAEA,YAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AACtE,YAAM,cAAc,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AAEhE,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QACJ,WACA,QACA,QAAQ,IACR,QAAQ,GACR,MACqC;AACrC,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,aAAO,EAAE,MAAM,CAAC,GAAG,OAAO,GAAG,SAAS,MAAM;AAAA,IAC9C;AAEA,UAAM,QAAQ,SACV,CAAC,MAAM,IACP,CAAC,WAAW,UAAU,aAAa,UAAU,SAAS;AAG1D,UAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAGlD,UAAM,gBAAkD,CAAC;AACzD,QAAI,QAAQ;AAEZ,eAAW,QAAQ,OAAO;AACxB,YAAM,WAAW,MAAM,MAAM,QAAQ,MAAa,OAAO,QAAQ,KAAK;AACtE,oBAAc;AAAA,QACZ,GAAG,SAAS,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,MAC9D;AAEA,YAAM,YAAY,OAAO,IAA2B,KAAK;AACzD,eAAS;AAAA,IACX;AAGA,UAAM,WAAY,MAAM,QAAQ;AAAA,MAC9B,cAAc,IAAI,CAAC,EAAE,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK,CAAC;AAAA,IAC1E;AAGA,UAAM,YAAY,MAAM,SAAS;AACjC,UAAM,UAAU,MAAM,cAAc,QAAQ,IAAI;AAEhD,aAAS,KAAK,CAAC,GAAG,MAAM;AACtB,YAAM,OAAO,KAAK,aAAa,GAAG,SAAS;AAC3C,YAAM,OAAO,KAAK,aAAa,GAAG,SAAS;AAC3C,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,OAAO,SAAS,MAAM,GAAG,KAAK;AAEpC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,SAAS,QAAQ,QAAQ;AAAA,MACzB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,KAAK,IAAI;AAAA,IAC1D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO,WAAmB,OAAwC;AACtE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,WAAO,KAAK,UAAU,KAAK,MAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,WAAmB,OAAiC;AACjE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,MAAM;AAChB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UAAU,WAAmB,OAAiC;AAClE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,OAAO;AACjB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,WAAmB,OAAiC;AACnE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,QAAQ;AAClB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAiB,OAGvB;AACA,UAAM,UAAkC,CAAC;AACzC,UAAM,YAAsB,CAAC;AAC7B,UAAM,MAAM,MAAM;AAClB,QAAI,IAAI;AAER,WAAO,IAAI,KAAK;AACd,aAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,UAAI,KAAK,IAAK;AAEd,UAAI,IAAI;AACR,aAAO,IAAI,OAAO,KAAK,KAAK,MAAM,CAAC,CAAE,EAAG;AAExC,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK;AACxC,cAAM,QAAQ,MAAM,MAAM,GAAG,CAAC;AAC9B;AAEA,YAAI;AACJ,YAAI,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK;AAC/B;AACA,gBAAM,aAAa,MAAM,QAAQ,KAAK,CAAC;AACvC,cAAI,eAAe,IAAI;AACrB,oBAAQ,MAAM,MAAM,GAAG,UAAU;AACjC,gBAAI,aAAa;AAAA,UACnB,OAAO;AACL,oBAAQ,MAAM,MAAM,CAAC;AACrB,gBAAI;AAAA,UACN;AAAA,QACF,OAAO;AACL,gBAAM,aAAa;AACnB,iBAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,kBAAQ,MAAM,MAAM,YAAY,CAAC;AAAA,QACnC;AAEA,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI;AAAA,QACnB,OAAO;AACL,oBAAU,KAAK,GAAG,KAAK,GAAG;AAAA,QAC5B;AACA,YAAI;AAAA,MACN,OAAO;AACL,cAAM,QAAQ;AACd,eAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,kBAAU,KAAK,MAAM,MAAM,OAAO,CAAC,CAAC;AAAA,MACtC;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,MAAM,UAAU,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,qBACN,KACA,SAMS;AAKT,QAAI,QAAQ,WAAW;AACrB,YAAM,UAAU,IAAI,eAAe,IAAI,cAAc,IAAI,aAAa;AACtE,UACE,UAAU,QAAQ,UAAU,SAC5B,UAAU,QAAQ,UAAU,KAC5B;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,QAAQ,QAAQ,OAAO,KAAK,QAAQ,IAAI,EAAE,SAAS,GAAG;AACxD,UAAI,CAAC,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,eAAO;AAAA,MACT;AACA,YAAM,UAAU,IAAI;AACpB,iBAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,QAAQ,IAAI,GAAG;AACzD,cAAM,WAAW,QAAQ,KAAK;AAC9B,YAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,iBAAO;AAAA,QACT;AAEA,cAAM,cAAc,OAAO,QAAQ,EAAE,YAAY;AACjD,cAAM,iBAAiB,MAAM,YAAY;AACzC,YAAI,CAAC,YAAY,SAAS,cAAc,GAAG;AACzC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAGA,QAAI,QAAQ,MAAM;AAChB,YAAM,YAAY,QAAQ,KAAK,YAAY;AAC3C,YAAM,YAAY,IAAI,IAAI,YAAY,EAAE,SAAS,SAAS;AAC1D,YAAM,cAAc,IAAI,MAAM,YAAY,EAAE,SAAS,SAAS;AAE9D,UAAI,CAAC,aAAa,CAAC,aAAa;AAE9B,cAAM,kBAAkB,KAAK,UAAU,IAAI,IAAI,EAAE,YAAY;AAC7D,YAAI,CAAC,gBAAgB,SAAS,SAAS,GAAG;AACxC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,KACA,SACS;AACT,QAAI,CAAC,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,aAAO,OAAO,KAAK,OAAO,EAAE,WAAW;AAAA,IACzC;AAEA,UAAM,UAAU,IAAI;AACpB,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AACpD,YAAM,WAAW,QAAQ,KAAK;AAC9B,UAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,eAAO;AAAA,MACT;AAEA,YAAM,cAAc,OAAO,QAAQ,EAAE,YAAY;AACjD,YAAM,iBAAiB,MAAM,YAAY;AACzC,UAAI,CAAC,YAAY,SAAS,cAAc,GAAG;AACzC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAO,OAAe,QAAQ,IAA6B;AAC/D,UAAM,EAAE,SAAS,KAAK,IAAI,KAAK,iBAAiB,KAAK;AACrD,UAAM,YAAY,KAAK,YAAY;AACnC,UAAM,aAAa,OAAO,KAAK,OAAO,EAAE,SAAS;AACjD,UAAM,UAAU,UAAU,SAAS;AAGnC,QAAI,CAAC,cAAc,CAAC,SAAS;AAC3B,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,cAAc,MAAM,QAAQ;AAAA,MAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,cAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,cAAM,WACH,OAAO,WAAW,KAAK,MACvB,OAAO,UAAU,KAAK,MACtB,OAAO,aAAa,KAAK,MACzB,OAAO,UAAU,KAAK,MACtB,OAAO,WAAW,KAAK;AAC1B,eAAO,EAAE,WAAW,OAAO,QAAQ;AAAA,MACrC,CAAC;AAAA,IACH;AAEA,UAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,OAAO;AAC1D,QAAI,eAAe,WAAW,GAAG;AAC/B,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,QAAQ,CAAC,WAAW,UAAU,aAAa,UAAU,SAAS;AACpE,UAAM,aAAa,KAAK,IAAI,QAAQ,GAAG,EAAE;AAGzC,UAAM,uBAAuB,oBAAI,QAAqB;AAGtD,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AAEjD,cAAM,cAAc,MAAM,QAAQ;AAAA,UAChC,MAAM,IAAI,OAAO,SAAS;AACxB,gBAAI;AACF,oBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,oBAAM,UAA0B,CAAC;AAEjC,yBAAW,OAAO,MAAM;AAEtB,oBAAI,cAAc,CAAC,KAAK,kBAAkB,KAAK,OAAO,GAAG;AACvD;AAAA,gBACF;AAGA,oBAAI,SAAS;AACX,wBAAM,YAAY,IAAI,IAAI,YAAY,EAAE,SAAS,SAAS;AAC1D,wBAAM,cAAc,IAAI,MACpB,YAAY,EACb,SAAS,SAAS;AAGrB,sBAAI,cAAc;AAClB,sBAAI,CAAC,aAAa,CAAC,aAAa;AAE9B,wBAAI,kBAAkB,qBAAqB,IAAI,GAAG;AAClD,wBAAI,CAAC,iBAAiB;AACpB,wCAAkB,KAAK,UAAU,IAAI,IAAI,EAAE,YAAY;AACvD,2CAAqB,IAAI,KAAK,eAAe;AAAA,oBAC/C;AACA,kCAAc,gBAAgB,SAAS,SAAS;AAAA,kBAClD;AAEA,sBAAI,CAAC,aAAa,CAAC,eAAe,CAAC,aAAa;AAC9C;AAAA,kBACF;AAAA,gBACF;AAGA,wBAAQ,KAAK;AAAA,kBACX,OAAO;AAAA,kBACP,KAAM,MAAM,KAAK;AAAA,oBACf;AAAA,oBACA;AAAA,oBACA;AAAA,kBACF;AAAA,gBACF,CAAC;AAAA,cACH;AAEA,qBAAO;AAAA,YACT,QAAQ;AACN,qBAAO,CAAC;AAAA,YACV;AAAA,UACF,CAAC;AAAA,QACH;AAEA,eAAO,YAAY,KAAK;AAAA,MAC1B,CAAC;AAAA,IACH;AAGA,UAAM,aAA6B,CAAC;AACpC,eAAW,UAAU,cAAc;AACjC,UAAI,OAAO,WAAW,aAAa;AACjC,mBAAW,KAAK,GAAG,OAAO,KAAK;AAAA,MACjC;AAAA,IACF;AAGA,WAAO,WAAW,MAAM,GAAG,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UACJ,WACA,QACA,QAAQ,GACS;AACjB,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,UAAU,MAAM,MAAM,MAAM,OAAO,KAAM,MAAM;AACrD,WAAO,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,cACZ,OACA,OACyC;AACzC,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,YAAY,aAAa;AAE/B,QAAI,cAAc,GAAG;AACnB,aAAO,EAAE,MAAM,CAAC,GAAG,OAAO,IAAI,SAAS,OAAO,QAAQ,OAAU;AAAA,IAClE;AAIA,UAAM,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,MAAM,SAAS,IAAI,CAAC;AAGzE,UAAM,WAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAE7C,cAAM,OAAO,MAAM,MAAM,QAAQ,UAAiB,GAAG,aAAa;AAClE,eAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,UAAU,EAAE;AAAA,MAC/C,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,YAAM,YAAY,EAAE,IAAI,aAAa,MAAM,EAAE,IAAI,aAAa;AAC9D,UAAI,aAAa,EAAG,QAAO;AAE3B,aAAO,EAAE,UAAU,cAAc,EAAE,SAAS;AAAA,IAC9C,CAAC;AAGD,UAAM,gBAAgB,QAAQ,MAAM,OAAO,QAAQ,KAAK;AAGxD,UAAM,WAAW,MAAM,QAAQ;AAAA,MAC7B,cAAc,IAAI,OAAO,EAAE,KAAK,UAAU,MAAM;AAE9C,YAAI,QAAmB;AACvB,YAAI,IAAI,YAAY;AAClB,kBAAQ,IAAI,eAAe,WAAW;AAAA,QACxC,WAAW,IAAI,aAAa;AAC1B,kBAAQ;AAAA,QACV,WAAW,IAAI,SAAS,IAAI,QAAQ,GAAG;AACrC,kBAAQ;AAAA,QACV;AAEA,cAAM,OAAO,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK;AACpD,eAAO,EAAE,GAAG,MAAM,UAAU;AAAA,MAC9B,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,SAAS,QAAQ;AAEzC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA;AAAA,MACP;AAAA,MACA,QAAQ,UAAU,OAAO,QAAQ,SAAS,MAAM,IAAI;AAAA,IACtD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WACJ,QAAQ,IACR,QAAQ,GACR,MACA,SAMyC;AACzC,UAAM,YAAY,MAAM,SAAS;AACjC,UAAM,UAAU,MAAM,cAAc,QAAQ,IAAI;AAChD,UAAM,aAAa,CAAC,EAClB,SAAS,UACT,SAAS,QACT,SAAS,QACT,SAAS;AAEX,UAAM,kBAAkB,cAAc;AAItC,QAAI,CAAC,cAAc,mBAAmB,YAAY,IAAI;AACpD,aAAO,KAAK,cAAc,OAAO,KAAK;AAAA,IACxC;AAGA,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,UAAM,QAAQ,SAAS,SACnB,CAAC,QAAQ,MAAM,IACf,CAAC,WAAW,UAAU,aAAa,UAAU,SAAS;AAE1D,UAAM,eAAe,CAAC,CAAC,SAAS;AAChC,UAAM,YAAY,KAAK,IAAI,aAAa,QAAQ,CAAC;AAEjD,QAAI,aAAa,WAAW,GAAG;AAC7B,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,OAAO;AAAA,QACP,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAIA,UAAM,oBAAoB,KAAK;AAAA,MAC7B,KAAK,KAAM,QAAQ,IAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF;AAEA,QAAI,UAA+D,CAAC;AAGpE,UAAM,iBAAiB,OACrB,WACA,OACA,eACG;AAEH,UAAI,gBAAgB,SAAS,WAAW;AACtC,cAAM,gBAAkD,CAAC;AAGzD,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,gBAAgB,MAAM,KAAK;AAAA,YAC/B;AAAA,YACA;AAAA,YACA,QAAQ,UAAU;AAAA,YAClB,QAAQ,UAAU;AAAA,YAClB;AAAA,UACF;AACA,wBAAc;AAAA,YACZ,GAAG,cAAc,IAAI,CAAC,SAAS;AAAA,cAC7B;AAAA,cACA,OAAO;AAAA,YACT,EAAE;AAAA,UACJ;AAAA,QACF;AAEA,YAAI,MAAM,SAAS,QAAQ,GAAG;AAC5B,gBAAM,aAAa,MAAM,KAAK;AAAA,YAC5B;AAAA,YACA;AAAA,YACA,QAAQ,UAAU;AAAA,YAClB,QAAQ,UAAU;AAAA,YAClB;AAAA,UACF;AACA,wBAAc;AAAA,YACZ,GAAG,WAAW,IAAI,CAAC,SAAS;AAAA,cAC1B;AAAA,cACA,OAAO;AAAA,YACT,EAAE;AAAA,UACJ;AAAA,QACF;AAGA,cAAM,aAAa,MAAM;AAAA,UACvB,CAAC,MAAM,MAAM,eAAe,MAAM;AAAA,QACpC;AACA,YAAI,WAAW,SAAS,GAAG;AACzB,gBAAM,iBAAiB,MAAM,QAAQ;AAAA,YACnC,WAAW,IAAI,OAAO,SAAS;AAC7B,oBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,qBAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,YAC9D,CAAC;AAAA,UACH;AACA,wBAAc,KAAK,GAAG,eAAe,KAAK,CAAC;AAAA,QAC7C;AAEA,eAAO,cAAc,IAAI,CAAC,EAAE,KAAK,MAAM,OAAO;AAAA,UAC5C;AAAA,UACA;AAAA,UACA;AAAA,QACF,EAAE;AAAA,MACJ;AAGA,UAAI,SAAS,QAAQ;AACnB,cAAM,OAAO,MAAM,MAAM,QAAQ,QAAQ,QAAe,GAAG,UAAU;AACrE,eAAO,KAAK,IAAI,CAAC,SAAS;AAAA,UACxB;AAAA,UACA;AAAA,UACA,OAAO,QAAQ;AAAA,QACjB,EAAE;AAAA,MACJ;AAGA,YAAM,YAAY,MAAM,QAAQ;AAAA,QAC9B,MAAM,IAAI,OAAO,SAAS;AACxB,gBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,iBAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,QAC9D,CAAC;AAAA,MACH;AACA,aAAO,UACJ,KAAK,EACL,IAAI,CAAC,EAAE,KAAK,MAAM,OAAO,EAAE,KAAK,WAAW,MAAM,EAAE;AAAA,IACxD;AAGA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa;AAAA,QAAI,CAAC,CAAC,WAAW,KAAK,MACjC,eAAe,WAAW,OAAO,iBAAiB;AAAA,MACpD;AAAA,IACF;AACA,cAAU,QAAQ,KAAK;AAGvB,QAAI,SAAS;AACX,gBAAU,QAAQ;AAAA,QAAO,CAAC,EAAE,IAAI,MAC9B,KAAK,qBAAqB,KAAK,OAAO;AAAA,MACxC;AAAA,IACF;AAIA,QAAI,iBAAiB;AACnB,cAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,cAAM,QAAQ,EAAE,IAAI,aAAa;AACjC,cAAM,QAAQ,EAAE,IAAI,aAAa;AAEjC,cAAM,WAAW,YAAY,KAAK,QAAQ,QAAQ,QAAQ;AAC1D,YAAI,aAAa,EAAG,QAAO;AAE3B,cAAM,YAAY,EAAE,UAAU,cAAc,EAAE,SAAS;AACvD,YAAI,cAAc,EAAG,QAAO;AAE5B,gBAAQ,EAAE,IAAI,MAAM,IAAI,cAAc,EAAE,IAAI,MAAM,EAAE;AAAA,MACtD,CAAC;AAAA,IACH;AAGA,UAAM,gBAAgB,QAAQ,MAAM,OAAO,QAAQ,KAAK;AAGxD,UAAM,WAAW,MAAM,QAAQ;AAAA,MAC7B,cAAc,IAAI,OAAO,EAAE,KAAK,WAAW,MAAM,MAAM;AACrD,cAAM,OAAO,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK;AACpD,eAAO,EAAE,GAAG,MAAM,UAAU;AAAA,MAC9B,CAAC;AAAA,IACH;AAGA,QAAI,CAAC,iBAAiB;AACpB,eAAS,KAAK,CAAC,GAAG,MAAM;AACtB,cAAM,OAAO,KAAK,oBAAoB,GAAG,SAAS;AAClD,cAAM,OAAO,KAAK,oBAAoB,GAAG,SAAS;AAClD,YAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,YAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,SAAS,QAAQ;AAEzC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA;AAAA,MACP;AAAA,MACA,QAAQ,UAAU,OAAO,QAAQ,SAAS,MAAM,IAAI;AAAA,IACtD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cACJ,gBACA,aAIC;AACD,UAAM,aAA8B,CAAC;AACrC,UAAM,UAA4B,CAAC;AAGnC,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,cAAM,CAAC,gBAAgB,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,UACtD,MAAM,kBAAkB;AAAA,UACxB,MAAM,QAAQ,WAAW,GAAG,EAAE;AAAA,QAChC,CAAC;AACD,eAAO,EAAE,WAAW,gBAAgB,YAAY;AAAA,MAClD,CAAC;AAAA,IACH;AAGA,eAAW,EAAE,WAAW,gBAAgB,YAAY,KAAK,SAAS;AAChE,iBAAW,OAAO,gBAAgB;AAChC,mBAAW,KAAK;AAAA,UACd,KAAK,IAAI;AAAA,UACT,MAAM,IAAI,QAAQ;AAAA,UAClB;AAAA,UACA,SAAS,IAAI,WAAW;AAAA,UACxB,OAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,IAAI;AAAA,UACvC,MAAM,IAAI,QAAQ;AAAA,UAClB,SAAS,IAAI,WAAW;AAAA,UACxB,IAAI,IAAI,MAAM;AAAA,QAChB,CAAC;AAAA,MACH;AAEA,iBAAW,OAAO,aAAa;AAC7B,cAAM,QAAQ,IAAI,KAAK,SAAS;AAChC,gBAAQ,KAAK;AAAA,UACX,IAAI,IAAI,MAAM;AAAA,UACd,MAAM,IAAI;AAAA,UACV;AAAA,UACA;AAAA,UACA,WAAW,IAAI,YAAY;AAAA,UAC3B,MAAM,IAAI;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,UAAM,kBAAkB,gBAAgB,SAAS;AACjD,UAAM,gBAAgB,gBAAgB,cAAc,SAAS,KAAK;AAClE,eAAW,KAAK,CAAC,GAAG,MAAM;AACxB,YAAM,OAAO,KAAK,sBAAsB,GAAG,eAAe;AAC1D,YAAM,OAAO,KAAK,sBAAsB,GAAG,eAAe;AAC1D,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,eAAe,aAAa,SAAS;AAC3C,UAAM,aAAa,aAAa,cAAc,SAAS,KAAK;AAC5D,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,YAAM,OAAO,KAAK,oBAAoB,GAAG,YAAY;AACrD,YAAM,OAAO,KAAK,oBAAoB,GAAG,YAAY;AACrD,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAED,WAAO,EAAE,YAAY,QAAQ;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,SAAkD;AACjE,UAAM,QAAQ,KAAK,OAAO,IAAI,QAAQ,SAAS;AAC/C,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,QAAQ,SAAS,aAAa;AAAA,IAC1D;AAEA,UAAM,MAAM,MAAM,MAAM,IAAI,QAAQ,SAAS,QAAQ,MAAM;AAAA,MACzD,OAAO,QAAQ,MAAM;AAAA,MACrB,UAAU,QAAQ,MAAM;AAAA,MACxB,UAAU,QAAQ,MAAM;AAAA,IAC1B,CAAC;AAED,WAAO,EAAE,IAAI,IAAI,MAAM,GAAG;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKQ,YAAY,MAAoC;AACtD,QAAI,CAAC,KAAK,UAAU,UAAU,CAAC,QAAQ,OAAO,SAAS,UAAU;AAC/D,aAAO;AAAA,IACT;AAEA,UAAM,OAAgB,CAAC;AACvB,UAAM,UAAU;AAEhB,eAAW,SAAS,KAAK,WAAW;AAClC,YAAM,QAAQ,QAAQ,KAAK;AAC3B,UACE,UAAU,WACT,OAAO,UAAU,YAChB,OAAO,UAAU,YACjB,OAAO,UAAU,aACjB,UAAU,OACZ;AACA,aAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,IAAI,EAAE,SAAS,IAAI,OAAO;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,aACJ,OACA,QAAQ,IACqC;AAC7C,UAAM,WAAW,oBAAI,IAAoB;AACzC,UAAM,QAAQ,CAAC,WAAW,UAAU,aAAa,UAAU,SAAS;AAGpE,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,aAAa,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM;AACpC,cAAM,YAAY,MAAM,QAAQ;AAAA,UAC9B,MAAM,IAAI,CAAC,SAAS,MAAM,QAAQ,MAAa,GAAG,GAAG,CAAC;AAAA,QACxD;AACA,eAAO,UAAU,KAAK;AAAA,MACxB,CAAC;AAAA,IACH;AAGA,eAAW,QAAQ,cAAc;AAC/B,iBAAW,OAAO,MAAM;AACtB,YAAI,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC5C,gBAAM,UAAU,IAAI;AACpB,gBAAM,QAAQ,QAAQ,KAAK;AAC3B,cAAI,UAAU,UAAa,UAAU,MAAM;AACzC,kBAAM,WAAW,OAAO,KAAK;AAC7B,qBAAS,IAAI,WAAW,SAAS,IAAI,QAAQ,KAAK,KAAK,CAAC;AAAA,UAC1D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,UAAM,SAAS,MAAM,KAAK,SAAS,QAAQ,CAAC,EACzC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAM,EAAE;AAE7C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,aAAa;AAAA,MAC3B,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK,YAAY;AAAA,MAC1B,KAAK;AACH,eAAO,eAAe,OAAO,KAAK,UAAU,YAAY,IAAI;AAAA,MAC9D,KAAK;AACH,eAAO,KAAK,eAAe;AAAA,MAC7B;AACE,eAAO,KAAK,aAAa;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,aAAa;AAAA,MAC3B,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK,YAAY;AAAA,MAC1B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK,eAAe;AAAA,MAC7B;AACE,eAAO,KAAK,aAAa;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,sBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK,SAAS,YAAY,KAAK;AAAA,MACxC,KAAK;AACH,eAAO,KAAK,QAAQ;AAAA,MACtB,KAAK;AACH,eAAO,KAAK,IAAI,YAAY,KAAK;AAAA,MACnC;AACE,eAAO,KAAK,KAAK,YAAY;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK;AAAA,MACd;AACE,eAAO,KAAK;AAAA,IAChB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,UACZ,KACA,UAA2B,QAC3B,YACgC;AAGhC,QAAI,QAAQ;AACZ,QAAI,CAAC,OAAO;AACV,YAAM,WAAW,GAAG,IAAI,SAAS,IAAI,IAAI,EAAE;AAC3C,cAAQ,KAAK,cAAc,IAAI,QAAQ;AACvC,UAAI,CAAC,OAAO;AACV,gBAAS,MAAM,IAAI,SAAS;AAC5B,aAAK,cAAc,IAAI,UAAU,KAAK;AAAA,MACxC;AAAA,IACF;AACA,UAAM,WACJ,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAGN,QAAI,WAA4B;AAChC,QAAI,OAAO,IAAI,aAAa,UAAU;AACpC,iBAAW,IAAI;AAAA,IACjB,WAAW,OAAO,IAAI,aAAa,YAAY,IAAI,aAAa,MAAM;AACpE,iBAAW,IAAI;AAAA,IACjB;AAGA,UAAM,OAAO,KAAK,YAAY,IAAI,IAAI;AAGtC,QAAI;AACJ,QAAI,IAAI,QAAQ,IAAI;AAClB,eAAS;AAAA,QACP,IAAI,IAAI,OAAO;AAAA,QACf,WACE,IAAI,OAAO,UAAU,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,OAAO,YAAY;AAAA,MACjE;AAAA,IACF,WAAW,IAAI,WAAW;AAExB,YAAM,QAAQ,IAAI,UAAU,MAAM,GAAG;AACrC,UAAI,MAAM,UAAU,GAAG;AACrB,iBAAS;AAAA,UACP,IAAI,MAAM,MAAM,SAAS,CAAC,KAAK;AAAA,UAC/B,WAAW,MAAM,MAAM,SAAS,CAAC,KAAK;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,IAAI,IAAI,MAAM;AAAA,MACd,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,MAAM;AAAA,QACJ,UAAU,IAAI,KAAK;AAAA,QACnB,OAAO,IAAI,KAAK;AAAA,QAChB,UAAU,IAAI,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,MACA,cAAc,IAAI;AAAA,MAClB,aAAa,IAAI;AAAA,MACjB,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,cAAc,IAAI;AAAA,MAClB,YAAY,IAAI,cAAc;AAAA,MAC9B,aAAa,IAAI;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,UACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,MAAM;AAChB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,OAAO;AACjB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,QAAQ;AAClB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SAAS,QAAQ,IAA4B;AACjD,QAAI,CAAC,KAAK,cAAc;AACtB,aAAO,CAAC;AAAA,IACV;AAEA,WAAO,KAAK,OAAO,SAAS,KAAK,IAAI,KAAK,UAAU,OAAO,YAAY;AACrE,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,YAAM,cAAc,MAAM,QAAQ;AAAA,QAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,gBAAM,mBACH,OAAO,WAAW,KAAK,MACvB,OAAO,kBAAkB,KAAK,KAAK,MACnC,OAAO,UAAU,KAAK;AACzB,iBAAO,EAAE,WAAW,OAAO,gBAAgB;AAAA,QAC7C,CAAC;AAAA,MACH;AAEA,YAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAClE,UAAI,eAAe,WAAW,GAAG;AAC/B,eAAO,CAAC;AAAA,MACV;AAIA,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACjD,cAAI;AAEF,kBAAM,sBAAsB,MAAM,MAAM;AAAA,cACtC,CAAC,kBAAkB;AAAA,cACnB;AAAA,cACA;AAAA,YACF;AAGA,gBAAI,oBAAoB,UAAU,OAAO;AACvC,qBAAO,EAAE,WAAW,MAAM,oBAAoB;AAAA,YAChD;AAGA,kBAAM,aAAa;AAAA,cACjB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AACA,kBAAM,iBAAiB,MAAM,QAAQ;AAAA,cACnC,WAAW,IAAI,OAAO,SAAS;AAC7B,oBAAI;AACF,yBAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,EAAE;AAAA,gBAC/C,QAAQ;AACN,yBAAO,CAAC;AAAA,gBACV;AAAA,cACF,CAAC;AAAA,YACH;AAEA,kBAAM,UAAU,CAAC,GAAG,qBAAqB,GAAG,eAAe,KAAK,CAAC;AACjE,mBAAO,EAAE,WAAW,MAAM,QAAQ;AAAA,UACpC,QAAQ;AACN,mBAAO,EAAE,WAAW,MAAM,CAAC,EAAE;AAAA,UAC/B;AAAA,QACF,CAAC;AAAA,MACH;AAIA,YAAM,aAAa,oBAAI,IAAY;AACnC,YAAM,iBAAoD,CAAC;AAE3D,iBAAW,EAAE,WAAW,KAAK,KAAK,cAAc;AAE9C,YAAI,eAAe,UAAU,QAAQ,GAAG;AACtC;AAAA,QACF;AAEA,mBAAW,OAAO,MAAM;AACtB,cAAI,CAAC,KAAK,GAAI;AAEd,gBAAM,SAAS,GAAG,SAAS,IAAI,IAAI,EAAE;AACrC,cAAI,WAAW,IAAI,MAAM,EAAG;AAC5B,qBAAW,IAAI,MAAM;AAGrB,gBAAM,YAAY,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI;AACxC,cAAI,CAAC,WAAW;AACd,2BAAe,KAAK,EAAE,WAAW,IAAI,CAAC;AAGtC,gBAAI,eAAe,UAAU,QAAQ,GAAG;AACtC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,YAAM,YAAY;AAClB,YAAM,QAAuB,CAAC;AAE9B,eACM,IAAI,GACR,IAAI,eAAe,UAAU,MAAM,SAAS,OAC5C,KAAK,WACL;AACA,cAAM,QAAQ,eAAe,MAAM,GAAG,IAAI,SAAS;AACnD,cAAM,eAAe,MAAM,QAAQ;AAAA,UACjC,MAAM,IAAI,OAAO,EAAE,WAAW,IAAI,MAAM;AACtC,gBAAI;AACF,oBAAM,WAAW,MAAM,KAAK,aAAc,QAAQ;AAAA,gBAChD,IAAI,IAAI;AAAA,gBACR;AAAA,cACF,CAAC;AAED,kBAAI,UAAU,YAAY,SAAS,SAAS,SAAS,GAAG;AACtD,sBAAM,QAAQ,KAAK,eAAe,QAAQ;AAC1C,sBAAM,QAAQ,MAAM,IAAI,SAAS;AAEjC,uBAAO;AAAA,kBACL,IAAI,IAAI;AAAA,kBACR,MAAM,IAAI;AAAA,kBACV;AAAA,kBACA,QAAQ;AAAA,kBACR,WAAW,MAAM;AAAA,kBACjB,eAAe,MAAM;AAAA,kBACrB,YAAY,MAAM;AAAA,kBAClB,WAAW,IAAI;AAAA,kBACf,UACE,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAAA,gBACR;AAAA,cACF;AAAA,YACF,QAAQ;AAAA,YAER;AACA,mBAAO;AAAA,UACT,CAAC;AAAA,QACH;AAEA,mBAAW,UAAU,cAAc;AACjC,cAAI,UAAU,MAAM,SAAS,OAAO;AAClC,kBAAM,KAAK,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,IACvD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,WAAmB,OAAyC;AACxE,QAAI,CAAC,KAAK,cAAc;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,WAAW,MAAM,KAAK,aAAa,QAAQ;AAAA,QAC/C,IAAI;AAAA,QACJ;AAAA,MACF,CAAC;AAED,UAAI,CAAC,UAAU;AACb,eAAO;AAAA,MACT;AAEA,aAAO,KAAK,gBAAgB,QAAQ;AAAA,IACtC,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,SAAqD;AACpE,QAAI,CAAC,KAAK,cAAc;AACtB,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAChD;AAEA,UAAM,UAAU,KAAK,aAAa,OAAO;AACzC,UAAM,SAAS,MAAM,KAAK,aAAa,IAAI,OAAO;AAElD,WAAO,EAAE,IAAI,OAAO,IAAI,MAAM,GAAG;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKQ,aACN,SACK;AACL,UAAM,SAAc;AAAA,MAClB,MAAM,QAAQ;AAAA,MACd,WAAW,QAAQ;AAAA,MACnB,MAAM,QAAQ,QAAQ,CAAC;AAAA,IACzB;AAEA,QAAI,QAAQ,YAAY,QAAQ,SAAS,SAAS,GAAG;AACnD,aAAO,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACtC,KAAK,aAAa,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,gBAAgB,MAA8B;AAC1D,UAAM,MAAM,KAAK;AACjB,UAAM,QAAQ,MAAM,IAAI,SAAS;AACjC,UAAM,WACJ,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAEN,UAAM,UAAmB;AAAA,MACvB,IAAI,IAAI,MAAM;AAAA,MACd,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,MAAM;AAAA,QACJ,UAAU,IAAI,MAAM;AAAA,QACpB,OAAO,IAAI,MAAM;AAAA,QACjB,UAAU,IAAI,MAAM;AAAA,MACtB;AAAA,MACA,UACE,OAAO,IAAI,aAAa,WACpB,IAAI,WACJ,OAAO,IAAI,aAAa,WACtB,IAAI,WACJ;AAAA,MACR,cAAc,IAAI,gBAAgB;AAAA,MAClC,aAAa,IAAI;AAAA,MACjB,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,cAAc,IAAI;AAAA,MAClB,YAAY,IAAI,cAAc;AAAA,MAC9B,aAAa,IAAI;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA,MAAM,KAAK,YAAY,IAAI,IAAI;AAAA,IACjC;AAEA,UAAM,WAAuB,CAAC;AAC9B,QAAI,KAAK,YAAY,KAAK,SAAS,SAAS,GAAG;AAC7C,iBAAW,SAAS,KAAK,UAAU;AACjC,iBAAS,KAAK,MAAM,KAAK,gBAAgB,KAAK,CAAC;AAAA,MACjD;AAAA,IACF;AAEA,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,IAAI,aAAa,KAAK,aAAa;AAAA,MAC9C,UAAU,SAAS,SAAS,IAAI,WAAW;AAAA,IAC7C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,MAIrB;AACA,QAAI,QAAQ;AACZ,QAAI,YAAY;AAChB,QAAI,SAAS;AAGb,UAAM,MAAM,KAAK;AACjB,QAAI,IAAI,cAAc,CAAC,IAAI,cAAc;AACvC,kBAAY;AAAA,IACd,WAAW,IAAI,cAAc;AAC3B,eAAS;AAAA,IACX;AAEA,QAAI,KAAK,UAAU;AACjB,iBAAW,SAAS,KAAK,UAAU;AACjC,cAAM,aAAa,KAAK,eAAe,KAAK;AAC5C,iBAAS,WAAW;AACpB,qBAAa,WAAW;AACxB,kBAAU,WAAW;AAAA,MACvB;AAAA,IACF;AAEA,WAAO,EAAE,OAAO,WAAW,OAAO;AAAA,EACpC;AACF;;;ACvuEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EAChB;AAAA,EAEA;AAAA,EACA;AAAA,EAET,YACE,SACA,YAAkC,MAClC;AACA,UAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,EAAE,QAAQ,QAAQ,IAAI;AAE5D,SAAK,UAAU;AAAA,MACb,OAAO;AAAA,MACP,UAAU;AAAA,MACV,GAAG;AAAA,IACL;AAEA,SAAK,YAAY;AAEjB,UAAM,WAAW,KAAK,QAAQ,UAAU,CAAC;AACzC,UAAM,aAAa,CAAC,CAAC,KAAK,QAAQ;AAElC,QAAI,SAAS,WAAW,KAAK,CAAC,YAAY;AACxC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,SAAK,eAAe,IAAI,aAAa,UAAU,KAAK,QAAQ,QAAQ,CAAC,CAAC;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,aAAa,YAAY,MAAgD;AACvE,QAAI,KAAK,QAAQ,QAAQ;AACvB,aAAO,IAAI,eAAc,IAAI;AAAA,IAC/B;AACA,QAAI,CAAC,KAAK,OAAO;AACf,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,UAAM,SAAS,KAAK,UAAU;AAC9B,UAAM,MAAM,KAAK,aAAa;AAC9B,UAAM,MAAM,MAAM,eAAe,KAAK,OAAO,MAAM;AACnD,UAAM,SAAS,IAAI,MAAM,GAAG,GAAG;AAE/B,WAAO,IAAI;AAAA,MACT,EAAE,GAAG,MAAM,OAAO;AAAA,MAClB,EAAE,OAAO,IAAI,QAAQ,QAAQ,IAAI,SAAS,KAAK,IAAI;AAAA,IACrD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAgC;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,eAAwB;AACtB,WAAO,CAAC,EAAE,KAAK,QAAQ,MAAM,YAAY,KAAK,QAAQ,MAAM;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,UAAkB,UAA2B;AACxD,QAAI,CAAC,KAAK,aAAa,EAAG,QAAO;AACjC,WACE,aAAa,KAAK,QAAQ,MAAM,YAChC,aAAa,KAAK,QAAQ,MAAM;AAAA,EAEpC;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY;AACV,WAAO;AAAA,MACL,OAAO,KAAK,QAAQ;AAAA,MACpB,MAAM,KAAK,QAAQ;AAAA,MACnB,UAAU,KAAK,QAAQ;AAAA,MACvB,QAAQ,KAAK,aAAa,cAAc;AAAA,MACxC,MAAM,KAAK,aAAa,aAAa;AAAA,MACrC,WAAW,KAAK;AAAA,IAClB;AAAA,EACF;AACF;;;ACxFO,SAAS,mBACd,SACoB;AACpB,QAAM,OAAO,IAAI,cAAc,OAAO;AACtC,QAAM,MAAM,kBAAkB,IAAI;AAClC,QAAM,WAAW,kBAAkB,KAAK,QAAQ,QAAQ;AAExD,QAAM,eAAe,OAAO,QAAoC;AAC9D,QAAI,UAAU;AACZ,YAAM,MAAM,IAAI,IAAI,IAAI,GAAG;AAC3B,UACE,IAAI,aAAa,YACjB,IAAI,SAAS,WAAW,GAAG,QAAQ,GAAG,GACtC;AACA,cAAM,YAAY,IAAI,SAAS,MAAM,SAAS,MAAM,KAAK;AACzD,YAAI,WAAW;AACf,cAAM,OAAoB;AAAA,UACxB,QAAQ,IAAI;AAAA,UACZ,SAAS,IAAI;AAAA,UACb,MACE,IAAI,WAAW,SAAS,IAAI,WAAW,SACnC,SACA,IAAI;AAAA;AAAA,UAEV,QAAQ;AAAA,UACR,UAAU,IAAI;AAAA,QAChB;AACA,eAAO,IAAI,MAAM,IAAI,QAAQ,IAAI,SAAS,GAAG,IAAI,CAAC;AAAA,MACpD;AAAA,IACF;AACA,WAAO,IAAI,MAAM,GAAG;AAAA,EACtB;AAEA,SAAO;AAAA,IACL,OAAO;AAAA,IACP;AAAA,EACF;AACF;AAOA,SAAS,kBAAkB,OAA0C;AACnE,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,SAAS,GAAG,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAC3D,MAAI,YAAY,MAAM,YAAY,IAAK,QAAO;AAC9C,SAAO,QAAQ,WAAW,GAAG,IAAI,UAAU,IAAI,OAAO;AACxD;;;AC7EO,SAAS,eACd,YACA,UACA,UACS;AACT,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,CAAC,QAAQ,OAAO,IAAI,WAAW,MAAM,GAAG;AAC9C,MAAI,CAAC,UAAU,OAAO,YAAY,MAAM,WAAW,CAAC,QAAS,QAAO;AAEpE,MAAI;AACJ,MAAI;AACF,cAAU,OAAO,KAAK,SAAS,QAAQ,EAAE,SAAS,OAAO;AAAA,EAC3D,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,QAAQ,QAAQ,GAAG;AAC/B,MAAI,QAAQ,GAAI,QAAO;AACvB,QAAM,OAAO,QAAQ,MAAM,GAAG,GAAG;AACjC,QAAM,OAAO,QAAQ,MAAM,MAAM,CAAC;AAElC,SAAO,UAAU,MAAM,QAAQ,KAAK,UAAU,MAAM,QAAQ;AAC9D;AAOA,SAAS,UAAU,GAAW,GAAoB;AAChD,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAQ,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC;AAAA,EAC1C;AACA,SAAO,SAAS;AAClB;AAMO,IAAM,uBAAuB;AAAA,EAClC,QAAQ;AAAA,EACR,SAAS,EAAE,oBAAoB,0BAA0B;AAAA,EACzD,MAAM;AACR;","names":["jobs"]}
1
+ {"version":3,"sources":["../src/core/discover.ts","../src/core/queue-manager.ts","../src/core/workbench.ts","../src/api/fetch-handler.ts","../src/server/basic-auth.ts"],"sourcesContent":["import { Queue, type RedisOptions } from \"bullmq\";\nimport { Redis } from \"ioredis\";\n\n/**\n * Discover BullMQ queues on a Redis connection by scanning for `<prefix>:*:meta`\n * keys. Returns one `Queue` instance per discovered queue, each constructed\n * with a fresh clone of the connection options.\n *\n * Used by `WorkbenchCore.fromOptions` for the desktop client where the user\n * supplies a Redis URL but no explicit queue list.\n */\nexport async function discoverQueues(\n connection: string | RedisOptions,\n prefix = \"bull\",\n): Promise<Queue[]> {\n const normalized = normalizeConnection(connection);\n const client = createScanClient(normalized);\n\n // Surface the underlying connection error (ECONNREFUSED, NOAUTH, EAI_AGAIN,\n // ENOTFOUND, TLS errors, etc.) rather than letting ioredis bury it under a\n // \"max retries per request\" wrapper. We swap the first error in via the\n // event listener and reject the ping promise with it.\n const firstError = captureFirstError(client);\n\n try {\n await Promise.race([client.ping(), firstError.promise]);\n const names = await scanQueueNames(client, prefix);\n return names.map(\n (name) =>\n new Queue(name, {\n connection: { ...normalized },\n prefix,\n }),\n );\n } finally {\n firstError.dispose();\n client.disconnect();\n }\n}\n\nfunction captureFirstError(client: Redis): {\n promise: Promise<never>;\n dispose: () => void;\n} {\n let onError: ((err: Error) => void) | null = null;\n const promise = new Promise<never>((_, reject) => {\n onError = (err) => reject(err);\n client.once(\"error\", onError);\n });\n // Swallow further errors after the first so ioredis doesn't kill the\n // process with an \"unhandled error event\" once we've already rejected.\n client.on(\"error\", () => {});\n return {\n promise,\n dispose: () => {\n if (onError) client.off(\"error\", onError);\n },\n };\n}\n\n/**\n * Normalize a `string | RedisOptions` connection into a single `RedisOptions`\n * shape with `{ url }` (when a URL string was passed). BullMQ's `Queue`\n * accepts `{ url: \"redis://...\" }` but not a bare URL string, so this is the\n * canonical adapter form.\n */\nfunction normalizeConnection(\n connection: string | RedisOptions,\n): RedisOptions & { url?: string } {\n if (typeof connection === \"string\") {\n return { url: connection } as RedisOptions & { url?: string };\n }\n return { ...connection };\n}\n\nfunction createScanClient(opts: RedisOptions & { url?: string }): Redis {\n // ioredis accepts the `url` field directly via its constructor; we pass it\n // explicitly to make the `bun build --compile` static analysis happy.\n const { url, ...rest } = opts;\n if (url) {\n return new Redis(url, {\n ...rest,\n lazyConnect: false,\n maxRetriesPerRequest: 1,\n });\n }\n return new Redis({ ...rest, lazyConnect: false, maxRetriesPerRequest: 1 });\n}\n\n/**\n * Cursored SCAN for `<prefix>:*:meta` keys. BullMQ writes a meta key for each\n * queue on first use; using that as the discovery signal avoids matching\n * jobs, locks, or other namespaced sub-keys.\n */\nasync function scanQueueNames(\n client: Redis,\n prefix: string,\n): Promise<string[]> {\n const pattern = `${prefix}:*:meta`;\n const names = new Set<string>();\n let cursor = \"0\";\n\n do {\n const [next, batch] = await client.scan(\n cursor,\n \"MATCH\",\n pattern,\n \"COUNT\",\n 500,\n );\n cursor = next;\n for (const key of batch) {\n const name = parseQueueName(key, prefix);\n if (name) names.add(name);\n }\n } while (cursor !== \"0\");\n\n return Array.from(names).sort();\n}\n\nfunction parseQueueName(key: string, prefix: string): string | null {\n const head = `${prefix}:`;\n const tail = \":meta\";\n if (!key.startsWith(head) || !key.endsWith(tail)) return null;\n return key.slice(head.length, key.length - tail.length);\n}\n","import { FlowProducer, type Job, type Queue } from \"bullmq\";\nimport { LRUCache } from \"lru-cache\";\nimport type {\n ActivityBucket,\n ActivityStatsResponse,\n CreateFlowChildRequest,\n CreateFlowRequest,\n DelayedJobInfo,\n FlowNode,\n FlowSummary,\n HourlyBucket,\n JobInfo,\n JobStatus,\n JobTags,\n MetricsResponse,\n OverviewStats,\n PaginatedResponse,\n QueueInfo,\n RunInfo,\n RunInfoList,\n SchedulerInfo,\n SearchResult,\n SortOptions,\n TestJobRequest,\n} from \"./types\";\n\n/**\n * Manages queue operations for the Workbench dashboard\n */\nexport class QueueManager {\n private queues: Map<string, Queue> = new Map();\n private tagFields: string[] = [];\n private flowProducer: FlowProducer | null = null;\n\n // LRU cache for expensive operations\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n private cache = new LRUCache<string, any>({\n max: 100, // Max 100 entries\n ttl: 1000 * 60, // Default 1 minute TTL\n allowStale: false, // Don't return stale entries\n updateAgeOnGet: true, // Reset TTL on access\n });\n\n private readonly CACHE_TTL = {\n metrics: 5 * 60 * 1000, // 5 minutes - metrics are expensive\n overview: 2 * 60 * 1000, // 2 minutes\n queues: 2 * 60 * 1000, // 2 minutes\n flows: 2 * 60 * 1000, // 2 minutes\n activity: 5 * 60 * 1000, // 5 minutes - activity timeline\n };\n\n constructor(queues: Queue[], tagFields: string[] = []) {\n for (const queue of queues) {\n this.queues.set(queue.name, queue);\n }\n this.tagFields = tagFields;\n\n // Initialize FlowProducer using connection from first queue\n const firstQueue = queues[0];\n if (firstQueue) {\n const connection = firstQueue.opts?.connection;\n if (connection) {\n this.flowProducer = new FlowProducer({ connection });\n }\n }\n }\n\n /**\n * Get cached value or compute and cache\n */\n private async cached<T>(\n key: string,\n ttl: number,\n compute: () => Promise<T>,\n ): Promise<T> {\n const cached = this.cache.get(key);\n if (cached !== undefined) {\n return cached as T;\n }\n\n const data = await compute();\n this.cache.set(key, data, { ttl });\n return data;\n }\n\n /**\n * Execute a promise with a timeout\n */\n private async withTimeout<T>(\n promise: Promise<T>,\n timeoutMs: number,\n errorMessage: string,\n ): Promise<T> {\n let timeoutId: ReturnType<typeof setTimeout> | undefined;\n\n const timeoutPromise = new Promise<T>((_, reject) => {\n timeoutId = setTimeout(() => reject(new Error(errorMessage)), timeoutMs);\n });\n\n try {\n return await Promise.race([promise, timeoutPromise]);\n } finally {\n clearTimeout(timeoutId);\n }\n }\n\n /**\n * Get jobs by time range using Redis sorted sets (ZRANGEBYSCORE)\n * This is more efficient than fetching all jobs and filtering in memory\n */\n private async getJobsByTimeRange(\n queue: Queue,\n status: \"completed\" | \"failed\",\n startTime: number,\n endTime: number,\n limit: number,\n ): Promise<Job[]> {\n try {\n // Access BullMQ's Redis client\n const client = (queue as any).client;\n if (!client) {\n // Fallback to regular getJobs if client not available\n const jobs = await queue.getJobs([status], 0, limit * 2);\n return jobs.filter(\n (job): job is Job =>\n job != null &&\n !!job.finishedOn &&\n job.finishedOn >= startTime &&\n job.finishedOn <= endTime,\n );\n }\n\n // BullMQ stores jobs in sorted sets: bull:queueName:completed, bull:queueName:failed\n // The score is the finishedOn timestamp\n const queueKey = `bull:${queue.name}:${status}`;\n const jobIds = await client.zrangebyscore(\n queueKey,\n startTime,\n endTime,\n \"LIMIT\",\n 0,\n limit,\n );\n\n if (!jobIds || jobIds.length === 0) {\n return [];\n }\n\n // Fetch job data for the IDs in parallel\n const jobPromises = jobIds.map((jobId: string) => queue.getJob(jobId));\n const jobs = await Promise.all(jobPromises);\n\n // Filter out null/undefined results\n return jobs.filter(\n (job): job is Job => job !== null && job !== undefined,\n );\n } catch (_error) {\n // Fallback to regular getJobs on error\n const jobs = await queue.getJobs([status], 0, limit * 2);\n return jobs.filter(\n (job): job is Job =>\n job != null &&\n !!job.finishedOn &&\n job.finishedOn >= startTime &&\n job.finishedOn <= endTime,\n );\n }\n }\n\n /**\n * Cache for job state lookups to avoid repeated Redis calls\n */\n private jobStateCache = new LRUCache<string, JobStatus>({\n max: 1000,\n ttl: 1000 * 30, // 30 second TTL - job states don't change frequently\n });\n\n /**\n * Cache for job counts to avoid repeated Redis calls\n * Short TTL since counts change frequently but are expensive to fetch\n */\n private countCache = new LRUCache<\n string,\n Awaited<ReturnType<Queue[\"getJobCounts\"]>>\n >({\n max: 100, // Cache counts for up to 100 queues\n ttl: 1000 * 5, // 5 second TTL - counts change but not instantly\n });\n\n /**\n * Get job counts with caching\n */\n private async getCachedJobCounts(\n queue: Queue,\n ): Promise<Awaited<ReturnType<Queue[\"getJobCounts\"]>>> {\n const cacheKey = queue.name;\n const cached = this.countCache.get(cacheKey);\n if (cached !== undefined) {\n return cached;\n }\n\n const counts = await queue.getJobCounts();\n this.countCache.set(cacheKey, counts);\n return counts;\n }\n\n /**\n * Invalidate caches related to a job or queue\n */\n private invalidateJobCache(queueName: string, jobId?: string): void {\n // Invalidate count cache for the queue\n this.countCache.delete(queueName);\n\n // Invalidate job state cache if jobId provided\n if (jobId) {\n const stateCacheKey = `${queueName}:${jobId}`;\n this.jobStateCache.delete(stateCacheKey);\n }\n\n // Invalidate main cache entries that might be affected\n // These are expensive to recompute, so we invalidate them\n // to ensure accuracy after mutations\n this.cache.delete(\"metrics\");\n this.cache.delete(\"overview\");\n this.cache.delete(\"activity\");\n }\n\n /**\n * Clear cache (useful after mutations)\n */\n clearCache(prefix?: string): void {\n if (prefix) {\n for (const key of this.cache.keys()) {\n if (key.startsWith(prefix)) {\n this.cache.delete(key);\n }\n }\n } else {\n this.cache.clear();\n }\n }\n\n /**\n * Get quick job counts across all queues (lightweight, for smart polling)\n * Returns total counts per status - cached and very fast\n */\n async getQuickCounts(): Promise<{\n waiting: number;\n active: number;\n completed: number;\n failed: number;\n delayed: number;\n prioritized: number;\n \"waiting-children\": number;\n total: number;\n timestamp: number;\n }> {\n // Use short cache for counts - they change frequently\n return this.cached(\"quick-counts\", 2000, async () => {\n const totals = {\n waiting: 0,\n active: 0,\n completed: 0,\n failed: 0,\n delayed: 0,\n prioritized: 0,\n \"waiting-children\": 0,\n total: 0,\n timestamp: Date.now(),\n };\n\n await Promise.all(\n Array.from(this.queues.values()).map(async (queue) => {\n const counts = await this.getCachedJobCounts(queue);\n totals.waiting += counts.waiting || 0;\n totals.active += counts.active || 0;\n totals.completed += counts.completed || 0;\n totals.failed += counts.failed || 0;\n totals.delayed += counts.delayed || 0;\n totals.prioritized += counts.prioritized || 0;\n totals[\"waiting-children\"] += counts[\"waiting-children\"] || 0;\n }),\n );\n\n totals.total =\n totals.waiting +\n totals.active +\n totals.completed +\n totals.failed +\n totals.delayed +\n totals.prioritized +\n totals[\"waiting-children\"];\n\n return totals;\n });\n }\n\n /**\n * Get configured tag field names\n */\n getTagFields(): string[] {\n return this.tagFields;\n }\n\n /**\n * Get just queue names (very fast, no Redis calls)\n * Used for sidebar initial render\n */\n getQueueNames(): string[] {\n return Array.from(this.queues.keys());\n }\n\n /**\n * Get a queue by name\n */\n getQueue(name: string): Queue | undefined {\n return this.queues.get(name);\n }\n\n /**\n * Get information for all queues (cached)\n */\n async getQueues(): Promise<QueueInfo[]> {\n return this.cached(\"queues\", this.CACHE_TTL.queues, async () => {\n // Parallelize queue info fetching\n const queueEntries = Array.from(this.queues.entries());\n const results = await Promise.all(\n queueEntries.map(async ([name, queue]) => {\n const [counts, isPaused] = await Promise.all([\n this.getCachedJobCounts(queue),\n queue.isPaused(),\n ]);\n\n return {\n name,\n counts: {\n waiting: counts.waiting || 0,\n active: counts.active || 0,\n completed: counts.completed || 0,\n failed: counts.failed || 0,\n delayed: counts.delayed || 0,\n prioritized: counts.prioritized || 0,\n \"waiting-children\": counts[\"waiting-children\"] || 0,\n paused: counts.paused || 0,\n },\n isPaused,\n };\n }),\n );\n\n return results;\n });\n }\n\n /**\n * Get overview statistics (cached)\n */\n async getOverview(): Promise<OverviewStats> {\n return this.cached(\"overview\", this.CACHE_TTL.overview, async () => {\n const queues = await this.getQueues();\n\n let totalJobs = 0;\n let activeJobs = 0;\n let failedJobs = 0;\n\n for (const queue of queues) {\n totalJobs +=\n queue.counts.waiting +\n queue.counts.active +\n queue.counts.delayed +\n queue.counts.prioritized +\n queue.counts[\"waiting-children\"];\n activeJobs += queue.counts.active;\n failedJobs += queue.counts.failed;\n }\n\n // Get completed jobs from today (approximation based on completed count)\n const completedToday = queues.reduce(\n (sum, q) => sum + q.counts.completed,\n 0,\n );\n\n return {\n totalJobs,\n activeJobs,\n failedJobs,\n completedToday,\n avgDuration: 0, // Would need metrics tracking\n queues,\n };\n });\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Queue Control (Pause/Resume)\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Pause a queue - stops processing new jobs\n */\n async pauseQueue(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n await queue.pause();\n }\n\n /**\n * Resume a paused queue\n */\n async resumeQueue(queueName: string): Promise<void> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n await queue.resume();\n }\n\n /**\n * Check if a queue is paused\n */\n async isQueuePaused(queueName: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(`Queue \"${queueName}\" not found`);\n }\n return queue.isPaused();\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Metrics\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Get metrics for the last 24 hours (cached - expensive operation)\n */\n async getMetrics(): Promise<MetricsResponse> {\n return this.cached(\"metrics\", this.CACHE_TTL.metrics, async () => {\n return this.withTimeout(\n (async () => {\n const now = Date.now();\n const twentyFourHoursAgo = now - 24 * 60 * 60 * 1000;\n\n // Initialize hourly buckets for last 24 hours\n const createEmptyBuckets = (): HourlyBucket[] => {\n const buckets: HourlyBucket[] = [];\n const startHour =\n Math.floor(twentyFourHoursAgo / (60 * 60 * 1000)) *\n (60 * 60 * 1000);\n for (let i = 0; i < 24; i++) {\n buckets.push({\n hour: startHour + i * 60 * 60 * 1000,\n completed: 0,\n failed: 0,\n avgDuration: 0,\n avgWaitTime: 0,\n });\n }\n return buckets;\n };\n\n const queueMetricsMap = new Map<\n string,\n {\n buckets: HourlyBucket[];\n durations: number[][];\n waitTimes: number[][];\n }\n >();\n\n // Initialize per-queue metrics\n for (const queueName of this.queues.keys()) {\n queueMetricsMap.set(queueName, {\n buckets: createEmptyBuckets(),\n durations: Array.from({ length: 24 }, () => []),\n waitTimes: Array.from({ length: 24 }, () => []),\n });\n }\n\n // Track slowest jobs and failing job types\n const allJobs: Array<{\n name: string;\n queueName: string;\n duration: number;\n jobId: string;\n }> = [];\n const jobTypeStats = new Map<\n string,\n {\n name: string;\n queueName: string;\n completed: number;\n failed: number;\n }\n >();\n\n // Fetch completed and failed jobs from each queue IN PARALLEL\n // Use time-based filtering to only get jobs within the 24-hour window\n const queueEntries = Array.from(this.queues.entries());\n\n // First, check which queues have relevant jobs using getJobCounts\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n return {\n queueName,\n queue,\n hasRelevantJobs:\n (counts.completed || 0) > 0 || (counts.failed || 0) > 0,\n };\n }),\n );\n\n // Only process queues with relevant jobs\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queueName, queue }) => {\n // Use time-based filtering - only fetch jobs within the 24-hour window\n // Reduced limit since we're filtering by time in Redis\n const [completedJobs, failedJobs] = await Promise.all([\n this.getJobsByTimeRange(\n queue,\n \"completed\",\n twentyFourHoursAgo,\n now,\n 100, // Reduced from 200 - only recent jobs needed\n ),\n this.getJobsByTimeRange(\n queue,\n \"failed\",\n twentyFourHoursAgo,\n now,\n 100, // Reduced from 200 - only recent jobs needed\n ),\n ]);\n return { queueName, completedJobs, failedJobs };\n }),\n );\n\n // Process results\n for (const { queueName, completedJobs, failedJobs } of queueResults) {\n const metrics = queueMetricsMap.get(queueName)!;\n\n // Process completed jobs\n for (const job of completedJobs) {\n if (!job?.finishedOn || job.finishedOn < twentyFourHoursAgo)\n continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - (metrics.buckets[0]?.hour || 0)) /\n (60 * 60 * 1000),\n );\n if (bucketIndex >= 0 && bucketIndex < 24) {\n metrics.buckets[bucketIndex].completed++;\n\n const duration = job.processedOn\n ? job.finishedOn - job.processedOn\n : 0;\n const waitTime = job.processedOn\n ? job.processedOn - job.timestamp\n : 0;\n\n if (duration > 0) {\n metrics.durations[bucketIndex].push(duration);\n allJobs.push({\n name: job.name,\n queueName,\n duration,\n jobId: job.id || \"\",\n });\n }\n if (waitTime > 0) {\n metrics.waitTimes[bucketIndex].push(waitTime);\n }\n }\n\n // Track job type stats\n const key = `${queueName}:${job.name}`;\n const stats = jobTypeStats.get(key) || {\n name: job.name,\n queueName,\n completed: 0,\n failed: 0,\n };\n stats.completed++;\n jobTypeStats.set(key, stats);\n }\n\n // Process failed jobs\n for (const job of failedJobs) {\n if (!job?.finishedOn || job.finishedOn < twentyFourHoursAgo)\n continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - (metrics.buckets[0]?.hour || 0)) /\n (60 * 60 * 1000),\n );\n if (bucketIndex >= 0 && bucketIndex < 24) {\n metrics.buckets[bucketIndex].failed++;\n }\n\n // Track job type stats\n const key = `${queueName}:${job.name}`;\n const stats = jobTypeStats.get(key) || {\n name: job.name,\n queueName,\n completed: 0,\n failed: 0,\n };\n stats.failed++;\n jobTypeStats.set(key, stats);\n }\n }\n\n // Calculate averages for each bucket\n for (const metrics of queueMetricsMap.values()) {\n for (let i = 0; i < 24; i++) {\n const durations = metrics.durations[i];\n const waitTimes = metrics.waitTimes[i];\n if (durations.length > 0) {\n metrics.buckets[i].avgDuration = Math.round(\n durations.reduce((a, b) => a + b, 0) / durations.length,\n );\n }\n if (waitTimes.length > 0) {\n metrics.buckets[i].avgWaitTime = Math.round(\n waitTimes.reduce((a, b) => a + b, 0) / waitTimes.length,\n );\n }\n }\n }\n\n // Skip per-queue metrics - not used by frontend (only aggregate is displayed)\n // Return empty array to maintain API compatibility\n\n // Build aggregate metrics\n const aggregateBuckets = createEmptyBuckets();\n const aggregateDurations: number[][] = Array.from(\n { length: 24 },\n () => [],\n );\n const aggregateWaitTimes: number[][] = Array.from(\n { length: 24 },\n () => [],\n );\n\n for (const metrics of queueMetricsMap.values()) {\n for (let i = 0; i < 24; i++) {\n aggregateBuckets[i].completed += metrics.buckets[i].completed;\n aggregateBuckets[i].failed += metrics.buckets[i].failed;\n aggregateDurations[i].push(...metrics.durations[i]);\n aggregateWaitTimes[i].push(...metrics.waitTimes[i]);\n }\n }\n\n // Calculate aggregate averages\n for (let i = 0; i < 24; i++) {\n if (aggregateDurations[i].length > 0) {\n aggregateBuckets[i].avgDuration = Math.round(\n aggregateDurations[i].reduce((a, b) => a + b, 0) /\n aggregateDurations[i].length,\n );\n }\n if (aggregateWaitTimes[i].length > 0) {\n aggregateBuckets[i].avgWaitTime = Math.round(\n aggregateWaitTimes[i].reduce((a, b) => a + b, 0) /\n aggregateWaitTimes[i].length,\n );\n }\n }\n\n const totalCompleted = aggregateBuckets.reduce(\n (sum, b) => sum + b.completed,\n 0,\n );\n const totalFailed = aggregateBuckets.reduce(\n (sum, b) => sum + b.failed,\n 0,\n );\n const allDurations = aggregateDurations.flat();\n const allWaitTimes = aggregateWaitTimes.flat();\n\n // Get top 10 slowest jobs\n const slowestJobs = allJobs\n .sort((a, b) => b.duration - a.duration)\n .slice(0, 10);\n\n // Get top 10 most failing job types\n const mostFailingTypes = Array.from(jobTypeStats.values())\n .filter((s) => s.failed > 0)\n .map((s) => ({\n name: s.name,\n queueName: s.queueName,\n failCount: s.failed,\n totalCount: s.completed + s.failed,\n errorRate: s.failed / (s.completed + s.failed),\n }))\n .sort((a, b) => b.failCount - a.failCount)\n .slice(0, 10);\n\n return {\n queues: [], // Empty - per-queue metrics not used by frontend\n aggregate: {\n queueName: \"all\",\n buckets: aggregateBuckets,\n summary: {\n totalCompleted,\n totalFailed,\n errorRate:\n totalCompleted + totalFailed > 0\n ? totalFailed / (totalCompleted + totalFailed)\n : 0,\n avgDuration:\n allDurations.length > 0\n ? Math.round(\n allDurations.reduce((a, b) => a + b, 0) /\n allDurations.length,\n )\n : 0,\n avgWaitTime:\n allWaitTimes.length > 0\n ? Math.round(\n allWaitTimes.reduce((a, b) => a + b, 0) /\n allWaitTimes.length,\n )\n : 0,\n throughputPerHour: Math.round(\n (totalCompleted + totalFailed) / 24,\n ),\n },\n },\n slowestJobs,\n mostFailingTypes,\n computedAt: now,\n };\n })(),\n 45000, // 45 second timeout (before proxy timeout)\n \"Metrics computation timed out after 45 seconds\",\n );\n });\n }\n\n /**\n * Get activity stats for the last 7 days (cached)\n * Returns 4-hour buckets for the activity timeline\n */\n async getActivityStats(): Promise<ActivityStatsResponse> {\n return this.cached(\"activity\", this.CACHE_TTL.activity, async () => {\n const now = Date.now();\n const bucketSize = 4 * 60 * 60 * 1000; // 4 hours\n const bucketCount = 42; // 7 days * 6 buckets per day\n\n // Start from midnight 7 days ago\n const startDate = new Date(now);\n startDate.setHours(0, 0, 0, 0);\n startDate.setDate(startDate.getDate() - 6);\n const startTime = startDate.getTime();\n\n // Initialize buckets\n const buckets: ActivityBucket[] = [];\n for (let i = 0; i < bucketCount; i++) {\n buckets.push({\n time: startTime + i * bucketSize,\n completed: 0,\n failed: 0,\n });\n }\n\n // Fetch completed and failed jobs from each queue IN PARALLEL\n // Use time-based filtering to only get jobs within the 7-day window\n const queueEntries = Array.from(this.queues.entries());\n\n // First, check which queues have relevant jobs\n const queueChecks = await Promise.all(\n queueEntries.map(async ([, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n return {\n queue,\n hasRelevantJobs:\n (counts.completed || 0) > 0 || (counts.failed || 0) > 0,\n };\n }),\n );\n\n // Only process queues with relevant jobs\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queue }) => {\n // Use time-based filtering - only fetch jobs within the 7-day window\n // Reduced limit since we're filtering by time in Redis\n const [completedJobs, failedJobs] = await Promise.all([\n this.getJobsByTimeRange(\n queue,\n \"completed\",\n startTime,\n now,\n 200, // Reduced from 500 - only jobs in time range needed\n ),\n this.getJobsByTimeRange(\n queue,\n \"failed\",\n startTime,\n now,\n 200, // Reduced from 500 - only jobs in time range needed\n ),\n ]);\n return { completedJobs, failedJobs };\n }),\n );\n\n // Process results\n for (const { completedJobs, failedJobs } of queueResults) {\n // Process completed jobs\n for (const job of completedJobs) {\n if (!job?.finishedOn || job.finishedOn < startTime) continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - startTime) / bucketSize,\n );\n if (bucketIndex >= 0 && bucketIndex < bucketCount) {\n buckets[bucketIndex].completed++;\n }\n }\n\n // Process failed jobs\n for (const job of failedJobs) {\n if (!job?.finishedOn || job.finishedOn < startTime) continue;\n\n const bucketIndex = Math.floor(\n (job.finishedOn - startTime) / bucketSize,\n );\n if (bucketIndex >= 0 && bucketIndex < bucketCount) {\n buckets[bucketIndex].failed++;\n }\n }\n }\n\n const totalCompleted = buckets.reduce((sum, b) => sum + b.completed, 0);\n const totalFailed = buckets.reduce((sum, b) => sum + b.failed, 0);\n\n return {\n buckets,\n startTime,\n endTime: now,\n bucketSize,\n totalCompleted,\n totalFailed,\n computedAt: now,\n };\n });\n }\n\n /**\n * Get jobs for a specific queue with pagination and sorting\n */\n async getJobs(\n queueName: string,\n status?: JobStatus,\n limit = 50,\n start = 0,\n sort?: SortOptions,\n ): Promise<PaginatedResponse<JobInfo>> {\n const queue = this.queues.get(queueName);\n if (!queue) {\n return { data: [], total: 0, hasMore: false };\n }\n\n const types = status\n ? [status]\n : [\n \"active\",\n \"waiting\",\n \"waiting-children\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n\n // Fetch counts once before the loop (same for all types in a queue)\n const counts = await this.getCachedJobCounts(queue);\n\n // Track jobs with their known state to avoid getState() calls\n const jobsWithState: { job: Job; state: JobStatus }[] = [];\n let total = 0;\n\n for (const type of types) {\n const typeJobs = await queue.getJobs(type as any, start, start + limit);\n jobsWithState.push(\n ...typeJobs.map((job) => ({ job, state: type as JobStatus })),\n );\n\n const typeCount = counts[type as keyof typeof counts] || 0;\n total += typeCount;\n }\n\n // Convert to JobInfo - pass known state to skip expensive getState() calls\n const jobInfos = (await Promise.all(\n jobsWithState.map(({ job, state }) => this.jobToInfo(job, \"full\", state)),\n )) as JobInfo[];\n\n // Apply sorting\n const sortField = sort?.field ?? \"timestamp\";\n const sortDir = sort?.direction === \"asc\" ? 1 : -1;\n\n jobInfos.sort((a, b) => {\n const aVal = this.getSortValue(a, sortField);\n const bVal = this.getSortValue(b, sortField);\n if (aVal < bVal) return -1 * sortDir;\n if (aVal > bVal) return 1 * sortDir;\n return 0;\n });\n\n // Take only the requested limit\n const data = jobInfos.slice(0, limit);\n\n return {\n data,\n total,\n hasMore: start + limit < total,\n cursor: start + limit < total ? String(start + limit) : undefined,\n };\n }\n\n /**\n * Get a single job by ID\n */\n async getJob(queueName: string, jobId: string): Promise<JobInfo | null> {\n const queue = this.queues.get(queueName);\n if (!queue) return null;\n\n const job = await queue.getJob(jobId);\n if (!job) return null;\n\n return this.jobToInfo(job, \"full\") as Promise<JobInfo>;\n }\n\n /**\n * Retry a failed job\n */\n async retryJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.retry();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Remove a job\n */\n async removeJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.remove();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Promote a delayed job to waiting\n */\n async promoteJob(queueName: string, jobId: string): Promise<boolean> {\n const queue = this.queues.get(queueName);\n if (!queue) return false;\n\n const job = await queue.getJob(jobId);\n if (!job) return false;\n\n await job.promote();\n this.invalidateJobCache(queueName, jobId);\n return true;\n }\n\n /**\n * Parse search query for field:value filters\n * Returns { filters: { field: value }, text: remainingText }\n */\n private parseSearchQuery(query: string): {\n filters: Record<string, string>;\n text: string;\n } {\n const filters: Record<string, string> = {};\n const textParts: string[] = [];\n const len = query.length;\n let i = 0;\n\n while (i < len) {\n while (i < len && query[i] === \" \") i++;\n if (i >= len) break;\n\n let j = i;\n while (j < len && /\\w/.test(query[j]!)) j++;\n\n if (j > i && j < len && query[j] === \":\") {\n const field = query.slice(i, j);\n j++;\n\n let value: string;\n if (j < len && query[j] === '\"') {\n j++;\n const closeQuote = query.indexOf('\"', j);\n if (closeQuote !== -1) {\n value = query.slice(j, closeQuote);\n j = closeQuote + 1;\n } else {\n value = query.slice(j);\n j = len;\n }\n } else {\n const valueStart = j;\n while (j < len && query[j] !== \" \") j++;\n value = query.slice(valueStart, j);\n }\n\n if (value) {\n filters[field] = value;\n } else {\n textParts.push(`${field}:`);\n }\n i = j;\n } else {\n const start = i;\n while (i < len && query[i] !== \" \") i++;\n textParts.push(query.slice(start, i));\n }\n }\n\n return {\n filters,\n text: textParts.filter(Boolean).join(\" \"),\n };\n }\n\n /**\n * Check if a raw job matches all provided filters (before conversion)\n * This is more efficient than converting to JobInfo first\n */\n private jobMatchesAllFilters(\n job: Job,\n filters: {\n status?: JobStatus;\n tags?: Record<string, string>;\n text?: string;\n timeRange?: { start: number; end: number };\n },\n ): boolean {\n // Status filter is handled by fetching only the requested status types\n // So we don't need to check it here - jobs are already filtered by type\n\n // Check time range filter (cheap - uses raw timestamps)\n if (filters.timeRange) {\n const jobTime = job.processedOn || job.finishedOn || job.timestamp || 0;\n if (\n jobTime < filters.timeRange.start ||\n jobTime > filters.timeRange.end\n ) {\n return false;\n }\n }\n\n // Check tag filters (extract only needed fields from job.data)\n if (filters.tags && Object.keys(filters.tags).length > 0) {\n if (!job.data || typeof job.data !== \"object\") {\n return false;\n }\n const dataObj = job.data as Record<string, unknown>;\n for (const [field, value] of Object.entries(filters.tags)) {\n const jobValue = dataObj[field];\n if (jobValue === undefined || jobValue === null) {\n return false;\n }\n // Case-insensitive comparison for strings\n const strJobValue = String(jobValue).toLowerCase();\n const strFilterValue = value.toLowerCase();\n if (!strJobValue.includes(strFilterValue)) {\n return false;\n }\n }\n }\n\n // Check text search (only stringify if needed)\n if (filters.text) {\n const lowerText = filters.text.toLowerCase();\n const matchesId = job.id?.toLowerCase().includes(lowerText);\n const matchesName = job.name?.toLowerCase().includes(lowerText);\n\n if (!matchesId && !matchesName) {\n // Only stringify job.data if ID and name don't match\n const stringifiedData = JSON.stringify(job.data).toLowerCase();\n if (!stringifiedData.includes(lowerText)) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n /**\n * Check if a job matches the given tag filters\n */\n private jobMatchesFilters(\n job: Job,\n filters: Record<string, string>,\n ): boolean {\n if (!job.data || typeof job.data !== \"object\") {\n return Object.keys(filters).length === 0;\n }\n\n const dataObj = job.data as Record<string, unknown>;\n for (const [field, value] of Object.entries(filters)) {\n const jobValue = dataObj[field];\n if (jobValue === undefined || jobValue === null) {\n return false;\n }\n // Case-insensitive comparison for strings\n const strJobValue = String(jobValue).toLowerCase();\n const strFilterValue = value.toLowerCase();\n if (!strJobValue.includes(strFilterValue)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Search jobs across all queues\n * Supports field:value syntax (e.g., \"teamId:abc-123 invoice\")\n * Optimized with parallel processing, early exits, and count checks\n */\n async search(query: string, limit = 20): Promise<SearchResult[]> {\n const { filters, text } = this.parseSearchQuery(query);\n const lowerText = text.toLowerCase();\n const hasFilters = Object.keys(filters).length > 0;\n const hasText = lowerText.length > 0;\n\n // Early exit if no search criteria\n if (!hasFilters && !hasText) {\n return [];\n }\n\n // Check counts first to skip empty queues\n const queueEntries = Array.from(this.queues.entries());\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n const hasJobs =\n (counts.waiting || 0) > 0 ||\n (counts.active || 0) > 0 ||\n (counts.completed || 0) > 0 ||\n (counts.failed || 0) > 0 ||\n (counts.delayed || 0) > 0 ||\n (counts.prioritized || 0) > 0 ||\n (counts[\"waiting-children\"] || 0) > 0;\n return { queueName, queue, hasJobs };\n }),\n );\n\n const relevantQueues = queueChecks.filter((q) => q.hasJobs);\n if (relevantQueues.length === 0) {\n return [];\n }\n\n // Process all queues in parallel instead of sequentially\n const types = [\n \"active\",\n \"waiting\",\n \"waiting-children\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n const fetchLimit = Math.min(limit * 2, 50); // Reduced from 100 - only fetch what we need\n\n // WeakMap for caching stringified job data\n const stringifiedDataCache = new WeakMap<Job, string>();\n\n // Process all queues concurrently\n const queueResults = await Promise.allSettled(\n relevantQueues.map(async ({ queueName, queue }) => {\n // Search in all job states in parallel\n const typeResults = await Promise.all(\n types.map(async (type) => {\n try {\n const jobs = await queue.getJobs(type as any, 0, fetchLimit);\n const matches: SearchResult[] = [];\n\n for (const job of jobs) {\n // Check field:value filters first\n if (hasFilters && !this.jobMatchesFilters(job, filters)) {\n continue;\n }\n\n // If there's text search, match by job ID, name, or data\n if (hasText) {\n const matchesId = job.id?.toLowerCase().includes(lowerText);\n const matchesName = job.name\n ?.toLowerCase()\n .includes(lowerText);\n\n // Only stringify if ID and name don't match (expensive operation)\n let matchesData = false;\n if (!matchesId && !matchesName) {\n // Use cached stringified data if available\n let stringifiedData = stringifiedDataCache.get(job);\n if (!stringifiedData) {\n stringifiedData = JSON.stringify(job.data).toLowerCase();\n stringifiedDataCache.set(job, stringifiedData);\n }\n matchesData = stringifiedData.includes(lowerText);\n }\n\n if (!matchesId && !matchesName && !matchesData) {\n continue;\n }\n }\n\n // Pass known state to skip expensive getState() calls\n matches.push({\n queue: queueName,\n job: (await this.jobToInfo(\n job,\n \"full\",\n type as JobStatus,\n )) as JobInfo,\n });\n }\n\n return matches;\n } catch {\n return [];\n }\n }),\n );\n\n return typeResults.flat();\n }),\n );\n\n // Collect all matches from all queues\n const allMatches: SearchResult[] = [];\n for (const result of queueResults) {\n if (result.status === \"fulfilled\") {\n allMatches.push(...result.value);\n }\n }\n\n // Return limited results\n return allMatches.slice(0, limit);\n }\n\n /**\n * Clean jobs from a queue\n */\n async cleanJobs(\n queueName: string,\n status: \"completed\" | \"failed\",\n grace = 0,\n ): Promise<number> {\n const queue = this.queues.get(queueName);\n if (!queue) return 0;\n\n const removed = await queue.clean(grace, 1000, status);\n return removed.length;\n }\n\n /**\n * FAST PATH: Get latest runs without filters\n * Optimized for the common case of viewing newest jobs (timestamp desc, no filters)\n * - Single getJobs call per queue (not per status type)\n * - No count checks needed\n * - Minimal Redis round-trips\n */\n private async getLatestRuns(\n limit: number,\n start: number,\n ): Promise<PaginatedResponse<RunInfoList>> {\n const queueEntries = Array.from(this.queues.entries());\n const numQueues = queueEntries.length;\n\n if (numQueues === 0) {\n return { data: [], total: -1, hasMore: false, cursor: undefined };\n }\n\n // Fetch a small number of recent jobs from each queue\n // We need enough to fill the page after sorting by timestamp\n const perQueueFetch = Math.max(5, Math.ceil((limit + 10) / numQueues) + 2);\n\n // Fetch from all queues in parallel and keep the originating state.\n const allTypes: JobStatus[] = [\n \"active\",\n \"waiting\",\n \"waiting-children\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n\n const results = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const jobArrays = await Promise.all(\n allTypes.map(async (type) => {\n const jobs = await queue.getJobs(type as any, 0, perQueueFetch);\n return jobs.map((job) => ({ job, queueName, state: type }));\n }),\n );\n return jobArrays.flat();\n }),\n );\n\n // Flatten and sort by timestamp desc\n const allJobs = results.flat();\n allJobs.sort((a, b) => {\n const timeDiff = (b.job.timestamp || 0) - (a.job.timestamp || 0);\n if (timeDiff !== 0) return timeDiff;\n // Secondary sort for stability\n return a.queueName.localeCompare(b.queueName);\n });\n\n // Apply pagination\n const jobsToConvert = allJobs.slice(start, start + limit);\n\n // Convert to RunInfoList with the known state from the source list.\n const runInfos = await Promise.all(\n jobsToConvert.map(async ({ job, queueName, state }) => {\n const info = await this.jobToInfo(job, \"list\", state);\n return { ...info, queueName } as RunInfoList;\n }),\n );\n\n // Determine if there are more results\n const hasMore = allJobs.length > start + limit;\n\n return {\n data: runInfos,\n total: -1, // Don't calculate total for fast path - not needed for UI\n hasMore,\n cursor: hasMore ? String(start + runInfos.length) : undefined,\n };\n }\n\n /**\n * Get all runs (jobs) across all queues with sorting and filtering\n * Uses fast path for common case (no filters, timestamp desc)\n */\n async getAllRuns(\n limit = 50,\n start = 0,\n sort?: SortOptions,\n filters?: {\n status?: JobStatus;\n tags?: Record<string, string>;\n text?: string;\n timeRange?: { start: number; end: number };\n },\n ): Promise<PaginatedResponse<RunInfoList>> {\n const sortField = sort?.field ?? \"timestamp\";\n const sortDir = sort?.direction === \"asc\" ? 1 : -1;\n const hasFilters = !!(\n filters?.status ||\n filters?.tags ||\n filters?.text ||\n filters?.timeRange\n );\n const isTimestampSort = sortField === \"timestamp\";\n\n // FAST PATH: No filters, timestamp desc = just get newest jobs\n // This is the most common use case and should be instant\n if (!hasFilters && isTimestampSort && sortDir === -1) {\n return this.getLatestRuns(limit, start);\n }\n\n // FILTERED PATH: More complex queries need full filtering logic\n const queueEntries = Array.from(this.queues.entries());\n\n // Determine which job types to fetch based on status filter\n const types = filters?.status\n ? [filters.status]\n : [\n \"active\",\n \"waiting\",\n \"waiting-children\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n\n const hasTimeRange = !!filters?.timeRange;\n const numQueues = Math.max(queueEntries.length, 1);\n\n if (queueEntries.length === 0) {\n return {\n data: [],\n total: 0,\n hasMore: false,\n cursor: undefined,\n };\n }\n\n // For filtered queries, fetch enough to likely fill one page after filtering\n // Reduced from 50 to be smarter about distribution\n const baseFetchPerQueue = Math.max(\n Math.ceil((limit * 2) / numQueues) + 3,\n 5,\n );\n\n let allJobs: { job: Job; queueName: string; state: JobStatus }[] = [];\n\n // Helper function to fetch from a single queue\n const fetchFromQueue = async (\n queueName: string,\n queue: Queue,\n fetchCount: number,\n ) => {\n // Use time-range queries for completed/failed jobs when time range is specified\n if (hasTimeRange && filters?.timeRange) {\n const timeRangeJobs: { job: Job; state: JobStatus }[] = [];\n\n // Use efficient time-range queries for completed/failed\n if (types.includes(\"completed\")) {\n const completedJobs = await this.getJobsByTimeRange(\n queue,\n \"completed\",\n filters.timeRange.start,\n filters.timeRange.end,\n fetchCount,\n );\n timeRangeJobs.push(\n ...completedJobs.map((job) => ({\n job,\n state: \"completed\" as JobStatus,\n })),\n );\n }\n\n if (types.includes(\"failed\")) {\n const failedJobs = await this.getJobsByTimeRange(\n queue,\n \"failed\",\n filters.timeRange.start,\n filters.timeRange.end,\n fetchCount,\n );\n timeRangeJobs.push(\n ...failedJobs.map((job) => ({\n job,\n state: \"failed\" as JobStatus,\n })),\n );\n }\n\n // For other types, use regular getJobs\n const otherTypes = types.filter(\n (t) => t !== \"completed\" && t !== \"failed\",\n );\n if (otherTypes.length > 0) {\n const otherJobArrays = await Promise.all(\n otherTypes.map(async (type) => {\n const jobs = await queue.getJobs(type as any, 0, fetchCount);\n return jobs.map((job) => ({ job, state: type as JobStatus }));\n }),\n );\n timeRangeJobs.push(...otherJobArrays.flat());\n }\n\n return timeRangeJobs.map(({ job, state }) => ({\n job,\n queueName,\n state,\n }));\n }\n\n // For status filter, only fetch that type\n if (filters?.status) {\n const jobs = await queue.getJobs(filters.status as any, 0, fetchCount);\n return jobs.map((job) => ({\n job,\n queueName,\n state: filters.status as JobStatus,\n }));\n }\n\n // Regular fetching for all types - track state for each type\n const jobArrays = await Promise.all(\n types.map(async (type) => {\n const jobs = await queue.getJobs(type as any, 0, fetchCount);\n return jobs.map((job) => ({ job, state: type as JobStatus }));\n }),\n );\n return jobArrays\n .flat()\n .map(({ job, state }) => ({ job, queueName, state }));\n };\n\n // Fetch from ALL queues in parallel\n const results = await Promise.all(\n queueEntries.map(([queueName, queue]) =>\n fetchFromQueue(queueName, queue, baseFetchPerQueue),\n ),\n );\n allJobs = results.flat();\n\n // Apply filters BEFORE sorting and pagination\n if (filters) {\n allJobs = allJobs.filter(({ job }) =>\n this.jobMatchesAllFilters(job, filters),\n );\n }\n\n // Sort all filtered jobs to ensure consistent ordering\n // sortDir: 1 = asc (oldest first), -1 = desc (newest first, default)\n if (isTimestampSort) {\n allJobs.sort((a, b) => {\n const aTime = a.job.timestamp || 0;\n const bTime = b.job.timestamp || 0;\n // Primary sort by timestamp\n const timeDiff = sortDir === -1 ? bTime - aTime : aTime - bTime;\n if (timeDiff !== 0) return timeDiff;\n // Secondary sort by queueName for stability\n const queueDiff = a.queueName.localeCompare(b.queueName);\n if (queueDiff !== 0) return queueDiff;\n // Tertiary sort by job ID for complete stability\n return (a.job.id || \"\").localeCompare(b.job.id || \"\");\n });\n }\n\n // Apply pagination\n const jobsToConvert = allJobs.slice(start, start + limit);\n\n // Convert only the jobs we'll return\n const runInfos = await Promise.all(\n jobsToConvert.map(async ({ job, queueName, state }) => {\n const info = await this.jobToInfo(job, \"list\", state);\n return { ...info, queueName } as RunInfoList;\n }),\n );\n\n // For non-timestamp sorting, sort after conversion\n if (!isTimestampSort) {\n runInfos.sort((a, b) => {\n const aVal = this.getSortValueForList(a, sortField);\n const bVal = this.getSortValueForList(b, sortField);\n if (aVal < bVal) return -1 * sortDir;\n if (aVal > bVal) return 1 * sortDir;\n return 0;\n });\n }\n\n // Build cursor for next page\n const hasMore = allJobs.length > start + limit;\n\n return {\n data: runInfos,\n total: -1, // Don't calculate total - not needed for UI\n hasMore,\n cursor: hasMore ? String(start + runInfos.length) : undefined,\n };\n }\n\n /**\n * Get all schedulers (repeatable and delayed jobs) with sorting\n */\n async getSchedulers(\n repeatableSort?: SortOptions,\n delayedSort?: SortOptions,\n ): Promise<{\n repeatable: SchedulerInfo[];\n delayed: DelayedJobInfo[];\n }> {\n const repeatable: SchedulerInfo[] = [];\n const delayed: DelayedJobInfo[] = [];\n\n // Fetch from all queues in parallel\n const queueEntries = Array.from(this.queues.entries());\n const results = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const [repeatableJobs, delayedJobs] = await Promise.all([\n queue.getRepeatableJobs(),\n queue.getJobs(\"delayed\", 0, 50),\n ]);\n return { queueName, repeatableJobs, delayedJobs };\n }),\n );\n\n // Process results\n for (const { queueName, repeatableJobs, delayedJobs } of results) {\n for (const job of repeatableJobs) {\n repeatable.push({\n key: job.key,\n name: job.name || \"unnamed\",\n queueName,\n pattern: job.pattern ?? undefined,\n every: job.every ? Number(job.every) : undefined,\n next: job.next ?? undefined,\n endDate: job.endDate ?? undefined,\n tz: job.tz ?? undefined,\n });\n }\n\n for (const job of delayedJobs) {\n const delay = job.opts.delay || 0;\n delayed.push({\n id: job.id || \"\",\n name: job.name,\n queueName,\n delay,\n processAt: job.timestamp + delay,\n data: job.data,\n });\n }\n }\n\n // Sort repeatable jobs\n const repeatableField = repeatableSort?.field ?? \"name\";\n const repeatableDir = repeatableSort?.direction === \"desc\" ? -1 : 1;\n repeatable.sort((a, b) => {\n const aVal = this.getSchedulerSortValue(a, repeatableField);\n const bVal = this.getSchedulerSortValue(b, repeatableField);\n if (aVal < bVal) return -1 * repeatableDir;\n if (aVal > bVal) return 1 * repeatableDir;\n return 0;\n });\n\n // Sort delayed jobs\n const delayedField = delayedSort?.field ?? \"processAt\";\n const delayedDir = delayedSort?.direction === \"desc\" ? -1 : 1;\n delayed.sort((a, b) => {\n const aVal = this.getDelayedSortValue(a, delayedField);\n const bVal = this.getDelayedSortValue(b, delayedField);\n if (aVal < bVal) return -1 * delayedDir;\n if (aVal > bVal) return 1 * delayedDir;\n return 0;\n });\n\n return { repeatable, delayed };\n }\n\n /**\n * Enqueue a new job (for testing)\n */\n async enqueueJob(request: TestJobRequest): Promise<{ id: string }> {\n const queue = this.queues.get(request.queueName);\n if (!queue) {\n throw new Error(`Queue \"${request.queueName}\" not found`);\n }\n\n const job = await queue.add(request.jobName, request.data, {\n delay: request.opts?.delay,\n priority: request.opts?.priority,\n attempts: request.opts?.attempts,\n });\n\n return { id: job.id || \"\" };\n }\n\n /**\n * Extract tag values from job data based on configured tag fields\n */\n private extractTags(data: unknown): JobTags | undefined {\n if (!this.tagFields.length || !data || typeof data !== \"object\") {\n return undefined;\n }\n\n const tags: JobTags = {};\n const dataObj = data as Record<string, unknown>;\n\n for (const field of this.tagFields) {\n const value = dataObj[field];\n if (\n value !== undefined &&\n (typeof value === \"string\" ||\n typeof value === \"number\" ||\n typeof value === \"boolean\" ||\n value === null)\n ) {\n tags[field] = value as string | number | boolean | null;\n }\n }\n\n return Object.keys(tags).length > 0 ? tags : undefined;\n }\n\n /**\n * Get unique values for a specific tag field across all jobs\n */\n async getTagValues(\n field: string,\n limit = 50,\n ): Promise<{ value: string; count: number }[]> {\n const valueMap = new Map<string, number>();\n const types = [\n \"active\",\n \"waiting\",\n \"waiting-children\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n\n // Fetch jobs from all queues in parallel\n const queueEntries = Array.from(this.queues.entries());\n const queueResults = await Promise.all(\n queueEntries.map(async ([, queue]) => {\n const jobArrays = await Promise.all(\n types.map((type) => queue.getJobs(type as any, 0, 100)),\n );\n return jobArrays.flat();\n }),\n );\n\n // Process all jobs\n for (const jobs of queueResults) {\n for (const job of jobs) {\n if (job.data && typeof job.data === \"object\") {\n const dataObj = job.data as Record<string, unknown>;\n const value = dataObj[field];\n if (value !== undefined && value !== null) {\n const strValue = String(value);\n valueMap.set(strValue, (valueMap.get(strValue) || 0) + 1);\n }\n }\n }\n }\n\n // Sort by count descending and take top N\n const sorted = Array.from(valueMap.entries())\n .sort((a, b) => b[1] - a[1])\n .slice(0, limit)\n .map(([value, count]) => ({ value, count }));\n\n return sorted;\n }\n\n /**\n * Get sortable value from JobInfo/RunInfo\n */\n private getSortValue(\n item: JobInfo | RunInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"timestamp\":\n return item.timestamp ?? 0;\n case \"name\":\n return item.name.toLowerCase();\n case \"status\":\n return item.status;\n case \"duration\":\n return item.duration ?? 0;\n case \"queueName\":\n return \"queueName\" in item ? item.queueName.toLowerCase() : \"\";\n case \"processedOn\":\n return item.processedOn ?? 0;\n default:\n return item.timestamp ?? 0;\n }\n }\n\n /**\n * Get sortable value from RunInfoList (lightweight version)\n */\n private getSortValueForList(\n item: RunInfoList,\n field: string,\n ): string | number {\n switch (field) {\n case \"timestamp\":\n return item.timestamp ?? 0;\n case \"name\":\n return item.name.toLowerCase();\n case \"status\":\n return item.status;\n case \"duration\":\n return item.duration ?? 0;\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"processedOn\":\n return item.processedOn ?? 0;\n default:\n return item.timestamp ?? 0;\n }\n }\n\n /**\n * Get sortable value from SchedulerInfo\n */\n private getSchedulerSortValue(\n item: SchedulerInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"name\":\n return item.name.toLowerCase();\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"pattern\":\n return item.pattern?.toLowerCase() ?? \"\";\n case \"next\":\n return item.next ?? 0;\n case \"tz\":\n return item.tz?.toLowerCase() ?? \"\";\n default:\n return item.name.toLowerCase();\n }\n }\n\n /**\n * Get sortable value from DelayedJobInfo\n */\n private getDelayedSortValue(\n item: DelayedJobInfo,\n field: string,\n ): string | number {\n switch (field) {\n case \"name\":\n return item.name.toLowerCase();\n case \"queueName\":\n return item.queueName.toLowerCase();\n case \"processAt\":\n return item.processAt;\n case \"delay\":\n return item.delay;\n default:\n return item.processAt;\n }\n }\n\n /**\n * Convert a BullMQ Job to JobInfo or RunInfoList\n * @param job - The BullMQ job to convert\n * @param fields - \"list\" for lightweight list view, \"full\" for complete job details\n * @param knownState - Optional: skip getState() call if state is already known from fetch\n */\n private async jobToInfo(\n job: Job,\n _fields: \"list\" | \"full\" = \"full\",\n knownState?: JobStatus,\n ): Promise<JobInfo | RunInfoList> {\n // Use known state if provided (avoids expensive Redis getState() call)\n // Otherwise use cached state, or fetch and cache\n let state = knownState;\n if (!state) {\n const cacheKey = `${job.queueName}:${job.id}`;\n state = this.jobStateCache.get(cacheKey);\n if (!state) {\n state = (await job.getState()) as JobStatus;\n this.jobStateCache.set(cacheKey, state);\n }\n }\n const duration =\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined;\n\n // Normalize progress to number or object\n let progress: number | object = 0;\n if (typeof job.progress === \"number\") {\n progress = job.progress;\n } else if (typeof job.progress === \"object\" && job.progress !== null) {\n progress = job.progress;\n }\n\n // Extract configured tag fields from job data\n const tags = this.extractTags(job.data);\n\n // Extract parent info if this job is part of a flow\n let parent: { id: string; queueName: string } | undefined;\n if (job.parent?.id) {\n parent = {\n id: job.parent.id,\n queueName:\n job.parent.queueKey?.split(\":\")[1] || job.parent.queueKey || \"\",\n };\n } else if (job.parentKey) {\n // parentKey format: \"bull:queueName:jobId\"\n const parts = job.parentKey.split(\":\");\n if (parts.length >= 3) {\n parent = {\n id: parts[parts.length - 1] || \"\",\n queueName: parts[parts.length - 2] || \"\",\n };\n }\n }\n\n return {\n id: job.id || \"\",\n name: job.name,\n data: job.data,\n opts: {\n attempts: job.opts.attempts,\n delay: job.opts.delay,\n priority: job.opts.priority,\n },\n progress,\n attemptsMade: job.attemptsMade,\n processedOn: job.processedOn,\n finishedOn: job.finishedOn,\n timestamp: job.timestamp,\n failedReason: job.failedReason,\n stacktrace: job.stacktrace ?? undefined,\n returnvalue: job.returnvalue,\n status: state as JobStatus,\n duration,\n tags,\n parent,\n };\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Bulk Operations\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Retry multiple jobs across queues\n * Processed in parallel for better performance\n */\n async bulkRetry(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.retry();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n /**\n * Delete multiple jobs across queues\n * Processed in parallel for better performance\n */\n async bulkDelete(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.remove();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n /**\n * Promote multiple delayed jobs across queues (move to waiting)\n * Processed in parallel for better performance\n */\n async bulkPromote(\n jobs: { queueName: string; jobId: string }[],\n ): Promise<{ success: number; failed: number }> {\n const results = await Promise.allSettled(\n jobs.map(async ({ queueName, jobId }) => {\n const queue = this.queues.get(queueName);\n if (!queue) {\n throw new Error(\"Queue not found\");\n }\n\n const job = await queue.getJob(jobId);\n if (!job) {\n throw new Error(\"Job not found\");\n }\n\n await job.promote();\n this.invalidateJobCache(queueName, jobId);\n return { success: true };\n }),\n );\n\n let success = 0;\n let failed = 0;\n for (const result of results) {\n if (result.status === \"fulfilled\") {\n success++;\n } else {\n failed++;\n }\n }\n\n return { success, failed };\n }\n\n // ─────────────────────────────────────────────────────────────────────────────\n // Flow Operations\n // ─────────────────────────────────────────────────────────────────────────────\n\n /**\n * Get all flows (jobs that have children or are part of a flow) - cached\n * Optimized to focus on waiting-children type first and early exit\n */\n async getFlows(limit = 50): Promise<FlowSummary[]> {\n if (!this.flowProducer) {\n return [];\n }\n\n return this.cached(`flows:${limit}`, this.CACHE_TTL.flows, async () => {\n const queueEntries = Array.from(this.queues.entries());\n\n // Check counts first to skip empty queues\n const queueChecks = await Promise.all(\n queueEntries.map(async ([queueName, queue]) => {\n const counts = await this.getCachedJobCounts(queue);\n const hasRelevantJobs =\n (counts.waiting || 0) > 0 ||\n (counts[\"waiting-children\"] || 0) > 0 ||\n (counts.active || 0) > 0;\n return { queueName, queue, hasRelevantJobs };\n }),\n );\n\n const relevantQueues = queueChecks.filter((q) => q.hasRelevantJobs);\n if (relevantQueues.length === 0) {\n return [];\n }\n\n // Focus on waiting-children first (most likely to be flows)\n // Then check other types with reduced limits\n const queueResults = await Promise.all(\n relevantQueues.map(async ({ queueName, queue }) => {\n try {\n // Fetch waiting-children first (most likely flows) with higher limit\n const waitingChildrenJobs = await queue.getJobs(\n [\"waiting-children\"],\n 0,\n 50,\n );\n\n // If we already have enough flows, skip other types\n if (waitingChildrenJobs.length >= limit) {\n return { queueName, jobs: waitingChildrenJobs };\n }\n\n // Fetch other types with reduced limits\n const otherTypes = [\n \"active\",\n \"waiting\",\n \"prioritized\",\n \"completed\",\n \"failed\",\n \"delayed\",\n ];\n const otherJobArrays = await Promise.all(\n otherTypes.map(async (type) => {\n try {\n return await queue.getJobs(type as any, 0, 30); // Reduced from 100\n } catch {\n return [];\n }\n }),\n );\n\n const allJobs = [...waitingChildrenJobs, ...otherJobArrays.flat()];\n return { queueName, jobs: allJobs };\n } catch {\n return { queueName, jobs: [] };\n }\n }),\n );\n\n // Collect potential root jobs (no parent)\n // Early exit when we have enough flows\n const seenJobIds = new Set<string>();\n const potentialRoots: { queueName: string; job: Job }[] = [];\n\n for (const { queueName, jobs } of queueResults) {\n // Early exit if we have enough flows\n if (potentialRoots.length >= limit * 2) {\n break;\n }\n\n for (const job of jobs) {\n if (!job?.id) continue;\n\n const jobKey = `${queueName}:${job.id}`;\n if (seenJobIds.has(jobKey)) continue;\n seenJobIds.add(jobKey);\n\n // Check if this is a root job (has no parent)\n const hasParent = !!job.parent || !!job.parentKey;\n if (!hasParent) {\n potentialRoots.push({ queueName, job });\n\n // Early exit if we have enough potential roots\n if (potentialRoots.length >= limit * 2) {\n break;\n }\n }\n }\n }\n\n // Check flows in parallel (batch to avoid overwhelming Redis)\n const batchSize = 20;\n const flows: FlowSummary[] = [];\n\n for (\n let i = 0;\n i < potentialRoots.length && flows.length < limit;\n i += batchSize\n ) {\n const batch = potentialRoots.slice(i, i + batchSize);\n const batchResults = await Promise.all(\n batch.map(async ({ queueName, job }) => {\n try {\n const flowTree = await this.flowProducer!.getFlow({\n id: job.id!,\n queueName,\n });\n\n if (flowTree?.children && flowTree.children.length > 0) {\n const stats = this.countFlowStats(flowTree);\n const state = await job.getState();\n\n return {\n id: job.id!,\n name: job.name,\n queueName,\n status: state as JobStatus,\n totalJobs: stats.total,\n completedJobs: stats.completed,\n failedJobs: stats.failed,\n timestamp: job.timestamp,\n duration:\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined,\n } as FlowSummary;\n }\n } catch {\n // Job might not have a flow, skip\n }\n return null;\n }),\n );\n\n for (const result of batchResults) {\n if (result && flows.length < limit) {\n flows.push(result);\n }\n }\n }\n\n return flows.sort((a, b) => b.timestamp - a.timestamp);\n });\n }\n\n /**\n * Get a single flow tree by root job ID\n */\n async getFlow(queueName: string, jobId: string): Promise<FlowNode | null> {\n if (!this.flowProducer) {\n return null;\n }\n\n try {\n const flowTree = await this.flowProducer.getFlow({\n id: jobId,\n queueName,\n });\n\n if (!flowTree) {\n return null;\n }\n\n return this.convertFlowTree(flowTree);\n } catch {\n return null;\n }\n }\n\n /**\n * Create a new flow\n */\n async createFlow(request: CreateFlowRequest): Promise<{ id: string }> {\n if (!this.flowProducer) {\n throw new Error(\"FlowProducer not initialized\");\n }\n\n const flowJob = this.buildFlowJob(request);\n const result = await this.flowProducer.add(flowJob);\n\n return { id: result.job.id || \"\" };\n }\n\n /**\n * Build a FlowJob from CreateFlowRequest or CreateFlowChildRequest\n */\n private buildFlowJob(\n request: CreateFlowRequest | CreateFlowChildRequest,\n ): any {\n const result: any = {\n name: request.name,\n queueName: request.queueName,\n data: request.data || {},\n };\n\n if (request.children && request.children.length > 0) {\n result.children = request.children.map((child) =>\n this.buildFlowJob(child),\n );\n }\n\n return result;\n }\n\n /**\n * Convert BullMQ flow tree to our FlowNode structure\n */\n private async convertFlowTree(tree: any): Promise<FlowNode> {\n const job = tree.job;\n const state = await job.getState();\n const duration =\n job.finishedOn && job.processedOn\n ? job.finishedOn - job.processedOn\n : undefined;\n\n const jobInfo: JobInfo = {\n id: job.id || \"\",\n name: job.name,\n data: job.data,\n opts: {\n attempts: job.opts?.attempts,\n delay: job.opts?.delay,\n priority: job.opts?.priority,\n },\n progress:\n typeof job.progress === \"number\"\n ? job.progress\n : typeof job.progress === \"object\"\n ? job.progress\n : 0,\n attemptsMade: job.attemptsMade || 0,\n processedOn: job.processedOn,\n finishedOn: job.finishedOn,\n timestamp: job.timestamp,\n failedReason: job.failedReason,\n stacktrace: job.stacktrace ?? undefined,\n returnvalue: job.returnvalue,\n status: state as JobStatus,\n duration,\n tags: this.extractTags(job.data),\n };\n\n const children: FlowNode[] = [];\n if (tree.children && tree.children.length > 0) {\n for (const child of tree.children) {\n children.push(await this.convertFlowTree(child));\n }\n }\n\n return {\n job: jobInfo,\n queueName: job.queueName || tree.queueName || \"\",\n children: children.length > 0 ? children : undefined,\n };\n }\n\n /**\n * Count statistics for a flow tree\n */\n private countFlowStats(tree: any): {\n total: number;\n completed: number;\n failed: number;\n } {\n let total = 1;\n let completed = 0;\n let failed = 0;\n\n // Check current job status (synchronously from available data)\n const job = tree.job;\n if (job.finishedOn && !job.failedReason) {\n completed = 1;\n } else if (job.failedReason) {\n failed = 1;\n }\n\n if (tree.children) {\n for (const child of tree.children) {\n const childStats = this.countFlowStats(child);\n total += childStats.total;\n completed += childStats.completed;\n failed += childStats.failed;\n }\n }\n\n return { total, completed, failed };\n }\n}\n","import type { Queue, RedisOptions } from \"bullmq\";\nimport { discoverQueues } from \"./discover\";\nimport { QueueManager } from \"./queue-manager\";\nimport type { WorkbenchOptions } from \"./types\";\n\n/**\n * Internal metadata produced by {@link WorkbenchCore.fromOptions} when queues\n * are auto-discovered from a Redis connection.\n */\nexport interface DiscoveryMeta {\n /** Total number of queues found on the connection (before capping). */\n total: number;\n /** True if the result was capped at `maxQueues`. */\n capped: boolean;\n /** The cap that was applied. */\n cap: number;\n}\n\n/**\n * Core Workbench class that manages the dashboard\n */\nexport class WorkbenchCore {\n readonly options: Required<Pick<WorkbenchOptions, \"title\" | \"readonly\">> &\n WorkbenchOptions;\n readonly queueManager: QueueManager;\n readonly discovery: DiscoveryMeta | null;\n\n constructor(\n options: WorkbenchOptions | Queue[],\n discovery: DiscoveryMeta | null = null,\n ) {\n const opts = Array.isArray(options) ? { queues: options } : options;\n\n this.options = {\n title: \"Workbench\",\n readonly: false,\n ...opts,\n };\n\n this.discovery = discovery;\n\n const explicit = this.options.queues ?? [];\n const allowEmpty = !!this.options.redis;\n\n if (explicit.length === 0 && !allowEmpty) {\n throw new Error(\n \"Workbench requires at least one queue. Pass queues directly or provide a redis connection for auto-discovery.\",\n );\n }\n\n this.queueManager = new QueueManager(explicit, this.options.tags || []);\n }\n\n /**\n * Async factory: build a `WorkbenchCore` from `WorkbenchOptions`, performing\n * BullMQ queue auto-discovery via `SCAN <prefix>:*:meta` when `queues` is\n * not provided.\n *\n * - When `queues` is set explicitly, behaves like `new WorkbenchCore(opts)`.\n * - When only `redis` is set, scans the connection for queues, caps at\n * `maxQueues` (default 100) to avoid connection storms with very large\n * deployments, and constructs the core with the resulting list.\n * - When no queues are discovered, the core is constructed with an empty\n * queue map so the dashboard can render an \"empty\" state instead of\n * erroring out.\n */\n static async fromOptions(opts: WorkbenchOptions): Promise<WorkbenchCore> {\n if (opts.queues?.length) {\n return new WorkbenchCore(opts);\n }\n if (!opts.redis) {\n throw new Error(\n \"WorkbenchCore.fromOptions requires either `queues` or `redis`\",\n );\n }\n\n const prefix = opts.prefix ?? \"bull\";\n const cap = opts.maxQueues ?? 100;\n const all = await discoverQueues(opts.redis, prefix);\n const queues = all.slice(0, cap);\n\n return new WorkbenchCore(\n { ...opts, queues },\n { total: all.length, capped: all.length > cap, cap },\n );\n }\n\n /**\n * Get the queue manager instance\n */\n getQueueManager(): QueueManager {\n return this.queueManager;\n }\n\n /**\n * Check if authentication is required\n */\n requiresAuth(): boolean {\n return !!(this.options.auth?.username && this.options.auth?.password);\n }\n\n /**\n * Validate authentication credentials\n */\n validateAuth(username: string, password: string): boolean {\n if (!this.requiresAuth()) return true;\n return (\n username === this.options.auth?.username &&\n password === this.options.auth?.password\n );\n }\n\n /**\n * Get dashboard configuration for the UI\n */\n getConfig() {\n return {\n title: this.options.title,\n logo: this.options.logo,\n readonly: this.options.readonly,\n queues: this.queueManager.getQueueNames(),\n tags: this.queueManager.getTagFields(),\n discovery: this.discovery,\n };\n }\n}\n\n// Re-export for convenience: callers using `WorkbenchOptions.redis` can also\n// import the underlying connection type without depending on `bullmq` directly.\nexport type { RedisOptions };\n","import type { Queue } from \"bullmq\";\nimport type { WorkbenchOptions } from \"../core/types\";\nimport { WorkbenchCore } from \"../core/workbench\";\nimport { buildWorkbenchApp } from \"../server/hono-app\";\n\nexport interface FetchHandlerResult {\n /**\n * Web-standard fetch handler. Accepts a `Request` and returns a `Response`.\n * Suitable for Elysia's `.mount(path, handler)`, Next.js route handlers,\n * Bun.serve, and any other web-standards-friendly runtime.\n */\n fetch: (req: Request) => Promise<Response>;\n /**\n * The underlying `WorkbenchCore` instance. Exposed so adapters can read\n * config, query state, or wire up custom auth strategies.\n */\n core: WorkbenchCore;\n}\n\n/**\n * Build a self-contained web-fetch handler for Workbench: API routes,\n * `/config`, static `/assets/:file`, an `index.html` catch-all with a\n * correct `<base href>`, CORS on `/api/*`, and optional Basic Auth on\n * everything.\n *\n * This is the engine shared by every fetch-native adapter (Elysia, Next.js).\n * Express and Fastify adapters use {@link buildRouteTable} directly instead.\n *\n * When `options.basePath` is set, the handler rewrites the incoming Request\n * URL to strip that prefix before routing. This makes the bridge work\n * uniformly for both fetch hosts:\n *\n * - `Elysia.mount()` already strips the prefix before calling us — the\n * strip below is a no-op in that case.\n * - Next.js App Router preserves the full path — the strip is what lets\n * our internal routes (`/api/*`, `/config`, …) match.\n */\nexport function createFetchHandler(\n options: WorkbenchOptions | Queue[],\n): FetchHandlerResult {\n const core = new WorkbenchCore(options);\n const app = buildWorkbenchApp(core);\n const basePath = normalizeBasePath(core.options.basePath);\n\n const fetchHandler = async (req: Request): Promise<Response> => {\n if (basePath) {\n const url = new URL(req.url);\n if (\n url.pathname === basePath ||\n url.pathname.startsWith(`${basePath}/`)\n ) {\n const rewritten = url.pathname.slice(basePath.length) || \"/\";\n url.pathname = rewritten;\n const init: RequestInit = {\n method: req.method,\n headers: req.headers,\n body:\n req.method === \"GET\" || req.method === \"HEAD\"\n ? undefined\n : req.body,\n // @ts-expect-error duplex is required for streaming bodies in Node 18+\n duplex: \"half\",\n redirect: req.redirect,\n };\n return app.fetch(new Request(url.toString(), init));\n }\n }\n return app.fetch(req);\n };\n\n return {\n fetch: fetchHandler,\n core,\n };\n}\n\n/**\n * Normalize a base path: trim trailing slashes so we can do exact prefix\n * comparisons without double-slashes. Returns `null` for the default mount\n * (`\"\"` or `\"/\"`) so the no-strip fast path runs.\n */\nfunction normalizeBasePath(value: string | undefined): string | null {\n if (!value) return null;\n const trimmed = value.endsWith(\"/\") ? value.slice(0, -1) : value;\n if (trimmed === \"\" || trimmed === \"/\") return null;\n return trimmed.startsWith(\"/\") ? trimmed : `/${trimmed}`;\n}\n","/**\n * Parse a `Basic` Authorization header and check it against the configured\n * credentials. Uses constant-time comparison to avoid leaking timing info\n * about which character mismatched.\n *\n * Returns `true` when credentials are valid, `false` otherwise. Both inputs\n * being undefined or empty count as a failed check — adapters should only\n * call this when `core.requiresAuth()` is true.\n */\nexport function checkBasicAuth(\n authHeader: string | undefined,\n username: string,\n password: string,\n): boolean {\n if (!authHeader) return false;\n\n const [scheme, encoded] = authHeader.split(\" \");\n if (!scheme || scheme.toLowerCase() !== \"basic\" || !encoded) return false;\n\n let decoded: string;\n try {\n decoded = Buffer.from(encoded, \"base64\").toString(\"utf-8\");\n } catch {\n return false;\n }\n\n const idx = decoded.indexOf(\":\");\n if (idx === -1) return false;\n const user = decoded.slice(0, idx);\n const pass = decoded.slice(idx + 1);\n\n return safeEqual(user, username) && safeEqual(pass, password);\n}\n\n/**\n * Constant-time string compare. Returns false immediately on length mismatch\n * (length itself is not secret — protecting against timing leaks on the\n * character-by-character compare is what matters).\n */\nfunction safeEqual(a: string, b: string): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) {\n diff |= a.charCodeAt(i) ^ b.charCodeAt(i);\n }\n return diff === 0;\n}\n\n/**\n * Standard 401 response body + header for an unauthenticated Basic auth\n * request. Adapters use this when `checkBasicAuth` returns false.\n */\nexport const BASIC_AUTH_CHALLENGE = {\n status: 401 as const,\n headers: { \"WWW-Authenticate\": 'Basic realm=\"Workbench\"' },\n body: \"Unauthorized\",\n};\n"],"mappings":";;;;;;;;;;;AAAA,SAAS,aAAgC;AACzC,SAAS,aAAa;AAUtB,eAAsB,eACpB,YACA,SAAS,QACS;AAClB,QAAM,aAAa,oBAAoB,UAAU;AACjD,QAAM,SAAS,iBAAiB,UAAU;AAM1C,QAAM,aAAa,kBAAkB,MAAM;AAE3C,MAAI;AACF,UAAM,QAAQ,KAAK,CAAC,OAAO,KAAK,GAAG,WAAW,OAAO,CAAC;AACtD,UAAM,QAAQ,MAAM,eAAe,QAAQ,MAAM;AACjD,WAAO,MAAM;AAAA,MACX,CAAC,SACC,IAAI,MAAM,MAAM;AAAA,QACd,YAAY,EAAE,GAAG,WAAW;AAAA,QAC5B;AAAA,MACF,CAAC;AAAA,IACL;AAAA,EACF,UAAE;AACA,eAAW,QAAQ;AACnB,WAAO,WAAW;AAAA,EACpB;AACF;AAEA,SAAS,kBAAkB,QAGzB;AACA,MAAI,UAAyC;AAC7C,QAAM,UAAU,IAAI,QAAe,CAAC,GAAG,WAAW;AAChD,cAAU,CAAC,QAAQ,OAAO,GAAG;AAC7B,WAAO,KAAK,SAAS,OAAO;AAAA,EAC9B,CAAC;AAGD,SAAO,GAAG,SAAS,MAAM;AAAA,EAAC,CAAC;AAC3B,SAAO;AAAA,IACL;AAAA,IACA,SAAS,MAAM;AACb,UAAI,QAAS,QAAO,IAAI,SAAS,OAAO;AAAA,IAC1C;AAAA,EACF;AACF;AAQA,SAAS,oBACP,YACiC;AACjC,MAAI,OAAO,eAAe,UAAU;AAClC,WAAO,EAAE,KAAK,WAAW;AAAA,EAC3B;AACA,SAAO,EAAE,GAAG,WAAW;AACzB;AAEA,SAAS,iBAAiB,MAA8C;AAGtE,QAAM,EAAE,KAAK,GAAG,KAAK,IAAI;AACzB,MAAI,KAAK;AACP,WAAO,IAAI,MAAM,KAAK;AAAA,MACpB,GAAG;AAAA,MACH,aAAa;AAAA,MACb,sBAAsB;AAAA,IACxB,CAAC;AAAA,EACH;AACA,SAAO,IAAI,MAAM,EAAE,GAAG,MAAM,aAAa,OAAO,sBAAsB,EAAE,CAAC;AAC3E;AAOA,eAAe,eACb,QACA,QACmB;AACnB,QAAM,UAAU,GAAG,MAAM;AACzB,QAAM,QAAQ,oBAAI,IAAY;AAC9B,MAAI,SAAS;AAEb,KAAG;AACD,UAAM,CAAC,MAAM,KAAK,IAAI,MAAM,OAAO;AAAA,MACjC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS;AACT,eAAW,OAAO,OAAO;AACvB,YAAM,OAAO,eAAe,KAAK,MAAM;AACvC,UAAI,KAAM,OAAM,IAAI,IAAI;AAAA,IAC1B;AAAA,EACF,SAAS,WAAW;AAEpB,SAAO,MAAM,KAAK,KAAK,EAAE,KAAK;AAChC;AAEA,SAAS,eAAe,KAAa,QAA+B;AAClE,QAAM,OAAO,GAAG,MAAM;AACtB,QAAM,OAAO;AACb,MAAI,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,IAAI,SAAS,IAAI,EAAG,QAAO;AACzD,SAAO,IAAI,MAAM,KAAK,QAAQ,IAAI,SAAS,KAAK,MAAM;AACxD;;;AC7HA,SAAS,oBAA0C;AACnD,SAAS,gBAAgB;AA4BlB,IAAM,eAAN,MAAmB;AAAA,EAChB,SAA6B,oBAAI,IAAI;AAAA,EACrC,YAAsB,CAAC;AAAA,EACvB,eAAoC;AAAA;AAAA;AAAA,EAIpC,QAAQ,IAAI,SAAsB;AAAA,IACxC,KAAK;AAAA;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,gBAAgB;AAAA;AAAA,EAClB,CAAC;AAAA,EAEgB,YAAY;AAAA,IAC3B,SAAS,IAAI,KAAK;AAAA;AAAA,IAClB,UAAU,IAAI,KAAK;AAAA;AAAA,IACnB,QAAQ,IAAI,KAAK;AAAA;AAAA,IACjB,OAAO,IAAI,KAAK;AAAA;AAAA,IAChB,UAAU,IAAI,KAAK;AAAA;AAAA,EACrB;AAAA,EAEA,YAAY,QAAiB,YAAsB,CAAC,GAAG;AACrD,eAAW,SAAS,QAAQ;AAC1B,WAAK,OAAO,IAAI,MAAM,MAAM,KAAK;AAAA,IACnC;AACA,SAAK,YAAY;AAGjB,UAAM,aAAa,OAAO,CAAC;AAC3B,QAAI,YAAY;AACd,YAAM,aAAa,WAAW,MAAM;AACpC,UAAI,YAAY;AACd,aAAK,eAAe,IAAI,aAAa,EAAE,WAAW,CAAC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,OACZ,KACA,KACA,SACY;AACZ,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AACjC,QAAI,WAAW,QAAW;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,MAAM,QAAQ;AAC3B,SAAK,MAAM,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC;AACjC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,YACZ,SACA,WACA,cACY;AACZ,QAAI;AAEJ,UAAM,iBAAiB,IAAI,QAAW,CAAC,GAAG,WAAW;AACnD,kBAAY,WAAW,MAAM,OAAO,IAAI,MAAM,YAAY,CAAC,GAAG,SAAS;AAAA,IACzE,CAAC;AAED,QAAI;AACF,aAAO,MAAM,QAAQ,KAAK,CAAC,SAAS,cAAc,CAAC;AAAA,IACrD,UAAE;AACA,mBAAa,SAAS;AAAA,IACxB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,mBACZ,OACA,QACA,WACA,SACA,OACgB;AAChB,QAAI;AAEF,YAAM,SAAU,MAAc;AAC9B,UAAI,CAAC,QAAQ;AAEX,cAAMA,QAAO,MAAM,MAAM,QAAQ,CAAC,MAAM,GAAG,GAAG,QAAQ,CAAC;AACvD,eAAOA,MAAK;AAAA,UACV,CAAC,QACC,OAAO,QACP,CAAC,CAAC,IAAI,cACN,IAAI,cAAc,aAClB,IAAI,cAAc;AAAA,QACtB;AAAA,MACF;AAIA,YAAM,WAAW,QAAQ,MAAM,IAAI,IAAI,MAAM;AAC7C,YAAM,SAAS,MAAM,OAAO;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,CAAC,UAAU,OAAO,WAAW,GAAG;AAClC,eAAO,CAAC;AAAA,MACV;AAGA,YAAM,cAAc,OAAO,IAAI,CAAC,UAAkB,MAAM,OAAO,KAAK,CAAC;AACrE,YAAM,OAAO,MAAM,QAAQ,IAAI,WAAW;AAG1C,aAAO,KAAK;AAAA,QACV,CAAC,QAAoB,QAAQ,QAAQ,QAAQ;AAAA,MAC/C;AAAA,IACF,SAAS,QAAQ;AAEf,YAAM,OAAO,MAAM,MAAM,QAAQ,CAAC,MAAM,GAAG,GAAG,QAAQ,CAAC;AACvD,aAAO,KAAK;AAAA,QACV,CAAC,QACC,OAAO,QACP,CAAC,CAAC,IAAI,cACN,IAAI,cAAc,aAClB,IAAI,cAAc;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,IAAI,SAA4B;AAAA,IACtD,KAAK;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,EACd,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,aAAa,IAAI,SAGvB;AAAA,IACA,KAAK;AAAA;AAAA,IACL,KAAK,MAAO;AAAA;AAAA,EACd,CAAC;AAAA;AAAA;AAAA;AAAA,EAKD,MAAc,mBACZ,OACqD;AACrD,UAAM,WAAW,MAAM;AACvB,UAAM,SAAS,KAAK,WAAW,IAAI,QAAQ;AAC3C,QAAI,WAAW,QAAW;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,SAAS,MAAM,MAAM,aAAa;AACxC,SAAK,WAAW,IAAI,UAAU,MAAM;AACpC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,WAAmB,OAAsB;AAElE,SAAK,WAAW,OAAO,SAAS;AAGhC,QAAI,OAAO;AACT,YAAM,gBAAgB,GAAG,SAAS,IAAI,KAAK;AAC3C,WAAK,cAAc,OAAO,aAAa;AAAA,IACzC;AAKA,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,UAAU;AAC5B,SAAK,MAAM,OAAO,UAAU;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,QAAuB;AAChC,QAAI,QAAQ;AACV,iBAAW,OAAO,KAAK,MAAM,KAAK,GAAG;AACnC,YAAI,IAAI,WAAW,MAAM,GAAG;AAC1B,eAAK,MAAM,OAAO,GAAG;AAAA,QACvB;AAAA,MACF;AAAA,IACF,OAAO;AACL,WAAK,MAAM,MAAM;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAUH;AAED,WAAO,KAAK,OAAO,gBAAgB,KAAM,YAAY;AACnD,YAAM,SAAS;AAAA,QACb,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,aAAa;AAAA,QACb,oBAAoB;AAAA,QACpB,OAAO;AAAA,QACP,WAAW,KAAK,IAAI;AAAA,MACtB;AAEA,YAAM,QAAQ;AAAA,QACZ,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,OAAO,UAAU;AACpD,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,iBAAO,WAAW,OAAO,WAAW;AACpC,iBAAO,UAAU,OAAO,UAAU;AAClC,iBAAO,aAAa,OAAO,aAAa;AACxC,iBAAO,UAAU,OAAO,UAAU;AAClC,iBAAO,WAAW,OAAO,WAAW;AACpC,iBAAO,eAAe,OAAO,eAAe;AAC5C,iBAAO,kBAAkB,KAAK,OAAO,kBAAkB,KAAK;AAAA,QAC9D,CAAC;AAAA,MACH;AAEA,aAAO,QACL,OAAO,UACP,OAAO,SACP,OAAO,YACP,OAAO,SACP,OAAO,UACP,OAAO,cACP,OAAO,kBAAkB;AAE3B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,eAAyB;AACvB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAA0B;AACxB,WAAO,MAAM,KAAK,KAAK,OAAO,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,MAAiC;AACxC,WAAO,KAAK,OAAO,IAAI,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAkC;AACtC,WAAO,KAAK,OAAO,UAAU,KAAK,UAAU,QAAQ,YAAY;AAE9D,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,YAAM,UAAU,MAAM,QAAQ;AAAA,QAC5B,aAAa,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM;AACxC,gBAAM,CAAC,QAAQ,QAAQ,IAAI,MAAM,QAAQ,IAAI;AAAA,YAC3C,KAAK,mBAAmB,KAAK;AAAA,YAC7B,MAAM,SAAS;AAAA,UACjB,CAAC;AAED,iBAAO;AAAA,YACL;AAAA,YACA,QAAQ;AAAA,cACN,SAAS,OAAO,WAAW;AAAA,cAC3B,QAAQ,OAAO,UAAU;AAAA,cACzB,WAAW,OAAO,aAAa;AAAA,cAC/B,QAAQ,OAAO,UAAU;AAAA,cACzB,SAAS,OAAO,WAAW;AAAA,cAC3B,aAAa,OAAO,eAAe;AAAA,cACnC,oBAAoB,OAAO,kBAAkB,KAAK;AAAA,cAClD,QAAQ,OAAO,UAAU;AAAA,YAC3B;AAAA,YACA;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cAAsC;AAC1C,WAAO,KAAK,OAAO,YAAY,KAAK,UAAU,UAAU,YAAY;AAClE,YAAM,SAAS,MAAM,KAAK,UAAU;AAEpC,UAAI,YAAY;AAChB,UAAI,aAAa;AACjB,UAAI,aAAa;AAEjB,iBAAW,SAAS,QAAQ;AAC1B,qBACE,MAAM,OAAO,UACb,MAAM,OAAO,SACb,MAAM,OAAO,UACb,MAAM,OAAO,cACb,MAAM,OAAO,kBAAkB;AACjC,sBAAc,MAAM,OAAO;AAC3B,sBAAc,MAAM,OAAO;AAAA,MAC7B;AAGA,YAAM,iBAAiB,OAAO;AAAA,QAC5B,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO;AAAA,QAC3B;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,aAAa;AAAA;AAAA,QACb;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,WAAW,WAAkC;AACjD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,UAAM,MAAM,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAY,WAAkC;AAClD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,UAAM,MAAM,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cAAc,WAAqC;AACvD,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,SAAS,aAAa;AAAA,IAClD;AACA,WAAO,MAAM,SAAS;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,aAAuC;AAC3C,WAAO,KAAK,OAAO,WAAW,KAAK,UAAU,SAAS,YAAY;AAChE,aAAO,KAAK;AAAA,SACT,YAAY;AACX,gBAAM,MAAM,KAAK,IAAI;AACrB,gBAAM,qBAAqB,MAAM,KAAK,KAAK,KAAK;AAGhD,gBAAM,qBAAqB,MAAsB;AAC/C,kBAAM,UAA0B,CAAC;AACjC,kBAAM,YACJ,KAAK,MAAM,sBAAsB,KAAK,KAAK,IAAK,KAC/C,KAAK,KAAK;AACb,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,sBAAQ,KAAK;AAAA,gBACX,MAAM,YAAY,IAAI,KAAK,KAAK;AAAA,gBAChC,WAAW;AAAA,gBACX,QAAQ;AAAA,gBACR,aAAa;AAAA,gBACb,aAAa;AAAA,cACf,CAAC;AAAA,YACH;AACA,mBAAO;AAAA,UACT;AAEA,gBAAM,kBAAkB,oBAAI,IAO1B;AAGF,qBAAW,aAAa,KAAK,OAAO,KAAK,GAAG;AAC1C,4BAAgB,IAAI,WAAW;AAAA,cAC7B,SAAS,mBAAmB;AAAA,cAC5B,WAAW,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,cAC9C,WAAW,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,YAChD,CAAC;AAAA,UACH;AAGA,gBAAM,UAKD,CAAC;AACN,gBAAM,eAAe,oBAAI,IAQvB;AAIF,gBAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,gBAAM,cAAc,MAAM,QAAQ;AAAA,YAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,oBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,gBACA,kBACG,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,KAAK;AAAA,cAC1D;AAAA,YACF,CAAC;AAAA,UACH;AAGA,gBAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAElE,gBAAM,eAAe,MAAM,QAAQ;AAAA,YACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AAGjD,oBAAM,CAAC,eAAe,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,gBACpD,KAAK;AAAA,kBACH;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA;AAAA,gBACF;AAAA,gBACA,KAAK;AAAA,kBACH;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA,kBACA;AAAA;AAAA,gBACF;AAAA,cACF,CAAC;AACD,qBAAO,EAAE,WAAW,eAAe,WAAW;AAAA,YAChD,CAAC;AAAA,UACH;AAGA,qBAAW,EAAE,WAAW,eAAe,WAAW,KAAK,cAAc;AACnE,kBAAM,UAAU,gBAAgB,IAAI,SAAS;AAG7C,uBAAW,OAAO,eAAe;AAC/B,kBAAI,CAAC,KAAK,cAAc,IAAI,aAAa;AACvC;AAEF,oBAAM,cAAc,KAAK;AAAA,iBACtB,IAAI,cAAc,QAAQ,QAAQ,CAAC,GAAG,QAAQ,OAC5C,KAAK,KAAK;AAAA,cACf;AACA,kBAAI,eAAe,KAAK,cAAc,IAAI;AACxC,wBAAQ,QAAQ,WAAW,EAAE;AAE7B,sBAAM,WAAW,IAAI,cACjB,IAAI,aAAa,IAAI,cACrB;AACJ,sBAAM,WAAW,IAAI,cACjB,IAAI,cAAc,IAAI,YACtB;AAEJ,oBAAI,WAAW,GAAG;AAChB,0BAAQ,UAAU,WAAW,EAAE,KAAK,QAAQ;AAC5C,0BAAQ,KAAK;AAAA,oBACX,MAAM,IAAI;AAAA,oBACV;AAAA,oBACA;AAAA,oBACA,OAAO,IAAI,MAAM;AAAA,kBACnB,CAAC;AAAA,gBACH;AACA,oBAAI,WAAW,GAAG;AAChB,0BAAQ,UAAU,WAAW,EAAE,KAAK,QAAQ;AAAA,gBAC9C;AAAA,cACF;AAGA,oBAAM,MAAM,GAAG,SAAS,IAAI,IAAI,IAAI;AACpC,oBAAM,QAAQ,aAAa,IAAI,GAAG,KAAK;AAAA,gBACrC,MAAM,IAAI;AAAA,gBACV;AAAA,gBACA,WAAW;AAAA,gBACX,QAAQ;AAAA,cACV;AACA,oBAAM;AACN,2BAAa,IAAI,KAAK,KAAK;AAAA,YAC7B;AAGA,uBAAW,OAAO,YAAY;AAC5B,kBAAI,CAAC,KAAK,cAAc,IAAI,aAAa;AACvC;AAEF,oBAAM,cAAc,KAAK;AAAA,iBACtB,IAAI,cAAc,QAAQ,QAAQ,CAAC,GAAG,QAAQ,OAC5C,KAAK,KAAK;AAAA,cACf;AACA,kBAAI,eAAe,KAAK,cAAc,IAAI;AACxC,wBAAQ,QAAQ,WAAW,EAAE;AAAA,cAC/B;AAGA,oBAAM,MAAM,GAAG,SAAS,IAAI,IAAI,IAAI;AACpC,oBAAM,QAAQ,aAAa,IAAI,GAAG,KAAK;AAAA,gBACrC,MAAM,IAAI;AAAA,gBACV;AAAA,gBACA,WAAW;AAAA,gBACX,QAAQ;AAAA,cACV;AACA,oBAAM;AACN,2BAAa,IAAI,KAAK,KAAK;AAAA,YAC7B;AAAA,UACF;AAGA,qBAAW,WAAW,gBAAgB,OAAO,GAAG;AAC9C,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,oBAAM,YAAY,QAAQ,UAAU,CAAC;AACrC,oBAAM,YAAY,QAAQ,UAAU,CAAC;AACrC,kBAAI,UAAU,SAAS,GAAG;AACxB,wBAAQ,QAAQ,CAAC,EAAE,cAAc,KAAK;AAAA,kBACpC,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAAA,gBACnD;AAAA,cACF;AACA,kBAAI,UAAU,SAAS,GAAG;AACxB,wBAAQ,QAAQ,CAAC,EAAE,cAAc,KAAK;AAAA,kBACpC,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAAA,gBACnD;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAMA,gBAAM,mBAAmB,mBAAmB;AAC5C,gBAAM,qBAAiC,MAAM;AAAA,YAC3C,EAAE,QAAQ,GAAG;AAAA,YACb,MAAM,CAAC;AAAA,UACT;AACA,gBAAM,qBAAiC,MAAM;AAAA,YAC3C,EAAE,QAAQ,GAAG;AAAA,YACb,MAAM,CAAC;AAAA,UACT;AAEA,qBAAW,WAAW,gBAAgB,OAAO,GAAG;AAC9C,qBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,+BAAiB,CAAC,EAAE,aAAa,QAAQ,QAAQ,CAAC,EAAE;AACpD,+BAAiB,CAAC,EAAE,UAAU,QAAQ,QAAQ,CAAC,EAAE;AACjD,iCAAmB,CAAC,EAAE,KAAK,GAAG,QAAQ,UAAU,CAAC,CAAC;AAClD,iCAAmB,CAAC,EAAE,KAAK,GAAG,QAAQ,UAAU,CAAC,CAAC;AAAA,YACpD;AAAA,UACF;AAGA,mBAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,gBAAI,mBAAmB,CAAC,EAAE,SAAS,GAAG;AACpC,+BAAiB,CAAC,EAAE,cAAc,KAAK;AAAA,gBACrC,mBAAmB,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAC7C,mBAAmB,CAAC,EAAE;AAAA,cAC1B;AAAA,YACF;AACA,gBAAI,mBAAmB,CAAC,EAAE,SAAS,GAAG;AACpC,+BAAiB,CAAC,EAAE,cAAc,KAAK;AAAA,gBACrC,mBAAmB,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAC7C,mBAAmB,CAAC,EAAE;AAAA,cAC1B;AAAA,YACF;AAAA,UACF;AAEA,gBAAM,iBAAiB,iBAAiB;AAAA,YACtC,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,YACpB;AAAA,UACF;AACA,gBAAM,cAAc,iBAAiB;AAAA,YACnC,CAAC,KAAK,MAAM,MAAM,EAAE;AAAA,YACpB;AAAA,UACF;AACA,gBAAM,eAAe,mBAAmB,KAAK;AAC7C,gBAAM,eAAe,mBAAmB,KAAK;AAG7C,gBAAM,cAAc,QACjB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ,EACtC,MAAM,GAAG,EAAE;AAGd,gBAAM,mBAAmB,MAAM,KAAK,aAAa,OAAO,CAAC,EACtD,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,OAAO;AAAA,YACX,MAAM,EAAE;AAAA,YACR,WAAW,EAAE;AAAA,YACb,WAAW,EAAE;AAAA,YACb,YAAY,EAAE,YAAY,EAAE;AAAA,YAC5B,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE;AAAA,UACzC,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EACxC,MAAM,GAAG,EAAE;AAEd,iBAAO;AAAA,YACL,QAAQ,CAAC;AAAA;AAAA,YACT,WAAW;AAAA,cACT,WAAW;AAAA,cACX,SAAS;AAAA,cACT,SAAS;AAAA,gBACP;AAAA,gBACA;AAAA,gBACA,WACE,iBAAiB,cAAc,IAC3B,eAAe,iBAAiB,eAChC;AAAA,gBACN,aACE,aAAa,SAAS,IAClB,KAAK;AAAA,kBACH,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IACpC,aAAa;AAAA,gBACjB,IACA;AAAA,gBACN,aACE,aAAa,SAAS,IAClB,KAAK;AAAA,kBACH,aAAa,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IACpC,aAAa;AAAA,gBACjB,IACA;AAAA,gBACN,mBAAmB,KAAK;AAAA,mBACrB,iBAAiB,eAAe;AAAA,gBACnC;AAAA,cACF;AAAA,YACF;AAAA,YACA;AAAA,YACA;AAAA,YACA,YAAY;AAAA,UACd;AAAA,QACF,GAAG;AAAA,QACH;AAAA;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,mBAAmD;AACvD,WAAO,KAAK,OAAO,YAAY,KAAK,UAAU,UAAU,YAAY;AAClE,YAAM,MAAM,KAAK,IAAI;AACrB,YAAM,aAAa,IAAI,KAAK,KAAK;AACjC,YAAM,cAAc;AAGpB,YAAM,YAAY,IAAI,KAAK,GAAG;AAC9B,gBAAU,SAAS,GAAG,GAAG,GAAG,CAAC;AAC7B,gBAAU,QAAQ,UAAU,QAAQ,IAAI,CAAC;AACzC,YAAM,YAAY,UAAU,QAAQ;AAGpC,YAAM,UAA4B,CAAC;AACnC,eAAS,IAAI,GAAG,IAAI,aAAa,KAAK;AACpC,gBAAQ,KAAK;AAAA,UACX,MAAM,YAAY,IAAI;AAAA,UACtB,WAAW;AAAA,UACX,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAIA,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,YAAM,cAAc,MAAM,QAAQ;AAAA,QAChC,aAAa,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM;AACpC,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,iBAAO;AAAA,YACL;AAAA,YACA,kBACG,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,KAAK;AAAA,UAC1D;AAAA,QACF,CAAC;AAAA,MACH;AAGA,YAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAElE,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,eAAe,IAAI,OAAO,EAAE,MAAM,MAAM;AAGtC,gBAAM,CAAC,eAAe,UAAU,IAAI,MAAM,QAAQ,IAAI;AAAA,YACpD,KAAK;AAAA,cACH;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAAA,YACF;AAAA,YACA,KAAK;AAAA,cACH;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAAA,YACF;AAAA,UACF,CAAC;AACD,iBAAO,EAAE,eAAe,WAAW;AAAA,QACrC,CAAC;AAAA,MACH;AAGA,iBAAW,EAAE,eAAe,WAAW,KAAK,cAAc;AAExD,mBAAW,OAAO,eAAe;AAC/B,cAAI,CAAC,KAAK,cAAc,IAAI,aAAa,UAAW;AAEpD,gBAAM,cAAc,KAAK;AAAA,aACtB,IAAI,aAAa,aAAa;AAAA,UACjC;AACA,cAAI,eAAe,KAAK,cAAc,aAAa;AACjD,oBAAQ,WAAW,EAAE;AAAA,UACvB;AAAA,QACF;AAGA,mBAAW,OAAO,YAAY;AAC5B,cAAI,CAAC,KAAK,cAAc,IAAI,aAAa,UAAW;AAEpD,gBAAM,cAAc,KAAK;AAAA,aACtB,IAAI,aAAa,aAAa;AAAA,UACjC;AACA,cAAI,eAAe,KAAK,cAAc,aAAa;AACjD,oBAAQ,WAAW,EAAE;AAAA,UACvB;AAAA,QACF;AAAA,MACF;AAEA,YAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC;AACtE,YAAM,cAAc,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC;AAEhE,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QACJ,WACA,QACA,QAAQ,IACR,QAAQ,GACR,MACqC;AACrC,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,OAAO;AACV,aAAO,EAAE,MAAM,CAAC,GAAG,OAAO,GAAG,SAAS,MAAM;AAAA,IAC9C;AAEA,UAAM,QAAQ,SACV,CAAC,MAAM,IACP;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAGJ,UAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAGlD,UAAM,gBAAkD,CAAC;AACzD,QAAI,QAAQ;AAEZ,eAAW,QAAQ,OAAO;AACxB,YAAM,WAAW,MAAM,MAAM,QAAQ,MAAa,OAAO,QAAQ,KAAK;AACtE,oBAAc;AAAA,QACZ,GAAG,SAAS,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,MAC9D;AAEA,YAAM,YAAY,OAAO,IAA2B,KAAK;AACzD,eAAS;AAAA,IACX;AAGA,UAAM,WAAY,MAAM,QAAQ;AAAA,MAC9B,cAAc,IAAI,CAAC,EAAE,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK,CAAC;AAAA,IAC1E;AAGA,UAAM,YAAY,MAAM,SAAS;AACjC,UAAM,UAAU,MAAM,cAAc,QAAQ,IAAI;AAEhD,aAAS,KAAK,CAAC,GAAG,MAAM;AACtB,YAAM,OAAO,KAAK,aAAa,GAAG,SAAS;AAC3C,YAAM,OAAO,KAAK,aAAa,GAAG,SAAS;AAC3C,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,OAAO,SAAS,MAAM,GAAG,KAAK;AAEpC,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,SAAS,QAAQ,QAAQ;AAAA,MACzB,QAAQ,QAAQ,QAAQ,QAAQ,OAAO,QAAQ,KAAK,IAAI;AAAA,IAC1D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO,WAAmB,OAAwC;AACtE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,WAAO,KAAK,UAAU,KAAK,MAAM;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,WAAmB,OAAiC;AACjE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,MAAM;AAChB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UAAU,WAAmB,OAAiC;AAClE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,OAAO;AACjB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,WAAmB,OAAiC;AACnE,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,QAAI,CAAC,IAAK,QAAO;AAEjB,UAAM,IAAI,QAAQ;AAClB,SAAK,mBAAmB,WAAW,KAAK;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAiB,OAGvB;AACA,UAAM,UAAkC,CAAC;AACzC,UAAM,YAAsB,CAAC;AAC7B,UAAM,MAAM,MAAM;AAClB,QAAI,IAAI;AAER,WAAO,IAAI,KAAK;AACd,aAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,UAAI,KAAK,IAAK;AAEd,UAAI,IAAI;AACR,aAAO,IAAI,OAAO,KAAK,KAAK,MAAM,CAAC,CAAE,EAAG;AAExC,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK;AACxC,cAAM,QAAQ,MAAM,MAAM,GAAG,CAAC;AAC9B;AAEA,YAAI;AACJ,YAAI,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK;AAC/B;AACA,gBAAM,aAAa,MAAM,QAAQ,KAAK,CAAC;AACvC,cAAI,eAAe,IAAI;AACrB,oBAAQ,MAAM,MAAM,GAAG,UAAU;AACjC,gBAAI,aAAa;AAAA,UACnB,OAAO;AACL,oBAAQ,MAAM,MAAM,CAAC;AACrB,gBAAI;AAAA,UACN;AAAA,QACF,OAAO;AACL,gBAAM,aAAa;AACnB,iBAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,kBAAQ,MAAM,MAAM,YAAY,CAAC;AAAA,QACnC;AAEA,YAAI,OAAO;AACT,kBAAQ,KAAK,IAAI;AAAA,QACnB,OAAO;AACL,oBAAU,KAAK,GAAG,KAAK,GAAG;AAAA,QAC5B;AACA,YAAI;AAAA,MACN,OAAO;AACL,cAAM,QAAQ;AACd,eAAO,IAAI,OAAO,MAAM,CAAC,MAAM,IAAK;AACpC,kBAAU,KAAK,MAAM,MAAM,OAAO,CAAC,CAAC;AAAA,MACtC;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,MAAM,UAAU,OAAO,OAAO,EAAE,KAAK,GAAG;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,qBACN,KACA,SAMS;AAKT,QAAI,QAAQ,WAAW;AACrB,YAAM,UAAU,IAAI,eAAe,IAAI,cAAc,IAAI,aAAa;AACtE,UACE,UAAU,QAAQ,UAAU,SAC5B,UAAU,QAAQ,UAAU,KAC5B;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,QAAQ,QAAQ,OAAO,KAAK,QAAQ,IAAI,EAAE,SAAS,GAAG;AACxD,UAAI,CAAC,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,eAAO;AAAA,MACT;AACA,YAAM,UAAU,IAAI;AACpB,iBAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,QAAQ,IAAI,GAAG;AACzD,cAAM,WAAW,QAAQ,KAAK;AAC9B,YAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,iBAAO;AAAA,QACT;AAEA,cAAM,cAAc,OAAO,QAAQ,EAAE,YAAY;AACjD,cAAM,iBAAiB,MAAM,YAAY;AACzC,YAAI,CAAC,YAAY,SAAS,cAAc,GAAG;AACzC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAGA,QAAI,QAAQ,MAAM;AAChB,YAAM,YAAY,QAAQ,KAAK,YAAY;AAC3C,YAAM,YAAY,IAAI,IAAI,YAAY,EAAE,SAAS,SAAS;AAC1D,YAAM,cAAc,IAAI,MAAM,YAAY,EAAE,SAAS,SAAS;AAE9D,UAAI,CAAC,aAAa,CAAC,aAAa;AAE9B,cAAM,kBAAkB,KAAK,UAAU,IAAI,IAAI,EAAE,YAAY;AAC7D,YAAI,CAAC,gBAAgB,SAAS,SAAS,GAAG;AACxC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,KACA,SACS;AACT,QAAI,CAAC,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC7C,aAAO,OAAO,KAAK,OAAO,EAAE,WAAW;AAAA,IACzC;AAEA,UAAM,UAAU,IAAI;AACpB,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AACpD,YAAM,WAAW,QAAQ,KAAK;AAC9B,UAAI,aAAa,UAAa,aAAa,MAAM;AAC/C,eAAO;AAAA,MACT;AAEA,YAAM,cAAc,OAAO,QAAQ,EAAE,YAAY;AACjD,YAAM,iBAAiB,MAAM,YAAY;AACzC,UAAI,CAAC,YAAY,SAAS,cAAc,GAAG;AACzC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAO,OAAe,QAAQ,IAA6B;AAC/D,UAAM,EAAE,SAAS,KAAK,IAAI,KAAK,iBAAiB,KAAK;AACrD,UAAM,YAAY,KAAK,YAAY;AACnC,UAAM,aAAa,OAAO,KAAK,OAAO,EAAE,SAAS;AACjD,UAAM,UAAU,UAAU,SAAS;AAGnC,QAAI,CAAC,cAAc,CAAC,SAAS;AAC3B,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,cAAc,MAAM,QAAQ;AAAA,MAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,cAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,cAAM,WACH,OAAO,WAAW,KAAK,MACvB,OAAO,UAAU,KAAK,MACtB,OAAO,aAAa,KAAK,MACzB,OAAO,UAAU,KAAK,MACtB,OAAO,WAAW,KAAK,MACvB,OAAO,eAAe,KAAK,MAC3B,OAAO,kBAAkB,KAAK,KAAK;AACtC,eAAO,EAAE,WAAW,OAAO,QAAQ;AAAA,MACrC,CAAC;AAAA,IACH;AAEA,UAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,OAAO;AAC1D,QAAI,eAAe,WAAW,GAAG;AAC/B,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,aAAa,KAAK,IAAI,QAAQ,GAAG,EAAE;AAGzC,UAAM,uBAAuB,oBAAI,QAAqB;AAGtD,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AAEjD,cAAM,cAAc,MAAM,QAAQ;AAAA,UAChC,MAAM,IAAI,OAAO,SAAS;AACxB,gBAAI;AACF,oBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,oBAAM,UAA0B,CAAC;AAEjC,yBAAW,OAAO,MAAM;AAEtB,oBAAI,cAAc,CAAC,KAAK,kBAAkB,KAAK,OAAO,GAAG;AACvD;AAAA,gBACF;AAGA,oBAAI,SAAS;AACX,wBAAM,YAAY,IAAI,IAAI,YAAY,EAAE,SAAS,SAAS;AAC1D,wBAAM,cAAc,IAAI,MACpB,YAAY,EACb,SAAS,SAAS;AAGrB,sBAAI,cAAc;AAClB,sBAAI,CAAC,aAAa,CAAC,aAAa;AAE9B,wBAAI,kBAAkB,qBAAqB,IAAI,GAAG;AAClD,wBAAI,CAAC,iBAAiB;AACpB,wCAAkB,KAAK,UAAU,IAAI,IAAI,EAAE,YAAY;AACvD,2CAAqB,IAAI,KAAK,eAAe;AAAA,oBAC/C;AACA,kCAAc,gBAAgB,SAAS,SAAS;AAAA,kBAClD;AAEA,sBAAI,CAAC,aAAa,CAAC,eAAe,CAAC,aAAa;AAC9C;AAAA,kBACF;AAAA,gBACF;AAGA,wBAAQ,KAAK;AAAA,kBACX,OAAO;AAAA,kBACP,KAAM,MAAM,KAAK;AAAA,oBACf;AAAA,oBACA;AAAA,oBACA;AAAA,kBACF;AAAA,gBACF,CAAC;AAAA,cACH;AAEA,qBAAO;AAAA,YACT,QAAQ;AACN,qBAAO,CAAC;AAAA,YACV;AAAA,UACF,CAAC;AAAA,QACH;AAEA,eAAO,YAAY,KAAK;AAAA,MAC1B,CAAC;AAAA,IACH;AAGA,UAAM,aAA6B,CAAC;AACpC,eAAW,UAAU,cAAc;AACjC,UAAI,OAAO,WAAW,aAAa;AACjC,mBAAW,KAAK,GAAG,OAAO,KAAK;AAAA,MACjC;AAAA,IACF;AAGA,WAAO,WAAW,MAAM,GAAG,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UACJ,WACA,QACA,QAAQ,GACS;AACjB,UAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,UAAU,MAAM,MAAM,MAAM,OAAO,KAAM,MAAM;AACrD,WAAO,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,cACZ,OACA,OACyC;AACzC,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,YAAY,aAAa;AAE/B,QAAI,cAAc,GAAG;AACnB,aAAO,EAAE,MAAM,CAAC,GAAG,OAAO,IAAI,SAAS,OAAO,QAAQ,OAAU;AAAA,IAClE;AAIA,UAAM,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,MAAM,SAAS,IAAI,CAAC;AAGzE,UAAM,WAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,cAAM,YAAY,MAAM,QAAQ;AAAA,UAC9B,SAAS,IAAI,OAAO,SAAS;AAC3B,kBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,aAAa;AAC9D,mBAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,WAAW,OAAO,KAAK,EAAE;AAAA,UAC5D,CAAC;AAAA,QACH;AACA,eAAO,UAAU,KAAK;AAAA,MACxB,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,KAAK;AAC7B,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,YAAM,YAAY,EAAE,IAAI,aAAa,MAAM,EAAE,IAAI,aAAa;AAC9D,UAAI,aAAa,EAAG,QAAO;AAE3B,aAAO,EAAE,UAAU,cAAc,EAAE,SAAS;AAAA,IAC9C,CAAC;AAGD,UAAM,gBAAgB,QAAQ,MAAM,OAAO,QAAQ,KAAK;AAGxD,UAAM,WAAW,MAAM,QAAQ;AAAA,MAC7B,cAAc,IAAI,OAAO,EAAE,KAAK,WAAW,MAAM,MAAM;AACrD,cAAM,OAAO,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK;AACpD,eAAO,EAAE,GAAG,MAAM,UAAU;AAAA,MAC9B,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,SAAS,QAAQ;AAEzC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA;AAAA,MACP;AAAA,MACA,QAAQ,UAAU,OAAO,QAAQ,SAAS,MAAM,IAAI;AAAA,IACtD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WACJ,QAAQ,IACR,QAAQ,GACR,MACA,SAMyC;AACzC,UAAM,YAAY,MAAM,SAAS;AACjC,UAAM,UAAU,MAAM,cAAc,QAAQ,IAAI;AAChD,UAAM,aAAa,CAAC,EAClB,SAAS,UACT,SAAS,QACT,SAAS,QACT,SAAS;AAEX,UAAM,kBAAkB,cAAc;AAItC,QAAI,CAAC,cAAc,mBAAmB,YAAY,IAAI;AACpD,aAAO,KAAK,cAAc,OAAO,KAAK;AAAA,IACxC;AAGA,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,UAAM,QAAQ,SAAS,SACnB,CAAC,QAAQ,MAAM,IACf;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEJ,UAAM,eAAe,CAAC,CAAC,SAAS;AAChC,UAAM,YAAY,KAAK,IAAI,aAAa,QAAQ,CAAC;AAEjD,QAAI,aAAa,WAAW,GAAG;AAC7B,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,OAAO;AAAA,QACP,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,IACF;AAIA,UAAM,oBAAoB,KAAK;AAAA,MAC7B,KAAK,KAAM,QAAQ,IAAK,SAAS,IAAI;AAAA,MACrC;AAAA,IACF;AAEA,QAAI,UAA+D,CAAC;AAGpE,UAAM,iBAAiB,OACrB,WACA,OACA,eACG;AAEH,UAAI,gBAAgB,SAAS,WAAW;AACtC,cAAM,gBAAkD,CAAC;AAGzD,YAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,gBAAM,gBAAgB,MAAM,KAAK;AAAA,YAC/B;AAAA,YACA;AAAA,YACA,QAAQ,UAAU;AAAA,YAClB,QAAQ,UAAU;AAAA,YAClB;AAAA,UACF;AACA,wBAAc;AAAA,YACZ,GAAG,cAAc,IAAI,CAAC,SAAS;AAAA,cAC7B;AAAA,cACA,OAAO;AAAA,YACT,EAAE;AAAA,UACJ;AAAA,QACF;AAEA,YAAI,MAAM,SAAS,QAAQ,GAAG;AAC5B,gBAAM,aAAa,MAAM,KAAK;AAAA,YAC5B;AAAA,YACA;AAAA,YACA,QAAQ,UAAU;AAAA,YAClB,QAAQ,UAAU;AAAA,YAClB;AAAA,UACF;AACA,wBAAc;AAAA,YACZ,GAAG,WAAW,IAAI,CAAC,SAAS;AAAA,cAC1B;AAAA,cACA,OAAO;AAAA,YACT,EAAE;AAAA,UACJ;AAAA,QACF;AAGA,cAAM,aAAa,MAAM;AAAA,UACvB,CAAC,MAAM,MAAM,eAAe,MAAM;AAAA,QACpC;AACA,YAAI,WAAW,SAAS,GAAG;AACzB,gBAAM,iBAAiB,MAAM,QAAQ;AAAA,YACnC,WAAW,IAAI,OAAO,SAAS;AAC7B,oBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,qBAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,YAC9D,CAAC;AAAA,UACH;AACA,wBAAc,KAAK,GAAG,eAAe,KAAK,CAAC;AAAA,QAC7C;AAEA,eAAO,cAAc,IAAI,CAAC,EAAE,KAAK,MAAM,OAAO;AAAA,UAC5C;AAAA,UACA;AAAA,UACA;AAAA,QACF,EAAE;AAAA,MACJ;AAGA,UAAI,SAAS,QAAQ;AACnB,cAAM,OAAO,MAAM,MAAM,QAAQ,QAAQ,QAAe,GAAG,UAAU;AACrE,eAAO,KAAK,IAAI,CAAC,SAAS;AAAA,UACxB;AAAA,UACA;AAAA,UACA,OAAO,QAAQ;AAAA,QACjB,EAAE;AAAA,MACJ;AAGA,YAAM,YAAY,MAAM,QAAQ;AAAA,QAC9B,MAAM,IAAI,OAAO,SAAS;AACxB,gBAAM,OAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,UAAU;AAC3D,iBAAO,KAAK,IAAI,CAAC,SAAS,EAAE,KAAK,OAAO,KAAkB,EAAE;AAAA,QAC9D,CAAC;AAAA,MACH;AACA,aAAO,UACJ,KAAK,EACL,IAAI,CAAC,EAAE,KAAK,MAAM,OAAO,EAAE,KAAK,WAAW,MAAM,EAAE;AAAA,IACxD;AAGA,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa;AAAA,QAAI,CAAC,CAAC,WAAW,KAAK,MACjC,eAAe,WAAW,OAAO,iBAAiB;AAAA,MACpD;AAAA,IACF;AACA,cAAU,QAAQ,KAAK;AAGvB,QAAI,SAAS;AACX,gBAAU,QAAQ;AAAA,QAAO,CAAC,EAAE,IAAI,MAC9B,KAAK,qBAAqB,KAAK,OAAO;AAAA,MACxC;AAAA,IACF;AAIA,QAAI,iBAAiB;AACnB,cAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,cAAM,QAAQ,EAAE,IAAI,aAAa;AACjC,cAAM,QAAQ,EAAE,IAAI,aAAa;AAEjC,cAAM,WAAW,YAAY,KAAK,QAAQ,QAAQ,QAAQ;AAC1D,YAAI,aAAa,EAAG,QAAO;AAE3B,cAAM,YAAY,EAAE,UAAU,cAAc,EAAE,SAAS;AACvD,YAAI,cAAc,EAAG,QAAO;AAE5B,gBAAQ,EAAE,IAAI,MAAM,IAAI,cAAc,EAAE,IAAI,MAAM,EAAE;AAAA,MACtD,CAAC;AAAA,IACH;AAGA,UAAM,gBAAgB,QAAQ,MAAM,OAAO,QAAQ,KAAK;AAGxD,UAAM,WAAW,MAAM,QAAQ;AAAA,MAC7B,cAAc,IAAI,OAAO,EAAE,KAAK,WAAW,MAAM,MAAM;AACrD,cAAM,OAAO,MAAM,KAAK,UAAU,KAAK,QAAQ,KAAK;AACpD,eAAO,EAAE,GAAG,MAAM,UAAU;AAAA,MAC9B,CAAC;AAAA,IACH;AAGA,QAAI,CAAC,iBAAiB;AACpB,eAAS,KAAK,CAAC,GAAG,MAAM;AACtB,cAAM,OAAO,KAAK,oBAAoB,GAAG,SAAS;AAClD,cAAM,OAAO,KAAK,oBAAoB,GAAG,SAAS;AAClD,YAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,YAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAGA,UAAM,UAAU,QAAQ,SAAS,QAAQ;AAEzC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA;AAAA,MACP;AAAA,MACA,QAAQ,UAAU,OAAO,QAAQ,SAAS,MAAM,IAAI;AAAA,IACtD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cACJ,gBACA,aAIC;AACD,UAAM,aAA8B,CAAC;AACrC,UAAM,UAA4B,CAAC;AAGnC,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,cAAM,CAAC,gBAAgB,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,UACtD,MAAM,kBAAkB;AAAA,UACxB,MAAM,QAAQ,WAAW,GAAG,EAAE;AAAA,QAChC,CAAC;AACD,eAAO,EAAE,WAAW,gBAAgB,YAAY;AAAA,MAClD,CAAC;AAAA,IACH;AAGA,eAAW,EAAE,WAAW,gBAAgB,YAAY,KAAK,SAAS;AAChE,iBAAW,OAAO,gBAAgB;AAChC,mBAAW,KAAK;AAAA,UACd,KAAK,IAAI;AAAA,UACT,MAAM,IAAI,QAAQ;AAAA,UAClB;AAAA,UACA,SAAS,IAAI,WAAW;AAAA,UACxB,OAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,IAAI;AAAA,UACvC,MAAM,IAAI,QAAQ;AAAA,UAClB,SAAS,IAAI,WAAW;AAAA,UACxB,IAAI,IAAI,MAAM;AAAA,QAChB,CAAC;AAAA,MACH;AAEA,iBAAW,OAAO,aAAa;AAC7B,cAAM,QAAQ,IAAI,KAAK,SAAS;AAChC,gBAAQ,KAAK;AAAA,UACX,IAAI,IAAI,MAAM;AAAA,UACd,MAAM,IAAI;AAAA,UACV;AAAA,UACA;AAAA,UACA,WAAW,IAAI,YAAY;AAAA,UAC3B,MAAM,IAAI;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,UAAM,kBAAkB,gBAAgB,SAAS;AACjD,UAAM,gBAAgB,gBAAgB,cAAc,SAAS,KAAK;AAClE,eAAW,KAAK,CAAC,GAAG,MAAM;AACxB,YAAM,OAAO,KAAK,sBAAsB,GAAG,eAAe;AAC1D,YAAM,OAAO,KAAK,sBAAsB,GAAG,eAAe;AAC1D,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,eAAe,aAAa,SAAS;AAC3C,UAAM,aAAa,aAAa,cAAc,SAAS,KAAK;AAC5D,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,YAAM,OAAO,KAAK,oBAAoB,GAAG,YAAY;AACrD,YAAM,OAAO,KAAK,oBAAoB,GAAG,YAAY;AACrD,UAAI,OAAO,KAAM,QAAO,KAAK;AAC7B,UAAI,OAAO,KAAM,QAAO,IAAI;AAC5B,aAAO;AAAA,IACT,CAAC;AAED,WAAO,EAAE,YAAY,QAAQ;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,SAAkD;AACjE,UAAM,QAAQ,KAAK,OAAO,IAAI,QAAQ,SAAS;AAC/C,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,UAAU,QAAQ,SAAS,aAAa;AAAA,IAC1D;AAEA,UAAM,MAAM,MAAM,MAAM,IAAI,QAAQ,SAAS,QAAQ,MAAM;AAAA,MACzD,OAAO,QAAQ,MAAM;AAAA,MACrB,UAAU,QAAQ,MAAM;AAAA,MACxB,UAAU,QAAQ,MAAM;AAAA,IAC1B,CAAC;AAED,WAAO,EAAE,IAAI,IAAI,MAAM,GAAG;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKQ,YAAY,MAAoC;AACtD,QAAI,CAAC,KAAK,UAAU,UAAU,CAAC,QAAQ,OAAO,SAAS,UAAU;AAC/D,aAAO;AAAA,IACT;AAEA,UAAM,OAAgB,CAAC;AACvB,UAAM,UAAU;AAEhB,eAAW,SAAS,KAAK,WAAW;AAClC,YAAM,QAAQ,QAAQ,KAAK;AAC3B,UACE,UAAU,WACT,OAAO,UAAU,YAChB,OAAO,UAAU,YACjB,OAAO,UAAU,aACjB,UAAU,OACZ;AACA,aAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,IAAI,EAAE,SAAS,IAAI,OAAO;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,aACJ,OACA,QAAQ,IACqC;AAC7C,UAAM,WAAW,oBAAI,IAAoB;AACzC,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAGA,UAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AACrD,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,aAAa,IAAI,OAAO,CAAC,EAAE,KAAK,MAAM;AACpC,cAAM,YAAY,MAAM,QAAQ;AAAA,UAC9B,MAAM,IAAI,CAAC,SAAS,MAAM,QAAQ,MAAa,GAAG,GAAG,CAAC;AAAA,QACxD;AACA,eAAO,UAAU,KAAK;AAAA,MACxB,CAAC;AAAA,IACH;AAGA,eAAW,QAAQ,cAAc;AAC/B,iBAAW,OAAO,MAAM;AACtB,YAAI,IAAI,QAAQ,OAAO,IAAI,SAAS,UAAU;AAC5C,gBAAM,UAAU,IAAI;AACpB,gBAAM,QAAQ,QAAQ,KAAK;AAC3B,cAAI,UAAU,UAAa,UAAU,MAAM;AACzC,kBAAM,WAAW,OAAO,KAAK;AAC7B,qBAAS,IAAI,WAAW,SAAS,IAAI,QAAQ,KAAK,KAAK,CAAC;AAAA,UAC1D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,UAAM,SAAS,MAAM,KAAK,SAAS,QAAQ,CAAC,EACzC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,OAAO,MAAM,EAAE;AAE7C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,aAAa;AAAA,MAC3B,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK,YAAY;AAAA,MAC1B,KAAK;AACH,eAAO,eAAe,OAAO,KAAK,UAAU,YAAY,IAAI;AAAA,MAC9D,KAAK;AACH,eAAO,KAAK,eAAe;AAAA,MAC7B;AACE,eAAO,KAAK,aAAa;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,aAAa;AAAA,MAC3B,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK,YAAY;AAAA,MAC1B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK,eAAe;AAAA,MAC7B;AACE,eAAO,KAAK,aAAa;AAAA,IAC7B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,sBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK,SAAS,YAAY,KAAK;AAAA,MACxC,KAAK;AACH,eAAO,KAAK,QAAQ;AAAA,MACtB,KAAK;AACH,eAAO,KAAK,IAAI,YAAY,KAAK;AAAA,MACnC;AACE,eAAO,KAAK,KAAK,YAAY;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,MACA,OACiB;AACjB,YAAQ,OAAO;AAAA,MACb,KAAK;AACH,eAAO,KAAK,KAAK,YAAY;AAAA,MAC/B,KAAK;AACH,eAAO,KAAK,UAAU,YAAY;AAAA,MACpC,KAAK;AACH,eAAO,KAAK;AAAA,MACd,KAAK;AACH,eAAO,KAAK;AAAA,MACd;AACE,eAAO,KAAK;AAAA,IAChB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,UACZ,KACA,UAA2B,QAC3B,YACgC;AAGhC,QAAI,QAAQ;AACZ,QAAI,CAAC,OAAO;AACV,YAAM,WAAW,GAAG,IAAI,SAAS,IAAI,IAAI,EAAE;AAC3C,cAAQ,KAAK,cAAc,IAAI,QAAQ;AACvC,UAAI,CAAC,OAAO;AACV,gBAAS,MAAM,IAAI,SAAS;AAC5B,aAAK,cAAc,IAAI,UAAU,KAAK;AAAA,MACxC;AAAA,IACF;AACA,UAAM,WACJ,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAGN,QAAI,WAA4B;AAChC,QAAI,OAAO,IAAI,aAAa,UAAU;AACpC,iBAAW,IAAI;AAAA,IACjB,WAAW,OAAO,IAAI,aAAa,YAAY,IAAI,aAAa,MAAM;AACpE,iBAAW,IAAI;AAAA,IACjB;AAGA,UAAM,OAAO,KAAK,YAAY,IAAI,IAAI;AAGtC,QAAI;AACJ,QAAI,IAAI,QAAQ,IAAI;AAClB,eAAS;AAAA,QACP,IAAI,IAAI,OAAO;AAAA,QACf,WACE,IAAI,OAAO,UAAU,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,OAAO,YAAY;AAAA,MACjE;AAAA,IACF,WAAW,IAAI,WAAW;AAExB,YAAM,QAAQ,IAAI,UAAU,MAAM,GAAG;AACrC,UAAI,MAAM,UAAU,GAAG;AACrB,iBAAS;AAAA,UACP,IAAI,MAAM,MAAM,SAAS,CAAC,KAAK;AAAA,UAC/B,WAAW,MAAM,MAAM,SAAS,CAAC,KAAK;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,IAAI,IAAI,MAAM;AAAA,MACd,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,MAAM;AAAA,QACJ,UAAU,IAAI,KAAK;AAAA,QACnB,OAAO,IAAI,KAAK;AAAA,QAChB,UAAU,IAAI,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,MACA,cAAc,IAAI;AAAA,MAClB,aAAa,IAAI;AAAA,MACjB,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,cAAc,IAAI;AAAA,MAClB,YAAY,IAAI,cAAc;AAAA,MAC9B,aAAa,IAAI;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,UACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,MAAM;AAChB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,OAAO;AACjB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,YACJ,MAC8C;AAC9C,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,KAAK,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACvC,cAAM,QAAQ,KAAK,OAAO,IAAI,SAAS;AACvC,YAAI,CAAC,OAAO;AACV,gBAAM,IAAI,MAAM,iBAAiB;AAAA,QACnC;AAEA,cAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,eAAe;AAAA,QACjC;AAEA,cAAM,IAAI,QAAQ;AAClB,aAAK,mBAAmB,WAAW,KAAK;AACxC,eAAO,EAAE,SAAS,KAAK;AAAA,MACzB,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACd,QAAI,SAAS;AACb,eAAW,UAAU,SAAS;AAC5B,UAAI,OAAO,WAAW,aAAa;AACjC;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,WAAO,EAAE,SAAS,OAAO;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,SAAS,QAAQ,IAA4B;AACjD,QAAI,CAAC,KAAK,cAAc;AACtB,aAAO,CAAC;AAAA,IACV;AAEA,WAAO,KAAK,OAAO,SAAS,KAAK,IAAI,KAAK,UAAU,OAAO,YAAY;AACrE,YAAM,eAAe,MAAM,KAAK,KAAK,OAAO,QAAQ,CAAC;AAGrD,YAAM,cAAc,MAAM,QAAQ;AAAA,QAChC,aAAa,IAAI,OAAO,CAAC,WAAW,KAAK,MAAM;AAC7C,gBAAM,SAAS,MAAM,KAAK,mBAAmB,KAAK;AAClD,gBAAM,mBACH,OAAO,WAAW,KAAK,MACvB,OAAO,kBAAkB,KAAK,KAAK,MACnC,OAAO,UAAU,KAAK;AACzB,iBAAO,EAAE,WAAW,OAAO,gBAAgB;AAAA,QAC7C,CAAC;AAAA,MACH;AAEA,YAAM,iBAAiB,YAAY,OAAO,CAAC,MAAM,EAAE,eAAe;AAClE,UAAI,eAAe,WAAW,GAAG;AAC/B,eAAO,CAAC;AAAA,MACV;AAIA,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,eAAe,IAAI,OAAO,EAAE,WAAW,MAAM,MAAM;AACjD,cAAI;AAEF,kBAAM,sBAAsB,MAAM,MAAM;AAAA,cACtC,CAAC,kBAAkB;AAAA,cACnB;AAAA,cACA;AAAA,YACF;AAGA,gBAAI,oBAAoB,UAAU,OAAO;AACvC,qBAAO,EAAE,WAAW,MAAM,oBAAoB;AAAA,YAChD;AAGA,kBAAM,aAAa;AAAA,cACjB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AACA,kBAAM,iBAAiB,MAAM,QAAQ;AAAA,cACnC,WAAW,IAAI,OAAO,SAAS;AAC7B,oBAAI;AACF,yBAAO,MAAM,MAAM,QAAQ,MAAa,GAAG,EAAE;AAAA,gBAC/C,QAAQ;AACN,yBAAO,CAAC;AAAA,gBACV;AAAA,cACF,CAAC;AAAA,YACH;AAEA,kBAAM,UAAU,CAAC,GAAG,qBAAqB,GAAG,eAAe,KAAK,CAAC;AACjE,mBAAO,EAAE,WAAW,MAAM,QAAQ;AAAA,UACpC,QAAQ;AACN,mBAAO,EAAE,WAAW,MAAM,CAAC,EAAE;AAAA,UAC/B;AAAA,QACF,CAAC;AAAA,MACH;AAIA,YAAM,aAAa,oBAAI,IAAY;AACnC,YAAM,iBAAoD,CAAC;AAE3D,iBAAW,EAAE,WAAW,KAAK,KAAK,cAAc;AAE9C,YAAI,eAAe,UAAU,QAAQ,GAAG;AACtC;AAAA,QACF;AAEA,mBAAW,OAAO,MAAM;AACtB,cAAI,CAAC,KAAK,GAAI;AAEd,gBAAM,SAAS,GAAG,SAAS,IAAI,IAAI,EAAE;AACrC,cAAI,WAAW,IAAI,MAAM,EAAG;AAC5B,qBAAW,IAAI,MAAM;AAGrB,gBAAM,YAAY,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI;AACxC,cAAI,CAAC,WAAW;AACd,2BAAe,KAAK,EAAE,WAAW,IAAI,CAAC;AAGtC,gBAAI,eAAe,UAAU,QAAQ,GAAG;AACtC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,YAAM,YAAY;AAClB,YAAM,QAAuB,CAAC;AAE9B,eACM,IAAI,GACR,IAAI,eAAe,UAAU,MAAM,SAAS,OAC5C,KAAK,WACL;AACA,cAAM,QAAQ,eAAe,MAAM,GAAG,IAAI,SAAS;AACnD,cAAM,eAAe,MAAM,QAAQ;AAAA,UACjC,MAAM,IAAI,OAAO,EAAE,WAAW,IAAI,MAAM;AACtC,gBAAI;AACF,oBAAM,WAAW,MAAM,KAAK,aAAc,QAAQ;AAAA,gBAChD,IAAI,IAAI;AAAA,gBACR;AAAA,cACF,CAAC;AAED,kBAAI,UAAU,YAAY,SAAS,SAAS,SAAS,GAAG;AACtD,sBAAM,QAAQ,KAAK,eAAe,QAAQ;AAC1C,sBAAM,QAAQ,MAAM,IAAI,SAAS;AAEjC,uBAAO;AAAA,kBACL,IAAI,IAAI;AAAA,kBACR,MAAM,IAAI;AAAA,kBACV;AAAA,kBACA,QAAQ;AAAA,kBACR,WAAW,MAAM;AAAA,kBACjB,eAAe,MAAM;AAAA,kBACrB,YAAY,MAAM;AAAA,kBAClB,WAAW,IAAI;AAAA,kBACf,UACE,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAAA,gBACR;AAAA,cACF;AAAA,YACF,QAAQ;AAAA,YAER;AACA,mBAAO;AAAA,UACT,CAAC;AAAA,QACH;AAEA,mBAAW,UAAU,cAAc;AACjC,cAAI,UAAU,MAAM,SAAS,OAAO;AAClC,kBAAM,KAAK,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,aAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAAA,IACvD,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAQ,WAAmB,OAAyC;AACxE,QAAI,CAAC,KAAK,cAAc;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,WAAW,MAAM,KAAK,aAAa,QAAQ;AAAA,QAC/C,IAAI;AAAA,QACJ;AAAA,MACF,CAAC;AAED,UAAI,CAAC,UAAU;AACb,eAAO;AAAA,MACT;AAEA,aAAO,KAAK,gBAAgB,QAAQ;AAAA,IACtC,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,SAAqD;AACpE,QAAI,CAAC,KAAK,cAAc;AACtB,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAChD;AAEA,UAAM,UAAU,KAAK,aAAa,OAAO;AACzC,UAAM,SAAS,MAAM,KAAK,aAAa,IAAI,OAAO;AAElD,WAAO,EAAE,IAAI,OAAO,IAAI,MAAM,GAAG;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKQ,aACN,SACK;AACL,UAAM,SAAc;AAAA,MAClB,MAAM,QAAQ;AAAA,MACd,WAAW,QAAQ;AAAA,MACnB,MAAM,QAAQ,QAAQ,CAAC;AAAA,IACzB;AAEA,QAAI,QAAQ,YAAY,QAAQ,SAAS,SAAS,GAAG;AACnD,aAAO,WAAW,QAAQ,SAAS;AAAA,QAAI,CAAC,UACtC,KAAK,aAAa,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,gBAAgB,MAA8B;AAC1D,UAAM,MAAM,KAAK;AACjB,UAAM,QAAQ,MAAM,IAAI,SAAS;AACjC,UAAM,WACJ,IAAI,cAAc,IAAI,cAClB,IAAI,aAAa,IAAI,cACrB;AAEN,UAAM,UAAmB;AAAA,MACvB,IAAI,IAAI,MAAM;AAAA,MACd,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,MAAM;AAAA,QACJ,UAAU,IAAI,MAAM;AAAA,QACpB,OAAO,IAAI,MAAM;AAAA,QACjB,UAAU,IAAI,MAAM;AAAA,MACtB;AAAA,MACA,UACE,OAAO,IAAI,aAAa,WACpB,IAAI,WACJ,OAAO,IAAI,aAAa,WACtB,IAAI,WACJ;AAAA,MACR,cAAc,IAAI,gBAAgB;AAAA,MAClC,aAAa,IAAI;AAAA,MACjB,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,MACf,cAAc,IAAI;AAAA,MAClB,YAAY,IAAI,cAAc;AAAA,MAC9B,aAAa,IAAI;AAAA,MACjB,QAAQ;AAAA,MACR;AAAA,MACA,MAAM,KAAK,YAAY,IAAI,IAAI;AAAA,IACjC;AAEA,UAAM,WAAuB,CAAC;AAC9B,QAAI,KAAK,YAAY,KAAK,SAAS,SAAS,GAAG;AAC7C,iBAAW,SAAS,KAAK,UAAU;AACjC,iBAAS,KAAK,MAAM,KAAK,gBAAgB,KAAK,CAAC;AAAA,MACjD;AAAA,IACF;AAEA,WAAO;AAAA,MACL,KAAK;AAAA,MACL,WAAW,IAAI,aAAa,KAAK,aAAa;AAAA,MAC9C,UAAU,SAAS,SAAS,IAAI,WAAW;AAAA,IAC7C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,MAIrB;AACA,QAAI,QAAQ;AACZ,QAAI,YAAY;AAChB,QAAI,SAAS;AAGb,UAAM,MAAM,KAAK;AACjB,QAAI,IAAI,cAAc,CAAC,IAAI,cAAc;AACvC,kBAAY;AAAA,IACd,WAAW,IAAI,cAAc;AAC3B,eAAS;AAAA,IACX;AAEA,QAAI,KAAK,UAAU;AACjB,iBAAW,SAAS,KAAK,UAAU;AACjC,cAAM,aAAa,KAAK,eAAe,KAAK;AAC5C,iBAAS,WAAW;AACpB,qBAAa,WAAW;AACxB,kBAAU,WAAW;AAAA,MACvB;AAAA,IACF;AAEA,WAAO,EAAE,OAAO,WAAW,OAAO;AAAA,EACpC;AACF;;;ACtxEO,IAAM,gBAAN,MAAM,eAAc;AAAA,EAChB;AAAA,EAEA;AAAA,EACA;AAAA,EAET,YACE,SACA,YAAkC,MAClC;AACA,UAAM,OAAO,MAAM,QAAQ,OAAO,IAAI,EAAE,QAAQ,QAAQ,IAAI;AAE5D,SAAK,UAAU;AAAA,MACb,OAAO;AAAA,MACP,UAAU;AAAA,MACV,GAAG;AAAA,IACL;AAEA,SAAK,YAAY;AAEjB,UAAM,WAAW,KAAK,QAAQ,UAAU,CAAC;AACzC,UAAM,aAAa,CAAC,CAAC,KAAK,QAAQ;AAElC,QAAI,SAAS,WAAW,KAAK,CAAC,YAAY;AACxC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,SAAK,eAAe,IAAI,aAAa,UAAU,KAAK,QAAQ,QAAQ,CAAC,CAAC;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,aAAa,YAAY,MAAgD;AACvE,QAAI,KAAK,QAAQ,QAAQ;AACvB,aAAO,IAAI,eAAc,IAAI;AAAA,IAC/B;AACA,QAAI,CAAC,KAAK,OAAO;AACf,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,UAAM,SAAS,KAAK,UAAU;AAC9B,UAAM,MAAM,KAAK,aAAa;AAC9B,UAAM,MAAM,MAAM,eAAe,KAAK,OAAO,MAAM;AACnD,UAAM,SAAS,IAAI,MAAM,GAAG,GAAG;AAE/B,WAAO,IAAI;AAAA,MACT,EAAE,GAAG,MAAM,OAAO;AAAA,MAClB,EAAE,OAAO,IAAI,QAAQ,QAAQ,IAAI,SAAS,KAAK,IAAI;AAAA,IACrD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAgC;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,eAAwB;AACtB,WAAO,CAAC,EAAE,KAAK,QAAQ,MAAM,YAAY,KAAK,QAAQ,MAAM;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,UAAkB,UAA2B;AACxD,QAAI,CAAC,KAAK,aAAa,EAAG,QAAO;AACjC,WACE,aAAa,KAAK,QAAQ,MAAM,YAChC,aAAa,KAAK,QAAQ,MAAM;AAAA,EAEpC;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY;AACV,WAAO;AAAA,MACL,OAAO,KAAK,QAAQ;AAAA,MACpB,MAAM,KAAK,QAAQ;AAAA,MACnB,UAAU,KAAK,QAAQ;AAAA,MACvB,QAAQ,KAAK,aAAa,cAAc;AAAA,MACxC,MAAM,KAAK,aAAa,aAAa;AAAA,MACrC,WAAW,KAAK;AAAA,IAClB;AAAA,EACF;AACF;;;ACxFO,SAAS,mBACd,SACoB;AACpB,QAAM,OAAO,IAAI,cAAc,OAAO;AACtC,QAAM,MAAM,kBAAkB,IAAI;AAClC,QAAM,WAAW,kBAAkB,KAAK,QAAQ,QAAQ;AAExD,QAAM,eAAe,OAAO,QAAoC;AAC9D,QAAI,UAAU;AACZ,YAAM,MAAM,IAAI,IAAI,IAAI,GAAG;AAC3B,UACE,IAAI,aAAa,YACjB,IAAI,SAAS,WAAW,GAAG,QAAQ,GAAG,GACtC;AACA,cAAM,YAAY,IAAI,SAAS,MAAM,SAAS,MAAM,KAAK;AACzD,YAAI,WAAW;AACf,cAAM,OAAoB;AAAA,UACxB,QAAQ,IAAI;AAAA,UACZ,SAAS,IAAI;AAAA,UACb,MACE,IAAI,WAAW,SAAS,IAAI,WAAW,SACnC,SACA,IAAI;AAAA;AAAA,UAEV,QAAQ;AAAA,UACR,UAAU,IAAI;AAAA,QAChB;AACA,eAAO,IAAI,MAAM,IAAI,QAAQ,IAAI,SAAS,GAAG,IAAI,CAAC;AAAA,MACpD;AAAA,IACF;AACA,WAAO,IAAI,MAAM,GAAG;AAAA,EACtB;AAEA,SAAO;AAAA,IACL,OAAO;AAAA,IACP;AAAA,EACF;AACF;AAOA,SAAS,kBAAkB,OAA0C;AACnE,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,SAAS,GAAG,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAC3D,MAAI,YAAY,MAAM,YAAY,IAAK,QAAO;AAC9C,SAAO,QAAQ,WAAW,GAAG,IAAI,UAAU,IAAI,OAAO;AACxD;;;AC7EO,SAAS,eACd,YACA,UACA,UACS;AACT,MAAI,CAAC,WAAY,QAAO;AAExB,QAAM,CAAC,QAAQ,OAAO,IAAI,WAAW,MAAM,GAAG;AAC9C,MAAI,CAAC,UAAU,OAAO,YAAY,MAAM,WAAW,CAAC,QAAS,QAAO;AAEpE,MAAI;AACJ,MAAI;AACF,cAAU,OAAO,KAAK,SAAS,QAAQ,EAAE,SAAS,OAAO;AAAA,EAC3D,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,QAAQ,QAAQ,GAAG;AAC/B,MAAI,QAAQ,GAAI,QAAO;AACvB,QAAM,OAAO,QAAQ,MAAM,GAAG,GAAG;AACjC,QAAM,OAAO,QAAQ,MAAM,MAAM,CAAC;AAElC,SAAO,UAAU,MAAM,QAAQ,KAAK,UAAU,MAAM,QAAQ;AAC9D;AAOA,SAAS,UAAU,GAAW,GAAoB;AAChD,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,YAAQ,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC;AAAA,EAC1C;AACA,SAAO,SAAS;AAClB;AAMO,IAAM,uBAAuB;AAAA,EAClC,QAAQ;AAAA,EACR,SAAS,EAAE,oBAAoB,0BAA0B;AAAA,EACzD,MAAM;AACR;","names":["jobs"]}