@feiyangdefeng/sdk 1.0.0 → 1.2.0

package/dist/index.iife.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.iife.js","sources":["../src/core/config.ts","../src/core/event-bus.ts","../src/core/utils.ts","../src/collector/view-tracker.ts","../src/collector/click-tracker.ts","../src/collector/exposure-tracker.ts","../src/collector/input-tracker.ts","../src/collector/auto-tracker.ts","../src/collector/error-tracker.ts","../src/collector/performance-tracker.ts","../src/collector/custom-tracker.ts","../src/processor/sampler.ts","../src/processor/deduplicator.ts","../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/processor/compressor.ts","../src/processor/data-processor.ts","../src/core/request.ts","../src/transport/retry-handler.ts","../src/transport/sender.ts","../src/core/storage.ts","../src/transport/offline-storage.ts","../src/transport/batch-sender.ts","../src/extension/plugin-manager.ts","../src/extension/behavior-analysis.ts","../src/extension/session-replay.ts","../src/extension/network-interceptor.ts","../src/tracker.ts"],"sourcesContent":["/**\r\n * 配置管理\r\n */\r\nimport type { TrackerConfig } from '@/types';\r\n\r\n/**\r\n * 默认配置\r\n */\r\nconst defaultConfig: Required<Omit<TrackerConfig, 'beforeSend' | 'afterSend' | 'onError' | 'customProperties' | 'serverUrl'>> & {\r\n  customProperties: Record<string, unknown>;\r\n  serverUrl?: string;\r\n} = {\r\n  appId: '',\r\n  serverUrl: undefined,\r\n  enableAutoTrack: true,\r\n  enableErrorTrack: true,\r\n  enablePerformanceTrack: false,\r\n  enableSessionReplay: false,\r\n  batchSize: 10,\r\n  batchWait: 5000,\r\n  sampleRate: 1.0,\r\n  enableOfflineStorage: true,\r\n  maxOfflineStorageSize: 1000,\r\n  maxRetries: 3,\r\n  userId: '',\r\n  deviceId: '',\r\n  customProperties: {}\r\n};\r\n\r\n/**\r\n * 配置管理器\r\n */\r\nclass ConfigManager {\r\n  private config: TrackerConfig;\r\n\r\n  constructor(config: TrackerConfig) {\r\n    this.config = {\r\n      ...defaultConfig,\r\n      ...config,\r\n      customProperties: {\r\n        ...defaultConfig.customProperties,\r\n        ...config.customProperties\r\n      }\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 获取配置\r\n   */\r\n  get<K extends keyof TrackerConfig>(key: K): TrackerConfig[K] {\r\n    return this.config[key];\r\n  }\r\n\r\n  /**\r\n   * 获取所有配置\r\n   */\r\n  getAll(): TrackerConfig {\r\n    return { ...this.config };\r\n  }\r\n\r\n  /**\r\n   * 更新配置\r\n   */\r\n  set<K extends keyof TrackerConfig>(key: K, value: TrackerConfig[K]): void {\r\n    this.config[key] = value;\r\n  }\r\n\r\n  /**\r\n   * 批量更新配置\r\n   */\r\n  update(updates: Partial<TrackerConfig>): void {\r\n    this.config = {\r\n      ...this.config,\r\n      ...updates,\r\n      customProperties: {\r\n        ...this.config.customProperties,\r\n        ...(updates.customProperties || {})\r\n      }\r\n    };\r\n  }\r\n}\r\n\r\nexport default ConfigManager;\r\n\r\n","/**\r\n * 事件总线\r\n */\r\n\r\ntype EventCallback = (...args: unknown[]) => void;\r\n\r\nclass EventBus {\r\n  private events: Map<string, EventCallback[]> = new Map();\r\n\r\n  /**\r\n   * 订阅事件\r\n   */\r\n  on(event: string, callback: EventCallback): void {\r\n    if (!this.events.has(event)) {\r\n      this.events.set(event, []);\r\n    }\r\n    this.events.get(event)!.push(callback);\r\n  }\r\n\r\n  /**\r\n   * 取消订阅\r\n   */\r\n  off(event: string, callback?: EventCallback): void {\r\n    if (!this.events.has(event)) {\r\n      return;\r\n    }\r\n\r\n    if (!callback) {\r\n      this.events.delete(event);\r\n      return;\r\n    }\r\n\r\n    const callbacks = this.events.get(event)!;\r\n    const index = callbacks.indexOf(callback);\r\n    if (index > -1) {\r\n      callbacks.splice(index, 1);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 触发事件\r\n   */\r\n  emit(event: string, ...args: unknown[]): void {\r\n    if (!this.events.has(event)) {\r\n      return;\r\n    }\r\n\r\n    const callbacks = this.events.get(event)!;\r\n    callbacks.forEach(callback => {\r\n      try {\r\n        callback(...args);\r\n      } catch (error) {\r\n        console.error(`EventBus: Error in callback for event \"${event}\":`, error);\r\n      }\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 一次性订阅\r\n   */\r\n  once(event: string, callback: EventCallback): void {\r\n    const wrapper = (...args: unknown[]) => {\r\n      callback(...args);\r\n      this.off(event, wrapper);\r\n    };\r\n    this.on(event, wrapper);\r\n  }\r\n\r\n  /**\r\n   * 清除所有事件\r\n   */\r\n  clear(): void {\r\n    this.events.clear();\r\n  }\r\n}\r\n\r\nexport const eventBus = new EventBus();\r\n\r\n","/**\r\n * 工具函数\r\n */\r\n\r\n/**\r\n * 生成唯一ID\r\n */\r\nexport function generateId(): string {\r\n  return `${Date.now()}-${Math.random().toString(36).substring(2, 9)}`;\r\n}\r\n\r\n/**\r\n * 获取设备指纹\r\n */\r\nexport function getDeviceId(): string {\r\n  if (typeof window === 'undefined') {\r\n    return generateId();\r\n  }\r\n\r\n  const key = '__tracker_device_id__';\r\n  let deviceId = localStorage.getItem(key);\r\n\r\n  if (!deviceId) {\r\n    deviceId = generateId();\r\n    try {\r\n      localStorage.setItem(key, deviceId);\r\n    } catch (e) {\r\n      // localStorage可能被禁用\r\n    }\r\n  }\r\n\r\n  return deviceId;\r\n}\r\n\r\n/**\r\n * 获取会话ID\r\n */\r\nexport function getSessionId(): string {\r\n  if (typeof window === 'undefined') {\r\n    return generateId();\r\n  }\r\n\r\n  const key = '__tracker_session_id__';\r\n  let sessionId = sessionStorage.getItem(key);\r\n\r\n  if (!sessionId) {\r\n    sessionId = generateId();\r\n    try {\r\n      sessionStorage.setItem(key, sessionId);\r\n    } catch (e) {\r\n      // sessionStorage可能被禁用\r\n    }\r\n  }\r\n\r\n  return sessionId;\r\n}\r\n\r\n/**\r\n * 获取当前URL\r\n */\r\nexport function getCurrentUrl(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return window.location.href;\r\n}\r\n\r\n/**\r\n * 获取页面标题\r\n */\r\nexport function getPageTitle(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return document.title || '';\r\n}\r\n\r\n/**\r\n * 获取Referrer\r\n */\r\nexport function getReferrer(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return document.referrer || '';\r\n}\r\n\r\n/**\r\n * 防抖函数\r\n */\r\nexport function debounce<T extends (...args: unknown[]) => void>(\r\n  func: T,\r\n  wait: number\r\n): (...args: Parameters<T>) => void {\r\n  let timeout: ReturnType<typeof setTimeout> | null = null;\r\n\r\n  return function executedFunction(...args: Parameters<T>) {\r\n    const later = () => {\r\n      timeout = null;\r\n      func(...args);\r\n    };\r\n\r\n    if (timeout) {\r\n      clearTimeout(timeout);\r\n    }\r\n    timeout = setTimeout(later, wait);\r\n  };\r\n}\r\n\r\n/**\r\n * 节流函数\r\n */\r\nexport function throttle<T extends (...args: unknown[]) => void>(\r\n  func: T,\r\n  wait: number\r\n): (...args: Parameters<T>) => void {\r\n  let timeout: ReturnType<typeof setTimeout> | null = null;\r\n  let previous = 0;\r\n\r\n  return function executedFunction(...args: Parameters<T>) {\r\n    const now = Date.now();\r\n    const remaining = wait - (now - previous);\r\n\r\n    if (remaining <= 0 || remaining > wait) {\r\n      if (timeout) {\r\n        clearTimeout(timeout);\r\n        timeout = null;\r\n      }\r\n      previous = now;\r\n      func(...args);\r\n    } else if (!timeout) {\r\n      timeout = setTimeout(() => {\r\n        previous = Date.now();\r\n        timeout = null;\r\n        func(...args);\r\n      }, remaining);\r\n    }\r\n  };\r\n}\r\n\r\n/**\r\n * 深拷贝\r\n */\r\nexport function deepClone<T>(obj: T): T {\r\n  if (obj === null || typeof obj !== 'object') {\r\n    return obj;\r\n  }\r\n\r\n  if (obj instanceof Date) {\r\n    return new Date(obj.getTime()) as unknown as T;\r\n  }\r\n\r\n  if (obj instanceof Array) {\r\n    return obj.map(item => deepClone(item)) as unknown as T;\r\n  }\r\n\r\n  if (typeof obj === 'object') {\r\n    const clonedObj = {} as Record<string, unknown>;\r\n    for (const key in obj) {\r\n      if (Object.prototype.hasOwnProperty.call(obj, key)) {\r\n        clonedObj[key] = deepClone((obj as Record<string, unknown>)[key]);\r\n      }\r\n    }\r\n    return clonedObj as T;\r\n  }\r\n\r\n  return obj;\r\n}\r\n\r\n/**\r\n * 判断是否为浏览器环境\r\n */\r\nexport function isBrowser(): boolean {\r\n  return typeof window !== 'undefined' && typeof document !== 'undefined';\r\n}\r\n\r\n/**\r\n * 判断是否为Node环境\r\n */\r\nexport function isNode(): boolean {\r\n  return typeof process !== 'undefined' && process.versions != null && process.versions.node != null;\r\n}\r\n\r\n/**\r\n * 获取元素路径\r\n */\r\nexport function getElementPath(element: Element | null): string {\r\n  if (!element) {\r\n    return '';\r\n  }\r\n\r\n  const path: string[] = [];\r\n\r\n  while (element && element.nodeType === Node.ELEMENT_NODE) {\r\n    let selector = element.nodeName.toLowerCase();\r\n\r\n    if (element.id) {\r\n      selector += `#${element.id}`;\r\n      path.unshift(selector);\r\n      break;\r\n    }\r\n\r\n    if (element.className) {\r\n      const classes = element.className\r\n        .trim()\r\n        .split(/\\s+/)\r\n        .filter(cls => cls.length > 0)\r\n        .join('.');\r\n      if (classes) {\r\n        selector += `.${classes}`;\r\n      }\r\n    }\r\n\r\n    let sibling = element;\r\n    let nth = 1;\r\n    while ((sibling = sibling.previousElementSibling as Element)) {\r\n      if (sibling.nodeName === element.nodeName) {\r\n        nth++;\r\n      }\r\n    }\r\n\r\n    if (nth > 1) {\r\n      selector += `:nth-of-type(${nth})`;\r\n    }\r\n\r\n    path.unshift(selector);\r\n    element = element.parentElement;\r\n  }\r\n\r\n  return path.join(' > ');\r\n}\r\n\r\n/**\r\n * 获取元素信息\r\n */\r\nexport function getElementInfo(element: Element | null): {\r\n  tagName?: string;\r\n  id?: string;\r\n  className?: string;\r\n  text?: string;\r\n} {\r\n  if (!element) {\r\n    return {};\r\n  }\r\n\r\n  return {\r\n    tagName: element.tagName.toLowerCase(),\r\n    id: element.id || undefined,\r\n    className: element.className && typeof element.className === 'string' ? element.className : undefined,\r\n    text: element.textContent?.trim().substring(0, 100) || undefined\r\n  };\r\n}\r\n\r\n","/**\n * 页面浏览采集器\n */\nimport type { PageViewEvent } from '@/types';\nimport { getCurrentUrl, getPageTitle, getReferrer } from '@/core/utils';\n\nclass ViewTracker {\n  private startTime: number = Date.now();\n  private currentUrl: string = '';\n  private popstateHandler: (() => void) | null = null;\n  private visibilityChangeHandler: (() => void) | null = null;\n  private beforeUnloadHandler: (() => void) | null = null;\n  private isTracking: boolean = false; // 防止递归调用\n  private pendingUrlCheck: ReturnType<typeof setTimeout> | null = null; // 延迟URL检查的定时器\n  private lastPageViewTime: number = 0; // 上次页面浏览时间\n  private minPageViewInterval: number = 1000; // 最小页面浏览间隔（1秒）\n  private hiddenStartTime: number | null = null; // 页面隐藏开始时间\n  private totalHiddenTime: number = 0; // 累计隐藏时长\n  private isVisible: boolean = true; // 页面是否可见\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    this.trackPageView();\n    this.setupSPARouter();\n    this.setupPageLifecycle();\n  }\n\n  /**\n   * 追踪页面浏览\n   */\n  trackPageView(): PageViewEvent {\n    // 防止递归调用\n    if (this.isTracking) {\n      return {\n        type: 'pageview',\n        name: 'pageview',\n        timestamp: Date.now(),\n        url: this.currentUrl || getCurrentUrl(),\n        title: getPageTitle()\n      };\n    }\n\n    this.isTracking = true;\n\n    try {\n      const now = Date.now();\n      const url = getCurrentUrl();\n      const title = getPageTitle();\n      const referrer = getReferrer();\n\n      // 如果 URL 没有变化，仍然计算 duration，但不更新 currentUrl\n      // 这样可以记录用户在同一页面的停留时间\n      const shouldUpdateUrl = url !== this.currentUrl || this.currentUrl === '';\n\n      // 增强URL变化检测：如果URL没有变化且时间间隔很短，不触发事件\n      if (!shouldUpdateUrl && this.lastPageViewTime > 0) {\n        const timeSinceLastPageView = now - this.lastPageViewTime;\n        if (timeSinceLastPageView < this.minPageViewInterval) {\n          // URL未变化且时间间隔太短，不触发新事件\n          return {\n            type: 'pageview',\n            name: 'pageview',\n            timestamp: now,\n            url: this.currentUrl,\n            title\n          };\n        }\n      }\n\n      // 计算停留时长（排除隐藏时间）\n      const visibleDuration = this.currentUrl ? now - this.startTime - this.totalHiddenTime : 0;\n      const duration = visibleDuration > 0 ? visibleDuration : 0;\n\n      const event: PageViewEvent = {\n        type: 'pageview',\n        name: 'pageview',\n        timestamp: now,\n        url,\n        title,\n        referrer: this.currentUrl ? referrer : undefined,\n        duration: duration > 0 ? duration : undefined\n      };\n\n      // 只有在 URL 真正改变时才更新 startTime 和 currentUrl\n      if (shouldUpdateUrl) {\n        this.startTime = now;\n        this.currentUrl = url;\n        this.totalHiddenTime = 0; // 重置隐藏时长\n      }\n\n      // 更新上次页面浏览时间\n      this.lastPageViewTime = now;\n\n      // 触发事件总线\n      if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n        (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('pageview', event);\n      }\n\n      return event;\n    } finally {\n      // 使用 setTimeout 确保在下一个事件循环中重置标志，避免同步递归\n      setTimeout(() => {\n        this.isTracking = false;\n      }, 0);\n    }\n  }\n\n  /**\n   * 设置SPA路由监听\n   */\n  private setupSPARouter(): void {\n    if (typeof window === 'undefined') {\n      return;\n    }\n\n    // 监听popstate事件（浏览器前进后退）\n    this.popstateHandler = () => {\n      this.trackPageView();\n    };\n    window.addEventListener('popstate', this.popstateHandler);\n\n    // 拦截pushState和replaceState（使用链式调用避免冲突）\n    const historyProto = history as unknown as {\n      _originalPushState?: typeof history.pushState;\n      _originalReplaceState?: typeof history.replaceState;\n      _trackerPushStateWrapped?: boolean;\n      _trackerReplaceStateWrapped?: boolean;\n    };\n\n    // 检查是否已经被包装过\n    if (!historyProto._trackerPushStateWrapped) {\n      const originalPushState = history.pushState.bind(history);\n      historyProto._originalPushState = originalPushState;\n      historyProto._trackerPushStateWrapped = true;\n\n      const self = this; // 保存 this 引用\n      history.pushState = function (...args) {\n        const result = originalPushState.apply(history, args);\n        // 不触发 popstate 事件，避免与路由框架冲突\n        // 改为延迟检查 URL 变化并直接追踪\n        // 使用 requestAnimationFrame 确保在路由框架处理完成后执行\n        if (self.pendingUrlCheck) {\n          clearTimeout(self.pendingUrlCheck);\n        }\n        self.pendingUrlCheck = setTimeout(() => {\n          const newUrl = getCurrentUrl();\n          // 只在 URL 真正改变时追踪\n          if (newUrl !== self.currentUrl) {\n            self.trackPageView();\n          }\n          self.pendingUrlCheck = null;\n        }, 100); // 延迟 100ms，确保路由框架完成处理\n        return result;\n      };\n    }\n\n    if (!historyProto._trackerReplaceStateWrapped) {\n      const originalReplaceState = history.replaceState.bind(history);\n      historyProto._originalReplaceState = originalReplaceState;\n      historyProto._trackerReplaceStateWrapped = true;\n\n      const self = this; // 保存 this 引用\n      history.replaceState = function (...args) {\n        const result = originalReplaceState.apply(history, args);\n        // 不触发 popstate 事件，避免与路由框架冲突\n        // replaceState 通常用于更新状态而不改变 URL，所以不追踪\n        // 但如果 URL 改变了，也应该追踪\n        if (self.pendingUrlCheck) {\n          clearTimeout(self.pendingUrlCheck);\n        }\n        self.pendingUrlCheck = setTimeout(() => {\n          const newUrl = getCurrentUrl();\n          // 只在 URL 真正改变时追踪\n          if (newUrl !== self.currentUrl) {\n            self.trackPageView();\n          }\n          self.pendingUrlCheck = null;\n        }, 100); // 延迟 100ms，确保路由框架完成处理\n        return result;\n      };\n    }\n  }\n\n  /**\n   * 设置页面生命周期事件监听\n   */\n  private setupPageLifecycle(): void {\n    if (typeof document === 'undefined') {\n      return;\n    }\n\n    // 监听页面可见性变化\n    this.visibilityChangeHandler = () => {\n      const isHidden = document.hidden;\n      const now = Date.now();\n\n      if (isHidden && this.isVisible) {\n        // 页面从可见变为隐藏\n        this.hiddenStartTime = now;\n        this.isVisible = false;\n      } else if (!isHidden && !this.isVisible) {\n        // 页面从隐藏变为可见\n        if (this.hiddenStartTime) {\n          this.totalHiddenTime += now - this.hiddenStartTime;\n          this.hiddenStartTime = null;\n        }\n        this.isVisible = true;\n      }\n    };\n\n    document.addEventListener('visibilitychange', this.visibilityChangeHandler);\n\n    // 监听页面卸载前事件\n    this.beforeUnloadHandler = () => {\n      const now = Date.now();\n      \n      // 如果页面正在隐藏，累计隐藏时长\n      if (this.hiddenStartTime) {\n        this.totalHiddenTime += now - this.hiddenStartTime;\n        this.hiddenStartTime = null;\n      }\n\n      // 计算最终停留时长\n      const finalDuration = this.currentUrl ? now - this.startTime - this.totalHiddenTime : 0;\n      \n      // 发送最终页面浏览事件（如果停留时长大于0）\n      if (finalDuration > 0 && this.currentUrl) {\n        try {\n          const finalEvent: PageViewEvent = {\n            type: 'pageview',\n            name: 'page-before-unload',\n            timestamp: now,\n            url: this.currentUrl,\n            title: getPageTitle(),\n            duration: finalDuration\n          };\n\n          // 触发事件总线\n          if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n            (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('pageview', finalEvent);\n          }\n        } catch (error) {\n          console.error('ViewTracker: Error sending final pageview event:', error);\n        }\n      }\n    };\n\n    window.addEventListener('beforeunload', this.beforeUnloadHandler);\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    // 清除待处理的 URL 检查\n    if (this.pendingUrlCheck) {\n      clearTimeout(this.pendingUrlCheck);\n      this.pendingUrlCheck = null;\n    }\n\n    // 移除popstate监听器\n    if (this.popstateHandler && typeof window !== 'undefined') {\n      window.removeEventListener('popstate', this.popstateHandler);\n      this.popstateHandler = null;\n    }\n\n    // 移除页面生命周期事件监听器\n    if (this.visibilityChangeHandler && typeof document !== 'undefined') {\n      document.removeEventListener('visibilitychange', this.visibilityChangeHandler);\n      this.visibilityChangeHandler = null;\n    }\n\n    if (this.beforeUnloadHandler && typeof window !== 'undefined') {\n      window.removeEventListener('beforeunload', this.beforeUnloadHandler);\n      this.beforeUnloadHandler = null;\n    }\n\n    // 恢复原始方法（仅当是我们包装的时才恢复）\n    if (typeof window !== 'undefined') {\n      const historyProto = history as unknown as {\n        _originalPushState?: typeof history.pushState;\n        _originalReplaceState?: typeof history.replaceState;\n        _trackerPushStateWrapped?: boolean;\n        _trackerReplaceStateWrapped?: boolean;\n      };\n\n      if (historyProto._trackerPushStateWrapped && historyProto._originalPushState) {\n        history.pushState = historyProto._originalPushState;\n        historyProto._trackerPushStateWrapped = false;\n        delete historyProto._originalPushState;\n      }\n\n      if (historyProto._trackerReplaceStateWrapped && historyProto._originalReplaceState) {\n        history.replaceState = historyProto._originalReplaceState;\n        historyProto._trackerReplaceStateWrapped = false;\n        delete historyProto._originalReplaceState;\n      }\n    }\n  }\n}\n\nexport default ViewTracker;\n\n","/**\r\n * 点击事件采集器\r\n */\r\nimport type { ClickEvent } from '@/types';\r\nimport { getElementPath, getElementInfo, debounce } from '@/core/utils';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\nclass ClickTracker {\r\n  private clickHandler: ((event: MouseEvent) => void) | null = null;\r\n  private touchStartHandler: ((event: TouchEvent) => void) | null = null;\r\n  private touchEndHandler: ((event: TouchEvent) => void) | null = null;\r\n  private debounceTime: number = 300;\r\n  private touchTimeout: number | null = null;\r\n  private lastTouch: { x: number; y: number; time: number } | null = null;\r\n  private readonly TOUCH_CLICK_THRESHOLD = 300; // ms\r\n  private readonly TOUCH_DISTANCE_THRESHOLD = 10; // px\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  init(debounceTime?: number): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    if (debounceTime !== undefined) {\r\n      this.debounceTime = debounceTime;\r\n    }\r\n\r\n    // 初始化鼠标点击处理器\r\n    this.clickHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as MouseEvent;\r\n      this.handleClick(event);\r\n    }, this.debounceTime);\r\n\r\n    // 初始化触摸事件处理器\r\n    // touchstart需要立即处理，不使用debounce\r\n    this.touchStartHandler = ((event: TouchEvent) => {\r\n      this.handleTouch(event);\r\n    }) as EventListener;\r\n    \r\n    // touchend使用debounce防止重复点击\r\n    this.touchEndHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as TouchEvent;\r\n      this.handleTouch(event);\r\n    }, this.debounceTime);\r\n\r\n    // 监听鼠标点击事件\r\n    document.addEventListener('click', this.clickHandler as EventListener, false);\r\n    \r\n    // 监听触摸事件，用于移动端兼容性\r\n    // touchstart立即处理，touchend使用debounce\r\n    document.addEventListener('touchstart', this.touchStartHandler, { passive: true, capture: false });\r\n    document.addEventListener('touchend', this.touchEndHandler as EventListener, { passive: true, capture: false });\r\n  }\r\n\r\n  /**\r\n   * 处理触摸事件\r\n   */\r\n  private handleTouch(event: TouchEvent): void {\r\n    try {\r\n      const now = Date.now();\r\n      \r\n      switch (event.type) {\r\n        case 'touchstart':\r\n          // 记录触摸开始的位置和时间\r\n          if (event.touches.length > 0) {\r\n            const touch = event.touches[0];\r\n            this.lastTouch = {\r\n              x: touch.clientX,\r\n              y: touch.clientY,\r\n              time: now\r\n            };\r\n          }\r\n          break;\r\n          \r\n        case 'touchend':\r\n          // 处理触摸结束，模拟点击行为\r\n          if (this.lastTouch && event.changedTouches.length > 0) {\r\n            const endTouch = event.changedTouches[0];\r\n            const deltaX = Math.abs(endTouch.clientX - this.lastTouch.x);\r\n            const deltaY = Math.abs(endTouch.clientY - this.lastTouch.y);\r\n            const deltaTime = now - this.lastTouch.time;\r\n            \r\n            // 判断是否为有效点击（轻触而非滑动）\r\n            if (deltaTime < this.TOUCH_CLICK_THRESHOLD && \r\n                deltaX < this.TOUCH_DISTANCE_THRESHOLD && \r\n                deltaY < this.TOUCH_DISTANCE_THRESHOLD) {\r\n              \r\n              // 防止重复处理\r\n              if (this.touchTimeout) {\r\n                clearTimeout(this.touchTimeout);\r\n              }\r\n              \r\n              // 创建标准化的交互事件\r\n              this.touchTimeout = window.setTimeout(() => {\r\n                try {\r\n                  this.processTouchInteraction(endTouch, event.target as Element);\r\n                } catch (error) {\r\n                  console.error('ClickTracker: Error processing touch interaction:', error);\r\n                }\r\n                this.touchTimeout = null;\r\n              }, 100); // 小延迟防止点击重复\r\n            }\r\n            \r\n            this.lastTouch = null;\r\n          }\r\n          break;\r\n      }\r\n    } catch (error) {\r\n      console.error('ClickTracker: Error handling touch event:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理触摸交互（模拟点击行为）\r\n   */\r\n  private processTouchInteraction(touch: Touch, element: Element): void {\r\n    if (!element) {\r\n      return;\r\n    }\r\n\r\n    // 创建标准化的点击事件数据\r\n    const url = getCurrentUrl();\r\n    const title = getPageTitle();\r\n    const timestamp = Date.now();\r\n    const position = {\r\n      x: touch.clientX,\r\n      y: touch.clientY\r\n    };\r\n\r\n    // 异步处理，不阻塞主线程\r\n    const processTouch = () => {\r\n      try {\r\n        const elementPath = getElementPath(element);\r\n        const elementInfo = getElementInfo(element);\r\n\r\n        // 创建与点击事件兼容的触摸事件\r\n        const touchEvent: ClickEvent = {\r\n          type: 'click',\r\n          name: 'touch-click',  // 区分触摸点击和鼠标点击\r\n          timestamp,\r\n          url,\r\n          title,\r\n          elementPath,\r\n          elementInfo,\r\n          position,\r\n          interactionType: 'touch' // 标记为触摸交互\r\n        };\r\n\r\n        // 触发事件 - 使用与点击事件相同的总线\r\n        if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n          (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('click', touchEvent);\r\n        }\r\n      } catch (error) {\r\n        console.error('ClickTracker: Error processing touch interaction:', error);\r\n      }\r\n    };\r\n\r\n    // 使用requestIdleCallback或setTimeout异步处理\r\n    if (typeof requestIdleCallback !== 'undefined') {\r\n      requestIdleCallback(processTouch, { timeout: 50 });\r\n    } else {\r\n      setTimeout(processTouch, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理点击事件\r\n   */\r\n  private handleClick(event: MouseEvent): void {\r\n    try {\r\n      const target = event.target as Element;\r\n      if (!target) {\r\n        return;\r\n      }\r\n\r\n      // 立即同步获取 URL 和页面信息，避免页面跳转后获取到错误的 URL\r\n      const url = getCurrentUrl();\r\n      const title = getPageTitle();\r\n      const timestamp = Date.now();\r\n      const position = {\r\n        x: event.clientX,\r\n        y: event.clientY\r\n      };\r\n\r\n      // 使用 requestIdleCallback 或 setTimeout 异步处理，不阻塞主线程\r\n      // 确保不影响页面正常功能\r\n      const processClick = () => {\r\n        try {\r\n          const elementPath = getElementPath(target);\r\n          const elementInfo = getElementInfo(target);\r\n\r\n          const clickEvent: ClickEvent = {\r\n            type: 'click',\r\n            name: 'click',\r\n            timestamp,\r\n            url,\r\n            title,\r\n            elementPath,\r\n            elementInfo,\r\n            position,\r\n            interactionType: 'mouse' // 显式标识为鼠标交互\r\n          };\r\n\r\n          // 触发事件\r\n          if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n            (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('click', clickEvent);\r\n          }\r\n        } catch (error) {\r\n          console.error('ClickTracker: Error processing click event:', error);\r\n        }\r\n      };\r\n\r\n      // 优先使用 requestIdleCallback，否则使用 setTimeout\r\n      if (typeof requestIdleCallback !== 'undefined') {\r\n        requestIdleCallback(processClick, { timeout: 100 });\r\n      } else {\r\n        setTimeout(processClick, 0);\r\n      }\r\n    } catch (error) {\r\n      console.error('ClickTracker: Error handling click event:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取点击事件\r\n   */\r\n  getClickEvent(event: MouseEvent): ClickEvent | null {\r\n    try {\r\n      const target = event.target as Element;\r\n      if (!target) {\r\n        return null;\r\n      }\r\n\r\n      return {\r\n        type: 'click',\r\n        name: 'click',\r\n        timestamp: Date.now(),\r\n        url: getCurrentUrl(),\r\n        title: getPageTitle(),\r\n        elementPath: getElementPath(target),\r\n        elementInfo: getElementInfo(target),\r\n        position: {\r\n          x: event.clientX,\r\n          y: event.clientY\r\n        },\r\n        interactionType: 'mouse' // 显式标识为鼠标交互\r\n      };\r\n    } catch (error) {\r\n      console.error('ClickTracker: Error creating click event:', error);\r\n      return null;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.clickHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('click', this.clickHandler as EventListener, false);\r\n      this.clickHandler = null;\r\n    }\r\n\r\n    if (this.touchStartHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('touchstart', this.touchStartHandler);\r\n      this.touchStartHandler = null;\r\n    }\r\n\r\n    if (this.touchEndHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('touchend', this.touchEndHandler as EventListener);\r\n      this.touchEndHandler = null;\r\n    }\r\n\r\n    if (this.touchTimeout) {\r\n      clearTimeout(this.touchTimeout);\r\n      this.touchTimeout = null;\r\n    }\r\n\r\n    this.lastTouch = null;\r\n  }\r\n}\r\n\r\nexport default ClickTracker;\r\n\r\n","/**\r\n * 曝光采集器\r\n */\r\nimport type { ExposureEvent } from '@/types';\r\nimport { getElementPath, throttle } from '@/core/utils';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\ninterface ExposureOptions {\r\n  /** 曝光阈值（0-1），元素可见比例达到此值才触发曝光 */\r\n  threshold?: number;\r\n  /** 根元素，默认为viewport */\r\n  root?: Element | null;\r\n  /** 根元素边距 */\r\n  rootMargin?: string;\r\n}\r\n\r\nclass ExposureTracker {\r\n  private observer: IntersectionObserver | null = null;\r\n  private exposedElements: Set<Element> = new Set();\r\n  private options: ExposureOptions;\r\n  private exposureMap: Map<Element, number> = new Map();\r\n  private scrollFallbackHandler: (() => void) | null = null;\r\n  private resizeFallbackHandler: (() => void) | null = null;\r\n  private cachedElements: Element[] = []; // 缓存的曝光元素列表\r\n  private lastCacheUpdate: number = 0; // 上次缓存更新时间\r\n  private readonly CACHE_UPDATE_INTERVAL = 2000; // 缓存更新间隔（2秒）\r\n\r\n  constructor(options: ExposureOptions = {}) {\r\n    this.options = {\r\n      threshold: 0.5,\r\n      root: null,\r\n      rootMargin: '0px',\r\n      ...options\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  init(): void {\r\n    if (typeof window === 'undefined' || !window.IntersectionObserver) {\r\n      // 降级方案：使用scroll事件\r\n      this.initScrollFallback();\r\n      return;\r\n    }\r\n\r\n    this.observer = new IntersectionObserver(\r\n      throttle((...args: unknown[]) => {\r\n        const entries = args[0] as IntersectionObserverEntry[];\r\n        entries.forEach(entry => {\r\n          this.handleIntersection(entry);\r\n        });\r\n      }, 100),\r\n      {\r\n        threshold: this.options.threshold || 0.5,\r\n        root: this.options.root,\r\n        rootMargin: this.options.rootMargin\r\n      }\r\n    );\r\n\r\n    // 观察所有带有data-track-exposure属性的元素\r\n    this.observeElements();\r\n  }\r\n\r\n  /**\r\n   * 观察元素\r\n   */\r\n  observeElements(): void {\r\n    if (!this.observer || typeof document === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    const elements = document.querySelectorAll('[data-track-exposure]');\r\n    elements.forEach(element => {\r\n      this.observer!.observe(element);\r\n    });\r\n    \r\n    // 更新缓存\r\n    this.cachedElements = Array.from(elements);\r\n    this.lastCacheUpdate = Date.now();\r\n  }\r\n\r\n  /**\r\n   * 手动添加观察元素\r\n   */\r\n  observe(element: Element): void {\r\n    if (!this.observer) {\r\n      return;\r\n    }\r\n    this.observer.observe(element);\r\n    \r\n    // 更新缓存\r\n    if (!this.cachedElements.includes(element)) {\r\n      this.cachedElements.push(element);\r\n      this.lastCacheUpdate = Date.now();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 取消观察元素\r\n   */\r\n  unobserve(element: Element): void {\r\n    if (!this.observer) {\r\n      return;\r\n    }\r\n    this.observer.unobserve(element);\r\n    this.exposedElements.delete(element);\r\n    this.exposureMap.delete(element);\r\n    \r\n    // 更新缓存\r\n    const index = this.cachedElements.indexOf(element);\r\n    if (index > -1) {\r\n      this.cachedElements.splice(index, 1);\r\n      this.lastCacheUpdate = Date.now();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理IntersectionObserver回调\r\n   */\r\n  private handleIntersection(entry: IntersectionObserverEntry): void {\r\n    const { target, intersectionRatio, isIntersecting } = entry;\r\n\r\n    if (isIntersecting && intersectionRatio >= (this.options.threshold || 0.5)) {\r\n      if (!this.exposedElements.has(target)) {\r\n        this.exposedElements.add(target);\r\n        this.triggerExposure(target);\r\n      }\r\n      this.exposureMap.set(target, Date.now());\r\n    } else if (!isIntersecting) {\r\n      // 元素离开视口，计算曝光时长并上报\r\n      const startTime = this.exposureMap.get(target);\r\n      if (startTime) {\r\n        const duration = Date.now() - startTime;\r\n        this.triggerExposure(target, duration);\r\n        this.exposureMap.delete(target);\r\n        this.exposedElements.delete(target); // 允许元素再次曝光\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 触发曝光事件\r\n   * @param element 曝光元素\r\n   * @param duration 曝光时长（毫秒），可选\r\n   */\r\n  private triggerExposure(element: Element, duration?: number): void {\r\n    try {\r\n      const exposureEvent: ExposureEvent = {\r\n        type: 'exposure',\r\n        name: 'exposure',\r\n        timestamp: Date.now(),\r\n        url: getCurrentUrl(),\r\n        title: getPageTitle(),\r\n        elementPath: getElementPath(element),\r\n        duration // 包含曝光时长\r\n      };\r\n\r\n      // 触发事件\r\n      if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n        (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('exposure', exposureEvent);\r\n      }\r\n    } catch (error) {\r\n      console.error('ExposureTracker: Error triggering exposure event:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取曝光元素列表（带缓存）\r\n   */\r\n  private getExposureElements(): Element[] {\r\n    const now = Date.now();\r\n    \r\n    // 如果缓存过期或为空，更新缓存\r\n    if (this.cachedElements.length === 0 || now - this.lastCacheUpdate > this.CACHE_UPDATE_INTERVAL) {\r\n      if (typeof document !== 'undefined') {\r\n        this.cachedElements = Array.from(document.querySelectorAll('[data-track-exposure]'));\r\n        this.lastCacheUpdate = now;\r\n      }\r\n    }\r\n    \r\n    return this.cachedElements;\r\n  }\r\n\r\n  /**\r\n   * 降级方案：使用scroll事件\r\n   */\r\n  private initScrollFallback(): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    // 初始缓存元素列表\r\n    this.cachedElements = Array.from(document.querySelectorAll('[data-track-exposure]'));\r\n    this.lastCacheUpdate = Date.now();\r\n\r\n    const checkExposure = throttle(() => {\r\n      const elements = this.getExposureElements(); // 使用缓存\r\n      const now = Date.now();\r\n      \r\n      elements.forEach(element => {\r\n        const rect = element.getBoundingClientRect();\r\n        const viewportHeight = window.innerHeight || document.documentElement.clientHeight;\r\n        const viewportWidth = window.innerWidth || document.documentElement.clientWidth;\r\n\r\n        const visibleHeight = Math.min(rect.bottom, viewportHeight) - Math.max(rect.top, 0);\r\n        const visibleWidth = Math.min(rect.right, viewportWidth) - Math.max(rect.left, 0);\r\n        const visibleArea = visibleHeight * visibleWidth;\r\n        const totalArea = rect.height * rect.width;\r\n        const visibleRatio = totalArea > 0 ? visibleArea / totalArea : 0;\r\n\r\n        if (visibleRatio >= (this.options.threshold || 0.5)) {\r\n          // 元素可见\r\n          if (!this.exposedElements.has(element)) {\r\n            // 首次曝光，记录开始时间\r\n            this.exposedElements.add(element);\r\n            this.exposureMap.set(element, now);\r\n            this.triggerExposure(element); // 曝光开始事件\r\n          }\r\n          // 注意：不更新曝光时间，保持首次曝光的时间戳，以便准确计算duration\r\n        } else {\r\n          // 元素不可见\r\n          if (this.exposedElements.has(element)) {\r\n            // 元素离开视口，计算曝光时长\r\n            const startTime = this.exposureMap.get(element);\r\n            if (startTime) {\r\n              const duration = now - startTime;\r\n              this.triggerExposure(element, duration); // 曝光结束事件，包含时长\r\n              this.exposureMap.delete(element);\r\n              this.exposedElements.delete(element); // 允许元素再次曝光\r\n            }\r\n          }\r\n        }\r\n      });\r\n    }, 100);\r\n\r\n    // 保存处理器引用以便清理\r\n    this.scrollFallbackHandler = checkExposure;\r\n    this.resizeFallbackHandler = checkExposure;\r\n\r\n    window.addEventListener('scroll', this.scrollFallbackHandler, { passive: true });\r\n    window.addEventListener('resize', this.resizeFallbackHandler, { passive: true });\r\n    // 初始检查\r\n    setTimeout(checkExposure, 0);\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.observer) {\r\n      this.observer.disconnect();\r\n      this.observer = null;\r\n    }\r\n\r\n    // 清理scroll降级方案的事件监听器\r\n    if (this.scrollFallbackHandler && typeof window !== 'undefined') {\r\n      window.removeEventListener('scroll', this.scrollFallbackHandler);\r\n      this.scrollFallbackHandler = null;\r\n    }\r\n\r\n    if (this.resizeFallbackHandler && typeof window !== 'undefined') {\r\n      window.removeEventListener('resize', this.resizeFallbackHandler);\r\n      this.resizeFallbackHandler = null;\r\n    }\r\n\r\n    this.exposedElements.clear();\r\n    this.exposureMap.clear();\r\n    this.cachedElements = [];\r\n    this.lastCacheUpdate = 0;\r\n  }\r\n}\r\n\r\nexport default ExposureTracker;\r\n\r\n","/**\r\n * 输入事件采集器\r\n */\r\nimport type { InputEvent } from '@/types';\r\nimport { getElementPath, getElementInfo, debounce } from '@/core/utils';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\nclass InputTracker {\r\n  private inputHandler: ((event: Event) => void) | null = null;\r\n  private changeHandler: ((event: Event) => void) | null = null;\r\n  private inputDebounceTime: number = 500; // text/textarea 防抖时间\r\n  private selectDebounceTime: number = 300; // select 防抖时间\r\n  private skipEmptyInput: boolean = true; // 默认跳过空输入\r\n  // 敏感字段关键词列表\r\n  private sensitiveKeywords: string[] = ['password', 'pwd', 'secret', 'token', 'key', 'auth', 'credential'];\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  init(debounceTime?: number, skipEmptyInput?: boolean): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    // 如果提供了统一的防抖时间，则同时设置input和select的防抖时间\r\n    if (debounceTime !== undefined) {\r\n      this.inputDebounceTime = debounceTime;\r\n      this.selectDebounceTime = Math.min(debounceTime, 300); // select使用更短的防抖时间，但不超过提供的值\r\n    }\r\n\r\n    if (skipEmptyInput !== undefined) {\r\n      this.skipEmptyInput = skipEmptyInput;\r\n    }\r\n\r\n    // 监听 input 事件（实时输入，使用较长的防抖时间）\r\n    this.inputHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as Event;\r\n      this.handleInput(event);\r\n    }, this.inputDebounceTime);\r\n\r\n    // 监听 change 事件（值改变，适用于 select 等，使用较短的防抖时间）\r\n    this.changeHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as Event;\r\n      this.handleChange(event);\r\n    }, this.selectDebounceTime);\r\n\r\n    // 使用事件委托，在冒泡阶段监听\r\n    document.addEventListener('input', this.inputHandler as EventListener, false);\r\n    document.addEventListener('change', this.changeHandler as EventListener, false);\r\n  }\r\n\r\n  /**\r\n   * 处理 input 事件\r\n   */\r\n  private handleInput(event: Event): void {\r\n    const target = event.target as HTMLInputElement | HTMLTextAreaElement;\r\n    if (!target) {\r\n      return;\r\n    }\r\n\r\n    // 只处理 input、textarea 元素\r\n    const tagName = target.tagName?.toLowerCase();\r\n    if (tagName !== 'input' && tagName !== 'textarea') {\r\n      return;\r\n    }\r\n\r\n    // 立即同步获取 URL 和页面信息\r\n    const url = getCurrentUrl();\r\n    const title = getPageTitle();\r\n    const timestamp = Date.now();\r\n\r\n    // 使用异步处理，不阻塞主线程\r\n    const processInput = () => {\r\n      try {\r\n        const elementPath = getElementPath(target);\r\n        const baseElementInfo = getElementInfo(target);\r\n        \r\n        // 扩展元素信息，包含 input 特有属性\r\n        const elementInfo = {\r\n          ...baseElementInfo,\r\n          name: (target as HTMLInputElement).name || undefined,\r\n          type: (target as HTMLInputElement).type || undefined,\r\n          placeholder: (target as HTMLInputElement).placeholder || undefined\r\n        };\r\n\r\n        // 判断是否为敏感字段\r\n        const isSensitive = this.isSensitiveField(target);\r\n        \r\n        // 获取输入类型\r\n        let inputType: 'text' | 'textarea' | 'select' | 'checkbox' | 'radio' = 'text';\r\n        if (tagName === 'textarea') {\r\n          inputType = 'textarea';\r\n        } else if (tagName === 'input') {\r\n          const type = (target as HTMLInputElement).type?.toLowerCase() || 'text';\r\n          if (type === 'checkbox') {\r\n            inputType = 'checkbox';\r\n          } else if (type === 'radio') {\r\n            inputType = 'radio';\r\n          } else {\r\n            inputType = 'text';\r\n          }\r\n        }\r\n\r\n        // 获取输入值\r\n        let value: string | undefined;\r\n        let valueLength: number | undefined;\r\n        \r\n        if (isSensitive) {\r\n          // 敏感字段：不记录内容，只记录长度\r\n          valueLength = target.value.length;\r\n          value = undefined;\r\n        } else {\r\n          // 非敏感字段：记录内容和长度\r\n          value = target.value;\r\n          valueLength = target.value.length;\r\n        }\r\n\r\n        // 如果配置为跳过空输入，且输入值为空，则不记录\r\n        if (this.skipEmptyInput && valueLength === 0) {\r\n          return;\r\n        }\r\n\r\n        const inputEvent: InputEvent = {\r\n          type: 'input',\r\n          name: 'input',\r\n          timestamp,\r\n          url,\r\n          title,\r\n          elementPath,\r\n          elementInfo,\r\n          inputType,\r\n          value,\r\n          valueLength,\r\n          isSensitive\r\n        };\r\n\r\n        // 触发事件\r\n        if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n          (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('input', inputEvent);\r\n        }\r\n      } catch (error) {\r\n        console.error('InputTracker: Error processing input event:', error);\r\n      }\r\n    };\r\n\r\n    // 优先使用 requestIdleCallback，否则使用 setTimeout\r\n    if (typeof requestIdleCallback !== 'undefined') {\r\n      requestIdleCallback(processInput, { timeout: 100 });\r\n    } else {\r\n      setTimeout(processInput, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理 change 事件\r\n   */\r\n  private handleChange(event: Event): void {\r\n    const target = event.target as HTMLInputElement | HTMLSelectElement | HTMLTextAreaElement;\r\n    if (!target) {\r\n      return;\r\n    }\r\n\r\n    // 只处理 select 元素（input 和 textarea 使用 input 事件）\r\n    const tagName = target.tagName?.toLowerCase();\r\n    if (tagName !== 'select') {\r\n      return;\r\n    }\r\n\r\n    // 立即同步获取 URL 和页面信息\r\n    const url = getCurrentUrl();\r\n    const title = getPageTitle();\r\n    const timestamp = Date.now();\r\n\r\n    // 使用异步处理\r\n    const processChange = () => {\r\n      try {\r\n        const elementPath = getElementPath(target);\r\n        const baseElementInfo = getElementInfo(target);\r\n        \r\n        // 扩展元素信息\r\n        const elementInfo = {\r\n          ...baseElementInfo,\r\n          name: (target as HTMLSelectElement).name || undefined\r\n        };\r\n\r\n        // 判断是否为敏感字段\r\n        const isSensitive = this.isSensitiveField(target);\r\n        \r\n        // 获取选中值\r\n        const selectElement = target as HTMLSelectElement;\r\n        let value: string | undefined;\r\n        let valueLength: number | undefined;\r\n        \r\n        if (isSensitive) {\r\n          // 敏感字段：不记录内容\r\n          valueLength = selectElement.value.length;\r\n          value = undefined;\r\n        } else {\r\n          // 非敏感字段：记录内容\r\n          value = selectElement.value;\r\n          valueLength = selectElement.value.length;\r\n        }\r\n\r\n        // select 元素通常都有值，但如果配置为跳过空输入且值为空，则不记录\r\n        if (this.skipEmptyInput && valueLength === 0) {\r\n          return;\r\n        }\r\n\r\n        const inputEvent: InputEvent = {\r\n          type: 'input',\r\n          name: 'input',\r\n          timestamp,\r\n          url,\r\n          title,\r\n          elementPath,\r\n          elementInfo,\r\n          inputType: 'select',\r\n          value,\r\n          valueLength,\r\n          isSensitive\r\n        };\r\n\r\n        // 触发事件\r\n        if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n          (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('input', inputEvent);\r\n        }\r\n      } catch (error) {\r\n        console.error('InputTracker: Error processing change event:', error);\r\n      }\r\n    };\r\n\r\n    // 优先使用 requestIdleCallback，否则使用 setTimeout\r\n    if (typeof requestIdleCallback !== 'undefined') {\r\n      requestIdleCallback(processChange, { timeout: 100 });\r\n    } else {\r\n      setTimeout(processChange, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 判断是否为敏感字段\r\n   */\r\n  private isSensitiveField(element: HTMLElement): boolean {\r\n    // 检查 type 属性\r\n    if (element instanceof HTMLInputElement) {\r\n      const type = element.type?.toLowerCase();\r\n      if (type === 'password') {\r\n        return true;\r\n      }\r\n    }\r\n\r\n    // 检查 name 属性\r\n    const name = (element as HTMLInputElement).name?.toLowerCase() || '';\r\n    if (name) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (name.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    // 检查 id 属性\r\n    const id = element.id?.toLowerCase() || '';\r\n    if (id) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (id.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    // 检查 className\r\n    const className = element.className?.toLowerCase() || '';\r\n    if (className) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (className.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.inputHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('input', this.inputHandler as EventListener, false);\r\n      this.inputHandler = null;\r\n    }\r\n\r\n    if (this.changeHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('change', this.changeHandler as EventListener, false);\r\n      this.changeHandler = null;\r\n    }\r\n  }\r\n}\r\n\r\nexport default InputTracker;\r\n\r\n","/**\r\n * 自动埋点管理器\r\n */\r\nimport ViewTracker from './view-tracker';\r\nimport ClickTracker from './click-tracker';\r\nimport ExposureTracker from './exposure-tracker';\r\nimport InputTracker from './input-tracker';\r\n\r\nclass AutoTracker {\r\n  private viewTracker: ViewTracker;\r\n  private clickTracker: ClickTracker;\r\n  private exposureTracker: ExposureTracker;\r\n  private inputTracker: InputTracker;\r\n  private enabled: boolean = false;\r\n\r\n  constructor() {\r\n    this.viewTracker = new ViewTracker();\r\n    this.clickTracker = new ClickTracker();\r\n    this.exposureTracker = new ExposureTracker();\r\n    this.inputTracker = new InputTracker();\r\n  }\r\n\r\n  /**\r\n   * 初始化自动埋点\r\n   */\r\n  init(options?: { enableClick?: boolean; enableExposure?: boolean; enableInput?: boolean; clickDebounceTime?: number; inputDebounceTime?: number }): void {\r\n    if (this.enabled) {\r\n      return;\r\n    }\r\n\r\n    const { enableClick = true, enableExposure = true, enableInput = true, clickDebounceTime, inputDebounceTime } = options || {};\r\n\r\n    // 页面浏览追踪\r\n    this.viewTracker.init();\r\n\r\n    // 点击追踪\r\n    if (enableClick) {\r\n      this.clickTracker.init(clickDebounceTime);\r\n    }\r\n\r\n    // 曝光追踪\r\n    if (enableExposure) {\r\n      this.exposureTracker.init();\r\n    }\r\n\r\n    // 输入追踪\r\n    if (enableInput) {\r\n      this.inputTracker.init(inputDebounceTime);\r\n    }\r\n\r\n    this.enabled = true;\r\n  }\r\n\r\n  /**\r\n   * 获取ViewTracker实例\r\n   */\r\n  getViewTracker(): ViewTracker {\r\n    return this.viewTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取ClickTracker实例\r\n   */\r\n  getClickTracker(): ClickTracker {\r\n    return this.clickTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取ExposureTracker实例\r\n   */\r\n  getExposureTracker(): ExposureTracker {\r\n    return this.exposureTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取InputTracker实例\r\n   */\r\n  getInputTracker(): InputTracker {\r\n    return this.inputTracker;\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (!this.enabled) {\r\n      return;\r\n    }\r\n\r\n    this.viewTracker.destroy();\r\n    this.clickTracker.destroy();\r\n    this.exposureTracker.destroy();\r\n    this.inputTracker.destroy();\r\n\r\n    this.enabled = false;\r\n  }\r\n}\r\n\r\nexport default AutoTracker;\r\n\r\n","/**\n * 错误监控采集器\n */\nimport type { ErrorEvent } from '@/types';\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\n\nclass ErrorTracker {\n  private handlers: Array<() => void> = [];\n  private errorCache: Map<string, number> = new Map(); // 错误缓存，防止短时间内重复上报\n  private debounceTime: number = 500; // 500ms内相同错误只记录一次\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    if (typeof window === 'undefined') {\n      return;\n    }\n\n    // 统一错误处理函数（避免重复监听）\n    const unifiedErrorHandler = (event: Event) => {\n      // 判断是JavaScript错误还是资源加载错误\n      if (event instanceof ErrorEvent) {\n        // JavaScript错误\n        this.handleJSError(event);\n      } else {\n        // 资源加载错误\n        this.handleResourceError(event);\n      }\n    };\n\n    window.addEventListener('error', unifiedErrorHandler, true);\n    this.handlers.push(() => {\n      window.removeEventListener('error', unifiedErrorHandler, true);\n    });\n\n    // Promise错误\n    const promiseErrorHandler = (event: PromiseRejectionEvent) => {\n      this.handlePromiseError(event);\n    };\n    window.addEventListener('unhandledrejection', promiseErrorHandler);\n    this.handlers.push(() => {\n      window.removeEventListener('unhandledrejection', promiseErrorHandler);\n    });\n  }\n\n  /**\n   * 处理JavaScript错误\n   */\n  private handleJSError(event: globalThis.ErrorEvent): void {\n    try {\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'js-error',\n        timestamp: Date.now(),\n        url: event.filename || getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'js',\n        message: event.message || 'Unknown error',\n        stack: (event.error as Error)?.stack,\n        filename: event.filename,\n        lineno: event.lineno,\n        colno: event.colno\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling JS error:', error);\n    }\n  }\n\n  /**\n   * 处理Promise错误\n   */\n  private handlePromiseError(event: PromiseRejectionEvent): void {\n    try {\n      const reason = event.reason;\n      let message = 'Unhandled promise rejection';\n      let stack: string | undefined;\n\n      if (reason instanceof Error) {\n        message = reason.message;\n        stack = reason.stack;\n      } else if (typeof reason === 'string') {\n        message = reason;\n      } else {\n        message = JSON.stringify(reason);\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'promise-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'promise',\n        message,\n        stack\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling promise error:', error);\n    }\n  }\n\n  /**\n   * 处理资源加载错误\n   */\n  private handleResourceError(event: Event): void {\n    try {\n      const target = event.target as HTMLElement;\n      if (!target) {\n        return;\n      }\n\n      // 判断是否为资源加载错误\n      const tagName = target.tagName?.toLowerCase();\n      if (!['img', 'script', 'link', 'audio', 'video'].includes(tagName)) {\n        return;\n      }\n\n      let resourceUrl = '';\n      if (target instanceof HTMLImageElement) {\n        resourceUrl = target.src || '';\n      } else if (target instanceof HTMLScriptElement) {\n        resourceUrl = target.src || '';\n      } else if (target instanceof HTMLLinkElement) {\n        resourceUrl = target.href || '';\n      } else if (target instanceof HTMLAudioElement || target instanceof HTMLVideoElement) {\n        resourceUrl = target.src || '';\n      }\n\n      if (!resourceUrl) {\n        return;\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'resource-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'resource',\n        message: `Failed to load resource: ${resourceUrl}`,\n        resourceUrl,\n        resourceType: tagName\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling resource error:', error);\n    }\n  }\n\n  /**\n   * 获取错误唯一标识\n   */\n  private getErrorKey(errorEvent: ErrorEvent): string {\n    const parts: string[] = [errorEvent.errorType, errorEvent.message];\n    \n    // JS错误和Promise错误：使用 message + filename + lineno\n    if (errorEvent.errorType === 'js' || errorEvent.errorType === 'promise') {\n      if (errorEvent.filename) {\n        parts.push(errorEvent.filename);\n      }\n      if (errorEvent.lineno) {\n        parts.push(String(errorEvent.lineno));\n      }\n      if (errorEvent.colno) {\n        parts.push(String(errorEvent.colno));\n      }\n    }\n    \n    // 资源错误：使用 resourceUrl\n    if (errorEvent.errorType === 'resource' && errorEvent.resourceUrl) {\n      parts.push(errorEvent.resourceUrl);\n    }\n    \n    return parts.join('|');\n  }\n\n  /**\n   * 触发错误事件\n   */\n  private emitError(errorEvent: ErrorEvent): void {\n    // 防抖检查：相同错误在短时间内只记录一次\n    const errorKey = this.getErrorKey(errorEvent);\n    const lastTime = this.errorCache.get(errorKey);\n    const now = Date.now();\n    \n    if (lastTime && now - lastTime < this.debounceTime) {\n      // 短时间内相同错误，忽略\n      return;\n    }\n    \n    // 更新缓存\n    this.errorCache.set(errorKey, now);\n    \n    // 清理过期缓存（超过5分钟）\n    this.cleanExpiredErrorCache(now);\n    \n    // 触发事件\n    if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n      (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('error', errorEvent);\n    }\n  }\n\n  /**\n   * 清理过期的错误缓存\n   */\n  private cleanExpiredErrorCache(now: number): void {\n    const expireTime = 5 * 60 * 1000; // 5分钟\n    for (const [key, time] of this.errorCache.entries()) {\n      if (now - time > expireTime) {\n        this.errorCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 手动上报错误\n   */\n  trackError(error: Error | string, errorInfo?: Record<string, unknown>): void {\n    try {\n      let message: string;\n      let stack: string | undefined;\n\n      if (error instanceof Error) {\n        message = error.message;\n        stack = error.stack;\n      } else {\n        message = error;\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'custom-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'js',\n        message,\n        stack,\n        properties: errorInfo\n      };\n\n      this.emitError(errorEvent);\n    } catch (e) {\n      console.error('ErrorTracker: Error tracking custom error:', e);\n    }\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    this.handlers.forEach(handler => handler());\n    this.handlers = [];\n    this.errorCache.clear();\n  }\n}\n\nexport default ErrorTracker;\n\n","/**\n * 性能监控采集器\n */\nimport type { PerformanceEvent } from '@/types';\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\nimport { throttle } from '@/core/utils';\n\nclass PerformanceTracker {\n  private observer: PerformanceObserver | null = null;\n  private navigationTimingCollected: boolean = false; // 导航性能事件只记录一次\n  private resourceCache: Map<string, number> = new Map(); // 资源性能事件缓存\n  private longTaskCache: Map<string, number> = new Map(); // 长任务事件缓存\n  private resourceDebounceTime: number = 1000; // 资源事件去重时间窗口（1秒）\n  private longTaskDebounceTime: number = 100; // 长任务事件防抖时间（100ms）\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    if (typeof window === 'undefined' || !window.performance) {\n      return;\n    }\n\n    // 页面加载完成后采集性能数据\n    if (document.readyState === 'complete') {\n      this.collectNavigationTiming();\n      this.collectResourceTiming();\n    } else {\n      window.addEventListener('load', () => {\n        this.collectNavigationTiming();\n        this.collectResourceTiming();\n      });\n    }\n\n    // 使用PerformanceObserver监控长任务\n    this.observeLongTasks();\n  }\n\n  /**\n   * 采集Navigation Timing数据\n   */\n  private collectNavigationTiming(): void {\n    // 导航性能事件只记录一次\n    if (this.navigationTimingCollected) {\n      return;\n    }\n\n    try {\n      const timing = performance.getEntriesByType('navigation')[0] as PerformanceNavigationTiming;\n      if (!timing) {\n        return;\n      }\n\n      const metrics: Record<string, number> = {\n        // DNS查询时间\n        dns: timing.domainLookupEnd - timing.domainLookupStart,\n        // TCP连接时间\n        tcp: timing.connectEnd - timing.connectStart,\n        // SSL握手时间\n        ssl: timing.secureConnectionStart > 0 ? timing.connectEnd - timing.secureConnectionStart : 0,\n        // TTFB（首字节时间）\n        ttfb: timing.responseStart - timing.requestStart,\n        // 响应时间\n        response: timing.responseEnd - timing.responseStart,\n        // DOM解析时间\n        domParse: timing.domInteractive - timing.responseEnd,\n        // 资源加载时间\n        resourceLoad: timing.loadEventStart - timing.domContentLoadedEventEnd,\n        // 总加载时间\n        total: timing.loadEventEnd - timing.fetchStart,\n        // DOMContentLoaded时间\n        domContentLoaded: timing.domContentLoadedEventEnd - timing.fetchStart,\n        // Load时间\n        load: timing.loadEventEnd - timing.fetchStart\n      };\n\n      const performanceEvent: PerformanceEvent = {\n        type: 'performance',\n        name: 'navigation-timing',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        metricType: 'navigation',\n        metrics\n      };\n\n      this.navigationTimingCollected = true;\n      this.emitPerformance(performanceEvent);\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting navigation timing:', error);\n    }\n  }\n\n  /**\n   * 采集Resource Timing数据\n   */\n  private collectResourceTiming(): void {\n    try {\n      const resources = performance.getEntriesByType('resource') as PerformanceResourceTiming[];\n      if (!resources || resources.length === 0) {\n        return;\n      }\n\n      const now = Date.now();\n      resources.forEach(resource => {\n        const resourceUrl = resource.name;\n        \n        // 去重检查：相同资源在1秒内只记录一次\n        const lastTime = this.resourceCache.get(resourceUrl);\n        if (lastTime && now - lastTime < this.resourceDebounceTime) {\n          return;\n        }\n        \n        // 更新缓存\n        this.resourceCache.set(resourceUrl, now);\n        \n        const metrics: Record<string, number> = {\n          // DNS查询时间\n          dns: resource.domainLookupEnd - resource.domainLookupStart,\n          // TCP连接时间\n          tcp: resource.connectEnd - resource.connectStart,\n          // 请求时间\n          request: resource.responseStart - resource.requestStart,\n          // 响应时间\n          response: resource.responseEnd - resource.responseStart,\n          // 总时间\n          total: resource.responseEnd - resource.startTime,\n          // 资源大小\n          size: (resource as PerformanceResourceTiming & { transferSize?: number }).transferSize || 0\n        };\n\n        const performanceEvent: PerformanceEvent = {\n          type: 'performance',\n          name: 'resource-timing',\n          timestamp: now,\n          url: getCurrentUrl(),\n          title: getPageTitle(),\n          metricType: 'resource',\n          metrics: {\n            ...metrics,\n            resourceUrl: resource.name,\n            resourceType: resource.initiatorType\n          } as unknown as Record<string, number>\n        };\n\n        this.emitPerformance(performanceEvent);\n      });\n      \n      // 清理过期缓存（超过5分钟）\n      this.cleanExpiredResourceCache(now);\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting resource timing:', error);\n    }\n  }\n\n  /**\n   * 监控长任务\n   */\n  private observeLongTasks(): void {\n    if (typeof PerformanceObserver === 'undefined') {\n      return;\n    }\n\n    try {\n      // 使用节流函数限制长任务事件的触发频率\n      const throttledEmitLongTask = throttle((...args: unknown[]) => {\n        const entry = args[0] as PerformanceEntry;\n        const now = Date.now();\n        // 使用 startTime 和 duration 作为唯一标识\n        const taskKey = `${entry.startTime}-${entry.duration}`;\n        \n        // 去重检查：相同长任务在100ms内只记录一次\n        const lastTime = this.longTaskCache.get(taskKey);\n        if (lastTime && now - lastTime < this.longTaskDebounceTime) {\n          return;\n        }\n        \n        // 更新缓存\n        this.longTaskCache.set(taskKey, now);\n        \n        const performanceEvent: PerformanceEvent = {\n          type: 'performance',\n          name: 'longtask',\n          timestamp: now,\n          url: getCurrentUrl(),\n          title: getPageTitle(),\n          metricType: 'longtask',\n          metrics: {\n            duration: entry.duration,\n            startTime: entry.startTime\n          }\n        };\n\n        this.emitPerformance(performanceEvent);\n        \n        // 清理过期缓存（超过1分钟）\n        this.cleanExpiredLongTaskCache(now);\n      }, this.longTaskDebounceTime);\n\n      this.observer = new PerformanceObserver(list => {\n        list.getEntries().forEach(entry => {\n          if (entry.entryType === 'longtask') {\n            throttledEmitLongTask(entry);\n          }\n        });\n      });\n\n      this.observer.observe({ entryTypes: ['longtask'] });\n    } catch (error) {\n      console.error('PerformanceTracker: Error observing long tasks:', error);\n    }\n  }\n\n  /**\n   * 清理过期的资源缓存\n   */\n  private cleanExpiredResourceCache(now: number): void {\n    const expireTime = 5 * 60 * 1000; // 5分钟\n    for (const [key, time] of this.resourceCache.entries()) {\n      if (now - time > expireTime) {\n        this.resourceCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 清理过期的长任务缓存\n   */\n  private cleanExpiredLongTaskCache(now: number): void {\n    const expireTime = 60 * 1000; // 1分钟\n    for (const [key, time] of this.longTaskCache.entries()) {\n      if (now - time > expireTime) {\n        this.longTaskCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 触发性能事件\n   */\n  private emitPerformance(performanceEvent: PerformanceEvent): void {\n    // 触发事件\n    if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n      (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('performance', performanceEvent);\n    }\n  }\n\n  /**\n   * 手动采集性能指标\n   */\n  collectMetrics(): PerformanceEvent | null {\n    try {\n      const timing = performance.getEntriesByType('navigation')[0] as PerformanceNavigationTiming;\n      if (!timing) {\n        return null;\n      }\n\n      const metrics: Record<string, number> = {\n        dns: timing.domainLookupEnd - timing.domainLookupStart,\n        tcp: timing.connectEnd - timing.connectStart,\n        ttfb: timing.responseStart - timing.requestStart,\n        response: timing.responseEnd - timing.responseStart,\n        domParse: timing.domInteractive - timing.responseEnd,\n        resourceLoad: timing.loadEventStart - timing.domContentLoadedEventEnd,\n        total: timing.loadEventEnd - timing.fetchStart\n      };\n\n      return {\n        type: 'performance',\n        name: 'custom-performance',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        metricType: 'navigation',\n        metrics\n      };\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting metrics:', error);\n      return null;\n    }\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    if (this.observer) {\n      this.observer.disconnect();\n      this.observer = null;\n    }\n    this.navigationTimingCollected = false;\n    this.resourceCache.clear();\n    this.longTaskCache.clear();\n  }\n}\n\nexport default PerformanceTracker;\n\n","/**\r\n * 自定义埋点采集器\r\n */\r\nimport type { CustomEvent } from '@/types';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\nclass CustomTracker {\r\n  /**\r\n   * 追踪自定义事件\r\n   */\r\n  track(eventName: string, properties?: Record<string, unknown>): CustomEvent {\r\n    const customEvent: CustomEvent = {\r\n      type: 'custom',\r\n      name: 'custom',\r\n      eventName,\r\n      timestamp: Date.now(),\r\n      url: getCurrentUrl(),\r\n      title: getPageTitle(),\r\n      properties\r\n    };\r\n\r\n    return customEvent;\r\n  }\r\n}\r\n\r\nexport default CustomTracker;\r\n\r\n","/**\r\n * 采样器\r\n */\r\n\r\nclass Sampler {\r\n  /**\r\n   * 判断是否采样\r\n   * @param sampleRate 采样率（0-1）\r\n   */\r\n  shouldSample(sampleRate: number): boolean {\r\n    if (sampleRate >= 1) {\r\n      return true;\r\n    }\r\n    if (sampleRate <= 0) {\r\n      return false;\r\n    }\r\n    return Math.random() < sampleRate;\r\n  }\r\n\r\n  /**\r\n   * 判断关键事件是否应该采样（关键事件总是采样）\r\n   */\r\n  shouldSampleCritical(isCritical: boolean, sampleRate: number): boolean {\r\n    if (isCritical) {\r\n      return true;\r\n    }\r\n    return this.shouldSample(sampleRate);\r\n  }\r\n}\r\n\r\nexport default Sampler;\r\n\r\n","/**\r\n * 去重器\r\n */\r\nimport type { TrackerEvent } from '@/types';\r\n\r\nclass Deduplicator {\r\n  private eventCache: Map<string, number> = new Map();\r\n  // 不同事件类型的去重时间窗口\r\n  private cacheTimeouts: Record<string, number> = {\r\n    click: 10000, // 点击事件：10秒\r\n    exposure: 30000, // 曝光事件：30秒\r\n    error: 5000, // 错误事件：5秒（ErrorTracker已有防抖，这里作为额外保护）\r\n    performance: 60000, // 性能事件：60秒\r\n    pageview: 10000, // 页面浏览事件：10秒（ViewTracker已有保护，这里作为额外保护）\r\n    input: 3000, // 输入事件：3秒\r\n    custom: 1000 // 自定义事件：1秒（api-request和api-response使用动态时间窗口）\r\n  };\r\n  private defaultCacheTimeout: number = 60000; // 默认1分钟\r\n\r\n  /**\r\n   * 判断事件是否重复\r\n   */\r\n  isDuplicate(event: TrackerEvent): boolean {\r\n    const key = this.getEventKey(event);\r\n    const lastTime = this.eventCache.get(key);\r\n    const now = Date.now();\r\n\r\n    // 获取该事件类型的去重时间窗口\r\n    let cacheTimeout = this.cacheTimeouts[event.type] || this.defaultCacheTimeout;\r\n    \r\n    // 针对api-request和api-response使用更长的去重时间窗口（5秒）\r\n    if (event.type === 'custom' && 'eventName' in event) {\r\n      const eventName = event.eventName;\r\n      if (eventName === 'api-request' || eventName === 'api-response') {\r\n        cacheTimeout = 5000; // 5秒\r\n      }\r\n    }\r\n\r\n    if (lastTime && now - lastTime < cacheTimeout) {\r\n      return true;\r\n    }\r\n\r\n    this.eventCache.set(key, now);\r\n    this.cleanExpiredCache(now);\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 获取事件唯一标识\r\n   */\r\n  private getEventKey(event: TrackerEvent): string {\r\n    const parts: string[] = [event.type, event.name, event.url];\r\n\r\n    if (event.type === 'click' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n      // 使用位置容差，相同按钮的多次点击（位置相近）视为重复\r\n      // 将位置四舍五入到10像素的倍数，实现容差（±5像素内视为相同位置）\r\n      if ('position' in event && event.position) {\r\n        const tolerance = 10;\r\n        const x = Math.floor(event.position.x / tolerance) * tolerance;\r\n        const y = Math.floor(event.position.y / tolerance) * tolerance;\r\n        parts.push(`${x}-${y}`);\r\n      }\r\n    } else if (event.type === 'exposure' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n    } else if (event.type === 'input' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n      // 输入事件：使用 elementPath + 输入内容hash + 输入内容长度作为去重key\r\n      // 如果内容相同，视为重复输入\r\n      if ('value' in event && event.value !== undefined && event.value !== null) {\r\n        // 使用输入值的前10个字符作为hash（避免过长）\r\n        const valueStr = String(event.value);\r\n        const valueHash = valueStr.length > 10 ? valueStr.substring(0, 10) : valueStr;\r\n        parts.push(this.simpleHash(valueHash));\r\n      } else if ('valueLength' in event && event.valueLength !== undefined) {\r\n        // 如果没有value（敏感字段），使用长度\r\n        parts.push(String(event.valueLength));\r\n      }\r\n      // 如果是敏感字段，使用 isSensitive 标记\r\n      if ('isSensitive' in event && event.isSensitive) {\r\n        parts.push('sensitive');\r\n      }\r\n    } else if (event.type === 'error' && 'message' in event) {\r\n      parts.push(event.message);\r\n      // 添加文件名和行号增加唯一性\r\n      if ('filename' in event && event.filename) {\r\n        parts.push(event.filename);\r\n      }\r\n      if ('lineno' in event && event.lineno) {\r\n        parts.push(String(event.lineno));\r\n      }\r\n      if ('colno' in event && event.colno) {\r\n        parts.push(String(event.colno));\r\n      }\r\n      // 资源错误：添加 resourceUrl\r\n      if ('resourceUrl' in event && event.resourceUrl) {\r\n        parts.push(event.resourceUrl);\r\n      }\r\n    } else if (event.type === 'performance' && 'metricType' in event) {\r\n      // 性能事件：根据不同类型使用不同的唯一标识\r\n      parts.push(event.metricType);\r\n      if (event.metricType === 'resource' && 'metrics' in event && event.metrics) {\r\n        // 资源性能事件：使用 resourceUrl\r\n        const resourceUrl = (event.metrics as Record<string, unknown>).resourceUrl;\r\n        if (resourceUrl) {\r\n          parts.push(String(resourceUrl));\r\n        }\r\n      } else if (event.metricType === 'longtask' && 'metrics' in event && event.metrics) {\r\n        // 长任务事件：使用 startTime 和 duration\r\n        const metrics = event.metrics as Record<string, unknown>;\r\n        if (metrics.startTime !== undefined && metrics.duration !== undefined) {\r\n          parts.push(`${metrics.startTime}-${metrics.duration}`);\r\n        }\r\n      } else if (event.metricType === 'navigation') {\r\n        // 导航性能事件：每个页面只记录一次，使用 URL\r\n        // URL 已经在 parts 中，不需要额外添加\r\n      }\r\n    } else if (event.type === 'custom' && 'eventName' in event) {\r\n      parts.push(event.eventName);\r\n      \r\n      // 针对api-request和api-response使用关键字段生成去重key，避免timestamp等变化字段影响去重\r\n      if (event.eventName === 'api-request' || event.eventName === 'api-response') {\r\n        if (event.properties) {\r\n          const props = event.properties as Record<string, unknown>;\r\n          // 使用关键字段：url、method、fullUrl（排除timestamp、headers等变化字段）\r\n          const apiUrl = props.url ? String(props.url) : '';\r\n          const method = props.method ? String(props.method) : '';\r\n          const fullUrl = props.fullUrl ? String(props.fullUrl) : '';\r\n          \r\n          if (apiUrl || method || fullUrl) {\r\n            // 优先使用fullUrl，如果没有则使用url+method组合\r\n            parts.push(fullUrl || `${method}:${apiUrl}`);\r\n          } else {\r\n            // 如果没有关键字段，回退到原来的逻辑\r\n            try {\r\n              const propsStr = JSON.stringify(event.properties);\r\n              parts.push(propsStr.substring(0, 100));\r\n            } catch {\r\n              parts.push(String(Object.keys(event.properties).length));\r\n            }\r\n          }\r\n        }\r\n      } else {\r\n        // 其他custom事件使用原来的逻辑\r\n        if (event.properties) {\r\n          try {\r\n            const propsStr = JSON.stringify(event.properties);\r\n            // 使用前100个字符作为hash，避免过长\r\n            parts.push(propsStr.substring(0, 100));\r\n          } catch {\r\n            // JSON序列化失败，使用长度\r\n            parts.push(String(Object.keys(event.properties).length));\r\n          }\r\n        }\r\n      }\r\n    } else if (event.type === 'pageview') {\r\n      // 页面浏览事件使用时间窗口（10秒内视为重复）\r\n      const timeWindow = Math.floor(event.timestamp / 10000);\r\n      parts.push(String(timeWindow));\r\n    }\r\n\r\n    return parts.join('|');\r\n  }\r\n\r\n  /**\r\n   * 简单的字符串hash函数（用于输入值去重）\r\n   */\r\n  private simpleHash(str: string): string {\r\n    let hash = 0;\r\n    for (let i = 0; i < str.length; i++) {\r\n      const char = str.charCodeAt(i);\r\n      hash = ((hash << 5) - hash) + char;\r\n      hash = hash & hash; // 转换为32位整数\r\n    }\r\n    // 返回正数的hash值（前8位字符）\r\n    return Math.abs(hash).toString(36).substring(0, 8);\r\n  }\r\n\r\n  /**\r\n   * 清理过期缓存\r\n   */\r\n  private cleanExpiredCache(now: number): void {\r\n    // 使用最大时间窗口来清理缓存（避免频繁清理）\r\n    const maxTimeout = Math.max(...Object.values(this.cacheTimeouts), this.defaultCacheTimeout);\r\n    const expireTime = maxTimeout * 2; // 清理超过最大时间窗口2倍的缓存\r\n\r\n    for (const [key, time] of this.eventCache.entries()) {\r\n      if (now - time > expireTime) {\r\n        this.eventCache.delete(key);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清空缓存\r\n   */\r\n  clear(): void {\r\n    this.eventCache.clear();\r\n  }\r\n}\r\n\r\nexport default Deduplicator;\r\n\r\n","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/**\r\n * 数据压缩器\r\n */\r\nimport pako from 'pako';\r\n\r\nclass Compressor {\r\n  /**\r\n   * 压缩数据\r\n   */\r\n  compress(data: string): string {\r\n    try {\r\n      // 使用pako进行gzip压缩\r\n      const compressed = pako.deflate(data);\r\n      \r\n      // 转换为base64\r\n      if (typeof btoa !== 'undefined') {\r\n        // 浏览器环境：将Uint8Array转换为字符串再base64\r\n        let binaryString = '';\r\n        for (let i = 0; i < compressed.length; i++) {\r\n          binaryString += String.fromCharCode(compressed[i]);\r\n        }\r\n        return btoa(binaryString);\r\n      } else if (typeof Buffer !== 'undefined') {\r\n        // Node环境：使用Buffer\r\n        return Buffer.from(compressed).toString('base64');\r\n      }\r\n      return data;\r\n    } catch (error) {\r\n      console.error('Compressor: Error compressing data:', error);\r\n      return data;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 解压数据\r\n   */\r\n  decompress(compressedData: string): string {\r\n    try {\r\n      // 从base64解码\r\n      let binaryData: Uint8Array;\r\n      if (typeof atob !== 'undefined') {\r\n        // 浏览器环境\r\n        const binaryString = atob(compressedData);\r\n        binaryData = new Uint8Array(binaryString.length);\r\n        for (let i = 0; i < binaryString.length; i++) {\r\n          binaryData[i] = binaryString.charCodeAt(i);\r\n        }\r\n      } else if (typeof Buffer !== 'undefined') {\r\n        // Node环境\r\n        const buffer = Buffer.from(compressedData, 'base64');\r\n        binaryData = new Uint8Array(buffer);\r\n      } else {\r\n        return compressedData;\r\n      }\r\n      \r\n      // 使用pako解压\r\n      const decompressed = pako.inflate(binaryData, { to: 'string' });\r\n      return decompressed;\r\n    } catch (error) {\r\n      console.error('Compressor: Error decompressing data:', error);\r\n      return compressedData;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 判断是否需要压缩（数据大于1KB时压缩）\r\n   */\r\n  shouldCompress(data: string): boolean {\r\n    return data.length > 1024;\r\n  }\r\n}\r\n\r\nexport default Compressor;\r\n\r\n","/**\r\n * 数据处理器\r\n */\r\nimport type { TrackerEvent } from '@/types';\r\nimport Sampler from './sampler';\r\nimport Deduplicator from './deduplicator';\r\nimport Compressor from './compressor';\r\nimport { deepClone } from '@/core/utils';\r\n\r\ninterface ProcessOptions {\r\n  /** 采样率 */\r\n  sampleRate?: number;\r\n  /** 是否启用去重 */\r\n  enableDeduplication?: boolean;\r\n  /** 是否启用压缩 */\r\n  enableCompression?: boolean;\r\n  /** 是否关键事件 */\r\n  isCritical?: boolean;\r\n}\r\n\r\nclass DataProcessor {\r\n  private sampler: Sampler;\r\n  private deduplicator: Deduplicator;\r\n  private compressor: Compressor;\r\n\r\n  constructor() {\r\n    this.sampler = new Sampler();\r\n    this.deduplicator = new Deduplicator();\r\n    this.compressor = new Compressor();\r\n  }\r\n\r\n  /**\r\n   * 处理事件\r\n   */\r\n  process(event: TrackerEvent, options: ProcessOptions = {}): TrackerEvent | null {\r\n    const {\r\n      sampleRate = 1.0,\r\n      enableDeduplication = true,\r\n      enableCompression = false,\r\n      isCritical = false\r\n    } = options;\r\n\r\n    // 采样\r\n    if (!this.sampler.shouldSampleCritical(isCritical, sampleRate)) {\r\n      return null;\r\n    }\r\n\r\n    // 去重\r\n    if (enableDeduplication && this.deduplicator.isDuplicate(event)) {\r\n      return null;\r\n    }\r\n\r\n    // 深拷贝，避免修改原始数据\r\n    const processedEvent = deepClone(event);\r\n\r\n    // 压缩（如果需要）\r\n    if (enableCompression && processedEvent.properties) {\r\n      const propertiesStr = JSON.stringify(processedEvent.properties);\r\n      if (this.compressor.shouldCompress(propertiesStr)) {\r\n        // 压缩后的数据存储在compressedProperties中\r\n        (processedEvent as TrackerEvent & { compressedProperties?: string }).compressedProperties = this.compressor.compress(propertiesStr);\r\n        delete processedEvent.properties;\r\n      }\r\n    }\r\n\r\n    return processedEvent;\r\n  }\r\n\r\n  /**\r\n   * 批量处理事件\r\n   */\r\n  processBatch(events: TrackerEvent[], options: ProcessOptions = {}): TrackerEvent[] {\r\n    return events\r\n      .map(event => this.process(event, options))\r\n      .filter((event): event is TrackerEvent => event !== null);\r\n  }\r\n\r\n  /**\r\n   * 序列化事件\r\n   */\r\n  serialize(event: TrackerEvent): string {\r\n    try {\r\n      return JSON.stringify(event);\r\n    } catch (error) {\r\n      console.error('DataProcessor: Error serializing event:', error);\r\n      return '';\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 反序列化事件\r\n   */\r\n  deserialize(data: string): TrackerEvent | null {\r\n    try {\r\n      return JSON.parse(data) as TrackerEvent;\r\n    } catch (error) {\r\n      console.error('DataProcessor: Error deserializing event:', error);\r\n      return null;\r\n    }\r\n  }\r\n}\r\n\r\nexport default DataProcessor;\r\n\r\n","/**\r\n * 网络请求封装\r\n */\r\n\r\n/**\r\n * AbortController兼容性处理\r\n */\r\nfunction getAbortController(): typeof AbortController {\r\n  if (typeof AbortController !== 'undefined') {\r\n    return AbortController;\r\n  }\r\n  \r\n  // 简单的AbortController polyfill\r\n  class AbortSignalPolyfill {\r\n    aborted: boolean = false;\r\n    \r\n    abort(): void {\r\n      this.aborted = true;\r\n    }\r\n  }\r\n\r\n  class AbortControllerPolyfill {\r\n    signal: AbortSignalPolyfill;\r\n    \r\n    constructor() {\r\n      this.signal = new AbortSignalPolyfill();\r\n    }\r\n    \r\n    abort(): void {\r\n      this.signal.abort();\r\n    }\r\n  }\r\n\r\n  return AbortControllerPolyfill as unknown as typeof AbortController;\r\n}\r\n\r\ninterface AbortSignalPolyfill {\r\n  aborted: boolean;\r\n  abort(): void;\r\n}\r\n\r\n/**\r\n * fetch兼容性降级实现（基于XMLHttpRequest）\r\n */\r\nasync function fetchPolyfill(url: string, init?: RequestInit): Promise<Response> {\r\n  return new Promise((resolve, reject) => {\r\n    const xhr = new XMLHttpRequest();\r\n    const method = init?.method || 'GET';\r\n    \r\n    xhr.open(method, url, true);\r\n    \r\n    // 设置请求头\r\n    if (init?.headers) {\r\n      const headers = new Headers(init.headers);\r\n      headers.forEach((value, key) => {\r\n        if (value != null) {\r\n          xhr.setRequestHeader(key, String(value));\r\n        }\r\n      });\r\n    }\r\n\r\n    // 超时处理\r\n    if (init?.signal) {\r\n      const signal = init.signal as unknown as AbortSignalPolyfill;\r\n      if (signal.aborted) {\r\n        reject(new DOMException('Aborted', 'AbortError'));\r\n        return;\r\n      }\r\n    }\r\n\r\n    // 响应处理\r\n    xhr.onload = () => {\r\n      const headersString = xhr.getAllResponseHeaders();\r\n      const headers: Record<string, string> = {};\r\n      \r\n      headersString.split('\\n').forEach(line => {\r\n        const parts = line.split(': ');\r\n        if (parts[0] && parts[1]) {\r\n          headers[parts[0].toLowerCase()] = parts[1];\r\n        }\r\n      });\r\n\r\n      const responseHeaders = new Headers(headers);\r\n      const responseText = xhr.responseText || '';\r\n      const responseUrl = xhr.responseURL || url;\r\n      const responseStatus = xhr.status;\r\n      const responseStatusText = xhr.statusText;\r\n      const responseOk = responseStatus >= 200 && responseStatus < 300;\r\n\r\n      const response: Partial<Response> = {\r\n        ok: responseOk,\r\n        status: responseStatus,\r\n        statusText: responseStatusText,\r\n        type: 'basic',\r\n        url: responseUrl,\r\n        headers: responseHeaders,\r\n        redirected: false,\r\n        body: null,\r\n        bodyUsed: false,\r\n        arrayBuffer: () => Promise.resolve(new ArrayBuffer(0)),\r\n        blob: () => Promise.resolve(new Blob()),\r\n        formData: () => Promise.resolve(new FormData()),\r\n        json: async () => {\r\n          try {\r\n            return JSON.parse(responseText || '{}');\r\n          } catch {\r\n            throw new TypeError('Invalid JSON response');\r\n          }\r\n        },\r\n        text: () => Promise.resolve(responseText),\r\n        clone: () => {\r\n          // clone方法返回一个新的Response对象（使用相同的数据）\r\n          return {\r\n            ...response,\r\n            headers: new Headers(headers)\r\n          } as Response;\r\n        }\r\n      };\r\n\r\n      resolve(response as Response);\r\n    };\r\n\r\n    xhr.onerror = () => {\r\n      reject(new TypeError('Network request failed'));\r\n    };\r\n\r\n    xhr.ontimeout = () => {\r\n      reject(new Error('Request timeout'));\r\n    };\r\n\r\n    const body = init?.body;\r\n    if (body instanceof FormData || body instanceof Blob || typeof body === 'string' || body === null) {\r\n      xhr.send(body);\r\n    } else if (body) {\r\n      xhr.send(String(body));\r\n    } else {\r\n      xhr.send(null);\r\n    }\r\n  });\r\n}\r\n\r\n/**\r\n * 获取fetch函数（支持降级）\r\n */\r\nfunction getFetch(): typeof fetch {\r\n  if (typeof fetch === 'function') {\r\n    // 检查AbortController支持\r\n    try {\r\n      new (getAbortController())();\r\n      return fetch;\r\n    } catch {\r\n      // AbortController不支持，使用polyfill\r\n      return fetchPolyfill as unknown as typeof fetch;\r\n    }\r\n  }\r\n  \r\n  // fetch不可用，使用XMLHttpRequest降级\r\n  if (typeof XMLHttpRequest !== 'undefined') {\r\n    return fetchPolyfill as unknown as typeof fetch;\r\n  }\r\n  \r\n  throw new Error('fetch is not available and XMLHttpRequest fallback is not supported');\r\n}\r\n\r\n/**\r\n * 请求选项\r\n */\r\ninterface RequestOptions {\r\n  method?: 'GET' | 'POST' | 'PUT' | 'DELETE';\r\n  headers?: Record<string, string>;\r\n  body?: string | FormData;\r\n  timeout?: number;\r\n}\r\n\r\n/**\r\n * 请求响应\r\n */\r\ninterface RequestResponse {\r\n  ok: boolean;\r\n  status: number;\r\n  statusText: string;\r\n  data: unknown;\r\n}\r\n\r\n/**\r\n * 浏览器环境请求\r\n */\r\nasync function browserRequest(url: string, options: RequestOptions = {}): Promise<RequestResponse> {\r\n  const { method = 'POST', headers = {}, body, timeout = 10000 } = options;\r\n\r\n  const AbortControllerClass = getAbortController();\r\n  const controller = new AbortControllerClass();\r\n  const timeoutId = setTimeout(() => controller.abort(), timeout);\r\n\r\n  try {\r\n    const fetchFn = getFetch();\r\n    const response = await fetchFn(url, {\r\n      method,\r\n      headers: {\r\n        'Content-Type': 'application/json',\r\n        ...headers\r\n      },\r\n      body,\r\n      signal: controller.signal as AbortSignal\r\n    });\r\n\r\n    clearTimeout(timeoutId);\r\n\r\n    let data: unknown;\r\n    const contentType = response.headers.get('content-type');\r\n    if (contentType && contentType.includes('application/json')) {\r\n      data = await response.json();\r\n    } else {\r\n      data = await response.text();\r\n    }\r\n\r\n    return {\r\n      ok: response.ok,\r\n      status: response.status,\r\n      statusText: response.statusText,\r\n      data\r\n    };\r\n  } catch (error) {\r\n    clearTimeout(timeoutId);\r\n    throw error;\r\n  }\r\n}\r\n\r\n/**\r\n * Node环境请求\r\n */\r\nasync function nodeRequest(url: string, options: RequestOptions = {}): Promise<RequestResponse> {\r\n  const { method = 'POST', headers = {}, body, timeout = 10000 } = options;\r\n\r\n  try {\r\n    // 动态导入node-fetch（仅在Node环境）\r\n    // 在浏览器构建中，这个函数不会被调用\r\n    let nodeFetchFn: typeof import('node-fetch').default;\r\n    try {\r\n      // 使用动态import，避免在浏览器构建中打包node-fetch\r\n      const nodeFetch = await import('node-fetch');\r\n      nodeFetchFn = (nodeFetch.default || nodeFetch) as typeof import('node-fetch').default;\r\n    } catch (e) {\r\n      // 如果node-fetch不可用，抛出错误\r\n      if (typeof process !== 'undefined' && process.versions?.node) {\r\n        throw new Error('node-fetch is required in Node.js environment. Please install it: pnpm add node-fetch');\r\n      }\r\n      // 浏览器环境不应该调用这个函数\r\n      throw new Error('Network request failed: node-fetch not available');\r\n    }\r\n\r\n    const AbortControllerClass = getAbortController();\r\n    const controller = new AbortControllerClass();\r\n    const timeoutId = setTimeout(() => controller.abort(), timeout);\r\n\r\n    try {\r\n      const response = await nodeFetchFn(url, {\r\n        method,\r\n        headers: {\r\n          'Content-Type': 'application/json',\r\n          ...headers\r\n        },\r\n        body,\r\n        signal: controller.signal as AbortSignal\r\n      });\r\n\r\n      clearTimeout(timeoutId);\r\n\r\n    let data: unknown;\r\n    const contentType = response.headers.get('content-type');\r\n    if (contentType && contentType.includes('application/json')) {\r\n      data = await response.json();\r\n    } else {\r\n      data = await response.text();\r\n    }\r\n\r\n    return {\r\n      ok: response.ok,\r\n      status: response.status,\r\n      statusText: response.statusText,\r\n      data\r\n    };\r\n    } catch (error) {\r\n      clearTimeout(timeoutId);\r\n      throw error;\r\n    }\r\n  } catch (error) {\r\n    throw error;\r\n  }\r\n}\r\n\r\n/**\r\n * 统一请求接口\r\n */\r\nexport async function request(url: string, options: RequestOptions = {}): Promise<RequestResponse> {\r\n  // Node环境使用node-fetch\r\n  if (typeof process !== 'undefined' && process.versions?.node) {\r\n    return nodeRequest(url, options);\r\n  }\r\n  // 浏览器环境使用fetch（带降级）\r\n  if (typeof window !== 'undefined') {\r\n    return browserRequest(url, options);\r\n  }\r\n  // 降级：尝试使用浏览器请求\r\n  return browserRequest(url, options);\r\n}\r\n\r\n/**\r\n * GET请求\r\n */\r\nexport function get(url: string, options: Omit<RequestOptions, 'method' | 'body'> = {}): Promise<RequestResponse> {\r\n  return request(url, { ...options, method: 'GET' });\r\n}\r\n\r\n/**\r\n * POST请求\r\n */\r\nexport function post(url: string, data: unknown, options: Omit<RequestOptions, 'method' | 'body'> = {}): Promise<RequestResponse> {\r\n  const body = typeof data === 'string' ? data : JSON.stringify(data);\r\n  return request(url, { ...options, method: 'POST', body });\r\n}\r\n\r\n","/**\r\n * 重试处理器\r\n */\r\n\r\ninterface RetryOptions {\r\n  /** 最大重试次数 */\r\n  maxRetries?: number;\r\n  /** 初始延迟时间（毫秒） */\r\n  initialDelay?: number;\r\n  /** 最大延迟时间（毫秒） */\r\n  maxDelay?: number;\r\n  /** 重试条件函数 */\r\n  shouldRetry?: (error: unknown) => boolean;\r\n}\r\n\r\nclass RetryHandler {\r\n  /**\r\n   * 执行带重试的函数\r\n   */\r\n  async execute<T>(\r\n    fn: () => Promise<T>,\r\n    options: RetryOptions = {}\r\n  ): Promise<T> {\r\n    const {\r\n      maxRetries = 3,\r\n      initialDelay = 1000,\r\n      maxDelay = 10000,\r\n      shouldRetry = () => true\r\n    } = options;\r\n\r\n    let lastError: unknown;\r\n    let delay = initialDelay;\r\n\r\n    for (let attempt = 0; attempt <= maxRetries; attempt++) {\r\n      try {\r\n        return await fn();\r\n      } catch (error) {\r\n        lastError = error;\r\n\r\n        // 判断是否应该重试\r\n        if (attempt < maxRetries && shouldRetry(error)) {\r\n          // 指数退避\r\n          await this.sleep(delay);\r\n          delay = Math.min(delay * 2, maxDelay);\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    throw lastError;\r\n  }\r\n\r\n  /**\r\n   * 延迟函数\r\n   */\r\n  private sleep(ms: number): Promise<void> {\r\n    return new Promise(resolve => setTimeout(resolve, ms));\r\n  }\r\n\r\n  /**\r\n   * 判断错误是否可重试\r\n   */\r\n  isRetryableError(error: unknown): boolean {\r\n    // 网络错误、超时错误等可以重试\r\n    if (error instanceof Error) {\r\n      const message = error.message.toLowerCase();\r\n      return (\r\n        message.includes('network') ||\r\n        message.includes('timeout') ||\r\n        message.includes('fetch') ||\r\n        message.includes('connection')\r\n      );\r\n    }\r\n\r\n    // 其他错误默认不重试\r\n    return false;\r\n  }\r\n}\r\n\r\nexport default RetryHandler;\r\n\r\n","/**\r\n * 数据发送器\r\n */\r\nimport { post } from '@/core/request';\r\nimport type { TrackerEvent } from '@/types';\r\nimport RetryHandler from './retry-handler';\r\n\r\ninterface SendOptions {\r\n  /** 是否启用重试 */\r\n  enableRetry?: boolean;\r\n  /** 最大重试次数 */\r\n  maxRetries?: number;\r\n}\r\n\r\nclass Sender {\r\n  private serverUrl: string;\r\n  private retryHandler: RetryHandler;\r\n\r\n  constructor(serverUrl: string) {\r\n    this.serverUrl = serverUrl;\r\n    this.retryHandler = new RetryHandler();\r\n  }\r\n\r\n  /**\r\n   * 发送单个事件\r\n   */\r\n  async send(event: TrackerEvent, options: SendOptions = {}): Promise<boolean> {\r\n    // 如果serverUrl为空，跳过网络请求，返回false表示需要保存到离线存储\r\n    if (!this.serverUrl || this.serverUrl === 'about:blank') {\r\n      return false;\r\n    }\r\n\r\n    const { enableRetry = true, maxRetries = 3 } = options;\r\n\r\n    try {\r\n      if (enableRetry) {\r\n        await this.retryHandler.execute(\r\n          async () => {\r\n            const response = await post(this.serverUrl, event);\r\n            if (!response.ok) {\r\n              throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n            }\r\n            return response;\r\n          },\r\n          {\r\n            maxRetries,\r\n            shouldRetry: error => this.retryHandler.isRetryableError(error)\r\n          }\r\n        );\r\n      } else {\r\n        const response = await post(this.serverUrl, event);\r\n        if (!response.ok) {\r\n          throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n        }\r\n      }\r\n\r\n      return true;\r\n    } catch (error) {\r\n      console.error('Sender: Error sending event:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 批量发送事件\r\n   */\r\n  async sendBatch(events: TrackerEvent[], options: SendOptions = {}): Promise<boolean> {\r\n    if (events.length === 0) {\r\n      return true;\r\n    }\r\n\r\n    // 如果serverUrl为空，跳过网络请求，返回false表示需要保存到离线存储\r\n    if (!this.serverUrl || this.serverUrl === 'about:blank') {\r\n      return false;\r\n    }\r\n\r\n    const { enableRetry = true, maxRetries = 3 } = options;\r\n\r\n    try {\r\n      if (enableRetry) {\r\n        await this.retryHandler.execute(\r\n          async () => {\r\n            const response = await post(this.serverUrl, { events });\r\n            if (!response.ok) {\r\n              throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n            }\r\n            return response;\r\n          },\r\n          {\r\n            maxRetries,\r\n            shouldRetry: error => this.retryHandler.isRetryableError(error)\r\n          }\r\n        );\r\n      } else {\r\n        const response = await post(this.serverUrl, { events });\r\n        if (!response.ok) {\r\n          throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n        }\r\n      }\r\n\r\n      return true;\r\n    } catch (error) {\r\n      console.error('Sender: Error sending batch events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 更新服务器地址\r\n   */\r\n  setServerUrl(url: string): void {\r\n    this.serverUrl = url;\r\n  }\r\n}\r\n\r\nexport default Sender;\r\n\r\n","/**\r\n * 存储管理\r\n */\r\n\r\n/**\r\n * 存储接口\r\n */\r\ninterface StorageInterface {\r\n  getItem(key: string): string | null;\r\n  setItem(key: string, value: string): void;\r\n  removeItem(key: string): void;\r\n  clear(): void;\r\n}\r\n\r\n/**\r\n * LocalStorage存储\r\n */\r\nclass LocalStorage implements StorageInterface {\r\n  private storage: Storage | null = null;\r\n\r\n  constructor() {\r\n    if (typeof window !== 'undefined' && window.localStorage) {\r\n      try {\r\n        const test = '__tracker_test__';\r\n        window.localStorage.setItem(test, test);\r\n        window.localStorage.removeItem(test);\r\n        this.storage = window.localStorage;\r\n      } catch (e) {\r\n        // localStorage不可用\r\n      }\r\n    }\r\n  }\r\n\r\n  getItem(key: string): string | null {\r\n    if (!this.storage) {\r\n      return null;\r\n    }\r\n    try {\r\n      return this.storage.getItem(key);\r\n    } catch (e) {\r\n      return null;\r\n    }\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.setItem(key, value);\r\n    } catch (e) {\r\n      // 存储失败，可能是存储空间已满\r\n    }\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.removeItem(key);\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n\r\n  clear(): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.clear();\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * SessionStorage存储\r\n */\r\nclass SessionStorage implements StorageInterface {\r\n  private storage: Storage | null = null;\r\n\r\n  constructor() {\r\n    if (typeof window !== 'undefined' && window.sessionStorage) {\r\n      try {\r\n        const test = '__tracker_test__';\r\n        window.sessionStorage.setItem(test, test);\r\n        window.sessionStorage.removeItem(test);\r\n        this.storage = window.sessionStorage;\r\n      } catch (e) {\r\n        // sessionStorage不可用\r\n      }\r\n    }\r\n  }\r\n\r\n  getItem(key: string): string | null {\r\n    if (!this.storage) {\r\n      return null;\r\n    }\r\n    try {\r\n      return this.storage.getItem(key);\r\n    } catch (e) {\r\n      return null;\r\n    }\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.setItem(key, value);\r\n    } catch (e) {\r\n      // 存储失败\r\n    }\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.removeItem(key);\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n\r\n  clear(): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.clear();\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * 内存存储（降级方案）\r\n */\r\nclass MemoryStorage implements StorageInterface {\r\n  private data: Map<string, string> = new Map();\r\n\r\n  getItem(key: string): string | null {\r\n    return this.data.get(key) || null;\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    this.data.set(key, value);\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    this.data.delete(key);\r\n  }\r\n\r\n  clear(): void {\r\n    this.data.clear();\r\n  }\r\n}\r\n\r\n/**\r\n * IndexedDB存储（用于离线存储大量数据）\r\n */\r\nclass IndexedDBStorage {\r\n  private dbName = '__tracker_db__';\r\n  private storeName = '__tracker_store__';\r\n  private db: IDBDatabase | null = null;\r\n  private initPromise: Promise<boolean> | null = null;\r\n\r\n  async init(): Promise<boolean> {\r\n    // 如果已经初始化，直接返回\r\n    if (this.db) {\r\n      return true;\r\n    }\r\n\r\n    // 如果正在初始化，等待初始化完成\r\n    if (this.initPromise) {\r\n      return this.initPromise;\r\n    }\r\n\r\n    if (typeof window === 'undefined' || !window.indexedDB) {\r\n      return false;\r\n    }\r\n\r\n    // 开始初始化\r\n    this.initPromise = new Promise((resolve) => {\r\n      const request = indexedDB.open(this.dbName, 1);\r\n\r\n      request.onerror = () => {\r\n        this.initPromise = null;\r\n        resolve(false);\r\n      };\r\n\r\n      request.onsuccess = () => {\r\n        this.db = request.result;\r\n        this.initPromise = null;\r\n        resolve(true);\r\n      };\r\n\r\n      request.onupgradeneeded = (event) => {\r\n        const db = (event.target as IDBOpenDBRequest).result;\r\n        if (!db.objectStoreNames.contains(this.storeName)) {\r\n          const store = db.createObjectStore(this.storeName, { keyPath: 'id', autoIncrement: true });\r\n          store.createIndex('key', 'key', { unique: true });\r\n        }\r\n      };\r\n    });\r\n\r\n    return this.initPromise;\r\n  }\r\n\r\n  async getItem(key: string): Promise<string | null> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return null;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readonly');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction for get:', error);\r\n        resolve(null);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error in get:', transaction.error);\r\n        resolve(null);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted in get');\r\n        resolve(null);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const request = index.get(key);\r\n\r\n      request.onsuccess = () => {\r\n        const result = request.result;\r\n        resolve(result ? result.value : null);\r\n      };\r\n\r\n      request.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request:', request.error);\r\n        resolve(null);\r\n      };\r\n    });\r\n  }\r\n\r\n  async setItem(key: string, value: string): Promise<boolean> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return false;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readwrite');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction:', error);\r\n        resolve(false);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error:', transaction.error);\r\n        resolve(false);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted');\r\n        resolve(false);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const getRequest = index.get(key);\r\n\r\n      getRequest.onsuccess = () => {\r\n        const data: { key: string; value: string; updatedAt: number; id?: number } = { key, value, updatedAt: Date.now() };\r\n        let request: IDBRequest;\r\n\r\n        if (getRequest.result) {\r\n          data.id = (getRequest.result as { id: number }).id;\r\n          request = store.put(data);\r\n        } else {\r\n          request = store.add(data);\r\n        }\r\n\r\n        request.onsuccess = () => {\r\n          resolve(true);\r\n        };\r\n\r\n        request.onerror = () => {\r\n          console.error('IndexedDBStorage: Error in put/add request:', request.error);\r\n          resolve(false);\r\n        };\r\n      };\r\n\r\n      getRequest.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request:', getRequest.error);\r\n        resolve(false);\r\n      };\r\n    });\r\n  }\r\n\r\n  async removeItem(key: string): Promise<boolean> {\r\n    if (!this.db) {\r\n      return false;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readwrite');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction for remove:', error);\r\n        resolve(false);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error in remove:', transaction.error);\r\n        resolve(false);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted in remove');\r\n        resolve(false);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const request = index.get(key);\r\n\r\n      request.onsuccess = () => {\r\n        if (request.result) {\r\n          const deleteRequest = store.delete(request.result.id);\r\n          deleteRequest.onsuccess = () => resolve(true);\r\n          deleteRequest.onerror = () => {\r\n            console.error('IndexedDBStorage: Error in delete request:', deleteRequest.error);\r\n            resolve(false);\r\n          };\r\n        } else {\r\n          resolve(true); // 键不存在，视为成功\r\n        }\r\n      };\r\n\r\n      request.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request for remove:', request.error);\r\n        resolve(false);\r\n      };\r\n    });\r\n  }\r\n\r\n  async getAll(): Promise<Array<{ key: string; value: string }>> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return [];\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      const transaction = this.db!.transaction([this.storeName], 'readonly');\r\n      const store = transaction.objectStore(this.storeName);\r\n      const request = store.getAll();\r\n\r\n      request.onsuccess = () => {\r\n        const results = request.result.map((item: { key: string; value: string }) => ({\r\n          key: item.key,\r\n          value: item.value\r\n        }));\r\n        resolve(results);\r\n      };\r\n\r\n      request.onerror = () => {\r\n        resolve([]);\r\n      };\r\n    });\r\n  }\r\n}\r\n\r\nexport const localStorage = new LocalStorage();\r\nexport const sessionStorage = new SessionStorage();\r\nexport const memoryStorage = new MemoryStorage();\r\nexport const indexedDBStorage = new IndexedDBStorage();\r\n\r\n","/**\r\n * 离线存储\r\n */\r\nimport { indexedDBStorage } from '@/core/storage';\r\nimport type { TrackerEvent } from '@/types';\r\n\r\nclass OfflineStorage {\r\n  private storageKey = '__tracker_offline_events__';\r\n  private maxSize: number;\r\n  private useIndexedDB: boolean = true;\r\n  private memoryStorage: Map<string, TrackerEvent[]> = new Map();\r\n  private saveQueue: Promise<void> = Promise.resolve();\r\n\r\n  /**\r\n   * 构造函数\r\n   * @param maxSize 最大存储事件数量，默认1000\r\n   */\r\n  constructor(maxSize: number = 1000) {\r\n    if (maxSize <= 0) {\r\n      throw new Error('OfflineStorage: maxSize must be positive');\r\n    }\r\n    this.maxSize = maxSize;\r\n  }\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  async init(): Promise<void> {\r\n    const success = await indexedDBStorage.init();\r\n    if (!success) {\r\n      this.useIndexedDB = false;\r\n      console.warn('OfflineStorage: IndexedDB initialization failed, will use memory storage as fallback');\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 保存事件（使用队列确保并发安全）\r\n   */\r\n  async save(event: TrackerEvent): Promise<boolean> {\r\n    try {\r\n      // 将保存操作加入队列，确保串行执行\r\n      this.saveQueue = this.saveQueue.then(async () => {\r\n        await this.doSave(event);\r\n      }).catch(error => {\r\n        console.error('OfflineStorage: Error in save queue:', error);\r\n        // 重新抛出错误，让调用者能够感知\r\n        throw error;\r\n      });\r\n\r\n      await this.saveQueue;\r\n      return true;\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error saving event:', error);\r\n      // 即使保存失败，也尝试降级到内存存储\r\n      try {\r\n        const events = this.memoryStorage.get(this.storageKey) || [];\r\n        if (events.length >= this.maxSize) {\r\n          events.shift();\r\n        }\r\n        events.push(this.sanitizeEvent(event));\r\n        this.memoryStorage.set(this.storageKey, events);\r\n        return true;\r\n      } catch (fallbackError) {\r\n        console.error('OfflineStorage: Fallback storage also failed:', fallbackError);\r\n        return false;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 实际保存操作\r\n   */\r\n  private async doSave(event: TrackerEvent): Promise<void> {\r\n    try {\r\n      // 安全的JSON序列化，处理循环引用\r\n      const safeEvent = this.sanitizeEvent(event);\r\n      \r\n      const events = await this.getAll();\r\n      if (events.length >= this.maxSize) {\r\n        // 删除最旧的事件\r\n        events.shift();\r\n      }\r\n\r\n      events.push(safeEvent);\r\n\r\n      if (this.useIndexedDB) {\r\n        const data = this.safeStringify(events);\r\n        if (!data) {\r\n          throw new Error('Failed to stringify events');\r\n        }\r\n        \r\n        const success = await indexedDBStorage.setItem(this.storageKey, data);\r\n        if (!success) {\r\n          // 降级到内存存储\r\n          this.useIndexedDB = false;\r\n          this.memoryStorage.set(this.storageKey, events);\r\n        }\r\n      } else {\r\n        // 使用内存存储\r\n        this.memoryStorage.set(this.storageKey, events);\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error in doSave:', error);\r\n      // 降级到内存存储\r\n      if (this.useIndexedDB) {\r\n        this.useIndexedDB = false;\r\n        try {\r\n          const events = this.memoryStorage.get(this.storageKey) || [];\r\n          if (events.length >= this.maxSize) {\r\n            events.shift();\r\n          }\r\n          events.push(this.sanitizeEvent(event));\r\n          this.memoryStorage.set(this.storageKey, events);\r\n        } catch (e) {\r\n          throw e;\r\n        }\r\n      } else {\r\n        throw error;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清理事件对象，移除循环引用\r\n   */\r\n  private sanitizeEvent(event: TrackerEvent): TrackerEvent {\r\n    // 创建事件副本，移除可能的循环引用\r\n    const sanitized: TrackerEvent = {\r\n      ...event,\r\n      properties: event.properties ? this.sanitizeObject(event.properties) : undefined\r\n    };\r\n    return sanitized;\r\n  }\r\n\r\n  /**\r\n   * 清理对象，移除循环引用\r\n   */\r\n  private sanitizeObject(obj: Record<string, unknown>, visited = new WeakSet()): Record<string, unknown> {\r\n    if (typeof obj !== 'object' || obj === null) {\r\n      return obj;\r\n    }\r\n\r\n    if (visited.has(obj)) {\r\n      return {}; // 发现循环引用，返回空对象\r\n    }\r\n\r\n    visited.add(obj);\r\n    const result: Record<string, unknown> = {};\r\n\r\n    for (const [key, value] of Object.entries(obj)) {\r\n      if (typeof value === 'object' && value !== null) {\r\n        result[key] = this.sanitizeObject(value as Record<string, unknown>, visited);\r\n      } else {\r\n        result[key] = value;\r\n      }\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * 安全的JSON序列化，处理循环引用\r\n   */\r\n  private safeStringify(obj: unknown): string | null {\r\n    try {\r\n      return JSON.stringify(obj);\r\n    } catch (error) {\r\n      // 如果序列化失败，尝试清理循环引用后再次序列化\r\n      try {\r\n        if (typeof obj === 'object' && obj !== null) {\r\n          const sanitized = this.sanitizeObject(obj as Record<string, unknown>);\r\n          return JSON.stringify(sanitized);\r\n        }\r\n        return JSON.stringify(obj);\r\n      } catch (e) {\r\n        console.error('OfflineStorage: Failed to stringify after sanitization:', e);\r\n        return null;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取所有事件\r\n   */\r\n  async getAll(): Promise<TrackerEvent[]> {\r\n    try {\r\n      if (this.useIndexedDB) {\r\n        const data = await indexedDBStorage.getItem(this.storageKey);\r\n        if (!data) {\r\n          return [];\r\n        }\r\n        return JSON.parse(data) as TrackerEvent[];\r\n      } else {\r\n        // 使用内存存储\r\n        return this.memoryStorage.get(this.storageKey) || [];\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error getting events:', error);\r\n      // 降级到内存存储\r\n      if (this.useIndexedDB) {\r\n        this.useIndexedDB = false;\r\n        return this.memoryStorage.get(this.storageKey) || [];\r\n      }\r\n      return [];\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 删除事件\r\n   */\r\n  async remove(events: TrackerEvent[]): Promise<boolean> {\r\n    try {\r\n      const allEvents = await this.getAll();\r\n      const eventMap = new Map(events.map(e => [this.getEventKey(e), e]));\r\n\r\n      const remainingEvents = allEvents.filter(e => !eventMap.has(this.getEventKey(e)));\r\n\r\n      if (remainingEvents.length === 0) {\r\n        if (this.useIndexedDB) {\r\n          await indexedDBStorage.removeItem(this.storageKey);\r\n        } else {\r\n          this.memoryStorage.delete(this.storageKey);\r\n        }\r\n        return true;\r\n      }\r\n\r\n      if (this.useIndexedDB) {\r\n        const data = this.safeStringify(remainingEvents);\r\n        if (!data) {\r\n          throw new Error('Failed to stringify remaining events');\r\n        }\r\n        const success = await indexedDBStorage.setItem(this.storageKey, data);\r\n        if (!success) {\r\n          // 降级到内存存储\r\n          this.useIndexedDB = false;\r\n          this.memoryStorage.set(this.storageKey, remainingEvents);\r\n          return true;\r\n        }\r\n        return success;\r\n      } else {\r\n        this.memoryStorage.set(this.storageKey, remainingEvents);\r\n        return true;\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error removing events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清空所有事件\r\n   */\r\n  async clear(): Promise<boolean> {\r\n    try {\r\n      if (this.useIndexedDB) {\r\n        await indexedDBStorage.removeItem(this.storageKey);\r\n      } else {\r\n        this.memoryStorage.delete(this.storageKey);\r\n      }\r\n      return true;\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error clearing events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取事件数量\r\n   */\r\n  async getCount(): Promise<number> {\r\n    const events = await this.getAll();\r\n    return events.length;\r\n  }\r\n\r\n  /**\r\n   * 获取事件唯一标识\r\n   */\r\n  private getEventKey(event: TrackerEvent): string {\r\n    return `${event.type}-${event.name}-${event.timestamp}-${event.url}`;\r\n  }\r\n}\r\n\r\nexport default OfflineStorage;\r\n\r\n","/**\r\n * 批量发送器\r\n */\r\nimport type { TrackerEvent } from '@/types';\r\nimport Sender from './sender';\r\nimport OfflineStorage from './offline-storage';\r\n\r\ninterface BatchSenderOptions {\r\n  /** 批量大小 */\r\n  batchSize?: number;\r\n  /** 批量等待时间（毫秒） */\r\n  batchWait?: number;\r\n  /** 是否启用离线存储 */\r\n  enableOfflineStorage?: boolean;\r\n  /** 离线存储最大事件数量 */\r\n  maxOfflineStorageSize?: number;\r\n}\r\n\r\ninterface AddEventOptions {\r\n  /** 批量发送完成回调 */\r\n  onBatchComplete?: (events: TrackerEvent[], success: boolean) => void;\r\n}\r\n\r\nclass BatchSender {\r\n  private sender: Sender;\r\n  private offlineStorage: OfflineStorage;\r\n  private queue: TrackerEvent[] = [];\r\n  private timer: ReturnType<typeof setTimeout> | null = null;\r\n  private batchSize: number;\r\n  private batchWait: number;\r\n  private enableOfflineStorage: boolean;\r\n  private isProcessing: boolean = false;\r\n  private isInitialized: boolean = false;\r\n  private initPromise: Promise<void> | null = null;\r\n  private eventCallbacks: Map<TrackerEvent, AddEventOptions> = new Map();\r\n\r\n  constructor(serverUrl: string, options: BatchSenderOptions = {}) {\r\n    this.sender = new Sender(serverUrl);\r\n    this.offlineStorage = new OfflineStorage(options.maxOfflineStorageSize ?? 1000);\r\n    this.batchSize = options.batchSize || 10;\r\n    this.batchWait = options.batchWait || 5000;\r\n    this.enableOfflineStorage = options.enableOfflineStorage ?? true;\r\n\r\n    // 异步初始化，但不阻塞构造函数\r\n    this.initPromise = this.init();\r\n  }\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  private async init(): Promise<void> {\r\n    if (this.enableOfflineStorage) {\r\n      await this.offlineStorage.init();\r\n      // 尝试发送离线存储的事件\r\n      this.flushOfflineEvents();\r\n    }\r\n    this.isInitialized = true;\r\n  }\r\n\r\n  /**\r\n   * 确保初始化完成\r\n   */\r\n  private async ensureInitialized(): Promise<void> {\r\n    if (!this.isInitialized && this.initPromise) {\r\n      await this.initPromise;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 添加事件到队列\r\n   */\r\n  add(event: TrackerEvent, options?: AddEventOptions): void {\r\n    this.queue.push(event);\r\n    \r\n    // 保存事件回调\r\n    if (options?.onBatchComplete) {\r\n      this.eventCallbacks.set(event, options);\r\n    }\r\n\r\n    // 如果达到批量大小，立即发送\r\n    if (this.queue.length >= this.batchSize) {\r\n      this.flush();\r\n      return;\r\n    }\r\n\r\n    // 设置定时器\r\n    if (!this.timer) {\r\n      this.timer = setTimeout(() => {\r\n        this.flush();\r\n      }, this.batchWait);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 添加事件到队列（异步版本，确保初始化完成）\r\n   */\r\n  async addAsync(event: TrackerEvent): Promise<void> {\r\n    await this.ensureInitialized();\r\n    this.add(event);\r\n  }\r\n\r\n  /**\r\n   * 立即发送队列中的所有事件\r\n   */\r\n  async flush(): Promise<void> {\r\n    // 如果正在处理或队列为空，直接返回\r\n    if (this.isProcessing || this.queue.length === 0) {\r\n      return;\r\n    }\r\n\r\n    // 确保初始化完成\r\n    await this.ensureInitialized();\r\n\r\n    // 设置处理标志，防止并发\r\n    this.isProcessing = true;\r\n\r\n    if (this.timer) {\r\n      clearTimeout(this.timer);\r\n      this.timer = null;\r\n    }\r\n\r\n    // 在设置isProcessing后立即复制队列，避免在复制过程中有新事件加入\r\n    // 这样即使有新事件在复制后加入，也会在下次flush时处理\r\n    const events = [...this.queue];\r\n    this.queue = [];\r\n    \r\n    // 收集所有事件的回调\r\n    // 使用回调函数作为 key，将相同回调的事件分组\r\n    const callbackMap = new Map<(events: TrackerEvent[], success: boolean) => void, TrackerEvent[]>();\r\n    \r\n    events.forEach(event => {\r\n      const options = this.eventCallbacks.get(event);\r\n      if (options?.onBatchComplete) {\r\n        const callback = options.onBatchComplete;\r\n        if (!callbackMap.has(callback)) {\r\n          callbackMap.set(callback, []);\r\n        }\r\n        callbackMap.get(callback)!.push(event);\r\n      }\r\n      this.eventCallbacks.delete(event);\r\n    });\r\n\r\n    try {\r\n      const success = await this.sender.sendBatch(events);\r\n\r\n      if (!success && this.enableOfflineStorage) {\r\n        // 发送失败，保存到离线存储\r\n        for (const event of events) {\r\n          await this.offlineStorage.save(event);\r\n        }\r\n      }\r\n      \r\n      // 批量发送完成后，调用所有回调\r\n      callbackMap.forEach((callbackEvents, callback) => {\r\n        try {\r\n          callback(callbackEvents, success);\r\n        } catch (error) {\r\n          console.error('BatchSender: Error in batch complete callback:', error);\r\n        }\r\n      });\r\n    } catch (error) {\r\n      console.error('BatchSender: Error flushing events:', error);\r\n      // 发送失败，保存到离线存储\r\n      if (this.enableOfflineStorage) {\r\n        for (const event of events) {\r\n          await this.offlineStorage.save(event);\r\n        }\r\n      }\r\n      \r\n      // 即使发送失败，也调用回调（success为false）\r\n      callbackMap.forEach((callbackEvents, callback) => {\r\n        try {\r\n          callback(callbackEvents, false);\r\n        } catch (err) {\r\n          console.error('BatchSender: Error in batch complete callback:', err);\r\n        }\r\n      });\r\n    } finally {\r\n      this.isProcessing = false;\r\n      \r\n      // 如果处理过程中有新事件加入队列，再次触发flush\r\n      if (this.queue.length > 0) {\r\n        // 使用setTimeout避免递归调用栈溢出\r\n        setTimeout(() => {\r\n          this.flush().catch(error => {\r\n            console.error('BatchSender: Error in recursive flush:', error);\r\n          });\r\n        }, 0);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 发送离线存储的事件\r\n   */\r\n  private async flushOfflineEvents(): Promise<void> {\r\n    try {\r\n      const events = await this.offlineStorage.getAll();\r\n      if (events.length === 0) {\r\n        return;\r\n      }\r\n\r\n      // 分批发送\r\n      const batchSize = this.batchSize;\r\n      for (let i = 0; i < events.length; i += batchSize) {\r\n        const batch = events.slice(i, i + batchSize);\r\n        const success = await this.sender.sendBatch(batch);\r\n\r\n        if (success) {\r\n          // 发送成功，从离线存储中删除\r\n          await this.offlineStorage.remove(batch);\r\n        } else {\r\n          // 发送失败，停止尝试，等待下次\r\n          break;\r\n        }\r\n      }\r\n    } catch (error) {\r\n      console.error('BatchSender: Error flushing offline events:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 更新服务器地址\r\n   */\r\n  setServerUrl(url: string): void {\r\n    this.sender.setServerUrl(url);\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的所有事件\r\n   */\r\n  async getOfflineEvents(): Promise<TrackerEvent[]> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.getAll();\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的事件数量\r\n   */\r\n  async getOfflineEventCount(): Promise<number> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.getCount();\r\n  }\r\n\r\n  /**\r\n   * 清空离线存储\r\n   */\r\n  async clearOfflineStorage(): Promise<boolean> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.clear();\r\n  }\r\n\r\n  /**\r\n   * 销毁（同步版本，不等待异步操作完成）\r\n   */\r\n  destroy(): void {\r\n    if (this.timer) {\r\n      clearTimeout(this.timer);\r\n      this.timer = null;\r\n    }\r\n    // 注意：flush是异步的，但destroy是同步的\r\n    // 在页面卸载时，浏览器可能会中断异步操作\r\n    // 如果需要确保事件发送完成，应该调用destroyAsync\r\n    this.flush().catch(error => {\r\n      console.error('BatchSender: Error during destroy flush:', error);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 异步销毁（等待所有事件发送完成）\r\n   */\r\n  async destroyAsync(): Promise<void> {\r\n    if (this.timer) {\r\n      clearTimeout(this.timer);\r\n      this.timer = null;\r\n    }\r\n    // 等待剩余事件发送完成\r\n    await this.flush();\r\n  }\r\n}\r\n\r\nexport default BatchSender;\r\n\r\n","/**\r\n * 插件管理器\r\n */\r\nimport type { TrackerPlugin, TrackerInstance } from '@/types';\r\n\r\nclass PluginManager {\r\n  private plugins: Map<string, TrackerPlugin> = new Map();\r\n  private trackerInstance: TrackerInstance | null = null;\r\n\r\n  /**\r\n   * 设置Tracker实例\r\n   */\r\n  setTrackerInstance(instance: TrackerInstance): void {\r\n    this.trackerInstance = instance;\r\n  }\r\n\r\n  /**\r\n   * 安装插件\r\n   */\r\n  use(plugin: TrackerPlugin): void {\r\n    if (this.plugins.has(plugin.name)) {\r\n      console.warn(`PluginManager: Plugin \"${plugin.name}\" is already installed`);\r\n      return;\r\n    }\r\n\r\n    if (!this.trackerInstance) {\r\n      console.error('PluginManager: Tracker instance is not set');\r\n      return;\r\n    }\r\n\r\n    try {\r\n      plugin.install(this.trackerInstance);\r\n      this.plugins.set(plugin.name, plugin);\r\n    } catch (error) {\r\n      console.error(`PluginManager: Error installing plugin \"${plugin.name}\":`, error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 卸载插件\r\n   */\r\n  unuse(pluginName: string): void {\r\n    const plugin = this.plugins.get(pluginName);\r\n    if (!plugin) {\r\n      return;\r\n    }\r\n\r\n    if (plugin.uninstall && this.trackerInstance) {\r\n      try {\r\n        plugin.uninstall(this.trackerInstance);\r\n      } catch (error) {\r\n        console.error(`PluginManager: Error uninstalling plugin \"${pluginName}\":`, error);\r\n      }\r\n    }\r\n\r\n    this.plugins.delete(pluginName);\r\n  }\r\n\r\n  /**\r\n   * 获取插件\r\n   */\r\n  get(pluginName: string): TrackerPlugin | undefined {\r\n    return this.plugins.get(pluginName);\r\n  }\r\n\r\n  /**\r\n   * 获取所有插件\r\n   */\r\n  getAll(): TrackerPlugin[] {\r\n    return Array.from(this.plugins.values());\r\n  }\r\n\r\n  /**\r\n   * 清空所有插件\r\n   */\r\n  clear(): void {\r\n    for (const pluginName of this.plugins.keys()) {\r\n      this.unuse(pluginName);\r\n    }\r\n  }\r\n}\r\n\r\nexport default PluginManager;\r\n\r\n","/**\r\n * 用户行为分析\r\n */\r\nimport type { PageViewEvent } from '@/types';\r\n\r\nexport interface BehaviorMetrics {\r\n  /** 页面浏览量 */\r\n  pv: number;\r\n  /** 独立访客数 */\r\n  uv: number;\r\n  /** 会话数 */\r\n  sessions: number;\r\n  /** 平均停留时长 */\r\n  avgDuration: number;\r\n  /** 访问路径 */\r\n  paths: string[];\r\n}\r\n\r\nclass BehaviorAnalysis {\r\n  private pageViews: PageViewEvent[] = [];\r\n  private startTime: number = Date.now();\r\n\r\n  constructor() {\r\n    // deviceId和sessionId在getMetrics中从事件中获取，不需要单独存储\r\n  }\r\n\r\n  /**\r\n   * 分析页面浏览事件\r\n   */\r\n  analyzePageView(event: PageViewEvent): void {\r\n    this.pageViews.push(event);\r\n  }\r\n\r\n  /**\r\n   * 获取行为指标\r\n   */\r\n  getMetrics(): BehaviorMetrics {\r\n    const uniqueDevices = new Set<string>();\r\n    const uniqueSessions = new Set<string>();\r\n    let totalDuration = 0;\r\n    const paths: string[] = [];\r\n\r\n    this.pageViews.forEach(event => {\r\n      if (event.deviceId) {\r\n        uniqueDevices.add(event.deviceId);\r\n      }\r\n      if (event.sessionId) {\r\n        uniqueSessions.add(event.sessionId);\r\n      }\r\n      if (event.duration) {\r\n        totalDuration += event.duration;\r\n      }\r\n      paths.push(event.url);\r\n    });\r\n\r\n    return {\r\n      pv: this.pageViews.length,\r\n      uv: uniqueDevices.size,\r\n      sessions: uniqueSessions.size,\r\n      avgDuration: this.pageViews.length > 0 ? totalDuration / this.pageViews.length : 0,\r\n      paths\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 获取访问路径\r\n   */\r\n  getVisitPath(): string[] {\r\n    return this.pageViews.map(event => event.url);\r\n  }\r\n\r\n  /**\r\n   * 获取停留时长\r\n   */\r\n  getDuration(): number {\r\n    return Date.now() - this.startTime;\r\n  }\r\n\r\n  /**\r\n   * 重置\r\n   */\r\n  reset(): void {\r\n    this.pageViews = [];\r\n    this.startTime = Date.now();\r\n  }\r\n}\r\n\r\nexport default BehaviorAnalysis;\r\n\r\n","/**\r\n * 会话回放\r\n */\r\nimport { throttle } from '@/core/utils';\r\n\r\nexport interface DOMSnapshot {\r\n  timestamp: number;\r\n  html: string;\r\n  mutations: MutationRecord[];\r\n}\r\n\r\nexport interface UserInteraction {\r\n  type: 'click' | 'input' | 'scroll' | 'mousemove';\r\n  timestamp: number;\r\n  data: Record<string, unknown>;\r\n}\r\n\r\nclass SessionReplay {\r\n  private snapshots: DOMSnapshot[] = [];\r\n  private interactions: UserInteraction[] = [];\r\n  private observer: MutationObserver | null = null;\r\n  private isRecording: boolean = false;\r\n  private maxSnapshots: number = 1000;\r\n  private mutationHandler: ((mutations: MutationRecord[]) => void) | null = null;\r\n  private throttledMouseMoveHandler: EventListener | null = null;\r\n\r\n  /**\r\n   * 开始录制\r\n   */\r\n  start(): void {\r\n    if (this.isRecording || typeof document === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    this.isRecording = true;\r\n\r\n    // 初始快照\r\n    this.takeSnapshot();\r\n\r\n    // 创建节流的mutation处理器\r\n    this.mutationHandler = throttle((...args: unknown[]) => {\r\n      const mutations = args[0] as MutationRecord[];\r\n      this.recordMutations(mutations);\r\n    }, 100);\r\n\r\n    // 监听DOM变化\r\n    this.observer = new MutationObserver(this.mutationHandler);\r\n\r\n    this.observer.observe(document.body, {\r\n      childList: true,\r\n      subtree: true,\r\n      attributes: true,\r\n      attributeOldValue: true,\r\n      characterData: true\r\n    });\r\n\r\n    // 监听用户交互\r\n    this.setupInteractionListeners();\r\n  }\r\n\r\n  /**\r\n   * 停止录制\r\n   */\r\n  stop(): void {\r\n    if (!this.isRecording) {\r\n      return;\r\n    }\r\n\r\n    this.isRecording = false;\r\n\r\n    if (this.observer) {\r\n      this.observer.disconnect();\r\n      this.observer = null;\r\n    }\r\n\r\n    this.removeInteractionListeners();\r\n  }\r\n\r\n  /**\r\n   * 拍摄快照\r\n   */\r\n  private takeSnapshot(): void {\r\n    if (this.snapshots.length >= this.maxSnapshots) {\r\n      // 删除最旧的快照\r\n      this.snapshots.shift();\r\n    }\r\n\r\n    try {\r\n      const snapshot: DOMSnapshot = {\r\n        timestamp: Date.now(),\r\n        html: document.documentElement.outerHTML,\r\n        mutations: []\r\n      };\r\n\r\n      this.snapshots.push(snapshot);\r\n    } catch (error) {\r\n      console.error('SessionReplay: Error taking snapshot:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 记录DOM变化\r\n   */\r\n  private recordMutations(mutations: MutationRecord[]): void {\r\n    if (this.snapshots.length === 0) {\r\n      return;\r\n    }\r\n\r\n    const lastSnapshot = this.snapshots[this.snapshots.length - 1];\r\n    lastSnapshot.mutations.push(...mutations);\r\n  }\r\n\r\n  /**\r\n   * 设置交互监听器\r\n   */\r\n  private setupInteractionListeners(): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    // 点击事件\r\n    document.addEventListener('click', this.handleClick, true);\r\n    // 输入事件\r\n    document.addEventListener('input', this.handleInput, true);\r\n    // 滚动事件\r\n    window.addEventListener('scroll', this.handleScroll, { passive: true });\r\n    // 鼠标移动事件（节流）\r\n    this.throttledMouseMoveHandler = throttle((...args: unknown[]) => {\r\n      const event = args[0] as MouseEvent;\r\n      this.handleMouseMove(event);\r\n    }, 100) as EventListener;\r\n    document.addEventListener('mousemove', this.throttledMouseMoveHandler, { passive: true });\r\n  }\r\n\r\n  /**\r\n   * 移除交互监听器\r\n   */\r\n  private removeInteractionListeners(): void {\r\n    if (typeof document === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    document.removeEventListener('click', this.handleClick, true);\r\n    document.removeEventListener('input', this.handleInput, true);\r\n    window.removeEventListener('scroll', this.handleScroll, { passive: true } as AddEventListenerOptions);\r\n    \r\n    // 移除鼠标移动事件监听器\r\n    if (this.throttledMouseMoveHandler) {\r\n      document.removeEventListener('mousemove', this.throttledMouseMoveHandler, { passive: true } as AddEventListenerOptions);\r\n      this.throttledMouseMoveHandler = null;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理点击事件\r\n   */\r\n  private handleClick = (event: MouseEvent): void => {\r\n    this.recordInteraction({\r\n      type: 'click',\r\n      timestamp: Date.now(),\r\n      data: {\r\n        x: event.clientX,\r\n        y: event.clientY,\r\n        target: (event.target as Element)?.tagName\r\n      }\r\n    });\r\n  };\r\n\r\n  /**\r\n   * 处理输入事件\r\n   */\r\n  private handleInput = (event: Event): void => {\r\n    const target = event.target as HTMLInputElement | HTMLTextAreaElement;\r\n    if (!target) {\r\n      return;\r\n    }\r\n\r\n    this.recordInteraction({\r\n      type: 'input',\r\n      timestamp: Date.now(),\r\n      data: {\r\n        tagName: target.tagName,\r\n        value: target.value.substring(0, 100) // 限制长度\r\n      }\r\n    });\r\n  };\r\n\r\n  /**\r\n   * 处理滚动事件\r\n   */\r\n  private handleScroll = (): void => {\r\n    this.recordInteraction({\r\n      type: 'scroll',\r\n      timestamp: Date.now(),\r\n      data: {\r\n        scrollX: window.scrollX,\r\n        scrollY: window.scrollY\r\n      }\r\n    });\r\n  };\r\n\r\n  /**\r\n   * 处理鼠标移动事件\r\n   */\r\n  private handleMouseMove = (event: MouseEvent): void => {\r\n    this.recordInteraction({\r\n      type: 'mousemove',\r\n      timestamp: Date.now(),\r\n      data: {\r\n        x: event.clientX,\r\n        y: event.clientY\r\n      }\r\n    });\r\n  };\r\n\r\n  /**\r\n   * 记录交互\r\n   */\r\n  private recordInteraction(interaction: UserInteraction): void {\r\n    if (this.interactions.length >= this.maxSnapshots) {\r\n      this.interactions.shift();\r\n    }\r\n    this.interactions.push(interaction);\r\n  }\r\n\r\n  /**\r\n   * 获取录制数据\r\n   */\r\n  getData(): {\r\n    snapshots: DOMSnapshot[];\r\n    interactions: UserInteraction[];\r\n  } {\r\n    return {\r\n      snapshots: [...this.snapshots],\r\n      interactions: [...this.interactions]\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 清空录制数据\r\n   */\r\n  clear(): void {\r\n    this.snapshots = [];\r\n    this.interactions = [];\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    this.stop();\r\n    this.clear();\r\n  }\r\n}\r\n\r\nexport default SessionReplay;\r\n\r\n","/**\r\n * 网络请求拦截插件\r\n * 自动拦截所有 fetch 和 XMLHttpRequest 请求，记录请求和响应信息\r\n */\r\nimport type { TrackerPlugin, TrackerInstance, CustomEvent } from '@/types';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\n/**\r\n * 网络拦截器配置选项\r\n */\r\nexport interface NetworkInterceptorOptions {\r\n  /** 是否启用插件（默认 true） */\r\n  enabled?: boolean;\r\n  /** 是否记录请求体（默认 true） */\r\n  recordRequestBody?: boolean;\r\n  /** 是否记录响应体（默认 true） */\r\n  recordResponseBody?: boolean;\r\n  /** 最大响应体大小（字节，默认 100KB） */\r\n  maxResponseBodySize?: number;\r\n  /** 最大请求体大小（字节，默认 100KB） */\r\n  maxRequestBodySize?: number;\r\n  /** URL 过滤规则（支持字符串、正则表达式、函数） */\r\n  urlFilter?: string | RegExp | ((url: string) => boolean);\r\n  /** 是否只记录失败的请求（默认 false，记录所有请求） */\r\n  onlyFailedRequests?: boolean;\r\n  /** 敏感字段过滤（不记录这些字段的值） */\r\n  sensitiveFields?: string[];\r\n}\r\n\r\n/**\r\n * 默认配置\r\n */\r\nconst DEFAULT_OPTIONS: Required<Omit<NetworkInterceptorOptions, 'urlFilter' | 'sensitiveFields'>> & {\r\n  urlFilter?: NetworkInterceptorOptions['urlFilter'];\r\n  sensitiveFields?: string[];\r\n} = {\r\n  enabled: true,\r\n  recordRequestBody: true,\r\n  recordResponseBody: true,\r\n  maxResponseBodySize: 100 * 1024, // 100KB\r\n  maxRequestBodySize: 100 * 1024, // 100KB\r\n  onlyFailedRequests: false\r\n};\r\n\r\n/**\r\n * 检查URL是否应该被记录\r\n */\r\nfunction shouldRecordUrl(url: string, filter?: NetworkInterceptorOptions['urlFilter']): boolean {\r\n  if (!filter) {\r\n    return true;\r\n  }\r\n\r\n  if (typeof filter === 'string') {\r\n    return url.includes(filter);\r\n  }\r\n\r\n  if (filter instanceof RegExp) {\r\n    return filter.test(url);\r\n  }\r\n\r\n  if (typeof filter === 'function') {\r\n    return filter(url);\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\n/**\r\n * 过滤敏感字段\r\n */\r\nfunction filterSensitiveFields(data: unknown, sensitiveFields: string[]): unknown {\r\n  if (!data || typeof data !== 'object' || sensitiveFields.length === 0) {\r\n    return data;\r\n  }\r\n\r\n  if (Array.isArray(data)) {\r\n    return data.map(item => filterSensitiveFields(item, sensitiveFields));\r\n  }\r\n\r\n  const filtered: Record<string, unknown> = {};\r\n  for (const [key, value] of Object.entries(data as Record<string, unknown>)) {\r\n    const lowerKey = key.toLowerCase();\r\n    const isSensitive = sensitiveFields.some(field => lowerKey.includes(field.toLowerCase()));\r\n\r\n    if (isSensitive) {\r\n      filtered[key] = '[FILTERED]';\r\n    } else if (typeof value === 'object' && value !== null) {\r\n      filtered[key] = filterSensitiveFields(value, sensitiveFields);\r\n    } else {\r\n      filtered[key] = value;\r\n    }\r\n  }\r\n\r\n  return filtered;\r\n}\r\n\r\n/**\r\n * 读取请求体\r\n */\r\nasync function readRequestBody(\r\n  body: BodyInit | null | undefined,\r\n  maxSize: number,\r\n  recordBody: boolean\r\n): Promise<unknown> {\r\n  if (!body || !recordBody) {\r\n    return undefined;\r\n  }\r\n\r\n  try {\r\n    if (typeof body === 'string') {\r\n      if (body.length > maxSize) {\r\n        return body.substring(0, maxSize) + '...[TRUNCATED]';\r\n      }\r\n      return body;\r\n    }\r\n\r\n    if (body instanceof FormData) {\r\n      const formData: Record<string, unknown> = {};\r\n      for (const [key, value] of body.entries()) {\r\n        if (value instanceof File) {\r\n          formData[key] = `[File: ${value.name}, ${value.size} bytes]`;\r\n        } else {\r\n          formData[key] = value;\r\n        }\r\n      }\r\n      return formData;\r\n    }\r\n\r\n    if (body instanceof URLSearchParams) {\r\n      return Object.fromEntries(body.entries());\r\n    }\r\n\r\n    if (body instanceof Blob) {\r\n      if (body.size > maxSize) {\r\n        return `[Blob: ${body.size} bytes, type: ${body.type}]`;\r\n      }\r\n      // Blob.text() 不会修改原始 Blob，可以安全读取\r\n      try {\r\n        return await body.text();\r\n      } catch {\r\n        return `[Blob: ${body.size} bytes, type: ${body.type}]`;\r\n      }\r\n    }\r\n\r\n    if (body instanceof ArrayBuffer) {\r\n      if (body.byteLength > maxSize) {\r\n        return `[ArrayBuffer: ${body.byteLength} bytes]`;\r\n      }\r\n      return new TextDecoder().decode(body);\r\n    }\r\n\r\n    // 其他类型（如 ReadableStream）不读取\r\n    return '[Unsupported body type]';\r\n  } catch (error) {\r\n    console.warn('NetworkInterceptor: Failed to read request body:', error);\r\n    return '[Error reading body]';\r\n  }\r\n}\r\n\r\n/**\r\n * 读取响应体\r\n */\r\nasync function readResponseBody(\r\n  response: Response | XMLHttpRequest,\r\n  maxSize: number,\r\n  recordBody: boolean\r\n): Promise<unknown> {\r\n  if (!recordBody) {\r\n    return undefined;\r\n  }\r\n\r\n  try {\r\n    if (response instanceof Response) {\r\n      // 检查 Content-Length\r\n      const contentLength = response.headers.get('content-length');\r\n      if (contentLength && parseInt(contentLength, 10) > maxSize) {\r\n        return `[Response too large: ${contentLength} bytes]`;\r\n      }\r\n\r\n      // Clone 响应以便读取（响应体只能读取一次）\r\n      // 注意：如果响应体已经被读取过，clone() 会失败\r\n      let clonedResponse: Response;\r\n      try {\r\n        clonedResponse = response.clone();\r\n      } catch (error) {\r\n        // 如果 clone 失败（响应体已被读取），只返回基本信息\r\n        return '[Response body already consumed]';\r\n      }\r\n\r\n      const contentType = response.headers.get('content-type') || '';\r\n\r\n      if (contentType.includes('application/json')) {\r\n        const text = await clonedResponse.text();\r\n        if (text.length > maxSize) {\r\n          return text.substring(0, maxSize) + '...[TRUNCATED]';\r\n        }\r\n        try {\r\n          return JSON.parse(text);\r\n        } catch {\r\n          return text;\r\n        }\r\n      } else if (contentType.includes('text/')) {\r\n        const text = await clonedResponse.text();\r\n        if (text.length > maxSize) {\r\n          return text.substring(0, maxSize) + '...[TRUNCATED]';\r\n        }\r\n        return text;\r\n      } else {\r\n        // 二进制或其他类型，只记录大小和类型\r\n        try {\r\n          const blob = await clonedResponse.blob();\r\n          return `[${contentType || 'unknown'}: ${blob.size} bytes]`;\r\n        } catch {\r\n          return `[${contentType || 'unknown'}: unable to read]`;\r\n        }\r\n      }\r\n    } else {\r\n      // XMLHttpRequest\r\n      const xhr = response as XMLHttpRequest;\r\n      const responseText = xhr.responseText || '';\r\n      if (responseText.length > maxSize) {\r\n        return responseText.substring(0, maxSize) + '...[TRUNCATED]';\r\n      }\r\n\r\n      let contentType = '';\r\n      try {\r\n        contentType = xhr.getResponseHeader('content-type') || '';\r\n      } catch {\r\n        // 跨域请求可能无法读取响应头\r\n      }\r\n      \r\n      if (contentType.includes('application/json')) {\r\n        try {\r\n          return JSON.parse(responseText);\r\n        } catch {\r\n          return responseText;\r\n        }\r\n      }\r\n\r\n      return responseText;\r\n    }\r\n  } catch (error) {\r\n    console.warn('NetworkInterceptor: Failed to read response body:', error);\r\n    return '[Error reading response]';\r\n  }\r\n}\r\n\r\n/**\r\n * 创建网络拦截器插件\r\n */\r\nexport function createNetworkInterceptorPlugin(\r\n  options: NetworkInterceptorOptions = {}\r\n): TrackerPlugin {\r\n  const config = { ...DEFAULT_OPTIONS, ...options };\r\n  let originalFetch: typeof fetch | null = null;\r\n  let originalXHROpen: typeof XMLHttpRequest.prototype.open | null = null;\r\n  let originalXHRSend: typeof XMLHttpRequest.prototype.send | null = null;\r\n  let originalXHRSetRequestHeader: typeof XMLHttpRequest.prototype.setRequestHeader | null = null;\r\n\r\n  // 存储请求信息（用于关联请求和响应）\r\n  const requestMap = new Map<string, {\r\n    url: string;\r\n    method: string;\r\n    headers: Record<string, string>;\r\n    startTime: number;\r\n    requestBody?: unknown;\r\n  }>();\r\n\r\n  return {\r\n    name: 'network-interceptor',\r\n    install(trackerInstance: TrackerInstance) {\r\n      if (!config.enabled || typeof window === 'undefined') {\r\n        return;\r\n      }\r\n\r\n      // 拦截 fetch\r\n      if (typeof window.fetch !== 'undefined') {\r\n        originalFetch = window.fetch;\r\n        window.fetch = async function(input: RequestInfo | URL, init?: RequestInit): Promise<Response> {\r\n          const url = typeof input === 'string' ? input : input instanceof URL ? input.href : input.url;\r\n          // 优先使用 init?.method，然后是 Request 对象的 method，最后默认 GET\r\n          const method = init?.method || (typeof input !== 'string' && !(input instanceof URL) && 'method' in input ? input.method : undefined) || 'GET';\r\n\r\n          // 检查是否应该记录\r\n          if (!shouldRecordUrl(url, config.urlFilter)) {\r\n            return originalFetch!.call(this, input, init);\r\n          }\r\n\r\n          const requestId = `${Date.now()}-${Math.random().toString(36).substring(2, 9)}`;\r\n          const startTime = Date.now();\r\n          const headers: Record<string, string> = {};\r\n\r\n          // 读取请求头（合并 Request 对象和 init 的 headers）\r\n          if (typeof input !== 'string' && !(input instanceof URL) && 'headers' in input && input.headers instanceof Headers) {\r\n            input.headers.forEach((value, key) => {\r\n              headers[key] = value;\r\n            });\r\n          }\r\n          if (init?.headers) {\r\n            if (init.headers instanceof Headers) {\r\n              init.headers.forEach((value, key) => {\r\n                headers[key] = value;\r\n              });\r\n            } else if (Array.isArray(init.headers)) {\r\n              init.headers.forEach(([key, value]) => {\r\n                headers[key] = value;\r\n              });\r\n            } else {\r\n              Object.assign(headers, init.headers);\r\n            }\r\n          }\r\n\r\n          // 读取请求体（优先使用 init?.body，然后是 Request 对象的 body）\r\n          // 注意：如果 body 是 ReadableStream，读取会消耗流，所以需要 clone\r\n          let requestBody: unknown;\r\n          if (config.recordRequestBody) {\r\n            // 优先使用 init?.body，如果不存在且 input 是 Request 对象，使用 input.body\r\n            const bodyToRead = init?.body ?? (typeof input !== 'string' && !(input instanceof URL) && 'body' in input ? input.body : null);\r\n            requestBody = await readRequestBody(bodyToRead, config.maxRequestBodySize, config.recordRequestBody);\r\n            if (config.sensitiveFields && config.sensitiveFields.length > 0 && requestBody !== undefined) {\r\n              // 如果 requestBody 是 JSON 字符串，先解析\r\n              if (typeof requestBody === 'string') {\r\n                try {\r\n                  const parsed = JSON.parse(requestBody);\r\n                  requestBody = filterSensitiveFields(parsed, config.sensitiveFields);\r\n                } catch {\r\n                  // 不是 JSON，直接过滤字符串（虽然字符串通常不需要过滤）\r\n                  requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n                }\r\n              } else {\r\n                requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n              }\r\n            }\r\n          }\r\n\r\n          // 存储请求信息\r\n          requestMap.set(requestId, {\r\n            url,\r\n            method,\r\n            headers,\r\n            startTime,\r\n            requestBody\r\n          });\r\n\r\n          // 发送 api-request 事件\r\n          const requestEvent: CustomEvent = {\r\n            type: 'custom',\r\n            name: 'custom',\r\n            eventName: 'api-request',\r\n            timestamp: startTime,\r\n            url: getCurrentUrl(),\r\n            title: getPageTitle(),\r\n            properties: {\r\n              url: url.split('?')[0].split('#')[0], // 只记录路径，不记录查询参数和 hash\r\n              fullUrl: url,\r\n              method,\r\n              headers: config.sensitiveFields && config.sensitiveFields.length > 0\r\n                ? filterSensitiveFields(headers, config.sensitiveFields)\r\n                : headers,\r\n              body: requestBody,\r\n              timestamp: startTime\r\n            }\r\n          };\r\n          trackerInstance.send(requestEvent);\r\n\r\n          try {\r\n            // 执行原始请求\r\n            const response = await originalFetch!.call(this, input, init);\r\n            const endTime = Date.now();\r\n            const duration = endTime - startTime;\r\n            const statusCode = response.status;\r\n            const success = response.ok;\r\n\r\n            // 检查是否只记录失败的请求\r\n            if (config.onlyFailedRequests && success) {\r\n              requestMap.delete(requestId);\r\n              return response;\r\n            }\r\n\r\n            // 读取响应体\r\n            let responseBody: unknown;\r\n            if (config.recordResponseBody) {\r\n              responseBody = await readResponseBody(response, config.maxResponseBodySize, config.recordResponseBody);\r\n              if (config.sensitiveFields && config.sensitiveFields.length > 0 && responseBody !== undefined) {\r\n                // responseBody 应该已经是解析后的对象（readResponseBody 会解析 JSON）\r\n                responseBody = filterSensitiveFields(responseBody, config.sensitiveFields);\r\n              }\r\n            }\r\n\r\n            // 获取响应大小\r\n            const contentLength = response.headers.get('content-length');\r\n            const responseSize = contentLength ? parseInt(contentLength, 10) : undefined;\r\n\r\n            // 发送 api-response 事件\r\n            const responseEvent: CustomEvent = {\r\n              type: 'custom',\r\n              name: 'custom',\r\n              eventName: 'api-response',\r\n              timestamp: endTime,\r\n              url: getCurrentUrl(),\r\n              title: getPageTitle(),\r\n              properties: {\r\n                url: url.split('?')[0].split('#')[0],\r\n                fullUrl: url,\r\n                method,\r\n                statusCode,\r\n                duration,\r\n                responseSize,\r\n                success,\r\n                body: responseBody,\r\n                timestamp: endTime\r\n              }\r\n            };\r\n            trackerInstance.send(responseEvent);\r\n\r\n            requestMap.delete(requestId);\r\n            return response;\r\n          } catch (error) {\r\n            const endTime = Date.now();\r\n            const duration = endTime - startTime;\r\n\r\n            // 发送错误响应事件\r\n            const errorResponseEvent: CustomEvent = {\r\n              type: 'custom',\r\n              name: 'custom',\r\n              eventName: 'api-response',\r\n              timestamp: endTime,\r\n              url: getCurrentUrl(),\r\n              title: getPageTitle(),\r\n              properties: {\r\n                url: url.split('?')[0].split('#')[0],\r\n                fullUrl: url,\r\n                method,\r\n                statusCode: 0,\r\n                duration,\r\n                success: false,\r\n                error: error instanceof Error ? error.message : String(error),\r\n                timestamp: endTime\r\n              }\r\n            };\r\n            trackerInstance.send(errorResponseEvent);\r\n\r\n            requestMap.delete(requestId);\r\n            throw error;\r\n          }\r\n        };\r\n      }\r\n\r\n      // 拦截 XMLHttpRequest\r\n      if (typeof XMLHttpRequest !== 'undefined') {\r\n        originalXHROpen = XMLHttpRequest.prototype.open;\r\n        originalXHRSend = XMLHttpRequest.prototype.send;\r\n        originalXHRSetRequestHeader = XMLHttpRequest.prototype.setRequestHeader;\r\n\r\n        const xhrHeaders = new WeakMap<XMLHttpRequest, Record<string, string>>();\r\n        const xhrRequestInfo = new WeakMap<XMLHttpRequest, {\r\n          url: string;\r\n          method: string;\r\n          startTime: number;\r\n          requestBody?: unknown;\r\n        }>();\r\n\r\n        XMLHttpRequest.prototype.open = function(\r\n          method: string,\r\n          url: string | URL,\r\n          async?: boolean,\r\n          username?: string | null,\r\n          password?: string | null\r\n        ): void {\r\n          const urlString = typeof url === 'string' ? url : url.href;\r\n          xhrRequestInfo.set(this, {\r\n            url: urlString,\r\n            method: method.toUpperCase(),\r\n            startTime: Date.now()\r\n          });\r\n          xhrHeaders.set(this, {});\r\n          // 保持原始的 async 参数，如果未提供则默认为 true（异步）\r\n          return originalXHROpen!.call(this, method, url, async !== undefined ? async : true, username, password);\r\n        };\r\n\r\n        XMLHttpRequest.prototype.setRequestHeader = function(name: string, value: string): void {\r\n          const headers = xhrHeaders.get(this) || {};\r\n          headers[name] = value;\r\n          xhrHeaders.set(this, headers);\r\n          return originalXHRSetRequestHeader!.call(this, name, value);\r\n        };\r\n\r\n        XMLHttpRequest.prototype.send = function(body?: Document | XMLHttpRequestBodyInit | null): void {\r\n          const requestInfo = xhrRequestInfo.get(this);\r\n          if (!requestInfo) {\r\n            return originalXHRSend!.call(this, body);\r\n          }\r\n\r\n          const { url, method, startTime } = requestInfo;\r\n          const headers = xhrHeaders.get(this) || {};\r\n\r\n          // 检查是否应该记录\r\n          if (!shouldRecordUrl(url, config.urlFilter)) {\r\n            return originalXHRSend!.call(this, body);\r\n          }\r\n\r\n          // 读取请求体\r\n          let requestBody: unknown;\r\n          if (config.recordRequestBody && body) {\r\n            if (typeof body === 'string') {\r\n              requestBody = body.length > config.maxRequestBodySize\r\n                ? body.substring(0, config.maxRequestBodySize) + '...[TRUNCATED]'\r\n                : body;\r\n            } else if (body instanceof FormData) {\r\n              const formData: Record<string, unknown> = {};\r\n              for (const [key, value] of body.entries()) {\r\n                if (value instanceof File) {\r\n                  formData[key] = `[File: ${value.name}, ${value.size} bytes]`;\r\n                } else {\r\n                  formData[key] = value;\r\n                }\r\n              }\r\n              requestBody = formData;\r\n            } else if (body instanceof Blob) {\r\n              requestBody = body.size > config.maxRequestBodySize\r\n                ? `[Blob: ${body.size} bytes, type: ${body.type}]`\r\n                : '[Blob]';\r\n            } else {\r\n              requestBody = '[Unsupported body type]';\r\n            }\r\n\r\n            if (config.sensitiveFields && config.sensitiveFields.length > 0) {\r\n              requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n            }\r\n          }\r\n\r\n          requestInfo.requestBody = requestBody;\r\n\r\n          // 发送 api-request 事件\r\n          const requestEvent: CustomEvent = {\r\n            type: 'custom',\r\n            name: 'custom',\r\n            eventName: 'api-request',\r\n            timestamp: startTime,\r\n            url: getCurrentUrl(),\r\n            title: getPageTitle(),\r\n            properties: {\r\n              url: url.split('?')[0].split('#')[0],\r\n              fullUrl: url,\r\n              method,\r\n              headers: config.sensitiveFields && config.sensitiveFields.length > 0\r\n                ? filterSensitiveFields(headers, config.sensitiveFields)\r\n                : headers,\r\n              body: requestBody,\r\n              timestamp: startTime\r\n            }\r\n          };\r\n          trackerInstance.send(requestEvent);\r\n\r\n          // 监听响应（使用箭头函数保存 this 上下文）\r\n          const readystatechangeHandler = () => {\r\n            if (this.readyState === XMLHttpRequest.DONE) {\r\n              const endTime = Date.now();\r\n              const duration = endTime - startTime;\r\n              const statusCode = this.status;\r\n              // 注意：statusCode 为 0 通常表示网络错误或请求被取消\r\n              const success = statusCode >= 200 && statusCode < 400;\r\n\r\n              // 检查是否只记录失败的请求\r\n              if (config.onlyFailedRequests && success) {\r\n                this.removeEventListener('readystatechange', readystatechangeHandler);\r\n                xhrRequestInfo.delete(this);\r\n                xhrHeaders.delete(this);\r\n                return;\r\n              }\r\n\r\n              // 读取响应体（XMLHttpRequest 是同步的）\r\n              let responseText = '';\r\n              try {\r\n                responseText = this.responseText || '';\r\n              } catch (error) {\r\n                // 某些情况下访问 responseText 可能失败（如跨域错误）\r\n                console.warn('NetworkInterceptor: Failed to read XHR responseText:', error);\r\n              }\r\n              \r\n              const responseSize = responseText.length;\r\n              let responseBody: unknown;\r\n              \r\n              if (config.recordResponseBody) {\r\n                if (responseText.length > config.maxResponseBodySize) {\r\n                  responseBody = responseText.substring(0, config.maxResponseBodySize) + '...[TRUNCATED]';\r\n                } else {\r\n                  let contentType = '';\r\n                  try {\r\n                    contentType = this.getResponseHeader('content-type') || '';\r\n                  } catch {\r\n                    // 跨域请求可能无法读取响应头\r\n                  }\r\n                  if (contentType.includes('application/json')) {\r\n                    try {\r\n                      responseBody = JSON.parse(responseText);\r\n                    } catch {\r\n                      responseBody = responseText;\r\n                    }\r\n                  } else {\r\n                    responseBody = responseText;\r\n                  }\r\n                }\r\n                if (config.sensitiveFields && config.sensitiveFields.length > 0) {\r\n                  responseBody = filterSensitiveFields(responseBody, config.sensitiveFields);\r\n                }\r\n              }\r\n\r\n              // 发送 api-response 事件\r\n              const responseEvent: CustomEvent = {\r\n                type: 'custom',\r\n                name: 'custom',\r\n                eventName: 'api-response',\r\n                timestamp: endTime,\r\n                url: getCurrentUrl(),\r\n                title: getPageTitle(),\r\n                properties: {\r\n                  url: url.split('?')[0].split('#')[0],\r\n                  fullUrl: url,\r\n                  method,\r\n                  statusCode,\r\n                  duration,\r\n                  responseSize,\r\n                  success,\r\n                  body: responseBody,\r\n                  timestamp: endTime\r\n                }\r\n              };\r\n              trackerInstance.send(responseEvent);\r\n\r\n              // 清理：移除事件监听器和 WeakMap 中的数据\r\n              this.removeEventListener('readystatechange', readystatechangeHandler);\r\n              xhrRequestInfo.delete(this);\r\n              xhrHeaders.delete(this);\r\n            }\r\n          };\r\n          this.addEventListener('readystatechange', readystatechangeHandler);\r\n\r\n          return originalXHRSend!.call(this, body);\r\n        };\r\n      }\r\n    },\r\n    uninstall() {\r\n      if (typeof window === 'undefined') {\r\n        return;\r\n      }\r\n\r\n      // 恢复原始 fetch\r\n      if (originalFetch) {\r\n        window.fetch = originalFetch;\r\n        originalFetch = null;\r\n      }\r\n\r\n      // 恢复原始 XMLHttpRequest\r\n      if (originalXHROpen && originalXHRSend && originalXHRSetRequestHeader) {\r\n        XMLHttpRequest.prototype.open = originalXHROpen;\r\n        XMLHttpRequest.prototype.send = originalXHRSend;\r\n        XMLHttpRequest.prototype.setRequestHeader = originalXHRSetRequestHeader;\r\n        originalXHROpen = null;\r\n        originalXHRSend = null;\r\n        originalXHRSetRequestHeader = null;\r\n      }\r\n\r\n      // 清空请求映射\r\n      requestMap.clear();\r\n    }\r\n  };\r\n}\r\n\r\n/**\r\n * 默认的网络拦截器插件实例\r\n */\r\nexport const networkInterceptorPlugin = createNetworkInterceptorPlugin();\r\n","/**\r\n * Tracker主类\r\n */\r\nimport type { TrackerConfig, TrackerEvent, TrackerPlugin, UserInfo, ErrorEvent } from '@/types';\r\nimport ConfigManager from '@/core/config';\r\nimport { eventBus } from '@/core/event-bus';\r\nimport { getDeviceId, getSessionId, getCurrentUrl, getPageTitle } from '@/core/utils';\r\nimport AutoTracker from '@/collector/auto-tracker';\r\nimport ErrorTracker from '@/collector/error-tracker';\r\nimport PerformanceTracker from '@/collector/performance-tracker';\r\nimport CustomTracker from '@/collector/custom-tracker';\r\nimport DataProcessor from '@/processor/data-processor';\r\nimport BatchSender from '@/transport/batch-sender';\r\nimport PluginManager from '@/extension/plugin-manager';\r\nimport BehaviorAnalysis, { type BehaviorMetrics } from '@/extension/behavior-analysis';\r\nimport SessionReplay, { type DOMSnapshot, type UserInteraction } from '@/extension/session-replay';\r\n\r\nclass Tracker {\r\n  private config: ConfigManager;\r\n  private autoTracker: AutoTracker | null = null;\r\n  private errorTracker: ErrorTracker | null = null;\r\n  private performanceTracker: PerformanceTracker | null = null;\r\n  private customTracker: CustomTracker;\r\n  private dataProcessor: DataProcessor;\r\n  private batchSender: BatchSender;\r\n  private pluginManager: PluginManager;\r\n  private behaviorAnalysis: BehaviorAnalysis;\r\n  private sessionReplay: SessionReplay | null = null;\r\n  private userInfo: UserInfo | null = null;\r\n  private deviceId: string;\r\n  private sessionId: string;\r\n\r\n  constructor(config: TrackerConfig) {\r\n    // 验证配置\r\n    if (!config.appId) {\r\n      throw new Error('Tracker: appId is required');\r\n    }\r\n\r\n    this.config = new ConfigManager(config);\r\n    this.deviceId = config.deviceId || getDeviceId();\r\n    this.sessionId = getSessionId();\r\n\r\n    // 初始化组件\r\n    this.customTracker = new CustomTracker();\r\n    this.dataProcessor = new DataProcessor();\r\n    \r\n    // 如果提供了serverUrl，初始化BatchSender；否则使用占位URL，仅保存到离线存储\r\n    const serverUrl = config.serverUrl || 'about:blank';\r\n    this.batchSender = new BatchSender(serverUrl, {\r\n      batchSize: this.config.get('batchSize'),\r\n      batchWait: this.config.get('batchWait'),\r\n      enableOfflineStorage: this.config.get('enableOfflineStorage') ?? true, // 未设置serverUrl时强制启用离线存储\r\n      maxOfflineStorageSize: this.config.get('maxOfflineStorageSize')\r\n    });\r\n    \r\n    // 如果未设置serverUrl，禁用实际上报，仅保存到离线存储\r\n    if (!config.serverUrl) {\r\n      this.batchSender.setServerUrl(''); // 设置为空字符串，发送时会跳过网络请求\r\n    }\r\n    this.pluginManager = new PluginManager();\r\n    this.behaviorAnalysis = new BehaviorAnalysis();\r\n\r\n    // 设置插件管理器的Tracker实例\r\n    this.pluginManager.setTrackerInstance({\r\n      send: this.send.bind(this),\r\n      getConfig: () => this.config.getAll(),\r\n      setUser: this.setUser.bind(this),\r\n      getUser: () => this.userInfo\r\n    });\r\n\r\n    // 初始化功能模块\r\n    this.init();\r\n\r\n    // 设置全局事件总线（用于采集器触发事件）\r\n    if (typeof window !== 'undefined') {\r\n      (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus = {\r\n        emit: (event: string, data: unknown) => {\r\n          eventBus.emit(event, data);\r\n        }\r\n      };\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  private init(): void {\r\n    // 自动埋点\r\n    if (this.config.get('enableAutoTrack')) {\r\n      this.autoTracker = new AutoTracker();\r\n      this.autoTracker.init();\r\n      this.setupAutoTrackListeners();\r\n    }\r\n\r\n    // 错误监控\r\n    if (this.config.get('enableErrorTrack')) {\r\n      this.errorTracker = new ErrorTracker();\r\n      this.errorTracker.init();\r\n    }\r\n\r\n    // 性能监控\r\n    if (this.config.get('enablePerformanceTrack')) {\r\n      this.performanceTracker = new PerformanceTracker();\r\n      this.performanceTracker.init();\r\n    }\r\n\r\n    // 会话回放\r\n    if (this.config.get('enableSessionReplay')) {\r\n      this.sessionReplay = new SessionReplay();\r\n      this.sessionReplay.start();\r\n    }\r\n\r\n    // 设置用户信息\r\n    if (this.config.get('userId')) {\r\n      this.setUser({ userId: this.config.get('userId') });\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 设置自动埋点监听器\r\n   */\r\n  private setupAutoTrackListeners(): void {\r\n    // 页面浏览\r\n    eventBus.on('pageview', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n\r\n    // 点击事件\r\n    eventBus.on('click', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n\r\n    // 曝光事件\r\n    eventBus.on('exposure', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n\r\n    // 输入事件\r\n    eventBus.on('input', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n\r\n    // 错误事件\r\n    eventBus.on('error', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n\r\n    // 性能事件\r\n    eventBus.on('performance', (event: unknown) => {\r\n      this.send(event as TrackerEvent);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 发送事件\r\n   */\r\n  send(event: TrackerEvent): void {\r\n    try {\r\n      // 添加公共属性\r\n      const enrichedEvent = this.enrichEvent(event);\r\n\r\n      // 数据处理器处理\r\n      const processedEvent = this.dataProcessor.process(enrichedEvent, {\r\n        sampleRate: this.config.get('sampleRate'),\r\n        enableDeduplication: true,\r\n        isCritical: event.type === 'error'\r\n      });\r\n\r\n      if (!processedEvent) {\r\n        return;\r\n      }\r\n\r\n      // 执行beforeSend钩子\r\n      const beforeSend = this.config.get('beforeSend');\r\n      if (beforeSend) {\r\n        const result = beforeSend(processedEvent);\r\n        if (result === false || result === null) {\r\n          return; // 取消发送\r\n        }\r\n        if (result) {\r\n          Object.assign(processedEvent, result);\r\n        }\r\n      }\r\n\r\n      // 添加到批量发送队列\r\n      // 注意：afterSend钩子将在批量发送完成后统一调用，而不是每个事件单独调用\r\n      // 这样可以减少钩子调用次数，降低日志输出\r\n      this.batchSender.add(processedEvent, {\r\n        onBatchComplete: (events: TrackerEvent[], success: boolean) => {\r\n          // 批量发送完成后，为每个事件调用afterSend钩子\r\n          // 虽然仍然为每个事件调用，但只在批量发送完成后调用一次，而不是立即调用\r\n          const afterSend = this.config.get('afterSend');\r\n          if (afterSend) {\r\n            events.forEach(event => {\r\n              setTimeout(() => {\r\n                afterSend(event, success);\r\n              }, 0);\r\n            });\r\n          }\r\n        }\r\n      });\r\n\r\n      // 行为分析\r\n      if (event.type === 'pageview') {\r\n        this.behaviorAnalysis.analyzePageView(processedEvent as typeof processedEvent & { type: 'pageview' });\r\n      }\r\n    } catch (error) {\r\n      const onError = this.config.get('onError');\r\n      if (onError) {\r\n        onError(error as Error);\r\n      } else {\r\n        console.error('Tracker: Error sending event:', error);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 丰富事件数据\r\n   */\r\n  private enrichEvent(event: TrackerEvent): TrackerEvent {\r\n    const userId = event.userId || this.userInfo?.userId || this.config.get('userId');\r\n    const customProperties = this.config.get('customProperties') || {};\r\n    const eventProperties = event.properties || {};\r\n    \r\n    // 合并properties\r\n    const mergedProperties = {\r\n      ...customProperties,\r\n      ...eventProperties\r\n    };\r\n    \r\n    // 如果properties为空对象，设置为undefined\r\n    const finalProperties = Object.keys(mergedProperties).length > 0 ? mergedProperties : undefined;\r\n    \r\n    const enriched: TrackerEvent = {\r\n      ...event,\r\n      deviceId: event.deviceId || this.deviceId,\r\n      sessionId: event.sessionId || this.sessionId\r\n    };\r\n    \r\n    // 如果userId为空字符串，设置为undefined；否则设置userId\r\n    if (userId && userId !== '') {\r\n      enriched.userId = userId;\r\n    }\r\n    \r\n    // 如果properties不为空，才添加到事件中\r\n    if (finalProperties) {\r\n      enriched.properties = finalProperties;\r\n    }\r\n    \r\n    return enriched;\r\n  }\r\n\r\n  /**\r\n   * 追踪自定义事件\r\n   */\r\n  track(eventName: string, properties?: Record<string, unknown>): void {\r\n    const event = this.customTracker.track(eventName, properties);\r\n    this.send(event);\r\n  }\r\n\r\n  /**\r\n   * 设置用户信息\r\n   */\r\n  setUser(user: UserInfo): void {\r\n    this.userInfo = { ...this.userInfo, ...user };\r\n    this.config.set('userId', user.userId || '');\r\n  }\r\n\r\n  /**\r\n   * 获取用户信息\r\n   */\r\n  getUser(): UserInfo | null {\r\n    return this.userInfo;\r\n  }\r\n\r\n  /**\r\n   * 手动上报错误\r\n   */\r\n  trackError(error: Error | string, errorInfo?: Record<string, unknown>): void {\r\n    if (this.errorTracker) {\r\n      // 通过errorTracker触发，会自动通过eventBus发送\r\n      this.errorTracker.trackError(error, errorInfo);\r\n    } else {\r\n      // 如果errorTracker未启用，直接发送错误事件\r\n      const errorEvent: ErrorEvent = {\r\n        type: 'error',\r\n        name: 'custom-error',\r\n        timestamp: Date.now(),\r\n        url: getCurrentUrl(),\r\n        title: getPageTitle(),\r\n        errorType: 'js',\r\n        message: error instanceof Error ? error.message : error,\r\n        stack: error instanceof Error ? error.stack : undefined,\r\n        properties: errorInfo\r\n      };\r\n      this.send(errorEvent);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 手动上报性能\r\n   */\r\n  trackPerformance(): void {\r\n    if (this.performanceTracker) {\r\n      const event = this.performanceTracker.collectMetrics();\r\n      if (event) {\r\n        this.send(event);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 页面浏览追踪\r\n   */\r\n  trackPageView(): void {\r\n    if (this.autoTracker) {\r\n      const event = this.autoTracker.getViewTracker().trackPageView();\r\n      this.send(event);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 使用插件\r\n   */\r\n  use(plugin: TrackerPlugin): void {\r\n    this.pluginManager.use(plugin);\r\n  }\r\n\r\n  /**\r\n   * 更新配置\r\n   */\r\n  updateConfig(config: Partial<TrackerConfig>): void {\r\n    this.config.update(config);\r\n\r\n    // 更新服务器地址\r\n    if (config.serverUrl !== undefined) {\r\n      if (config.serverUrl) {\r\n        this.batchSender.setServerUrl(config.serverUrl);\r\n      } else {\r\n        // 如果设置为空，禁用实际上报\r\n        this.batchSender.setServerUrl('');\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取配置\r\n   */\r\n  getConfig(): TrackerConfig {\r\n    return this.config.getAll();\r\n  }\r\n\r\n  /**\r\n   * 获取行为分析数据\r\n   */\r\n  getBehaviorMetrics(): BehaviorMetrics {\r\n    return this.behaviorAnalysis.getMetrics();\r\n  }\r\n\r\n  /**\r\n   * 获取会话回放数据\r\n   */\r\n  getSessionReplayData(): { snapshots: DOMSnapshot[]; interactions: UserInteraction[] } | undefined {\r\n    return this.sessionReplay?.getData();\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的所有事件\r\n   */\r\n  async getOfflineEvents(): Promise<TrackerEvent[]> {\r\n    return this.batchSender.getOfflineEvents();\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的事件数量\r\n   */\r\n  async getOfflineEventCount(): Promise<number> {\r\n    return this.batchSender.getOfflineEventCount();\r\n  }\r\n\r\n  /**\r\n   * 清空离线存储\r\n   */\r\n  async clearOfflineStorage(): Promise<boolean> {\r\n    return this.batchSender.clearOfflineStorage();\r\n  }\r\n\r\n  /**\r\n   * 获取自动追踪器实例\r\n   * 如果未启用自动埋点，返回null\r\n   */\r\n  getAutoTracker(): AutoTracker | null {\r\n    return this.autoTracker;\r\n  }\r\n\r\n  /**\r\n   * 销毁（同步版本）\r\n   */\r\n  destroy(): void {\r\n    this.autoTracker?.destroy();\r\n    this.errorTracker?.destroy();\r\n    this.performanceTracker?.destroy();\r\n    this.sessionReplay?.destroy();\r\n    this.batchSender.destroy(); // 注意：这是异步的，但不会阻塞\r\n    this.pluginManager.clear();\r\n    eventBus.clear();\r\n  }\r\n\r\n  /**\r\n   * 异步销毁（等待所有事件发送完成）\r\n   */\r\n  async destroyAsync(): Promise<void> {\r\n    this.autoTracker?.destroy();\r\n    this.errorTracker?.destroy();\r\n    this.performanceTracker?.destroy();\r\n    this.sessionReplay?.destroy();\r\n    await this.batchSender.destroyAsync(); // 等待事件发送完成\r\n    this.pluginManager.clear();\r\n    eventBus.clear();\r\n  }\r\n}\r\n\r\nexport default Tracker;\r\n\r\n"],"names":["defaultConfig","appId","serverUrl","enableAutoTrack","enableErrorTrack","enablePerformanceTrack","enableSessionReplay","batchSize","batchWait","sampleRate","enableOfflineStorage","maxOfflineStorageSize","maxRetries","userId","deviceId","customProperties","ConfigManager","constructor","config","__publicField","this","get","key","getAll","set","value","update","updates","eventBus","Map","on","event","callback","events","has","push","off","delete","callbacks","index","indexOf","splice","emit","args","forEach","error","console","once","wrapper","clear","generateId","Date","now","Math","random","toString","substring","getCurrentUrl","window","location","href","getPageTitle","document","title","debounce","func","wait","timeout","clearTimeout","setTimeout","throttle","previous","remaining","deepClone","obj","getTime","Array","map","item","clonedObj","Object","prototype","hasOwnProperty","call","getElementPath","element","path","nodeType","Node","ELEMENT_NODE","selector","nodeName","toLowerCase","id","unshift","className","classes","trim","split","filter","cls","length","join","sibling","nth","previousElementSibling","parentElement","getElementInfo","tagName","text","_a","textContent","ViewTracker","init","trackPageView","setupSPARouter","setupPageLifecycle","isTracking","type","name","timestamp","url","currentUrl","referrer","shouldUpdateUrl","lastPageViewTime","minPageViewInterval","visibleDuration","startTime","totalHiddenTime","duration","__trackerEventBus","popstateHandler","addEventListener","historyProto","history","_trackerPushStateWrapped","originalPushState","pushState","bind","_originalPushState","self","result","apply","pendingUrlCheck","_trackerReplaceStateWrapped","originalReplaceState","replaceState","_originalReplaceState","visibilityChangeHandler","isHidden","hidden","isVisible","hiddenStartTime","beforeUnloadHandler","finalDuration","finalEvent","destroy","removeEventListener","ClickTracker","debounceTime","clickHandler","handleClick","touchStartHandler","handleTouch","touchEndHandler","passive","capture","touches","touch","lastTouch","x","clientX","y","clientY","time","changedTouches","endTouch","deltaX","abs","deltaY","TOUCH_CLICK_THRESHOLD","TOUCH_DISTANCE_THRESHOLD","touchTimeout","processTouchInteraction","target","position","processTouch","elementPath","elementInfo","touchEvent","interactionType","requestIdleCallback","processClick","clickEvent","getClickEvent","ExposureTracker","options","Set","threshold","root","rootMargin","IntersectionObserver","observer","entry","handleIntersection","observeElements","initScrollFallback","elements","querySelectorAll","observe","cachedElements","from","lastCacheUpdate","includes","unobserve","exposedElements","exposureMap","intersectionRatio","isIntersecting","add","triggerExposure","exposureEvent","getExposureElements","CACHE_UPDATE_INTERVAL","checkExposure","rect","getBoundingClientRect","viewportHeight","innerHeight","documentElement","clientHeight","viewportWidth","innerWidth","clientWidth","visibleArea","min","bottom","max","top","right","left","totalArea","height","width","scrollFallbackHandler","resizeFallbackHandler","disconnect","InputTracker","skipEmptyInput","inputDebounceTime","selectDebounceTime","inputHandler","handleInput","changeHandler","handleChange","processInput","placeholder","isSensitive","isSensitiveField","valueLength","inputType","inputEvent","processChange","selectElement","HTMLInputElement","_b","keyword","sensitiveKeywords","_c","_d","AutoTracker","viewTracker","clickTracker","exposureTracker","inputTracker","enabled","enableClick","enableExposure","enableInput","clickDebounceTime","getViewTracker","getClickTracker","getExposureTracker","getInputTracker","ErrorTracker","unifiedErrorHandler","ErrorEvent","handleJSError","handleResourceError","handlers","promiseErrorHandler","handlePromiseError","errorEvent","filename","errorType","message","stack","lineno","colno","emitError","reason","Error","JSON","stringify","resourceUrl","HTMLImageElement","HTMLScriptElement","src","HTMLLinkElement","HTMLAudioElement","HTMLVideoElement","resourceType","getErrorKey","parts","String","errorKey","lastTime","errorCache","cleanExpiredErrorCache","entries","trackError","errorInfo","properties","e","handler","PerformanceTracker","performance","readyState","collectNavigationTiming","collectResourceTiming","observeLongTasks","navigationTimingCollected","timing","getEntriesByType","metrics","dns","domainLookupEnd","domainLookupStart","tcp","connectEnd","connectStart","ssl","secureConnectionStart","ttfb","responseStart","requestStart","response","responseEnd","domParse","domInteractive","resourceLoad","loadEventStart","domContentLoadedEventEnd","total","loadEventEnd","fetchStart","domContentLoaded","load","performanceEvent","metricType","emitPerformance","resources","resource","resourceCache","resourceDebounceTime","request","size","transferSize","initiatorType","cleanExpiredResourceCache","PerformanceObserver","throttledEmitLongTask","taskKey","longTaskCache","longTaskDebounceTime","cleanExpiredLongTaskCache","list","getEntries","entryType","entryTypes","collectMetrics","CustomTracker","track","eventName","Sampler","shouldSample","shouldSampleCritical","isCritical","Deduplicator","click","exposure","pageview","input","custom","isDuplicate","getEventKey","eventCache","cacheTimeout","cacheTimeouts","defaultCacheTimeout","cleanExpiredCache","tolerance","floor","valueStr","valueHash","simpleHash","props","apiUrl","method","fullUrl","propsStr","keys","timeWindow","str","hash","i","charCodeAt","expireTime","values","zero$1","buf","len","LITERALS$1","L_CODES$1","D_CODES$1","MAX_BITS$1","extra_lbits","Uint8Array","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","_dist_code","_length_code","MAX_MATCH$1","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","max_code","d_code","dist","put_short","s","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","c","tree","bi_reverse","code","res","gen_codes","bl_count","next_code","bits","n","init_block","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","sym_next","matches","bi_windup","smaller","m","depth","_n2","_m2","pqdownheap","k","v","heap","j","heap_len","compress_block","ltree","dtree","lc","extra","sx","sym_buf","build_tree","desc","stree","node","heap_max","base","h","xbits","f","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","count","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block$1","stored_len","last","subarray","trees","_tr_init","LENGTH_CODES$1","tr_static_init","l_desc","d_desc","bl_desc","_tr_stored_block","_tr_flush_block","opt_lenb","static_lenb","max_blindex","level","strm","data_type","block_mask","detect_data_type","BL_CODES$1","build_bl_tree","strategy","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","sym_end","_tr_align","STATIC_TREES","bi_flush","adler32_1","adler","pos","s1","s2","crcTable","Uint32Array","table","makeTable","crc32_1","crc","t","end","messages","constants$2","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","Z_NO_FLUSH$2","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_DEFAULT_STRATEGY$1","Z_DEFLATED$2","MAX_MATCH","MIN_LOOKAHEAD","INIT_STATE","BUSY_STATE","FINISH_STATE","err","errorCode","msg","zero","slide_hash","p","wsize","w_size","hash_size","head","prev","HASH","data","hash_shift","hash_mask","flush_pending","state","avail_out","output","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","b","putShortMSB","read_buf","start","avail_in","next_in","wrap","total_in","longest_match","cur_match","match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","limit","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","_w_size","more","window_size","insert","ins_h","deflate_stored","flush","have","min_block","pending_buf_size","used","high_water","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","configuration_table","DeflateState","status","gzhead","gzindex","last_flush","w_bits","hash_bits","Uint16Array","HEAP_SIZE","MAX_BITS","lit_bufsize","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateInit2","windowBits","memLevel","deflate_1$2","deflateInit","deflateSetHeader","deflate","old_flush","header","level_flags","hcrc","comment","os","beg","copy","gzhead_extra","val","bstate","deflate_huff","deflate_rle","deflateEnd","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","deflateInfo","_has","common","sources","slice","arguments","source","shift","TypeError","chunks","l","chunk","STR_APPLY_UIA_OK","fromCharCode","__","_utf8len","q","strings","TextEncoder","encode","c2","m_pos","str_len","buf_len","TextDecoder","decode","out","utf16buf","c_len","buf2binstring","zstream","toString$1","Z_NO_FLUSH$1","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFLATED$1","Deflate$1","chunkSize","opt","raw","gzip","ended","dict","_dict_set","deflate$1","deflator","flush_mode","_flush_mode","onData","onEnd","deflate_1$1","Deflate","deflateRaw","BAD$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","from_source","lencode","distcode","lenbits","distbits","dolen","mode","sane","MAXBITS","lbase","lext","dbase","dext","inftrees","lens","lens_index","codes","table_index","work","opts","incr","fill","low","mask","sym","curr","drop","huff","offs","here_bits","here_op","here_val","Z_FINISH$1","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","HEAD","DICT","TYPE","TYPEDO","COPY_","LEN_","LEN","CHECK","BAD","zswap32","InflateState","havedict","flags","check","wbits","offset","ncode","nlen","ndist","lendyn","distdyn","back","was","inflateStateCheck","inflateResetKeep","Int32Array","inflateReset","inflateReset2","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","inflate_1$2","inflateInit","inflate","put","last_bits","last_op","last_val","hbuf","order","inf_leave","done","xflags","extra_len","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflateInfo","gzheader","Inflate$1","to","inflate$1","inflator","last_avail_out","next_out_utf8","tail","utf8str","inflate_1$1","Inflate","inflateRaw","ungzip","pako","constants","Compressor","compress","compressed","btoa","binaryString","Buffer","decompress","compressedData","binaryData","atob","buffer","shouldCompress","DataProcessor","sampler","deduplicator","compressor","process","enableDeduplication","enableCompression","processedEvent","propertiesStr","compressedProperties","processBatch","serialize","deserialize","parse","getAbortController","AbortController","AbortSignalPolyfill","abort","aborted","signal","async","fetchPolyfill","Promise","resolve","reject","xhr","XMLHttpRequest","open","headers","Headers","setRequestHeader","DOMException","onload","headersString","getAllResponseHeaders","line","responseHeaders","responseText","responseUrl","responseURL","responseStatus","ok","statusText","redirected","body","bodyUsed","arrayBuffer","ArrayBuffer","blob","Blob","formData","FormData","json","clone","onerror","ontimeout","send","browserRequest","controller","timeoutId","fetchFn","fetch","getFetch","contentType","versions","nodeFetchFn","nodeFetch","import","default","nodeRequest","post","RetryHandler","execute","fn","initialDelay","maxDelay","shouldRetry","lastError","delay","attempt","sleep","ms","isRetryableError","Sender","retryHandler","enableRetry","sendBatch","setServerUrl","localStorage","test","setItem","removeItem","storage","getItem","sessionStorage","memoryStorage","indexedDBStorage","db","initPromise","indexedDB","dbName","onsuccess","onupgradeneeded","objectStoreNames","contains","storeName","createObjectStore","keyPath","autoIncrement","createIndex","unique","transaction","onabort","objectStore","store","getRequest","updatedAt","deleteRequest","results","OfflineStorage","maxSize","useIndexedDB","warn","save","saveQueue","then","doSave","catch","storageKey","sanitizeEvent","fallbackError","safeEvent","safeStringify","sanitizeObject","visited","WeakSet","sanitized","remove","allEvents","eventMap","remainingEvents","success","getCount","BatchSender","sender","offlineStorage","flushOfflineEvents","isInitialized","ensureInitialized","queue","onBatchComplete","eventCallbacks","timer","addAsync","isProcessing","callbackMap","callbackEvents","batch","getOfflineEvents","getOfflineEventCount","clearOfflineStorage","destroyAsync","PluginManager","setTrackerInstance","instance","trackerInstance","use","plugin","plugins","install","unuse","pluginName","uninstall","BehaviorAnalysis","analyzePageView","pageViews","getMetrics","uniqueDevices","uniqueSessions","totalDuration","paths","sessionId","pv","uv","sessions","avgDuration","getVisitPath","getDuration","reset","SessionReplay","recordInteraction","scrollX","scrollY","isRecording","takeSnapshot","mutationHandler","mutations","recordMutations","MutationObserver","childList","subtree","attributes","attributeOldValue","characterData","setupInteractionListeners","stop","removeInteractionListeners","snapshots","maxSnapshots","snapshot","html","outerHTML","handleScroll","throttledMouseMoveHandler","handleMouseMove","interaction","interactions","getData","DEFAULT_OPTIONS","recordRequestBody","recordResponseBody","maxResponseBodySize","maxRequestBodySize","onlyFailedRequests","shouldRecordUrl","RegExp","filterSensitiveFields","sensitiveFields","isArray","filtered","lowerKey","some","field","createNetworkInterceptorPlugin","originalFetch","originalXHROpen","originalXHRSend","originalXHRSetRequestHeader","requestMap","URL","urlFilter","requestId","requestBody","assign","bodyToRead","recordBody","File","URLSearchParams","fromEntries","byteLength","readRequestBody","requestEvent","endTime","statusCode","responseBody","Response","getResponseHeader","contentLength","parseInt","clonedResponse","readResponseBody","responseSize","responseEvent","errorResponseEvent","xhrHeaders","WeakMap","xhrRequestInfo","username","password","urlString","toUpperCase","requestInfo","readystatechangeHandler","DONE","networkInterceptorPlugin","getDeviceId","getSessionId","customTracker","dataProcessor","batchSender","pluginManager","behaviorAnalysis","getConfig","setUser","getUser","userInfo","autoTracker","setupAutoTrackListeners","errorTracker","performanceTracker","sessionReplay","enrichedEvent","enrichEvent","beforeSend","afterSend","onError","mergedProperties","finalProperties","enriched","user","trackPerformance","updateConfig","getBehaviorMetrics","getSessionReplayData","getAutoTracker"],"mappings":"kMAQA,MAAMA,EAGF,CACFC,MAAO,GACPC,eAAW,EACXC,iBAAiB,EACjBC,kBAAkB,EAClBC,wBAAwB,EACxBC,qBAAqB,EACrBC,UAAW,GACXC,UAAW,IACXC,WAAY,EACZC,sBAAsB,EACtBC,sBAAuB,IACvBC,WAAY,EACZC,OAAQ,GACRC,SAAU,GACVC,iBAAkB,CAAA,GAMpB,MAAMC,EAGJ,WAAAC,CAAYC,GAFJC,EAAAC,KAAA,UAGNA,KAAKF,OAAS,IACTlB,KACAkB,EACHH,iBAAkB,IACbf,EAAce,oBACdG,EAAOH,kBAGhB,CAKA,GAAAM,CAAmCC,GACjC,OAAOF,KAAKF,OAAOI,EACrB,CAKA,MAAAC,GACE,MAAO,IAAKH,KAAKF,OACnB,CAKA,GAAAM,CAAmCF,EAAQG,GACzCL,KAAKF,OAAOI,GAAOG,CACrB,CAKA,MAAAC,CAAOC,GACLP,KAAKF,OAAS,IACTE,KAAKF,UACLS,EACHZ,iBAAkB,IACbK,KAAKF,OAAOH,oBACXY,EAAQZ,kBAAoB,CAAA,GAGtC,ECHK,MAAMa,EAAW,IAtExB,MAAA,WAAAX,GACUE,EAAAC,KAAA,aAA2CS,IAAA,CAKnD,EAAAC,CAAGC,EAAeC,GACXZ,KAAKa,OAAOC,IAAIH,IACnBX,KAAKa,OAAOT,IAAIO,EAAO,IAEzBX,KAAKa,OAAOZ,IAAIU,GAAQI,KAAKH,EAC/B,CAKA,GAAAI,CAAIL,EAAeC,GACjB,IAAKZ,KAAKa,OAAOC,IAAIH,GACnB,OAGF,IAAKC,EAEH,YADAZ,KAAKa,OAAOI,OAAON,GAIrB,MAAMO,EAAYlB,KAAKa,OAAOZ,IAAIU,GAC5BQ,EAAQD,EAAUE,QAAQR,GAC5BO,GAAQ,GACVD,EAAUG,OAAOF,EAAO,EAE5B,CAKA,IAAAG,CAAKX,KAAkBY,GACrB,IAAKvB,KAAKa,OAAOC,IAAIH,GACnB,OAGgBX,KAAKa,OAAOZ,IAAIU,GACxBa,QAAQZ,IAChB,IACEA,KAAYW,EACd,OAASE,GACPC,QAAQD,MAAM,0CAA0Cd,MAAWc,EACrE,GAEJ,CAKA,IAAAE,CAAKhB,EAAeC,GAClB,MAAMgB,EAAU,IAAIL,KAClBX,KAAYW,GACZvB,KAAKgB,IAAIL,EAAOiB,IAElB5B,KAAKU,GAAGC,EAAOiB,EACjB,CAKA,KAAAC,GACE7B,KAAKa,OAAOgB,OACd,GClEK,SAASC,IACd,MAAO,GAAGC,KAAKC,SAASC,KAAKC,SAASC,SAAS,IAAIC,UAAU,EAAG,IAClE,CAmDO,SAASC,IACd,MAAsB,oBAAXC,OACF,GAEFA,OAAOC,SAASC,IACzB,CAKO,SAASC,IACd,MAAsB,oBAAXH,OACF,GAEFI,SAASC,OAAS,EAC3B,CAeO,SAASC,EACdC,EACAC,GAEA,IAAIC,EAAgD,KAEpD,OAAO,YAA6BxB,GAM9BwB,GACFC,aAAaD,GAEfA,EAAUE,WARI,KACZF,EAAU,KACVF,KAAQtB,IAMkBuB,EAC9B,CACF,CAKO,SAASI,EACdL,EACAC,GAEA,IAAIC,EAAgD,KAChDI,EAAW,EAEf,OAAO,YAA6B5B,GAClC,MAAMS,EAAMD,KAAKC,MACXoB,EAAYN,GAAQd,EAAMmB,GAE5BC,GAAa,GAAKA,EAAYN,GAC5BC,IACFC,aAAaD,GACbA,EAAU,MAEZI,EAAWnB,EACXa,KAAQtB,IACEwB,IACVA,EAAUE,WAAW,KACnBE,EAAWpB,KAAKC,MAChBe,EAAU,KACVF,KAAQtB,IACP6B,GAEP,CACF,CAKO,SAASC,EAAaC,GAC3B,GAAY,OAARA,GAA+B,iBAARA,EACzB,OAAOA,EAGT,GAAIA,aAAevB,KACjB,OAAO,IAAIA,KAAKuB,EAAIC,WAGtB,GAAID,aAAeE,MACjB,OAAOF,EAAIG,IAAIC,GAAQL,EAAUK,IAGnC,GAAmB,iBAARJ,EAAkB,CAC3B,MAAMK,EAAY,CAAA,EAClB,IAAA,MAAWzD,KAAOoD,EACZM,OAAOC,UAAUC,eAAeC,KAAKT,EAAKpD,KAC5CyD,EAAUzD,GAAOmD,EAAWC,EAAgCpD,KAGhE,OAAOyD,CACT,CAEA,OAAOL,CACT,CAmBO,SAASU,EAAeC,GAC7B,IAAKA,EACH,MAAO,GAGT,MAAMC,EAAiB,GAEvB,KAAOD,GAAWA,EAAQE,WAAaC,KAAKC,cAAc,CACxD,IAAIC,EAAWL,EAAQM,SAASC,cAEhC,GAAIP,EAAQQ,GAAI,CACdH,GAAY,IAAIL,EAAQQ,KACxBP,EAAKQ,QAAQJ,GACb,KACF,CAEA,GAAIL,EAAQU,UAAW,CACrB,MAAMC,EAAUX,EAAQU,UACrBE,OACAC,MAAM,OACNC,UAAcC,EAAIC,OAAS,GAC3BC,KAAK,KACJN,IACFN,GAAY,IAAIM,IAEpB,CAEA,IAAIO,EAAUlB,EACVmB,EAAM,EACV,KAAQD,EAAUA,EAAQE,wBACpBF,EAAQZ,WAAaN,EAAQM,UAC/Ba,IAIAA,EAAM,IACRd,GAAY,gBAAgBc,MAG9BlB,EAAKQ,QAAQJ,GACbL,EAAUA,EAAQqB,aACpB,CAEA,OAAOpB,EAAKgB,KAAK,MACnB,CAKO,SAASK,EAAetB,SAM7B,OAAKA,EAIE,CACLuB,QAASvB,EAAQuB,QAAQhB,cACzBC,GAAIR,EAAQQ,SAAM,EAClBE,UAAWV,EAAQU,WAA0C,iBAAtBV,EAAQU,UAAyBV,EAAQU,eAAY,EAC5Fc,MAAM,OAAAC,EAAAzB,EAAQ0B,sBAAad,OAAOzC,UAAU,EAAG,YAAQ,GAPhD,CAAA,CASX,CCrPA,MAAMwD,EAAN,WAAA/F,GACUE,EAAAC,KAAA,YAAoB+B,KAAKC,OACzBjC,EAAAC,KAAA,aAAqB,IACrBD,EAAAC,KAAA,kBAAuC,MACvCD,EAAAC,KAAA,0BAA+C,MAC/CD,EAAAC,KAAA,sBAA2C,MAC3CD,EAAAC,KAAA,cAAsB,GACtBD,EAAAC,KAAA,kBAAwD,MACxDD,EAAAC,KAAA,mBAA2B,GAC3BD,EAAAC,KAAA,sBAA8B,KAC9BD,EAAAC,KAAA,kBAAiC,MACjCD,EAAAC,KAAA,kBAA0B,GAC1BD,EAAAC,KAAA,aAAqB,EAAA,CAK7B,IAAA6F,GACE7F,KAAK8F,gBACL9F,KAAK+F,iBACL/F,KAAKgG,oBACP,CAKA,aAAAF,GAEE,GAAI9F,KAAKiG,WACP,MAAO,CACLC,KAAM,WACNC,KAAM,WACNC,UAAWrE,KAAKC,MAChBqE,IAAKrG,KAAKsG,YAAcjE,IACxBM,MAAOF,KAIXzC,KAAKiG,YAAa,EAElB,IACE,MAAMjE,EAAMD,KAAKC,MACXqE,EAAMhE,IACNM,EAAQF,IACR8D,ED+BY,oBAAXjE,OACF,GAEFI,SAAS6D,UAAY,GC9BlBC,EAAkBH,IAAQrG,KAAKsG,YAAkC,KAApBtG,KAAKsG,WAGxD,IAAKE,GAAmBxG,KAAKyG,iBAAmB,EAAG,CAEjD,GAD8BzE,EAAMhC,KAAKyG,iBACbzG,KAAK0G,oBAE/B,MAAO,CACLR,KAAM,WACNC,KAAM,WACNC,UAAWpE,EACXqE,IAAKrG,KAAKsG,WACV3D,QAGN,CAGA,MAAMgE,EAAkB3G,KAAKsG,WAAatE,EAAMhC,KAAK4G,UAAY5G,KAAK6G,gBAAkB,EAClFC,EAAWH,EAAkB,EAAIA,EAAkB,EAEnDhG,EAAuB,CAC3BuF,KAAM,WACNC,KAAM,WACNC,UAAWpE,EACXqE,MACA1D,QACA4D,SAAUvG,KAAKsG,WAAaC,OAAW,EACvCO,SAAUA,EAAW,EAAIA,OAAW,GAkBtC,OAdIN,IACFxG,KAAK4G,UAAY5E,EACjBhC,KAAKsG,WAAaD,EAClBrG,KAAK6G,gBAAkB,GAIzB7G,KAAKyG,iBAAmBzE,EAGF,oBAAXM,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,WAAYX,GAG7HA,CACT,CAAA,QAEEsC,WAAW,KACTjD,KAAKiG,YAAa,GACjB,EACL,CACF,CAKQ,cAAAF,GACN,GAAsB,oBAAXzD,OACT,OAIFtC,KAAKgH,gBAAkB,KACrBhH,KAAK8F,iBAEPxD,OAAO2E,iBAAiB,WAAYjH,KAAKgH,iBAGzC,MAAME,EAAeC,QAQrB,IAAKD,EAAaE,yBAA0B,CAC1C,MAAMC,EAAoBF,QAAQG,UAAUC,KAAKJ,SACjDD,EAAaM,mBAAqBH,EAClCH,EAAaE,0BAA2B,EAExC,MAAMK,EAAOzH,KACbmH,QAAQG,UAAY,YAAa/F,GAC/B,MAAMmG,EAASL,EAAkBM,MAAMR,QAAS5F,GAehD,OAXIkG,EAAKG,iBACP5E,aAAayE,EAAKG,iBAEpBH,EAAKG,gBAAkB3E,WAAW,KACjBZ,MAEAoF,EAAKnB,YAClBmB,EAAK3B,gBAEP2B,EAAKG,gBAAkB,MACtB,KACIF,CACT,CACF,CAEA,IAAKR,EAAaW,4BAA6B,CAC7C,MAAMC,EAAuBX,QAAQY,aAAaR,KAAKJ,SACvDD,EAAac,sBAAwBF,EACrCZ,EAAaW,6BAA8B,EAE3C,MAAMJ,EAAOzH,KACbmH,QAAQY,aAAe,YAAaxG,GAClC,MAAMmG,EAASI,EAAqBH,MAAMR,QAAS5F,GAenD,OAXIkG,EAAKG,iBACP5E,aAAayE,EAAKG,iBAEpBH,EAAKG,gBAAkB3E,WAAW,KACjBZ,MAEAoF,EAAKnB,YAClBmB,EAAK3B,gBAEP2B,EAAKG,gBAAkB,MACtB,KACIF,CACT,CACF,CACF,CAKQ,kBAAA1B,GACkB,oBAAbtD,WAKX1C,KAAKiI,wBAA0B,KAC7B,MAAMC,EAAWxF,SAASyF,OACpBnG,EAAMD,KAAKC,MAEbkG,GAAYlI,KAAKoI,WAEnBpI,KAAKqI,gBAAkBrG,EACvBhC,KAAKoI,WAAY,GACPF,GAAalI,KAAKoI,YAExBpI,KAAKqI,kBACPrI,KAAK6G,iBAAmB7E,EAAMhC,KAAKqI,gBACnCrI,KAAKqI,gBAAkB,MAEzBrI,KAAKoI,WAAY,IAIrB1F,SAASuE,iBAAiB,mBAAoBjH,KAAKiI,yBAGnDjI,KAAKsI,oBAAsB,KACzB,MAAMtG,EAAMD,KAAKC,MAGbhC,KAAKqI,kBACPrI,KAAK6G,iBAAmB7E,EAAMhC,KAAKqI,gBACnCrI,KAAKqI,gBAAkB,MAIzB,MAAME,EAAgBvI,KAAKsG,WAAatE,EAAMhC,KAAK4G,UAAY5G,KAAK6G,gBAAkB,EAGtF,GAAI0B,EAAgB,GAAKvI,KAAKsG,WAC5B,IACE,MAAMkC,EAA4B,CAChCtC,KAAM,WACNC,KAAM,qBACNC,UAAWpE,EACXqE,IAAKrG,KAAKsG,WACV3D,MAAOF,IACPqE,SAAUyB,GAIU,oBAAXjG,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,WAAYkH,EAEtI,OAAS/G,GACPC,QAAQD,MAAM,mDAAoDA,EACpE,GAIJa,OAAO2E,iBAAiB,eAAgBjH,KAAKsI,qBAC/C,CAKA,OAAAG,GAyBE,GAvBIzI,KAAK4H,kBACP5E,aAAahD,KAAK4H,iBAClB5H,KAAK4H,gBAAkB,MAIrB5H,KAAKgH,iBAAqC,oBAAX1E,SACjCA,OAAOoG,oBAAoB,WAAY1I,KAAKgH,iBAC5ChH,KAAKgH,gBAAkB,MAIrBhH,KAAKiI,yBAA+C,oBAAbvF,WACzCA,SAASgG,oBAAoB,mBAAoB1I,KAAKiI,yBACtDjI,KAAKiI,wBAA0B,MAG7BjI,KAAKsI,qBAAyC,oBAAXhG,SACrCA,OAAOoG,oBAAoB,eAAgB1I,KAAKsI,qBAChDtI,KAAKsI,oBAAsB,MAIP,oBAAXhG,OAAwB,CACjC,MAAM4E,EAAeC,QAOjBD,EAAaE,0BAA4BF,EAAaM,qBACxDL,QAAQG,UAAYJ,EAAaM,mBACjCN,EAAaE,0BAA2B,SACjCF,EAAaM,oBAGlBN,EAAaW,6BAA+BX,EAAac,wBAC3Db,QAAQY,aAAeb,EAAac,sBACpCd,EAAaW,6BAA8B,SACpCX,EAAac,sBAExB,CACF,ECrSF,MAAMW,EAAN,WAAA9I,GACUE,EAAAC,KAAA,eAAqD,MACrDD,EAAAC,KAAA,oBAA0D,MAC1DD,EAAAC,KAAA,kBAAwD,MACxDD,EAAAC,KAAA,eAAuB,KACvBD,EAAAC,KAAA,eAA8B,MAC9BD,EAAAC,KAAA,YAA2D,MAClDD,EAAAC,KAAA,wBAAwB,KACxBD,EAAAC,KAAA,2BAA2B,GAAA,CAK5C,IAAA6F,CAAK+C,GACmB,oBAAXtG,cAIU,IAAjBsG,IACF5I,KAAK4I,aAAeA,GAItB5I,KAAK6I,aAAejG,EAAS,IAAIrB,KAC/B,MAAMZ,EAAQY,EAAK,GACnBvB,KAAK8I,YAAYnI,IAChBX,KAAK4I,cAIR5I,KAAK+I,kBAAsBpI,IACzBX,KAAKgJ,YAAYrI,IAInBX,KAAKiJ,gBAAkBrG,EAAS,IAAIrB,KAClC,MAAMZ,EAAQY,EAAK,GACnBvB,KAAKgJ,YAAYrI,IAChBX,KAAK4I,cAGRlG,SAASuE,iBAAiB,QAASjH,KAAK6I,cAA+B,GAIvEnG,SAASuE,iBAAiB,aAAcjH,KAAK+I,kBAAmB,CAAEG,SAAS,EAAMC,SAAS,IAC1FzG,SAASuE,iBAAiB,WAAYjH,KAAKiJ,gBAAkC,CAAEC,SAAS,EAAMC,SAAS,IACzG,CAKQ,WAAAH,CAAYrI,GAClB,IACE,MAAMqB,EAAMD,KAAKC,MAEjB,OAAQrB,EAAMuF,MACZ,IAAK,aAEH,GAAIvF,EAAMyI,QAAQnE,OAAS,EAAG,CAC5B,MAAMoE,EAAQ1I,EAAMyI,QAAQ,GAC5BpJ,KAAKsJ,UAAY,CACfC,EAAGF,EAAMG,QACTC,EAAGJ,EAAMK,QACTC,KAAM3H,EAEV,CACA,MAEF,IAAK,WAEH,GAAIhC,KAAKsJ,WAAa3I,EAAMiJ,eAAe3E,OAAS,EAAG,CACrD,MAAM4E,EAAWlJ,EAAMiJ,eAAe,GAChCE,EAAS7H,KAAK8H,IAAIF,EAASL,QAAUxJ,KAAKsJ,UAAUC,GACpDS,EAAS/H,KAAK8H,IAAIF,EAASH,QAAU1J,KAAKsJ,UAAUG,GACxCzH,EAAMhC,KAAKsJ,UAAUK,KAGvB3J,KAAKiK,uBACjBH,EAAS9J,KAAKkK,0BACdF,EAAShK,KAAKkK,2BAGZlK,KAAKmK,cACPnH,aAAahD,KAAKmK,cAIpBnK,KAAKmK,aAAe7H,OAAOW,WAAW,KACpC,IACEjD,KAAKoK,wBAAwBP,EAAUlJ,EAAM0J,OAC/C,OAAS5I,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,CACAzB,KAAKmK,aAAe,MACnB,MAGLnK,KAAKsJ,UAAY,IACnB,EAGN,OAAS7H,GACPC,QAAQD,MAAM,4CAA6CA,EAC7D,CACF,CAKQ,uBAAA2I,CAAwBf,EAAcpF,GAC5C,IAAKA,EACH,OAIF,MAAMoC,EAAMhE,IACNM,EAAQF,IACR2D,EAAYrE,KAAKC,MACjBsI,EAAW,CACff,EAAGF,EAAMG,QACTC,EAAGJ,EAAMK,SAILa,EAAe,KACnB,IACE,MAAMC,EAAcxG,EAAeC,GAC7BwG,EAAclF,EAAetB,GAG7ByG,EAAyB,CAC7BxE,KAAM,QACNC,KAAM,cACNC,YACAC,MACA1D,QACA6H,cACAC,cACAH,WACAK,gBAAiB,SAIG,oBAAXrI,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,QAASoJ,EAEnI,OAASjJ,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,GAIiC,oBAAxBmJ,oBACTA,oBAAoBL,EAAc,CAAExH,QAAS,KAE7CE,WAAWsH,EAAc,EAE7B,CAKQ,WAAAzB,CAAYnI,GAClB,IACE,MAAM0J,EAAS1J,EAAM0J,OACrB,IAAKA,EACH,OAIF,MAAMhE,EAAMhE,IACNM,EAAQF,IACR2D,EAAYrE,KAAKC,MACjBsI,EAAW,CACff,EAAG5I,EAAM6I,QACTC,EAAG9I,EAAM+I,SAKLmB,EAAe,KACnB,IACE,MAAML,EAAcxG,EAAeqG,GAC7BI,EAAclF,EAAe8E,GAE7BS,EAAyB,CAC7B5E,KAAM,QACNC,KAAM,QACNC,YACAC,MACA1D,QACA6H,cACAC,cACAH,WACAK,gBAAiB,SAIG,oBAAXrI,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,QAASwJ,EAEnI,OAASrJ,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,GAIiC,oBAAxBmJ,oBACTA,oBAAoBC,EAAc,CAAE9H,QAAS,MAE7CE,WAAW4H,EAAc,EAE7B,OAASpJ,GACPC,QAAQD,MAAM,4CAA6CA,EAC7D,CACF,CAKA,aAAAsJ,CAAcpK,GACZ,IACE,MAAM0J,EAAS1J,EAAM0J,OACrB,OAAKA,EAIE,CACLnE,KAAM,QACNC,KAAM,QACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP+H,YAAaxG,EAAeqG,GAC5BI,YAAalF,EAAe8E,GAC5BC,SAAU,CACRf,EAAG5I,EAAM6I,QACTC,EAAG9I,EAAM+I,SAEXiB,gBAAiB,SAfV,IAiBX,OAASlJ,GAEP,OADAC,QAAQD,MAAM,4CAA6CA,GACpD,IACT,CACF,CAKA,OAAAgH,GACMzI,KAAK6I,cAAoC,oBAAbnG,WAC9BA,SAASgG,oBAAoB,QAAS1I,KAAK6I,cAA+B,GAC1E7I,KAAK6I,aAAe,MAGlB7I,KAAK+I,mBAAyC,oBAAbrG,WACnCA,SAASgG,oBAAoB,aAAc1I,KAAK+I,mBAChD/I,KAAK+I,kBAAoB,MAGvB/I,KAAKiJ,iBAAuC,oBAAbvG,WACjCA,SAASgG,oBAAoB,WAAY1I,KAAKiJ,iBAC9CjJ,KAAKiJ,gBAAkB,MAGrBjJ,KAAKmK,eACPnH,aAAahD,KAAKmK,cAClBnK,KAAKmK,aAAe,MAGtBnK,KAAKsJ,UAAY,IACnB,ECxQF,MAAM0B,EAWJ,WAAAnL,CAAYoL,EAA2B,IAV/BlL,EAAAC,KAAA,WAAwC,MACxCD,EAAAC,KAAA,sBAAoCkL,KACpCnL,EAAAC,KAAA,WACAD,EAAAC,KAAA,kBAAwCS,KACxCV,EAAAC,KAAA,wBAA6C,MAC7CD,EAAAC,KAAA,wBAA6C,MAC7CD,EAAAC,KAAA,iBAA4B,IAC5BD,EAAAC,KAAA,kBAA0B,GACjBD,EAAAC,KAAA,wBAAwB,KAGvCA,KAAKiL,QAAU,CACbE,UAAW,GACXC,KAAM,KACNC,WAAY,SACTJ,EAEP,CAKA,IAAApF,GACwB,oBAAXvD,QAA2BA,OAAOgJ,sBAM7CtL,KAAKuL,SAAW,IAAID,qBAClBpI,EAAS,IAAI3B,KACKA,EAAK,GACbC,QAAQgK,IACdxL,KAAKyL,mBAAmBD,MAEzB,KACH,CACEL,UAAWnL,KAAKiL,QAAQE,WAAa,GACrCC,KAAMpL,KAAKiL,QAAQG,KACnBC,WAAYrL,KAAKiL,QAAQI,aAK7BrL,KAAK0L,mBAnBH1L,KAAK2L,oBAoBT,CAKA,eAAAD,GACE,IAAK1L,KAAKuL,UAAgC,oBAAb7I,SAC3B,OAGF,MAAMkJ,EAAWlJ,SAASmJ,iBAAiB,yBAC3CD,EAASpK,QAAQyC,IACfjE,KAAKuL,SAAUO,QAAQ7H,KAIzBjE,KAAK+L,eAAiBvI,MAAMwI,KAAKJ,GACjC5L,KAAKiM,gBAAkBlK,KAAKC,KAC9B,CAKA,OAAA8J,CAAQ7H,GACDjE,KAAKuL,WAGVvL,KAAKuL,SAASO,QAAQ7H,GAGjBjE,KAAK+L,eAAeG,SAASjI,KAChCjE,KAAK+L,eAAehL,KAAKkD,GACzBjE,KAAKiM,gBAAkBlK,KAAKC,OAEhC,CAKA,SAAAmK,CAAUlI,GACR,IAAKjE,KAAKuL,SACR,OAEFvL,KAAKuL,SAASY,UAAUlI,GACxBjE,KAAKoM,gBAAgBnL,OAAOgD,GAC5BjE,KAAKqM,YAAYpL,OAAOgD,GAGxB,MAAM9C,EAAQnB,KAAK+L,eAAe3K,QAAQ6C,GACtC9C,GAAQ,IACVnB,KAAK+L,eAAe1K,OAAOF,EAAO,GAClCnB,KAAKiM,gBAAkBlK,KAAKC,MAEhC,CAKQ,kBAAAyJ,CAAmBD,GACzB,MAAMnB,OAAEA,EAAAiC,kBAAQA,EAAAC,eAAmBA,GAAmBf,EAEtD,GAAIe,GAAkBD,IAAsBtM,KAAKiL,QAAQE,WAAa,IAC/DnL,KAAKoM,gBAAgBtL,IAAIuJ,KAC5BrK,KAAKoM,gBAAgBI,IAAInC,GACzBrK,KAAKyM,gBAAgBpC,IAEvBrK,KAAKqM,YAAYjM,IAAIiK,EAAQtI,KAAKC,YACpC,IAAYuK,EAAgB,CAE1B,MAAM3F,EAAY5G,KAAKqM,YAAYpM,IAAIoK,GACvC,GAAIzD,EAAW,CACb,MAAME,EAAW/E,KAAKC,MAAQ4E,EAC9B5G,KAAKyM,gBAAgBpC,EAAQvD,GAC7B9G,KAAKqM,YAAYpL,OAAOoJ,GACxBrK,KAAKoM,gBAAgBnL,OAAOoJ,EAC9B,CACF,CACF,CAOQ,eAAAoC,CAAgBxI,EAAkB6C,GACxC,IACE,MAAM4F,EAA+B,CACnCxG,KAAM,WACNC,KAAM,WACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP+H,YAAaxG,EAAeC,GAC5B6C,YAIoB,oBAAXxE,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,WAAYoL,EAEtI,OAASjL,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,CACF,CAKQ,mBAAAkL,GACN,MAAM3K,EAAMD,KAAKC,MAUjB,OAPmC,IAA/BhC,KAAK+L,eAAe9G,QAAgBjD,EAAMhC,KAAKiM,gBAAkBjM,KAAK4M,wBAChD,oBAAblK,WACT1C,KAAK+L,eAAiBvI,MAAMwI,KAAKtJ,SAASmJ,iBAAiB,0BAC3D7L,KAAKiM,gBAAkBjK,GAIpBhC,KAAK+L,cACd,CAKQ,kBAAAJ,GACN,GAAsB,oBAAXrJ,OACT,OAIFtC,KAAK+L,eAAiBvI,MAAMwI,KAAKtJ,SAASmJ,iBAAiB,0BAC3D7L,KAAKiM,gBAAkBlK,KAAKC,MAE5B,MAAM6K,EAAgB3J,EAAS,KAC7B,MAAM0I,EAAW5L,KAAK2M,sBAChB3K,EAAMD,KAAKC,MAEjB4J,EAASpK,QAAQyC,IACf,MAAM6I,EAAO7I,EAAQ8I,wBACfC,EAAiB1K,OAAO2K,aAAevK,SAASwK,gBAAgBC,aAChEC,EAAgB9K,OAAO+K,YAAc3K,SAASwK,gBAAgBI,YAI9DC,GAFgBtL,KAAKuL,IAAIV,EAAKW,OAAQT,GAAkB/K,KAAKyL,IAAIZ,EAAKa,IAAK,KAC5D1L,KAAKuL,IAAIV,EAAKc,MAAOR,GAAiBnL,KAAKyL,IAAIZ,EAAKe,KAAM,IAEzEC,EAAYhB,EAAKiB,OAASjB,EAAKkB,MAGrC,IAFqBF,EAAY,EAAIP,EAAcO,EAAY,KAE1C9N,KAAKiL,QAAQE,WAAa,IAExCnL,KAAKoM,gBAAgBtL,IAAImD,KAE5BjE,KAAKoM,gBAAgBI,IAAIvI,GACzBjE,KAAKqM,YAAYjM,IAAI6D,EAASjC,GAC9BhC,KAAKyM,gBAAgBxI,SAKvB,GAAIjE,KAAKoM,gBAAgBtL,IAAImD,GAAU,CAErC,MAAM2C,EAAY5G,KAAKqM,YAAYpM,IAAIgE,GACvC,GAAI2C,EAAW,CACb,MAAME,EAAW9E,EAAM4E,EACvB5G,KAAKyM,gBAAgBxI,EAAS6C,GAC9B9G,KAAKqM,YAAYpL,OAAOgD,GACxBjE,KAAKoM,gBAAgBnL,OAAOgD,EAC9B,CACF,KAGH,KAGHjE,KAAKiO,sBAAwBpB,EAC7B7M,KAAKkO,sBAAwBrB,EAE7BvK,OAAO2E,iBAAiB,SAAUjH,KAAKiO,sBAAuB,CAAE/E,SAAS,IACzE5G,OAAO2E,iBAAiB,SAAUjH,KAAKkO,sBAAuB,CAAEhF,SAAS,IAEzEjG,WAAW4J,EAAe,EAC5B,CAKA,OAAApE,GACMzI,KAAKuL,WACPvL,KAAKuL,SAAS4C,aACdnO,KAAKuL,SAAW,MAIdvL,KAAKiO,uBAA2C,oBAAX3L,SACvCA,OAAOoG,oBAAoB,SAAU1I,KAAKiO,uBAC1CjO,KAAKiO,sBAAwB,MAG3BjO,KAAKkO,uBAA2C,oBAAX5L,SACvCA,OAAOoG,oBAAoB,SAAU1I,KAAKkO,uBAC1ClO,KAAKkO,sBAAwB,MAG/BlO,KAAKoM,gBAAgBvK,QACrB7B,KAAKqM,YAAYxK,QACjB7B,KAAK+L,eAAiB,GACtB/L,KAAKiM,gBAAkB,CACzB,ECvQF,MAAMmC,EAAN,WAAAvO,GACUE,EAAAC,KAAA,eAAgD,MAChDD,EAAAC,KAAA,gBAAiD,MACjDD,EAAAC,KAAA,oBAA4B,KAC5BD,EAAAC,KAAA,qBAA6B,KAC7BD,EAAAC,KAAA,kBAA0B,GAE1BD,EAAAC,KAAA,oBAA8B,CAAC,WAAY,MAAO,SAAU,QAAS,MAAO,OAAQ,cAAY,CAKxG,IAAA6F,CAAK+C,EAAuByF,GACJ,oBAAX/L,cAKU,IAAjBsG,IACF5I,KAAKsO,kBAAoB1F,EACzB5I,KAAKuO,mBAAqBtM,KAAKuL,IAAI5E,EAAc,WAG5B,IAAnByF,IACFrO,KAAKqO,eAAiBA,GAIxBrO,KAAKwO,aAAe5L,EAAS,IAAIrB,KAC/B,MAAMZ,EAAQY,EAAK,GACnBvB,KAAKyO,YAAY9N,IAChBX,KAAKsO,mBAGRtO,KAAK0O,cAAgB9L,EAAS,IAAIrB,KAChC,MAAMZ,EAAQY,EAAK,GACnBvB,KAAK2O,aAAahO,IACjBX,KAAKuO,oBAGR7L,SAASuE,iBAAiB,QAASjH,KAAKwO,cAA+B,GACvE9L,SAASuE,iBAAiB,SAAUjH,KAAK0O,eAAgC,GAC3E,CAKQ,WAAAD,CAAY9N,SAClB,MAAM0J,EAAS1J,EAAM0J,OACrB,IAAKA,EACH,OAIF,MAAM7E,EAAU,OAAAE,EAAA2E,EAAO7E,cAAP,EAAAE,EAAgBlB,cAChC,GAAgB,UAAZgB,GAAmC,aAAZA,EACzB,OAIF,MAAMa,EAAMhE,IACNM,EAAQF,IACR2D,EAAYrE,KAAKC,MAGjB4M,EAAe,WACnB,IACE,MAAMpE,EAAcxG,EAAeqG,GAI7BI,EAAc,IAHIlF,EAAe8E,GAKrClE,KAAOkE,EAA4BlE,WAAQ,EAC3CD,KAAOmE,EAA4BnE,WAAQ,EAC3C2I,YAAcxE,EAA4BwE,kBAAe,GAIrDC,EAAc9O,KAAK+O,iBAAiB1E,GAG1C,IAeIhK,EACA2O,EAhBAC,EAAmE,OACvE,GAAgB,aAAZzJ,EACFyJ,EAAY,gBACd,GAAuB,UAAZzJ,EAAqB,CAC9B,MAAMU,GAAQ,OAAAR,EAAA2E,EAA4BnE,WAA5B,EAAAR,EAAkClB,gBAAiB,OAE/DyK,EADW,aAAT/I,EACU,WACM,UAATA,EACG,QAEA,MAEhB,CAiBA,GAXI4I,GAEFE,EAAc3E,EAAOhK,MAAM4E,OAC3B5E,OAAQ,IAGRA,EAAQgK,EAAOhK,MACf2O,EAAc3E,EAAOhK,MAAM4E,QAIzBjF,KAAKqO,gBAAkC,IAAhBW,EACzB,OAGF,MAAME,EAAyB,CAC7BhJ,KAAM,QACNC,KAAM,QACNC,YACAC,MACA1D,QACA6H,cACAC,cACAwE,YACA5O,QACA2O,cACAF,eAIoB,oBAAXxM,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,QAAS4N,EAEnI,OAASzN,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,GAIiC,oBAAxBmJ,oBACTA,oBAAoBgE,EAAc,CAAE7L,QAAS,MAE7CE,WAAW2L,EAAc,EAE7B,CAKQ,YAAAD,CAAahO,SACnB,MAAM0J,EAAS1J,EAAM0J,OACrB,IAAKA,EACH,OAKF,GAAgB,YADA,OAAA3E,EAAA2E,EAAO7E,cAAP,EAAAE,EAAgBlB,eAE9B,OAIF,MAAM6B,EAAMhE,IACNM,EAAQF,IACR2D,EAAYrE,KAAKC,MAGjBmN,EAAgB,KACpB,IACE,MAAM3E,EAAcxG,EAAeqG,GAI7BI,EAAc,IAHIlF,EAAe8E,GAKrClE,KAAOkE,EAA6BlE,WAAQ,GAIxC2I,EAAc9O,KAAK+O,iBAAiB1E,GAGpC+E,EAAgB/E,EACtB,IAAIhK,EACA2O,EAaJ,GAXIF,GAEFE,EAAcI,EAAc/O,MAAM4E,OAClC5E,OAAQ,IAGRA,EAAQ+O,EAAc/O,MACtB2O,EAAcI,EAAc/O,MAAM4E,QAIhCjF,KAAKqO,gBAAkC,IAAhBW,EACzB,OAGF,MAAME,EAAyB,CAC7BhJ,KAAM,QACNC,KAAM,QACNC,YACAC,MACA1D,QACA6H,cACAC,cACAwE,UAAW,SACX5O,QACA2O,cACAF,eAIoB,oBAAXxM,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,QAAS4N,EAEnI,OAASzN,GACPC,QAAQD,MAAM,+CAAgDA,EAChE,GAIiC,oBAAxBmJ,oBACTA,oBAAoBuE,EAAe,CAAEpM,QAAS,MAE9CE,WAAWkM,EAAe,EAE9B,CAKQ,gBAAAJ,CAAiB9K,eAEvB,GAAIA,aAAmBoL,iBAAkB,CAEvC,GAAa,cADA,OAAA3J,EAAAzB,EAAQiC,WAAR,EAAAR,EAAclB,eAEzB,OAAO,CAEX,CAGA,MAAM2B,GAAQ,OAAAmJ,EAAArL,EAA6BkC,WAA7B,EAAAmJ,EAAmC9K,gBAAiB,GAClE,GAAI2B,EACF,IAAA,MAAWoJ,KAAWvP,KAAKwP,kBACzB,GAAIrJ,EAAK+F,SAASqD,GAChB,OAAO,EAMb,MAAM9K,GAAK,OAAAgL,EAAAxL,EAAQQ,SAAR,EAAAgL,EAAYjL,gBAAiB,GACxC,GAAIC,EACF,IAAA,MAAW8K,KAAWvP,KAAKwP,kBACzB,GAAI/K,EAAGyH,SAASqD,GACd,OAAO,EAMb,MAAM5K,GAAY,OAAA+K,EAAAzL,EAAQU,gBAAR,EAAA+K,EAAmBlL,gBAAiB,GACtD,GAAIG,EACF,IAAA,MAAW4K,KAAWvP,KAAKwP,kBACzB,GAAI7K,EAAUuH,SAASqD,GACrB,OAAO,EAKb,OAAO,CACT,CAKA,OAAA9G,GACMzI,KAAKwO,cAAoC,oBAAb9L,WAC9BA,SAASgG,oBAAoB,QAAS1I,KAAKwO,cAA+B,GAC1ExO,KAAKwO,aAAe,MAGlBxO,KAAK0O,eAAqC,oBAAbhM,WAC/BA,SAASgG,oBAAoB,SAAU1I,KAAK0O,eAAgC,GAC5E1O,KAAK0O,cAAgB,KAEzB,ECjSF,MAAMiB,EAOJ,WAAA9P,GANQE,EAAAC,KAAA,eACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,WAAmB,GAGzBA,KAAK4P,YAAc,IAAIhK,EACvB5F,KAAK6P,aAAe,IAAIlH,EACxB3I,KAAK8P,gBAAkB,IAAI9E,EAC3BhL,KAAK+P,aAAe,IAAI3B,CAC1B,CAKA,IAAAvI,CAAKoF,GACH,GAAIjL,KAAKgQ,QACP,OAGF,MAAMC,YAAEA,GAAc,EAAAC,eAAMA,GAAiB,EAAAC,YAAMA,GAAc,EAAAC,kBAAMA,EAAA9B,kBAAmBA,GAAsBrD,GAAW,CAAA,EAG3HjL,KAAK4P,YAAY/J,OAGboK,GACFjQ,KAAK6P,aAAahK,KAAKuK,GAIrBF,GACFlQ,KAAK8P,gBAAgBjK,OAInBsK,GACFnQ,KAAK+P,aAAalK,KAAKyI,GAGzBtO,KAAKgQ,SAAU,CACjB,CAKA,cAAAK,GACE,OAAOrQ,KAAK4P,WACd,CAKA,eAAAU,GACE,OAAOtQ,KAAK6P,YACd,CAKA,kBAAAU,GACE,OAAOvQ,KAAK8P,eACd,CAKA,eAAAU,GACE,OAAOxQ,KAAK+P,YACd,CAKA,OAAAtH,GACOzI,KAAKgQ,UAIVhQ,KAAK4P,YAAYnH,UACjBzI,KAAK6P,aAAapH,UAClBzI,KAAK8P,gBAAgBrH,UACrBzI,KAAK+P,aAAatH,UAElBzI,KAAKgQ,SAAU,EACjB,ECzFF,MAAMS,EAAN,WAAA5Q,GACUE,EAAAC,KAAA,WAA8B,IAC9BD,EAAAC,KAAA,iBAAsCS,KACtCV,EAAAC,KAAA,eAAuB,IAAA,CAK/B,IAAA6F,GACE,GAAsB,oBAAXvD,OACT,OAIF,MAAMoO,EAAuB/P,IAEvBA,aAAiBgQ,WAEnB3Q,KAAK4Q,cAAcjQ,GAGnBX,KAAK6Q,oBAAoBlQ,IAI7B2B,OAAO2E,iBAAiB,QAASyJ,GAAqB,GACtD1Q,KAAK8Q,SAAS/P,KAAK,KACjBuB,OAAOoG,oBAAoB,QAASgI,GAAqB,KAI3D,MAAMK,EAAuBpQ,IAC3BX,KAAKgR,mBAAmBrQ,IAE1B2B,OAAO2E,iBAAiB,qBAAsB8J,GAC9C/Q,KAAK8Q,SAAS/P,KAAK,KACjBuB,OAAOoG,oBAAoB,qBAAsBqI,IAErD,CAKQ,aAAAH,CAAcjQ,SACpB,IACE,MAAMsQ,EAAyB,CAC7B/K,KAAM,QACNC,KAAM,WACNC,UAAWrE,KAAKC,MAChBqE,IAAK1F,EAAMuQ,UAAY7O,IACvBM,MAAOF,IACP0O,UAAW,KACXC,QAASzQ,EAAMyQ,SAAW,gBAC1BC,MAAQ,OAAA3L,EAAA/E,EAAMc,YAAN,EAAAiE,EAAuB2L,MAC/BH,SAAUvQ,EAAMuQ,SAChBI,OAAQ3Q,EAAM2Q,OACdC,MAAO5Q,EAAM4Q,OAGfvR,KAAKwR,UAAUP,EACjB,OAASxP,GACPC,QAAQD,MAAM,yCAA0CA,EAC1D,CACF,CAKQ,kBAAAuP,CAAmBrQ,GACzB,IACE,MAAM8Q,EAAS9Q,EAAM8Q,OACrB,IACIJ,EADAD,EAAU,8BAGVK,aAAkBC,OACpBN,EAAUK,EAAOL,QACjBC,EAAQI,EAAOJ,OAEfD,EAD2B,iBAAXK,EACNA,EAEAE,KAAKC,UAAUH,GAG3B,MAAMR,EAAyB,CAC7B/K,KAAM,QACNC,KAAM,gBACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP0O,UAAW,UACXC,UACAC,SAGFrR,KAAKwR,UAAUP,EACjB,OAASxP,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,CACF,CAKQ,mBAAAoP,CAAoBlQ,SAC1B,IACE,MAAM0J,EAAS1J,EAAM0J,OACrB,IAAKA,EACH,OAIF,MAAM7E,EAAU,OAAAE,EAAA2E,EAAO7E,cAAP,EAAAE,EAAgBlB,cAChC,IAAK,CAAC,MAAO,SAAU,OAAQ,QAAS,SAAS0H,SAAS1G,GACxD,OAGF,IAAIqM,EAAc,GAWlB,GAVIxH,aAAkByH,kBAEXzH,aAAkB0H,kBAD3BF,EAAcxH,EAAO2H,KAAO,GAGnB3H,aAAkB4H,gBAC3BJ,EAAcxH,EAAO7H,MAAQ,IACpB6H,aAAkB6H,kBAAoB7H,aAAkB8H,oBACjEN,EAAcxH,EAAO2H,KAAO,KAGzBH,EACH,OAGF,MAAMZ,EAAyB,CAC7B/K,KAAM,QACNC,KAAM,iBACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP0O,UAAW,WACXC,QAAS,4BAA4BS,IACrCA,cACAO,aAAc5M,GAGhBxF,KAAKwR,UAAUP,EACjB,OAASxP,GACPC,QAAQD,MAAM,+CAAgDA,EAChE,CACF,CAKQ,WAAA4Q,CAAYpB,GAClB,MAAMqB,EAAkB,CAACrB,EAAWE,UAAWF,EAAWG,SAoB1D,MAjB6B,OAAzBH,EAAWE,WAA+C,YAAzBF,EAAWE,YAC1CF,EAAWC,UACboB,EAAMvR,KAAKkQ,EAAWC,UAEpBD,EAAWK,QACbgB,EAAMvR,KAAKwR,OAAOtB,EAAWK,SAE3BL,EAAWM,OACbe,EAAMvR,KAAKwR,OAAOtB,EAAWM,SAKJ,aAAzBN,EAAWE,WAA4BF,EAAWY,aACpDS,EAAMvR,KAAKkQ,EAAWY,aAGjBS,EAAMpN,KAAK,IACpB,CAKQ,SAAAsM,CAAUP,GAEhB,MAAMuB,EAAWxS,KAAKqS,YAAYpB,GAC5BwB,EAAWzS,KAAK0S,WAAWzS,IAAIuS,GAC/BxQ,EAAMD,KAAKC,MAEbyQ,GAAYzQ,EAAMyQ,EAAWzS,KAAK4I,eAMtC5I,KAAK0S,WAAWtS,IAAIoS,EAAUxQ,GAG9BhC,KAAK2S,uBAAuB3Q,GAGN,oBAAXM,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,QAAS2P,GAEnI,CAKQ,sBAAA0B,CAAuB3Q,GAE7B,IAAA,MAAY9B,EAAKyJ,KAAS3J,KAAK0S,WAAWE,UACpC5Q,EAAM2H,EAFO,KAGf3J,KAAK0S,WAAWzR,OAAOf,EAG7B,CAKA,UAAA2S,CAAWpR,EAAuBqR,GAChC,IACE,IAAI1B,EACAC,EAEA5P,aAAiBiQ,OACnBN,EAAU3P,EAAM2P,QAChBC,EAAQ5P,EAAM4P,OAEdD,EAAU3P,EAGZ,MAAMwP,EAAyB,CAC7B/K,KAAM,QACNC,KAAM,eACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP0O,UAAW,KACXC,UACAC,QACA0B,WAAYD,GAGd9S,KAAKwR,UAAUP,EACjB,OAAS+B,GACPtR,QAAQD,MAAM,6CAA8CuR,EAC9D,CACF,CAKA,OAAAvK,GACEzI,KAAK8Q,SAAStP,QAAQyR,GAAWA,KACjCjT,KAAK8Q,SAAW,GAChB9Q,KAAK0S,WAAW7Q,OAClB,EC7PF,MAAMqR,EAAN,WAAArT,GACUE,EAAAC,KAAA,WAAuC,MACvCD,EAAAC,KAAA,6BAAqC,GACrCD,EAAAC,KAAA,oBAAyCS,KACzCV,EAAAC,KAAA,oBAAyCS,KACzCV,EAAAC,KAAA,uBAA+B,KAC/BD,EAAAC,KAAA,uBAA+B,IAAA,CAKvC,IAAA6F,GACwB,oBAAXvD,QAA2BA,OAAO6Q,cAKjB,aAAxBzQ,SAAS0Q,YACXpT,KAAKqT,0BACLrT,KAAKsT,yBAELhR,OAAO2E,iBAAiB,OAAQ,KAC9BjH,KAAKqT,0BACLrT,KAAKsT,0BAKTtT,KAAKuT,mBACP,CAKQ,uBAAAF,GAEN,IAAIrT,KAAKwT,0BAIT,IACE,MAAMC,EAASN,YAAYO,iBAAiB,cAAc,GAC1D,IAAKD,EACH,OAGF,MAAME,EAAkC,CAEtCC,IAAKH,EAAOI,gBAAkBJ,EAAOK,kBAErCC,IAAKN,EAAOO,WAAaP,EAAOQ,aAEhCC,IAAKT,EAAOU,sBAAwB,EAAIV,EAAOO,WAAaP,EAAOU,sBAAwB,EAE3FC,KAAMX,EAAOY,cAAgBZ,EAAOa,aAEpCC,SAAUd,EAAOe,YAAcf,EAAOY,cAEtCI,SAAUhB,EAAOiB,eAAiBjB,EAAOe,YAEzCG,aAAclB,EAAOmB,eAAiBnB,EAAOoB,yBAE7CC,MAAOrB,EAAOsB,aAAetB,EAAOuB,WAEpCC,iBAAkBxB,EAAOoB,yBAA2BpB,EAAOuB,WAE3DE,KAAMzB,EAAOsB,aAAetB,EAAOuB,YAG/BG,EAAqC,CACzCjP,KAAM,cACNC,KAAM,oBACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP2S,WAAY,aACZzB,WAGF3T,KAAKwT,2BAA4B,EACjCxT,KAAKqV,gBAAgBF,EACvB,OAAS1T,GACPC,QAAQD,MAAM,0DAA2DA,EAC3E,CACF,CAKQ,qBAAA6R,GACN,IACE,MAAMgC,EAAYnC,YAAYO,iBAAiB,YAC/C,IAAK4B,GAAkC,IAArBA,EAAUrQ,OAC1B,OAGF,MAAMjD,EAAMD,KAAKC,MACjBsT,EAAU9T,QAAQ+T,IAChB,MAAM1D,EAAc0D,EAASpP,KAGvBsM,EAAWzS,KAAKwV,cAAcvV,IAAI4R,GACxC,GAAIY,GAAYzQ,EAAMyQ,EAAWzS,KAAKyV,qBACpC,OAIFzV,KAAKwV,cAAcpV,IAAIyR,EAAa7P,GAEpC,MAAM2R,EAAkC,CAEtCC,IAAK2B,EAAS1B,gBAAkB0B,EAASzB,kBAEzCC,IAAKwB,EAASvB,WAAauB,EAAStB,aAEpCyB,QAASH,EAASlB,cAAgBkB,EAASjB,aAE3CC,SAAUgB,EAASf,YAAce,EAASlB,cAE1CS,MAAOS,EAASf,YAAce,EAAS3O,UAEvC+O,KAAOJ,EAAmEK,cAAgB,GAGtFT,EAAqC,CACzCjP,KAAM,cACNC,KAAM,kBACNC,UAAWpE,EACXqE,IAAKhE,IACLM,MAAOF,IACP2S,WAAY,WACZzB,QAAS,IACJA,EACH9B,YAAa0D,EAASpP,KACtBiM,aAAcmD,EAASM,gBAI3B7V,KAAKqV,gBAAgBF,KAIvBnV,KAAK8V,0BAA0B9T,EACjC,OAASP,GACPC,QAAQD,MAAM,wDAAyDA,EACzE,CACF,CAKQ,gBAAA8R,GACN,GAAmC,oBAAxBwC,oBAIX,IAEE,MAAMC,EAAwB9S,EAAS,IAAI3B,KACzC,MAAMiK,EAAQjK,EAAK,GACbS,EAAMD,KAAKC,MAEXiU,EAAU,GAAGzK,EAAM5E,aAAa4E,EAAM1E,WAGtC2L,EAAWzS,KAAKkW,cAAcjW,IAAIgW,GACxC,GAAIxD,GAAYzQ,EAAMyQ,EAAWzS,KAAKmW,qBACpC,OAIFnW,KAAKkW,cAAc9V,IAAI6V,EAASjU,GAEhC,MAAMmT,EAAqC,CACzCjP,KAAM,cACNC,KAAM,WACNC,UAAWpE,EACXqE,IAAKhE,IACLM,MAAOF,IACP2S,WAAY,WACZzB,QAAS,CACP7M,SAAU0E,EAAM1E,SAChBF,UAAW4E,EAAM5E,YAIrB5G,KAAKqV,gBAAgBF,GAGrBnV,KAAKoW,0BAA0BpU,IAC9BhC,KAAKmW,sBAERnW,KAAKuL,SAAW,IAAIwK,oBAAoBM,IACtCA,EAAKC,aAAa9U,QAAQgK,IACA,aAApBA,EAAM+K,WACRP,EAAsBxK,OAK5BxL,KAAKuL,SAASO,QAAQ,CAAE0K,WAAY,CAAC,aACvC,OAAS/U,GACPC,QAAQD,MAAM,kDAAmDA,EACnE,CACF,CAKQ,yBAAAqU,CAA0B9T,GAEhC,IAAA,MAAY9B,EAAKyJ,KAAS3J,KAAKwV,cAAc5C,UACvC5Q,EAAM2H,EAFO,KAGf3J,KAAKwV,cAAcvU,OAAOf,EAGhC,CAKQ,yBAAAkW,CAA0BpU,GAEhC,IAAA,MAAY9B,EAAKyJ,KAAS3J,KAAKkW,cAActD,UACvC5Q,EAAM2H,EAFO,KAGf3J,KAAKkW,cAAcjV,OAAOf,EAGhC,CAKQ,eAAAmV,CAAgBF,GAEA,oBAAX7S,QAA2BA,OAA+FyE,mBAClIzE,OAA8FyE,kBAAkBzF,KAAK,cAAe6T,EAEzI,CAKA,cAAAsB,GACE,IACE,MAAMhD,EAASN,YAAYO,iBAAiB,cAAc,GAC1D,IAAKD,EACH,OAAO,KAGT,MAAME,EAAkC,CACtCC,IAAKH,EAAOI,gBAAkBJ,EAAOK,kBACrCC,IAAKN,EAAOO,WAAaP,EAAOQ,aAChCG,KAAMX,EAAOY,cAAgBZ,EAAOa,aACpCC,SAAUd,EAAOe,YAAcf,EAAOY,cACtCI,SAAUhB,EAAOiB,eAAiBjB,EAAOe,YACzCG,aAAclB,EAAOmB,eAAiBnB,EAAOoB,yBAC7CC,MAAOrB,EAAOsB,aAAetB,EAAOuB,YAGtC,MAAO,CACL9O,KAAM,cACNC,KAAM,qBACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP2S,WAAY,aACZzB,UAEJ,OAASlS,GAEP,OADAC,QAAQD,MAAM,gDAAiDA,GACxD,IACT,CACF,CAKA,OAAAgH,GACMzI,KAAKuL,WACPvL,KAAKuL,SAAS4C,aACdnO,KAAKuL,SAAW,MAElBvL,KAAKwT,2BAA4B,EACjCxT,KAAKwV,cAAc3T,QACnB7B,KAAKkW,cAAcrU,OACrB,EC/RF,MAAM6U,EAIJ,KAAAC,CAAMC,EAAmB7D,GAWvB,MAViC,CAC/B7M,KAAM,SACNC,KAAM,SACNyQ,YACAxQ,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACPsQ,aAIJ,EClBF,MAAM8D,EAKJ,YAAAC,CAAazX,GACX,OAAIA,GAAc,KAGdA,GAAc,IAGX4C,KAAKC,SAAW7C,CACzB,CAKA,oBAAA0X,CAAqBC,EAAqB3X,GACxC,QAAI2X,GAGGhX,KAAK8W,aAAazX,EAC3B,ECtBF,MAAM4X,EAAN,WAAApX,GACUE,EAAAC,KAAA,iBAAsCS,KAEtCV,EAAAC,KAAA,gBAAwC,CAC9CkX,MAAO,IACPC,SAAU,IACV1V,MAAO,IACP0R,YAAa,IACbiE,SAAU,IACVC,MAAO,IACPC,OAAQ,MAEFvX,EAAAC,KAAA,sBAA8B,IAAA,CAKtC,WAAAuX,CAAY5W,GACV,MAAMT,EAAMF,KAAKwX,YAAY7W,GACvB8R,EAAWzS,KAAKyX,WAAWxX,IAAIC,GAC/B8B,EAAMD,KAAKC,MAGjB,IAAI0V,EAAe1X,KAAK2X,cAAchX,EAAMuF,OAASlG,KAAK4X,oBAG1D,GAAmB,WAAfjX,EAAMuF,MAAqB,cAAevF,EAAO,CACnD,MAAMiW,EAAYjW,EAAMiW,UACN,gBAAdA,GAA6C,iBAAdA,IACjCc,EAAe,IAEnB,CAEA,SAAIjF,GAAYzQ,EAAMyQ,EAAWiF,KAIjC1X,KAAKyX,WAAWrX,IAAIF,EAAK8B,GACzBhC,KAAK6X,kBAAkB7V,IAChB,EACT,CAKQ,WAAAwV,CAAY7W,GAClB,MAAM2R,EAAkB,CAAC3R,EAAMuF,KAAMvF,EAAMwF,KAAMxF,EAAM0F,KAEvD,GAAmB,UAAf1F,EAAMuF,MAAoB,gBAAiBvF,GAI7C,GAHA2R,EAAMvR,KAAKJ,EAAM6J,aAAe,IAG5B,aAAc7J,GAASA,EAAM2J,SAAU,CACzC,MAAMwN,EAAY,GACZvO,EAAItH,KAAK8V,MAAMpX,EAAM2J,SAASf,EAAIuO,GAAaA,EAC/CrO,EAAIxH,KAAK8V,MAAMpX,EAAM2J,SAASb,EAAIqO,GAAaA,EACrDxF,EAAMvR,KAAK,GAAGwI,KAAKE,IACrB,OACF,GAA0B,aAAf9I,EAAMuF,MAAuB,gBAAiBvF,EACvD2R,EAAMvR,KAAKJ,EAAM6J,aAAe,SAClC,GAA0B,UAAf7J,EAAMuF,MAAoB,gBAAiBvF,EAAO,CAI3D,GAHA2R,EAAMvR,KAAKJ,EAAM6J,aAAe,IAG5B,UAAW7J,QAAyB,IAAhBA,EAAMN,OAAuC,OAAhBM,EAAMN,MAAgB,CAEzE,MAAM2X,EAAWzF,OAAO5R,EAAMN,OACxB4X,EAAYD,EAAS/S,OAAS,GAAK+S,EAAS5V,UAAU,EAAG,IAAM4V,EACrE1F,EAAMvR,KAAKf,KAAKkY,WAAWD,GAC7B,KAAW,gBAAiBtX,QAA+B,IAAtBA,EAAMqO,aAEzCsD,EAAMvR,KAAKwR,OAAO5R,EAAMqO,cAGtB,gBAAiBrO,GAASA,EAAMmO,aAClCwD,EAAMvR,KAAK,YAEf,MAAA,GAA0B,UAAfJ,EAAMuF,MAAoB,YAAavF,EAChD2R,EAAMvR,KAAKJ,EAAMyQ,SAEb,aAAczQ,GAASA,EAAMuQ,UAC/BoB,EAAMvR,KAAKJ,EAAMuQ,UAEf,WAAYvQ,GAASA,EAAM2Q,QAC7BgB,EAAMvR,KAAKwR,OAAO5R,EAAM2Q,SAEtB,UAAW3Q,GAASA,EAAM4Q,OAC5Be,EAAMvR,KAAKwR,OAAO5R,EAAM4Q,QAGtB,gBAAiB5Q,GAASA,EAAMkR,aAClCS,EAAMvR,KAAKJ,EAAMkR,kBAErB,GAA0B,gBAAflR,EAAMuF,MAA0B,eAAgBvF,EAGzD,GADA2R,EAAMvR,KAAKJ,EAAMyU,YACQ,aAArBzU,EAAMyU,YAA6B,YAAazU,GAASA,EAAMgT,QAAS,CAE1E,MAAM9B,EAAelR,EAAMgT,QAAoC9B,YAC3DA,GACFS,EAAMvR,KAAKwR,OAAOV,GAEtB,SAAgC,aAArBlR,EAAMyU,YAA6B,YAAazU,GAASA,EAAMgT,QAAS,CAEjF,MAAMA,EAAUhT,EAAMgT,aACI,IAAtBA,EAAQ/M,gBAAgD,IAArB+M,EAAQ7M,UAC7CwL,EAAMvR,KAAK,GAAG4S,EAAQ/M,aAAa+M,EAAQ7M,WAE/C,MAAWnG,EAAMyU,gBAInB,GAA0B,WAAfzU,EAAMuF,MAAqB,cAAevF,GAInD,GAHA2R,EAAMvR,KAAKJ,EAAMiW,WAGO,gBAApBjW,EAAMiW,WAAmD,iBAApBjW,EAAMiW,WAC7C,GAAIjW,EAAMoS,WAAY,CACpB,MAAMoF,EAAQxX,EAAMoS,WAEdqF,EAASD,EAAM9R,IAAMkM,OAAO4F,EAAM9R,KAAO,GACzCgS,EAASF,EAAME,OAAS9F,OAAO4F,EAAME,QAAU,GAC/CC,EAAUH,EAAMG,QAAU/F,OAAO4F,EAAMG,SAAW,GAExD,GAAIF,GAAUC,GAAUC,EAEtBhG,EAAMvR,KAAKuX,GAAW,GAAGD,KAAUD,UAGnC,IACE,MAAMG,EAAW5G,KAAKC,UAAUjR,EAAMoS,YACtCT,EAAMvR,KAAKwX,EAASnW,UAAU,EAAG,KACnC,CAAA,MACEkQ,EAAMvR,KAAKwR,OAAO3O,OAAO4U,KAAK7X,EAAMoS,YAAY9N,QAClD,CAEJ,OAGA,GAAItE,EAAMoS,WACR,IACE,MAAMwF,EAAW5G,KAAKC,UAAUjR,EAAMoS,YAEtCT,EAAMvR,KAAKwX,EAASnW,UAAU,EAAG,KACnC,CAAA,MAEEkQ,EAAMvR,KAAKwR,OAAO3O,OAAO4U,KAAK7X,EAAMoS,YAAY9N,QAClD,OAGN,GAA0B,aAAftE,EAAMuF,KAAqB,CAEpC,MAAMuS,EAAaxW,KAAK8V,MAAMpX,EAAMyF,UAAY,KAChDkM,EAAMvR,KAAKwR,OAAOkG,GACpB,CAEA,OAAOnG,EAAMpN,KAAK,IACpB,CAKQ,UAAAgT,CAAWQ,GACjB,IAAIC,EAAO,EACX,IAAA,IAASC,EAAI,EAAGA,EAAIF,EAAIzT,OAAQ2T,IAAK,CAEnCD,GAASA,GAAQ,GAAKA,EADTD,EAAIG,WAAWD,GAE5BD,GAAcA,CAChB,CAEA,OAAO1W,KAAK8H,IAAI4O,GAAMxW,SAAS,IAAIC,UAAU,EAAG,EAClD,CAKQ,iBAAAyV,CAAkB7V,GAExB,MACM8W,EAA0B,EADb7W,KAAKyL,OAAO9J,OAAOmV,OAAO/Y,KAAK2X,eAAgB3X,KAAK4X,qBAGvE,IAAA,MAAY1X,EAAKyJ,KAAS3J,KAAKyX,WAAW7E,UACpC5Q,EAAM2H,EAAOmP,GACf9Y,KAAKyX,WAAWxW,OAAOf,EAG7B,CAKA,KAAA2B,GACE7B,KAAKyX,WAAW5V,OAClB;wEC5JF,SAASmX,EAAOC,GAAO,IAAIC,EAAMD,EAAIhU,OAAQ,OAASiU,GAAO,GAAKD,EAAIC,GAAO,CAAK,CAIlF,MAiBMC,EAAkB,IAGlBC,EAAkBD,IAGlBE,EAAkB,GASlBC,EAAkB,GA2BlBC,EAAA,IACAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEpEC,EAAA,IACAD,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAE7EE,EAAA,IACAF,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEhDG,EACJ,IAAIH,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAgBxDI,EAAgB,IAAIpW,MAAA,KAC1BwV,EAAOY,GAOP,MAAMC,EAAgB,IAAIrW,MAAM6V,IAChCL,EAAOa,GAKP,MAAMC,EAAgB,IAAItW,MAjBJ,KAkBtBwV,EAAOc,GAMP,MAAMC,EAAgB,IAAIvW,MAAMwW,KAChChB,EAAOe,GAGP,MAAME,EAAgB,IAAIzW,MAhGF,IAiGxBwV,EAAOiB,GAGP,MAAMC,EAAgB,IAAI1W,MAAM6V,GAKhC,SAASc,EAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElExa,KAAKoa,YAAeA,EACpBpa,KAAKqa,WAAeA,EACpBra,KAAKsa,WAAeA,EACpBta,KAAKua,MAAeA,EACpBva,KAAKwa,WAAeA,EAGpBxa,KAAKya,UAAeL,GAAeA,EAAYnV,MACjD,CAGA,IAAIyV,EACAC,EACAC,EAGJ,SAASC,EAASC,EAAUC,GAC1B/a,KAAK8a,SAAWA,EAChB9a,KAAKgb,SAAW,EAChBhb,KAAK+a,UAAYA,CACnB,CA1BA/B,EAAOkB,GA8BP,MAAMe,EAAUC,GAEPA,EAAO,IAAMpB,EAAWoB,GAAQpB,EAAW,KAAOoB,IAAS,IAQ9DC,EAAY,CAACC,EAAGC,KAGpBD,EAAEE,YAAYF,EAAEG,WAAmB,IAALF,EAC9BD,EAAEE,YAAYF,EAAEG,WAAcF,IAAM,EAAK,KAQrCG,EAAY,CAACJ,EAAG/a,EAAO4E,KAEvBmW,EAAEK,SAtIc,GAsISxW,GAC3BmW,EAAEM,QAAWrb,GAAS+a,EAAEK,SAAY,MACpCN,EAAUC,EAAGA,EAAEM,QACfN,EAAEM,OAASrb,GAzIO,GAyIc+a,EAAEK,SAClCL,EAAEK,UAAYxW,EA1II,KA4IlBmW,EAAEM,QAAWrb,GAAS+a,EAAEK,SAAY,MACpCL,EAAEK,UAAYxW,IAKZ0W,EAAY,CAACP,EAAGQ,EAAGC,KAEvBL,EAAUJ,EAAGS,EAAS,EAAJD,GAAiBC,EAAS,EAAJD,EAAQ,KAS5CE,EAAa,CAACC,EAAM7C,KAExB,IAAI8C,EAAM,EACV,GACEA,GAAc,EAAPD,EACPA,KAAU,EACVC,IAAQ,UACC9C,EAAM,GACjB,OAAO8C,IAAQ,GAiIXC,EAAY,CAACJ,EAAMb,EAAUkB,KAKjC,MAAMC,EAAY,IAAI3Y,MAAM8V,IAC5B,IACI8C,EACAC,EAFAN,EAAO,EAOX,IAAKK,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjCL,EAAQA,EAAOG,EAASE,EAAO,IAAO,EACtCD,EAAUC,GAAQL,EASpB,IAAKM,EAAI,EAAIA,GAAKrB,EAAUqB,IAAK,CAC/B,IAAInD,EAAM2C,EAAS,EAAJQ,EAAQ,GACX,IAARnD,IAEJ2C,EAAS,EAAJQ,GAAkBP,EAAWK,EAAUjD,KAAQA,GAItD,GAgHIoD,EAAclB,IAElB,IAAIiB,EAGJ,IAAKA,EAAI,EAAGA,EAAIjD,EAAYiD,IAAOjB,EAAEmB,UAAc,EAAJF,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAAIhD,EAAYgD,IAAOjB,EAAEoB,UAAc,EAAJH,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAtcU,GAscMA,IAAOjB,EAAEqB,QAAY,EAAJJ,GAAkB,EAE/DjB,EAAEmB,UAAUG,KAA0B,EACtCtB,EAAEuB,QAAUvB,EAAEwB,WAAa,EAC3BxB,EAAEyB,SAAWzB,EAAE0B,QAAU,GAOrBC,EAAa3B,IAEbA,EAAEK,SAAW,EACfN,EAAUC,EAAGA,EAAEM,QACNN,EAAEK,SAAW,IAEtBL,EAAEE,YAAYF,EAAEG,WAAaH,EAAEM,QAEjCN,EAAEM,OAAS,EACXN,EAAEK,SAAW,GAOTuB,EAAU,CAACnB,EAAMQ,EAAGY,EAAGC,KAE3B,MAAMC,EAAU,EAAJd,EACNe,EAAU,EAAJH,EACZ,OAAQpB,EAAKsB,GAAgBtB,EAAKuB,IAC1BvB,EAAKsB,KAAkBtB,EAAKuB,IAAiBF,EAAMb,IAAMa,EAAMD,IASnEI,EAAa,CAACjC,EAAGS,EAAMyB,KAK3B,MAAMC,EAAInC,EAAEoC,KAAKF,GACjB,IAAIG,EAAIH,GAAK,EACb,KAAOG,GAAKrC,EAAEsC,WAERD,EAAIrC,EAAEsC,UACRV,EAAQnB,EAAMT,EAAEoC,KAAKC,EAAI,GAAIrC,EAAEoC,KAAKC,GAAIrC,EAAE8B,QAC1CO,KAGET,EAAQnB,EAAM0B,EAAGnC,EAAEoC,KAAKC,GAAIrC,EAAE8B,SAGlC9B,EAAEoC,KAAKF,GAAKlC,EAAEoC,KAAKC,GACnBH,EAAIG,EAGJA,IAAM,EAERrC,EAAEoC,KAAKF,GAAKC,GAURI,GAAiB,CAACvC,EAAGwC,EAAOC,KAKhC,IAAI3C,EACA4C,EAEA/B,EACAgC,EAFAC,EAAK,EAIT,GAAmB,IAAf5C,EAAEyB,SACJ,GACE3B,EAAyC,IAAlCE,EAAEE,YAAYF,EAAE6C,QAAUD,KACjC9C,IAA2C,IAAlCE,EAAEE,YAAYF,EAAE6C,QAAUD,OAAiB,EACpDF,EAAK1C,EAAEE,YAAYF,EAAE6C,QAAUD,KAClB,IAAT9C,EACFS,EAAUP,EAAG0C,EAAIF,IAIjB7B,EAAOhC,EAAa+D,GACpBnC,EAAUP,EAAGW,EAAO5C,EAAa,EAAGyE,GACpCG,EAAQxE,EAAYwC,GACN,IAAVgC,IACFD,GAAM7D,EAAY8B,GAClBP,EAAUJ,EAAG0C,EAAIC,IAEnB7C,IACAa,EAAOd,EAAOC,GAGdS,EAAUP,EAAGW,EAAM8B,GACnBE,EAAQtE,EAAYsC,GACN,IAAVgC,IACF7C,GAAQhB,EAAU6B,GAClBP,EAAUJ,EAAGF,EAAM6C,WAOhBC,EAAK5C,EAAEyB,UAGlBlB,EAAUP,EA1iBQ,IA0iBMwC,IAYpBM,GAAa,CAAC9C,EAAG+C,KAIrB,MAAMtC,EAAWsC,EAAKrD,SAChBsD,EAAWD,EAAKpD,UAAUX,YAC1BK,EAAY0D,EAAKpD,UAAUN,UAC3BF,EAAW4D,EAAKpD,UAAUR,MAChC,IAAI8B,EAAGY,EAEHoB,EADArD,GAAW,EAUf,IAHAI,EAAEsC,SAAW,EACbtC,EAAEkD,SAxlBoB,IA0lBjBjC,EAAI,EAAGA,EAAI9B,EAAO8B,IACQ,IAAzBR,EAAS,EAAJQ,IACPjB,EAAEoC,OAAOpC,EAAEsC,UAAY1C,EAAWqB,EAClCjB,EAAE8B,MAAMb,GAAK,GAGbR,EAAS,EAAJQ,EAAQ,GAAa,EAS9B,KAAOjB,EAAEsC,SAAW,GAClBW,EAAOjD,EAAEoC,OAAOpC,EAAEsC,UAAa1C,EAAW,IAAMA,EAAW,EAC3Da,EAAY,EAAPwC,GAAqB,EAC1BjD,EAAE8B,MAAMmB,GAAQ,EAChBjD,EAAEuB,UAEElC,IACFW,EAAEwB,YAAcwB,EAAa,EAAPC,EAAW,IASrC,IALAF,EAAKnD,SAAWA,EAKXqB,EAAKjB,EAAEsC,UAAY,EAAcrB,GAAK,EAAGA,IAAOgB,EAAWjC,EAAGS,EAAMQ,GAKzEgC,EAAO9D,EACP,GAGE8B,EAAIjB,EAAEoC,KAAK,GACXpC,EAAEoC,KAAK,GAAiBpC,EAAEoC,KAAKpC,EAAEsC,YACjCL,EAAWjC,EAAGS,EAAM,GAGpBoB,EAAI7B,EAAEoC,KAAK,GAEXpC,EAAEoC,OAAOpC,EAAEkD,UAAYjC,EACvBjB,EAAEoC,OAAOpC,EAAEkD,UAAYrB,EAGvBpB,EAAY,EAAPwC,GAAqBxC,EAAS,EAAJQ,GAAkBR,EAAS,EAAJoB,GACtD7B,EAAE8B,MAAMmB,IAASjD,EAAE8B,MAAMb,IAAMjB,EAAE8B,MAAMD,GAAK7B,EAAE8B,MAAMb,GAAKjB,EAAE8B,MAAMD,IAAM,EACvEpB,EAAS,EAAJQ,EAAQ,GAAaR,EAAS,EAAJoB,EAAQ,GAAaoB,EAGpDjD,EAAEoC,KAAK,GAAiBa,IACxBhB,EAAWjC,EAAGS,EAAM,SAEbT,EAAEsC,UAAY,GAEvBtC,EAAEoC,OAAOpC,EAAEkD,UAAYlD,EAAEoC,KAAK,GA5cb,EAACpC,EAAG+C,KAIrB,MAAMtC,EAAkBsC,EAAKrD,SACvBE,EAAkBmD,EAAKnD,SACvBoD,EAAkBD,EAAKpD,UAAUX,YACjCK,EAAkB0D,EAAKpD,UAAUN,UACjCsD,EAAkBI,EAAKpD,UAAUV,WACjCkE,EAAkBJ,EAAKpD,UAAUT,WACjCE,EAAkB2D,EAAKpD,UAAUP,WACvC,IAAIgE,EACAnC,EAAGY,EACHb,EACAqC,EACAC,EACAC,EAAW,EAEf,IAAKvC,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjChB,EAAEc,SAASE,GAAQ,EAQrB,IAFAP,EAA0B,EAArBT,EAAEoC,KAAKpC,EAAEkD,UAAgB,GAAa,EAEtCE,EAAIpD,EAAEkD,SAAW,EAAGE,EAtOH,IAsOoBA,IACxCnC,EAAIjB,EAAEoC,KAAKgB,GACXpC,EAAOP,EAA+B,EAA1BA,EAAS,EAAJQ,EAAQ,GAAiB,GAAa,EACnDD,EAAO5B,IACT4B,EAAO5B,EACPmE,KAEF9C,EAAS,EAAJQ,EAAQ,GAAaD,EAGtBC,EAAIrB,IAERI,EAAEc,SAASE,KACXqC,EAAQ,EACJpC,GAAKkC,IACPE,EAAQV,EAAM1B,EAAIkC,IAEpBG,EAAI7C,EAAS,EAAJQ,GACTjB,EAAEuB,SAAW+B,GAAKtC,EAAOqC,GACrBhE,IACFW,EAAEwB,YAAc8B,GAAKN,EAAU,EAAJ/B,EAAQ,GAAaoC,KAGpD,GAAiB,IAAbE,EAAJ,CAMA,EAAG,CAED,IADAvC,EAAO5B,EAAa,EACQ,IAArBY,EAAEc,SAASE,IAAeA,IACjChB,EAAEc,SAASE,KACXhB,EAAEc,SAASE,EAAO,IAAM,EACxBhB,EAAEc,SAAS1B,KAIXmE,GAAY,CACd,OAASA,EAAW,GAOpB,IAAKvC,EAAO5B,EAAqB,IAAT4B,EAAYA,IAElC,IADAC,EAAIjB,EAAEc,SAASE,GACF,IAANC,GACLY,EAAI7B,EAAEoC,OAAOgB,GACTvB,EAAIjC,IACJa,EAAS,EAAJoB,EAAQ,KAAeb,IAE9BhB,EAAEuB,UAAYP,EAAOP,EAAS,EAAJoB,EAAQ,IAAcpB,EAAS,EAAJoB,GACrDpB,EAAS,EAAJoB,EAAQ,GAAab,GAE5BC,IAjC0B,GA+Z9BuC,CAAWxD,EAAG+C,GAGdlC,EAAUJ,EAAMb,EAAUI,EAAEc,WAQxB2C,GAAY,CAACzD,EAAGS,EAAMb,KAK1B,IAAIqB,EAEAyC,EADAC,GAAU,EAGVC,EAAUnD,EAAK,GAEfoD,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZH,IACFE,EAAY,IACZC,EAAY,GAEdtD,EAAsB,GAAhBb,EAAW,GAAS,GAAa,MAElCqB,EAAI,EAAGA,GAAKrB,EAAUqB,IACzByC,EAASE,EACTA,EAAUnD,EAAe,GAATQ,EAAI,GAAS,KAEvB4C,EAAQC,GAAaJ,IAAWE,IAG3BC,EAAQE,EACjB/D,EAAEqB,QAAiB,EAATqC,IAAwBG,EAEd,IAAXH,GAELA,IAAWC,GAAW3D,EAAEqB,QAAiB,EAATqC,KACpC1D,EAAEqB,QAAQ2C,OAEDH,GAAS,GAClB7D,EAAEqB,QAAQ4C,MAGVjE,EAAEqB,QAAQ6C,MAGZL,EAAQ,EACRF,EAAUD,EAEM,IAAZE,GACFE,EAAY,IACZC,EAAY,GAEHL,IAAWE,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,KAUZI,GAAY,CAACnE,EAAGS,EAAMb,KAK1B,IAAIqB,EAEAyC,EADAC,GAAU,EAGVC,EAAUnD,EAAK,GAEfoD,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZH,IACFE,EAAY,IACZC,EAAY,GAGT9C,EAAI,EAAGA,GAAKrB,EAAUqB,IAIzB,GAHAyC,EAASE,EACTA,EAAUnD,EAAe,GAATQ,EAAI,GAAS,OAEvB4C,EAAQC,GAAaJ,IAAWE,GAAtC,CAGA,GAAWC,EAAQE,EACjB,GAAKxD,EAAUP,EAAG0D,EAAQ1D,EAAEqB,eAA+B,MAAVwC,QAE7B,IAAXH,GACLA,IAAWC,IACbpD,EAAUP,EAAG0D,EAAQ1D,EAAEqB,SACvBwC,KAGFtD,EAAUP,EA1vBI,GA0vBQA,EAAEqB,SACxBjB,EAAUJ,EAAG6D,EAAQ,EAAG,IAEfA,GAAS,IAClBtD,EAAUP,EA3vBI,GA2vBUA,EAAEqB,SAC1BjB,EAAUJ,EAAG6D,EAAQ,EAAG,KAGxBtD,EAAUP,EA5vBI,GA4vBYA,EAAEqB,SAC5BjB,EAAUJ,EAAG6D,EAAQ,GAAI,IAG3BA,EAAQ,EACRF,EAAUD,EACM,IAAZE,GACFE,EAAY,IACZC,EAAY,GAEHL,IAAWE,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdd,GAsIJ,IAAIK,IAAmB,EAKvB,MAuBMC,GAAqB,CAACrE,EAAGnC,EAAKyG,EAAYC,KAM9CnE,EAAUJ,KAA0BuE,EAAO,EAAI,GAAI,GACnD5C,EAAU3B,GACVD,EAAUC,EAAGsE,GACbvE,EAAUC,GAAIsE,GACVA,GACFtE,EAAEE,YAAYlb,IAAIgb,EAAE9Y,OAAOsd,SAAS3G,EAAKA,EAAMyG,GAAatE,EAAEG,SAEhEH,EAAEG,SAAWmE,GAoIf,IAMIG,GAAQ,CACXC,SA/KmB1E,IAGboE,KAnlBgB,MAErB,IAAInD,EACAD,EACAnX,EACA8W,EACAb,EACJ,MAAMgB,EAAW,IAAI1Y,MAAM8V,IAiB3B,IADArU,EAAS,EACJ8W,EAAO,EAAGA,EAAOgE,GAAoBhE,IAExC,IADA9B,EAAY8B,GAAQ9W,EACfoX,EAAI,EAAGA,EAAK,GAAK9C,EAAYwC,GAAQM,IACxCtC,EAAa9U,KAAY8W,EAY7B,IAJAhC,EAAa9U,EAAS,GAAK8W,EAG3Bb,EAAO,EACFa,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA7B,EAAU6B,GAAQb,EACbmB,EAAI,EAAGA,EAAK,GAAK5C,EAAYsC,GAAQM,IACxCvC,EAAWoB,KAAUa,EAKzB,IADAb,IAAS,EACFa,EAAO1C,EAAW0C,IAEvB,IADA7B,EAAU6B,GAAQb,GAAQ,EACrBmB,EAAI,EAAGA,EAAK,GAAM5C,EAAYsC,GAAQ,EAAKM,IAC9CvC,EAAW,IAAMoB,KAAUa,EAM/B,IAAKK,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjCF,EAASE,GAAQ,EAInB,IADAC,EAAI,EACGA,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KASX,IAHAD,EAAUrC,EAAcR,IAAe8C,GAGlCG,EAAI,EAAGA,EAAIhD,EAAWgD,IACzBxC,EAAiB,EAAJwC,EAAQ,GAAa,EAClCxC,EAAiB,EAAJwC,GAAkBP,EAAWO,EAAG,GAI/C3B,EAAgB,IAAIP,EAAeP,EAAcL,EAAaJ,IAAgBC,EAAWE,GACzFqB,EAAgB,IAAIR,EAAeN,EAAcJ,EAAa,EAAYJ,EAAWC,GACrFsB,EAAiB,IAAIT,EAAe,IAAI3W,MAAM,GAAIkW,EAAc,EAtb1C,GAiBJ,IAy5BhBsG,GACAR,IAAmB,GAGrBpE,EAAE6E,OAAU,IAAIpF,EAASO,EAAEmB,UAAW7B,GACtCU,EAAE8E,OAAU,IAAIrF,EAASO,EAAEoB,UAAW7B,GACtCS,EAAE+E,QAAU,IAAItF,EAASO,EAAEqB,QAAS7B,GAEpCQ,EAAEM,OAAS,EACXN,EAAEK,SAAW,EAGba,EAAWlB,IAgKZgF,iBAPwBX,GAQxBY,gBA1HyB,CAACjF,EAAGnC,EAAKyG,EAAYC,KAM7C,IAAIW,EAAUC,EACVC,EAAc,EAGdpF,EAAEqF,MAAQ,GA1gCgB,IA6gCxBrF,EAAEsF,KAAKC,YACTvF,EAAEsF,KAAKC,UA3GY,CAACvF,IAKxB,IACIiB,EADAuE,EAAa,WAIjB,IAAKvE,EAAI,EAAGA,GAAK,GAAIA,IAAKuE,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhCxF,EAAEmB,UAAc,EAAJF,GACnC,OAj7BwB,EAs7B5B,GAAoC,IAAhCjB,EAAEmB,UAAU,KAA0D,IAAjCnB,EAAEmB,UAAU,KAChB,IAAjCnB,EAAEmB,UAAU,IACd,OAv7B0B,EAy7B5B,IAAKF,EAAI,GAAIA,EAAIlD,EAAYkD,IAC3B,GAAoC,IAAhCjB,EAAEmB,UAAc,EAAJF,GACd,OA37BwB,EAk8B5B,OAn8B4B,GAihCLwE,CAAiBzF,IAItC8C,GAAW9C,EAAGA,EAAE6E,QAIhB/B,GAAW9C,EAAGA,EAAE8E,QAUhBM,EA1MkB,CAACpF,IAErB,IAAIoF,EAgBJ,IAbA3B,GAAUzD,EAAGA,EAAEmB,UAAWnB,EAAE6E,OAAOjF,UACnC6D,GAAUzD,EAAGA,EAAEoB,UAAWpB,EAAE8E,OAAOlF,UAGnCkD,GAAW9C,EAAGA,EAAE+E,SASXK,EAAcM,GAAgBN,GAAe,GACS,IAArDpF,EAAEqB,QAAgC,EAAxB9C,EAAS6G,GAAmB,GADSA,KAUrD,OAJApF,EAAEuB,SAAW,GAAK6D,EAAc,GAAK,EAAI,EAAI,EAItCA,GA8KSO,CAAc3F,GAG5BkF,EAAYlF,EAAEuB,QAAU,EAAI,IAAO,EACnC4D,EAAenF,EAAEwB,WAAa,EAAI,IAAO,EAMrC2D,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcb,EAAa,EAGnCA,EAAa,GAAKY,IAAsB,IAARrH,EASnCwG,GAAmBrE,EAAGnC,EAAKyG,EAAYC,GAjkCX,IAmkCnBvE,EAAE4F,UAA0BT,IAAgBD,GAErD9E,EAAUJ,KAA0BuE,EAAO,EAAI,GAAI,GACnDhC,GAAevC,EAAGxB,EAAcC,KAGhC2B,EAAUJ,KAAuBuE,EAAO,EAAI,GAAI,GAvM7B,EAACvE,EAAG6F,EAAQC,EAAQC,KAIzC,IAAIC,EASJ,IAHA5F,EAAUJ,EAAG6F,EAAS,IAAK,GAC3BzF,EAAUJ,EAAG8F,EAAS,EAAK,GAC3B1F,EAAUJ,EAAG+F,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B5F,EAAUJ,EAAGA,EAAEqB,QAAyB,EAAjB9C,EAASyH,GAAY,GAAY,GAI1D7B,GAAUnE,EAAGA,EAAEmB,UAAW0E,EAAS,GAGnC1B,GAAUnE,EAAGA,EAAEoB,UAAW0E,EAAS,IAkLjCG,CAAejG,EAAGA,EAAE6E,OAAOjF,SAAW,EAAGI,EAAE8E,OAAOlF,SAAW,EAAGwF,EAAc,GAC9E7C,GAAevC,EAAGA,EAAEmB,UAAWnB,EAAEoB,YAMnCF,EAAWlB,GAEPuE,GACF5C,EAAU3B,IA8CbkG,UApCmB,CAAClG,EAAGF,EAAM4C,KAK5B1C,EAAEE,YAAYF,EAAE6C,QAAU7C,EAAEyB,YAAc3B,EAC1CE,EAAEE,YAAYF,EAAE6C,QAAU7C,EAAEyB,YAAc3B,GAAQ,EAClDE,EAAEE,YAAYF,EAAE6C,QAAU7C,EAAEyB,YAAciB,EAC7B,IAAT5C,EAEFE,EAAEmB,UAAe,EAALuB,MAEZ1C,EAAE0B,UAEF5B,IAKAE,EAAEmB,UAAgD,GAArCxC,EAAa+D,GAAM3E,EAAa,MAC7CiC,EAAEoB,UAAyB,EAAfvB,EAAOC,OAGbE,EAAEyB,WAAazB,EAAEmG,SAc1BC,UAvIoBpG,IACnBI,EAAUJ,EAAGqG,EAAmB,GAChC9F,EAAUP,EAh8BQ,IAg8BMxB,GA/xBT,CAACwB,IAEG,KAAfA,EAAEK,UACJN,EAAUC,EAAGA,EAAEM,QACfN,EAAEM,OAAS,EACXN,EAAEK,SAAW,GAEJL,EAAEK,UAAY,IACvBL,EAAEE,YAAYF,EAAEG,WAAwB,IAAXH,EAAEM,OAC/BN,EAAEM,SAAW,EACbN,EAAEK,UAAY,IAsxBhBiG,CAAStG,KAuLX,IAAIuG,GAzBY,CAACC,EAAO3I,EAAKC,EAAK2I,KAChC,IAAIC,EAAc,MAARF,EACNG,EAAOH,IAAU,GAAM,MACvBvF,EAAI,EAER,KAAe,IAARnD,GAAW,CAIhBmD,EAAInD,EAAM,IAAO,IAAOA,EACxBA,GAAOmD,EAEP,GACEyF,EAAMA,EAAK7I,EAAI4I,KAAS,EACxBE,EAAMA,EAAKD,EAAK,UACPzF,GAEXyF,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,IA8BtB,MAeMC,GAAW,IAAIC,YAfH,MAChB,IAAIrG,EAAGsG,EAAQ,GAEf,IAAA,IAAS7F,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BT,EAAIS,EACJ,IAAA,IAASiB,EAAI,EAAGA,EAAI,EAAGA,IACrB1B,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDsG,EAAM7F,GAAKT,CACb,CAEA,OAAOsG,GAIwBC,IAiBjC,IAAIC,GAdU,CAACC,EAAKpJ,EAAKC,EAAK2I,KAC5B,MAAMS,EAAIN,GACJO,EAAMV,EAAM3I,EAElBmJ,IAAO,EAEP,IAAA,IAASzJ,EAAIiJ,EAAKjJ,EAAI2J,EAAK3J,IACzByJ,EAAOA,IAAQ,EAAKC,EAAmB,KAAhBD,EAAMpJ,EAAIL,KAGnC,OAAe,EAAPyJ,GAyBNG,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,wBAsBNC,GAAc,CAGhBC,WAAoB,EACpBC,gBAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EACpBC,SAAoB,EACpBC,QAAoB,EACpBC,QAAoB,EAKpBC,KAAoB,EACpBC,aAAoB,EACpBC,YAAoB,EACpBC,SAAmB,EACnBC,gBAAmB,EACnBC,cAAmB,EACnBC,aAAmB,EACnBC,aAAmB,EAInBC,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAAyB,EAGzBC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B,GAuB5B,MAAMvE,SAAEA,GAAAM,iBAAUA,GAAAC,gBAAkBA,GAAAiB,UAAiBA,GAAAE,UAAWA,IAAc3B,IAS5E6C,WAAY4B,GAAA3B,gBAAcA,GAAiBE,aAAc0B,GAAgBzB,SAAU0B,GAAYzB,QAAS0B,GACxGxB,KAAMyB,GAAQxB,aAAcyB,GAAgBtB,eAAgBuB,GAAkBtB,aAAcuB,GAAgBrB,YAAasB,GACzHlB,sBAAuBmB,GAAAlB,WACvBA,GAAAC,eAAYA,GAAAC,MAAgBA,GAAAC,QAAOA,GAASC,mBAAoBe,GAAAZ,UAChEA,GACAC,WAAYY,IACVxC,GA4BEyC,GAAY,IACZC,GAAiBD,IAIjBE,GAAiB,GAQjBC,GAAgB,IAChBC,GAAgB,IAShBC,GAAM,CAAC7E,EAAM8E,KACjB9E,EAAK+E,IAAMjD,GAASgD,GACbA,GAGHpE,GAAQ1C,GACE,EAALA,GAAYA,EAAK,EAAI,EAAI,GAG9BgH,GAAQzM,IACZ,IAAIC,EAAMD,EAAIhU,OAAQ,OAASiU,GAAO,GAAKD,EAAIC,GAAO,GAQlDyM,GAAcvK,IAClB,IAAIiB,EAAGY,EACH2I,EACAC,EAAQzK,EAAE0K,OAEdzJ,EAAIjB,EAAE2K,UACNH,EAAIvJ,EACJ,GACEY,EAAI7B,EAAE4K,OAAOJ,GACbxK,EAAE4K,KAAKJ,GAAM3I,GAAK4I,EAAQ5I,EAAI4I,EAAQ,UAC7BxJ,GACXA,EAAIwJ,EAEJD,EAAIvJ,EACJ,GACEY,EAAI7B,EAAE6K,OAAOL,GACbxK,EAAE6K,KAAKL,GAAM3I,GAAK4I,EAAQ5I,EAAI4I,EAAQ,UAI7BxJ,IAKb,IAII6J,GAJY,CAAC9K,EAAG6K,EAAME,KAAWF,GAAQ7K,EAAEgL,WAAcD,GAAQ/K,EAAEiL,UAavE,MAAMC,GAAiB5F,IACrB,MAAMtF,EAAIsF,EAAK6F,MAGf,IAAIrN,EAAMkC,EAAEG,QACRrC,EAAMwH,EAAK8F,YACbtN,EAAMwH,EAAK8F,WAED,IAARtN,IAEJwH,EAAK+F,OAAOrmB,IAAIgb,EAAEE,YAAYsE,SAASxE,EAAEsL,YAAatL,EAAEsL,YAAcxN,GAAMwH,EAAKiG,UACjFjG,EAAKiG,UAAazN,EAClBkC,EAAEsL,aAAgBxN,EAClBwH,EAAKkG,WAAa1N,EAClBwH,EAAK8F,WAAatN,EAClBkC,EAAEG,SAAgBrC,EACA,IAAdkC,EAAEG,UACJH,EAAEsL,YAAc,KAKdG,GAAmB,CAACzL,EAAGuE,KAC3BU,GAAgBjF,EAAIA,EAAE0L,aAAe,EAAI1L,EAAE0L,aAAc,EAAK1L,EAAE2L,SAAW3L,EAAE0L,YAAanH,GAC1FvE,EAAE0L,YAAc1L,EAAE2L,SAClBT,GAAclL,EAAEsF,OAIZsG,GAAW,CAAC5L,EAAG6L,KACnB7L,EAAEE,YAAYF,EAAEG,WAAa0L,GASzBC,GAAc,CAAC9L,EAAG6L,KAItB7L,EAAEE,YAAYF,EAAEG,WAAc0L,IAAM,EAAK,IACzC7L,EAAEE,YAAYF,EAAEG,WAAiB,IAAJ0L,GAWzBE,GAAW,CAACzG,EAAMzH,EAAKmO,EAAOzR,KAElC,IAAIuD,EAAMwH,EAAK2G,SAGf,OADInO,EAAMvD,IAAQuD,EAAMvD,GACZ,IAARuD,EAAoB,GAExBwH,EAAK2G,UAAYnO,EAGjBD,EAAI7Y,IAAIsgB,EAAKrJ,MAAMuI,SAASc,EAAK4G,QAAS5G,EAAK4G,QAAUpO,GAAMkO,GACvC,IAApB1G,EAAK6F,MAAMgB,KACb7G,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAO3I,EAAKC,EAAKkO,GAGlB,IAApB1G,EAAK6F,MAAMgB,OAClB7G,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAO3I,EAAKC,EAAKkO,IAG7C1G,EAAK4G,SAAWpO,EAChBwH,EAAK8G,UAAYtO,EAEVA,IAaHuO,GAAgB,CAACrM,EAAGsM,KAExB,IAEIC,EACAzO,EAHA0O,EAAexM,EAAEyM,iBACjBC,EAAO1M,EAAE2L,SAGTgB,EAAW3M,EAAE4M,YACbC,EAAa7M,EAAE6M,WACnB,MAAMC,EAAS9M,EAAE2L,SAAY3L,EAAE0K,OAASX,GACpC/J,EAAE2L,UAAY3L,EAAE0K,OAASX,IAAiB,EAExCgD,EAAO/M,EAAE9Y,OAET8lB,EAAQhN,EAAEiN,OACVpC,EAAQ7K,EAAE6K,KAMVqC,EAASlN,EAAE2L,SAAW7B,GAC5B,IAAIqD,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzB3M,EAAE4M,aAAe5M,EAAEqN,aACrBb,IAAiB,GAKfK,EAAa7M,EAAEsN,YAAaT,EAAa7M,EAAEsN,WAI/C,GAaE,GAXAf,EAAQD,EAWJS,EAAKR,EAAQI,KAAkBS,GAC/BL,EAAKR,EAAQI,EAAW,KAAOQ,GAC/BJ,EAAKR,KAA0BQ,EAAKL,IACpCK,IAAOR,KAAwBQ,EAAKL,EAAO,GAH/C,CAaAA,GAAQ,EACRH,IAMA,UAESQ,IAAOL,KAAUK,IAAOR,IAAUQ,IAAOL,KAAUK,IAAOR,IAC1DQ,IAAOL,KAAUK,IAAOR,IAAUQ,IAAOL,KAAUK,IAAOR,IAC1DQ,IAAOL,KAAUK,IAAOR,IAAUQ,IAAOL,KAAUK,IAAOR,IAC1DQ,IAAOL,KAAUK,IAAOR,IAAUQ,IAAOL,KAAUK,IAAOR,IAC1DG,EAAOQ,GAOhB,GAHApP,EAAMgM,IAAaoD,EAASR,GAC5BA,EAAOQ,EAASpD,GAEZhM,EAAM6O,EAAU,CAGlB,GAFA3M,EAAEuN,YAAcjB,EAChBK,EAAW7O,EACPA,GAAO+O,EACT,MAEFM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,EAC3B,CApCA,SAqCQL,EAAYzB,EAAKyB,EAAYU,IAAUF,GAA4B,MAAjBN,GAE5D,OAAIG,GAAY3M,EAAEsN,UACTX,EAEF3M,EAAEsN,WAcLE,GAAexN,IAEnB,MAAMyN,EAAUzN,EAAE0K,OAClB,IAAIzJ,EAAGyM,EAAMpQ,EAIb,EAAG,CAkCD,GAjCAoQ,EAAO1N,EAAE2N,YAAc3N,EAAEsN,UAAYtN,EAAE2L,SAoBnC3L,EAAE2L,UAAY8B,GAAWA,EAAU1D,MAErC/J,EAAE9Y,OAAOlC,IAAIgb,EAAE9Y,OAAOsd,SAASiJ,EAASA,EAAUA,EAAUC,GAAO,GACnE1N,EAAEuN,aAAeE,EACjBzN,EAAE2L,UAAY8B,EAEdzN,EAAE0L,aAAe+B,EACbzN,EAAE4N,OAAS5N,EAAE2L,WACf3L,EAAE4N,OAAS5N,EAAE2L,UAEfpB,GAAWvK,GACX0N,GAAQD,GAEc,IAApBzN,EAAEsF,KAAK2G,SACT,MAmBF,GAJAhL,EAAI8K,GAAS/L,EAAEsF,KAAMtF,EAAE9Y,OAAQ8Y,EAAE2L,SAAW3L,EAAEsN,UAAWI,GACzD1N,EAAEsN,WAAarM,EAGXjB,EAAEsN,UAAYtN,EAAE4N,QAzVN,EAkWZ,IARAtQ,EAAM0C,EAAE2L,SAAW3L,EAAE4N,OACrB5N,EAAE6N,MAAQ7N,EAAE9Y,OAAOoW,GAGnB0C,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAOoW,EAAM,IAInC0C,EAAE4N,SAEP5N,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAOoW,EApW1B,EAoW4C,IAEtD0C,EAAE6K,KAAKvN,EAAM0C,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OAClC7N,EAAE4K,KAAK5K,EAAE6N,OAASvQ,EAClBA,IACA0C,EAAE4N,WACE5N,EAAEsN,UAAYtN,EAAE4N,OA1WV,MAmXhB,OAAS5N,EAAEsN,UAAYvD,IAAqC,IAApB/J,EAAEsF,KAAK2G,WAuD3C6B,GAAiB,CAAC9N,EAAG+N,KAMzB,IAMIjQ,EAAKrL,EAAMub,EANXC,EAAYjO,EAAEkO,iBAAmB,EAAIlO,EAAE0K,OAAS1K,EAAE0K,OAAS1K,EAAEkO,iBAAmB,EAM/D3J,EAAO,EACxB4J,EAAOnO,EAAEsF,KAAK2G,SAClB,EAAG,CAOD,GAFAnO,EAAM,MACNkQ,EAAQhO,EAAEK,SAAW,IAAO,EACxBL,EAAEsF,KAAK8F,UAAY4C,EACrB,MAiBF,GAdAA,EAAOhO,EAAEsF,KAAK8F,UAAY4C,EAC1Bvb,EAAOuN,EAAE2L,SAAW3L,EAAE0L,YAClB5N,EAAMrL,EAAOuN,EAAEsF,KAAK2G,WACtBnO,EAAMrL,EAAOuN,EAAEsF,KAAK2G,UAElBnO,EAAMkQ,IACRlQ,EAAMkQ,GAQJlQ,EAAMmQ,IAAuB,IAARnQ,GAAaiQ,IAAU3E,IAC5B2E,IAAU7E,IACVpL,IAAQrL,EAAOuN,EAAEsF,KAAK2G,UACxC,MAMF1H,EAAOwJ,IAAU3E,IAActL,IAAQrL,EAAOuN,EAAEsF,KAAK2G,SAAW,EAAI,EACpEjH,GAAiBhF,EAAG,EAAG,EAAGuE,GAG1BvE,EAAEE,YAAYF,EAAEG,QAAU,GAAKrC,EAC/BkC,EAAEE,YAAYF,EAAEG,QAAU,GAAKrC,GAAO,EACtCkC,EAAEE,YAAYF,EAAEG,QAAU,IAAMrC,EAChCkC,EAAEE,YAAYF,EAAEG,QAAU,IAAMrC,GAAO,EAGvCoN,GAAclL,EAAEsF,MASZ7S,IACEA,EAAOqL,IACTrL,EAAOqL,GAGTkC,EAAEsF,KAAK+F,OAAOrmB,IAAIgb,EAAE9Y,OAAOsd,SAASxE,EAAE0L,YAAa1L,EAAE0L,YAAcjZ,GAAOuN,EAAEsF,KAAKiG,UACjFvL,EAAEsF,KAAKiG,UAAY9Y,EACnBuN,EAAEsF,KAAK8F,WAAa3Y,EACpBuN,EAAEsF,KAAKkG,WAAa/Y,EACpBuN,EAAE0L,aAAejZ,EACjBqL,GAAOrL,GAMLqL,IACFiO,GAAS/L,EAAEsF,KAAMtF,EAAEsF,KAAK+F,OAAQrL,EAAEsF,KAAKiG,SAAUzN,GACjDkC,EAAEsF,KAAKiG,UAAYzN,EACnBkC,EAAEsF,KAAK8F,WAAatN,EACpBkC,EAAEsF,KAAKkG,WAAa1N,EAExB,OAAkB,IAATyG,GA6CT,OArCA4J,GAAQnO,EAAEsF,KAAK2G,SACXkC,IAIEA,GAAQnO,EAAE0K,QACZ1K,EAAE0B,QAAU,EAEZ1B,EAAE9Y,OAAOlC,IAAIgb,EAAEsF,KAAKrJ,MAAMuI,SAASxE,EAAEsF,KAAK4G,QAAUlM,EAAE0K,OAAQ1K,EAAEsF,KAAK4G,SAAU,GAC/ElM,EAAE2L,SAAW3L,EAAE0K,OACf1K,EAAE4N,OAAS5N,EAAE2L,WAGT3L,EAAE2N,YAAc3N,EAAE2L,UAAYwC,IAEhCnO,EAAE2L,UAAY3L,EAAE0K,OAEhB1K,EAAE9Y,OAAOlC,IAAIgb,EAAE9Y,OAAOsd,SAASxE,EAAE0K,OAAQ1K,EAAE0K,OAAS1K,EAAE2L,UAAW,GAC7D3L,EAAE0B,QAAU,GACd1B,EAAE0B,UAEA1B,EAAE4N,OAAS5N,EAAE2L,WACf3L,EAAE4N,OAAS5N,EAAE2L,WAIjB3L,EAAE9Y,OAAOlC,IAAIgb,EAAEsF,KAAKrJ,MAAMuI,SAASxE,EAAEsF,KAAK4G,QAAUiC,EAAMnO,EAAEsF,KAAK4G,SAAUlM,EAAE2L,UAC7E3L,EAAE2L,UAAYwC,EACdnO,EAAE4N,QAAUO,EAAOnO,EAAE0K,OAAS1K,EAAE4N,OAAS5N,EAAE0K,OAAS1K,EAAE4N,OAASO,GAEjEnO,EAAE0L,YAAc1L,EAAE2L,UAEhB3L,EAAEoO,WAAapO,EAAE2L,WACnB3L,EAAEoO,WAAapO,EAAE2L,UAIfpH,EA5hBoB,EAiiBpBwJ,IAAU7E,IAAgB6E,IAAU3E,IAClB,IAApBpJ,EAAEsF,KAAK2G,UAAkBjM,EAAE2L,WAAa3L,EAAE0L,YApiBpB,GAyiBxBsC,EAAOhO,EAAE2N,YAAc3N,EAAE2L,SACrB3L,EAAEsF,KAAK2G,SAAW+B,GAAQhO,EAAE0L,aAAe1L,EAAE0K,SAE/C1K,EAAE0L,aAAe1L,EAAE0K,OACnB1K,EAAE2L,UAAY3L,EAAE0K,OAEhB1K,EAAE9Y,OAAOlC,IAAIgb,EAAE9Y,OAAOsd,SAASxE,EAAE0K,OAAQ1K,EAAE0K,OAAS1K,EAAE2L,UAAW,GAC7D3L,EAAE0B,QAAU,GACd1B,EAAE0B,UAEJsM,GAAQhO,EAAE0K,OACN1K,EAAE4N,OAAS5N,EAAE2L,WACf3L,EAAE4N,OAAS5N,EAAE2L,WAGbqC,EAAOhO,EAAEsF,KAAK2G,WAChB+B,EAAOhO,EAAEsF,KAAK2G,UAEZ+B,IACFjC,GAAS/L,EAAEsF,KAAMtF,EAAE9Y,OAAQ8Y,EAAE2L,SAAUqC,GACvChO,EAAE2L,UAAYqC,EACdhO,EAAE4N,QAAUI,EAAOhO,EAAE0K,OAAS1K,EAAE4N,OAAS5N,EAAE0K,OAAS1K,EAAE4N,OAASI,GAE7DhO,EAAEoO,WAAapO,EAAE2L,WACnB3L,EAAEoO,WAAapO,EAAE2L,UAQnBqC,EAAQhO,EAAEK,SAAW,IAAO,EAE5B2N,EAAOhO,EAAEkO,iBAAmBF,EAAO,MAAwB,MAAwBhO,EAAEkO,iBAAmBF,EACxGC,EAAYD,EAAOhO,EAAE0K,OAAS1K,EAAE0K,OAASsD,EACzCvb,EAAOuN,EAAE2L,SAAW3L,EAAE0L,aAClBjZ,GAAQwb,IACPxb,GAAQsb,IAAU3E,KAAe2E,IAAU7E,IACzB,IAApBlJ,EAAEsF,KAAK2G,UAAkBxZ,GAAQub,KAClClQ,EAAMrL,EAAOub,EAAOA,EAAOvb,EAC3B8R,EAAOwJ,IAAU3E,IAAkC,IAApBpJ,EAAEsF,KAAK2G,UACjCnO,IAAQrL,EAAO,EAAI,EACxBuS,GAAiBhF,EAAGA,EAAE0L,YAAa5N,EAAKyG,GACxCvE,EAAE0L,aAAe5N,EACjBoN,GAAclL,EAAEsF,OAIXf,EAzlBiB,EAFA,IAsmBpB8J,GAAe,CAACrO,EAAG+N,KAEvB,IAAIO,EACAC,EAEJ,OAAS,CAMP,GAAIvO,EAAEsN,UAAYvD,GAAe,CAE/B,GADAyD,GAAYxN,GACRA,EAAEsN,UAAYvD,IAAiBgE,IAAU7E,GAC3C,OApnBkB,EAsnBpB,GAAoB,IAAhBlJ,EAAEsN,UACJ,KAEJ,CAyBA,GApBAgB,EAAY,EACRtO,EAAEsN,WAhpBQ,IAkpBZtN,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAO8Y,EAAE2L,SAlpB1B,EAkpBiD,IAC7D2C,EAAYtO,EAAE6K,KAAK7K,EAAE2L,SAAW3L,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OACrD7N,EAAE4K,KAAK5K,EAAE6N,OAAS7N,EAAE2L,UAOJ,IAAd2C,GAA4BtO,EAAE2L,SAAW2C,GAAetO,EAAE0K,OAASX,KAKrE/J,EAAEwO,aAAenC,GAAcrM,EAAGsO,IAGhCtO,EAAEwO,cAnqBQ,EA+qBZ,GAPAD,EAASrI,GAAUlG,EAAGA,EAAE2L,SAAW3L,EAAEuN,YAAavN,EAAEwO,aAxqBxC,GA0qBZxO,EAAEsN,WAAatN,EAAEwO,aAKbxO,EAAEwO,cAAgBxO,EAAEyO,gBAAuCzO,EAAEsN,WA/qBrD,EA+qB6E,CACvFtN,EAAEwO,eACF,GACExO,EAAE2L,WAEF3L,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAO8Y,EAAE2L,SAprB9B,EAorBqD,IAC7D2C,EAAYtO,EAAE6K,KAAK7K,EAAE2L,SAAW3L,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OACrD7N,EAAE4K,KAAK5K,EAAE6N,OAAS7N,EAAE2L,eAKQ,MAAnB3L,EAAEwO,cACbxO,EAAE2L,UACJ,MAEE3L,EAAE2L,UAAY3L,EAAEwO,aAChBxO,EAAEwO,aAAe,EACjBxO,EAAE6N,MAAQ7N,EAAE9Y,OAAO8Y,EAAE2L,UAErB3L,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAO8Y,EAAE2L,SAAW,SAanD4C,EAASrI,GAAUlG,EAAG,EAAGA,EAAE9Y,OAAO8Y,EAAE2L,WAEpC3L,EAAEsN,YACFtN,EAAE2L,WAEJ,GAAI4C,IAEF9C,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WACT,OAxsBkB,CA4sBxB,CAEA,OADApL,EAAE4N,OAAW5N,EAAE2L,SAAY+C,EAAkB1O,EAAE2L,SAAW+C,EACtDX,IAAU3E,IAEZqC,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,UA/sBW,EACA,GAotBpBpL,EAAEyB,WAEJgK,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WA1tBW,EACA,GAsuBpBuD,GAAe,CAAC3O,EAAG+N,KAEvB,IAAIO,EACAC,EAEAK,EAGJ,OAAS,CAMP,GAAI5O,EAAEsN,UAAYvD,GAAe,CAE/B,GADAyD,GAAYxN,GACRA,EAAEsN,UAAYvD,IAAiBgE,IAAU7E,GAC3C,OAxvBkB,EA0vBpB,GAAoB,IAAhBlJ,EAAEsN,UAAmB,KAC3B,CAyCA,GApCAgB,EAAY,EACRtO,EAAEsN,WAlxBQ,IAoxBZtN,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAO8Y,EAAE2L,SApxB1B,EAoxBiD,IAC7D2C,EAAYtO,EAAE6K,KAAK7K,EAAE2L,SAAW3L,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OACrD7N,EAAE4K,KAAK5K,EAAE6N,OAAS7N,EAAE2L,UAMtB3L,EAAE4M,YAAc5M,EAAEwO,aAClBxO,EAAE6O,WAAa7O,EAAEuN,YACjBvN,EAAEwO,aAAeE,EAEC,IAAdJ,GAA0BtO,EAAE4M,YAAc5M,EAAEyO,gBAC5CzO,EAAE2L,SAAW2C,GAActO,EAAE0K,OAASX,KAKxC/J,EAAEwO,aAAenC,GAAcrM,EAAGsO,GAG9BtO,EAAEwO,cAAgB,IAClBxO,EAAE4F,WAAa6C,IA1yBP,IA0yBsBzI,EAAEwO,cAA8BxO,EAAE2L,SAAW3L,EAAEuN,YAAc,QAK7FvN,EAAEwO,aAAeE,IAMjB1O,EAAE4M,aArzBQ,GAqzBoB5M,EAAEwO,cAAgBxO,EAAE4M,YAAa,CACjEgC,EAAa5O,EAAE2L,SAAW3L,EAAEsN,UAtzBhB,EA6zBZiB,EAASrI,GAAUlG,EAAGA,EAAE2L,SAAW,EAAI3L,EAAE6O,WAAY7O,EAAE4M,YA7zB3C,GAm0BZ5M,EAAEsN,WAAatN,EAAE4M,YAAc,EAC/B5M,EAAE4M,aAAe,EACjB,KACQ5M,EAAE2L,UAAYiD,IAElB5O,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAO8Y,EAAE2L,SAx0B9B,EAw0BqD,IAC7D2C,EAAYtO,EAAE6K,KAAK7K,EAAE2L,SAAW3L,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OACrD7N,EAAE4K,KAAK5K,EAAE6N,OAAS7N,EAAE2L,gBAGK,MAAlB3L,EAAE4M,aAKb,GAJA5M,EAAE8O,gBAAkB,EACpB9O,EAAEwO,aAAeE,EACjB1O,EAAE2L,WAEE4C,IAEF9C,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WACT,OAr0BgB,CA00BtB,MAAA,GAAWpL,EAAE8O,iBAgBX,GATAP,EAASrI,GAAUlG,EAAG,EAAGA,EAAE9Y,OAAO8Y,EAAE2L,SAAW,IAE3C4C,GAEF9C,GAAiBzL,GAAG,GAGtBA,EAAE2L,WACF3L,EAAEsN,YACuB,IAArBtN,EAAEsF,KAAK8F,UACT,OA31BkB,OAi2BpBpL,EAAE8O,gBAAkB,EACpB9O,EAAE2L,WACF3L,EAAEsN,WAEN,CAUA,OARItN,EAAE8O,kBAGJP,EAASrI,GAAUlG,EAAG,EAAGA,EAAE9Y,OAAO8Y,EAAE2L,SAAW,IAE/C3L,EAAE8O,gBAAkB,GAEtB9O,EAAE4N,OAAS5N,EAAE2L,SAAW+C,EAAgB1O,EAAE2L,SAAW+C,EACjDX,IAAU3E,IAEZqC,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,UAh3BW,EACA,GAq3BpBpL,EAAEyB,WAEJgK,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WA33BW,EACA,GAmiC1B,SAAS2D,GAAOC,EAAaC,EAAUC,EAAaC,EAAW1nB,GAE7D7C,KAAKoqB,YAAcA,EACnBpqB,KAAKqqB,SAAWA,EAChBrqB,KAAKsqB,YAAcA,EACnBtqB,KAAKuqB,UAAYA,EACjBvqB,KAAK6C,KAAOA,CACd,CAEA,MAAM2nB,GAAsB,CAE1B,IAAIL,GAAO,EAAG,EAAG,EAAG,EAAGjB,IACvB,IAAIiB,GAAO,EAAG,EAAG,EAAG,EAAGV,IACvB,IAAIU,GAAO,EAAG,EAAG,GAAI,EAAGV,IACxB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIV,IAEzB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIJ,IACzB,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,IAC1B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,IAC/B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,KA+BjC,SAASU,KACPzqB,KAAK0gB,KAAO,KACZ1gB,KAAK0qB,OAAS,EACd1qB,KAAKsb,YAAc,KACnBtb,KAAKspB,iBAAmB,EACxBtpB,KAAK0mB,YAAc,EACnB1mB,KAAKub,QAAU,EACfvb,KAAKunB,KAAO,EACZvnB,KAAK2qB,OAAS,KACd3qB,KAAK4qB,QAAU,EACf5qB,KAAKqY,OAAS4M,GACdjlB,KAAK6qB,YAAa,EAElB7qB,KAAK8lB,OAAS,EACd9lB,KAAK8qB,OAAS,EACd9qB,KAAKqoB,OAAS,EAEdroB,KAAKsC,OAAS,KAQdtC,KAAK+oB,YAAc,EAKnB/oB,KAAKimB,KAAO,KAMZjmB,KAAKgmB,KAAO,KAEZhmB,KAAKipB,MAAQ,EACbjpB,KAAK+lB,UAAY,EACjB/lB,KAAK+qB,UAAY,EACjB/qB,KAAKqmB,UAAY,EAEjBrmB,KAAKomB,WAAa,EAOlBpmB,KAAK8mB,YAAc,EAKnB9mB,KAAK4pB,aAAe,EACpB5pB,KAAKiqB,WAAa,EAClBjqB,KAAKkqB,gBAAkB,EACvBlqB,KAAK+mB,SAAW,EAChB/mB,KAAK2oB,YAAc,EACnB3oB,KAAK0oB,UAAY,EAEjB1oB,KAAKgoB,YAAc,EAKnBhoB,KAAK6nB,iBAAmB,EAMxB7nB,KAAK6pB,eAAiB,EAYtB7pB,KAAKygB,MAAQ,EACbzgB,KAAKghB,SAAW,EAEhBhhB,KAAKyoB,WAAa,EAGlBzoB,KAAKioB,WAAa,EAYlBjoB,KAAKuc,UAAa,IAAIyO,YAAYC,MAClCjrB,KAAKwc,UAAa,IAAIwO,YAAA,KACtBhrB,KAAKyc,QAAa,IAAIuO,YAAA,IACtBtF,GAAK1lB,KAAKuc,WACVmJ,GAAK1lB,KAAKwc,WACVkJ,GAAK1lB,KAAKyc,SAEVzc,KAAKigB,OAAW,KAChBjgB,KAAKkgB,OAAW,KAChBlgB,KAAKmgB,QAAW,KAGhBngB,KAAKkc,SAAW,IAAI8O,YAAYE,IAIhClrB,KAAKwd,KAAO,IAAIwN,YAAY,KAC5BtF,GAAK1lB,KAAKwd,MAEVxd,KAAK0d,SAAW,EAChB1d,KAAKse,SAAW,EAKhBte,KAAKkd,MAAQ,IAAI8N,YAAY,KAC7BtF,GAAK1lB,KAAKkd,OAIVld,KAAKie,QAAU,EAEfje,KAAKmrB,YAAc,EAoBnBnrB,KAAK6c,SAAW,EAChB7c,KAAKuhB,QAAU,EAEfvhB,KAAK2c,QAAU,EACf3c,KAAK4c,WAAa,EAClB5c,KAAK8c,QAAU,EACf9c,KAAKgpB,OAAS,EAGdhpB,KAAK0b,OAAS,EAId1b,KAAKyb,SAAW,CAalB,CAMA,MAAM2P,GAAqB1K,IAEzB,IAAKA,EACH,OAAO,EAET,MAAMtF,EAAIsF,EAAK6F,MACf,OAAKnL,GAAKA,EAAEsF,OAASA,GAAStF,EAAEsP,SAAWtF,IAlyCtB,KAoyCShK,EAAEsP,QAlyCX,KAoyCStP,EAAEsP,QAnyCX,KAoyCStP,EAAEsP,QAnyCX,KAoyCStP,EAAEsP,QAnyCZ,MAoyCUtP,EAAEsP,QACFtP,EAAEsP,SAAWrF,IACbjK,EAAEsP,SAAWpF,GAClC,EAEF,GAIH+F,GAAoB3K,IAExB,GAAI0K,GAAkB1K,GACpB,OAAO6E,GAAI7E,EAAMkE,IAGnBlE,EAAK8G,SAAW9G,EAAKkG,UAAY,EACjClG,EAAKC,UAAYyD,GAEjB,MAAMhJ,EAAIsF,EAAK6F,MAmBf,OAlBAnL,EAAEG,QAAU,EACZH,EAAEsL,YAAc,EAEZtL,EAAEmM,KAAO,IACXnM,EAAEmM,MAAQnM,EAAEmM,MAGdnM,EAAEsP,OAEW,IAAXtP,EAAEmM,KAr0CiB,GAu0CnBnM,EAAEmM,KAAOnC,GAAaC,GACxB3E,EAAKkB,MAAoB,IAAXxG,EAAEmM,KACd,EAEA,EACFnM,EAAEyP,YAAa,EACf/K,GAAS1E,GACFsJ,IAIH4G,GAAgB5K,IAEpB,MAAM6K,EAAMF,GAAiB3K,GA3Qf,IAACtF,EA+Qf,OAHImQ,IAAQ7G,MA5QGtJ,EA6QLsF,EAAK6F,OA3QbwC,YAAc,EAAI3N,EAAE0K,OAGtBJ,GAAKtK,EAAE4K,MAIP5K,EAAEyO,eAAiBW,GAAoBpP,EAAEqF,OAAO4J,SAChDjP,EAAEqN,WAAa+B,GAAoBpP,EAAEqF,OAAO2J,YAC5ChP,EAAE6M,WAAauC,GAAoBpP,EAAEqF,OAAO6J,YAC5ClP,EAAEyM,iBAAmB2C,GAAoBpP,EAAEqF,OAAO8J,UAElDnP,EAAE2L,SAAW,EACb3L,EAAE0L,YAAc,EAChB1L,EAAEsN,UAAY,EACdtN,EAAE4N,OAAS,EACX5N,EAAEwO,aAAexO,EAAE4M,YAAc8B,EACjC1O,EAAE8O,gBAAkB,EACpB9O,EAAE6N,MAAQ,GA2PHsC,GAcHC,GAAe,CAAC9K,EAAMD,EAAOpI,EAAQoT,EAAYC,EAAU1K,KAE/D,IAAKN,EACH,OAAOkE,GAET,IAAI2C,EAAO,EAiBX,GAfI9G,IAAUsE,KACZtE,EAAQ,GAGNgL,EAAa,GACflE,EAAO,EACPkE,GAAcA,GAGPA,EAAa,KACpBlE,EAAO,EACPkE,GAAc,IAIZC,EAAW,GAAKA,EA15CA,GA05C4BrT,IAAW4M,IACzDwG,EAAa,GAAKA,EAAa,IAAMhL,EAAQ,GAAKA,EAAQ,GAC1DO,EAAW,GAAKA,EAAWgD,IAA2B,IAAfyH,GAA6B,IAATlE,EAC3D,OAAOhC,GAAI7E,EAAMkE,IAIA,IAAf6G,IACFA,EAAa,GAIf,MAAMrQ,EAAI,IAAIqP,GAmFd,OAjFA/J,EAAK6F,MAAQnL,EACbA,EAAEsF,KAAOA,EACTtF,EAAEsP,OAAStF,GAEXhK,EAAEmM,KAAOA,EACTnM,EAAEuP,OAAS,KACXvP,EAAE0P,OAASW,EACXrQ,EAAE0K,OAAS,GAAK1K,EAAE0P,OAClB1P,EAAEiN,OAASjN,EAAE0K,OAAS,EAEtB1K,EAAE2P,UAAYW,EAAW,EACzBtQ,EAAE2K,UAAY,GAAK3K,EAAE2P,UACrB3P,EAAEiL,UAAYjL,EAAE2K,UAAY,EAC5B3K,EAAEgL,eAAiBhL,EAAE2P,UA/5CL,EA+5C6B,GA/5C7B,GAi6ChB3P,EAAE9Y,OAAS,IAAIkX,WAAsB,EAAX4B,EAAE0K,QAC5B1K,EAAE4K,KAAO,IAAIgF,YAAY5P,EAAE2K,WAC3B3K,EAAE6K,KAAO,IAAI+E,YAAY5P,EAAE0K,QAK3B1K,EAAE+P,YAAc,GAAMO,EAAW,EAyCjCtQ,EAAEkO,iBAAmC,EAAhBlO,EAAE+P,YACvB/P,EAAEE,YAAc,IAAI9B,WAAW4B,EAAEkO,kBAIjClO,EAAE6C,QAAU7C,EAAE+P,YAGd/P,EAAEmG,QAAgC,GAArBnG,EAAE+P,YAAc,GAM7B/P,EAAEqF,MAAQA,EACVrF,EAAE4F,SAAWA,EACb5F,EAAE/C,OAASA,EAEJiT,GAAa5K,IA2ctB,IAoBIiL,GAAc,CACjBC,YA7dmB,CAAClL,EAAMD,IAElB+K,GAAa9K,EAAMD,EAAOwE,GA5/Cf,GAEE,EA0/CuDD,IA4d5EwG,aArBoBA,GAsBpBF,aArBoBA,GAsBpBD,iBArBwBA,GAsBxBQ,iBAnmBwB,CAACnL,EAAMsF,IAE1BoF,GAAkB1K,IAA6B,IAApBA,EAAK6F,MAAMgB,KACjC3C,IAETlE,EAAK6F,MAAMoE,OAAS3E,EACbtB,IA8lBRoH,QA3diB,CAACpL,EAAMyI,KAEvB,GAAIiC,GAAkB1K,IAASyI,EAAQ1E,IAAa0E,EAAQ,EAC1D,OAAOzI,EAAO6E,GAAI7E,EAAMkE,IAAoBA,GAG9C,MAAMxJ,EAAIsF,EAAK6F,MAEf,IAAK7F,EAAK+F,QACa,IAAlB/F,EAAK2G,WAAmB3G,EAAKrJ,OAC7B+D,EAAEsP,SAAWpF,IAAgB6D,IAAU3E,GAC1C,OAAOe,GAAI7E,EAA0B,IAAnBA,EAAK8F,UAAmB1B,GAAgBF,IAG5D,MAAMmH,EAAY3Q,EAAEyP,WAIpB,GAHAzP,EAAEyP,WAAa1B,EAGG,IAAd/N,EAAEG,SAEJ,GADA+K,GAAc5F,GACS,IAAnBA,EAAK8F,UAQP,OADApL,EAAEyP,YAAa,EACRnG,QAOX,GAA6B,IAAlBhE,EAAK2G,UAAkBjG,GAAK+H,IAAU/H,GAAK2K,IACpD5C,IAAU3E,GACV,OAAOe,GAAI7E,EAAMoE,IAInB,GAAI1J,EAAEsP,SAAWpF,IAAkC,IAAlB5E,EAAK2G,SACpC,OAAO9B,GAAI7E,EAAMoE,IAOnB,GAHI1J,EAAEsP,SAAWtF,IAAyB,IAAXhK,EAAEmM,OAC/BnM,EAAEsP,OAASrF,IAETjK,EAAEsP,SAAWtF,GAAY,CAE3B,IAAI4G,EAAU/G,IAAiB7J,EAAE0P,OAAS,GAAM,IAAO,EACnDmB,GAAc,EA2BlB,GAxBEA,EADE7Q,EAAE4F,UAAY8C,IAAkB1I,EAAEqF,MAAQ,EAC9B,EACLrF,EAAEqF,MAAQ,EACL,EACO,IAAZrF,EAAEqF,MACG,EAEA,EAEhBuL,GAAWC,GAAe,EACP,IAAf7Q,EAAE2L,WAAkBiF,GAziDR,IA0iDhBA,GAAU,GAAMA,EAAS,GAEzB9E,GAAY9L,EAAG4Q,GAGI,IAAf5Q,EAAE2L,WACJG,GAAY9L,EAAGsF,EAAKkB,QAAU,IAC9BsF,GAAY9L,EAAgB,MAAbsF,EAAKkB,QAEtBlB,EAAKkB,MAAQ,EACbxG,EAAEsP,OAASrF,GAGXiB,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,EAEX,CAEA,GA1jDqB,KA0jDjBtJ,EAAEsP,OAMJ,GAJAhK,EAAKkB,MAAQ,EACboF,GAAS5L,EAAG,IACZ4L,GAAS5L,EAAG,KACZ4L,GAAS5L,EAAG,GACPA,EAAEuP,OAoBL3D,GAAS5L,GAAIA,EAAEuP,OAAOllB,KAAO,EAAI,IACpB2V,EAAEuP,OAAOuB,KAAO,EAAI,IACnB9Q,EAAEuP,OAAO5M,MAAY,EAAJ,IACjB3C,EAAEuP,OAAOxkB,KAAW,EAAJ,IAChBiV,EAAEuP,OAAOwB,QAAc,GAAJ,IAEjCnF,GAAS5L,EAAmB,IAAhBA,EAAEuP,OAAOhhB,MACrBqd,GAAS5L,EAAIA,EAAEuP,OAAOhhB,MAAQ,EAAK,KACnCqd,GAAS5L,EAAIA,EAAEuP,OAAOhhB,MAAQ,GAAM,KACpCqd,GAAS5L,EAAIA,EAAEuP,OAAOhhB,MAAQ,GAAM,KACpCqd,GAAS5L,EAAe,IAAZA,EAAEqF,MAAc,EACfrF,EAAE4F,UAAY8C,IAAkB1I,EAAEqF,MAAQ,EAC1C,EAAI,GACjBuG,GAAS5L,EAAiB,IAAdA,EAAEuP,OAAOyB,IACjBhR,EAAEuP,OAAO5M,OAAS3C,EAAEuP,OAAO5M,MAAM9Y,SACnC+hB,GAAS5L,EAA2B,IAAxBA,EAAEuP,OAAO5M,MAAM9Y,QAC3B+hB,GAAS5L,EAAIA,EAAEuP,OAAO5M,MAAM9Y,QAAU,EAAK,MAEzCmW,EAAEuP,OAAOuB,OACXxL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAS,IAE7DH,EAAEwP,QAAU,EACZxP,EAAEsP,OAxmDe,QA4kDjB,GAbA1D,GAAS5L,EAAG,GACZ4L,GAAS5L,EAAG,GACZ4L,GAAS5L,EAAG,GACZ4L,GAAS5L,EAAG,GACZ4L,GAAS5L,EAAG,GACZ4L,GAAS5L,EAAe,IAAZA,EAAEqF,MAAc,EACfrF,EAAE4F,UAAY8C,IAAkB1I,EAAEqF,MAAQ,EAC1C,EAAI,GACjBuG,GAAS5L,EA3jDC,GA4jDVA,EAAEsP,OAASrF,GAGXiB,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,GA6Bb,GA3mDqB,KA2mDjBtJ,EAAEsP,OAAwB,CAC5B,GAAItP,EAAEuP,OAAO5M,MAAqB,CAChC,IAAIsO,EAAMjR,EAAEG,QACR1N,GAAgC,MAAxBuN,EAAEuP,OAAO5M,MAAM9Y,QAAmBmW,EAAEwP,QAChD,KAAOxP,EAAEG,QAAU1N,EAAOuN,EAAEkO,kBAAkB,CAC5C,IAAIgD,EAAOlR,EAAEkO,iBAAmBlO,EAAEG,QAYlC,GATAH,EAAEE,YAAYlb,IAAIgb,EAAEuP,OAAO5M,MAAM6B,SAASxE,EAAEwP,QAASxP,EAAEwP,QAAU0B,GAAOlR,EAAEG,SAC1EH,EAAEG,QAAUH,EAAEkO,iBAEVlO,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,IAGnEjR,EAAEwP,SAAW0B,EACbhG,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,GAET2H,EAAM,EACNxe,GAAQye,CACV,CAGA,IAAIC,EAAe,IAAI/S,WAAW4B,EAAEuP,OAAO5M,OAG3C3C,EAAEE,YAAYlb,IAAImsB,EAAa3M,SAASxE,EAAEwP,QAASxP,EAAEwP,QAAU/c,GAAOuN,EAAEG,SACxEH,EAAEG,SAAW1N,EAETuN,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,IAGnEjR,EAAEwP,QAAU,CACd,CACAxP,EAAEsP,OAhpDiB,EAipDrB,CACA,GAlpDqB,KAkpDjBtP,EAAEsP,OAAuB,CAC3B,GAAItP,EAAEuP,OAAOxkB,KAAoB,CAC/B,IACIqmB,EADAH,EAAMjR,EAAEG,QAEZ,EAAG,CACD,GAAIH,EAAEG,UAAYH,EAAEkO,iBAAkB,CAOpC,GALIlO,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,IAGnE/F,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,GAET2H,EAAM,CACR,CAGEG,EADEpR,EAAEwP,QAAUxP,EAAEuP,OAAOxkB,KAAKlB,OACkB,IAAxCmW,EAAEuP,OAAOxkB,KAAK0S,WAAWuC,EAAEwP,WAE3B,EAER5D,GAAS5L,EAAGoR,EACd,OAAiB,IAARA,GAELpR,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,IAGnEjR,EAAEwP,QAAU,CACd,CACAxP,EAAEsP,OAlrDiB,EAmrDrB,CACA,GAprDqB,KAorDjBtP,EAAEsP,OAA0B,CAC9B,GAAItP,EAAEuP,OAAOwB,QAAuB,CAClC,IACIK,EADAH,EAAMjR,EAAEG,QAEZ,EAAG,CACD,GAAIH,EAAEG,UAAYH,EAAEkO,iBAAkB,CAOpC,GALIlO,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,IAGnE/F,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,GAET2H,EAAM,CACR,CAGEG,EADEpR,EAAEwP,QAAUxP,EAAEuP,OAAOwB,QAAQlnB,OACkB,IAA3CmW,EAAEuP,OAAOwB,QAAQtT,WAAWuC,EAAEwP,WAE9B,EAER5D,GAAS5L,EAAGoR,EACd,OAAiB,IAARA,GAELpR,EAAEuP,OAAOuB,MAAQ9Q,EAAEG,QAAU8Q,IAC/B3L,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOxG,EAAEE,YAAaF,EAAEG,QAAU8Q,EAAKA,GAGrE,CACAjR,EAAEsP,OAntDgB,GAotDpB,CACA,GArtDoB,MAqtDhBtP,EAAEsP,OAAuB,CAC3B,GAAItP,EAAEuP,OAAOuB,KAAM,CACjB,GAAI9Q,EAAEG,QAAU,EAAIH,EAAEkO,mBACpBhD,GAAc5F,GACI,IAAdtF,EAAEG,SAEJ,OADAH,EAAEyP,YAAa,EACRnG,GAGXsC,GAAS5L,EAAgB,IAAbsF,EAAKkB,OACjBoF,GAAS5L,EAAIsF,EAAKkB,OAAS,EAAK,KAChClB,EAAKkB,MAAQ,CACf,CAKA,GAJAxG,EAAEsP,OAASrF,GAGXiB,GAAc5F,GACI,IAAdtF,EAAEG,QAEJ,OADAH,EAAEyP,YAAa,EACRnG,EAEX,CAKA,GAAsB,IAAlBhE,EAAK2G,UAAkC,IAAhBjM,EAAEsN,WAC1BS,IAAU7E,IAAgBlJ,EAAEsP,SAAWpF,GAAe,CACvD,IAAImH,EAAqB,IAAZrR,EAAEqF,MAAcyI,GAAe9N,EAAG+N,GAClC/N,EAAE4F,WAAa8C,GApwBX,EAAC1I,EAAG+N,KAEvB,IAAIQ,EAEJ,OAAS,CAEP,GAAoB,IAAhBvO,EAAEsN,YACJE,GAAYxN,GACQ,IAAhBA,EAAEsN,WAAiB,CACrB,GAAIS,IAAU7E,GACZ,OAp/BgB,EAs/BlB,KACF,CAUF,GANAlJ,EAAEwO,aAAe,EAGjBD,EAASrI,GAAUlG,EAAG,EAAGA,EAAE9Y,OAAO8Y,EAAE2L,WACpC3L,EAAEsN,YACFtN,EAAE2L,WACE4C,IAEF9C,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WACT,OArgCkB,CAygCxB,CAEA,OADApL,EAAE4N,OAAS,EACPG,IAAU3E,IAEZqC,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,UA5gCW,EACA,GAihCpBpL,EAAEyB,WAEJgK,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WAvhCW,EACA,GA6uDuBkG,CAAatR,EAAG+N,GAChD/N,EAAE4F,WAAa+C,GAr2BZ,EAAC3I,EAAG+N,KAEtB,IAAIQ,EACA1D,EACA6B,EAAMQ,EAEV,MAAMH,EAAO/M,EAAE9Y,OAEf,OAAS,CAKP,GAAI8Y,EAAEsN,WAAaxD,GAAW,CAE5B,GADA0D,GAAYxN,GACRA,EAAEsN,WAAaxD,IAAaiE,IAAU7E,GACxC,OA15BkB,EA45BpB,GAAoB,IAAhBlJ,EAAEsN,UAAmB,KAC3B,CAIA,GADAtN,EAAEwO,aAAe,EACbxO,EAAEsN,WAl7BQ,GAk7BkBtN,EAAE2L,SAAW,IAC3Ce,EAAO1M,EAAE2L,SAAW,EACpBd,EAAOkC,EAAKL,GACR7B,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IAAO,CAC3EQ,EAASlN,EAAE2L,SAAW7B,GACtB,UAESe,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IACzC7B,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IACzC7B,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IACzC7B,IAASkC,IAAOL,IAAS7B,IAASkC,IAAOL,IACzCA,EAAOQ,GAChBlN,EAAEwO,aAAe1E,IAAaoD,EAASR,GACnC1M,EAAEwO,aAAexO,EAAEsN,YACrBtN,EAAEwO,aAAexO,EAAEsN,UAEvB,CAuBF,GAlBItN,EAAEwO,cAv8BQ,GA28BZD,EAASrI,GAAUlG,EAAG,EAAGA,EAAEwO,aA38Bf,GA68BZxO,EAAEsN,WAAatN,EAAEwO,aACjBxO,EAAE2L,UAAY3L,EAAEwO,aAChBxO,EAAEwO,aAAe,IAKjBD,EAASrI,GAAUlG,EAAG,EAAGA,EAAE9Y,OAAO8Y,EAAE2L,WAEpC3L,EAAEsN,YACFtN,EAAE2L,YAEA4C,IAEF9C,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WACT,OA58BkB,CAg9BxB,CAEA,OADApL,EAAE4N,OAAS,EACPG,IAAU3E,IAEZqC,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,UAn9BW,EACA,GAw9BpBpL,EAAEyB,WAEJgK,GAAiBzL,GAAG,GACK,IAArBA,EAAEsF,KAAK8F,WA99BW,EACA,GA8uDcmG,CAAYvR,EAAG+N,GACtCqB,GAAoBpP,EAAEqF,OAAO5d,KAAKuY,EAAG+N,GAKlD,GAnvDsB,IAgvDlBsD,GA/uDkB,IA+uDcA,IAClCrR,EAAEsP,OAASpF,IAnvDS,IAqvDlBmH,GAnvDkB,IAmvDSA,EAK7B,OAJuB,IAAnB/L,EAAK8F,YACPpL,EAAEyP,YAAa,GAGVnG,GAST,GAlwDsB,IAkwDlB+H,IACEtD,IAAUxG,GACZnB,GAAUpG,GAEH+N,IAAU1E,KAEjBrE,GAAiBhF,EAAG,EAAG,GAAG,GAItB+N,IAAU5E,KAEZmB,GAAKtK,EAAE4K,MAEa,IAAhB5K,EAAEsN,YACJtN,EAAE2L,SAAW,EACb3L,EAAE0L,YAAc,EAChB1L,EAAE4N,OAAS,KAIjB1C,GAAc5F,GACS,IAAnBA,EAAK8F,WAEP,OADApL,EAAEyP,YAAa,EACRnG,EAGb,CAEA,OAAIyE,IAAU3E,GAAqBE,GAC/BtJ,EAAEmM,MAAQ,EAAY5C,IAGX,IAAXvJ,EAAEmM,MACJP,GAAS5L,EAAgB,IAAbsF,EAAKkB,OACjBoF,GAAS5L,EAAIsF,EAAKkB,OAAS,EAAK,KAChCoF,GAAS5L,EAAIsF,EAAKkB,OAAS,GAAM,KACjCoF,GAAS5L,EAAIsF,EAAKkB,OAAS,GAAM,KACjCoF,GAAS5L,EAAmB,IAAhBsF,EAAK8G,UACjBR,GAAS5L,EAAIsF,EAAK8G,UAAY,EAAK,KACnCR,GAAS5L,EAAIsF,EAAK8G,UAAY,GAAM,KACpCR,GAAS5L,EAAIsF,EAAK8G,UAAY,GAAM,OAIpCN,GAAY9L,EAAGsF,EAAKkB,QAAU,IAC9BsF,GAAY9L,EAAgB,MAAbsF,EAAKkB,QAGtB0E,GAAc5F,GAIVtF,EAAEmM,KAAO,IAAKnM,EAAEmM,MAAQnM,EAAEmM,MAET,IAAdnM,EAAEG,QAAgBmJ,GAASC,KA8HnCiI,WA1HmBlM,IAElB,GAAI0K,GAAkB1K,GACpB,OAAOkE,GAGT,MAAM8F,EAAShK,EAAK6F,MAAMmE,OAI1B,OAFAhK,EAAK6F,MAAQ,KAENmE,IAAWrF,GAAaE,GAAI7E,EAAMmE,IAAkBH,IAiH5DmI,qBAzG4B,CAACnM,EAAMoM,KAElC,IAAIC,EAAaD,EAAW7nB,OAE5B,GAAImmB,GAAkB1K,GACpB,OAAOkE,GAGT,MAAMxJ,EAAIsF,EAAK6F,MACTgB,EAAOnM,EAAEmM,KAEf,GAAa,IAATA,GAAwB,IAATA,GAAcnM,EAAEsP,SAAWtF,IAAehK,EAAEsN,UAC7D,OAAO9D,GAYT,GARa,IAAT2C,IAEF7G,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAOkL,EAAYC,EAAY,IAG7D3R,EAAEmM,KAAO,EAGLwF,GAAc3R,EAAE0K,OAAQ,CACb,IAATyB,IAEF7B,GAAKtK,EAAE4K,MACP5K,EAAE2L,SAAW,EACb3L,EAAE0L,YAAc,EAChB1L,EAAE4N,OAAS,GAIb,IAAIgE,EAAU,IAAIxT,WAAW4B,EAAE0K,QAC/BkH,EAAQ5sB,IAAI0sB,EAAWlN,SAASmN,EAAa3R,EAAE0K,OAAQiH,GAAa,GACpED,EAAaE,EACbD,EAAa3R,EAAE0K,MACjB,CAEA,MAAMmH,EAAQvM,EAAK2G,SACb6F,EAAOxM,EAAK4G,QACZjQ,EAAQqJ,EAAKrJ,MAKnB,IAJAqJ,EAAK2G,SAAW0F,EAChBrM,EAAK4G,QAAU,EACf5G,EAAKrJ,MAAQyV,EACblE,GAAYxN,GACLA,EAAEsN,WAh5DO,GAg5DiB,CAC/B,IAAIhQ,EAAM0C,EAAE2L,SACR1K,EAAIjB,EAAEsN,UAAA,EACV,GAEEtN,EAAE6N,MAAQ/C,GAAK9K,EAAGA,EAAE6N,MAAO7N,EAAE9Y,OAAOoW,EAr5DxB,EAq5D0C,IAEtD0C,EAAE6K,KAAKvN,EAAM0C,EAAEiN,QAAUjN,EAAE4K,KAAK5K,EAAE6N,OAElC7N,EAAE4K,KAAK5K,EAAE6N,OAASvQ,EAClBA,YACS2D,GACXjB,EAAE2L,SAAWrO,EACb0C,EAAEsN,UAAYoB,EACdlB,GAAYxN,EACd,CAWA,OAVAA,EAAE2L,UAAY3L,EAAEsN,UAChBtN,EAAE0L,YAAc1L,EAAE2L,SAClB3L,EAAE4N,OAAS5N,EAAEsN,UACbtN,EAAEsN,UAAY,EACdtN,EAAEwO,aAAexO,EAAE4M,YAAc8B,EACjC1O,EAAE8O,gBAAkB,EACpBxJ,EAAK4G,QAAU4F,EACfxM,EAAKrJ,MAAQA,EACbqJ,EAAK2G,SAAW4F,EAChB7R,EAAEmM,KAAOA,EACF7C,IAiCRyI,YArBiB,sCAwBlB,MAAMC,GAAO,CAAC9pB,EAAKpD,IACV0D,OAAOC,UAAUC,eAAeC,KAAKT,EAAKpD,GAGnD,IA0CImtB,GA1CS,SAAU/pB,GACrB,MAAMgqB,EAAU9pB,MAAMK,UAAU0pB,MAAMxpB,KAAKypB,UAAW,GACtD,KAAOF,EAAQroB,QAAQ,CACrB,MAAMwoB,EAASH,EAAQI,QACvB,GAAKD,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIE,UAAUF,EAAS,sBAG/B,IAAA,MAAW7H,KAAK6H,EACVL,GAAKK,EAAQ7H,KACftiB,EAAIsiB,GAAK6H,EAAO7H,GARK,CAW3B,CAEA,OAAOtiB,CACT,EAwBI+pB,GApBiBO,IAEnB,IAAI1U,EAAM,EAEV,IAAA,IAASN,EAAI,EAAGiV,EAAID,EAAO3oB,OAAQ2T,EAAIiV,EAAGjV,IACxCM,GAAO0U,EAAOhV,GAAG3T,OAInB,MAAMyC,EAAS,IAAI8R,WAAWN,GAE9B,IAAA,IAASN,EAAI,EAAGiJ,EAAM,EAAGgM,EAAID,EAAO3oB,OAAQ2T,EAAIiV,EAAGjV,IAAK,CACtD,IAAIkV,EAAQF,EAAOhV,GACnBlR,EAAOtH,IAAI0tB,EAAOjM,GAClBA,GAAOiM,EAAM7oB,MACf,CAEA,OAAOyC,GAgBT,IAAIqmB,IAAmB,EAEvB,IAAMxb,OAAOyb,aAAarmB,MAAM,KAAM,IAAI6R,WAAW,GAAK,OAASyU,IAAMF,IAAmB,CAAO,CAMnG,MAAMG,GAAW,IAAI1U,WAAW,KAChC,IAAA,IAAS2U,GAAI,EAAGA,GAAI,IAAKA,KACvBD,GAASC,IAAMA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAI,EAE5FD,GAAS,KAAOA,GAAS,KAAO,EAiFhC,IAyEIE,GAtJc1V,IAChB,GAA2B,mBAAhB2V,aAA8BA,YAAYxqB,UAAUyqB,OAC7D,OAAO,IAAID,aAAcC,OAAO5V,GAGlC,IAAIO,EAAK2C,EAAG2S,EAAIC,EAAO5V,EAAG6V,EAAU/V,EAAIzT,OAAQypB,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/B5S,EAAIlD,EAAIG,WAAW2V,GACE,QAAZ,MAAJ5S,IAA2B4S,EAAQ,EAAIC,IAC1CF,EAAK7V,EAAIG,WAAW2V,EAAQ,GACN,QAAZ,MAALD,KACH3S,EAAI,OAAYA,EAAI,OAAW,KAAO2S,EAAK,OAC3CC,MAGJE,GAAW9S,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHA3C,EAAM,IAAIO,WAAWkV,GAGhB9V,EAAI,EAAG4V,EAAQ,EAAG5V,EAAI8V,EAASF,IAClC5S,EAAIlD,EAAIG,WAAW2V,GACE,QAAZ,MAAJ5S,IAA2B4S,EAAQ,EAAIC,IAC1CF,EAAK7V,EAAIG,WAAW2V,EAAQ,GACN,QAAZ,MAALD,KACH3S,EAAI,OAAYA,EAAI,OAAW,KAAO2S,EAAK,OAC3CC,MAGA5S,EAAI,IAEN3C,EAAIL,KAAOgD,EACFA,EAAI,MAEb3C,EAAIL,KAAO,IAAQgD,IAAM,EACzB3C,EAAIL,KAAO,IAAY,GAAJgD,GACVA,EAAI,OAEb3C,EAAIL,KAAO,IAAQgD,IAAM,GACzB3C,EAAIL,KAAO,IAAQgD,IAAM,EAAI,GAC7B3C,EAAIL,KAAO,IAAY,GAAJgD,IAGnB3C,EAAIL,KAAO,IAAQgD,IAAM,GACzB3C,EAAIL,KAAO,IAAQgD,IAAM,GAAK,GAC9B3C,EAAIL,KAAO,IAAQgD,IAAM,EAAI,GAC7B3C,EAAIL,KAAO,IAAY,GAAJgD,GAIvB,OAAO3C,GAgGLmV,GAzEa,CAACnV,EAAKvL,KACrB,MAAMwL,EAAMxL,GAAOuL,EAAIhU,OAEvB,GAA2B,mBAAhB0pB,aAA8BA,YAAY9qB,UAAU+qB,OAC7D,OAAO,IAAID,aAAcC,OAAO3V,EAAI2G,SAAS,EAAGlS,IAGlD,IAAIkL,EAAGiW,EAKP,MAAMC,EAAW,IAAItrB,MAAY,EAAN0V,GAE3B,IAAK2V,EAAM,EAAGjW,EAAI,EAAGA,EAAIM,GAAM,CAC7B,IAAI0C,EAAI3C,EAAIL,KAEZ,GAAIgD,EAAI,IAAM,CAAEkT,EAASD,KAASjT,EAAG,QAAU,CAE/C,IAAImT,EAAQb,GAAStS,GAErB,GAAImT,EAAQ,EAAKD,EAASD,KAAS,MAAQjW,GAAKmW,EAAQ,MAAxD,CAKA,IAFAnT,GAAe,IAAVmT,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKnW,EAAIM,GACtB0C,EAAKA,GAAK,EAAiB,GAAX3C,EAAIL,KACpBmW,IAIEA,EAAQ,EAAKD,EAASD,KAAS,MAE/BjT,EAAI,MACNkT,EAASD,KAASjT,GAElBA,GAAK,MACLkT,EAASD,KAAS,MAAWjT,GAAK,GAAM,KACxCkT,EAASD,KAAS,MAAc,KAAJjT,EAlBuC,CAoBvE,CAEA,MA9DoB,EAAC3C,EAAKC,KAI1B,GAAIA,EAAM,OACJD,EAAI2G,UAAYmO,GAClB,OAAOxb,OAAOyb,aAAarmB,MAAM,KAAMsR,EAAIhU,SAAWiU,EAAMD,EAAMA,EAAI2G,SAAS,EAAG1G,IAItF,IAAIxR,EAAS,GACb,IAAA,IAASkR,EAAI,EAAGA,EAAIM,EAAKN,IACvBlR,GAAU6K,OAAOyb,aAAa/U,EAAIL,IAEpC,OAAOlR,GAgDAsnB,CAAcF,EAAUD,IA8B7BT,GApBa,CAACnV,EAAKvL,MAErBA,EAAMA,GAAOuL,EAAIhU,QACPgU,EAAIhU,SAAUyI,EAAMuL,EAAIhU,QAGlC,IAAI4c,EAAMnU,EAAM,EAChB,KAAOmU,GAAO,GAA2B,MAAV,IAAX5I,EAAI4I,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkBnU,EAMdmU,EAAMqM,GAASjV,EAAI4I,IAAQnU,EAAOmU,EAAMnU,GAqDlD,IAAIuhB,GAzBJ,WAEEjvB,KAAKqX,MAAQ,KACbrX,KAAKsnB,QAAU,EAEftnB,KAAKqnB,SAAW,EAEhBrnB,KAAKwnB,SAAW,EAEhBxnB,KAAKymB,OAAS,KACdzmB,KAAK2mB,SAAW,EAEhB3mB,KAAKwmB,UAAY,EAEjBxmB,KAAK4mB,UAAY,EAEjB5mB,KAAKylB,IAAM,GAEXzlB,KAAKumB,MAAQ,KAEbvmB,KAAK2gB,UAAY,EAEjB3gB,KAAK4hB,MAAQ,CACf,EAIA,MAAMsN,GAAatrB,OAAOC,UAAU1B,UAMlCugB,WAAYyM,GAAAvM,aAAcA,GAAAC,aAAcA,GAAcC,SAAUsM,GAChEnM,KAAMoM,GAAQnM,aAAcoM,GAAA1L,sBAC5BA,GAAAK,mBACAA,GACAI,WAAYkL,IACV9M,GA0FJ,SAAS+M,GAAUvkB,GACjBjL,KAAKiL,QAAUoiB,GAAc,CAC3B5M,MAAOmD,GACPvL,OAAQkX,GACRE,UAAW,MACXhE,WAAY,GACZC,SAAU,EACV1K,SAAUiD,IACThZ,GAAW,CAAA,GAEd,IAAIykB,EAAM1vB,KAAKiL,QAEXykB,EAAIC,KAAQD,EAAIjE,WAAa,EAC/BiE,EAAIjE,YAAciE,EAAIjE,WAGfiE,EAAIE,MAASF,EAAIjE,WAAa,GAAOiE,EAAIjE,WAAa,KAC7DiE,EAAIjE,YAAc,IAGpBzrB,KAAKulB,IAAS,EACdvlB,KAAKylB,IAAS,GACdzlB,KAAK6vB,OAAS,EACd7vB,KAAK4tB,OAAS,GAEd5tB,KAAK0gB,KAAO,IAAIuO,GAChBjvB,KAAK0gB,KAAK8F,UAAY,EAEtB,IAAIkE,EAASiB,GAAYH,aACvBxrB,KAAK0gB,KACLgP,EAAIjP,MACJiP,EAAIrX,OACJqX,EAAIjE,WACJiE,EAAIhE,SACJgE,EAAI1O,UAGN,GAAI0J,IAAW2E,GACb,MAAM,IAAI3d,MAAM8Q,GAASkI,IAO3B,GAJIgF,EAAI1D,QACNL,GAAYE,iBAAiB7rB,KAAK0gB,KAAMgP,EAAI1D,QAG1C0D,EAAI5C,WAAY,CAClB,IAAIgD,EAaJ,GATEA,EAF4B,iBAAnBJ,EAAI5C,WAENsB,GAAmBsB,EAAI5C,YACe,yBAApCoC,GAAWnrB,KAAK2rB,EAAI5C,YACtB,IAAItT,WAAWkW,EAAI5C,YAEnB4C,EAAI5C,WAGbpC,EAASiB,GAAYkB,qBAAqB7sB,KAAK0gB,KAAMoP,GAEjDpF,IAAW2E,GACb,MAAM,IAAI3d,MAAM8Q,GAASkI,IAG3B1qB,KAAK+vB,WAAY,CACnB,CACF,CA8JA,SAASC,GAAU3Y,EAAOpM,GACxB,MAAMglB,EAAW,IAAIT,GAAUvkB,GAK/B,GAHAglB,EAASlvB,KAAKsW,GAAO,GAGjB4Y,EAAS1K,IAAO,MAAM0K,EAASxK,KAAOjD,GAASyN,EAAS1K,KAE5D,OAAO0K,EAASvoB,MAClB,CA/IA8nB,GAAU3rB,UAAU9C,KAAO,SAAUolB,EAAM+J,GACzC,MAAMxP,EAAO1gB,KAAK0gB,KACZ+O,EAAYzvB,KAAKiL,QAAQwkB,UAC/B,IAAI/E,EAAQyF,EAEZ,GAAInwB,KAAK6vB,MAAS,OAAO,EAkBzB,IAhBiCM,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBd,GAAaD,GAGlC,iBAAThJ,EAETzF,EAAKrJ,MAAQ+W,GAAmBjI,GACG,yBAA1B+I,GAAWnrB,KAAKoiB,GACzBzF,EAAKrJ,MAAQ,IAAImC,WAAW2M,GAE5BzF,EAAKrJ,MAAQ8O,EAGfzF,EAAK4G,QAAU,EACf5G,EAAK2G,SAAW3G,EAAKrJ,MAAMpS,SAUzB,GAPuB,IAAnByb,EAAK8F,YACP9F,EAAK+F,OAAS,IAAIjN,WAAWiW,GAC7B/O,EAAKiG,SAAW,EAChBjG,EAAK8F,UAAYiJ,IAIdU,IAAgBvN,IAAgBuN,IAAgBtN,KAAiBnC,EAAK8F,WAAa,EACtFxmB,KAAKowB,OAAO1P,EAAK+F,OAAO7G,SAAS,EAAGc,EAAKiG,WACzCjG,EAAK8F,UAAY,MAFnB,CASA,GAHAkE,EAASiB,GAAYG,QAAQpL,EAAMyP,GAG/BzF,IAAW4E,GAOb,OANI5O,EAAKiG,SAAW,GAClB3mB,KAAKowB,OAAO1P,EAAK+F,OAAO7G,SAAS,EAAGc,EAAKiG,WAE3C+D,EAASiB,GAAYiB,WAAW5sB,KAAK0gB,MACrC1gB,KAAKqwB,MAAM3F,GACX1qB,KAAK6vB,OAAQ,EACNnF,IAAW2E,GAIpB,GAAuB,IAAnB3O,EAAK8F,WAMT,GAAI2J,EAAc,GAAKzP,EAAKiG,SAAW,EACrC3mB,KAAKowB,OAAO1P,EAAK+F,OAAO7G,SAAS,EAAGc,EAAKiG,WACzCjG,EAAK8F,UAAY,OAInB,GAAsB,IAAlB9F,EAAK2G,SAAgB,WAXvBrnB,KAAKowB,OAAO1P,EAAK+F,OAjBnB,CA+BF,OAAO,CACT,EAUA+I,GAAU3rB,UAAUusB,OAAS,SAAUtC,GACrC9tB,KAAK4tB,OAAO7sB,KAAK+sB,EACnB,EAYA0B,GAAU3rB,UAAUwsB,MAAQ,SAAU3F,GAEhCA,IAAW2E,KACbrvB,KAAK0H,OAAS2lB,GAAqBrtB,KAAK4tB,SAE1C5tB,KAAK4tB,OAAS,GACd5tB,KAAKulB,IAAMmF,EACX1qB,KAAKylB,IAAMzlB,KAAK0gB,KAAK+E,GACvB,EA6EA,IAMI6K,GAAc,CACjBC,QAPiBf,GAQjB1D,QAPekE,GAQfQ,WA/BD,SAAsBnZ,EAAOpM,GAG3B,OAFAA,EAAUA,GAAW,CAAA,GACb0kB,KAAM,EACPK,GAAU3Y,EAAOpM,EAC1B,EA4BC2kB,KAjBD,SAAgBvY,EAAOpM,GAGrB,OAFAA,EAAUA,GAAW,CAAA,GACb2kB,MAAO,EACRI,GAAU3Y,EAAOpM,EAC1B,GAqCA,MAAMwlB,GAAQ,MAsCd,IAAIC,GAAU,SAAsBhQ,EAAM0G,GACxC,IAAIuJ,EACAhR,EACAiR,EACAvE,EACA9J,EAEAsO,EAEAhL,EACAiL,EACAC,EAEAC,EACAC,EACA7U,EACA8U,EACAC,EACAC,EACAC,EACAC,EACAC,EAEArY,EACAgC,EACAlP,EACAwlB,EAGAna,EAAOoP,EAGX,MAAMF,EAAQ7F,EAAK6F,MAEnBoK,EAAMjQ,EAAK4G,QACXjQ,EAAQqJ,EAAKrJ,MACbsI,EAAOgR,GAAOjQ,EAAK2G,SAAW,GAC9BuJ,EAAOlQ,EAAKiG,SACZF,EAAS/F,EAAK+F,OACd4F,EAAMuE,GAAQxJ,EAAQ1G,EAAK8F,WAC3BjE,EAAMqO,GAAQlQ,EAAK8F,UAAY,KAE/BqK,EAAOtK,EAAMsK,KAEbhL,EAAQU,EAAMV,MACdiL,EAAQvK,EAAMuK,MACdC,EAAQxK,EAAMwK,MACdC,EAAWzK,EAAMjkB,OACjB2uB,EAAO1K,EAAM0K,KACb7U,EAAOmK,EAAMnK,KACb8U,EAAQ3K,EAAMkL,QACdN,EAAQ5K,EAAMmL,SACdN,GAAS,GAAK7K,EAAMoL,SAAW,EAC/BN,GAAS,GAAK9K,EAAMqL,UAAY,EAMhCjkB,EACA,EAAG,CACGyO,EAAO,KACT6U,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,EACR6U,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,GAGVkV,EAAOJ,EAAMD,EAAOG,GAEpBS,EACA,OAAS,CAKP,GAJAN,EAAKD,IAAS,GACdL,KAAUM,EACVnV,GAAQmV,EACRA,EAAMD,IAAS,GAAM,IACV,IAAPC,EAIF9K,EAAOmK,KAAiB,MAAPU,MACnB,MACc,GAALC,GAuKT,IACe,GAALA,EAGV,IACc,GAALA,EAAS,CAEhBhL,EAAMuL,KArSC,MAsSP,MAAMnkB,CACR,CAEE+S,EAAK+E,IAAM,8BACXc,EAAMuL,KAAOrB,GACb,MAAM9iB,CACR,CAZE2jB,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASM,CAWX,CA/JE,IArBA3Y,EAAa,MAAPoY,EACNC,GAAM,GACFA,IACEnV,EAAOmV,IACTN,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,GAEVlD,GAAO+X,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACVnV,GAAQmV,GAGNnV,EAAO,KACT6U,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,EACR6U,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,GAEVkV,EAAOH,EAAMF,EAAOI,KAGX,CAMP,GALAE,EAAKD,IAAS,GACdL,KAAUM,EACVnV,GAAQmV,EACRA,EAAMD,IAAS,GAAM,IAEZ,GAALC,EAAJ,CAaE,GAZArW,EAAc,MAAPoW,EACPC,GAAM,GACFnV,EAAOmV,IACTN,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,EACJA,EAAOmV,IACTN,GAAQ5Z,EAAMsZ,MAAUvU,EACxBA,GAAQ,IAGZlB,GAAQ+V,GAAS,GAAKM,GAAM,EAExBrW,EAAO2V,EAAM,CACfnQ,EAAK+E,IAAM,gCACXc,EAAMuL,KAAOrB,GACb,MAAM9iB,CACR,CAMA,GAJAsjB,KAAUM,EACVnV,GAAQmV,EAERA,EAAKX,EAAOvE,EACRnR,EAAOqW,EAAI,CAEb,GADAA,EAAKrW,EAAOqW,EACRA,EAAKT,GACHvK,EAAMwL,KAAM,CACdrR,EAAK+E,IAAM,gCACXc,EAAMuL,KAAOrB,GACb,MAAM9iB,CACR,CA0BF,GAFA3B,EAAO,EACPwlB,EAAcR,EACA,IAAVD,GAEF,GADA/kB,GAAQ6Z,EAAQ0L,EACZA,EAAKrY,EAAK,CACZA,GAAOqY,EACP,GACE9K,EAAOmK,KAAUI,EAAShlB,aACjBulB,GACXvlB,EAAO4kB,EAAO1V,EACdsW,EAAc/K,CAChB,OACF,GACSsK,EAAQQ,GAGf,GAFAvlB,GAAQ6Z,EAAQkL,EAAQQ,EACxBA,GAAMR,EACFQ,EAAKrY,EAAK,CACZA,GAAOqY,EACP,GACE9K,EAAOmK,KAAUI,EAAShlB,aACjBulB,GAEX,GADAvlB,EAAO,EACH+kB,EAAQ7X,EAAK,CACfqY,EAAKR,EACL7X,GAAOqY,EACP,GACE9K,EAAOmK,KAAUI,EAAShlB,aACjBulB,GACXvlB,EAAO4kB,EAAO1V,EACdsW,EAAc/K,CAChB,CACF,OAIA,GADAza,GAAQ+kB,EAAQQ,EACZA,EAAKrY,EAAK,CACZA,GAAOqY,EACP,GACE9K,EAAOmK,KAAUI,EAAShlB,aACjBulB,GACXvlB,EAAO4kB,EAAO1V,EACdsW,EAAc/K,CAChB,CAEF,KAAOvN,EAAM,GACXuN,EAAOmK,KAAUY,EAAYxlB,KAC7Bya,EAAOmK,KAAUY,EAAYxlB,KAC7Bya,EAAOmK,KAAUY,EAAYxlB,KAC7BkN,GAAO,EAELA,IACFuN,EAAOmK,KAAUY,EAAYxlB,KACzBkN,EAAM,IACRuN,EAAOmK,KAAUY,EAAYxlB,MAGnC,KACK,CACHA,EAAO4kB,EAAO1V,EACd,GACEuL,EAAOmK,KAAUnK,EAAOza,KACxBya,EAAOmK,KAAUnK,EAAOza,KACxBya,EAAOmK,KAAUnK,EAAOza,KACxBkN,GAAO,QACAA,EAAM,GACXA,IACFuN,EAAOmK,KAAUnK,EAAOza,KACpBkN,EAAM,IACRuN,EAAOmK,KAAUnK,EAAOza,MAG9B,CAYF,KAFA,CATA,GACe,GAALulB,EAIL,CACH7Q,EAAK+E,IAAM,wBACXc,EAAMuL,KAAOrB,GACb,MAAM9iB,CACR,CAPE2jB,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKM,GAAM,GAUpE,CAeF,CAEA,KACF,CACF,OAASZ,EAAMhR,GAAQiR,EAAOrO,GAG9BrJ,EAAMkD,GAAQ,EACduU,GAAOzX,EACPkD,GAAQlD,GAAO,EACf+X,IAAS,GAAK7U,GAAQ,EAGtBsE,EAAK4G,QAAUqJ,EACfjQ,EAAKiG,SAAWiK,EAChBlQ,EAAK2G,SAAYsJ,EAAMhR,EAAYA,EAAOgR,EAAZ,EAAmB,GAAKA,EAAMhR,GAC5De,EAAK8F,UAAaoK,EAAOrO,EAAaA,EAAMqO,EAAb,IAAqB,KAAOA,EAAOrO,GAClEgE,EAAM0K,KAAOA,EACb1K,EAAMnK,KAAOA,CAEf,EAqBA,MAAM4V,GAAU,GASVC,GAAQ,IAAIjH,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAGzDkH,GAAO,IAAI1Y,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAGpD2Y,GAAQ,IAAInH,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,IAG1BoH,GAAO,IAAI5Y,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,KAkStB,IAAI6Y,GA/RkB,CAACnsB,EAAMosB,EAAMC,EAAYC,EAAOtQ,EAAOuQ,EAAaC,EAAMC,KAE9E,MAAMvW,EAAOuW,EAAKvW,KAGlB,IASIwW,EACAC,EACAC,EACAC,EACA7F,EAGAvF,EAhBAzO,EAAM,EACN8Z,EAAM,EACNxlB,EAAM,EAAGE,EAAM,EACftC,EAAO,EACP6nB,EAAO,EACPC,EAAO,EACPrlB,EAAO,EACP0b,EAAO,EACP4J,EAAO,EAMP5U,EAAO,KAGX,MAAMU,EAAQ,IAAI+L,YAAYgH,IACxBoB,EAAO,IAAIpI,YAAYgH,IAC7B,IAEIqB,EAAWC,EAASC,EAFpBxV,EAAQ,KAoCZ,IAAK7E,EAAM,EAAGA,GAAO8Y,GAAS9Y,IAC5B+F,EAAM/F,GAAO,EAEf,IAAK8Z,EAAM,EAAGA,EAAMR,EAAOQ,IACzB/T,EAAMqT,EAAKC,EAAaS,MAK1B,IADA5nB,EAAOgR,EACF1O,EAAMskB,GAAStkB,GAAO,GACN,IAAfuR,EAAMvR,GADkBA,KAM9B,GAHItC,EAAOsC,IACTtC,EAAOsC,GAEG,IAARA,EAaF,OATAwU,EAAMuQ,KAAkB,SAMxBvQ,EAAMuQ,KAAkB,SAExBE,EAAKvW,KAAO,EACL,EAET,IAAK5O,EAAM,EAAGA,EAAME,GACC,IAAfuR,EAAMzR,GADaA,KASzB,IANIpC,EAAOoC,IACTpC,EAAOoC,GAITK,EAAO,EACFqL,EAAM,EAAGA,GAAO8Y,GAAS9Y,IAG5B,GAFArL,IAAS,EACTA,GAAQoR,EAAM/F,GACVrL,EAAO,EACT,OAAO,EAGX,GAAIA,EAAO,IApIG,IAoIG3H,GAA4B,IAARwH,GACnC,OAAO,EAKT,IADA0lB,EAAK,GAAK,EACLla,EAAM,EAAGA,EAAM8Y,GAAS9Y,IAC3Bka,EAAKla,EAAM,GAAKka,EAAKla,GAAO+F,EAAM/F,GAIpC,IAAK8Z,EAAM,EAAGA,EAAMR,EAAOQ,IACM,IAA3BV,EAAKC,EAAaS,KACpBN,EAAKU,EAAKd,EAAKC,EAAaS,OAAWA,GAiE3C,GAlNc,IAuLV9sB,GACFqY,EAAOR,EAAQ2U,EACf/K,EAAQ,IAxLG,IA0LFzhB,GACTqY,EAAO0T,GACPlU,EAAQmU,GACRvK,EAAQ,MAGRpJ,EAAO4T,GACPpU,EAAQqU,GACRzK,EAAQ,GAIVwL,EAAO,EACPH,EAAM,EACN9Z,EAAM1L,EACN0f,EAAOuF,EACPQ,EAAO7nB,EACP8nB,EAAO,EACPJ,GAAM,EACNvJ,EAAO,GAAKne,EACZ2nB,EAAOxJ,EAAO,EA9MD,IAiNRrjB,GAAmBqjB,EAtNJ,KAMN,IAiNXrjB,GAAoBqjB,EAtNF,IAuNnB,OAAO,EAIT,OAAS,CAEP8J,EAAYna,EAAMga,EACdR,EAAKM,GAAO,EAAIrL,GAClB2L,EAAU,EACVC,EAAWb,EAAKM,IAETN,EAAKM,IAAQrL,GACpB2L,EAAUvV,EAAM2U,EAAKM,GAAOrL,GAC5B4L,EAAWhV,EAAKmU,EAAKM,GAAOrL,KAG5B2L,EAAU,GACVC,EAAW,GAIbX,EAAO,GAAM1Z,EAAMga,EACnBL,EAAO,GAAKI,EACZzlB,EAAMqlB,EACN,GACEA,GAAQD,EACR1Q,EAAMgL,GAAQiG,GAAQD,GAAQL,GAASQ,GAAa,GAAOC,GAAW,GAAMC,QAC5D,IAATV,GAIT,IADAD,EAAO,GAAM1Z,EAAM,EACZia,EAAOP,GACZA,IAAS,EAWX,GATa,IAATA,GACFO,GAAQP,EAAO,EACfO,GAAQP,GAERO,EAAO,EAITH,IACqB,MAAf/T,EAAM/F,GAAY,CACtB,GAAIA,IAAQxL,EAAO,MACnBwL,EAAMoZ,EAAKC,EAAaG,EAAKM,GAC/B,CAGA,GAAI9Z,EAAM9N,IAAS+nB,EAAOJ,KAAUD,EAAK,CAYvC,IAVa,IAATI,IACFA,EAAO9nB,GAIT8hB,GAAQ1f,EAGRylB,EAAO/Z,EAAMga,EACbrlB,EAAO,GAAKolB,EACLA,EAAOC,EAAOxlB,IACnBG,GAAQoR,EAAMgU,EAAOC,KACjBrlB,GAAQ,KACZolB,IACAplB,IAAS,EAKX,GADA0b,GAAQ,GAAK0J,EAxRJ,IAyRJ/sB,GAAmBqjB,EA9RR,KAMN,IAyRPrjB,GAAoBqjB,EA9RN,IA+Rf,OAAO,EAITuJ,EAAMK,EAAOJ,EAIb7Q,EAAM4Q,GAAQ1nB,GAAQ,GAAO6nB,GAAQ,GAAO/F,EAAOuF,CACrD,CACF,CAeA,OAVa,IAATU,IAIFjR,EAAMgL,EAAOiG,GAAUja,EAAMga,GAAS,GAAO,IAAM,IAKrDP,EAAKvW,KAAOhR,EACL,GA8BT,MAQE0X,SAAU0Q,GAAAzQ,QAAYA,GAAAC,QAASA,GAC/BC,KAAMwQ,GAAQvQ,aAAcwQ,GAAgBvQ,YAAawQ,GAAetQ,eAAgBuQ,GAAkBtQ,aAAcuQ,GAAgBtQ,YAAauQ,GAAAtQ,YAAeA,GAAAa,WACpKA,IACE5B,GAOKsR,GAAO,MAUPC,GAAO,MACHC,GAAO,MACPC,GAAS,MAETC,GAAQ,MAKJC,GAAO,MACPC,GAAM,MAMdC,GAAQ,MAGRC,GAAM,MAiBTC,GAAWrG,IAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,IAIzB,SAASsG,KACPz0B,KAAK0gB,KAAO,KACZ1gB,KAAK8xB,KAAO,EACZ9xB,KAAK2f,MAAO,EACZ3f,KAAKunB,KAAO,EAEZvnB,KAAK00B,UAAW,EAChB10B,KAAK20B,MAAQ,EAEb30B,KAAK6wB,KAAO,EACZ7wB,KAAK40B,MAAQ,EACb50B,KAAK8U,MAAQ,EAEb9U,KAAKgmB,KAAO,KAGZhmB,KAAK60B,MAAQ,EACb70B,KAAK6lB,MAAQ,EACb7lB,KAAK8wB,MAAQ,EACb9wB,KAAK+wB,MAAQ,EACb/wB,KAAKsC,OAAS,KAGdtC,KAAKixB,KAAO,EACZjxB,KAAKoc,KAAO,EAGZpc,KAAKiF,OAAS,EACdjF,KAAK80B,OAAS,EAGd90B,KAAK+d,MAAQ,EAGb/d,KAAKyxB,QAAU,KACfzxB,KAAK0xB,SAAW,KAChB1xB,KAAK2xB,QAAU,EACf3xB,KAAK4xB,SAAW,EAGhB5xB,KAAK+0B,MAAQ,EACb/0B,KAAKg1B,KAAO,EACZh1B,KAAKi1B,MAAQ,EACbj1B,KAAKopB,KAAO,EACZppB,KAAKktB,KAAO,KAEZltB,KAAKsyB,KAAO,IAAItH,YAAY,KAC5BhrB,KAAK0yB,KAAO,IAAI1H,YAAY,KAO5BhrB,KAAKk1B,OAAS,KACdl1B,KAAKm1B,QAAU,KACfn1B,KAAK+xB,KAAO,EACZ/xB,KAAKo1B,KAAO,EACZp1B,KAAKq1B,IAAM,CACb,CAGA,MAAMC,GAAqB5U,IAEzB,IAAKA,EACH,OAAO,EAET,MAAM6F,EAAQ7F,EAAK6F,MACnB,OAAKA,GAASA,EAAM7F,OAASA,GAC3B6F,EAAMuL,KAAOiC,IAAQxN,EAAMuL,KA7Ff,MA8FL,EAEF,GAIHyD,GAAoB7U,IAExB,GAAI4U,GAAkB5U,GAAS,OAAOkT,GACtC,MAAMrN,EAAQ7F,EAAK6F,MAqBnB,OApBA7F,EAAK8G,SAAW9G,EAAKkG,UAAYL,EAAMzR,MAAQ,EAC/C4L,EAAK+E,IAAM,GACPc,EAAMgB,OACR7G,EAAKkB,MAAqB,EAAb2E,EAAMgB,MAErBhB,EAAMuL,KAAOiC,GACbxN,EAAM5G,KAAO,EACb4G,EAAMmO,SAAW,EACjBnO,EAAMoO,OAAQ,EACdpO,EAAMsK,KAAO,MACbtK,EAAMP,KAAO,KACbO,EAAM0K,KAAO,EACb1K,EAAMnK,KAAO,EAEbmK,EAAMkL,QAAUlL,EAAM2O,OAAS,IAAIM,WAhHjB,KAiHlBjP,EAAMmL,SAAWnL,EAAM4O,QAAU,IAAIK,WAhHlB,KAkHnBjP,EAAMwL,KAAO,EACbxL,EAAM6O,MAAO,EAEN3B,IAIHgC,GAAgB/U,IAEpB,GAAI4U,GAAkB5U,GAAS,OAAOkT,GACtC,MAAMrN,EAAQ7F,EAAK6F,MAInB,OAHAA,EAAMV,MAAQ,EACdU,EAAMuK,MAAQ,EACdvK,EAAMwK,MAAQ,EACPwE,GAAiB7U,IAKpBgV,GAAgB,CAAChV,EAAM+K,KAC3B,IAAIlE,EAGJ,GAAI+N,GAAkB5U,GAAS,OAAOkT,GACtC,MAAMrN,EAAQ7F,EAAK6F,MAenB,OAZIkF,EAAa,GACflE,EAAO,EACPkE,GAAcA,IAGdlE,EAA2B,GAAnBkE,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCmI,IAEY,OAAjBrN,EAAMjkB,QAAmBikB,EAAMsO,QAAUpJ,IAC3ClF,EAAMjkB,OAAS,MAIjBikB,EAAMgB,KAAOA,EACbhB,EAAMsO,MAAQpJ,EACPgK,GAAa/U,KAIhBiV,GAAe,CAACjV,EAAM+K,KAE1B,IAAK/K,EAAQ,OAAOkT,GAGpB,MAAMrN,EAAQ,IAAIkO,GAIlB/T,EAAK6F,MAAQA,EACbA,EAAM7F,KAAOA,EACb6F,EAAMjkB,OAAS,KACfikB,EAAMuL,KAAOiC,GACb,MAAMxI,EAAMmK,GAAchV,EAAM+K,GAIhC,OAHIF,IAAQkI,KACV/S,EAAK6F,MAAQ,MAERgF,GAoBT,IAEIqK,GAAQC,GAFRC,IAAS,EAKb,MAAMC,GAAexP,IAGnB,GAAIuP,GAAQ,CACVF,GAAS,IAAIJ,WAAW,KACxBK,GAAU,IAAIL,WAAW,IAGzB,IAAIxC,EAAM,EACV,KAAOA,EAAM,KAAOzM,EAAM+L,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAM+L,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAM+L,KAAKU,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAM+L,KAAKU,KAAS,EAMxC,IAJAX,GAtRS,EAsRO9L,EAAM+L,KAAM,EAAG,IAAKsD,GAAU,EAAGrP,EAAMmM,KAAM,CAAEtW,KAAM,IAGrE4W,EAAM,EACCA,EAAM,IAAMzM,EAAM+L,KAAKU,KAAS,EAEvCX,GA3RU,EA2RM9L,EAAM+L,KAAM,EAAG,GAAMuD,GAAS,EAAGtP,EAAMmM,KAAM,CAAEtW,KAAM,IAGrE0Z,IAAS,CACX,CAEAvP,EAAMkL,QAAUmE,GAChBrP,EAAMoL,QAAU,EAChBpL,EAAMmL,SAAWmE,GACjBtP,EAAMqL,SAAW,GAkBboE,GAAe,CAACtV,EAAM1O,EAAKuQ,EAAK+J,KAEpC,IAAIpR,EACJ,MAAMqL,EAAQ7F,EAAK6F,MAqCnB,OAlCqB,OAAjBA,EAAMjkB,SACRikB,EAAMV,MAAQ,GAAKU,EAAMsO,MACzBtO,EAAMwK,MAAQ,EACdxK,EAAMuK,MAAQ,EAEdvK,EAAMjkB,OAAS,IAAIkX,WAAW+M,EAAMV,QAIlCyG,GAAQ/F,EAAMV,OAChBU,EAAMjkB,OAAOlC,IAAI4R,EAAI4N,SAAS2C,EAAMgE,EAAMV,MAAOtD,GAAM,GACvDgE,EAAMwK,MAAQ,EACdxK,EAAMuK,MAAQvK,EAAMV,QAGpB3K,EAAOqL,EAAMV,MAAQU,EAAMwK,MACvB7V,EAAOoR,IACTpR,EAAOoR,GAGT/F,EAAMjkB,OAAOlC,IAAI4R,EAAI4N,SAAS2C,EAAM+J,EAAM/J,EAAM+J,EAAOpR,GAAOqL,EAAMwK,QACpEzE,GAAQpR,IAGNqL,EAAMjkB,OAAOlC,IAAI4R,EAAI4N,SAAS2C,EAAM+J,EAAM/J,GAAM,GAChDgE,EAAMwK,MAAQzE,EACd/F,EAAMuK,MAAQvK,EAAMV,QAGpBU,EAAMwK,OAAS7V,EACXqL,EAAMwK,QAAUxK,EAAMV,QAASU,EAAMwK,MAAQ,GAC7CxK,EAAMuK,MAAQvK,EAAMV,QAASU,EAAMuK,OAAS5V,KAG7C,GAipCT,IAuBI+a,GAAc,CACjBR,aAxBoBA,GAyBpBC,cAxBqBA,GAyBrBH,iBAxBwBA,GAyBxBW,YAxxCoBxV,GAEZiV,GAAajV,EA3LJ,IAk9CjBiV,aAxBoBA,GAyBpBQ,QA1qCiB,CAACzV,EAAMyI,KAEvB,IAAI5C,EACAlP,EAAOoP,EACPyG,EACAkJ,EACAhN,EAAMvb,EACNojB,EACA7U,EACAuU,EAAKC,EACLtE,EACAtgB,EACAwlB,EAEA6B,EAAWC,EAASC,EAEpB8C,EAAWC,EAASC,EACpBrd,EACAqS,EALA+F,EAAO,EAMX,MAAMkF,EAAO,IAAIhd,WAAW,GAC5B,IAAImZ,EAEAtW,EAEJ,MAAMoa,EAAA,IACAjd,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAGjF,GAAI8b,GAAkB5U,KAAUA,EAAK+F,SAC/B/F,EAAKrJ,OAA2B,IAAlBqJ,EAAK2G,SACvB,OAAOuM,GAGTrN,EAAQ7F,EAAK6F,MACTA,EAAMuL,OAASmC,KAAQ1N,EAAMuL,KAAOoC,IAIxCkC,EAAM1V,EAAKiG,SACXF,EAAS/F,EAAK+F,OACd5Y,EAAO6S,EAAK8F,UACZ0G,EAAOxM,EAAK4G,QACZjQ,EAAQqJ,EAAKrJ,MACb+R,EAAO1I,EAAK2G,SACZ4J,EAAO1K,EAAM0K,KACb7U,EAAOmK,EAAMnK,KAGbuU,EAAMvH,EACNwH,EAAO/iB,EACP0d,EAAMkI,GAENiD,EACA,OACE,OAAQnQ,EAAMuL,MACZ,KAAKiC,GACH,GAAmB,IAAfxN,EAAMgB,KAAY,CACpBhB,EAAMuL,KAAOoC,GACb,KACF,CAEA,KAAO9X,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAbmK,EAAMgB,MAAsB,QAAT0J,EAAiB,CACnB,IAAhB1K,EAAMsO,QACRtO,EAAMsO,MAAQ,IAEhBtO,EAAMqO,MAAQ,EAEd4B,EAAK,GAAY,IAAPvF,EACVuF,EAAK,GAAMvF,IAAS,EAAK,IACzB1K,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAO4B,EAAM,EAAG,GAI5CvF,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KApaC,MAqaP,KACF,CAIA,GAHIvL,EAAMP,OACRO,EAAMP,KAAK2Q,MAAO,KAED,EAAbpQ,EAAMgB,UACA,IAAP0J,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDvQ,EAAK+E,IAAM,yBACXc,EAAMuL,KAAOyC,GACb,KACF,CACA,IAAY,GAAPtD,KAA4B5M,GAAY,CAC3C3D,EAAK+E,IAAM,6BACXc,EAAMuL,KAAOyC,GACb,KACF,CASA,GAPAtD,KAAU,EACV7U,GAAQ,EAERlD,EAAiC,GAAnB,GAAP+X,GACa,IAAhB1K,EAAMsO,QACRtO,EAAMsO,MAAQ3b,GAEZA,EAAM,IAAMA,EAAMqN,EAAMsO,MAAO,CACjCnU,EAAK+E,IAAM,sBACXc,EAAMuL,KAAOyC,GACb,KACF,CAIAhO,EAAMsK,KAAO,GAAKtK,EAAMsO,MAGxBtO,EAAMoO,MAAQ,EAEdjU,EAAKkB,MAAQ2E,EAAMqO,MAAQ,EAC3BrO,EAAMuL,KAAc,IAAPb,EAncH,MAmc2BgD,GAErChD,EAAO,EACP7U,EAAO,EAEP,MACF,KAjdW,MAmdT,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAGA,GADAmK,EAAMoO,MAAQ1D,GACK,IAAd1K,EAAMoO,SAAkBtQ,GAAY,CACvC3D,EAAK+E,IAAM,6BACXc,EAAMuL,KAAOyC,GACb,KACF,CACA,GAAkB,MAAdhO,EAAMoO,MAAgB,CACxBjU,EAAK+E,IAAM,2BACXc,EAAMuL,KAAOyC,GACb,KACF,CACIhO,EAAMP,OACRO,EAAMP,KAAKvgB,KAASwrB,GAAQ,EAAK,GAEhB,IAAd1K,EAAMoO,OAAiC,EAAbpO,EAAMgB,OAEnCiP,EAAK,GAAY,IAAPvF,EACVuF,EAAK,GAAMvF,IAAS,EAAK,IACzB1K,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAO4B,EAAM,EAAG,IAI9CvF,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KAlfE,MAofV,KApfU,MAsfR,KAAO1V,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEImK,EAAMP,OACRO,EAAMP,KAAKrc,KAAOsnB,GAED,IAAd1K,EAAMoO,OAAiC,EAAbpO,EAAMgB,OAEnCiP,EAAK,GAAY,IAAPvF,EACVuF,EAAK,GAAMvF,IAAS,EAAK,IACzBuF,EAAK,GAAMvF,IAAS,GAAM,IAC1BuF,EAAK,GAAMvF,IAAS,GAAM,IAC1B1K,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAO4B,EAAM,EAAG,IAI9CvF,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KA5gBA,MA8gBR,KA9gBQ,MAghBN,KAAO1V,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEImK,EAAMP,OACRO,EAAMP,KAAK4Q,OAAiB,IAAP3F,EACrB1K,EAAMP,KAAKoG,GAAM6E,GAAQ,GAER,IAAd1K,EAAMoO,OAAiC,EAAbpO,EAAMgB,OAEnCiP,EAAK,GAAY,IAAPvF,EACVuF,EAAK,GAAMvF,IAAS,EAAK,IACzB1K,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAO4B,EAAM,EAAG,IAI9CvF,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KAriBG,MAuiBX,KAviBW,MAwiBT,GAAkB,KAAdvL,EAAMoO,MAAgB,CAExB,KAAOvY,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEAmK,EAAMthB,OAASgsB,EACX1K,EAAMP,OACRO,EAAMP,KAAK6Q,UAAY5F,GAEN,IAAd1K,EAAMoO,OAAiC,EAAbpO,EAAMgB,OAEnCiP,EAAK,GAAY,IAAPvF,EACVuF,EAAK,GAAMvF,IAAS,EAAK,IACzB1K,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAO4B,EAAM,EAAG,IAI9CvF,EAAO,EACP7U,EAAO,CAET,MACSmK,EAAMP,OACbO,EAAMP,KAAKjI,MAAQ,MAErBwI,EAAMuL,KAnkBG,MAqkBX,KArkBW,MAskBT,GAAkB,KAAdvL,EAAMoO,QACRrI,EAAO/F,EAAMthB,OACTqnB,EAAOlD,IAAQkD,EAAOlD,GACtBkD,IACE/F,EAAMP,OACR9M,EAAMqN,EAAMP,KAAK6Q,UAAYtQ,EAAMthB,OAC9BshB,EAAMP,KAAKjI,QAEdwI,EAAMP,KAAKjI,MAAQ,IAAIvE,WAAW+M,EAAMP,KAAK6Q,YAE/CtQ,EAAMP,KAAKjI,MAAM3d,IACfiX,EAAMuI,SACJsN,EAGAA,EAAOZ,GAGTpT,IAMe,IAAdqN,EAAMoO,OAAiC,EAAbpO,EAAMgB,OACnChB,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAOvd,EAAOiV,EAAMY,IAElD9D,GAAQkD,EACRY,GAAQZ,EACR/F,EAAMthB,QAAUqnB,GAEd/F,EAAMthB,QAAU,MAAMyxB,EAE5BnQ,EAAMthB,OAAS,EACfshB,EAAMuL,KAvmBE,MAymBV,KAzmBU,MA0mBR,GAAkB,KAAdvL,EAAMoO,MAAgB,CACxB,GAAa,IAATvL,EAAc,MAAMsN,EACxBpK,EAAO,EACP,GAEEpT,EAAM7B,EAAM6V,EAAOZ,KAEf/F,EAAMP,MAAQ9M,GACbqN,EAAMthB,OAAS,QAClBshB,EAAMP,KAAK7f,MAAQoM,OAAOyb,aAAa9U,UAElCA,GAAOoT,EAAOlD,GAOvB,GALmB,IAAd7C,EAAMoO,OAAiC,EAAbpO,EAAMgB,OACnChB,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAOvd,EAAOiV,EAAMY,IAElD9D,GAAQkD,EACRY,GAAQZ,EACJpT,EAAO,MAAMwd,CACnB,MACSnQ,EAAMP,OACbO,EAAMP,KAAK7f,KAAO,MAEpBogB,EAAMthB,OAAS,EACfshB,EAAMuL,KAjoBK,MAmoBb,KAnoBa,MAooBX,GAAkB,KAAdvL,EAAMoO,MAAgB,CACxB,GAAa,IAATvL,EAAc,MAAMsN,EACxBpK,EAAO,EACP,GACEpT,EAAM7B,EAAM6V,EAAOZ,KAEf/F,EAAMP,MAAQ9M,GACbqN,EAAMthB,OAAS,QAClBshB,EAAMP,KAAKmG,SAAW5Z,OAAOyb,aAAa9U,UAErCA,GAAOoT,EAAOlD,GAMvB,GALmB,IAAd7C,EAAMoO,OAAiC,EAAbpO,EAAMgB,OACnChB,EAAMqO,MAAQxS,GAAQmE,EAAMqO,MAAOvd,EAAOiV,EAAMY,IAElD9D,GAAQkD,EACRY,GAAQZ,EACJpT,EAAO,MAAMwd,CACnB,MACSnQ,EAAMP,OACbO,EAAMP,KAAKmG,QAAU,MAEvB5F,EAAMuL,KAxpBE,MA0pBV,KA1pBU,MA2pBR,GAAkB,IAAdvL,EAAMoO,MAAgB,CAExB,KAAOvY,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAbmK,EAAMgB,MAAa0J,KAAwB,MAAd1K,EAAMqO,OAAiB,CACvDlU,EAAK+E,IAAM,sBACXc,EAAMuL,KAAOyC,GACb,KACF,CAEAtD,EAAO,EACP7U,EAAO,CAET,CACImK,EAAMP,OACRO,EAAMP,KAAKkG,KAAS3F,EAAMoO,OAAS,EAAK,EACxCpO,EAAMP,KAAK2Q,MAAO,GAEpBjW,EAAKkB,MAAQ2E,EAAMqO,MAAQ,EAC3BrO,EAAMuL,KAAOmC,GACb,MACF,KAprBY,MAsrBV,KAAO7X,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEAsE,EAAKkB,MAAQ2E,EAAMqO,MAAQJ,GAAQvD,GAEnCA,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KAAOkC,GAEf,KAAKA,GACH,GAAuB,IAAnBzN,EAAMmO,SASR,OAPAhU,EAAKiG,SAAWyP,EAChB1V,EAAK8F,UAAY3Y,EACjB6S,EAAK4G,QAAU4F,EACfxM,EAAK2G,SAAW+B,EAChB7C,EAAM0K,KAAOA,EACb1K,EAAMnK,KAAOA,EAENuX,GAETjT,EAAKkB,MAAQ2E,EAAMqO,MAAQ,EAC3BrO,EAAMuL,KAAOmC,GAEf,KAAKA,GACH,GAAI9K,IAAUpG,IAAWoG,IAAUnG,GAAW,MAAM0T,EAEtD,KAAKxC,GACH,GAAI3N,EAAM5G,KAAM,CAEdsR,KAAiB,EAAP7U,EACVA,GAAe,EAAPA,EAERmK,EAAMuL,KAAOwC,GACb,KACF,CAEA,KAAOlY,EAAO,GAAG,CACf,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAQA,OANAmK,EAAM5G,KAAe,EAAPsR,EAEdA,KAAU,EACV7U,GAAQ,EAGQ,EAAP6U,GACP,KAAK,EAGH1K,EAAMuL,KA7uBI,MA8uBV,MACF,KAAK,EAKH,GAJAiE,GAAYxP,GAGZA,EAAMuL,KAAOsC,GACTjL,IAAUnG,GAAS,CAErBiO,KAAU,EACV7U,GAAQ,EAER,MAAMsa,CACR,CACA,MACF,KAAK,EAGHnQ,EAAMuL,KA5vBG,MA6vBT,MACF,KAAK,EACHpR,EAAK+E,IAAM,qBACXc,EAAMuL,KAAOyC,GAGjBtD,KAAU,EACV7U,GAAQ,EAER,MACF,KA1wBgB,MAgxBd,IAJA6U,KAAiB,EAAP7U,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEA,IAAY,MAAP6U,KAAqBA,IAAS,GAAM,OAAS,CAChDvQ,EAAK+E,IAAM,+BACXc,EAAMuL,KAAOyC,GACb,KACF,CASA,GARAhO,EAAMthB,OAAgB,MAAPgsB,EAIfA,EAAO,EACP7U,EAAO,EAEPmK,EAAMuL,KAAOqC,GACThL,IAAUnG,GAAW,MAAM0T,EAEjC,KAAKvC,GACH5N,EAAMuL,KAryBM,MAuyBd,KAvyBc,MAyyBZ,GADAxF,EAAO/F,EAAMthB,OACTqnB,EAAM,CAGR,GAFIA,EAAOlD,IAAQkD,EAAOlD,GACtBkD,EAAOze,IAAQye,EAAOze,GACb,IAATye,EAAc,MAAMoK,EAExBjQ,EAAOrmB,IAAIiX,EAAMuI,SAASsN,EAAMA,EAAOZ,GAAO8J,GAE9ChN,GAAQkD,EACRY,GAAQZ,EACRze,GAAQye,EACR8J,GAAO9J,EACP/F,EAAMthB,QAAUqnB,EAChB,KACF,CAEA/F,EAAMuL,KAAOmC,GACb,MACF,KAzzBe,MA2zBb,KAAO7X,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAkBA,GAhBAmK,EAAMyO,KAAkC,KAAnB,GAAP/D,GAEdA,KAAU,EACV7U,GAAQ,EAERmK,EAAM0O,MAAmC,GAAnB,GAAPhE,GAEfA,KAAU,EACV7U,GAAQ,EAERmK,EAAMwO,MAAmC,GAAnB,GAAP9D,GAEfA,KAAU,EACV7U,GAAQ,EAGJmK,EAAMyO,KAAO,KAAOzO,EAAM0O,MAAQ,GAAI,CACxCvU,EAAK+E,IAAM,sCACXc,EAAMuL,KAAOyC,GACb,KACF,CAGAhO,EAAM6C,KAAO,EACb7C,EAAMuL,KAz1BS,MA21BjB,KA31BiB,MA41Bf,KAAOvL,EAAM6C,KAAO7C,EAAMwO,OAAO,CAE/B,KAAO3Y,EAAO,GAAG,CACf,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEAmK,EAAM+L,KAAKmE,EAAMlQ,EAAM6C,SAAmB,EAAP6H,EAEnCA,KAAU,EACV7U,GAAQ,CAEV,CACA,KAAOmK,EAAM6C,KAAO,IAClB7C,EAAM+L,KAAKmE,EAAMlQ,EAAM6C,SAAW,EAapC,GAPA7C,EAAMkL,QAAUlL,EAAM2O,OACtB3O,EAAMoL,QAAU,EAEhBgB,EAAO,CAAEvW,KAAMmK,EAAMoL,SACrBpG,EAAM8G,GAz5BA,EAy5BgB9L,EAAM+L,KAAM,EAAG,GAAI/L,EAAMkL,QAAS,EAAGlL,EAAMmM,KAAMC,GACvEpM,EAAMoL,QAAUgB,EAAKvW,KAEjBmP,EAAK,CACP7K,EAAK+E,IAAM,2BACXc,EAAMuL,KAAOyC,GACb,KACF,CAEAhO,EAAM6C,KAAO,EACb7C,EAAMuL,KA/3BU,MAi4BlB,KAj4BkB,MAk4BhB,KAAOvL,EAAM6C,KAAO7C,EAAMyO,KAAOzO,EAAM0O,OAAO,CAC5C,KACE3D,EAAO/K,EAAMkL,QAAQR,GAAS,GAAK1K,EAAMoL,SAAW,GACpD0B,EAAY/B,IAAS,GACrBgC,EAAWhC,IAAS,GAAM,IAC1BiC,EAAkB,MAAPjC,IAEN+B,GAAcjX,IANZ,CAQP,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CAEV,CACA,GAAImX,EAAW,GAEbtC,KAAUoC,EACVjX,GAAQiX,EAER9M,EAAM+L,KAAK/L,EAAM6C,QAAUmK,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADAlX,EAAIgX,EAAY,EACTjX,EAAOC,GAAG,CACf,GAAa,IAAT+M,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAMA,GAHA6U,KAAUoC,EACVjX,GAAQiX,EAEW,IAAf9M,EAAM6C,KAAY,CACpB1I,EAAK+E,IAAM,4BACXc,EAAMuL,KAAOyC,GACb,KACF,CACArb,EAAMqN,EAAM+L,KAAK/L,EAAM6C,KAAO,GAC9BkD,EAAO,GAAY,EAAP2E,GAEZA,KAAU,EACV7U,GAAQ,CAEV,MAAA,GACsB,KAAbmX,EAAiB,CAGxB,IADAlX,EAAIgX,EAAY,EACTjX,EAAOC,GAAG,CACf,GAAa,IAAT+M,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAGA6U,KAAUoC,EACVjX,GAAQiX,EAERna,EAAM,EACNoT,EAAO,GAAY,EAAP2E,GAEZA,KAAU,EACV7U,GAAQ,CAEV,KACK,CAGH,IADAC,EAAIgX,EAAY,EACTjX,EAAOC,GAAG,CACf,GAAa,IAAT+M,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAGA6U,KAAUoC,EACVjX,GAAQiX,EAERna,EAAM,EACNoT,EAAO,IAAa,IAAP2E,GAEbA,KAAU,EACV7U,GAAQ,CAEV,CACA,GAAImK,EAAM6C,KAAOkD,EAAO/F,EAAMyO,KAAOzO,EAAM0O,MAAO,CAChDvU,EAAK+E,IAAM,4BACXc,EAAMuL,KAAOyC,GACb,KACF,CACA,KAAOjI,KACL/F,EAAM+L,KAAK/L,EAAM6C,QAAUlQ,CAE/B,CACF,CAGA,GAAIqN,EAAMuL,OAASyC,GAAO,MAG1B,GAAwB,IAApBhO,EAAM+L,KAAK,KAAY,CACzB5R,EAAK+E,IAAM,uCACXc,EAAMuL,KAAOyC,GACb,KACF,CAcA,GATAhO,EAAMoL,QAAU,EAEhBgB,EAAO,CAAEvW,KAAMmK,EAAMoL,SACrBpG,EAAM8G,GA3hCD,EA2hCgB9L,EAAM+L,KAAM,EAAG/L,EAAMyO,KAAMzO,EAAMkL,QAAS,EAAGlL,EAAMmM,KAAMC,GAG9EpM,EAAMoL,QAAUgB,EAAKvW,KAGjBmP,EAAK,CACP7K,EAAK+E,IAAM,8BACXc,EAAMuL,KAAOyC,GACb,KACF,CAaA,GAXAhO,EAAMqL,SAAW,EAGjBrL,EAAMmL,SAAWnL,EAAM4O,QACvBxC,EAAO,CAAEvW,KAAMmK,EAAMqL,UACrBrG,EAAM8G,GA3iCA,EA2iCgB9L,EAAM+L,KAAM/L,EAAMyO,KAAMzO,EAAM0O,MAAO1O,EAAMmL,SAAU,EAAGnL,EAAMmM,KAAMC,GAG1FpM,EAAMqL,SAAWe,EAAKvW,KAGlBmP,EAAK,CACP7K,EAAK+E,IAAM,wBACXc,EAAMuL,KAAOyC,GACb,KACF,CAGA,GADAhO,EAAMuL,KAAOsC,GACTjL,IAAUnG,GAAW,MAAM0T,EAEjC,KAAKtC,GACH7N,EAAMuL,KAAOuC,GAEf,KAAKA,GACH,GAAIjL,GAAQ,GAAKvb,GAAQ,IAAK,CAE5B6S,EAAKiG,SAAWyP,EAChB1V,EAAK8F,UAAY3Y,EACjB6S,EAAK4G,QAAU4F,EACfxM,EAAK2G,SAAW+B,EAChB7C,EAAM0K,KAAOA,EACb1K,EAAMnK,KAAOA,EAEbsU,GAAQhQ,EAAMkQ,GAEdwF,EAAM1V,EAAKiG,SACXF,EAAS/F,EAAK+F,OACd5Y,EAAO6S,EAAK8F,UACZ0G,EAAOxM,EAAK4G,QACZjQ,EAAQqJ,EAAKrJ,MACb+R,EAAO1I,EAAK2G,SACZ4J,EAAO1K,EAAM0K,KACb7U,EAAOmK,EAAMnK,KAGTmK,EAAMuL,OAASmC,KACjB1N,EAAM6O,MAAO,GAEf,KACF,CAEA,IADA7O,EAAM6O,KAAO,EAEX9D,EAAO/K,EAAMkL,QAAQR,GAAS,GAAK1K,EAAMoL,SAAW,GACpD0B,EAAY/B,IAAS,GACrBgC,EAAWhC,IAAS,GAAM,IAC1BiC,EAAkB,MAAPjC,IAEP+B,GAAajX,IANV,CAQP,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CAEV,CACA,GAAIkX,KAAsB,IAAVA,GAAuB,CAIrC,IAHA+C,EAAYhD,EACZiD,EAAUhD,EACViD,EAAWhD,EAETjC,EAAO/K,EAAMkL,QAAQ8E,IACXtF,GAAS,GAAMoF,EAAYC,GAAY,IAAoCD,IACrFhD,EAAY/B,IAAS,GACrBgC,EAAWhC,IAAS,GAAM,IAC1BiC,EAAkB,MAAPjC,IAEN+E,EAAYhD,GAAcjX,IAPxB,CASP,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CAEV,CAEA6U,KAAUoF,EACVja,GAAQia,EAER9P,EAAM6O,MAAQiB,CAChB,CAOA,GALApF,KAAUoC,EACVjX,GAAQiX,EAER9M,EAAM6O,MAAQ/B,EACd9M,EAAMthB,OAASsuB,EACC,IAAZD,EAAe,CAIjB/M,EAAMuL,KAjmCO,MAkmCb,KACF,CACA,GAAc,GAAVwB,EAAc,CAEhB/M,EAAM6O,MAAO,EACb7O,EAAMuL,KAAOmC,GACb,KACF,CACA,GAAc,GAAVX,EAAc,CAChB5S,EAAK+E,IAAM,8BACXc,EAAMuL,KAAOyC,GACb,KACF,CACAhO,EAAMxI,MAAkB,GAAVuV,EACd/M,EAAMuL,KApnCY,MAsnCpB,KAtnCoB,MAunClB,GAAIvL,EAAMxI,MAAO,CAGf,IADA1B,EAAIkK,EAAMxI,MACH3B,EAAOC,GAAG,CACf,GAAa,IAAT+M,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEAmK,EAAMthB,QAAUgsB,GAAS,GAAK1K,EAAMxI,OAAS,EAE7CkT,KAAU1K,EAAMxI,MAChB3B,GAAQmK,EAAMxI,MAEdwI,EAAM6O,MAAQ7O,EAAMxI,KACtB,CAEAwI,EAAM8O,IAAM9O,EAAMthB,OAClBshB,EAAMuL,KAzoCU,MA2oClB,KA3oCkB,MA4oChB,KACER,EAAO/K,EAAMmL,SAAST,GAAS,GAAK1K,EAAMqL,UAAY,GACtDyB,EAAY/B,IAAS,GACrBgC,EAAWhC,IAAS,GAAM,IAC1BiC,EAAkB,MAAPjC,IAEN+B,GAAcjX,IANZ,CAQP,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CAEV,CACA,KAAe,IAAVkX,GAAuB,CAI1B,IAHA+C,EAAYhD,EACZiD,EAAUhD,EACViD,EAAWhD,EAETjC,EAAO/K,EAAMmL,SAAS6E,IACZtF,GAAS,GAAMoF,EAAYC,GAAY,IAAoCD,IACrFhD,EAAY/B,IAAS,GACrBgC,EAAWhC,IAAS,GAAM,IAC1BiC,EAAkB,MAAPjC,IAEN+E,EAAYhD,GAAcjX,IAPxB,CASP,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CAEV,CAEA6U,KAAUoF,EACVja,GAAQia,EAER9P,EAAM6O,MAAQiB,CAChB,CAMA,GAJApF,KAAUoC,EACVjX,GAAQiX,EAER9M,EAAM6O,MAAQ/B,EACA,GAAVC,EAAc,CAChB5S,EAAK+E,IAAM,wBACXc,EAAMuL,KAAOyC,GACb,KACF,CACAhO,EAAMuO,OAASvB,EACfhN,EAAMxI,MAAoB,GAAXuV,EACf/M,EAAMuL,KA9rCa,MAgsCrB,KAhsCqB,MAisCnB,GAAIvL,EAAMxI,MAAO,CAGf,IADA1B,EAAIkK,EAAMxI,MACH3B,EAAOC,GAAG,CACf,GAAa,IAAT+M,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEAmK,EAAMuO,QAAU7D,GAAS,GAAK1K,EAAMxI,OAAS,EAE7CkT,KAAU1K,EAAMxI,MAChB3B,GAAQmK,EAAMxI,MAEdwI,EAAM6O,MAAQ7O,EAAMxI,KACtB,CAEA,GAAIwI,EAAMuO,OAASvO,EAAMsK,KAAM,CAC7BnQ,EAAK+E,IAAM,gCACXc,EAAMuL,KAAOyC,GACb,KACF,CAGAhO,EAAMuL,KAztCW,MA2tCnB,KA3tCmB,MA4tCjB,GAAa,IAATjkB,EAAc,MAAM6oB,EAExB,GADApK,EAAOsE,EAAO/iB,EACV0Y,EAAMuO,OAASxI,EAAM,CAEvB,GADAA,EAAO/F,EAAMuO,OAASxI,EAClBA,EAAO/F,EAAMuK,OACXvK,EAAMwL,KAAM,CACdrR,EAAK+E,IAAM,gCACXc,EAAMuL,KAAOyC,GACb,KACF,CAiBEjI,EAAO/F,EAAMwK,OACfzE,GAAQ/F,EAAMwK,MACd/kB,EAAOua,EAAMV,MAAQyG,GAGrBtgB,EAAOua,EAAMwK,MAAQzE,EAEnBA,EAAO/F,EAAMthB,SAAUqnB,EAAO/F,EAAMthB,QACxCusB,EAAcjL,EAAMjkB,MACtB,MAEEkvB,EAAc/K,EACdza,EAAOoqB,EAAM7P,EAAMuO,OACnBxI,EAAO/F,EAAMthB,OAEXqnB,EAAOze,IAAQye,EAAOze,GAC1BA,GAAQye,EACR/F,EAAMthB,QAAUqnB,EAChB,GACE7F,EAAO2P,KAAS5E,EAAYxlB,aACnBsgB,GACU,IAAjB/F,EAAMthB,SAAgBshB,EAAMuL,KAAOuC,IACvC,MACF,KA5wCiB,MA6wCf,GAAa,IAATxmB,EAAc,MAAM6oB,EACxBjQ,EAAO2P,KAAS7P,EAAMthB,OACtB4I,IACA0Y,EAAMuL,KAAOuC,GACb,MACF,KAAKC,GACH,GAAI/N,EAAMgB,KAAM,CAEd,KAAOnL,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IAEA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAaA,GAXAwU,GAAQ/iB,EACR6S,EAAKkG,WAAagK,EAClBrK,EAAMzR,OAAS8b,EACG,EAAbrK,EAAMgB,MAAaqJ,IACtBlQ,EAAKkB,MAAQ2E,EAAMqO,MAEdrO,EAAMoO,MAAQvS,GAAQmE,EAAMqO,MAAOnO,EAAQmK,EAAMwF,EAAMxF,GAAQjP,GAAU4E,EAAMqO,MAAOnO,EAAQmK,EAAMwF,EAAMxF,IAGjHA,EAAO/iB,EAEW,EAAb0Y,EAAMgB,OAAchB,EAAMoO,MAAQ1D,EAAOuD,GAAQvD,MAAW1K,EAAMqO,MAAO,CAC5ElU,EAAK+E,IAAM,uBACXc,EAAMuL,KAAOyC,GACb,KACF,CAEAtD,EAAO,EACP7U,EAAO,CAGT,CACAmK,EAAMuL,KAjzCI,MAmzCZ,KAnzCY,MAozCV,GAAIvL,EAAMgB,MAAQhB,EAAMoO,MAAO,CAE7B,KAAOvY,EAAO,IAAI,CAChB,GAAa,IAATgN,EAAc,MAAMsN,EACxBtN,IACA6H,GAAQ5Z,EAAM6V,MAAW9Q,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAbmK,EAAMgB,MAAa0J,KAAwB,WAAd1K,EAAMzR,OAAqB,CAC3D4L,EAAK+E,IAAM,yBACXc,EAAMuL,KAAOyC,GACb,KACF,CAEAtD,EAAO,EACP7U,EAAO,CAGT,CACAmK,EAAMuL,KAv0CE,MAy0CV,KAz0CU,MA00CRvG,EAAMmI,GACN,MAAMgD,EACR,KAAKnC,GACHhJ,EAAMsI,GACN,MAAM6C,EACR,KA70CS,MA80CP,OAAO5C,GAGT,QACE,OAAOF,GAyCb,OA3BAlT,EAAKiG,SAAWyP,EAChB1V,EAAK8F,UAAY3Y,EACjB6S,EAAK4G,QAAU4F,EACfxM,EAAK2G,SAAW+B,EAChB7C,EAAM0K,KAAOA,EACb1K,EAAMnK,KAAOA,GAGTmK,EAAMV,OAAU+K,IAASlQ,EAAK8F,WAAaD,EAAMuL,KAAOyC,KACvChO,EAAMuL,KAAOwC,IAASnL,IAAUqK,MAC/CwC,GAAatV,EAAMA,EAAK+F,OAAQ/F,EAAKiG,SAAUiK,EAAOlQ,EAAK8F,WAEjEmK,GAAOjQ,EAAK2G,SACZuJ,GAAQlQ,EAAK8F,UACb9F,EAAK8G,UAAYmJ,EACjBjQ,EAAKkG,WAAagK,EAClBrK,EAAMzR,OAAS8b,EACG,EAAbrK,EAAMgB,MAAaqJ,IACtBlQ,EAAKkB,MAAQ2E,EAAMqO,MAChBrO,EAAMoO,MAAQvS,GAAQmE,EAAMqO,MAAOnO,EAAQmK,EAAMlQ,EAAKiG,SAAWiK,GAAQjP,GAAU4E,EAAMqO,MAAOnO,EAAQmK,EAAMlQ,EAAKiG,SAAWiK,IAEnIlQ,EAAKC,UAAY4F,EAAMnK,MAAQmK,EAAM5G,KAAO,GAAK,IAC9B4G,EAAMuL,OAASmC,GAAO,IAAM,IAC5B1N,EAAMuL,OAASsC,IAAQ7N,EAAMuL,OAASqC,GAAQ,IAAM,IACzD,IAARxD,GAAsB,IAATC,GAAezH,IAAUqK,KAAejI,IAAQkI,KACjElI,EAAM/H,IAED+H,GAoGRuL,WAhGmBpW,IAElB,GAAI4U,GAAkB5U,GACpB,OAAOkT,GAGT,IAAIrN,EAAQ7F,EAAK6F,MAKjB,OAJIA,EAAMjkB,SACRikB,EAAMjkB,OAAS,MAEjBoe,EAAK6F,MAAQ,KACNkN,IAsFRsD,iBAlFwB,CAACrW,EAAMsF,KAG9B,GAAIsP,GAAkB5U,GAAS,OAAOkT,GACtC,MAAMrN,EAAQ7F,EAAK6F,MACnB,OAAkB,EAAbA,EAAMgB,MAGXhB,EAAMP,KAAOA,EACbA,EAAK2Q,MAAO,EACLlD,IAL8BG,IA8EtCoD,qBArE4B,CAACtW,EAAMoM,KAClC,MAAMC,EAAaD,EAAW7nB,OAE9B,IAAIshB,EACA0Q,EACA1L,EAGJ,OAAI+J,GAAkB5U,GAAgBkT,IACtCrN,EAAQ7F,EAAK6F,MAEM,IAAfA,EAAMgB,MAAchB,EAAMuL,OAASkC,GAC9BJ,GAILrN,EAAMuL,OAASkC,KACjBiD,EAAS,EAETA,EAAStV,GAAUsV,EAAQnK,EAAYC,EAAY,GAC/CkK,IAAW1Q,EAAMqO,OACZf,IAKXtI,EAAMyK,GAAatV,EAAMoM,EAAYC,EAAYA,GAC7CxB,GACFhF,EAAMuL,KAx7CK,MAy7CJgC,KAETvN,EAAMmO,SAAW,EAEVjB,OAqCRyD,YAxBiB,sCAkFlB,IAAIC,GApCJ,WAEEn3B,KAAKyF,KAAa,EAElBzF,KAAK2J,KAAa,EAElB3J,KAAK42B,OAAa,EAElB52B,KAAKosB,GAAa,EAElBpsB,KAAK+d,MAAa,KAElB/d,KAAK62B,UAAa,EAWlB72B,KAAKmG,KAAa,GAIlBnG,KAAKmsB,QAAa,GAIlBnsB,KAAKksB,KAAa,EAElBlsB,KAAK22B,MAAa,CACpB,EAIA,MAAMx0B,GAAWyB,OAAOC,UAAU1B,UAK5BugB,WACJA,GAAAI,SAAYA,GAAAG,KACZA,GAAAC,aAAMA,GAAAC,YAAcA,GAAAE,eAAaA,GAAAC,aAAgBA,GAAAC,YAAcA,IAC7Dd,GAkFJ,SAAS2U,GAAUnsB,GACjBjL,KAAKiL,QAAUoiB,GAAc,CAC3BoC,UAAW,MACXhE,WAAY,GACZ4L,GAAI,IACHpsB,GAAW,CAAA,GAEd,MAAMykB,EAAM1vB,KAAKiL,QAIbykB,EAAIC,KAAQD,EAAIjE,YAAc,GAAOiE,EAAIjE,WAAa,KACxDiE,EAAIjE,YAAciE,EAAIjE,WACC,IAAnBiE,EAAIjE,aAAoBiE,EAAIjE,YAAa,OAI1CiE,EAAIjE,YAAc,GAAOiE,EAAIjE,WAAa,KACzCxgB,GAAWA,EAAQwgB,aACvBiE,EAAIjE,YAAc,IAKfiE,EAAIjE,WAAa,IAAQiE,EAAIjE,WAAa,KAGvB,GAAjBiE,EAAIjE,aACPiE,EAAIjE,YAAc,KAItBzrB,KAAKulB,IAAS,EACdvlB,KAAKylB,IAAS,GACdzlB,KAAK6vB,OAAS,EACd7vB,KAAK4tB,OAAS,GAEd5tB,KAAK0gB,KAAS,IAAIuO,GAClBjvB,KAAK0gB,KAAK8F,UAAY,EAEtB,IAAIkE,EAAUuL,GAAYN,aACxB31B,KAAK0gB,KACLgP,EAAIjE,YAGN,GAAIf,IAAWzH,GACb,MAAM,IAAIvR,MAAM8Q,GAASkI,IAQ3B,GALA1qB,KAAKgsB,OAAS,IAAImL,GAElBlB,GAAYc,iBAAiB/2B,KAAK0gB,KAAM1gB,KAAKgsB,QAGzC0D,EAAI5C,aAEwB,iBAAnB4C,EAAI5C,WACb4C,EAAI5C,WAAasB,GAAmBsB,EAAI5C,YACG,yBAAlC3qB,GAAS4B,KAAK2rB,EAAI5C,cAC3B4C,EAAI5C,WAAa,IAAItT,WAAWkW,EAAI5C,aAElC4C,EAAIC,MACNjF,EAASuL,GAAYe,qBAAqBh3B,KAAK0gB,KAAMgP,EAAI5C,YACrDpC,IAAWzH,KACb,MAAM,IAAIvR,MAAM8Q,GAASkI,GAIjC,CAiNA,SAAS4M,GAAUjgB,EAAOpM,GACxB,MAAMssB,EAAW,IAAIH,GAAUnsB,GAK/B,GAHAssB,EAASx2B,KAAKsW,GAGVkgB,EAAShS,IAAK,MAAMgS,EAAS9R,KAAOjD,GAAS+U,EAAShS,KAE1D,OAAOgS,EAAS7vB,MAClB,CA/LA0vB,GAAUvzB,UAAU9C,KAAO,SAAUolB,EAAM+J,GACzC,MAAMxP,EAAO1gB,KAAK0gB,KACZ+O,EAAYzvB,KAAKiL,QAAQwkB,UACzB3C,EAAa9sB,KAAKiL,QAAQ6hB,WAChC,IAAIpC,EAAQyF,EAAaqH,EAEzB,GAAIx3B,KAAK6vB,MAAO,OAAO,EAevB,IAbiCM,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBpN,GAAWJ,GAGxB,yBAAxBvgB,GAAS4B,KAAKoiB,GAChBzF,EAAKrJ,MAAQ,IAAImC,WAAW2M,GAE5BzF,EAAKrJ,MAAQ8O,EAGfzF,EAAK4G,QAAU,EACf5G,EAAK2G,SAAW3G,EAAKrJ,MAAMpS,SAElB,CAqBP,IApBuB,IAAnByb,EAAK8F,YACP9F,EAAK+F,OAAS,IAAIjN,WAAWiW,GAC7B/O,EAAKiG,SAAW,EAChBjG,EAAK8F,UAAYiJ,GAGnB/E,EAASuL,GAAYE,QAAQzV,EAAMyP,GAE/BzF,IAAWvH,IAAe2J,IAC5BpC,EAASuL,GAAYe,qBAAqBtW,EAAMoM,GAE5CpC,IAAWzH,GACbyH,EAASuL,GAAYE,QAAQzV,EAAMyP,GAC1BzF,IAAWpH,KAEpBoH,EAASvH,KAKNzC,EAAK2G,SAAW,GAChBqD,IAAWxH,IACXxC,EAAK6F,MAAMgB,KAAO,GACK,IAAvBpB,EAAKzF,EAAK4G,UAEf2O,GAAYR,aAAa/U,GACzBgK,EAASuL,GAAYE,QAAQzV,EAAMyP,GAGrC,OAAQzF,GACN,KAAKrH,GACL,KAAKC,GACL,KAAKH,GACL,KAAKI,GAGH,OAFAvjB,KAAKqwB,MAAM3F,GACX1qB,KAAK6vB,OAAQ,GACN,EAOX,GAFA2H,EAAiB9W,EAAK8F,UAElB9F,EAAKiG,WACgB,IAAnBjG,EAAK8F,WAAmBkE,IAAWxH,IAErC,GAAwB,WAApBljB,KAAKiL,QAAQosB,GAAiB,CAEhC,IAAII,EAAgBrJ,GAAmB1N,EAAK+F,OAAQ/F,EAAKiG,UAErD+Q,EAAOhX,EAAKiG,SAAW8Q,EACvBE,EAAUvJ,GAAmB1N,EAAK+F,OAAQgR,GAG9C/W,EAAKiG,SAAW+Q,EAChBhX,EAAK8F,UAAYiJ,EAAYiI,EACzBA,GAAMhX,EAAK+F,OAAOrmB,IAAIsgB,EAAK+F,OAAO7G,SAAS6X,EAAeA,EAAgBC,GAAO,GAErF13B,KAAKowB,OAAOuH,EAEd,MACE33B,KAAKowB,OAAO1P,EAAK+F,OAAOxhB,SAAWyb,EAAKiG,SAAWjG,EAAK+F,OAAS/F,EAAK+F,OAAO7G,SAAS,EAAGc,EAAKiG,WAMpG,GAAI+D,IAAWzH,IAA2B,IAAnBuU,EAAvB,CAGA,GAAI9M,IAAWxH,GAIb,OAHAwH,EAASuL,GAAYa,WAAW92B,KAAK0gB,MACrC1gB,KAAKqwB,MAAM3F,GACX1qB,KAAK6vB,OAAQ,GACN,EAGT,GAAsB,IAAlBnP,EAAK2G,SAAgB,KAVoB,CAW/C,CAEA,OAAO,CACT,EAWA+P,GAAUvzB,UAAUusB,OAAS,SAAUtC,GACrC9tB,KAAK4tB,OAAO7sB,KAAK+sB,EACnB,EAYAsJ,GAAUvzB,UAAUwsB,MAAQ,SAAU3F,GAEhCA,IAAWzH,KACW,WAApBjjB,KAAKiL,QAAQosB,GACfr3B,KAAK0H,OAAS1H,KAAK4tB,OAAO1oB,KAAK,IAE/BlF,KAAK0H,OAAS2lB,GAAqBrtB,KAAK4tB,SAG5C5tB,KAAK4tB,OAAS,GACd5tB,KAAKulB,IAAMmF,EACX1qB,KAAKylB,IAAMzlB,KAAK0gB,KAAK+E,GACvB,EA+EA,IAMImS,GAAc,CACjBC,QAPiBT,GAQjBjB,QAPemB,GAQfQ,WA1BD,SAAsBzgB,EAAOpM,GAG3B,OAFAA,EAAUA,GAAW,CAAA,GACb0kB,KAAM,EACP2H,GAAUjgB,EAAOpM,EAC1B,EAuBC8sB,OAPcT,IAWf,MAAM/G,QAAEA,GAAAzE,QAASA,GAAA0E,WAASA,GAAAZ,KAAYA,IAASU,IAEzCuH,QAAEA,GAAA1B,QAASA,GAAA2B,WAASA,GAAAC,OAAYA,IAAWH,GAIjD,IAUII,GAAO,CACVzH,QAXeA,GAYfzE,QAXeA,GAYf0E,WAXkBA,GAYlBZ,KAXYA,GAYZiI,QAXeA,GAYf1B,QAXeA,GAYf2B,WAXkBA,GAYlBC,OAXcA,GAYdE,UAXiBxV,ICzsNlB,MAAMyV,GAIJ,QAAAC,CAAShS,GACP,IAEE,MAAMiS,EAAaJ,GAAKlM,QAAQ3F,GAGhC,GAAoB,oBAATkS,KAAsB,CAE/B,IAAIC,EAAe,GACnB,IAAA,IAAS1f,EAAI,EAAGA,EAAIwf,EAAWnzB,OAAQ2T,IACrC0f,GAAgB/lB,OAAOyb,aAAaoK,EAAWxf,IAEjD,OAAOyf,KAAKC,EACd,CAAA,MAA6B,oBAAXC,OAETA,OAAOvsB,KAAKosB,GAAYj2B,SAAS,UAEnCgkB,CACT,OAAS1kB,GAEP,OADAC,QAAQD,MAAM,sCAAuCA,GAC9C0kB,CACT,CACF,CAKA,UAAAqS,CAAWC,GACT,IAEE,IAAIC,EACJ,GAAoB,oBAATC,KAAsB,CAE/B,MAAML,EAAeK,KAAKF,GAC1BC,EAAa,IAAIlf,WAAW8e,EAAarzB,QACzC,IAAA,IAAS2T,EAAI,EAAGA,EAAI0f,EAAarzB,OAAQ2T,IACvC8f,EAAW9f,GAAK0f,EAAazf,WAAWD,EAE5C,KAAA,IAA6B,oBAAX2f,OAKhB,OAAOE,EALiC,CAExC,MAAMG,EAASL,OAAOvsB,KAAKysB,EAAgB,UAC3CC,EAAa,IAAIlf,WAAWof,EAC9B,CAEA,CAIA,OADqBZ,GAAK7B,QAAQuC,EAAY,CAAErB,GAAI,UAEtD,OAAS51B,GAEP,OADAC,QAAQD,MAAM,wCAAyCA,GAChDg3B,CACT,CACF,CAKA,cAAAI,CAAe1S,GACb,OAAOA,EAAKlhB,OAAS,IACvB,ECjDF,MAAM6zB,GAKJ,WAAAj5B,GAJQE,EAAAC,KAAA,WACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,cAGNA,KAAK+4B,QAAU,IAAIliB,EACnB7W,KAAKg5B,aAAe,IAAI/hB,EACxBjX,KAAKi5B,WAAa,IAAIf,EACxB,CAKA,OAAAgB,CAAQv4B,EAAqBsK,EAA0B,IACrD,MAAM5L,WACJA,EAAa,EAAA85B,oBACbA,GAAsB,EAAAC,kBACtBA,GAAoB,EAAApiB,WACpBA,GAAa,GACX/L,EAGJ,IAAKjL,KAAK+4B,QAAQhiB,qBAAqBC,EAAY3X,GACjD,OAAO,KAIT,GAAI85B,GAAuBn5B,KAAKg5B,aAAazhB,YAAY5W,GACvD,OAAO,KAIT,MAAM04B,EAAiBh2B,EAAU1C,GAGjC,GAAIy4B,GAAqBC,EAAetmB,WAAY,CAClD,MAAMumB,EAAgB3nB,KAAKC,UAAUynB,EAAetmB,YAChD/S,KAAKi5B,WAAWJ,eAAeS,KAEhCD,EAAoEE,qBAAuBv5B,KAAKi5B,WAAWd,SAASmB,UAC9GD,EAAetmB,WAE1B,CAEA,OAAOsmB,CACT,CAKA,YAAAG,CAAa34B,EAAwBoK,EAA0B,IAC7D,OAAOpK,EACJ4C,IAAI9C,GAASX,KAAKk5B,QAAQv4B,EAAOsK,IACjClG,OAAQpE,GAA2C,OAAVA,EAC9C,CAKA,SAAA84B,CAAU94B,GACR,IACE,OAAOgR,KAAKC,UAAUjR,EACxB,OAASc,GAEP,OADAC,QAAQD,MAAM,0CAA2CA,GAClD,EACT,CACF,CAKA,WAAAi4B,CAAYvT,GACV,IACE,OAAOxU,KAAKgoB,MAAMxT,EACpB,OAAS1kB,GAEP,OADAC,QAAQD,MAAM,4CAA6CA,GACpD,IACT,CACF,EC5FF,SAASm4B,KACP,GAA+B,oBAApBC,gBACT,OAAOA,gBAIT,MAAMC,EAAN,WAAAj6B,GACEE,EAAAC,KAAA,WAAmB,EAAA,CAEnB,KAAA+5B,GACE/5B,KAAKg6B,SAAU,CACjB,EAeF,OAZA,MAGE,WAAAn6B,GAFAE,EAAAC,KAAA,UAGEA,KAAKi6B,OAAS,IAAIH,CACpB,CAEA,KAAAC,GACE/5B,KAAKi6B,OAAOF,OACd,EAIJ,CAUAG,eAAeC,GAAc9zB,EAAaR,GACxC,OAAO,IAAIu0B,QAAQ,CAACC,EAASC,KAC3B,MAAMC,EAAM,IAAIC,eACVniB,SAASxS,WAAMwS,SAAU,MAK/B,GAHAkiB,EAAIE,KAAKpiB,EAAQhS,GAAK,SAGlBR,WAAM60B,QAAS,CACD,IAAIC,QAAQ90B,EAAK60B,SACzBl5B,QAAQ,CAACnB,EAAOH,KACT,MAATG,GACFk6B,EAAIK,iBAAiB16B,EAAKqS,OAAOlS,KAGvC,CAGA,SAAIwF,WAAMo0B,OAAQ,CAEhB,GADep0B,EAAKo0B,OACTD,QAET,YADAM,EAAO,IAAIO,aAAa,UAAW,cAGvC,CAGAN,EAAIO,OAAS,KACX,MAAMC,EAAgBR,EAAIS,wBACpBN,EAAkC,CAAA,EAExCK,EAAcj2B,MAAM,MAAMtD,QAAQy5B,IAChC,MAAM3oB,EAAQ2oB,EAAKn2B,MAAM,MACrBwN,EAAM,IAAMA,EAAM,KACpBooB,EAAQpoB,EAAM,GAAG9N,eAAiB8N,EAAM,MAI5C,MAAM4oB,EAAkB,IAAIP,QAAQD,GAC9BS,EAAeZ,EAAIY,cAAgB,GACnCC,EAAcb,EAAIc,aAAeh1B,EACjCi1B,EAAiBf,EAAI7P,OAIrBnW,EAA8B,CAClCgnB,GAHiBD,GAAkB,KAAOA,EAAiB,IAI3D5Q,OAAQ4Q,EACRE,WANyBjB,EAAIiB,WAO7Bt1B,KAAM,QACNG,IAAK+0B,EACLV,QAASQ,EACTO,YAAY,EACZC,KAAM,KACNC,UAAU,EACVC,YAAa,IAAMxB,QAAQC,QAAQ,IAAIwB,YAAY,IACnDC,KAAM,IAAM1B,QAAQC,QAAQ,IAAI0B,MAChCC,SAAU,IAAM5B,QAAQC,QAAQ,IAAI4B,UACpCC,KAAMhC,UACJ,IACE,OAAOvoB,KAAKgoB,MAAMwB,GAAgB,KACpC,CAAA,MACE,MAAM,IAAIxN,UAAU,wBACtB,GAEFloB,KAAM,IAAM20B,QAAQC,QAAQc,GAC5BgB,MAAO,KAEE,IACF5nB,EACHmmB,QAAS,IAAIC,QAAQD,MAK3BL,EAAQ9lB,IAGVgmB,EAAI6B,QAAU,KACZ9B,EAAO,IAAI3M,UAAU,4BAGvB4M,EAAI8B,UAAY,KACd/B,EAAO,IAAI5oB,MAAM,qBAGnB,MAAMgqB,EAAO,MAAA71B,OAAA,EAAAA,EAAM61B,KACfA,aAAgBO,UAAYP,aAAgBK,MAAwB,iBAATL,GAA8B,OAATA,EAClFnB,EAAI+B,KAAKZ,GACAA,EACTnB,EAAI+B,KAAK/pB,OAAOmpB,IAEhBnB,EAAI+B,KAAK,OAGf,CAgDApC,eAAeqC,GAAel2B,EAAa4E,EAA0B,IACnE,MAAMoN,OAAEA,EAAS,OAAAqiB,QAAQA,EAAU,CAAA,EAAAgB,KAAIA,EAAA34B,QAAMA,EAAU,KAAUkI,EAG3DuxB,EAAa,IADU5C,MAEvB6C,EAAYx5B,WAAW,IAAMu5B,EAAWzC,QAASh3B,GAEvD,IACE,MAAM25B,EAnDV,WACE,GAAqB,mBAAVC,MAET,IAEE,OADA,IAAK/C,MACE+C,KACT,CAAA,MAEE,OAAOxC,EACT,CAIF,GAA8B,oBAAnBK,eACT,OAAOL,GAGT,MAAM,IAAIzoB,MAAM,sEAClB,CAiCoBkrB,GACVroB,QAAiBmoB,EAAQr2B,EAAK,CAClCgS,SACAqiB,QAAS,CACP,eAAgB,sBACbA,GAELgB,OACAzB,OAAQuC,EAAWvC,SAKrB,IAAI9T,EAFJnjB,aAAay5B,GAGb,MAAMI,EAActoB,EAASmmB,QAAQz6B,IAAI,gBAOzC,OALEkmB,EADE0W,GAAeA,EAAY3wB,SAAS,0BACzBqI,EAAS2nB,aAET3nB,EAAS9O,OAGjB,CACL81B,GAAIhnB,EAASgnB,GACb7Q,OAAQnW,EAASmW,OACjB8Q,WAAYjnB,EAASinB,WACrBrV,OAEJ,OAAS1kB,GAEP,MADAuB,aAAay5B,GACPh7B,CACR,CACF,CAoEAy4B,eAAsBxkB,GAAQrP,EAAa4E,EAA0B,UAEnE,MAAuB,oBAAZiuB,UAA2B,OAAAxzB,EAAAwzB,QAAQ4D,mBAAUze,MAjE1D6b,eAA2B7zB,EAAa4E,EAA0B,UAChE,MAAMoN,OAAEA,EAAS,OAAAqiB,QAAQA,EAAU,CAAA,EAAAgB,KAAIA,EAAA34B,QAAMA,EAAU,KAAUkI,EAEjE,IAGE,IAAI8xB,EACJ,IAEE,MAAMC,QAAkBC,OAAO,cAC/BF,EAAeC,EAAUE,SAAWF,CACtC,OAAShqB,GAEP,GAAuB,oBAAZkmB,UAA2B,OAAAxzB,EAAAwzB,QAAQ4D,mBAAUze,MACtD,MAAM,IAAI3M,MAAM,yFAGlB,MAAM,IAAIA,MAAM,mDAClB,CAEA,MACM8qB,EAAa,IADU5C,MAEvB6C,EAAYx5B,WAAW,IAAMu5B,EAAWzC,QAASh3B,GAEvD,IACE,MAAMwR,QAAiBwoB,EAAY12B,EAAK,CACtCgS,SACAqiB,QAAS,CACP,eAAgB,sBACbA,GAELgB,OACAzB,OAAQuC,EAAWvC,SAKvB,IAAI9T,EAFFnjB,aAAay5B,GAGf,MAAMI,EAActoB,EAASmmB,QAAQz6B,IAAI,gBAOzC,OALEkmB,EADE0W,GAAeA,EAAY3wB,SAAS,0BACzBqI,EAAS2nB,aAET3nB,EAAS9O,OAGjB,CACL81B,GAAIhnB,EAASgnB,GACb7Q,OAAQnW,EAASmW,OACjB8Q,WAAYjnB,EAASinB,WACrBrV,OAEF,OAAS1kB,GAEP,MADAuB,aAAay5B,GACPh7B,CACR,CACF,OAASA,GACP,MAAMA,CACR,CACF,CAQW07B,CAAY92B,EAAK4E,GAIjBsxB,GAAel2B,EAAK4E,EAI/B,CAYO,SAASmyB,GAAK/2B,EAAa8f,EAAelb,EAAmD,CAAA,GAElG,OAAOyK,GAAQrP,EAAK,IAAK4E,EAASoN,OAAQ,OAAQqjB,KADrB,iBAATvV,EAAoBA,EAAOxU,KAAKC,UAAUuU,IAEhE,CCjTA,MAAMkX,GAIJ,aAAMC,CACJC,EACAtyB,EAAwB,IAExB,MAAMzL,WACJA,EAAa,EAAAg+B,aACbA,EAAe,IAAAC,SACfA,EAAW,IAAAC,YACXA,EAAc,KAAM,GAClBzyB,EAEJ,IAAI0yB,EACAC,EAAQJ,EAEZ,IAAA,IAASK,EAAU,EAAGA,GAAWr+B,EAAYq+B,IAC3C,IACE,aAAaN,GACf,OAAS97B,GAIP,GAHAk8B,EAAYl8B,IAGRo8B,EAAUr+B,GAAck+B,EAAYj8B,IAKtC,YAHMzB,KAAK89B,MAAMF,GACjBA,EAAQ37B,KAAKuL,IAAY,EAARowB,EAAWH,EAIhC,CAGF,MAAME,CACR,CAKQ,KAAAG,CAAMC,GACZ,OAAO,IAAI3D,QAAQC,GAAWp3B,WAAWo3B,EAAS0D,GACpD,CAKA,gBAAAC,CAAiBv8B,GAEf,GAAIA,aAAiBiQ,MAAO,CAC1B,MAAMN,EAAU3P,EAAM2P,QAAQ5M,cAC9B,OACE4M,EAAQlF,SAAS,YACjBkF,EAAQlF,SAAS,YACjBkF,EAAQlF,SAAS,UACjBkF,EAAQlF,SAAS,aAErB,CAGA,OAAO,CACT,EC/DF,MAAM+xB,GAIJ,WAAAp+B,CAAYf,GAHJiB,EAAAC,KAAA,aACAD,EAAAC,KAAA,gBAGNA,KAAKlB,UAAYA,EACjBkB,KAAKk+B,aAAe,IAAIb,EAC1B,CAKA,UAAMf,CAAK37B,EAAqBsK,EAAuB,IAErD,IAAKjL,KAAKlB,WAAgC,gBAAnBkB,KAAKlB,UAC1B,OAAO,EAGT,MAAMq/B,YAAEA,GAAc,EAAA3+B,WAAMA,EAAa,GAAMyL,EAE/C,IACE,GAAIkzB,QACIn+B,KAAKk+B,aAAaZ,QACtBpD,UACE,MAAM3lB,QAAiB6oB,GAAKp9B,KAAKlB,UAAW6B,GAC5C,IAAK4T,EAASgnB,GACZ,MAAM,IAAI7pB,MAAM,QAAQ6C,EAASmW,WAAWnW,EAASinB,cAEvD,OAAOjnB,GAET,CACE/U,aACAk+B,YAAaj8B,GAASzB,KAAKk+B,aAAaF,iBAAiBv8B,SAGxD,CACL,MAAM8S,QAAiB6oB,GAAKp9B,KAAKlB,UAAW6B,GAC5C,IAAK4T,EAASgnB,GACZ,MAAM,IAAI7pB,MAAM,QAAQ6C,EAASmW,WAAWnW,EAASinB,aAEzD,CAEA,OAAO,CACT,OAAS/5B,GAEP,OADAC,QAAQD,MAAM,+BAAgCA,IACvC,CACT,CACF,CAKA,eAAM28B,CAAUv9B,EAAwBoK,EAAuB,IAC7D,GAAsB,IAAlBpK,EAAOoE,OACT,OAAO,EAIT,IAAKjF,KAAKlB,WAAgC,gBAAnBkB,KAAKlB,UAC1B,OAAO,EAGT,MAAMq/B,YAAEA,GAAc,EAAA3+B,WAAMA,EAAa,GAAMyL,EAE/C,IACE,GAAIkzB,QACIn+B,KAAKk+B,aAAaZ,QACtBpD,UACE,MAAM3lB,QAAiB6oB,GAAKp9B,KAAKlB,UAAW,CAAE+B,WAC9C,IAAK0T,EAASgnB,GACZ,MAAM,IAAI7pB,MAAM,QAAQ6C,EAASmW,WAAWnW,EAASinB,cAEvD,OAAOjnB,GAET,CACE/U,aACAk+B,YAAaj8B,GAASzB,KAAKk+B,aAAaF,iBAAiBv8B,SAGxD,CACL,MAAM8S,QAAiB6oB,GAAKp9B,KAAKlB,UAAW,CAAE+B,WAC9C,IAAK0T,EAASgnB,GACZ,MAAM,IAAI7pB,MAAM,QAAQ6C,EAASmW,WAAWnW,EAASinB,aAEzD,CAEA,OAAO,CACT,OAAS/5B,GAEP,OADAC,QAAQD,MAAM,sCAAuCA,IAC9C,CACT,CACF,CAKA,YAAA48B,CAAah4B,GACXrG,KAAKlB,UAAYuH,CACnB,ECgSK,MAAMi4B,GAAe,IA/X5B,MAGE,WAAAz+B,GACE,GAHME,EAAAC,KAAA,UAA0B,MAGV,oBAAXsC,QAA0BA,OAAOg8B,aAC1C,IACE,MAAMC,EAAO,mBACbj8B,OAAOg8B,aAAaE,QAAQD,EAAMA,GAClCj8B,OAAOg8B,aAAaG,WAAWF,GAC/Bv+B,KAAK0+B,QAAUp8B,OAAOg8B,YACxB,OAAStrB,GAET,CAEJ,CAEA,OAAA2rB,CAAQz+B,GACN,IAAKF,KAAK0+B,QACR,OAAO,KAET,IACE,OAAO1+B,KAAK0+B,QAAQC,QAAQz+B,EAC9B,OAAS8S,GACP,OAAO,IACT,CACF,CAEA,OAAAwrB,CAAQt+B,EAAaG,GACnB,GAAKL,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQF,QAAQt+B,EAAKG,EAC5B,OAAS2S,GAET,CACF,CAEA,UAAAyrB,CAAWv+B,GACT,GAAKF,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQD,WAAWv+B,EAC1B,OAAS8S,GAET,CACF,CAEA,KAAAnR,GACE,GAAK7B,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQ78B,OACf,OAASmR,GAET,CACF,GAsUW4rB,GAAiB,IAhU9B,MAGE,WAAA/+B,GACE,GAHME,EAAAC,KAAA,UAA0B,MAGV,oBAAXsC,QAA0BA,OAAOs8B,eAC1C,IACE,MAAML,EAAO,mBACbj8B,OAAOs8B,eAAeJ,QAAQD,EAAMA,GACpCj8B,OAAOs8B,eAAeH,WAAWF,GACjCv+B,KAAK0+B,QAAUp8B,OAAOs8B,cACxB,OAAS5rB,GAET,CAEJ,CAEA,OAAA2rB,CAAQz+B,GACN,IAAKF,KAAK0+B,QACR,OAAO,KAET,IACE,OAAO1+B,KAAK0+B,QAAQC,QAAQz+B,EAC9B,OAAS8S,GACP,OAAO,IACT,CACF,CAEA,OAAAwrB,CAAQt+B,EAAaG,GACnB,GAAKL,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQF,QAAQt+B,EAAKG,EAC5B,OAAS2S,GAET,CACF,CAEA,UAAAyrB,CAAWv+B,GACT,GAAKF,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQD,WAAWv+B,EAC1B,OAAS8S,GAET,CACF,CAEA,KAAAnR,GACE,GAAK7B,KAAK0+B,QAGV,IACE1+B,KAAK0+B,QAAQ78B,OACf,OAASmR,GAET,CACF,GAuQW6rB,GAAgB,IAjQ7B,MAAA,WAAAh/B,GACUE,EAAAC,KAAA,WAAgCS,IAAA,CAExC,OAAAk+B,CAAQz+B,GACN,OAAOF,KAAKmmB,KAAKlmB,IAAIC,IAAQ,IAC/B,CAEA,OAAAs+B,CAAQt+B,EAAaG,GACnBL,KAAKmmB,KAAK/lB,IAAIF,EAAKG,EACrB,CAEA,UAAAo+B,CAAWv+B,GACTF,KAAKmmB,KAAKllB,OAAOf,EACnB,CAEA,KAAA2B,GACE7B,KAAKmmB,KAAKtkB,OACZ,GAiPWi9B,GAAmB,IA3OhC,MAAA,WAAAj/B,GACUE,EAAAC,KAAA,SAAS,kBACTD,EAAAC,KAAA,YAAY,qBACZD,EAAAC,KAAA,KAAyB,MACzBD,EAAAC,KAAA,cAAuC,KAAA,CAE/C,UAAM6F,GAEJ,QAAI7F,KAAK++B,KAKL/+B,KAAKg/B,YACAh/B,KAAKg/B,cAGQ,oBAAX18B,SAA2BA,OAAO28B,aAK7Cj/B,KAAKg/B,YAAc,IAAI5E,QAASC,IAC9B,MAAM3kB,EAAUupB,UAAUxE,KAAKz6B,KAAKk/B,OAAQ,GAE5CxpB,EAAQ0mB,QAAU,KAChBp8B,KAAKg/B,YAAc,KACnB3E,GAAQ,IAGV3kB,EAAQypB,UAAY,KAClBn/B,KAAK++B,GAAKrpB,EAAQhO,OAClB1H,KAAKg/B,YAAc,KACnB3E,GAAQ,IAGV3kB,EAAQ0pB,gBAAmBz+B,IACzB,MAAMo+B,EAAMp+B,EAAM0J,OAA4B3C,OAC9C,IAAKq3B,EAAGM,iBAAiBC,SAASt/B,KAAKu/B,WAAY,CACnCR,EAAGS,kBAAkBx/B,KAAKu/B,UAAW,CAAEE,QAAS,KAAMC,eAAe,IAC7EC,YAAY,MAAO,MAAO,CAAEC,QAAQ,GAC5C,KAIG5/B,KAAKg/B,aACd,CAEA,aAAML,CAAQz+B,GAIZ,OAHKF,KAAK++B,UACF/+B,KAAK6F,OAER7F,KAAK++B,GAIH,IAAI3E,QAASC,IAClB,IAAIwF,EACJ,IACEA,EAAc7/B,KAAK++B,GAAIc,YAAY,CAAC7/B,KAAKu/B,WAAY,WACvD,OAAS99B,GAGP,OAFAC,QAAQD,MAAM,wDAAyDA,QACvE44B,EAAQ,KAEV,CAGAwF,EAAYzD,QAAU,KACpB16B,QAAQD,MAAM,8CAA+Co+B,EAAYp+B,OACzE44B,EAAQ,OAGVwF,EAAYC,QAAU,KACpBp+B,QAAQD,MAAM,gDACd44B,EAAQ,OAGV,MAEM3kB,EAFQmqB,EAAYE,YAAY//B,KAAKu/B,WACvBp+B,MAAM,OACJlB,IAAIC,GAE1BwV,EAAQypB,UAAY,KAClB,MAAMz3B,EAASgO,EAAQhO,OACvB2yB,EAAQ3yB,EAASA,EAAOrH,MAAQ,OAGlCqV,EAAQ0mB,QAAU,KAChB16B,QAAQD,MAAM,0CAA2CiU,EAAQjU,OACjE44B,EAAQ,SAnCH,IAsCX,CAEA,aAAMmE,CAAQt+B,EAAaG,GAIzB,OAHKL,KAAK++B,UACF/+B,KAAK6F,SAER7F,KAAK++B,IAIH,IAAI3E,QAASC,IAClB,IAAIwF,EACJ,IACEA,EAAc7/B,KAAK++B,GAAIc,YAAY,CAAC7/B,KAAKu/B,WAAY,YACvD,OAAS99B,GAGP,OAFAC,QAAQD,MAAM,gDAAiDA,QAC/D44B,GAAQ,EAEV,CAGAwF,EAAYzD,QAAU,KACpB16B,QAAQD,MAAM,uCAAwCo+B,EAAYp+B,OAClE44B,GAAQ,IAGVwF,EAAYC,QAAU,KACpBp+B,QAAQD,MAAM,yCACd44B,GAAQ,IAGV,MAAM2F,EAAQH,EAAYE,YAAY//B,KAAKu/B,WAErCU,EADQD,EAAM7+B,MAAM,OACDlB,IAAIC,GAE7B+/B,EAAWd,UAAY,KACrB,MAAMhZ,EAAuE,CAAEjmB,MAAKG,QAAO6/B,UAAWn+B,KAAKC,OAC3G,IAAI0T,EAEAuqB,EAAWv4B,QACbye,EAAK1hB,GAAMw7B,EAAWv4B,OAA0BjD,GAChDiR,EAAUsqB,EAAM5J,IAAIjQ,IAEpBzQ,EAAUsqB,EAAMxzB,IAAI2Z,GAGtBzQ,EAAQypB,UAAY,KAClB9E,GAAQ,IAGV3kB,EAAQ0mB,QAAU,KAChB16B,QAAQD,MAAM,8CAA+CiU,EAAQjU,OACrE44B,GAAQ,KAIZ4F,EAAW7D,QAAU,KACnB16B,QAAQD,MAAM,0CAA2Cw+B,EAAWx+B,OACpE44B,GAAQ,KAGd,CAEA,gBAAMoE,CAAWv+B,GACf,QAAKF,KAAK++B,IAIH,IAAI3E,QAASC,IAClB,IAAIwF,EACJ,IACEA,EAAc7/B,KAAK++B,GAAIc,YAAY,CAAC7/B,KAAKu/B,WAAY,YACvD,OAAS99B,GAGP,OAFAC,QAAQD,MAAM,2DAA4DA,QAC1E44B,GAAQ,EAEV,CAGAwF,EAAYzD,QAAU,KACpB16B,QAAQD,MAAM,iDAAkDo+B,EAAYp+B,OAC5E44B,GAAQ,IAGVwF,EAAYC,QAAU,KACpBp+B,QAAQD,MAAM,mDACd44B,GAAQ,IAGV,MAAM2F,EAAQH,EAAYE,YAAY//B,KAAKu/B,WAErC7pB,EADQsqB,EAAM7+B,MAAM,OACJlB,IAAIC,GAE1BwV,EAAQypB,UAAY,KAClB,GAAIzpB,EAAQhO,OAAQ,CAClB,MAAMy4B,EAAgBH,EAAM/+B,OAAOyU,EAAQhO,OAAOjD,IAClD07B,EAAchB,UAAY,IAAM9E,GAAQ,GACxC8F,EAAc/D,QAAU,KACtB16B,QAAQD,MAAM,6CAA8C0+B,EAAc1+B,OAC1E44B,GAAQ,GAEZ,MACEA,GAAQ,IAIZ3kB,EAAQ0mB,QAAU,KAChB16B,QAAQD,MAAM,qDAAsDiU,EAAQjU,OAC5E44B,GAAQ,KAGd,CAEA,YAAMl6B,GAIJ,OAHKH,KAAK++B,UACF/+B,KAAK6F,OAER7F,KAAK++B,GAIH,IAAI3E,QAASC,IAClB,MAEM3kB,EAFc1V,KAAK++B,GAAIc,YAAY,CAAC7/B,KAAKu/B,WAAY,YACjCQ,YAAY//B,KAAKu/B,WACrBp/B,SAEtBuV,EAAQypB,UAAY,KAClB,MAAMiB,EAAU1qB,EAAQhO,OAAOjE,IAAKC,IAAA,CAClCxD,IAAKwD,EAAKxD,IACVG,MAAOqD,EAAKrD,SAEdg6B,EAAQ+F,IAGV1qB,EAAQ0mB,QAAU,KAChB/B,EAAQ,OAjBH,EAoBX,GCvYF,MAAMgG,GAWJ,WAAAxgC,CAAYygC,EAAkB,KAC5B,GAXMvgC,EAAAC,KAAA,aAAa,8BACbD,EAAAC,KAAA,WACAD,EAAAC,KAAA,gBAAwB,GACxBD,EAAAC,KAAA,oBAAiDS,KACjDV,EAAAC,KAAA,YAA2Bo6B,QAAQC,WAOrCiG,GAAW,EACb,MAAM,IAAI5uB,MAAM,4CAElB1R,KAAKsgC,QAAUA,CACjB,CAKA,UAAMz6B,SACkBi5B,GAAiBj5B,SAErC7F,KAAKugC,cAAe,EACpB7+B,QAAQ8+B,KAAK,wFAEjB,CAKA,UAAMC,CAAK9/B,GACT,IAWE,OATAX,KAAK0gC,UAAY1gC,KAAK0gC,UAAUC,KAAKzG,gBAC7Bl6B,KAAK4gC,OAAOjgC,KACjBkgC,MAAMp/B,IAGP,MAFAC,QAAQD,MAAM,uCAAwCA,GAEhDA,UAGFzB,KAAK0gC,WACJ,CACT,OAASj/B,GACPC,QAAQD,MAAM,sCAAuCA,GAErD,IACE,MAAMZ,EAASb,KAAK6+B,cAAc5+B,IAAID,KAAK8gC,aAAe,GAM1D,OALIjgC,EAAOoE,QAAUjF,KAAKsgC,SACxBz/B,EAAO6sB,QAET7sB,EAAOE,KAAKf,KAAK+gC,cAAcpgC,IAC/BX,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYjgC,IACjC,CACT,OAASmgC,GAEP,OADAt/B,QAAQD,MAAM,gDAAiDu/B,IACxD,CACT,CACF,CACF,CAKA,YAAcJ,CAAOjgC,GACnB,IAEE,MAAMsgC,EAAYjhC,KAAK+gC,cAAcpgC,GAE/BE,QAAeb,KAAKG,SAQ1B,GAPIU,EAAOoE,QAAUjF,KAAKsgC,SAExBz/B,EAAO6sB,QAGT7sB,EAAOE,KAAKkgC,GAERjhC,KAAKugC,aAAc,CACrB,MAAMpa,EAAOnmB,KAAKkhC,cAAcrgC,GAChC,IAAKslB,EACH,MAAM,IAAIzU,MAAM,oCAGIotB,GAAiBN,QAAQx+B,KAAK8gC,WAAY3a,KAG9DnmB,KAAKugC,cAAe,EACpBvgC,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYjgC,GAE5C,MAEEb,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYjgC,EAE5C,OAASY,GAGP,GAFAC,QAAQD,MAAM,mCAAoCA,IAE9CzB,KAAKugC,aAaP,MAAM9+B,EAZNzB,KAAKugC,cAAe,EACpB,IACE,MAAM1/B,EAASb,KAAK6+B,cAAc5+B,IAAID,KAAK8gC,aAAe,GACtDjgC,EAAOoE,QAAUjF,KAAKsgC,SACxBz/B,EAAO6sB,QAET7sB,EAAOE,KAAKf,KAAK+gC,cAAcpgC,IAC/BX,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYjgC,EAC1C,OAASmS,GACP,MAAMA,CACR,CAIJ,CACF,CAKQ,aAAA+tB,CAAcpgC,GAMpB,MAJgC,IAC3BA,EACHoS,WAAYpS,EAAMoS,WAAa/S,KAAKmhC,eAAexgC,EAAMoS,iBAAc,EAG3E,CAKQ,cAAAouB,CAAe79B,EAA8B89B,EAAU,IAAIC,SACjE,GAAmB,iBAAR/9B,GAA4B,OAARA,EAC7B,OAAOA,EAGT,GAAI89B,EAAQtgC,IAAIwC,GACd,MAAO,CAAA,EAGT89B,EAAQ50B,IAAIlJ,GACZ,MAAMoE,EAAkC,CAAA,EAExC,IAAA,MAAYxH,EAAKG,KAAUuD,OAAOgP,QAAQtP,GAEtCoE,EAAOxH,GADY,iBAAVG,GAAgC,OAAVA,EACjBL,KAAKmhC,eAAe9gC,EAAkC+gC,GAEtD/gC,EAIlB,OAAOqH,CACT,CAKQ,aAAAw5B,CAAc59B,GACpB,IACE,OAAOqO,KAAKC,UAAUtO,EACxB,OAAS7B,GAEP,IACE,GAAmB,iBAAR6B,GAA4B,OAARA,EAAc,CAC3C,MAAMg+B,EAAYthC,KAAKmhC,eAAe79B,GACtC,OAAOqO,KAAKC,UAAU0vB,EACxB,CACA,OAAO3vB,KAAKC,UAAUtO,EACxB,OAAS0P,GAEP,OADAtR,QAAQD,MAAM,0DAA2DuR,GAClE,IACT,CACF,CACF,CAKA,YAAM7S,GACJ,IACE,GAAIH,KAAKugC,aAAc,CACrB,MAAMpa,QAAa2Y,GAAiBH,QAAQ3+B,KAAK8gC,YACjD,OAAK3a,EAGExU,KAAKgoB,MAAMxT,GAFT,EAGX,CAEE,OAAOnmB,KAAK6+B,cAAc5+B,IAAID,KAAK8gC,aAAe,EAEtD,OAASr/B,GAGP,OAFAC,QAAQD,MAAM,wCAAyCA,GAEnDzB,KAAKugC,cACPvgC,KAAKugC,cAAe,EACbvgC,KAAK6+B,cAAc5+B,IAAID,KAAK8gC,aAAe,IAE7C,EACT,CACF,CAKA,YAAMS,CAAO1gC,GACX,IACE,MAAM2gC,QAAkBxhC,KAAKG,SACvBshC,EAAW,IAAIhhC,IAAII,EAAO4C,IAAIuP,GAAK,CAAChT,KAAKwX,YAAYxE,GAAIA,KAEzD0uB,EAAkBF,EAAUz8B,OAAOiO,IAAMyuB,EAAS3gC,IAAId,KAAKwX,YAAYxE,KAE7E,GAA+B,IAA3B0uB,EAAgBz8B,OAMlB,OALIjF,KAAKugC,mBACDzB,GAAiBL,WAAWz+B,KAAK8gC,YAEvC9gC,KAAK6+B,cAAc59B,OAAOjB,KAAK8gC,aAE1B,EAGT,GAAI9gC,KAAKugC,aAAc,CACrB,MAAMpa,EAAOnmB,KAAKkhC,cAAcQ,GAChC,IAAKvb,EACH,MAAM,IAAIzU,MAAM,wCAElB,MAAMiwB,QAAgB7C,GAAiBN,QAAQx+B,KAAK8gC,WAAY3a,GAChE,OAAKwb,IAEH3hC,KAAKugC,cAAe,EACpBvgC,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYY,IACjC,EAGX,CAEE,OADA1hC,KAAK6+B,cAAcz+B,IAAIJ,KAAK8gC,WAAYY,IACjC,CAEX,OAASjgC,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,IACjD,CACT,CACF,CAKA,WAAMI,GACJ,IAME,OALI7B,KAAKugC,mBACDzB,GAAiBL,WAAWz+B,KAAK8gC,YAEvC9gC,KAAK6+B,cAAc59B,OAAOjB,KAAK8gC,aAE1B,CACT,OAASr/B,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,IACjD,CACT,CACF,CAKA,cAAMmgC,GAEJ,aADqB5hC,KAAKG,UACZ8E,MAChB,CAKQ,WAAAuS,CAAY7W,GAClB,MAAO,GAAGA,EAAMuF,QAAQvF,EAAMwF,QAAQxF,EAAMyF,aAAazF,EAAM0F,KACjE,EChQF,MAAMw7B,GAaJ,WAAAhiC,CAAYf,EAAmBmM,EAA8B,IAZrDlL,EAAAC,KAAA,UACAD,EAAAC,KAAA,kBACAD,EAAAC,KAAA,QAAwB,IACxBD,EAAAC,KAAA,QAA8C,MAC9CD,EAAAC,KAAA,aACAD,EAAAC,KAAA,aACAD,EAAAC,KAAA,wBACAD,EAAAC,KAAA,gBAAwB,GACxBD,EAAAC,KAAA,iBAAyB,GACzBD,EAAAC,KAAA,cAAoC,MACpCD,EAAAC,KAAA,qBAAyDS,KAG/DT,KAAK8hC,OAAS,IAAI7D,GAAOn/B,GACzBkB,KAAK+hC,eAAiB,IAAI1B,GAAep1B,EAAQ1L,uBAAyB,KAC1ES,KAAKb,UAAY8L,EAAQ9L,WAAa,GACtCa,KAAKZ,UAAY6L,EAAQ7L,WAAa,IACtCY,KAAKV,qBAAuB2L,EAAQ3L,uBAAwB,EAG5DU,KAAKg/B,YAAch/B,KAAK6F,MAC1B,CAKA,UAAcA,GACR7F,KAAKV,6BACDU,KAAK+hC,eAAel8B,OAE1B7F,KAAKgiC,sBAEPhiC,KAAKiiC,eAAgB,CACvB,CAKA,uBAAcC,IACPliC,KAAKiiC,eAAiBjiC,KAAKg/B,mBACxBh/B,KAAKg/B,WAEf,CAKA,GAAAxyB,CAAI7L,EAAqBsK,GACvBjL,KAAKmiC,MAAMphC,KAAKJ,UAGZsK,WAASm3B,kBACXpiC,KAAKqiC,eAAejiC,IAAIO,EAAOsK,GAI7BjL,KAAKmiC,MAAMl9B,QAAUjF,KAAKb,UAC5Ba,KAAKmpB,QAKFnpB,KAAKsiC,QACRtiC,KAAKsiC,MAAQr/B,WAAW,KACtBjD,KAAKmpB,SACJnpB,KAAKZ,WAEZ,CAKA,cAAMmjC,CAAS5hC,SACPX,KAAKkiC,oBACXliC,KAAKwM,IAAI7L,EACX,CAKA,WAAMwoB,GAEJ,GAAInpB,KAAKwiC,cAAsC,IAAtBxiC,KAAKmiC,MAAMl9B,OAClC,aAIIjF,KAAKkiC,oBAGXliC,KAAKwiC,cAAe,EAEhBxiC,KAAKsiC,QACPt/B,aAAahD,KAAKsiC,OAClBtiC,KAAKsiC,MAAQ,MAKf,MAAMzhC,EAAS,IAAIb,KAAKmiC,OACxBniC,KAAKmiC,MAAQ,GAIb,MAAMM,MAAkBhiC,IAExBI,EAAOW,QAAQb,IACb,MAAMsK,EAAUjL,KAAKqiC,eAAepiC,IAAIU,GACxC,SAAIsK,WAASm3B,gBAAiB,CAC5B,MAAMxhC,EAAWqK,EAAQm3B,gBACpBK,EAAY3hC,IAAIF,IACnB6hC,EAAYriC,IAAIQ,EAAU,IAE5B6hC,EAAYxiC,IAAIW,GAAWG,KAAKJ,EAClC,CACAX,KAAKqiC,eAAephC,OAAON,KAG7B,IACE,MAAMghC,QAAgB3hC,KAAK8hC,OAAO1D,UAAUv9B,GAE5C,IAAK8gC,GAAW3hC,KAAKV,qBAEnB,IAAA,MAAWqB,KAASE,QACZb,KAAK+hC,eAAetB,KAAK9/B,GAKnC8hC,EAAYjhC,QAAQ,CAACkhC,EAAgB9hC,KACnC,IACEA,EAAS8hC,EAAgBf,EAC3B,OAASlgC,GACPC,QAAQD,MAAM,iDAAkDA,EAClE,GAEJ,OAASA,GAGP,GAFAC,QAAQD,MAAM,sCAAuCA,GAEjDzB,KAAKV,qBACP,IAAA,MAAWqB,KAASE,QACZb,KAAK+hC,eAAetB,KAAK9/B,GAKnC8hC,EAAYjhC,QAAQ,CAACkhC,EAAgB9hC,KACnC,IACEA,EAAS8hC,GAAgB,EAC3B,OAASnd,GACP7jB,QAAQD,MAAM,iDAAkD8jB,EAClE,GAEJ,CAAA,QACEvlB,KAAKwiC,cAAe,EAGhBxiC,KAAKmiC,MAAMl9B,OAAS,GAEtBhC,WAAW,KACTjD,KAAKmpB,QAAQ0X,MAAMp/B,IACjBC,QAAQD,MAAM,yCAA0CA,MAEzD,EAEP,CACF,CAKA,wBAAcugC,GACZ,IACE,MAAMnhC,QAAeb,KAAK+hC,eAAe5hC,SACzC,GAAsB,IAAlBU,EAAOoE,OACT,OAIF,MAAM9F,EAAYa,KAAKb,UACvB,IAAA,IAASyZ,EAAI,EAAGA,EAAI/X,EAAOoE,OAAQ2T,GAAKzZ,EAAW,CACjD,MAAMwjC,EAAQ9hC,EAAO0sB,MAAM3U,EAAGA,EAAIzZ,GAGlC,WAFsBa,KAAK8hC,OAAO1D,UAAUuE,IAO1C,YAHM3iC,KAAK+hC,eAAeR,OAAOoB,EAKrC,CACF,OAASlhC,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,CACF,CAKA,YAAA48B,CAAah4B,GACXrG,KAAK8hC,OAAOzD,aAAah4B,EAC3B,CAKA,sBAAMu8B,GAEJ,aADM5iC,KAAKkiC,oBACJliC,KAAK+hC,eAAe5hC,QAC7B,CAKA,0BAAM0iC,GAEJ,aADM7iC,KAAKkiC,oBACJliC,KAAK+hC,eAAeH,UAC7B,CAKA,yBAAMkB,GAEJ,aADM9iC,KAAKkiC,oBACJliC,KAAK+hC,eAAelgC,OAC7B,CAKA,OAAA4G,GACMzI,KAAKsiC,QACPt/B,aAAahD,KAAKsiC,OAClBtiC,KAAKsiC,MAAQ,MAKftiC,KAAKmpB,QAAQ0X,MAAMp/B,IACjBC,QAAQD,MAAM,2CAA4CA,IAE9D,CAKA,kBAAMshC,GACA/iC,KAAKsiC,QACPt/B,aAAahD,KAAKsiC,OAClBtiC,KAAKsiC,MAAQ,YAGTtiC,KAAKmpB,OACb,ECjRF,MAAM6Z,GAAN,WAAAnjC,GACUE,EAAAC,KAAA,cAA0CS,KAC1CV,EAAAC,KAAA,kBAA0C,KAAA,CAKlD,kBAAAijC,CAAmBC,GACjBljC,KAAKmjC,gBAAkBD,CACzB,CAKA,GAAAE,CAAIC,GACF,GAAIrjC,KAAKsjC,QAAQxiC,IAAIuiC,EAAOl9B,MAC1BzE,QAAQ8+B,KAAK,0BAA0B6C,EAAOl9B,mCAIhD,GAAKnG,KAAKmjC,gBAKV,IACEE,EAAOE,QAAQvjC,KAAKmjC,iBACpBnjC,KAAKsjC,QAAQljC,IAAIijC,EAAOl9B,KAAMk9B,EAChC,OAAS5hC,GACPC,QAAQD,MAAM,2CAA2C4hC,EAAOl9B,SAAU1E,EAC5E,MATEC,QAAQD,MAAM,6CAUlB,CAKA,KAAA+hC,CAAMC,GACJ,MAAMJ,EAASrjC,KAAKsjC,QAAQrjC,IAAIwjC,GAChC,GAAKJ,EAAL,CAIA,GAAIA,EAAOK,WAAa1jC,KAAKmjC,gBAC3B,IACEE,EAAOK,UAAU1jC,KAAKmjC,gBACxB,OAAS1hC,GACPC,QAAQD,MAAM,6CAA6CgiC,MAAgBhiC,EAC7E,CAGFzB,KAAKsjC,QAAQriC,OAAOwiC,EAVpB,CAWF,CAKA,GAAAxjC,CAAIwjC,GACF,OAAOzjC,KAAKsjC,QAAQrjC,IAAIwjC,EAC1B,CAKA,MAAAtjC,GACE,OAAOqD,MAAMwI,KAAKhM,KAAKsjC,QAAQvqB,SACjC,CAKA,KAAAlX,GACE,IAAA,MAAW4hC,KAAczjC,KAAKsjC,QAAQ9qB,OACpCxY,KAAKwjC,MAAMC,EAEf,EC7DF,MAAME,GAIJ,WAAA9jC,GAHQE,EAAAC,KAAA,YAA6B,IAC7BD,EAAAC,KAAA,YAAoB+B,KAAKC,MAIjC,CAKA,eAAA4hC,CAAgBjjC,GACdX,KAAK6jC,UAAU9iC,KAAKJ,EACtB,CAKA,UAAAmjC,GACE,MAAMC,MAAoB74B,IACpB84B,MAAqB94B,IAC3B,IAAI+4B,EAAgB,EACpB,MAAMC,EAAkB,GAexB,OAbAlkC,KAAK6jC,UAAUriC,QAAQb,IACjBA,EAAMjB,UACRqkC,EAAcv3B,IAAI7L,EAAMjB,UAEtBiB,EAAMwjC,WACRH,EAAex3B,IAAI7L,EAAMwjC,WAEvBxjC,EAAMmG,WACRm9B,GAAiBtjC,EAAMmG,UAEzBo9B,EAAMnjC,KAAKJ,EAAM0F,OAGZ,CACL+9B,GAAIpkC,KAAK6jC,UAAU5+B,OACnBo/B,GAAIN,EAAcpuB,KAClB2uB,SAAUN,EAAeruB,KACzB4uB,YAAavkC,KAAK6jC,UAAU5+B,OAAS,EAAIg/B,EAAgBjkC,KAAK6jC,UAAU5+B,OAAS,EACjFi/B,QAEJ,CAKA,YAAAM,GACE,OAAOxkC,KAAK6jC,UAAUpgC,IAAI9C,GAASA,EAAM0F,IAC3C,CAKA,WAAAo+B,GACE,OAAO1iC,KAAKC,MAAQhC,KAAK4G,SAC3B,CAKA,KAAA89B,GACE1kC,KAAK6jC,UAAY,GACjB7jC,KAAK4G,UAAY7E,KAAKC,KACxB,ECnEF,MAAM2iC,GAAN,WAAA9kC,GACUE,EAAAC,KAAA,YAA2B,IAC3BD,EAAAC,KAAA,eAAkC,IAClCD,EAAAC,KAAA,WAAoC,MACpCD,EAAAC,KAAA,eAAuB,GACvBD,EAAAC,KAAA,eAAuB,KACvBD,EAAAC,KAAA,kBAAkE,MAClED,EAAAC,KAAA,4BAAkD,MAoIlDD,EAAAC,KAAA,cAAeW,UACrBX,KAAK4kC,kBAAkB,CACrB1+B,KAAM,QACNE,UAAWrE,KAAKC,MAChBmkB,KAAM,CACJ5c,EAAG5I,EAAM6I,QACTC,EAAG9I,EAAM+I,QACTW,OAAS,OAAA3E,EAAA/E,EAAM0J,aAAN,EAAA3E,EAA0BF,aAQjCzF,EAAAC,KAAA,cAAeW,IACrB,MAAM0J,EAAS1J,EAAM0J,OAChBA,GAILrK,KAAK4kC,kBAAkB,CACrB1+B,KAAM,QACNE,UAAWrE,KAAKC,MAChBmkB,KAAM,CACJ3gB,QAAS6E,EAAO7E,QAChBnF,MAAOgK,EAAOhK,MAAM+B,UAAU,EAAG,UAQ/BrC,EAAAC,KAAA,eAAe,KACrBA,KAAK4kC,kBAAkB,CACrB1+B,KAAM,SACNE,UAAWrE,KAAKC,MAChBmkB,KAAM,CACJ0e,QAASviC,OAAOuiC,QAChBC,QAASxiC,OAAOwiC,aAQd/kC,EAAAC,KAAA,kBAAmBW,IACzBX,KAAK4kC,kBAAkB,CACrB1+B,KAAM,YACNE,UAAWrE,KAAKC,MAChBmkB,KAAM,CACJ5c,EAAG5I,EAAM6I,QACTC,EAAG9I,EAAM+I,YAGf,CAxLA,KAAA0d,GACMpnB,KAAK+kC,aAAmC,oBAAbriC,WAI/B1C,KAAK+kC,aAAc,EAGnB/kC,KAAKglC,eAGLhlC,KAAKilC,gBAAkB/hC,EAAS,IAAI3B,KAClC,MAAM2jC,EAAY3jC,EAAK,GACvBvB,KAAKmlC,gBAAgBD,IACpB,KAGHllC,KAAKuL,SAAW,IAAI65B,iBAAiBplC,KAAKilC,iBAE1CjlC,KAAKuL,SAASO,QAAQpJ,SAASg5B,KAAM,CACnC2J,WAAW,EACXC,SAAS,EACTC,YAAY,EACZC,mBAAmB,EACnBC,eAAe,IAIjBzlC,KAAK0lC,4BACP,CAKA,IAAAC,GACO3lC,KAAK+kC,cAIV/kC,KAAK+kC,aAAc,EAEf/kC,KAAKuL,WACPvL,KAAKuL,SAAS4C,aACdnO,KAAKuL,SAAW,MAGlBvL,KAAK4lC,6BACP,CAKQ,YAAAZ,GACFhlC,KAAK6lC,UAAU5gC,QAAUjF,KAAK8lC,cAEhC9lC,KAAK6lC,UAAUnY,QAGjB,IACE,MAAMqY,EAAwB,CAC5B3/B,UAAWrE,KAAKC,MAChBgkC,KAAMtjC,SAASwK,gBAAgB+4B,UAC/Bf,UAAW,IAGbllC,KAAK6lC,UAAU9kC,KAAKglC,EACtB,OAAStkC,GACPC,QAAQD,MAAM,wCAAyCA,EACzD,CACF,CAKQ,eAAA0jC,CAAgBD,GACtB,GAA8B,IAA1BllC,KAAK6lC,UAAU5gC,OACjB,OAGmBjF,KAAK6lC,UAAU7lC,KAAK6lC,UAAU5gC,OAAS,GAC/CigC,UAAUnkC,QAAQmkC,EACjC,CAKQ,yBAAAQ,GACgB,oBAAXpjC,SAKXI,SAASuE,iBAAiB,QAASjH,KAAK8I,aAAa,GAErDpG,SAASuE,iBAAiB,QAASjH,KAAKyO,aAAa,GAErDnM,OAAO2E,iBAAiB,SAAUjH,KAAKkmC,aAAc,CAAEh9B,SAAS,IAEhElJ,KAAKmmC,0BAA4BjjC,EAAS,IAAI3B,KAC5C,MAAMZ,EAAQY,EAAK,GACnBvB,KAAKomC,gBAAgBzlC,IACpB,KACH+B,SAASuE,iBAAiB,YAAajH,KAAKmmC,0BAA2B,CAAEj9B,SAAS,IACpF,CAKQ,0BAAA08B,GACkB,oBAAbljC,WAIXA,SAASgG,oBAAoB,QAAS1I,KAAK8I,aAAa,GACxDpG,SAASgG,oBAAoB,QAAS1I,KAAKyO,aAAa,GACxDnM,OAAOoG,oBAAoB,SAAU1I,KAAKkmC,aAAc,CAAEh9B,SAAS,IAG/DlJ,KAAKmmC,4BACPzjC,SAASgG,oBAAoB,YAAa1I,KAAKmmC,0BAA2B,CAAEj9B,SAAS,IACrFlJ,KAAKmmC,0BAA4B,MAErC,CAmEQ,iBAAAvB,CAAkByB,GACpBrmC,KAAKsmC,aAAarhC,QAAUjF,KAAK8lC,cACnC9lC,KAAKsmC,aAAa5Y,QAEpB1tB,KAAKsmC,aAAavlC,KAAKslC,EACzB,CAKA,OAAAE,GAIE,MAAO,CACLV,UAAW,IAAI7lC,KAAK6lC,WACpBS,aAAc,IAAItmC,KAAKsmC,cAE3B,CAKA,KAAAzkC,GACE7B,KAAK6lC,UAAY,GACjB7lC,KAAKsmC,aAAe,EACtB,CAKA,OAAA79B,GACEzI,KAAK2lC,OACL3lC,KAAK6B,OACP,EC5NF,MAAM2kC,GAGF,CACFx2B,SAAS,EACTy2B,mBAAmB,EACnBC,oBAAoB,EACpBC,oBAAqB,OACrBC,mBAAoB,OACpBC,oBAAoB,GAMtB,SAASC,GAAgBzgC,EAAatB,GACpC,OAAKA,IAIiB,iBAAXA,EACFsB,EAAI6F,SAASnH,GAGlBA,aAAkBgiC,OACbhiC,EAAOw5B,KAAKl4B,GAGC,mBAAXtB,GACFA,EAAOsB,GAIlB,CAKA,SAAS2gC,GAAsB7gB,EAAe8gB,GAC5C,IAAK9gB,GAAwB,iBAATA,GAAgD,IAA3B8gB,EAAgBhiC,OACvD,OAAOkhB,EAGT,GAAI3iB,MAAM0jC,QAAQ/gB,GAChB,OAAOA,EAAK1iB,IAAIC,GAAQsjC,GAAsBtjC,EAAMujC,IAGtD,MAAME,EAAoC,CAAA,EAC1C,IAAA,MAAYjnC,EAAKG,KAAUuD,OAAOgP,QAAQuT,GAAkC,CAC1E,MAAMihB,EAAWlnC,EAAIsE,cACfsK,EAAcm4B,EAAgBI,KAAKC,GAASF,EAASl7B,SAASo7B,EAAM9iC,gBAGxE2iC,EAASjnC,GADP4O,EACc,aACU,iBAAVzO,GAAgC,OAAVA,EACtB2mC,GAAsB3mC,EAAO4mC,GAE7B5mC,CAEpB,CAEA,OAAO8mC,CACT,CA4JO,SAASI,GACdt8B,EAAqC,IAErC,MAAMnL,EAAS,IAAK0mC,MAAoBv7B,GACxC,IAAIu8B,EAAqC,KACrCC,EAA+D,KAC/DC,EAA+D,KAC/DC,EAAuF,KAG3F,MAAMC,MAAiBnnC,IAQvB,MAAO,CACL0F,KAAM,sBACN,OAAAo9B,CAAQJ,GACN,GAAKrjC,EAAOkQ,SAA6B,oBAAX1N,cAKF,IAAjBA,OAAOq6B,QAChB6K,EAAgBllC,OAAOq6B,MACvBr6B,OAAOq6B,MAAQzC,eAAe7iB,EAA0BxR,GACtD,MAAMQ,EAAuB,iBAAVgR,EAAqBA,EAAQA,aAAiBwwB,IAAMxwB,EAAM7U,KAAO6U,EAAMhR,IAEpFgS,GAAS,MAAAxS,OAAA,EAAAA,EAAMwS,UAA4B,iBAAVhB,GAAwBA,aAAiBwwB,OAAQ,WAAYxwB,QAAuB,EAAfA,EAAMgB,SAAuB,MAGzI,IAAKyuB,GAAgBzgC,EAAKvG,EAAOgoC,WAC/B,OAAON,EAAezjC,KAAK/D,KAAMqX,EAAOxR,GAG1C,MAAMkiC,EAAY,GAAGhmC,KAAKC,SAASC,KAAKC,SAASC,SAAS,IAAIC,UAAU,EAAG,KACrEwE,EAAY7E,KAAKC,MACjB04B,EAAkC,CAAA,EAwBxC,IAAIsN,EACJ,GAtBqB,iBAAV3wB,KAAwBA,aAAiBwwB,MAAQ,YAAaxwB,GAASA,EAAMqjB,mBAAmBC,SACzGtjB,EAAMqjB,QAAQl5B,QAAQ,CAACnB,EAAOH,KAC5Bw6B,EAAQx6B,GAAOG,WAGfwF,WAAM60B,WACJ70B,EAAK60B,mBAAmBC,QAC1B90B,EAAK60B,QAAQl5B,QAAQ,CAACnB,EAAOH,KAC3Bw6B,EAAQx6B,GAAOG,IAERmD,MAAM0jC,QAAQrhC,EAAK60B,SAC5B70B,EAAK60B,QAAQl5B,QAAQ,EAAEtB,EAAKG,MAC1Bq6B,EAAQx6B,GAAOG,IAGjBuD,OAAOqkC,OAAOvN,EAAS70B,EAAK60B,UAO5B56B,EAAO2mC,kBAAmB,CAE5B,MAAMyB,GAAa,MAAAriC,OAAA,EAAAA,EAAM61B,QAA0B,iBAAVrkB,GAAwBA,aAAiBwwB,OAAQ,SAAUxwB,GAAqB,KAAbA,EAAMqkB,MAElH,GADAsM,QA3NZ9N,eACEwB,EACA4E,EACA6H,GAEA,GAAKzM,GAASyM,EAId,IACE,GAAoB,iBAATzM,EACT,OAAIA,EAAKz2B,OAASq7B,EACT5E,EAAKt5B,UAAU,EAAGk+B,GAAW,iBAE/B5E,EAGT,GAAIA,aAAgBO,SAAU,CAC5B,MAAMD,EAAoC,CAAA,EAC1C,IAAA,MAAY97B,EAAKG,KAAUq7B,EAAK9oB,UAC1BvS,aAAiB+nC,KACnBpM,EAAS97B,GAAO,UAAUG,EAAM8F,SAAS9F,EAAMsV,cAE/CqmB,EAAS97B,GAAOG,EAGpB,OAAO27B,CACT,CAEA,GAAIN,aAAgB2M,gBAClB,OAAOzkC,OAAO0kC,YAAY5M,EAAK9oB,WAGjC,GAAI8oB,aAAgBK,KAAM,CACxB,GAAIL,EAAK/lB,KAAO2qB,EACd,MAAO,UAAU5E,EAAK/lB,qBAAqB+lB,EAAKx1B,QAGlD,IACE,aAAaw1B,EAAKj2B,MACpB,CAAA,MACE,MAAO,UAAUi2B,EAAK/lB,qBAAqB+lB,EAAKx1B,OAClD,CACF,CAEA,OAAIw1B,aAAgBG,YACdH,EAAK6M,WAAajI,EACb,iBAAiB5E,EAAK6M,qBAExB,IAAI5Z,aAAcC,OAAO8M,GAI3B,yBACT,OAASj6B,GAEP,OADAC,QAAQ8+B,KAAK,mDAAoD/+B,GAC1D,sBACT,CACF,CAiKgC+mC,CAAgBN,EAAYpoC,EAAO8mC,mBAAoB9mC,EAAO2mC,mBAC9E3mC,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,QAAqB,IAAhB+iC,EAEjE,GAA2B,iBAAhBA,EACT,IAEEA,EAAchB,GADCr1B,KAAKgoB,MAAMqO,GACkBloC,EAAOmnC,gBACrD,CAAA,MAEEe,EAAchB,GAAsBgB,EAAaloC,EAAOmnC,gBAC1D,MAEAe,EAAchB,GAAsBgB,EAAaloC,EAAOmnC,gBAG9D,CAGAW,EAAWxnC,IAAI2nC,EAAW,CACxB1hC,MACAgS,SACAqiB,UACA9zB,YACAohC,gBAIF,MAAMS,EAA4B,CAChCviC,KAAM,SACNC,KAAM,SACNyQ,UAAW,cACXxQ,UAAWQ,EACXP,IAAKhE,IACLM,MAAOF,IACPsQ,WAAY,CACV1M,IAAKA,EAAIvB,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCwT,QAASjS,EACTgS,SACAqiB,QAAS56B,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,EAC/D+hC,GAAsBtM,EAAS56B,EAAOmnC,iBACtCvM,EACJgB,KAAMsM,EACN5hC,UAAWQ,IAGfu8B,EAAgB7G,KAAKmM,GAErB,IAEE,MAAMl0B,QAAiBizB,EAAezjC,KAAK/D,KAAMqX,EAAOxR,GAClD6iC,EAAU3mC,KAAKC,MACf8E,EAAW4hC,EAAU9hC,EACrB+hC,EAAap0B,EAASmW,OACtBiX,EAAUptB,EAASgnB,GAGzB,GAAIz7B,EAAO+mC,oBAAsBlF,EAE/B,OADAiG,EAAW3mC,OAAO8mC,GACXxzB,EAIT,IAAIq0B,EACA9oC,EAAO4mC,qBACTkC,QA5Nd1O,eACE3lB,EACA+rB,EACA6H,GAEA,GAAKA,EAIL,IACE,KAAI5zB,aAAoBs0B,UA4CjB,CAEL,MAAMtO,EAAMhmB,EACN4mB,EAAeZ,EAAIY,cAAgB,GACzC,GAAIA,EAAal2B,OAASq7B,EACxB,OAAOnF,EAAa/4B,UAAU,EAAGk+B,GAAW,iBAG9C,IAAIzD,EAAc,GAClB,IACEA,EAActC,EAAIuO,kBAAkB,iBAAmB,EACzD,CAAA,MAEA,CAEA,GAAIjM,EAAY3wB,SAAS,oBACvB,IACE,OAAOyF,KAAKgoB,MAAMwB,EACpB,CAAA,MACE,OAAOA,CACT,CAGF,OAAOA,CACT,CApEkC,CAEhC,MAAM4N,EAAgBx0B,EAASmmB,QAAQz6B,IAAI,kBAC3C,GAAI8oC,GAAiBC,SAASD,EAAe,IAAMzI,EACjD,MAAO,wBAAwByI,WAKjC,IAAIE,EACJ,IACEA,EAAiB10B,EAAS4nB,OAC5B,OAAS16B,GAEP,MAAO,kCACT,CAEA,MAAMo7B,EAActoB,EAASmmB,QAAQz6B,IAAI,iBAAmB,GAE5D,GAAI48B,EAAY3wB,SAAS,oBAAqB,CAC5C,MAAMzG,QAAawjC,EAAexjC,OAClC,GAAIA,EAAKR,OAASq7B,EAChB,OAAO76B,EAAKrD,UAAU,EAAGk+B,GAAW,iBAEtC,IACE,OAAO3uB,KAAKgoB,MAAMl0B,EACpB,CAAA,MACE,OAAOA,CACT,CACF,KAAA,IAAWo3B,EAAY3wB,SAAS,SAAU,CACxC,MAAMzG,QAAawjC,EAAexjC,OAClC,OAAIA,EAAKR,OAASq7B,EACT76B,EAAKrD,UAAU,EAAGk+B,GAAW,iBAE/B76B,CACT,CAEE,IAEE,MAAO,IAAIo3B,GAAe,qBADPoM,EAAenN,QACWnmB,aAC/C,CAAA,MACE,MAAO,IAAIknB,GAAe,4BAC5B,CACF,CACF,CAyBF,OAASp7B,GAEP,OADAC,QAAQ8+B,KAAK,oDAAqD/+B,GAC3D,0BACT,CACF,CAyImCynC,CAAiB30B,EAAUzU,EAAO6mC,oBAAqB7mC,EAAO4mC,oBAC/E5mC,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,QAAsB,IAAjB2jC,IAEjEA,EAAe5B,GAAsB4B,EAAc9oC,EAAOmnC,mBAK9D,MAAM8B,EAAgBx0B,EAASmmB,QAAQz6B,IAAI,kBACrCkpC,EAAeJ,EAAgBC,SAASD,EAAe,SAAM,EAG7DK,EAA6B,CACjCljC,KAAM,SACNC,KAAM,SACNyQ,UAAW,eACXxQ,UAAWsiC,EACXriC,IAAKhE,IACLM,MAAOF,IACPsQ,WAAY,CACV1M,IAAKA,EAAIvB,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCwT,QAASjS,EACTgS,SACAswB,aACA7hC,WACAqiC,eACAxH,UACAjG,KAAMkN,EACNxiC,UAAWsiC,IAMf,OAHAvF,EAAgB7G,KAAK8M,GAErBxB,EAAW3mC,OAAO8mC,GACXxzB,CACT,OAAS9S,GACP,MAAMinC,EAAU3mC,KAAKC,MACf8E,EAAW4hC,EAAU9hC,EAGrByiC,EAAkC,CACtCnjC,KAAM,SACNC,KAAM,SACNyQ,UAAW,eACXxQ,UAAWsiC,EACXriC,IAAKhE,IACLM,MAAOF,IACPsQ,WAAY,CACV1M,IAAKA,EAAIvB,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCwT,QAASjS,EACTgS,SACAswB,WAAY,EACZ7hC,WACA66B,SAAS,EACTlgC,MAAOA,aAAiBiQ,MAAQjQ,EAAM2P,QAAUmB,OAAO9Q,GACvD2E,UAAWsiC,IAMf,MAHAvF,EAAgB7G,KAAK+M,GAErBzB,EAAW3mC,OAAO8mC,GACZtmC,CACR,CACF,GAI4B,oBAAnB+4B,gBAAgC,CACzCiN,EAAkBjN,eAAe32B,UAAU42B,KAC3CiN,EAAkBlN,eAAe32B,UAAUy4B,KAC3CqL,EAA8BnN,eAAe32B,UAAU+2B,iBAEvD,MAAM0O,MAAiBC,QACjBC,MAAqBD,QAO3B/O,eAAe32B,UAAU42B,KAAO,SAC9BpiB,EACAhS,EACA6zB,EACAuP,EACAC,GAEA,MAAMC,EAA2B,iBAARtjC,EAAmBA,EAAMA,EAAI7D,KAQtD,OAPAgnC,EAAeppC,IAAIJ,KAAM,CACvBqG,IAAKsjC,EACLtxB,OAAQA,EAAOuxB,cACfhjC,UAAW7E,KAAKC,QAElBsnC,EAAWlpC,IAAIJ,KAAM,IAEdynC,EAAiB1jC,KAAK/D,KAAMqY,EAAQhS,OAAe,IAAV6zB,GAAsBA,EAAcuP,EAAUC,EAChG,EAEAlP,eAAe32B,UAAU+2B,iBAAmB,SAASz0B,EAAc9F,GACjE,MAAMq6B,EAAU4O,EAAWrpC,IAAID,OAAS,CAAA,EAGxC,OAFA06B,EAAQv0B,GAAQ9F,EAChBipC,EAAWlpC,IAAIJ,KAAM06B,GACdiN,EAA6B5jC,KAAK/D,KAAMmG,EAAM9F,EACvD,EAEAm6B,eAAe32B,UAAUy4B,KAAO,SAASZ,GACvC,MAAMmO,EAAcL,EAAevpC,IAAID,MACvC,IAAK6pC,EACH,OAAOnC,EAAiB3jC,KAAK/D,KAAM07B,GAGrC,MAAMr1B,IAAEA,EAAAgS,OAAKA,EAAAzR,UAAQA,GAAcijC,EAC7BnP,EAAU4O,EAAWrpC,IAAID,OAAS,CAAA,EAGxC,IAAK8mC,GAAgBzgC,EAAKvG,EAAOgoC,WAC/B,OAAOJ,EAAiB3jC,KAAK/D,KAAM07B,GAIrC,IAAIsM,EACJ,GAAIloC,EAAO2mC,mBAAqB/K,EAAM,CACpC,GAAoB,iBAATA,EACTsM,EAActM,EAAKz2B,OAASnF,EAAO8mC,mBAC/BlL,EAAKt5B,UAAU,EAAGtC,EAAO8mC,oBAAsB,iBAC/ClL,OACN,GAAWA,aAAgBO,SAAU,CACnC,MAAMD,EAAoC,CAAA,EAC1C,IAAA,MAAY97B,EAAKG,KAAUq7B,EAAK9oB,UAC1BvS,aAAiB+nC,KACnBpM,EAAS97B,GAAO,UAAUG,EAAM8F,SAAS9F,EAAMsV,cAE/CqmB,EAAS97B,GAAOG,EAGpB2nC,EAAchM,CAChB,MACEgM,EADStM,aAAgBK,KACXL,EAAK/lB,KAAO7V,EAAO8mC,mBAC7B,UAAUlL,EAAK/lB,qBAAqB+lB,EAAKx1B,QACzC,SAEU,0BAGZpG,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,IAC5D+iC,EAAchB,GAAsBgB,EAAaloC,EAAOmnC,iBAE5D,CAEA4C,EAAY7B,YAAcA,EAG1B,MAAMS,EAA4B,CAChCviC,KAAM,SACNC,KAAM,SACNyQ,UAAW,cACXxQ,UAAWQ,EACXP,IAAKhE,IACLM,MAAOF,IACPsQ,WAAY,CACV1M,IAAKA,EAAIvB,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCwT,QAASjS,EACTgS,SACAqiB,QAAS56B,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,EAC/D+hC,GAAsBtM,EAAS56B,EAAOmnC,iBACtCvM,EACJgB,KAAMsM,EACN5hC,UAAWQ,IAGfu8B,EAAgB7G,KAAKmM,GAGrB,MAAMqB,EAA0B,KAC9B,GAAI9pC,KAAKoT,aAAeonB,eAAeuP,KAAM,CAC3C,MAAMrB,EAAU3mC,KAAKC,MACf8E,EAAW4hC,EAAU9hC,EACrB+hC,EAAa3oC,KAAK0qB,OAElBiX,EAAUgH,GAAc,KAAOA,EAAa,IAGlD,GAAI7oC,EAAO+mC,oBAAsBlF,EAI/B,OAHA3hC,KAAK0I,oBAAoB,mBAAoBohC,GAC7CN,EAAevoC,OAAOjB,WACtBspC,EAAWroC,OAAOjB,MAKpB,IAAIm7B,EAAe,GACnB,IACEA,EAAen7B,KAAKm7B,cAAgB,EACtC,OAAS15B,GAEPC,QAAQ8+B,KAAK,uDAAwD/+B,EACvE,CAEA,MAAM0nC,EAAehO,EAAal2B,OAClC,IAAI2jC,EAEJ,GAAI9oC,EAAO4mC,mBAAoB,CAC7B,GAAIvL,EAAal2B,OAASnF,EAAO6mC,oBAC/BiC,EAAezN,EAAa/4B,UAAU,EAAGtC,EAAO6mC,qBAAuB,qBAClE,CACL,IAAI9J,EAAc,GAClB,IACEA,EAAc78B,KAAK8oC,kBAAkB,iBAAmB,EAC1D,CAAA,MAEA,CACA,GAAIjM,EAAY3wB,SAAS,oBACvB,IACE08B,EAAej3B,KAAKgoB,MAAMwB,EAC5B,CAAA,MACEyN,EAAezN,CACjB,MAEAyN,EAAezN,CAEnB,CACIr7B,EAAOmnC,iBAAmBnnC,EAAOmnC,gBAAgBhiC,OAAS,IAC5D2jC,EAAe5B,GAAsB4B,EAAc9oC,EAAOmnC,iBAE9D,CAGA,MAAMmC,EAA6B,CACjCljC,KAAM,SACNC,KAAM,SACNyQ,UAAW,eACXxQ,UAAWsiC,EACXriC,IAAKhE,IACLM,MAAOF,IACPsQ,WAAY,CACV1M,IAAKA,EAAIvB,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCwT,QAASjS,EACTgS,SACAswB,aACA7hC,WACAqiC,eACAxH,UACAjG,KAAMkN,EACNxiC,UAAWsiC,IAGfvF,EAAgB7G,KAAK8M,GAGrBppC,KAAK0I,oBAAoB,mBAAoBohC,GAC7CN,EAAevoC,OAAOjB,MACtBspC,EAAWroC,OAAOjB,KACpB,GAIF,OAFAA,KAAKiH,iBAAiB,mBAAoB6iC,GAEnCpC,EAAiB3jC,KAAK/D,KAAM07B,EACrC,CACF,CACF,EACA,SAAAgI,GACwB,oBAAXphC,SAKPklC,IACFllC,OAAOq6B,MAAQ6K,EACfA,EAAgB,MAIdC,GAAmBC,GAAmBC,IACxCnN,eAAe32B,UAAU42B,KAAOgN,EAChCjN,eAAe32B,UAAUy4B,KAAOoL,EAChClN,eAAe32B,UAAU+2B,iBAAmB+M,EAC5CF,EAAkB,KAClBC,EAAkB,KAClBC,EAA8B,MAIhCC,EAAW/lC,QACb,EAEJ,CAKO,MAAMmoC,GAA2BzC,0DC/oBxC,MAeE,WAAA1nC,CAAYC,GAEV,GAhBMC,EAAAC,KAAA,UACAD,EAAAC,KAAA,cAAkC,MAClCD,EAAAC,KAAA,eAAoC,MACpCD,EAAAC,KAAA,qBAAgD,MAChDD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,eACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,oBACAD,EAAAC,KAAA,gBAAsC,MACtCD,EAAAC,KAAA,WAA4B,MAC5BD,EAAAC,KAAA,YACAD,EAAAC,KAAA,cAIDF,EAAOjB,MACV,MAAM,IAAI6S,MAAM,8BAGlB1R,KAAKF,OAAS,IAAIF,EAAcE,GAChCE,KAAKN,SAAWI,EAAOJ,UxBzBpB,WACL,GAAsB,oBAAX4C,OACT,OAAOR,IAGT,MAAM5B,EAAM,wBACZ,IAAIR,EAAW4+B,aAAaK,QAAQz+B,GAEpC,IAAKR,EAAU,CACbA,EAAWoC,IACX,IACEw8B,aAAaE,QAAQt+B,EAAKR,EAC5B,OAASsT,GAET,CACF,CAEA,OAAOtT,CACT,CwBOuCuqC,GACnCjqC,KAAKmkC,UxBHF,WACL,GAAsB,oBAAX7hC,OACT,OAAOR,IAGT,MAAM5B,EAAM,yBACZ,IAAIikC,EAAYvF,eAAeD,QAAQz+B,GAEvC,IAAKikC,EAAW,CACdA,EAAYriC,IACZ,IACE88B,eAAeJ,QAAQt+B,EAAKikC,EAC9B,OAASnxB,GAET,CACF,CAEA,OAAOmxB,CACT,CwBfqB+F,GAGjBlqC,KAAKmqC,cAAgB,IAAIzzB,EACzB1W,KAAKoqC,cAAgB,IAAItR,GAGzB,MAAMh6B,EAAYgB,EAAOhB,WAAa,cACtCkB,KAAKqqC,YAAc,IAAIxI,GAAY/iC,EAAW,CAC5CK,UAAWa,KAAKF,OAAOG,IAAI,aAC3Bb,UAAWY,KAAKF,OAAOG,IAAI,aAC3BX,qBAAsBU,KAAKF,OAAOG,IAAI,0BAA2B,EACjEV,sBAAuBS,KAAKF,OAAOG,IAAI,2BAIpCH,EAAOhB,WACVkB,KAAKqqC,YAAYhM,aAAa,IAEhCr+B,KAAKsqC,cAAgB,IAAItH,GACzBhjC,KAAKuqC,iBAAmB,IAAI5G,GAG5B3jC,KAAKsqC,cAAcrH,mBAAmB,CACpC3G,KAAMt8B,KAAKs8B,KAAK/0B,KAAKvH,MACrBwqC,UAAW,IAAMxqC,KAAKF,OAAOK,SAC7BsqC,QAASzqC,KAAKyqC,QAAQljC,KAAKvH,MAC3B0qC,QAAS,IAAM1qC,KAAK2qC,WAItB3qC,KAAK6F,OAGiB,oBAAXvD,SACRA,OAA+FyE,kBAAoB,CAClHzF,KAAM,CAACX,EAAewlB,KACpB3lB,EAASc,KAAKX,EAAOwlB,KAI7B,CAKQ,IAAAtgB,GAEF7F,KAAKF,OAAOG,IAAI,qBAClBD,KAAK4qC,YAAc,IAAIj7B,EACvB3P,KAAK4qC,YAAY/kC,OACjB7F,KAAK6qC,2BAIH7qC,KAAKF,OAAOG,IAAI,sBAClBD,KAAK8qC,aAAe,IAAIr6B,EACxBzQ,KAAK8qC,aAAajlC,QAIhB7F,KAAKF,OAAOG,IAAI,4BAClBD,KAAK+qC,mBAAqB,IAAI73B,EAC9BlT,KAAK+qC,mBAAmBllC,QAItB7F,KAAKF,OAAOG,IAAI,yBAClBD,KAAKgrC,cAAgB,IAAIrG,GACzB3kC,KAAKgrC,cAAc5jB,SAIjBpnB,KAAKF,OAAOG,IAAI,WAClBD,KAAKyqC,QAAQ,CAAEhrC,OAAQO,KAAKF,OAAOG,IAAI,WAE3C,CAKQ,uBAAA4qC,GAENrqC,EAASE,GAAG,WAAaC,IACvBX,KAAKs8B,KAAK37B,KAIZH,EAASE,GAAG,QAAUC,IACpBX,KAAKs8B,KAAK37B,KAIZH,EAASE,GAAG,WAAaC,IACvBX,KAAKs8B,KAAK37B,KAIZH,EAASE,GAAG,QAAUC,IACpBX,KAAKs8B,KAAK37B,KAIZH,EAASE,GAAG,QAAUC,IACpBX,KAAKs8B,KAAK37B,KAIZH,EAASE,GAAG,cAAgBC,IAC1BX,KAAKs8B,KAAK37B,IAEd,CAKA,IAAA27B,CAAK37B,GACH,IAEE,MAAMsqC,EAAgBjrC,KAAKkrC,YAAYvqC,GAGjC04B,EAAiBr5B,KAAKoqC,cAAclR,QAAQ+R,EAAe,CAC/D5rC,WAAYW,KAAKF,OAAOG,IAAI,cAC5Bk5B,qBAAqB,EACrBniB,WAA2B,UAAfrW,EAAMuF,OAGpB,IAAKmzB,EACH,OAIF,MAAM8R,EAAanrC,KAAKF,OAAOG,IAAI,cACnC,GAAIkrC,EAAY,CACd,MAAMzjC,EAASyjC,EAAW9R,GAC1B,IAAe,IAAX3xB,GAA+B,OAAXA,EACtB,OAEEA,GACF9D,OAAOqkC,OAAO5O,EAAgB3xB,EAElC,CAKA1H,KAAKqqC,YAAY79B,IAAI6sB,EAAgB,CACnC+I,gBAAiB,CAACvhC,EAAwB8gC,KAGxC,MAAMyJ,EAAYprC,KAAKF,OAAOG,IAAI,aAC9BmrC,GACFvqC,EAAOW,QAAQb,IACbsC,WAAW,KACTmoC,EAAUzqC,EAAOghC,IAChB,QAOQ,aAAfhhC,EAAMuF,MACRlG,KAAKuqC,iBAAiB3G,gBAAgBvK,EAE1C,OAAS53B,GACP,MAAM4pC,EAAUrrC,KAAKF,OAAOG,IAAI,WAC5BorC,EACFA,EAAQ5pC,GAERC,QAAQD,MAAM,gCAAiCA,EAEnD,CACF,CAKQ,WAAAypC,CAAYvqC,SAClB,MAAMlB,EAASkB,EAAMlB,SAAU,OAAAiG,EAAA1F,KAAK2qC,mBAAUlrC,SAAUO,KAAKF,OAAOG,IAAI,UAKlEqrC,EAAmB,IAJAtrC,KAAKF,OAAOG,IAAI,qBAAuB,CAAA,KACxCU,EAAMoS,YAAc,CAAA,GAStCw4B,EAAkB3nC,OAAO4U,KAAK8yB,GAAkBrmC,OAAS,EAAIqmC,OAAmB,EAEhFE,EAAyB,IAC1B7qC,EACHjB,SAAUiB,EAAMjB,UAAYM,KAAKN,SACjCykC,UAAWxjC,EAAMwjC,WAAankC,KAAKmkC,WAarC,OATI1kC,GAAqB,KAAXA,IACZ+rC,EAAS/rC,OAASA,GAIhB8rC,IACFC,EAASz4B,WAAaw4B,GAGjBC,CACT,CAKA,KAAA70B,CAAMC,EAAmB7D,GACvB,MAAMpS,EAAQX,KAAKmqC,cAAcxzB,MAAMC,EAAW7D,GAClD/S,KAAKs8B,KAAK37B,EACZ,CAKA,OAAA8pC,CAAQgB,GACNzrC,KAAK2qC,SAAW,IAAK3qC,KAAK2qC,YAAac,GACvCzrC,KAAKF,OAAOM,IAAI,SAAUqrC,EAAKhsC,QAAU,GAC3C,CAKA,OAAAirC,GACE,OAAO1qC,KAAK2qC,QACd,CAKA,UAAA93B,CAAWpR,EAAuBqR,GAChC,GAAI9S,KAAK8qC,aAEP9qC,KAAK8qC,aAAaj4B,WAAWpR,EAAOqR,OAC/B,CAEL,MAAM7B,EAAyB,CAC7B/K,KAAM,QACNC,KAAM,eACNC,UAAWrE,KAAKC,MAChBqE,IAAKhE,IACLM,MAAOF,IACP0O,UAAW,KACXC,QAAS3P,aAAiBiQ,MAAQjQ,EAAM2P,QAAU3P,EAClD4P,MAAO5P,aAAiBiQ,MAAQjQ,EAAM4P,WAAQ,EAC9C0B,WAAYD,GAEd9S,KAAKs8B,KAAKrrB,EACZ,CACF,CAKA,gBAAAy6B,GACE,GAAI1rC,KAAK+qC,mBAAoB,CAC3B,MAAMpqC,EAAQX,KAAK+qC,mBAAmBt0B,iBAClC9V,GACFX,KAAKs8B,KAAK37B,EAEd,CACF,CAKA,aAAAmF,GACE,GAAI9F,KAAK4qC,YAAa,CACpB,MAAMjqC,EAAQX,KAAK4qC,YAAYv6B,iBAAiBvK,gBAChD9F,KAAKs8B,KAAK37B,EACZ,CACF,CAKA,GAAAyiC,CAAIC,GACFrjC,KAAKsqC,cAAclH,IAAIC,EACzB,CAKA,YAAAsI,CAAa7rC,GACXE,KAAKF,OAAOQ,OAAOR,QAGM,IAArBA,EAAOhB,YACLgB,EAAOhB,UACTkB,KAAKqqC,YAAYhM,aAAav+B,EAAOhB,WAGrCkB,KAAKqqC,YAAYhM,aAAa,IAGpC,CAKA,SAAAmM,GACE,OAAOxqC,KAAKF,OAAOK,QACrB,CAKA,kBAAAyrC,GACE,OAAO5rC,KAAKuqC,iBAAiBzG,YAC/B,CAKA,oBAAA+H,SACE,OAAO,OAAAnmC,EAAA1F,KAAKgrC,oBAAL,EAAAtlC,EAAoB6gC,SAC7B,CAKA,sBAAM3D,GACJ,OAAO5iC,KAAKqqC,YAAYzH,kBAC1B,CAKA,0BAAMC,GACJ,OAAO7iC,KAAKqqC,YAAYxH,sBAC1B,CAKA,yBAAMC,GACJ,OAAO9iC,KAAKqqC,YAAYvH,qBAC1B,CAMA,cAAAgJ,GACE,OAAO9rC,KAAK4qC,WACd,CAKA,OAAAniC,eACE,OAAA/C,EAAA1F,KAAK4qC,cAALllC,EAAkB+C,UAClB,OAAA6G,EAAAtP,KAAK8qC,eAALx7B,EAAmB7G,UACnB,OAAAgH,EAAAzP,KAAK+qC,qBAALt7B,EAAyBhH,UACzB,OAAAiH,EAAA1P,KAAKgrC,gBAALt7B,EAAoBjH,UACpBzI,KAAKqqC,YAAY5hC,UACjBzI,KAAKsqC,cAAczoC,QACnBrB,EAASqB,OACX,CAKA,kBAAMkhC,eACJ,OAAAr9B,EAAA1F,KAAK4qC,cAALllC,EAAkB+C,UAClB,OAAA6G,EAAAtP,KAAK8qC,eAALx7B,EAAmB7G,UACnB,OAAAgH,EAAAzP,KAAK+qC,qBAALt7B,EAAyBhH,UACzB,OAAAiH,EAAA1P,KAAKgrC,gBAALt7B,EAAoBjH,gBACdzI,KAAKqqC,YAAYtH,eACvB/iC,KAAKsqC,cAAczoC,QACnBrB,EAASqB,OACX","x_google_ignoreList":[13]}
+{"version":3,"file":"index.iife.js","sources":["../src/core/vue-utils.ts","../src/core/component-info-sanitize.ts","../src/extension/frame-adapters/dom-context.ts","../src/extension/frame-adapters/react-fiber-dom.ts","../src/extension/frame-adapters/react-fiber-internal.ts","../src/extension/frame-adapters/react-adapter.ts","../src/extension/frame-adapters/angular-adapter.ts","../src/core/config.ts","../src/core/event-bus.ts","../src/core/utils.ts","../src/collector/custom-tracker.ts","../src/processor/sampler.ts","../src/processor/deduplicator.ts","../node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs","../src/processor/compressor.ts","../src/processor/processor-pipeline.ts","../src/processor/stages/sample-stage.ts","../src/processor/stages/deduplicate-stage.ts","../src/processor/stages/compress-stage.ts","../src/processor/data-processor.ts","../src/core/request.ts","../src/transport/retry-handler.ts","../src/transport/sender.ts","../src/core/capabilities.ts","../src/core/storage.ts","../src/transport/offline-storage.ts","../src/transport/event-queue.ts","../src/transport/flush-scheduler.ts","../src/transport/delivery-coordinator.ts","../src/transport/offline-recovery-manager.ts","../src/transport/batch-sender.ts","../src/extension/plugin-lifecycle.ts","../src/extension/plugin-manager.ts","../src/extension/behavior-analysis.ts","../src/extension/performance-alert-engine.ts","../src/extension/performance-cleanup-scheduler.ts","../src/extension/performance-metrics-aggregator.ts","../src/extension/performance-monitor-storage.ts","../src/extension/performance-monitor.ts","../src/panels/performance-panel.html.ts","../src/panels/offline-storage-viewer.html.ts","../src/core/panel-manager.ts","../src/runtime/tracker-event-enricher.ts","../src/runtime/tracker-event-bus-bridge.ts","../src/runtime/tracker-config-coordinator.ts","../src/collector/view-tracker.ts","../src/extension/vue-integration.ts","../src/extension/naive-ui-tracker.ts","../src/extension/frame-adapters/dom-data.ts","../src/extension/frame-adapters/ui-lib-heuristics.ts","../src/extension/frame-adapters/component-resolvers.ts","../src/extension/frame-adapters/resolve.ts","../src/collector/click-event-factory.ts","../src/collector/click-event-dispatcher.ts","../src/collector/touch-interaction-tracker.ts","../src/collector/click-tracker.ts","../src/collector/exposure-tracker.ts","../src/collector/input-tracker.ts","../src/collector/auto-tracker.ts","../src/collector/error-tracker.ts","../src/collector/performance-tracker.ts","../src/extension/session-replay-budget.ts","../src/extension/session-replay-interaction-lifecycle.ts","../src/extension/session-replay-store.ts","../src/extension/session-replay.ts","../src/runtime/tracker-feature-registry.ts","../src/runtime/tracker-event-dispatcher.ts","../src/extension/network-interceptor.ts","../src/extension/user-action-sequence.ts","../src/tracker.ts","../src/runtime/tracker-plugin-context.ts","../src/extension/vue-plugin.ts"],"sourcesContent":["/**\r\n * Vue3 相关工具函数\r\n */\r\n\r\n/**\r\n * Vue3 组件实例类型（简化版，避免依赖 Vue）\r\n */\r\ninterface VueComponentInstance {\r\n  $?: {\r\n    uid?: number;\r\n    type?: {\r\n      name?: string;\r\n      __name?: string;\r\n    };\r\n  };\r\n  $props?: Record<string, unknown>;\r\n  $attrs?: Record<string, unknown>;\r\n  $options?: {\r\n    name?: string;\r\n  };\r\n  __name?: string;\r\n  type?: {\r\n    name?: string;\r\n    __name?: string;\r\n  };\r\n  props?: Record<string, unknown>;\r\n  attrs?: Record<string, unknown>;\r\n  setupState?: Record<string, unknown>;\r\n  ctx?: Record<string, unknown>;\r\n}\r\n\r\n/**\r\n * 从 DOM 元素获取 Vue 组件实例\r\n * Vue3 在元素上存储组件实例的方式\r\n */\r\nexport function getVueComponentInstance(element: Element | null): VueComponentInstance | null {\r\n  if (!element || typeof window === 'undefined') {\r\n    return null;\r\n  }\r\n\r\n  // Vue3 内部属性：__vueParentComponent 或 __vue__\r\n  const vueInstance = (element as unknown as {\r\n    __vueParentComponent?: VueComponentInstance;\r\n    __vue__?: VueComponentInstance;\r\n  });\r\n\r\n  // 尝试多种方式获取组件实例\r\n  if (vueInstance.__vueParentComponent) {\r\n    return vueInstance.__vueParentComponent;\r\n  }\r\n\r\n  if (vueInstance.__vue__) {\r\n    return vueInstance.__vue__;\r\n  }\r\n\r\n  // 向上遍历父元素查找\r\n  let current: Element | null = element.parentElement;\r\n  let depth = 0;\r\n  const maxDepth = 5; // 限制查找深度，避免性能问题\r\n\r\n  while (current && depth < maxDepth) {\r\n    const parentVueInstance = (current as unknown as {\r\n      __vueParentComponent?: VueComponentInstance;\r\n      __vue__?: VueComponentInstance;\r\n    });\r\n\r\n    if (parentVueInstance.__vueParentComponent) {\r\n      return parentVueInstance.__vueParentComponent;\r\n    }\r\n\r\n    if (parentVueInstance.__vue__) {\r\n      return parentVueInstance.__vue__;\r\n    }\r\n\r\n    current = current.parentElement;\r\n    depth++;\r\n  }\r\n\r\n  return null;\r\n}\r\n\r\n/**\r\n * 从组件实例获取组件名称\r\n */\r\nexport function getComponentName(instance: VueComponentInstance | null): string | undefined {\r\n  if (!instance) {\r\n    return undefined;\r\n  }\r\n\r\n  // 尝试多种方式获取组件名\r\n  if (instance.$options?.name) {\r\n    return instance.$options.name;\r\n  }\r\n\r\n  if (instance.__name) {\r\n    return instance.__name;\r\n  }\r\n\r\n  if (instance.type?.name) {\r\n    return instance.type.name;\r\n  }\r\n\r\n  if (instance.type?.__name) {\r\n    return instance.type.__name;\r\n  }\r\n\r\n  if (instance.$?.type?.name) {\r\n    return instance.$.type.name;\r\n  }\r\n\r\n  if (instance.$?.type?.__name) {\r\n    return instance.$.type.__name;\r\n  }\r\n\r\n  return undefined;\r\n}\r\n\r\n/**\r\n * 从组件实例获取 props\r\n */\r\nexport function getComponentProps(instance: VueComponentInstance | null): Record<string, unknown> | undefined {\r\n  if (!instance) {\r\n    return undefined;\r\n  }\r\n\r\n  // Vue3 的 props 可能在 $props 或 props\r\n  if (instance.$props) {\r\n    return instance.$props;\r\n  }\r\n\r\n  if (instance.props) {\r\n    return instance.props;\r\n  }\r\n\r\n  return undefined;\r\n}\r\n\r\n/**\r\n * 从组件实例获取 attrs\r\n */\r\nexport function getComponentAttrs(instance: VueComponentInstance | null): Record<string, unknown> | undefined {\r\n  if (!instance) {\r\n    return undefined;\r\n  }\r\n\r\n  // Vue3 的 attrs 可能在 $attrs\r\n  if (instance.$attrs) {\r\n    return instance.$attrs;\r\n  }\r\n\r\n  if (instance.attrs) {\r\n    return instance.attrs;\r\n  }\r\n\r\n  return undefined;\r\n}\r\n\r\n/**\r\n * 从组件实例获取值（用于 input、select 等组件）\r\n */\r\nexport function getComponentValue(instance: VueComponentInstance | null): unknown {\r\n  if (!instance) {\r\n    return undefined;\r\n  }\r\n\r\n  // 尝试从 props 获取 value\r\n  const props = getComponentProps(instance);\r\n  if (props) {\r\n    if ('value' in props) {\r\n      return props.value;\r\n    }\r\n    if ('modelValue' in props) {\r\n      return props.modelValue;\r\n    }\r\n  }\r\n\r\n  // 尝试从 setupState 获取（Vue3 Composition API）\r\n  if (instance.setupState) {\r\n    if ('value' in instance.setupState) {\r\n      return instance.setupState.value;\r\n    }\r\n    if ('modelValue' in instance.setupState) {\r\n      return instance.setupState.modelValue;\r\n    }\r\n  }\r\n\r\n  // 尝试从 ctx 获取\r\n  if (instance.ctx) {\r\n    if ('value' in instance.ctx) {\r\n      return instance.ctx.value;\r\n    }\r\n    if ('modelValue' in instance.ctx) {\r\n      return instance.ctx.modelValue;\r\n    }\r\n  }\r\n\r\n  return undefined;\r\n}\r\n\r\n/**\r\n * 过滤敏感信息\r\n */\r\nconst SENSITIVE_KEYS = ['password', 'token', 'secret', 'key', 'auth', 'credential', 'pwd'];\r\n\r\nexport function filterSensitiveData(data: Record<string, unknown> | undefined): Record<string, unknown> | undefined {\r\n  if (!data) {\r\n    return undefined;\r\n  }\r\n\r\n  const filtered: Record<string, unknown> = {};\r\n\r\n  for (const [key, value] of Object.entries(data)) {\r\n    const lowerKey = key.toLowerCase();\r\n    // 检查是否为敏感字段：完全匹配或 key 包含敏感关键字（避免误判如 credentials）\r\n    // 注意：credentials 包含 credential，但不应该被当作敏感字段，应该递归处理其内部字段\r\n    // 大小写不敏感检测，使用原始 key 检查大写字母\r\n    const isSensitive = SENSITIVE_KEYS.some(sensitiveKey => {\r\n      const lowerSensitiveKey = sensitiveKey.toLowerCase();\r\n      // 完全匹配（大小写不敏感）\r\n      if (lowerKey === lowerSensitiveKey) return true;\r\n      \r\n      // 查找敏感关键字在 key 中的位置\r\n      const index = lowerKey.indexOf(lowerSensitiveKey);\r\n      if (index < 0) return false;\r\n      \r\n      // 检查敏感关键字前后的字符\r\n      const prevChar = index > 0 ? key[index - 1] : null;\r\n      const nextChar = index + lowerSensitiveKey.length < key.length \r\n        ? key[index + lowerSensitiveKey.length] \r\n        : null;\r\n      \r\n      // 以敏感关键字开头，且后面紧跟分隔符或大写字母（如 password-hash, passwordHash, Password）\r\n      if (index === 0 && nextChar !== null) {\r\n        if (nextChar === '-' || nextChar === '_' || /[A-Z]/.test(nextChar)) {\r\n          return true;\r\n        }\r\n      }\r\n      \r\n      // 以敏感关键字结尾，且前面有分隔符或大写字母（如 user-password, userPassword, SecretKey, apiKey）\r\n      if (index === lowerKey.length - lowerSensitiveKey.length && prevChar !== null) {\r\n        if (prevChar === '-' || prevChar === '_' || /[A-Z]/.test(prevChar)) {\r\n          return true;\r\n        }\r\n        // 检查敏感关键字在原始 key 中是否以大写字母开头（如 apiKey 中的 Key）\r\n        const originalSensitivePart = key.substring(index, index + lowerSensitiveKey.length);\r\n        if (/[A-Z]/.test(originalSensitivePart[0])) {\r\n          return true;\r\n        }\r\n      }\r\n      \r\n      // 敏感关键字在中间，前后都有分隔符或大写字母（如 access-token, accessToken）\r\n      if (index > 0 && index < lowerKey.length - lowerSensitiveKey.length) {\r\n        if (prevChar !== null && nextChar !== null) {\r\n          // 前面有分隔符或大写字母，且后面有分隔符或大写字母\r\n          if ((prevChar === '-' || prevChar === '_' || /[A-Z]/.test(prevChar)) &&\r\n              (nextChar === '-' || nextChar === '_' || /[A-Z]/.test(nextChar))) {\r\n            return true;\r\n          }\r\n          // 或者敏感关键字本身以大写字母开头（如 accessToken 中的 Token）\r\n          const originalSensitivePart = key.substring(index, index + lowerSensitiveKey.length);\r\n          if (/[A-Z]/.test(originalSensitivePart[0])) {\r\n            return true;\r\n          }\r\n        }\r\n      }\r\n      \r\n      return false;\r\n    });\r\n\r\n    if (isSensitive) {\r\n      // 敏感字段：只记录类型，不记录值\r\n      if (value === null) {\r\n        filtered[key] = '[null]';\r\n      } else if (value === undefined) {\r\n        // undefined 字段不包含在结果中\r\n        continue;\r\n      } else {\r\n        filtered[key] = `[${typeof value}]`;\r\n      }\r\n    } else if (typeof value === 'object' && value !== null && !Array.isArray(value)) {\r\n      // 递归处理对象（先递归处理，再决定是否保留）\r\n      const nestedFiltered = filterSensitiveData(value as Record<string, unknown>);\r\n      // 嵌套对象始终返回对象（即使为空），以保持结构\r\n      filtered[key] = nestedFiltered !== undefined ? nestedFiltered : {};\r\n    } else {\r\n      filtered[key] = value;\r\n    }\r\n  }\r\n\r\n  return filtered;\r\n}\r\n\r\n/**\r\n * 从 DOM 元素识别 naive-ui 组件\r\n * 通过类名识别（naive-ui 组件通常有 n- 前缀的类名）\r\n */\r\nexport function identifyNaiveUIComponent(element: Element | null): string | undefined {\r\n  if (!element) {\r\n    return undefined;\r\n  }\r\n\r\n  // 检查元素本身的类名\r\n  const className = element.className;\r\n  if (typeof className === 'string') {\r\n    const match = className.match(/\\bn-([a-z-]+)\\b/);\r\n    if (match) {\r\n      return `n-${match[1]}`;\r\n    }\r\n  }\r\n\r\n  // 检查元素标签名（某些 naive-ui 组件可能使用自定义标签）\r\n  const tagName = element.tagName?.toLowerCase();\r\n  if (tagName && tagName.startsWith('n-')) {\r\n    return tagName;\r\n  }\r\n\r\n  // 向上查找父元素\r\n  let current: Element | null = element.parentElement;\r\n  let depth = 0;\r\n  const maxDepth = 3;\r\n\r\n  while (current && depth < maxDepth) {\r\n    const parentClassName = current.className;\r\n    if (typeof parentClassName === 'string') {\r\n      const match = parentClassName.match(/\\bn-([a-z-]+)\\b/);\r\n      if (match) {\r\n        return `n-${match[1]}`;\r\n      }\r\n    }\r\n\r\n    const parentTagName = current.tagName?.toLowerCase();\r\n    if (parentTagName && parentTagName.startsWith('n-')) {\r\n      return parentTagName;\r\n    }\r\n\r\n    current = current.parentElement;\r\n    depth++;\r\n  }\r\n\r\n  return undefined;\r\n}\r\n","/**\r\n * ComponentInfo 字段脱敏与体积限制（React / Angular 等适配器共用）\r\n */\r\nimport type { TrackerConfig } from '@/types';\r\nimport { filterSensitiveData } from '@/core/vue-utils';\r\n\r\nexport interface ComponentInfoSanitizeLimits {\r\n  maxDepth: number;\r\n  maxKeys: number;\r\n  stripFunctions: boolean;\r\n}\r\n\r\nexport function mergeSanitizeLimits(\r\n  cfg: TrackerConfig['componentInfo'] | undefined\r\n): ComponentInfoSanitizeLimits {\r\n  return {\r\n    maxDepth: cfg?.maxDepth ?? 3,\r\n    maxKeys: cfg?.maxKeys ?? 32,\r\n    stripFunctions: cfg?.stripFunctions ?? true\r\n  };\r\n}\r\n\r\nfunction sanitizeValue(\r\n  val: unknown,\r\n  limits: ComponentInfoSanitizeLimits,\r\n  depth: number,\r\n  seen: WeakSet<object>\r\n): unknown {\r\n  if (depth > limits.maxDepth) {\r\n    return '[Truncated]';\r\n  }\r\n  if (val === null || val === undefined) {\r\n    return val;\r\n  }\r\n  const t = typeof val;\r\n  if (t === 'function') {\r\n    return limits.stripFunctions ? undefined : '[Function]';\r\n  }\r\n  if (t === 'symbol' || t === 'bigint') {\r\n    return String(val);\r\n  }\r\n  if (t !== 'object') {\r\n    return val;\r\n  }\r\n  if (seen.has(val as object)) {\r\n    return '[Circular]';\r\n  }\r\n  if (Array.isArray(val)) {\r\n    seen.add(val);\r\n    const cap = Math.min(val.length, limits.maxKeys);\r\n    const out: unknown[] = [];\r\n    for (let i = 0; i < cap; i++) {\r\n      out.push(sanitizeValue(val[i], limits, depth + 1, seen));\r\n    }\r\n    return out;\r\n  }\r\n  seen.add(val as object);\r\n  const obj = val as Record<string, unknown>;\r\n  const keys = Object.keys(obj).slice(0, limits.maxKeys);\r\n  const out: Record<string, unknown> = {};\r\n  for (const k of keys) {\r\n    out[k] = sanitizeValue(obj[k], limits, depth + 1, seen);\r\n  }\r\n  return out;\r\n}\r\n\r\nexport function sanitizeForComponentInfo(\r\n  raw: Record<string, unknown> | undefined,\r\n  limits: ComponentInfoSanitizeLimits\r\n): Record<string, unknown> | undefined {\r\n  if (!raw || Object.keys(raw).length === 0) {\r\n    return undefined;\r\n  }\r\n  let filtered: Record<string, unknown> | undefined;\r\n  try {\r\n    filtered = filterSensitiveData(raw);\r\n  } catch {\r\n    filtered = raw;\r\n  }\r\n  if (!filtered || Object.keys(filtered).length === 0) {\r\n    return undefined;\r\n  }\r\n  const seen = new WeakSet<object>();\r\n  return sanitizeValue(filtered, limits, 0, seen) as Record<string, unknown>;\r\n}\r\n","/**\r\n * DOM 事件目标归一化与父链遍历（React / Angular 适配器共用）\r\n */\r\n\r\nexport function normalizeToElement(target: EventTarget | null | undefined): Element | null {\r\n  if (target == null) {\r\n    return null;\r\n  }\r\n  if (target instanceof Element) {\r\n    return target;\r\n  }\r\n  if (target instanceof Text || target instanceof Comment) {\r\n    return target.parentElement;\r\n  }\r\n  return null;\r\n}\r\n\r\nexport function walkParentElements(\r\n  start: Element | null,\r\n  maxDepth: number,\r\n  visit: (el: Element, depth: number) => boolean | void\r\n): void {\r\n  let cur: Element | null = start;\r\n  let depth = 0;\r\n  while (cur != null && depth <= maxDepth) {\r\n    const stop = visit(cur, depth);\r\n    if (stop === false) {\r\n      return;\r\n    }\r\n    cur = cur.parentElement;\r\n    depth++;\r\n  }\r\n}\r\n","/**\r\n * 从 DOM 节点查找 React Fiber 引用（__reactFiber$*）\r\n */\r\n\r\nconst REACT_FIBER_KEY = /^__reactFiber\\$/;\r\n\r\nexport function findFiberKeyOnNode(node: Element): string | null {\r\n  try {\r\n    const names = new Set<string>();\r\n    for (const k of Object.keys(node)) {\r\n      names.add(k);\r\n    }\r\n    for (const k of Object.getOwnPropertyNames(node)) {\r\n      names.add(k);\r\n    }\r\n    for (const k of names) {\r\n      if (REACT_FIBER_KEY.test(k)) {\r\n        return k;\r\n      }\r\n    }\r\n  } catch {\r\n    /* ignore */\r\n  }\r\n  return null;\r\n}\r\n\r\nexport function getFiberFromElement(el: Element): unknown | null {\r\n  const key = findFiberKeyOnNode(el);\r\n  if (!key) {\r\n    return null;\r\n  }\r\n  try {\r\n    const v = (el as unknown as Record<string, unknown>)[key];\r\n    return v ?? null;\r\n  } catch {\r\n    return null;\r\n  }\r\n}\r\n\r\nexport function walkAncestorsForFiber(\r\n  start: Element,\r\n  maxDepth: number,\r\n  getFiber: (el: Element) => unknown | null\r\n): unknown | null {\r\n  let cur: Element | null = start;\r\n  let depth = 0;\r\n  while (cur != null && depth <= maxDepth) {\r\n    const fiber = getFiber(cur);\r\n    if (fiber) {\r\n      return fiber;\r\n    }\r\n    cur = cur.parentElement;\r\n    depth++;\r\n  }\r\n  return null;\r\n}\r\n","/**\r\n * React Fiber 内部解析（不依赖 react-dom 包，仅运行时探测 DOM 私有字段）\r\n */\r\nimport type { ComponentInfo } from '@/types';\r\nimport type { ComponentInfoSanitizeLimits } from '@/core/component-info-sanitize';\r\nimport { sanitizeForComponentInfo } from '@/core/component-info-sanitize';\r\nimport { getFiberFromElement, walkAncestorsForFiber } from './react-fiber-dom';\r\n\r\nexport type FiberLike = {\r\n  return?: unknown;\r\n  tag?: number;\r\n  type?: unknown;\r\n  elementType?: unknown;\r\n  memoizedProps?: unknown;\r\n  pendingProps?: unknown;\r\n};\r\n\r\nconst MAX_UNWRAP = 8;\r\n\r\ntype ComponentFn = (...args: unknown[]) => unknown;\r\n\r\nfunction unwrapComponentType(t: unknown, depth = 0): ComponentFn | string | null {\r\n  if (depth > MAX_UNWRAP) {\r\n    return null;\r\n  }\r\n  if (t == null) {\r\n    return null;\r\n  }\r\n  if (typeof t === 'function') {\r\n    return t as ComponentFn;\r\n  }\r\n  if (typeof t === 'string') {\r\n    return t;\r\n  }\r\n  if (typeof t === 'object' && t !== null) {\r\n    const o = t as Record<string, unknown>;\r\n    if (typeof o.type === 'function' || typeof o.type === 'string') {\r\n      return unwrapComponentType(o.type, depth + 1);\r\n    }\r\n    if (typeof o.render === 'function') {\r\n      return o.render as ComponentFn;\r\n    }\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction getComponentTypeFromFiber(f: FiberLike): ComponentFn | string | null {\r\n  return unwrapComponentType(f.type ?? f.elementType);\r\n}\r\n\r\nfunction isUserDefinedComponentFiber(f: FiberLike): boolean {\r\n  const comp = getComponentTypeFromFiber(f);\r\n  return typeof comp === 'function';\r\n}\r\n\r\nfunction nameFromFunction(fn: ComponentFn): string {\r\n  const named = fn as { displayName?: string; name?: string };\r\n  return named.displayName || named.name || 'Anonymous';\r\n}\r\n\r\nexport function walkFiberReturnChain(startFiber: unknown, maxFiberHops: number): FiberLike | null {\r\n  let current: unknown = startFiber;\r\n  let hops = 0;\r\n  while (current != null && hops < maxFiberHops) {\r\n    const f = current as FiberLike;\r\n    if (isUserDefinedComponentFiber(f)) {\r\n      return f;\r\n    }\r\n    current = f.return;\r\n    hops++;\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction extractPropsRaw(f: FiberLike): Record<string, unknown> {\r\n  const props = (f.memoizedProps ?? f.pendingProps) as Record<string, unknown> | undefined;\r\n  if (!props || typeof props !== 'object') {\r\n    return {};\r\n  }\r\n  const rest: Record<string, unknown> = { ...props };\r\n  delete rest.children;\r\n  delete rest.key;\r\n  delete rest.ref;\r\n  return rest;\r\n}\r\n\r\nexport interface ResolveFiberOptions {\r\n  maxFiberHops: number;\r\n  limits: ComponentInfoSanitizeLimits;\r\n}\r\n\r\nexport function resolveFiberToComponentInfo(startFiber: unknown, opts: ResolveFiberOptions): ComponentInfo | undefined {\r\n  try {\r\n    const selected = walkFiberReturnChain(startFiber, opts.maxFiberHops);\r\n    if (!selected) {\r\n      return undefined;\r\n    }\r\n    const comp = getComponentTypeFromFiber(selected);\r\n    if (typeof comp !== 'function') {\r\n      return undefined;\r\n    }\r\n    const name = nameFromFunction(comp);\r\n    const propsRaw = extractPropsRaw(selected);\r\n    const props = sanitizeForComponentInfo(propsRaw, opts.limits);\r\n    return {\r\n      componentName: name,\r\n      displayName: name,\r\n      props\r\n    };\r\n  } catch {\r\n    return undefined;\r\n  }\r\n}\r\n\r\nexport function resolveReactFiberFromDom(\r\n  startElement: Element,\r\n  maxDomWalkDepth: number,\r\n  maxFiberHops: number,\r\n  limits: ComponentInfoSanitizeLimits\r\n): ComponentInfo | undefined {\r\n  try {\r\n    const fiber = walkAncestorsForFiber(startElement, maxDomWalkDepth, getFiberFromElement);\r\n    if (!fiber) {\r\n      return undefined;\r\n    }\r\n    return resolveFiberToComponentInfo(fiber, { maxFiberHops, limits });\r\n  } catch {\r\n    return undefined;\r\n  }\r\n}\r\n","/**\r\n * React Fiber 适配（可选 peer：react-dom；运行时仅依赖 DOM 私有字段）\r\n */\r\nimport type { FrameAdapter, FrameAdapterContext, ComponentInfo } from '@/types';\r\nimport { mergeSanitizeLimits } from '@/core/component-info-sanitize';\r\nimport { normalizeToElement } from '@/extension/frame-adapters/dom-context';\r\nimport { resolveReactFiberFromDom } from '@/extension/frame-adapters/react-fiber-internal';\r\n\r\nexport interface ReactFrameAdapterOptions {\r\n  /** 数值越大越先执行，默认 80 */\r\n  priority?: number;\r\n  /** 沿 DOM 父链查找 Fiber 的最大深度，默认 15 */\r\n  maxDomWalkDepth?: number;\r\n  /** 沿 Fiber return 链的最大步数，默认 40 */\r\n  maxFiberHops?: number;\r\n}\r\n\r\nconst DEFAULT_PRIORITY = 80;\r\nconst DEFAULT_DOM_DEPTH = 15;\r\nconst DEFAULT_FIBER_HOPS = 40;\r\n\r\nexport function createReactFrameAdapter(options: ReactFrameAdapterOptions = {}): FrameAdapter {\r\n  const priority = options.priority ?? DEFAULT_PRIORITY;\r\n  const maxDomWalkDepth = options.maxDomWalkDepth ?? DEFAULT_DOM_DEPTH;\r\n  const maxFiberHops = options.maxFiberHops ?? DEFAULT_FIBER_HOPS;\r\n\r\n  return {\r\n    name: 'react-fiber',\r\n    priority,\r\n    resolveComponentInfo(ctx: FrameAdapterContext): ComponentInfo | undefined | null {\r\n      try {\r\n        const el = normalizeToElement(ctx.target);\r\n        if (!el) {\r\n          return undefined;\r\n        }\r\n        const limits = mergeSanitizeLimits(ctx.trackerConfig.componentInfo);\r\n        const info = resolveReactFiberFromDom(el, maxDomWalkDepth, maxFiberHops, limits);\r\n        if (!info) {\r\n          return undefined;\r\n        }\r\n        const nativeEventType = ctx.event?.type;\r\n        if (nativeEventType) {\r\n          info.eventMeta = {\r\n            ...info.eventMeta,\r\n            nativeEventType\r\n          };\r\n        }\r\n        return info;\r\n      } catch {\r\n        return undefined;\r\n      }\r\n    }\r\n  };\r\n}\r\n","/**\r\n * Angular Ivy 组件探测（可选 peer：@angular/core；推荐宿主注入 getComponent）\r\n */\r\nimport type { FrameAdapter, FrameAdapterContext, ComponentInfo } from '@/types';\r\nimport { mergeSanitizeLimits } from '@/core/component-info-sanitize';\r\nimport { sanitizeForComponentInfo } from '@/core/component-info-sanitize';\r\nimport { normalizeToElement } from '@/extension/frame-adapters/dom-context';\r\n\r\nexport interface AngularFrameAdapterOptions {\r\n  /** 从 @angular/core 注入的 getComponent，推荐 */\r\n  getComponent?: (element: Element) => unknown | null;\r\n  /** 数值越大越先执行，默认 79 */\r\n  priority?: number;\r\n  /** 沿 DOM 父链查找组件宿主的最大深度，默认 15 */\r\n  maxDomWalkDepth?: number;\r\n  /**\r\n   * 为 true 时，在未传 getComponent 时尝试 `globalThis.ng?.getComponent`（非保证，多见于开发构建）\r\n   */\r\n  useFallbackNgProbe?: boolean;\r\n}\r\n\r\nconst DEFAULT_PRIORITY = 79;\r\nconst DEFAULT_DOM_DEPTH = 15;\r\n\r\nfunction resolveGetComponent(\r\n  options: AngularFrameAdapterOptions\r\n): ((el: Element) => unknown | null) | null {\r\n  if (options.getComponent) {\r\n    return options.getComponent;\r\n  }\r\n  if (options.useFallbackNgProbe) {\r\n    const ng = (globalThis as { ng?: { getComponent?: (e: Element) => unknown } }).ng;\r\n    if (typeof ng?.getComponent === 'function') {\r\n      return (e: Element) => ng.getComponent!(e) ?? null;\r\n    }\r\n  }\r\n  return null;\r\n}\r\n\r\nfunction angularInstanceToComponentInfo(\r\n  inst: object,\r\n  limits: ReturnType<typeof mergeSanitizeLimits>\r\n): ComponentInfo {\r\n  const ctor = inst.constructor as { name?: string } | undefined;\r\n  const componentName =\r\n    ctor?.name && ctor.name !== 'Object' && ctor.name !== '' ? ctor.name : 'Unknown';\r\n  const keys = Object.keys(inst).filter(k => !k.startsWith('_')).slice(0, limits.maxKeys);\r\n  const raw: Record<string, unknown> = {};\r\n  for (const k of keys) {\r\n    raw[k] = (inst as Record<string, unknown>)[k];\r\n  }\r\n  const props = sanitizeForComponentInfo(raw, limits);\r\n  return {\r\n    componentName,\r\n    displayName: componentName,\r\n    props\r\n  };\r\n}\r\n\r\nexport function createAngularFrameAdapter(options: AngularFrameAdapterOptions = {}): FrameAdapter {\r\n  const priority = options.priority ?? DEFAULT_PRIORITY;\r\n  const maxDomWalkDepth = options.maxDomWalkDepth ?? DEFAULT_DOM_DEPTH;\r\n\r\n  return {\r\n    name: 'angular-ivy',\r\n    priority,\r\n    resolveComponentInfo(ctx: FrameAdapterContext): ComponentInfo | undefined | null {\r\n      try {\r\n        const el = normalizeToElement(ctx.target);\r\n        if (!el) {\r\n          return undefined;\r\n        }\r\n        const resolver = resolveGetComponent(options);\r\n        if (!resolver) {\r\n          return undefined;\r\n        }\r\n        const limits = mergeSanitizeLimits(ctx.trackerConfig.componentInfo);\r\n        let cur: Element | null = el;\r\n        let depth = 0;\r\n        while (cur != null && depth <= maxDomWalkDepth) {\r\n          const inst = resolver(cur);\r\n          if (inst != null && typeof inst === 'object') {\r\n            const info = angularInstanceToComponentInfo(inst, limits);\r\n            const nativeEventType = ctx.event?.type;\r\n            if (nativeEventType) {\r\n              info.eventMeta = {\r\n                ...info.eventMeta,\r\n                nativeEventType\r\n              };\r\n            }\r\n            return info;\r\n          }\r\n          cur = cur.parentElement;\r\n          depth++;\r\n        }\r\n        return undefined;\r\n      } catch {\r\n        return undefined;\r\n      }\r\n    }\r\n  };\r\n}\r\n","/**\r\n * 配置管理\r\n */\r\nimport type { TrackerConfig } from '@/types';\r\n\r\n/**\r\n * 默认配置\r\n */\r\nconst defaultConfig: Required<Omit<TrackerConfig, 'beforeSend' | 'afterSend' | 'onError' | 'customProperties' | 'serverUrl' | 'sessionReplay' | 'frameAdapters' | 'componentInfo' | 'angularGetComponent' | 'maxSessionReplaySnapshots'>> & {\n  customProperties: Record<string, unknown>;\r\n  serverUrl?: string;\r\n} = {\r\n  appId: '',\r\n  serverUrl: undefined,\r\n  enableAutoTrack: true,\r\n  enableErrorTrack: true,\r\n  enablePerformanceTrack: false,\r\n  enableSessionReplay: false,\r\n  batchSize: 10,\r\n  batchWait: 5000,\r\n  sampleRate: 1.0,\r\n  enableOfflineStorage: true,\r\n  maxOfflineStorageSize: 1000,\r\n  maxRetries: 3,\r\n  enableCompression: false,\r\n  userId: '',\r\n  deviceId: '',\r\n  customProperties: {},\r\n  enableVueTracking: false,\r\n  enableNaiveUITracking: false,\r\n  componentInfoDepth: 3,\r\n  extractComponentProps: true,\r\n  extractComponentValue: true,\r\n  enableReactTracking: false,\r\n  enableAngularTracking: false\r\n};\r\n\r\n/**\r\n * 配置管理器\r\n */\r\nclass ConfigManager {\r\n  private config: TrackerConfig;\r\n\r\n  constructor(config: TrackerConfig) {\r\n    this.config = {\r\n      ...defaultConfig,\r\n      ...config,\r\n      customProperties: {\r\n        ...defaultConfig.customProperties,\r\n        ...config.customProperties\r\n      }\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 获取配置\r\n   */\r\n  get<K extends keyof TrackerConfig>(key: K): TrackerConfig[K] {\r\n    return this.config[key];\r\n  }\r\n\r\n  /**\r\n   * 获取所有配置\r\n   */\r\n  getAll(): TrackerConfig {\r\n    return { ...this.config };\r\n  }\r\n\r\n  /**\r\n   * 更新配置\r\n   */\r\n  set<K extends keyof TrackerConfig>(key: K, value: TrackerConfig[K]): void {\r\n    this.config[key] = value;\r\n  }\r\n\r\n  /**\r\n   * 批量更新配置\r\n   */\r\n  update(updates: Partial<TrackerConfig>): void {\r\n    this.config = {\r\n      ...this.config,\r\n      ...updates,\r\n      customProperties: {\r\n        ...this.config.customProperties,\r\n        ...(updates.customProperties || {})\r\n      }\r\n    };\r\n  }\r\n}\r\n\r\nexport default ConfigManager;\r\n\r\n","/**\r\n * 事件总线\r\n */\r\n\r\ntype EventCallback = (...args: unknown[]) => void;\r\n\r\nclass EventBus {\r\n  private events: Map<string, EventCallback[]> = new Map();\r\n\r\n  /**\r\n   * 订阅事件\r\n   */\r\n  on(event: string, callback: EventCallback): void {\r\n    if (!this.events.has(event)) {\r\n      this.events.set(event, []);\r\n    }\r\n    this.events.get(event)!.push(callback);\r\n  }\r\n\r\n  /**\r\n   * 取消订阅\r\n   */\r\n  off(event: string, callback?: EventCallback): void {\r\n    if (!this.events.has(event)) {\r\n      return;\r\n    }\r\n\r\n    if (!callback) {\r\n      this.events.delete(event);\r\n      return;\r\n    }\r\n\r\n    const callbacks = this.events.get(event)!;\r\n    const index = callbacks.indexOf(callback);\r\n    if (index > -1) {\r\n      callbacks.splice(index, 1);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 触发事件\r\n   */\r\n  emit(event: string, ...args: unknown[]): void {\r\n    if (!this.events.has(event)) {\r\n      return;\r\n    }\r\n\r\n    const callbacks = this.events.get(event)!;\r\n    callbacks.forEach(callback => {\r\n      try {\r\n        callback(...args);\r\n      } catch (error) {\r\n        console.error(`EventBus: Error in callback for event \"${event}\":`, error);\r\n      }\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 一次性订阅\r\n   */\r\n  once(event: string, callback: EventCallback): void {\r\n    const wrapper = (...args: unknown[]) => {\r\n      callback(...args);\r\n      this.off(event, wrapper);\r\n    };\r\n    this.on(event, wrapper);\r\n  }\r\n\r\n  /**\r\n   * 清除所有事件\r\n   */\r\n  clear(): void {\r\n    this.events.clear();\r\n  }\r\n}\r\n\r\nexport const eventBus = new EventBus();\r\n\r\n","/**\r\n * 工具函数\r\n */\r\n\r\n/**\r\n * 生成唯一ID\r\n */\r\nexport function generateId(): string {\r\n  return `${Date.now()}-${Math.random().toString(36).substring(2, 9)}`;\r\n}\r\n\r\n/**\r\n * 获取设备指纹\r\n */\r\nexport function getDeviceId(): string {\r\n  if (typeof window === 'undefined') {\r\n    return generateId();\r\n  }\r\n\r\n  // 检查 localStorage 是否可用\r\n  if (typeof localStorage === 'undefined' || !localStorage) {\r\n    return generateId();\r\n  }\r\n\r\n  const key = '__tracker_device_id__';\r\n  let deviceId: string | null = null;\r\n  \r\n  try {\r\n    deviceId = localStorage.getItem(key);\r\n  } catch (e) {\r\n    // localStorage可能被禁用\r\n    return generateId();\r\n  }\r\n\r\n  if (!deviceId) {\r\n    deviceId = generateId();\r\n    try {\r\n      localStorage.setItem(key, deviceId);\r\n    } catch (e) {\r\n      // localStorage可能被禁用\r\n    }\r\n  }\r\n\r\n  return deviceId;\r\n}\r\n\r\n/**\r\n * 获取会话ID\r\n */\r\nexport function getSessionId(): string {\r\n  if (typeof window === 'undefined') {\r\n    return generateId();\r\n  }\r\n\r\n  // 检查 sessionStorage 是否可用\r\n  if (typeof sessionStorage === 'undefined' || !sessionStorage) {\r\n    return generateId();\r\n  }\r\n\r\n  const key = '__tracker_session_id__';\r\n  let sessionId: string | null = null;\r\n  \r\n  try {\r\n    sessionId = sessionStorage.getItem(key);\r\n  } catch (e) {\r\n    // sessionStorage可能被禁用\r\n    return generateId();\r\n  }\r\n\r\n  if (!sessionId) {\r\n    sessionId = generateId();\r\n    try {\r\n      sessionStorage.setItem(key, sessionId);\r\n    } catch (e) {\r\n      // sessionStorage可能被禁用\r\n    }\r\n  }\r\n\r\n  return sessionId;\r\n}\r\n\r\n/**\r\n * 获取当前URL\r\n */\r\nexport function getCurrentUrl(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return window.location.href;\r\n}\r\n\r\n/**\r\n * 检查当前窗口是否是SDK内部面板\r\n */\r\nexport function isTrackerInternalPanel(): boolean {\r\n  if (typeof window === 'undefined') {\r\n    return false;\r\n  }\r\n  return !!(window as unknown as { __trackerInternalPanel?: boolean }).__trackerInternalPanel;\r\n}\r\n\r\n/**\r\n * 获取页面标题\r\n */\r\nexport function getPageTitle(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return document.title || '';\r\n}\r\n\r\n/**\r\n * 获取Referrer\r\n */\r\nexport function getReferrer(): string {\r\n  if (typeof window === 'undefined') {\r\n    return '';\r\n  }\r\n  return document.referrer || '';\r\n}\r\n\r\n/**\r\n * 防抖函数\r\n */\r\nexport function debounce<T extends (...args: unknown[]) => void>(\r\n  func: T,\r\n  wait: number\r\n): (...args: Parameters<T>) => void {\r\n  let timeout: ReturnType<typeof setTimeout> | null = null;\r\n\r\n  return function executedFunction(...args: Parameters<T>) {\r\n    const later = () => {\r\n      timeout = null;\r\n      func(...args);\r\n    };\r\n\r\n    if (timeout) {\r\n      clearTimeout(timeout);\r\n    }\r\n    timeout = setTimeout(later, wait);\r\n  };\r\n}\r\n\r\n/**\r\n * 节流函数\r\n */\r\nexport function throttle<T extends (...args: unknown[]) => void>(\r\n  func: T,\r\n  wait: number\r\n): (...args: Parameters<T>) => void {\r\n  let timeout: ReturnType<typeof setTimeout> | null = null;\r\n  let previous = 0;\r\n\r\n  return function executedFunction(...args: Parameters<T>) {\r\n    const now = Date.now();\r\n    const remaining = wait - (now - previous);\r\n\r\n    if (remaining <= 0 || remaining > wait) {\r\n      if (timeout) {\r\n        clearTimeout(timeout);\r\n        timeout = null;\r\n      }\r\n      previous = now;\r\n      func(...args);\r\n    } else if (!timeout) {\r\n      timeout = setTimeout(() => {\r\n        previous = Date.now();\r\n        timeout = null;\r\n        func(...args);\r\n      }, remaining);\r\n    }\r\n  };\r\n}\r\n\r\n/**\r\n * 深拷贝\r\n * 支持循环引用检测\r\n */\r\nexport function deepClone<T>(obj: T): T {\r\n  return deepCloneWithRefs(obj, new WeakSet());\r\n}\r\n\r\n/**\r\n * 深拷贝（内部实现，带循环引用检测）\r\n */\r\nfunction deepCloneWithRefs<T>(obj: T, visited: WeakSet<object>): T {\r\n  if (obj === null || typeof obj !== 'object') {\r\n    return obj;\r\n  }\r\n\r\n  // 检测循环引用\r\n  if (visited.has(obj as object)) {\r\n    // 遇到循环引用，返回一个标记对象以避免无限递归\r\n    // 注意：这可能会改变数据结构，但在实际使用中循环引用很少见\r\n    // 调用方应该避免在事件对象中创建循环引用\r\n    // 如果确实需要处理循环引用，可以考虑使用 JSON.parse(JSON.stringify(obj)) 的方式\r\n    return { __circular: true } as unknown as T;\r\n  }\r\n\r\n  if (obj instanceof Date) {\r\n    return new Date(obj.getTime()) as unknown as T;\r\n  }\r\n\r\n  if (obj instanceof Array) {\r\n    visited.add(obj);\r\n    const cloned = obj.map(item => deepCloneWithRefs(item, visited)) as unknown as T;\r\n    visited.delete(obj);\r\n    return cloned;\r\n  }\r\n\r\n  if (typeof obj === 'object') {\r\n    visited.add(obj);\r\n    const clonedObj = {} as Record<string, unknown>;\r\n    for (const key in obj) {\r\n      if (Object.prototype.hasOwnProperty.call(obj, key)) {\r\n        clonedObj[key] = deepCloneWithRefs((obj as Record<string, unknown>)[key], visited);\r\n      }\r\n    }\r\n    visited.delete(obj);\r\n    return clonedObj as T;\r\n  }\r\n\r\n  return obj;\r\n}\r\n\r\n/**\r\n * 判断是否为浏览器环境\r\n */\r\nexport function isBrowser(): boolean {\r\n  return typeof window !== 'undefined' && typeof document !== 'undefined';\r\n}\r\n\r\n/**\r\n * 判断是否为Node环境\r\n */\r\nexport function isNode(): boolean {\n  return typeof process !== 'undefined' && process.versions != null && process.versions.node != null;\n}\n\n/**\n * 归一化 className，兼容 HTMLElement 与 SVGElement\n */\nexport function normalizeClassName(className: unknown): string {\n  if (typeof className === 'string') {\n    return className;\n  }\n\n  if (\n    className &&\n    typeof className === 'object' &&\n    'baseVal' in (className as Record<string, unknown>)\n  ) {\n    const baseVal = (className as { baseVal?: unknown }).baseVal;\n    return typeof baseVal === 'string' ? baseVal : '';\n  }\n\n  if (className == null) {\n    return '';\n  }\n\n  try {\n    const value = String(className);\n    return value === '[object SVGAnimatedString]' ? '' : value;\n  } catch {\n    return '';\n  }\n}\n\n/**\n * 获取元素路径\n */\nexport function getElementPath(element: Element | null): string {\n  if (!element) {\n    return '';\n  }\r\n\r\n  const path: string[] = [];\r\n\r\n  while (element && element.nodeType === Node.ELEMENT_NODE) {\r\n    let selector = element.nodeName.toLowerCase();\r\n\r\n    if (element.id) {\r\n      selector += `#${element.id}`;\r\n      path.unshift(selector);\r\n      break;\r\n    }\r\n\r\n    const normalizedClassName = normalizeClassName((element as Element & { className?: unknown }).className);\n    if (normalizedClassName) {\n      const classes = normalizedClassName\n        .trim()\n        .split(/\\s+/)\n        .filter(cls => cls.length > 0)\n        .join('.');\n      if (classes) {\n        selector += `.${classes}`;\r\n      }\r\n    }\r\n\r\n    let sibling = element;\r\n    let nth = 1;\r\n    while ((sibling = sibling.previousElementSibling as Element)) {\r\n      if (sibling.nodeName === element.nodeName) {\r\n        nth++;\r\n      }\r\n    }\r\n\r\n    if (nth > 1) {\r\n      selector += `:nth-of-type(${nth})`;\r\n    }\r\n\r\n    path.unshift(selector);\r\n    element = element.parentElement;\r\n  }\r\n\r\n  return path.join(' > ');\r\n}\r\n\r\n/**\r\n * 获取元素信息\r\n */\r\nexport function getElementInfo(element: Element | null): {\r\n  tagName?: string;\r\n  id?: string;\r\n  className?: string;\r\n  text?: string;\r\n} {\r\n  if (!element) {\r\n    return {};\r\n  }\r\n\r\n  return {\n    tagName: element.tagName.toLowerCase(),\n    id: element.id || undefined,\n    className: normalizeClassName((element as Element & { className?: unknown }).className) || undefined,\n    text: element.textContent?.trim().substring(0, 100) || undefined\n  };\n}\n\r\n","/**\r\n * 自定义埋点采集器\r\n */\r\nimport type { CustomEvent } from '@/types';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\nclass CustomTracker {\r\n  /**\r\n   * 追踪自定义事件\r\n   */\r\n  track(eventName: string, properties?: Record<string, unknown>): CustomEvent {\r\n    const customEvent: CustomEvent = {\r\n      type: 'custom',\r\n      name: 'custom',\r\n      eventName,\r\n      timestamp: Date.now(),\r\n      url: getCurrentUrl(),\r\n      title: getPageTitle(),\r\n      properties\r\n    };\r\n\r\n    return customEvent;\r\n  }\r\n}\r\n\r\nexport default CustomTracker;\r\n\r\n","/**\r\n * 采样器\r\n */\r\n\r\nclass Sampler {\r\n  /**\r\n   * 判断是否采样\r\n   * @param sampleRate 采样率（0-1）\r\n   */\r\n  shouldSample(sampleRate: number): boolean {\r\n    if (sampleRate >= 1) {\r\n      return true;\r\n    }\r\n    if (sampleRate <= 0) {\r\n      return false;\r\n    }\r\n    return Math.random() < sampleRate;\r\n  }\r\n\r\n  /**\r\n   * 判断关键事件是否应该采样（关键事件总是采样）\r\n   */\r\n  shouldSampleCritical(isCritical: boolean, sampleRate: number): boolean {\r\n    if (isCritical) {\r\n      return true;\r\n    }\r\n    return this.shouldSample(sampleRate);\r\n  }\r\n}\r\n\r\nexport default Sampler;\r\n\r\n","/**\r\n * 去重器\r\n */\r\nimport type { TrackerEvent } from '@/types';\r\n\r\nclass Deduplicator {\r\n  private eventCache: Map<string, number> = new Map();\r\n  // 不同事件类型的去重时间窗口\r\n  private cacheTimeouts: Record<string, number> = {\r\n    click: 10000, // 点击事件：10秒\r\n    exposure: 30000, // 曝光事件：30秒\r\n    error: 5000, // 错误事件：5秒（ErrorTracker已有防抖，这里作为额外保护）\r\n    performance: 60000, // 性能事件：60秒\r\n    pageview: 10000, // 页面浏览事件：10秒（ViewTracker已有保护，这里作为额外保护）\r\n    input: 3000, // 输入事件：3秒\r\n    custom: 1000 // 自定义事件：1秒（api-request和api-response使用动态时间窗口）\r\n  };\r\n  private defaultCacheTimeout: number = 60000; // 默认1分钟\r\n\r\n  /**\r\n   * 判断事件是否重复\r\n   */\r\n  isDuplicate(event: TrackerEvent): boolean {\r\n    const key = this.getEventKey(event);\r\n    const lastTime = this.eventCache.get(key);\r\n    const now = Date.now();\r\n\r\n    // 获取该事件类型的去重时间窗口\r\n    let cacheTimeout = this.cacheTimeouts[event.type] || this.defaultCacheTimeout;\r\n    \r\n    // 针对api-request和api-response使用更长的去重时间窗口（5秒）\r\n    if (event.type === 'custom' && 'eventName' in event) {\r\n      const eventName = event.eventName;\r\n      if (eventName === 'api-request' || eventName === 'api-response') {\r\n        cacheTimeout = 5000; // 5秒\r\n      }\r\n    }\r\n\r\n    if (lastTime && now - lastTime < cacheTimeout) {\r\n      return true;\r\n    }\r\n\r\n    this.eventCache.set(key, now);\r\n    this.cleanExpiredCache(now);\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 获取事件唯一标识\r\n   */\r\n  private getEventKey(event: TrackerEvent): string {\r\n    const parts: string[] = [event.type, event.name, event.url];\r\n\r\n    if (event.type === 'click' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n      // 使用位置容差，相同按钮的多次点击（位置相近）视为重复\r\n      // 将位置四舍五入到10像素的倍数，实现容差（±5像素内视为相同位置）\r\n      if ('position' in event && event.position) {\r\n        const tolerance = 10;\r\n        const x = Math.floor(event.position.x / tolerance) * tolerance;\r\n        const y = Math.floor(event.position.y / tolerance) * tolerance;\r\n        parts.push(`${x}-${y}`);\r\n      }\r\n    } else if (event.type === 'exposure' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n    } else if (event.type === 'input' && 'elementPath' in event) {\r\n      parts.push(event.elementPath || '');\r\n      // 输入事件：使用 elementPath + 输入内容hash + 输入内容长度作为去重key\r\n      // 如果内容相同，视为重复输入\r\n      if ('value' in event && event.value !== undefined && event.value !== null) {\r\n        // 使用输入值的前10个字符作为hash（避免过长）\r\n        const valueStr = String(event.value);\r\n        const valueHash = valueStr.length > 10 ? valueStr.substring(0, 10) : valueStr;\r\n        parts.push(this.simpleHash(valueHash));\r\n      } else if ('valueLength' in event && event.valueLength !== undefined) {\r\n        // 如果没有value（敏感字段），使用长度\r\n        parts.push(String(event.valueLength));\r\n      }\r\n      // 如果是敏感字段，使用 isSensitive 标记\r\n      if ('isSensitive' in event && event.isSensitive) {\r\n        parts.push('sensitive');\r\n      }\r\n    } else if (event.type === 'error' && 'message' in event) {\r\n      parts.push(event.message);\r\n      // 添加文件名和行号增加唯一性\r\n      if ('filename' in event && event.filename) {\r\n        parts.push(event.filename);\r\n      }\r\n      if ('lineno' in event && event.lineno) {\r\n        parts.push(String(event.lineno));\r\n      }\r\n      if ('colno' in event && event.colno) {\r\n        parts.push(String(event.colno));\r\n      }\r\n      // 资源错误：添加 resourceUrl\r\n      if ('resourceUrl' in event && event.resourceUrl) {\r\n        parts.push(event.resourceUrl);\r\n      }\r\n    } else if (event.type === 'performance' && 'metricType' in event) {\r\n      // 性能事件：根据不同类型使用不同的唯一标识\r\n      parts.push(event.metricType);\r\n      if (event.metricType === 'resource' && 'metrics' in event && event.metrics) {\r\n        // 资源性能事件：使用 resourceUrl\r\n        const resourceUrl = (event.metrics as Record<string, unknown>).resourceUrl;\r\n        if (resourceUrl) {\r\n          parts.push(String(resourceUrl));\r\n        }\r\n      } else if (event.metricType === 'longtask' && 'metrics' in event && event.metrics) {\r\n        // 长任务事件：使用 startTime 和 duration\r\n        const metrics = event.metrics as Record<string, unknown>;\r\n        if (metrics.startTime !== undefined && metrics.duration !== undefined) {\r\n          parts.push(`${metrics.startTime}-${metrics.duration}`);\r\n        }\r\n      } else if (event.metricType === 'navigation') {\r\n        // 导航性能事件：每个页面只记录一次，使用 URL\r\n        // URL 已经在 parts 中，不需要额外添加\r\n      }\r\n    } else if (event.type === 'custom' && 'eventName' in event) {\r\n      parts.push(event.eventName);\r\n      \r\n      // 针对api-request和api-response使用关键字段生成去重key，避免timestamp等变化字段影响去重\r\n      if (event.eventName === 'api-request' || event.eventName === 'api-response') {\r\n        if (event.properties) {\r\n          const props = event.properties as Record<string, unknown>;\r\n          // 使用关键字段：url、method、fullUrl（排除timestamp、headers等变化字段）\r\n          const apiUrl = props.url ? String(props.url) : '';\r\n          const method = props.method ? String(props.method) : '';\r\n          const fullUrl = props.fullUrl ? String(props.fullUrl) : '';\r\n          \r\n          if (apiUrl || method || fullUrl) {\r\n            // 优先使用fullUrl，如果没有则使用url+method组合\r\n            parts.push(fullUrl || `${method}:${apiUrl}`);\r\n          } else {\r\n            // 如果没有关键字段，回退到原来的逻辑\r\n            try {\r\n              const propsStr = JSON.stringify(event.properties);\r\n              parts.push(propsStr.substring(0, 100));\r\n            } catch {\r\n              parts.push(String(Object.keys(event.properties).length));\r\n            }\r\n          }\r\n        }\r\n      } else {\r\n        // 其他custom事件使用原来的逻辑\r\n        if (event.properties) {\r\n          try {\r\n            const propsStr = JSON.stringify(event.properties);\r\n            // 使用前100个字符作为hash，避免过长\r\n            parts.push(propsStr.substring(0, 100));\r\n          } catch {\r\n            // JSON序列化失败，使用长度\r\n            parts.push(String(Object.keys(event.properties).length));\r\n          }\r\n        }\r\n      }\r\n    } else if (event.type === 'pageview') {\r\n      // 页面浏览事件使用时间窗口（10秒内视为重复）\r\n      const timeWindow = Math.floor(event.timestamp / 10000);\r\n      parts.push(String(timeWindow));\r\n    }\r\n\r\n    return parts.join('|');\r\n  }\r\n\r\n  /**\r\n   * 简单的字符串hash函数（用于输入值去重）\r\n   */\r\n  private simpleHash(str: string): string {\r\n    let hash = 0;\r\n    for (let i = 0; i < str.length; i++) {\r\n      const char = str.charCodeAt(i);\r\n      hash = ((hash << 5) - hash) + char;\r\n      hash = hash & hash; // 转换为32位整数\r\n    }\r\n    // 返回正数的hash值（前8位字符）\r\n    return Math.abs(hash).toString(36).substring(0, 8);\r\n  }\r\n\r\n  /**\r\n   * 清理过期缓存\r\n   */\r\n  private cleanExpiredCache(now: number): void {\r\n    // 使用最大时间窗口来清理缓存（避免频繁清理）\r\n    const timeoutValues = Object.values(this.cacheTimeouts);\r\n    const maxTimeout = timeoutValues.length > 0\r\n      ? Math.max(...timeoutValues, this.defaultCacheTimeout)\r\n      : this.defaultCacheTimeout;\r\n    const expireTime = maxTimeout * 2; // 清理超过最大时间窗口2倍的缓存\r\n\r\n    for (const [key, time] of this.eventCache.entries()) {\r\n      if (now - time > expireTime) {\r\n        this.eventCache.delete(key);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清空缓存\r\n   */\r\n  clear(): void {\r\n    this.eventCache.clear();\r\n  }\r\n}\r\n\r\nexport default Deduplicator;\r\n\r\n","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED          = 1;\n//const Z_HUFFMAN_ONLY      = 2;\n//const Z_RLE               = 3;\nconst Z_FIXED$1               = 4;\n//const Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY              = 0;\nconst Z_TEXT                = 1;\n//const Z_ASCII             = 1; // = Z_TEXT\nconst Z_UNKNOWN$1             = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES    = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1    = 3;\nconst MAX_MATCH$1    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1      = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1       = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1       = 30;\n/* number of distance codes */\n\nconst BL_CODES$1      = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1     = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK   = 256;\n/* end of block literal code */\n\nconst REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits =   /* extra bits for each length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits =   /* extra bits for each distance code */\n  new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits =  /* extra bits for each bit length code */\n  new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n  new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree  = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree  = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code    = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code  = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length   = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist     = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n  let res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nconst gen_bitlen = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n\n  const tree            = desc.dyn_tree;\n  const max_code        = desc.max_code;\n  const stree           = desc.stat_desc.static_tree;\n  const has_stree       = desc.stat_desc.has_stree;\n  const extra           = desc.stat_desc.extra_bits;\n  const base            = desc.stat_desc.extra_base;\n  const max_length      = desc.stat_desc.max_length;\n  let h;              /* heap index */\n  let n, m;           /* iterate over the tree elements */\n  let bits;           /* bit length */\n  let xbits;          /* extra bits */\n  let f;              /* frequency */\n  let overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Tracev((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n\n  const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n  let code = 0;              /* running code value */\n  let bits;                  /* bit index */\n  let n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS$1; bits++) {\n    code = (code + bl_count[bits - 1]) << 1;\n    next_code[bits] = code;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    let len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n  let n;        /* iterates over tree elements */\n  let bits;     /* bit counter */\n  let length;   /* length value */\n  let code;     /* code value */\n  let dist;     /* distance index */\n  const bl_count = new Array(MAX_BITS$1 + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES$1; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS$1; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES$1; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES$1, MAX_BITS$1);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES$1, MAX_BL_BITS);\n\n  //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n  let n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES$1;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES$1;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n  const _n2 = n * 2;\n  const _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n\n  const v = s.heap[k];\n  let j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n\n  let dist;           /* distance of matched string */\n  let lc;             /* match length or unmatched char (if dist == 0) */\n  let sx = 0;         /* running index in sym_buf */\n  let code;           /* the code to send */\n  let extra;          /* number of extra bits to send */\n\n  if (s.sym_next !== 0) {\n    do {\n      dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n      dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n      lc = s.pending_buf[s.sym_buf + sx++];\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and sym_buf is ok: */\n      //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n    } while (sx < s.sym_next);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n\n  const tree     = desc.dyn_tree;\n  const stree    = desc.stat_desc.static_tree;\n  const has_stree = desc.stat_desc.has_stree;\n  const elems    = desc.stat_desc.elems;\n  let n, m;          /* iterate over heap elements */\n  let max_code = -1; /* largest code with non zero frequency */\n  let node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE$1;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n\n  let n;                     /* iterates over all tree elements */\n  let prevlen = -1;          /* last emitted length */\n  let curlen;                /* length of current code */\n\n  let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  let count = 0;             /* repeat count of the current code */\n  let max_count = 7;         /* max repeat count */\n  let min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n  let max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n  let rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"block list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n  /* block_mask is the bit mask of block-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  let block_mask = 0xf3ffc07f;\n  let n;\n\n  /* Check for non-textual (\"block-listed\") bytes. */\n  for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n    if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"allow-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS$1; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"block-listed\" or \"allow-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  bi_windup(s);        /* align on byte boundary */\n  put_short(s, stored_len);\n  put_short(s, ~stored_len);\n  if (stored_len) {\n    s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n  }\n  s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n\n  let opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  let max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN$1) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->sym_next / 3));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block$1(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n  s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n  s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n  return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1  = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1  = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n  let s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n  let c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n  const t = crcTable;\n  const end = pos + len;\n\n  crc ^= -1;\n\n  for (let i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  Z_MEM_ERROR:       -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n  Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n  Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n  Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n  Z_UNKNOWN,\n  Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS      = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES       = 30;\n/* number of distance codes */\nconst BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE    =  42;    /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE    =  57;    /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE   =  69;    /* gzip extra block -> NAME_STATE */\nconst NAME_STATE    =  73;    /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE =  91;    /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE    = 103;    /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE    = 113;    /* deflate -> FINISH_STATE */\nconst FINISH_STATE  = 666;    /* stream complete */\n\nconst BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE     = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n  strm.msg = messages[errorCode];\n  return errorCode;\n};\n\nconst rank = (f) => {\n  return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n  let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n  let n, m;\n  let p;\n  let wsize = s.w_size;\n\n  n = s.hash_size;\n  p = n;\n  do {\n    m = s.head[--p];\n    s.head[p] = (m >= wsize ? m - wsize : 0);\n  } while (--n);\n  n = wsize;\n//#ifndef FASTEST\n  p = n;\n  do {\n    m = s.prev[--p];\n    s.prev[p] = (m >= wsize ? m - wsize : 0);\n    /* If n is not on any hash chain, prev[n] is garbage but\n     * its value will never be used.\n     */\n  } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n  const s = strm.state;\n\n  //_tr_flush_bits(s);\n  let len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n  strm.next_out  += len;\n  s.pending_out  += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending      -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n};\n\n\nconst flush_block_only = (s, last) => {\n  _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n  s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n  //  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n  let len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32_1(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32_1(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n  let chain_length = s.max_chain_length;      /* max hash chain length */\n  let scan = s.strstart; /* current string */\n  let match;                       /* matched string */\n  let len;                           /* length of current match */\n  let best_len = s.prev_length;              /* best match length so far */\n  let nice_match = s.nice_match;             /* stop if match long enough */\n  const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  const _win = s.window; // shortcut\n\n  const wmask = s.w_mask;\n  const prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  const strend = s.strstart + MAX_MATCH;\n  let scan_end1  = _win[scan + best_len - 1];\n  let scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nconst fill_window = (s) => {\n\n  const _w_size = s.w_size;\n  let n, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n      if (s.insert > s.strstart) {\n        s.insert = s.strstart;\n      }\n      slide_hash(s);\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    const curr = s.strstart + s.lookahead;\n//    let init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n  /* Smallest worthy block size when not flushing or finishing. By default\n   * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n   * large input and output buffers, the stored block size will be larger.\n   */\n  let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n  /* Copy as many min_block or larger stored blocks directly to next_out as\n   * possible. If flushing, copy the remaining available input to next_out as\n   * stored blocks, if there is enough space.\n   */\n  let len, left, have, last = 0;\n  let used = s.strm.avail_in;\n  do {\n    /* Set len to the maximum size block that we can copy directly with the\n     * available input data and output space. Set left to how much of that\n     * would be copied from what's left in the window.\n     */\n    len = 65535/* MAX_STORED */;     /* maximum deflate stored block length */\n    have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    if (s.strm.avail_out < have) {         /* need room for header */\n      break;\n    }\n      /* maximum stored block length that will fit in avail_out: */\n    have = s.strm.avail_out - have;\n    left = s.strstart - s.block_start;  /* bytes left in window */\n    if (len > left + s.strm.avail_in) {\n      len = left + s.strm.avail_in;   /* limit len to the input */\n    }\n    if (len > have) {\n      len = have;             /* limit len to the output */\n    }\n\n    /* If the stored block would be less than min_block in length, or if\n     * unable to copy all of the available input when flushing, then try\n     * copying to the window and the pending buffer instead. Also don't\n     * write an empty block when flushing -- deflate() does that.\n     */\n    if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n                        flush === Z_NO_FLUSH$2 ||\n                        len !== left + s.strm.avail_in)) {\n      break;\n    }\n\n    /* Make a dummy stored block in pending to get the header bytes,\n     * including any pending bits. This also updates the debugging counts.\n     */\n    last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n    _tr_stored_block(s, 0, 0, last);\n\n    /* Replace the lengths in the dummy stored block with len. */\n    s.pending_buf[s.pending - 4] = len;\n    s.pending_buf[s.pending - 3] = len >> 8;\n    s.pending_buf[s.pending - 2] = ~len;\n    s.pending_buf[s.pending - 1] = ~len >> 8;\n\n    /* Write the stored block header bytes. */\n    flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n//    /* Update debugging counts for the data about to be copied. */\n//    s->compressed_len += len << 3;\n//    s->bits_sent += len << 3;\n//#endif\n\n    /* Copy uncompressed bytes from the window to next_out. */\n    if (left) {\n      if (left > len) {\n        left = len;\n      }\n      //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n      s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n      s.strm.next_out += left;\n      s.strm.avail_out -= left;\n      s.strm.total_out += left;\n      s.block_start += left;\n      len -= left;\n    }\n\n    /* Copy uncompressed bytes directly from next_in to next_out, updating\n     * the check value.\n     */\n    if (len) {\n      read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n      s.strm.next_out += len;\n      s.strm.avail_out -= len;\n      s.strm.total_out += len;\n    }\n  } while (last === 0);\n\n  /* Update the sliding window with the last s->w_size bytes of the copied\n   * data, or append all of the copied data to the existing window if less\n   * than s->w_size bytes were copied. Also update the number of bytes to\n   * insert in the hash tables, in the event that deflateParams() switches to\n   * a non-zero compression level.\n   */\n  used -= s.strm.avail_in;    /* number of input bytes directly copied */\n  if (used) {\n    /* If any input was used, then no unused input remains in the window,\n     * therefore s->block_start == s->strstart.\n     */\n    if (used >= s.w_size) {  /* supplant the previous history */\n      s.matches = 2;     /* clear hash */\n      //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n      s.strstart = s.w_size;\n      s.insert = s.strstart;\n    }\n    else {\n      if (s.window_size - s.strstart <= used) {\n        /* Slide the window down. */\n        s.strstart -= s.w_size;\n        //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n        s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n        if (s.matches < 2) {\n          s.matches++;   /* add a pending slide_hash() */\n        }\n        if (s.insert > s.strstart) {\n          s.insert = s.strstart;\n        }\n      }\n      //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n      s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n      s.strstart += used;\n      s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n    }\n    s.block_start = s.strstart;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* If the last block was written to next_out, then done. */\n  if (last) {\n    return BS_FINISH_DONE;\n  }\n\n  /* If flushing and all input has been consumed, then done. */\n  if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n    s.strm.avail_in === 0 && s.strstart === s.block_start) {\n    return BS_BLOCK_DONE;\n  }\n\n  /* Fill the window with any remaining input. */\n  have = s.window_size - s.strstart;\n  if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n    /* Slide the window down. */\n    s.block_start -= s.w_size;\n    s.strstart -= s.w_size;\n    //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n    s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n    if (s.matches < 2) {\n      s.matches++;       /* add a pending slide_hash() */\n    }\n    have += s.w_size;      /* more space now */\n    if (s.insert > s.strstart) {\n      s.insert = s.strstart;\n    }\n  }\n  if (have > s.strm.avail_in) {\n    have = s.strm.avail_in;\n  }\n  if (have) {\n    read_buf(s.strm, s.window, s.strstart, have);\n    s.strstart += have;\n    s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n  }\n  if (s.high_water < s.strstart) {\n    s.high_water = s.strstart;\n  }\n\n  /* There was not enough avail_out to write a complete worthy or flushed\n   * stored block to next_out. Write a stored block to pending instead, if we\n   * have enough input for a worthy block, or if flushing and there is enough\n   * room for the remaining input as a stored block in the pending buffer.\n   */\n  have = (s.bi_valid + 42) >> 3;     /* number of header bytes */\n    /* maximum stored block length that will fit in pending: */\n  have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n  min_block = have > s.w_size ? s.w_size : have;\n  left = s.strstart - s.block_start;\n  if (left >= min_block ||\n     ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n     s.strm.avail_in === 0 && left <= have)) {\n    len = left > have ? have : left;\n    last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n         len === left ? 1 : 0;\n    _tr_stored_block(s, s.block_start, len, last);\n    s.block_start += len;\n    flush_pending(s.strm);\n  }\n\n  /* We've done all we can with the available input and output. */\n  return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n  let hash_head;        /* head of the hash chain */\n  let bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n  let hash_head;          /* head of hash chain */\n  let bflush;              /* set if current block must be flushed */\n\n  let max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n  let bflush;            /* set if current block must be flushed */\n  let prev;              /* byte at distance one to match */\n  let scan, strend;      /* scan goes up to strend for length of run */\n\n  const _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n  let bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH$2) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = _tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH$3) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.sym_next) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nconst configuration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new Uint16Array(HEAP_SIZE * 2);\n  this.dyn_dtree  = new Uint16Array((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new Uint16Array((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new Uint16Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new Uint16Array(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.sym_buf = 0;        /* buffer for distances and literals/lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.sym_next = 0;      /* running index in sym_buf */\n  this.sym_end = 0;       /* symbol table full when sym_next reaches this */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const s = strm.state;\n  if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n                                s.status !== GZIP_STATE &&\n//#endif\n                                s.status !== EXTRA_STATE &&\n                                s.status !== NAME_STATE &&\n                                s.status !== COMMENT_STATE &&\n                                s.status !== HCRC_STATE &&\n                                s.status !== BUSY_STATE &&\n                                s.status !== FINISH_STATE)) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  const s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status =\n//#ifdef GZIP\n    s.wrap === 2 ? GZIP_STATE :\n//#endif\n    s.wrap ? INIT_STATE : BUSY_STATE;\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = -2;\n  _tr_init(s);\n  return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n  const ret = deflateResetKeep(strm);\n  if (ret === Z_OK$3) {\n    lm_init(strm.state);\n  }\n  return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n  if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n    return Z_STREAM_ERROR$2;\n  }\n  strm.state.gzhead = head;\n  return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR$2;\n  }\n  let wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION$1) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n    return err(strm, Z_STREAM_ERROR$2);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  const s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n  s.status = INIT_STATE;     /* to pass state test in deflateReset() */\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new Uint8Array(s.w_size * 2);\n  s.head = new Uint16Array(s.hash_size);\n  s.prev = new Uint16Array(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  /* We overlay pending_buf and sym_buf. This works since the average size\n   * for length/distance pairs over any compressed block is assured to be 31\n   * bits or less.\n   *\n   * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n   * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n   * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n   * possible fixed-codes length/distance pair is then 31 bits total.\n   *\n   * sym_buf starts one-fourth of the way into pending_buf. So there are\n   * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n   * in sym_buf is three bytes -- two for the distance and one for the\n   * literal/length. As each symbol is consumed, the pointer to the next\n   * sym_buf value to read moves forward three bytes. From that symbol, up to\n   * 31 bits are written to pending_buf. The closest the written pending_buf\n   * bits gets to the next sym_buf symbol to read is just before the last\n   * code is written. At that time, 31*(n-2) bits have been written, just\n   * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n   * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n   * symbols are written.) The closest the writing gets to what is unread is\n   * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n   * can range from 128 to 32768.\n   *\n   * Therefore, at a minimum, there are 142 bits of space between what is\n   * written and what is read in the overlain buffers, so the symbols cannot\n   * be overwritten by the compressed data. That space is actually 139 bits,\n   * due to the three-bit fixed-code block header.\n   *\n   * That covers the case where either Z_FIXED is specified, forcing fixed\n   * codes, or when the use of fixed codes is chosen, because that choice\n   * results in a smaller compressed block than dynamic codes. That latter\n   * condition then assures that the above analysis also covers all dynamic\n   * blocks. A dynamic-code block will only be chosen to be emitted if it has\n   * fewer bits than a fixed-code block would for the same set of symbols.\n   * Therefore its average symbol length is assured to be less than 31. So\n   * the compressed data for a dynamic block also cannot overwrite the\n   * symbols from which it is being constructed.\n   */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n  s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->sym_buf = s->pending_buf + s->lit_bufsize;\n  s.sym_buf = s.lit_bufsize;\n\n  //s->sym_end = (s->lit_bufsize - 1) * 3;\n  s.sym_end = (s.lit_bufsize - 1) * 3;\n  /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n  return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n  if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n\n  if (!strm.output ||\n      (strm.avail_in !== 0 && !strm.input) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n  }\n\n  const old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH$3) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR$1);\n  }\n\n  /* Write the header */\n  if (s.status === INIT_STATE && s.wrap === 0) {\n    s.status = BUSY_STATE;\n  }\n  if (s.status === INIT_STATE) {\n    /* zlib header */\n    let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n    let level_flags = -1;\n\n    if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n      level_flags = 0;\n    } else if (s.level < 6) {\n      level_flags = 1;\n    } else if (s.level === 6) {\n      level_flags = 2;\n    } else {\n      level_flags = 3;\n    }\n    header |= (level_flags << 6);\n    if (s.strstart !== 0) { header |= PRESET_DICT; }\n    header += 31 - (header % 31);\n\n    putShortMSB(s, header);\n\n    /* Save the adler32 of the preset dictionary: */\n    if (s.strstart !== 0) {\n      putShortMSB(s, strm.adler >>> 16);\n      putShortMSB(s, strm.adler & 0xffff);\n    }\n    strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#ifdef GZIP\n  if (s.status === GZIP_STATE) {\n    /* gzip header */\n    strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n    put_byte(s, 31);\n    put_byte(s, 139);\n    put_byte(s, 8);\n    if (!s.gzhead) { // s->gzhead == Z_NULL\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, 0);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, OS_CODE);\n      s.status = BUSY_STATE;\n\n      /* Compression must start with an empty pending buffer */\n      flush_pending(strm);\n      if (s.pending !== 0) {\n        s.last_flush = -1;\n        return Z_OK$3;\n      }\n    }\n    else {\n      put_byte(s, (s.gzhead.text ? 1 : 0) +\n                  (s.gzhead.hcrc ? 2 : 0) +\n                  (!s.gzhead.extra ? 0 : 4) +\n                  (!s.gzhead.name ? 0 : 8) +\n                  (!s.gzhead.comment ? 0 : 16)\n      );\n      put_byte(s, s.gzhead.time & 0xff);\n      put_byte(s, (s.gzhead.time >> 8) & 0xff);\n      put_byte(s, (s.gzhead.time >> 16) & 0xff);\n      put_byte(s, (s.gzhead.time >> 24) & 0xff);\n      put_byte(s, s.level === 9 ? 2 :\n                  (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                   4 : 0));\n      put_byte(s, s.gzhead.os & 0xff);\n      if (s.gzhead.extra && s.gzhead.extra.length) {\n        put_byte(s, s.gzhead.extra.length & 0xff);\n        put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n      }\n      if (s.gzhead.hcrc) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n      }\n      s.gzindex = 0;\n      s.status = EXTRA_STATE;\n    }\n  }\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n      while (s.pending + left > s.pending_buf_size) {\n        let copy = s.pending_buf_size - s.pending;\n        // zmemcpy(s.pending_buf + s.pending,\n        //    s.gzhead.extra + s.gzindex, copy);\n        s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n        s.pending = s.pending_buf_size;\n        //--- HCRC_UPDATE(beg) ---//\n        if (s.gzhead.hcrc && s.pending > beg) {\n          strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n        }\n        //---//\n        s.gzindex += copy;\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n        beg = 0;\n        left -= copy;\n      }\n      // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n      //              TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n      let gzhead_extra = new Uint8Array(s.gzhead.extra);\n      // zmemcpy(s->pending_buf + s->pending,\n      //     s->gzhead->extra + s->gzindex, left);\n      s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n      s.pending += left;\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = NAME_STATE;\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n      s.gzindex = 0;\n    }\n    s.status = COMMENT_STATE;\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      let beg = s.pending;   /* start of bytes to update crc */\n      let val;\n      do {\n        if (s.pending === s.pending_buf_size) {\n          //--- HCRC_UPDATE(beg) ---//\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          //---//\n          flush_pending(strm);\n          if (s.pending !== 0) {\n            s.last_flush = -1;\n            return Z_OK$3;\n          }\n          beg = 0;\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n      //--- HCRC_UPDATE(beg) ---//\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      //---//\n    }\n    s.status = HCRC_STATE;\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n        if (s.pending !== 0) {\n          s.last_flush = -1;\n          return Z_OK$3;\n        }\n      }\n      put_byte(s, strm.adler & 0xff);\n      put_byte(s, (strm.adler >> 8) & 0xff);\n      strm.adler = 0; //crc32(0L, Z_NULL, 0);\n    }\n    s.status = BUSY_STATE;\n\n    /* Compression must start with an empty pending buffer */\n    flush_pending(strm);\n    if (s.pending !== 0) {\n      s.last_flush = -1;\n      return Z_OK$3;\n    }\n  }\n//#endif\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n    let bstate = s.level === 0 ? deflate_stored(s, flush) :\n                 s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n                 s.strategy === Z_RLE ? deflate_rle(s, flush) :\n                 configuration_table[s.level].func(s, flush);\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK$3;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        _tr_align(s);\n      }\n      else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        _tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH$1) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK$3;\n      }\n    }\n  }\n\n  if (flush !== Z_FINISH$3) { return Z_OK$3; }\n  if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const status = strm.state.status;\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n  let dictLength = dictionary.length;\n\n  if (deflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  const s = strm.state;\n  const wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR$2;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    let tmpDict = new Uint8Array(s.w_size);\n    tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  const avail = strm.avail_in;\n  const next = strm.next_in;\n  const input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    let str = s.strstart;\n    let n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n  const sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    const source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (const p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n  // calculate data length\n  let len = 0;\n\n  for (let i = 0, l = chunks.length; i < l; i++) {\n    len += chunks[i].length;\n  }\n\n  // join chunks\n  const result = new Uint8Array(len);\n\n  for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n    let chunk = chunks[i];\n    result.set(chunk, pos);\n    pos += chunk.length;\n  }\n\n  return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n  if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n    return new TextEncoder().encode(str);\n  }\n\n  let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new Uint8Array(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if (buf.subarray && STR_APPLY_UIA_OK) {\n      return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n    }\n  }\n\n  let result = '';\n  for (let i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n  const len = max || buf.length;\n\n  if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n    return new TextDecoder().decode(buf.subarray(0, max));\n  }\n\n  let i, out;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  const utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    let c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    let c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  let pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n  Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n  Z_DEFAULT_COMPRESSION,\n  Z_DEFAULT_STRATEGY,\n  Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n *   , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n  this.options = common.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED$1,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY\n  }, options || {});\n\n  let opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new zstream();\n  this.strm.avail_out = 0;\n\n  let status = deflate_1$2.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK$2) {\n    throw new Error(messages[status]);\n  }\n\n  if (opt.header) {\n    deflate_1$2.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    let dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK$2) {\n      throw new Error(messages[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  let status, _flush_mode;\n\n  if (this.ended) { return false; }\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    // Make sure avail_out > 6 to avoid repeating markers\n    if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    status = deflate_1$2.deflate(strm, _flush_mode);\n\n    // Ended => flush and finish\n    if (status === Z_STREAM_END$2) {\n      if (strm.next_out > 0) {\n        this.onData(strm.output.subarray(0, strm.next_out));\n      }\n      status = deflate_1$2.deflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return status === Z_OK$2;\n    }\n\n    // Flush if out buffer full\n    if (strm.avail_out === 0) {\n      this.onData(strm.output);\n      continue;\n    }\n\n    // Flush if requested and has data\n    if (_flush_mode > 0 && strm.next_out > 0) {\n      this.onData(strm.output.subarray(0, strm.next_out));\n      strm.avail_out = 0;\n      continue;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK$2) {\n    this.result = common.flattenChunks(this.chunks);\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n  const deflator = new Deflate$1(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209;       /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n  let _in;                    /* local strm.input */\n  let last;                   /* have enough input while in < last */\n  let _out;                   /* local strm.output */\n  let beg;                    /* inflate()'s initial strm.output */\n  let end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  let dmax;                   /* maximum distance from zlib header */\n//#endif\n  let wsize;                  /* window size or zero if not using window */\n  let whave;                  /* valid bytes in the window */\n  let wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  let s_window;               /* allocated sliding window, if wsize != 0 */\n  let hold;                   /* local strm.hold */\n  let bits;                   /* local strm.bits */\n  let lcode;                  /* local strm.lencode */\n  let dcode;                  /* local strm.distcode */\n  let lmask;                  /* mask for first level of length codes */\n  let dmask;                  /* mask for first level of distance codes */\n  let here;                   /* retrieved table entry */\n  let op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  let len;                    /* match length, unused bytes */\n  let dist;                   /* match distance */\n  let from;                   /* where to copy match from */\n  let from_source;\n\n\n  let input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  const state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD$1;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD$1;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD$1;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE$1;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD$1;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n  const bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  let len = 0;               /* a code's length in bits */\n  let sym = 0;               /* index of code symbols */\n  let min = 0, max = 0;          /* minimum and maximum code lengths */\n  let root = 0;              /* number of index bits for root table */\n  let curr = 0;              /* number of index bits for current table */\n  let drop = 0;              /* code bits to drop for sub-table */\n  let left = 0;                   /* number of prefix codes available */\n  let used = 0;              /* code entries in table used */\n  let huff = 0;              /* Huffman code */\n  let incr;              /* for incrementing code, index */\n  let fill;              /* index for replicating entries */\n  let low;               /* low bits for current root entry */\n  let mask;              /* mask for low root bits */\n  let next;             /* next available space in table */\n  let base = null;     /* base value table to use */\n//  let shoextra;    /* extra bits table to use */\n  let match;                  /* use base and extra for symbol >= match */\n  const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  let extra = null;\n\n  let here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES$1 || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES$1) {\n    base = extra = work;    /* dummy value--not used */\n    match = 20;\n\n  } else if (type === LENS$1) {\n    base = lbase;\n    extra = lext;\n    match = 257;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    match = 0;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n    (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] + 1 < match) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] >= match) {\n      here_op = extra[work[sym] - match];\n      here_val = base[work[sym] - match];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n        (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n  Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n  Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst    HEAD = 16180;       /* i: waiting for magic header */\nconst    FLAGS = 16181;      /* i: waiting for method and flags (gzip) */\nconst    TIME = 16182;       /* i: waiting for modification time (gzip) */\nconst    OS = 16183;         /* i: waiting for extra flags and operating system (gzip) */\nconst    EXLEN = 16184;      /* i: waiting for extra length (gzip) */\nconst    EXTRA = 16185;      /* i: waiting for extra bytes (gzip) */\nconst    NAME = 16186;       /* i: waiting for end of file name (gzip) */\nconst    COMMENT = 16187;    /* i: waiting for end of comment (gzip) */\nconst    HCRC = 16188;       /* i: waiting for header crc (gzip) */\nconst    DICTID = 16189;    /* i: waiting for dictionary check value */\nconst    DICT = 16190;      /* waiting for inflateSetDictionary() call */\nconst        TYPE = 16191;      /* i: waiting for type bits, including last-flag bit */\nconst        TYPEDO = 16192;    /* i: same, but skip check to exit inflate on new block */\nconst        STORED = 16193;    /* i: waiting for stored size (length and complement) */\nconst        COPY_ = 16194;     /* i/o: same as COPY below, but only first time in */\nconst        COPY = 16195;      /* i/o: waiting for input or output to copy stored block */\nconst        TABLE = 16196;     /* i: waiting for dynamic block table lengths */\nconst        LENLENS = 16197;   /* i: waiting for code length code lengths */\nconst        CODELENS = 16198;  /* i: waiting for length/lit and distance code lengths */\nconst            LEN_ = 16199;      /* i: same as LEN below, but only first time in */\nconst            LEN = 16200;       /* i: waiting for length/lit/eob code */\nconst            LENEXT = 16201;    /* i: waiting for length extra bits */\nconst            DIST = 16202;      /* i: waiting for distance code */\nconst            DISTEXT = 16203;   /* i: waiting for distance extra bits */\nconst            MATCH = 16204;     /* o: waiting for output space to copy string */\nconst            LIT = 16205;       /* o: waiting for output space to write literal */\nconst    CHECK = 16206;     /* i: waiting for 32-bit check value */\nconst    LENGTH = 16207;    /* i: waiting for 32-bit length (gzip) */\nconst    DONE = 16208;      /* finished check, done -- remain here until reset */\nconst    BAD = 16209;       /* got a data error -- remain here until reset */\nconst    MEM = 16210;       /* got an inflate() memory error -- remain here until reset */\nconst    SYNC = 16211;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n  this.strm = null;           /* pointer back to this zlib stream */\n  this.mode = 0;              /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip,\n                                 bit 2 true to validate check value */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib), or\n                                 -1 if raw or no header yet */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n  this.work = new Uint16Array(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new Int32Array(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n  if (!strm) {\n    return 1;\n  }\n  const state = strm.state;\n  if (!state || state.strm !== strm ||\n    state.mode < HEAD || state.mode > SYNC) {\n    return 1;\n  }\n  return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.flags = -1;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n  state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n  let wrap;\n\n  /* get the state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 5;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR$1;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n  if (!strm) { return Z_STREAM_ERROR$1; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  const state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.strm = strm;\n  state.window = null/*Z_NULL*/;\n  state.mode = HEAD;     /* to pass state test in inflateReset2() */\n  const ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK$1) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n  return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    lenfix = new Int32Array(512);\n    distfix = new Int32Array(32);\n\n    /* literal/length table */\n    let sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inftrees(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inftrees(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n  let dist;\n  const state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new Uint8Array(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    state.window.set(src.subarray(end - state.wsize, end), 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      state.window.set(src.subarray(end - copy, end), 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n  let state;\n  let input, output;          // input/output buffers\n  let next;                   /* next input INDEX */\n  let put;                    /* next output INDEX */\n  let have, left;             /* available input and output */\n  let hold;                   /* bit buffer */\n  let bits;                   /* bits in bit buffer */\n  let _in, _out;              /* save starting available input and output */\n  let copy;                   /* number of stored or match bytes to copy */\n  let from;                   /* where to copy match bytes from */\n  let from_source;\n  let here = 0;               /* current decoding table entry */\n  let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //let last;                   /* parent table entry */\n  let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  let len;                    /* length to copy for repeats, bits to drop */\n  let ret;                    /* return code */\n  const hbuf = new Uint8Array(4);    /* buffer for gzip header crc calculation */\n  let opts;\n\n  let n; // temporary variable for NEED_BITS\n\n  const order = /* permutation of code lengths */\n    new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n  if (inflateStateCheck(strm) || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK$1;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          if (state.wbits === 0) {\n            state.wbits = 15;\n          }\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        if (len > 15 || len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n\n        // !!! pako patch. Force use `options.windowBits` if passed.\n        // Required to always use max window size by default.\n        state.dmax = 1 << state.wbits;\n        //state.dmax = 1 << len;\n\n        state.flags = 0;               /* indicate zlib header */\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if ((state.flags & 0x0200) && (state.wrap & 4)) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32_1(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32_1(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Uint8Array(state.head.extra_len);\n              }\n              state.head.extra.set(\n                input.subarray(\n                  next,\n                  // extra field is limited to 65536 bytes\n                  // - no need for additional size check\n                  next + copy\n                ),\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if ((state.flags & 0x0200) && (state.wrap & 4)) {\n              state.check = crc32_1(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if ((state.flags & 0x0200) && (state.wrap & 4)) {\n            state.check = crc32_1(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT$1;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          output.set(input.subarray(next, next + copy), put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inffast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if ((state.wrap & 4) && _out) {\n            strm.adler = state.check =\n                /*UPDATE_CHECK(state.check, put - _out, _out);*/\n                (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END$1;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR$1;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR$1;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR$1;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH$1))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if ((state.wrap & 4) && _out) {\n    strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n  if (inflateStateCheck(strm)) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  let state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  const state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n  const dictLength = dictionary.length;\n\n  let state;\n  let dictid;\n  let ret;\n\n  /* check state */\n  if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR$1;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32_1(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR$1;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR$1;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n  Z_NO_FLUSH, Z_FINISH,\n  Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n  this.options = common.assign({\n    chunkSize: 1024 * 64,\n    windowBits: 15,\n    to: ''\n  }, options || {});\n\n  const opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new zstream();\n  this.strm.avail_out = 0;\n\n  let status  = inflate_1$2.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(messages[status]);\n  }\n\n  this.header = new gzheader();\n\n  inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== Z_OK) {\n        throw new Error(messages[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n *   flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n *   `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n  const strm = this.strm;\n  const chunkSize = this.options.chunkSize;\n  const dictionary = this.options.dictionary;\n  let status, _flush_mode, last_avail_out;\n\n  if (this.ended) return false;\n\n  if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n  else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n  // Convert data if needed\n  if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  for (;;) {\n    if (strm.avail_out === 0) {\n      strm.output = new Uint8Array(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = inflate_1$2.inflate(strm, _flush_mode);\n\n    if (status === Z_NEED_DICT && dictionary) {\n      status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n      if (status === Z_OK) {\n        status = inflate_1$2.inflate(strm, _flush_mode);\n      } else if (status === Z_DATA_ERROR) {\n        // Replace code with more verbose\n        status = Z_NEED_DICT;\n      }\n    }\n\n    // Skip snyc markers if more data follows and not raw mode\n    while (strm.avail_in > 0 &&\n           status === Z_STREAM_END &&\n           strm.state.wrap > 0 &&\n           data[strm.next_in] !== 0)\n    {\n      inflate_1$2.inflateReset(strm);\n      status = inflate_1$2.inflate(strm, _flush_mode);\n    }\n\n    switch (status) {\n      case Z_STREAM_ERROR:\n      case Z_DATA_ERROR:\n      case Z_NEED_DICT:\n      case Z_MEM_ERROR:\n        this.onEnd(status);\n        this.ended = true;\n        return false;\n    }\n\n    // Remember real `avail_out` value, because we may patch out buffer content\n    // to align utf8 strings boundaries.\n    last_avail_out = strm.avail_out;\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n        if (this.options.to === 'string') {\n\n          let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          let tail = strm.next_out - next_out_utf8;\n          let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail & realign counters\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n        }\n      }\n    }\n\n    // Must repeat iteration if out buffer is full\n    if (status === Z_OK && last_avail_out === 0) continue;\n\n    // Finalize if end of stream reached.\n    if (status === Z_STREAM_END) {\n      status = inflate_1$2.inflateEnd(this.strm);\n      this.onEnd(status);\n      this.ended = true;\n      return true;\n    }\n\n    if (strm.avail_in === 0) break;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n *   each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = common.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err) {\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n  const inflator = new Inflate$1(options);\n\n  inflator.push(input);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/**\r\n * 数据压缩器\r\n */\r\nimport pako from 'pako';\r\n\r\nclass Compressor {\r\n  /**\r\n   * 压缩数据\r\n   */\r\n  compress(data: string): string {\r\n    try {\r\n      // 使用pako进行gzip压缩\r\n      const compressed = pako.deflate(data);\r\n      \r\n      // 转换为base64\r\n      if (typeof btoa !== 'undefined') {\r\n        // 浏览器环境：将Uint8Array转换为字符串再base64\r\n        let binaryString = '';\r\n        for (let i = 0; i < compressed.length; i++) {\r\n          binaryString += String.fromCharCode(compressed[i]);\r\n        }\r\n        return btoa(binaryString);\r\n      } else if (typeof Buffer !== 'undefined') {\r\n        // Node环境：使用Buffer\r\n        return Buffer.from(compressed).toString('base64');\r\n      }\r\n      return data;\r\n    } catch (error) {\r\n      console.error('Compressor: Error compressing data:', error);\r\n      return data;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 解压数据\r\n   */\r\n  decompress(compressedData: string): string {\r\n    try {\r\n      // 从base64解码\r\n      let binaryData: Uint8Array;\r\n      if (typeof atob !== 'undefined') {\r\n        // 浏览器环境\r\n        const binaryString = atob(compressedData);\r\n        binaryData = new Uint8Array(binaryString.length);\r\n        for (let i = 0; i < binaryString.length; i++) {\r\n          binaryData[i] = binaryString.charCodeAt(i);\r\n        }\r\n      } else if (typeof Buffer !== 'undefined') {\r\n        // Node环境\r\n        const buffer = Buffer.from(compressedData, 'base64');\r\n        binaryData = new Uint8Array(buffer);\r\n      } else {\r\n        return compressedData;\r\n      }\r\n      \r\n      // 使用pako解压\r\n      const decompressed = pako.inflate(binaryData, { to: 'string' });\r\n      return decompressed;\r\n    } catch (error) {\r\n      console.error('Compressor: Error decompressing data:', error);\r\n      return compressedData;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 判断是否需要压缩（数据大于1KB时压缩）\r\n   */\r\n  shouldCompress(data: string): boolean {\r\n    return data.length > 1024;\r\n  }\r\n}\r\n\r\nexport default Compressor;\r\n\r\n","import type { TrackerEvent } from '@/types';\nimport type { PipelineContext } from './pipeline-context';\nimport type { ProcessorStage } from './processor-stage';\n\nclass ProcessorPipeline {\n  constructor(private readonly stages: ProcessorStage[]) {}\n\n  process(event: TrackerEvent, context: PipelineContext): TrackerEvent | null {\n    let currentEvent: TrackerEvent | null = event;\n\n    for (const stage of this.stages) {\n      if (!currentEvent) {\n        return null;\n      }\n      currentEvent = stage.process(currentEvent, context);\n    }\n\n    return currentEvent;\n  }\n}\n\nexport default ProcessorPipeline;\n","import type { TrackerEvent } from '@/types';\nimport Sampler from '@/processor/sampler';\nimport type { PipelineContext } from '@/processor/pipeline-context';\nimport type { ProcessorStage } from '@/processor/processor-stage';\n\nclass SampleStage implements ProcessorStage {\n  constructor(private readonly sampler: Sampler) {}\n\n  process(event: TrackerEvent, context: PipelineContext): TrackerEvent | null {\n    if (!this.sampler.shouldSampleCritical(context.isCritical, context.sampleRate)) {\n      return null;\n    }\n\n    return event;\n  }\n}\n\nexport default SampleStage;\n","import type { TrackerEvent } from '@/types';\nimport Deduplicator from '@/processor/deduplicator';\nimport type { PipelineContext } from '@/processor/pipeline-context';\nimport type { ProcessorStage } from '@/processor/processor-stage';\n\nclass DeduplicateStage implements ProcessorStage {\n  constructor(private readonly deduplicator: Deduplicator) {}\n\n  process(event: TrackerEvent, context: PipelineContext): TrackerEvent | null {\n    if (context.enableDeduplication && this.deduplicator.isDuplicate(event)) {\n      return null;\n    }\n\n    return event;\n  }\n}\n\nexport default DeduplicateStage;\n","import type { TrackerEvent } from '@/types';\nimport { deepClone } from '@/core/utils';\nimport Compressor from '@/processor/compressor';\nimport type { PipelineContext } from '@/processor/pipeline-context';\nimport type { ProcessorStage } from '@/processor/processor-stage';\n\nclass CompressStage implements ProcessorStage {\n  constructor(private readonly compressor: Compressor) {}\n\n  process(event: TrackerEvent, context: PipelineContext): TrackerEvent | null {\n    const processedEvent = deepClone(event);\n\n    if (!context.enableCompression || !processedEvent.properties) {\n      return processedEvent;\n    }\n\n    const propertiesStr = JSON.stringify(processedEvent.properties);\n    if (this.compressor.shouldCompress(propertiesStr)) {\n      (processedEvent as TrackerEvent & { compressedProperties?: string }).compressedProperties =\n        this.compressor.compress(propertiesStr);\n      delete processedEvent.properties;\n    }\n\n    return processedEvent;\n  }\n}\n\nexport default CompressStage;\n","/**\r\n * 数据处理器\r\n */\r\nimport type { TrackerEvent } from '@/types';\nimport Sampler from './sampler';\nimport Deduplicator from './deduplicator';\nimport Compressor from './compressor';\nimport ProcessorPipeline from './processor-pipeline';\nimport SampleStage from './stages/sample-stage';\nimport DeduplicateStage from './stages/deduplicate-stage';\nimport CompressStage from './stages/compress-stage';\nimport type { PipelineContext } from './pipeline-context';\n\r\ninterface ProcessOptions {\r\n  /** 采样率 */\r\n  sampleRate?: number;\r\n  /** 是否启用去重 */\r\n  enableDeduplication?: boolean;\r\n  /** 是否启用压缩 */\r\n  enableCompression?: boolean;\r\n  /** 是否关键事件 */\r\n  isCritical?: boolean;\r\n}\r\n\r\nclass DataProcessor {\n  private sampler: Sampler;\n  private deduplicator: Deduplicator;\n  private compressor: Compressor;\n  private pipeline: ProcessorPipeline;\n  private defaultOptions: Required<ProcessOptions>;\n\n  constructor(defaultOptions: ProcessOptions = {}) {\n    this.sampler = new Sampler();\n    this.deduplicator = new Deduplicator();\n    this.compressor = new Compressor();\n    this.defaultOptions = {\n      sampleRate: defaultOptions.sampleRate ?? 1.0,\n      enableDeduplication: defaultOptions.enableDeduplication ?? true,\n      enableCompression: defaultOptions.enableCompression ?? false,\n      isCritical: defaultOptions.isCritical ?? false\n    };\n    this.pipeline = new ProcessorPipeline([\n      new SampleStage(this.sampler),\n      new DeduplicateStage(this.deduplicator),\n      new CompressStage(this.compressor)\n    ]);\n  }\n\r\n  /**\r\n   * 处理事件\r\n   */\r\n  process(event: TrackerEvent, options: ProcessOptions = {}): TrackerEvent | null {\n    const context: PipelineContext = {\n      sampleRate: options.sampleRate ?? this.defaultOptions.sampleRate,\n      enableDeduplication:\n        options.enableDeduplication ?? this.defaultOptions.enableDeduplication,\n      enableCompression:\n        options.enableCompression ?? this.defaultOptions.enableCompression,\n      isCritical: options.isCritical ?? this.defaultOptions.isCritical\n    };\n\n    return this.pipeline.process(event, context);\n  }\n\r\n  /**\r\n   * 批量处理事件\r\n   */\r\n  processBatch(events: TrackerEvent[], options: ProcessOptions = {}): TrackerEvent[] {\r\n    return events\r\n      .map(event => this.process(event, options))\r\n      .filter((event): event is TrackerEvent => event !== null);\r\n  }\r\n\r\n  /**\r\n   * 序列化事件\r\n   */\r\n  serialize(event: TrackerEvent): string {\r\n    try {\r\n      return JSON.stringify(event);\r\n    } catch (error) {\r\n      console.error('DataProcessor: Error serializing event:', error);\r\n      return '';\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 反序列化事件\r\n   */\r\n  deserialize(data: string): TrackerEvent | null {\r\n    try {\r\n      return JSON.parse(data) as TrackerEvent;\r\n    } catch (error) {\r\n      console.error('DataProcessor: Error deserializing event:', error);\r\n      return null;\r\n    }\r\n  }\r\n}\r\n\r\nexport default DataProcessor;\r\n\r\n","/**\r\n * 网络请求封装\r\n */\r\n\r\n/**\r\n * AbortController兼容性处理\r\n */\r\nfunction getAbortController(): typeof AbortController {\r\n  if (typeof AbortController !== 'undefined') {\r\n    return AbortController;\r\n  }\r\n  \r\n  // 简单的AbortController polyfill\r\n  class AbortSignalPolyfill {\r\n    aborted: boolean = false;\r\n    \r\n    abort(): void {\r\n      this.aborted = true;\r\n    }\r\n  }\r\n\r\n  class AbortControllerPolyfill {\r\n    signal: AbortSignalPolyfill;\r\n    \r\n    constructor() {\r\n      this.signal = new AbortSignalPolyfill();\r\n    }\r\n    \r\n    abort(): void {\r\n      this.signal.abort();\r\n    }\r\n  }\r\n\r\n  return AbortControllerPolyfill as unknown as typeof AbortController;\r\n}\r\n\r\ninterface AbortSignalPolyfill {\r\n  aborted: boolean;\r\n  abort(): void;\r\n}\r\n\r\n/**\r\n * fetch兼容性降级实现（基于XMLHttpRequest）\r\n */\r\nasync function fetchPolyfill(url: string, init?: RequestInit): Promise<Response> {\r\n  return new Promise((resolve, reject) => {\r\n    const xhr = new XMLHttpRequest();\r\n    const method = init?.method || 'GET';\r\n    \r\n    xhr.open(method, url, true);\r\n    \r\n    // 设置请求头\r\n    if (init?.headers) {\r\n      const headers = new Headers(init.headers);\r\n      headers.forEach((value, key) => {\r\n        if (value != null) {\r\n          xhr.setRequestHeader(key, String(value));\r\n        }\r\n      });\r\n    }\r\n\r\n    // AbortSignal 处理\r\n    if (init?.signal) {\r\n      const signal = init.signal as unknown as AbortSignalPolyfill;\r\n      if (signal.aborted) {\r\n        reject(new DOMException('Aborted', 'AbortError'));\r\n        return;\r\n      }\r\n      \r\n      // 监听 abort 事件（如果 signal 支持 addEventListener）\r\n      // 注意：我们的 polyfill 不支持 addEventListener，但原生 AbortSignal 支持\r\n      if (typeof (signal as unknown as { addEventListener?: (type: string, handler: () => void) => void }).addEventListener === 'function') {\r\n        (signal as unknown as { addEventListener: (type: string, handler: () => void) => void }).addEventListener('abort', () => {\r\n          xhr.abort();\r\n          reject(new DOMException('Aborted', 'AbortError'));\r\n        });\r\n      } else {\r\n        // Polyfill 情况：定期检查 aborted 状态\r\n        const checkAborted = setInterval(() => {\r\n          if (signal.aborted) {\r\n            clearInterval(checkAborted);\r\n            xhr.abort();\r\n            reject(new DOMException('Aborted', 'AbortError'));\r\n          }\r\n        }, 100);\r\n        \r\n        // 在请求完成或失败时清除检查\r\n        const cleanup = () => clearInterval(checkAborted);\r\n        xhr.addEventListener('loadend', cleanup);\r\n        xhr.addEventListener('error', cleanup);\r\n        xhr.addEventListener('timeout', cleanup);\r\n      }\r\n    }\r\n\r\n    // 响应处理\r\n    xhr.onload = () => {\r\n      const headersString = xhr.getAllResponseHeaders();\r\n      const headers: Record<string, string> = {};\r\n      \r\n      headersString.split('\\n').forEach(line => {\r\n        const parts = line.split(': ');\r\n        if (parts[0] && parts[1]) {\r\n          headers[parts[0].toLowerCase()] = parts[1];\r\n        }\r\n      });\r\n\r\n      const responseHeaders = new Headers(headers);\r\n      const responseText = xhr.responseText || '';\r\n      const responseUrl = xhr.responseURL || url;\r\n      const responseStatus = xhr.status;\r\n      const responseStatusText = xhr.statusText;\r\n      const responseOk = responseStatus >= 200 && responseStatus < 300;\r\n\r\n      const response: Partial<Response> = {\r\n        ok: responseOk,\r\n        status: responseStatus,\r\n        statusText: responseStatusText,\r\n        type: 'basic',\r\n        url: responseUrl,\r\n        headers: responseHeaders,\r\n        redirected: false,\r\n        body: null,\r\n        bodyUsed: false,\r\n        arrayBuffer: () => Promise.resolve(new ArrayBuffer(0)),\r\n        blob: () => Promise.resolve(new Blob()),\r\n        formData: () => Promise.resolve(new FormData()),\r\n        json: async () => {\r\n          try {\r\n            return JSON.parse(responseText || '{}');\r\n          } catch {\r\n            throw new TypeError('Invalid JSON response');\r\n          }\r\n        },\r\n        text: () => Promise.resolve(responseText),\r\n        clone: () => {\r\n          // clone方法返回一个新的Response对象（使用相同的数据）\r\n          return {\r\n            ...response,\r\n            headers: new Headers(headers)\r\n          } as Response;\r\n        }\r\n      };\r\n\r\n      resolve(response as Response);\r\n    };\r\n\r\n    xhr.onerror = () => {\r\n      reject(new TypeError('Network request failed'));\r\n    };\r\n\r\n    xhr.ontimeout = () => {\r\n      reject(new Error('Request timeout'));\r\n    };\r\n\r\n    const body = init?.body;\r\n    if (body instanceof FormData || body instanceof Blob || typeof body === 'string' || body === null) {\r\n      xhr.send(body);\r\n    } else if (body) {\r\n      xhr.send(String(body));\r\n    } else {\r\n      xhr.send(null);\r\n    }\r\n  });\r\n}\r\n\r\n/**\r\n * 获取fetch函数（支持降级）\r\n * \r\n * 优先级：\r\n * 1. 原生 fetch（Node.js 18+ 或现代浏览器）\r\n * 2. XMLHttpRequest polyfill（仅浏览器环境，用于旧版浏览器）\r\n * \r\n * Node.js < 18 会抛出错误（符合 engines.node >= 18.0.0 的要求）\r\n */\r\nfunction getFetch(): typeof fetch {\r\n  if (typeof fetch === 'function') {\r\n    // 检查AbortController支持\r\n    try {\r\n      new (getAbortController())();\r\n      return fetch;\r\n    } catch {\r\n      // AbortController不支持，使用polyfill（仅浏览器环境）\r\n      if (typeof XMLHttpRequest !== 'undefined') {\r\n        return fetchPolyfill as unknown as typeof fetch;\r\n      }\r\n      // Node.js 环境应该始终有 AbortController（Node.js 15+）\r\n      throw new Error('AbortController is not available. This should not happen in Node.js 18+ or modern browsers.');\r\n    }\r\n  }\r\n  \r\n  // fetch不可用，尝试使用XMLHttpRequest降级（仅浏览器环境）\r\n  if (typeof XMLHttpRequest !== 'undefined') {\r\n    return fetchPolyfill as unknown as typeof fetch;\r\n  }\r\n  \r\n  // Node.js < 18 环境会走到这里\r\n  throw new Error('fetch is not available. Node.js 18+ is required (engines.node >= 18.0.0). For browser environments, please use a modern browser or provide a fetch polyfill.');\r\n}\r\n\r\n/**\r\n * 请求选项\r\n */\r\ninterface RequestOptions {\r\n  method?: 'GET' | 'POST' | 'PUT' | 'DELETE';\r\n  headers?: Record<string, string>;\r\n  body?: string | FormData;\r\n  timeout?: number;\r\n}\r\n\r\n/**\r\n * 请求响应\r\n */\r\ninterface RequestResponse {\r\n  ok: boolean;\r\n  status: number;\r\n  statusText: string;\r\n  data: unknown;\r\n}\r\n\r\n/**\r\n * 统一请求函数\r\n * \r\n * 支持 Node.js 18+ 和浏览器环境\r\n * - Node.js 18+：使用原生 fetch API\r\n * - 浏览器环境：使用原生 fetch 或 XMLHttpRequest 降级方案\r\n */\r\nasync function universalRequest(url: string, options: RequestOptions = {}): Promise<RequestResponse> {\r\n  const { method = 'POST', headers = {}, body, timeout = 10000 } = options;\r\n\r\n  const AbortControllerClass = getAbortController();\r\n  const controller = new AbortControllerClass();\r\n  const timeoutId = setTimeout(() => controller.abort(), timeout);\r\n\r\n  try {\r\n    const fetchFn = getFetch();\r\n    const response = await fetchFn(url, {\r\n      method,\r\n      headers: {\r\n        'Content-Type': 'application/json',\r\n        ...headers\r\n      },\r\n      body,\r\n      signal: controller.signal as AbortSignal\r\n    });\r\n\r\n    clearTimeout(timeoutId);\r\n\r\n    let data: unknown;\r\n    const contentType = response.headers.get('content-type');\r\n    if (contentType && contentType.includes('application/json')) {\r\n      data = await response.json();\r\n    } else {\r\n      data = await response.text();\r\n    }\r\n\r\n    return {\r\n      ok: response.ok,\r\n      status: response.status,\r\n      statusText: response.statusText,\r\n      data\r\n    };\r\n  } catch (error) {\r\n    clearTimeout(timeoutId);\r\n    throw error;\r\n  }\r\n}\r\n\r\n/**\r\n * 统一请求接口\r\n * \r\n * Node.js 18+ 原生支持 fetch API，无需 node-fetch\r\n * 浏览器环境使用原生 fetch 或 XMLHttpRequest 降级方案\r\n */\r\nexport async function request(url: string, options: RequestOptions = {}): Promise<RequestResponse> {\r\n  // Node.js 18+ 和浏览器环境都使用统一的请求函数\r\n  // Node.js 18+ 原生支持 fetch，可以直接使用\r\n  // 浏览器环境使用原生 fetch 或 XMLHttpRequest 降级方案\r\n  return universalRequest(url, options);\r\n}\r\n\r\n/**\r\n * GET请求\r\n */\r\nexport function get(url: string, options: Omit<RequestOptions, 'method' | 'body'> = {}): Promise<RequestResponse> {\r\n  return request(url, { ...options, method: 'GET' });\r\n}\r\n\r\n/**\r\n * POST请求\r\n */\r\nexport function post(url: string, data: unknown, options: Omit<RequestOptions, 'method' | 'body'> = {}): Promise<RequestResponse> {\r\n  const body = typeof data === 'string' ? data : JSON.stringify(data);\r\n  return request(url, { ...options, method: 'POST', body });\r\n}\r\n\r\n","/**\r\n * 重试处理器\r\n */\r\n\r\ninterface RetryOptions {\r\n  /** 最大重试次数 */\r\n  maxRetries?: number;\r\n  /** 初始延迟时间（毫秒） */\r\n  initialDelay?: number;\r\n  /** 最大延迟时间（毫秒） */\r\n  maxDelay?: number;\r\n  /** 重试条件函数 */\r\n  shouldRetry?: (error: unknown) => boolean;\r\n}\r\n\r\nclass RetryHandler {\r\n  /**\r\n   * 执行带重试的函数\r\n   */\r\n  async execute<T>(\r\n    fn: () => Promise<T>,\r\n    options: RetryOptions = {}\r\n  ): Promise<T> {\r\n    const {\r\n      maxRetries = 3,\r\n      initialDelay = 1000,\r\n      maxDelay = 10000,\r\n      shouldRetry = () => true\r\n    } = options;\r\n\r\n    // 限制 maxRetries 的最大值，避免无限循环\r\n    const actualMaxRetries = Math.min(maxRetries, 100);\r\n\r\n    let lastError: unknown;\r\n    let delay = initialDelay;\r\n\r\n    for (let attempt = 0; attempt <= actualMaxRetries; attempt++) {\r\n      try {\r\n        return await fn();\r\n      } catch (error) {\r\n        lastError = error;\r\n\r\n        // 判断是否应该重试\r\n        if (attempt < actualMaxRetries && shouldRetry(error)) {\r\n          // 指数退避\r\n          await this.sleep(delay);\r\n          delay = Math.min(delay * 2, maxDelay);\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    throw lastError;\r\n  }\r\n\r\n  /**\r\n   * 延迟函数\r\n   */\r\n  private sleep(ms: number): Promise<void> {\r\n    return new Promise(resolve => setTimeout(resolve, ms));\r\n  }\r\n\r\n  /**\r\n   * 判断错误是否可重试\r\n   */\r\n  isRetryableError(error: unknown): boolean {\r\n    // 网络错误、超时错误等可以重试\r\n    if (error instanceof Error) {\r\n      const message = error.message.toLowerCase();\r\n      return (\r\n        message.includes('network') ||\r\n        message.includes('timeout') ||\r\n        message.includes('fetch') ||\r\n        message.includes('connection')\r\n      );\r\n    }\r\n\r\n    // 其他错误默认不重试\r\n    return false;\r\n  }\r\n}\r\n\r\nexport default RetryHandler;\r\n\r\n","/**\r\n * 数据发送器\r\n */\r\nimport { post } from '@/core/request';\r\nimport type { TrackerEvent } from '@/types';\r\nimport RetryHandler from './retry-handler';\r\n\r\ninterface SendOptions {\r\n  /** 是否启用重试 */\r\n  enableRetry?: boolean;\r\n  /** 最大重试次数 */\r\n  maxRetries?: number;\r\n}\r\n\r\nclass Sender {\r\n  private serverUrl: string;\r\n  private retryHandler: RetryHandler;\r\n  private defaultMaxRetries: number;\r\n\r\n  constructor(serverUrl: string, options: { maxRetries?: number } = {}) {\r\n    this.serverUrl = serverUrl;\r\n    this.retryHandler = new RetryHandler();\r\n    this.defaultMaxRetries = options.maxRetries ?? 3;\r\n  }\r\n\r\n  /**\r\n   * 发送单个事件\r\n   */\r\n  async send(event: TrackerEvent, options: SendOptions = {}): Promise<boolean> {\r\n    // 如果serverUrl为空，跳过网络请求，返回false表示需要保存到离线存储\r\n    if (!this.serverUrl || this.serverUrl === 'about:blank') {\r\n      return false;\r\n    }\r\n\r\n    const { enableRetry = true, maxRetries: maxRetriesOpt } = options;\r\n    const maxRetries = maxRetriesOpt ?? this.defaultMaxRetries;\r\n\r\n    try {\r\n      if (enableRetry) {\r\n        await this.retryHandler.execute(\r\n          async () => {\r\n            const response = await post(this.serverUrl, event);\r\n            if (!response.ok) {\r\n              throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n            }\r\n            return response;\r\n          },\r\n          {\r\n            maxRetries,\r\n            shouldRetry: error => this.retryHandler.isRetryableError(error)\r\n          }\r\n        );\r\n      } else {\r\n        const response = await post(this.serverUrl, event);\r\n        if (!response.ok) {\r\n          throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n        }\r\n      }\r\n\r\n      return true;\r\n    } catch (error) {\r\n      console.error('Sender: Error sending event:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 批量发送事件\r\n   */\r\n  async sendBatch(events: TrackerEvent[], options: SendOptions = {}): Promise<boolean> {\r\n    if (events.length === 0) {\r\n      return true;\r\n    }\r\n\r\n    // 如果serverUrl为空，跳过网络请求，返回false表示需要保存到离线存储\r\n    if (!this.serverUrl || this.serverUrl === 'about:blank') {\r\n      return false;\r\n    }\r\n\r\n    const { enableRetry = true, maxRetries: maxRetriesOpt } = options;\r\n    const maxRetries = maxRetriesOpt ?? this.defaultMaxRetries;\r\n\r\n    try {\r\n      if (enableRetry) {\r\n        await this.retryHandler.execute(\r\n          async () => {\r\n            const response = await post(this.serverUrl, { events });\r\n            if (!response.ok) {\r\n              throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n            }\r\n            return response;\r\n          },\r\n          {\r\n            maxRetries,\r\n            shouldRetry: error => this.retryHandler.isRetryableError(error)\r\n          }\r\n        );\r\n      } else {\r\n        const response = await post(this.serverUrl, { events });\r\n        if (!response.ok) {\r\n          throw new Error(`HTTP ${response.status}: ${response.statusText}`);\r\n        }\r\n      }\r\n\r\n      return true;\r\n    } catch (error) {\r\n      console.error('Sender: Error sending batch events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 更新服务器地址\r\n   */\r\n  setServerUrl(url: string): void {\r\n    this.serverUrl = url;\r\n  }\r\n\r\n  /**\r\n   * 更新默认最大重试次数（与 TrackerConfig.maxRetries 对齐）\r\n   */\r\n  setMaxRetries(maxRetries: number): void {\r\n    this.defaultMaxRetries = maxRetries;\r\n  }\r\n}\r\n\r\nexport default Sender;\r\n\r\n","/**\r\n * 浏览器能力检测（用于降级，避免仅 Chrome 可用）\r\n */\r\n\r\n/**\r\n * 当前环境是否支持 longtask 类型的 PerformanceObserver\r\n */\r\nexport function supportsLongTaskObserver(): boolean {\r\n  if (typeof PerformanceObserver === 'undefined') {\r\n    return false;\r\n  }\r\n  try {\r\n    const o = new PerformanceObserver(() => {});\r\n    o.observe({ entryTypes: ['longtask'] });\r\n    o.disconnect();\r\n    return true;\r\n  } catch {\r\n    return false;\r\n  }\r\n}\r\n\r\n/**\r\n * 是否支持 IntersectionObserver（曝光）\r\n */\r\nexport function supportsIntersectionObserver(): boolean {\r\n  return typeof IntersectionObserver !== 'undefined';\r\n}\r\n\r\n/**\r\n * 是否暴露 IndexedDB API\r\n */\r\nexport function supportsIndexedDBApi(): boolean {\r\n  return typeof indexedDB !== 'undefined';\r\n}\r\n","/**\r\n * 存储管理\r\n */\r\n\r\n/**\r\n * 存储接口\r\n */\r\ninterface StorageInterface {\r\n  getItem(key: string): string | null;\r\n  setItem(key: string, value: string): void;\r\n  removeItem(key: string): void;\r\n  clear(): void;\r\n}\r\n\r\n/**\r\n * LocalStorage存储\r\n */\r\nclass LocalStorage implements StorageInterface {\r\n  private storage: Storage | null = null;\r\n\r\n  constructor() {\r\n    if (typeof window !== 'undefined' && window.localStorage) {\r\n      try {\r\n        const test = '__tracker_test__';\r\n        window.localStorage.setItem(test, test);\r\n        window.localStorage.removeItem(test);\r\n        this.storage = window.localStorage;\r\n      } catch (e) {\r\n        // localStorage不可用\r\n      }\r\n    }\r\n  }\r\n\r\n  getItem(key: string): string | null {\r\n    if (!this.storage) {\r\n      return null;\r\n    }\r\n    try {\r\n      return this.storage.getItem(key);\r\n    } catch (e) {\r\n      return null;\r\n    }\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.setItem(key, value);\r\n    } catch (e) {\r\n      // 存储失败，可能是存储空间已满\r\n    }\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.removeItem(key);\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n\r\n  clear(): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.clear();\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * SessionStorage存储\r\n */\r\nclass SessionStorage implements StorageInterface {\r\n  private storage: Storage | null = null;\r\n\r\n  constructor() {\r\n    if (typeof window !== 'undefined' && window.sessionStorage) {\r\n      try {\r\n        const test = '__tracker_test__';\r\n        window.sessionStorage.setItem(test, test);\r\n        window.sessionStorage.removeItem(test);\r\n        this.storage = window.sessionStorage;\r\n      } catch (e) {\r\n        // sessionStorage不可用\r\n      }\r\n    }\r\n  }\r\n\r\n  getItem(key: string): string | null {\r\n    if (!this.storage) {\r\n      return null;\r\n    }\r\n    try {\r\n      return this.storage.getItem(key);\r\n    } catch (e) {\r\n      return null;\r\n    }\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.setItem(key, value);\r\n    } catch (e) {\r\n      // 存储失败\r\n    }\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.removeItem(key);\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n\r\n  clear(): void {\r\n    if (!this.storage) {\r\n      return;\r\n    }\r\n    try {\r\n      this.storage.clear();\r\n    } catch (e) {\r\n      // 忽略错误\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * 内存存储（降级方案）\r\n */\r\nclass MemoryStorage implements StorageInterface {\r\n  private data: Map<string, string> = new Map();\r\n\r\n  getItem(key: string): string | null {\r\n    return this.data.get(key) || null;\r\n  }\r\n\r\n  setItem(key: string, value: string): void {\r\n    this.data.set(key, value);\r\n  }\r\n\r\n  removeItem(key: string): void {\r\n    this.data.delete(key);\r\n  }\r\n\r\n  clear(): void {\r\n    this.data.clear();\r\n  }\r\n}\r\n\r\n/**\r\n * IndexedDB存储（用于离线存储大量数据）\r\n */\r\nclass IndexedDBStorage {\r\n  private dbName = '__tracker_db__';\r\n  private storeName = '__tracker_store__';\r\n  private db: IDBDatabase | null = null;\r\n  private initPromise: Promise<boolean> | null = null;\r\n\r\n  async init(): Promise<boolean> {\r\n    // 如果已经初始化，直接返回\r\n    if (this.db) {\r\n      return true;\r\n    }\r\n\r\n    // 如果正在初始化，等待初始化完成\r\n    if (this.initPromise) {\r\n      return this.initPromise;\r\n    }\r\n\r\n    if (typeof window === 'undefined' || !window.indexedDB) {\r\n      return false;\r\n    }\r\n\r\n    // 开始初始化\r\n    this.initPromise = new Promise((resolve) => {\r\n      const request = indexedDB.open(this.dbName, 1);\r\n\r\n      request.onerror = () => {\r\n        this.initPromise = null;\r\n        resolve(false);\r\n      };\r\n\r\n      request.onsuccess = () => {\r\n        this.db = request.result;\r\n        this.initPromise = null;\r\n        resolve(true);\r\n      };\r\n\r\n      request.onupgradeneeded = (event) => {\r\n        const db = (event.target as IDBOpenDBRequest).result;\r\n        if (!db.objectStoreNames.contains(this.storeName)) {\r\n          const store = db.createObjectStore(this.storeName, { keyPath: 'id', autoIncrement: true });\r\n          store.createIndex('key', 'key', { unique: true });\r\n        }\r\n      };\r\n    });\r\n\r\n    return this.initPromise;\r\n  }\r\n\r\n  async getItem(key: string): Promise<string | null> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return null;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readonly');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction for get:', error);\r\n        resolve(null);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error in get:', transaction.error);\r\n        resolve(null);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted in get');\r\n        resolve(null);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const request = index.get(key);\r\n\r\n      request.onsuccess = () => {\r\n        const result = request.result;\r\n        resolve(result ? result.value : null);\r\n      };\r\n\r\n      request.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request:', request.error);\r\n        resolve(null);\r\n      };\r\n    });\r\n  }\r\n\r\n  async setItem(key: string, value: string): Promise<boolean> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return false;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readwrite');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction:', error);\r\n        resolve(false);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error:', transaction.error);\r\n        resolve(false);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted');\r\n        resolve(false);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const getRequest = index.get(key);\r\n\r\n      getRequest.onsuccess = () => {\r\n        const data: { key: string; value: string; updatedAt: number; id?: number } = { key, value, updatedAt: Date.now() };\r\n        let request: IDBRequest;\r\n\r\n        if (getRequest.result) {\r\n          data.id = (getRequest.result as { id: number }).id;\r\n          request = store.put(data);\r\n        } else {\r\n          request = store.add(data);\r\n        }\r\n\r\n        request.onsuccess = () => {\r\n          resolve(true);\r\n        };\r\n\r\n        request.onerror = () => {\r\n          console.error('IndexedDBStorage: Error in put/add request:', request.error);\r\n          resolve(false);\r\n        };\r\n      };\r\n\r\n      getRequest.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request:', getRequest.error);\r\n        resolve(false);\r\n      };\r\n    });\r\n  }\r\n\r\n  async removeItem(key: string): Promise<boolean> {\r\n    if (!this.db) {\r\n      return false;\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      let transaction: IDBTransaction;\r\n      try {\r\n        transaction = this.db!.transaction([this.storeName], 'readwrite');\r\n      } catch (error) {\r\n        console.error('IndexedDBStorage: Error creating transaction for remove:', error);\r\n        resolve(false);\r\n        return;\r\n      }\r\n\r\n      // 监听事务错误\r\n      transaction.onerror = () => {\r\n        console.error('IndexedDBStorage: Transaction error in remove:', transaction.error);\r\n        resolve(false);\r\n      };\r\n\r\n      transaction.onabort = () => {\r\n        console.error('IndexedDBStorage: Transaction aborted in remove');\r\n        resolve(false);\r\n      };\r\n\r\n      const store = transaction.objectStore(this.storeName);\r\n      const index = store.index('key');\r\n      const request = index.get(key);\r\n\r\n      request.onsuccess = () => {\r\n        if (request.result) {\r\n          const deleteRequest = store.delete(request.result.id);\r\n          deleteRequest.onsuccess = () => resolve(true);\r\n          deleteRequest.onerror = () => {\r\n            console.error('IndexedDBStorage: Error in delete request:', deleteRequest.error);\r\n            resolve(false);\r\n          };\r\n        } else {\r\n          resolve(true); // 键不存在，视为成功\r\n        }\r\n      };\r\n\r\n      request.onerror = () => {\r\n        console.error('IndexedDBStorage: Error in get request for remove:', request.error);\r\n        resolve(false);\r\n      };\r\n    });\r\n  }\r\n\r\n  async getAll(): Promise<Array<{ key: string; value: string }>> {\r\n    if (!this.db) {\r\n      await this.init();\r\n    }\r\n    if (!this.db) {\r\n      return [];\r\n    }\r\n\r\n    return new Promise((resolve) => {\r\n      const transaction = this.db!.transaction([this.storeName], 'readonly');\r\n      const store = transaction.objectStore(this.storeName);\r\n      const request = store.getAll();\r\n\r\n      request.onsuccess = () => {\r\n        const results = request.result.map((item: { key: string; value: string }) => ({\r\n          key: item.key,\r\n          value: item.value\r\n        }));\r\n        resolve(results);\r\n      };\r\n\r\n      request.onerror = () => {\r\n        resolve([]);\r\n      };\r\n    });\r\n  }\r\n}\r\n\r\nexport const localStorage = new LocalStorage();\r\nexport const sessionStorage = new SessionStorage();\r\nexport const memoryStorage = new MemoryStorage();\r\nexport const indexedDBStorage = new IndexedDBStorage();\r\n\r\n","/**\r\n * 离线存储\r\n */\r\nimport { supportsIndexedDBApi } from '@/core/capabilities';\r\nimport { indexedDBStorage } from '@/core/storage';\r\nimport type { TrackerEvent } from '@/types';\r\n\r\nclass OfflineStorage {\r\n  private storageKey = '__tracker_offline_events__';\r\n  private maxSize: number;\r\n  private useIndexedDB: boolean = true;\r\n  private memoryStorage: Map<string, TrackerEvent[]> = new Map();\r\n  private saveQueue: Promise<void> = Promise.resolve();\r\n\r\n  /**\r\n   * 构造函数\r\n   * @param maxSize 最大存储事件数量，默认1000\r\n   */\r\n  constructor(maxSize: number = 1000) {\r\n    if (maxSize <= 0) {\r\n      throw new Error('OfflineStorage: maxSize must be positive');\r\n    }\r\n    this.maxSize = maxSize;\r\n  }\r\n\r\n  /**\r\n   * 初始化（无 IndexedDB API 时直接走内存降级，与能力检测一致）\r\n   */\r\n  async init(): Promise<void> {\r\n    if (!supportsIndexedDBApi()) {\r\n      this.useIndexedDB = false;\r\n      return;\r\n    }\r\n    const success = await indexedDBStorage.init();\r\n    if (!success) {\r\n      this.useIndexedDB = false;\r\n      console.warn('OfflineStorage: IndexedDB initialization failed, will use memory storage as fallback');\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 保存事件（使用队列确保并发安全）\r\n   */\r\n  async save(event: TrackerEvent): Promise<boolean> {\r\n    try {\r\n      // 将保存操作加入队列，确保串行执行\r\n      this.saveQueue = this.saveQueue.then(async () => {\r\n        await this.doSave(event);\r\n      }).catch(error => {\r\n        console.error('OfflineStorage: Error in save queue:', error);\r\n        // 重新抛出错误，让调用者能够感知\r\n        throw error;\r\n      });\r\n\r\n      await this.saveQueue;\r\n      return true;\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error saving event:', error);\r\n      // 即使保存失败，也尝试降级到内存存储\r\n      try {\r\n        const events = this.memoryStorage.get(this.storageKey) || [];\r\n        if (events.length >= this.maxSize) {\r\n          events.shift();\r\n        }\r\n        events.push(this.sanitizeEvent(event));\r\n        this.memoryStorage.set(this.storageKey, events);\r\n        return true;\r\n      } catch (fallbackError) {\r\n        console.error('OfflineStorage: Fallback storage also failed:', fallbackError);\r\n        return false;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 实际保存操作\r\n   */\r\n  private async doSave(event: TrackerEvent): Promise<void> {\r\n    try {\r\n      // 安全的JSON序列化，处理循环引用\r\n      const safeEvent = this.sanitizeEvent(event);\r\n      \r\n      const events = await this.getAll();\r\n      if (events.length >= this.maxSize) {\r\n        // 删除最旧的事件\r\n        events.shift();\r\n      }\r\n\r\n      events.push(safeEvent);\r\n\r\n      if (this.useIndexedDB) {\r\n        const data = this.safeStringify(events);\r\n        if (!data) {\r\n          throw new Error('Failed to stringify events');\r\n        }\r\n        \r\n        const success = await indexedDBStorage.setItem(this.storageKey, data);\r\n        if (!success) {\r\n          // 降级到内存存储\r\n          this.useIndexedDB = false;\r\n          this.memoryStorage.set(this.storageKey, events);\r\n        }\r\n      } else {\r\n        // 使用内存存储\r\n        this.memoryStorage.set(this.storageKey, events);\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error in doSave:', error);\r\n      // 降级到内存存储\r\n      if (this.useIndexedDB) {\r\n        this.useIndexedDB = false;\r\n        const events = this.memoryStorage.get(this.storageKey) || [];\r\n        if (events.length >= this.maxSize) {\r\n          events.shift();\r\n        }\r\n        events.push(this.sanitizeEvent(event));\r\n        this.memoryStorage.set(this.storageKey, events);\r\n      } else {\r\n        throw error;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清理事件对象，移除循环引用\r\n   */\r\n  private sanitizeEvent(event: TrackerEvent): TrackerEvent {\r\n    // 创建事件副本，移除可能的循环引用\r\n    const sanitized: TrackerEvent = {\r\n      ...event,\r\n      properties: event.properties ? this.sanitizeObject(event.properties) : undefined\r\n    };\r\n    return sanitized;\r\n  }\r\n\r\n  /**\r\n   * 清理对象，移除循环引用\r\n   */\r\n  private sanitizeObject(obj: Record<string, unknown>, visited = new WeakSet()): Record<string, unknown> {\r\n    if (typeof obj !== 'object' || obj === null) {\r\n      return obj;\r\n    }\r\n\r\n    if (visited.has(obj)) {\r\n      return {}; // 发现循环引用，返回空对象\r\n    }\r\n\r\n    visited.add(obj);\r\n    const result: Record<string, unknown> = {};\r\n\r\n    for (const [key, value] of Object.entries(obj)) {\r\n      if (typeof value === 'object' && value !== null) {\r\n        result[key] = this.sanitizeObject(value as Record<string, unknown>, visited);\r\n      } else {\r\n        result[key] = value;\r\n      }\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * 安全的JSON序列化，处理循环引用\r\n   */\r\n  private safeStringify(obj: unknown): string | null {\r\n    try {\r\n      return JSON.stringify(obj);\r\n    } catch (error) {\r\n      // 如果序列化失败，尝试清理循环引用后再次序列化\r\n      try {\r\n        if (typeof obj === 'object' && obj !== null) {\r\n          const sanitized = this.sanitizeObject(obj as Record<string, unknown>);\r\n          return JSON.stringify(sanitized);\r\n        }\r\n        return JSON.stringify(obj);\r\n      } catch (e) {\r\n        console.error('OfflineStorage: Failed to stringify after sanitization:', e);\r\n        return null;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取所有事件\r\n   */\r\n  async getAll(): Promise<TrackerEvent[]> {\r\n    try {\r\n      if (this.useIndexedDB) {\r\n        const data = await indexedDBStorage.getItem(this.storageKey);\r\n        if (!data) {\r\n          return [];\r\n        }\r\n        return JSON.parse(data) as TrackerEvent[];\r\n      } else {\r\n        // 使用内存存储\r\n        return this.memoryStorage.get(this.storageKey) || [];\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error getting events:', error);\r\n      // 降级到内存存储\r\n      if (this.useIndexedDB) {\r\n        this.useIndexedDB = false;\r\n        return this.memoryStorage.get(this.storageKey) || [];\r\n      }\r\n      return [];\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 删除事件\r\n   */\r\n  async remove(events: TrackerEvent[]): Promise<boolean> {\r\n    try {\r\n      const allEvents = await this.getAll();\r\n      const eventMap = new Map(events.map(e => [this.getEventKey(e), e]));\r\n\r\n      const remainingEvents = allEvents.filter(e => !eventMap.has(this.getEventKey(e)));\r\n\r\n      if (remainingEvents.length === 0) {\r\n        if (this.useIndexedDB) {\r\n          await indexedDBStorage.removeItem(this.storageKey);\r\n        } else {\r\n          this.memoryStorage.delete(this.storageKey);\r\n        }\r\n        return true;\r\n      }\r\n\r\n      if (this.useIndexedDB) {\r\n        const data = this.safeStringify(remainingEvents);\r\n        if (!data) {\r\n          throw new Error('Failed to stringify remaining events');\r\n        }\r\n        const success = await indexedDBStorage.setItem(this.storageKey, data);\r\n        if (!success) {\r\n          // 降级到内存存储\r\n          this.useIndexedDB = false;\r\n          this.memoryStorage.set(this.storageKey, remainingEvents);\r\n          return true;\r\n        }\r\n        return success;\r\n      } else {\r\n        this.memoryStorage.set(this.storageKey, remainingEvents);\r\n        return true;\r\n      }\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error removing events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清空所有事件\r\n   */\r\n  async clear(): Promise<boolean> {\r\n    try {\r\n      if (this.useIndexedDB) {\r\n        await indexedDBStorage.removeItem(this.storageKey);\r\n      } else {\r\n        this.memoryStorage.delete(this.storageKey);\r\n      }\r\n      return true;\r\n    } catch (error) {\r\n      console.error('OfflineStorage: Error clearing events:', error);\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取事件数量\r\n   */\r\n  async getCount(): Promise<number> {\r\n    const events = await this.getAll();\r\n    return events.length;\r\n  }\r\n\r\n  /**\r\n   * 获取事件唯一标识\r\n   */\r\n  private getEventKey(event: TrackerEvent): string {\r\n    return `${event.type}-${event.name}-${event.timestamp}-${event.url}`;\r\n  }\r\n}\r\n\r\nexport default OfflineStorage;\r\n\r\n","import type { TrackerEvent } from '@/types';\n\ninterface AddEventOptions {\n  onBatchComplete?: (events: TrackerEvent[], success: boolean) => void;\n}\n\ntype BatchCompleteCallback = (events: TrackerEvent[], success: boolean) => void;\n\nclass EventQueue {\n  private queue: TrackerEvent[] = [];\n  private eventCallbacks: Map<TrackerEvent, AddEventOptions> = new Map();\n\n  add(event: TrackerEvent, options?: AddEventOptions): number {\n    this.queue.push(event);\n\n    if (options?.onBatchComplete) {\n      this.eventCallbacks.set(event, options);\n    }\n\n    return this.queue.length;\n  }\n\n  size(): number {\n    return this.queue.length;\n  }\n\n  isEmpty(): boolean {\n    return this.queue.length === 0;\n  }\n\n  drain(): {\n    events: TrackerEvent[];\n    callbackMap: Map<BatchCompleteCallback, TrackerEvent[]>;\n  } {\n    const events = [...this.queue];\n    this.queue = [];\n\n    const callbackMap = new Map<BatchCompleteCallback, TrackerEvent[]>();\n\n    events.forEach(event => {\n      const options = this.eventCallbacks.get(event);\n      if (options?.onBatchComplete) {\n        const callback = options.onBatchComplete;\n        if (!callbackMap.has(callback)) {\n          callbackMap.set(callback, []);\n        }\n        callbackMap.get(callback)!.push(event);\n      }\n      this.eventCallbacks.delete(event);\n    });\n\n    return { events, callbackMap };\n  }\n}\n\nexport type { AddEventOptions, BatchCompleteCallback };\nexport default EventQueue;\n","class FlushScheduler {\n  private timer: ReturnType<typeof setTimeout> | null = null;\n  private batchSize: number;\n  private batchWait: number;\n\n  constructor(\n    options: { batchSize?: number; batchWait?: number } = {},\n    private readonly onFlush: () => void\n  ) {\n    this.batchSize = options.batchSize ?? 10;\n    this.batchWait = options.batchWait ?? 5000;\n  }\n\n  schedule(queueLength: number): void {\n    if (this.batchSize === 0) {\n      this.onFlush();\n      return;\n    }\n\n    if (queueLength >= this.batchSize) {\n      this.onFlush();\n      return;\n    }\n\n    if (this.batchWait === 0) {\n      this.onFlush();\n      return;\n    }\n\n    if (!this.timer) {\n      this.timer = setTimeout(() => {\n        this.onFlush();\n      }, this.batchWait);\n    }\n  }\n\n  clear(): void {\n    if (this.timer) {\n      clearTimeout(this.timer);\n      this.timer = null;\n    }\n  }\n\n  getTimer(): ReturnType<typeof setTimeout> | null {\n    return this.timer;\n  }\n\n  setOptions(options: { batchSize?: number; batchWait?: number }): void {\n    if (options.batchSize !== undefined) {\n      this.batchSize = options.batchSize;\n    }\n    if (options.batchWait !== undefined) {\n      this.batchWait = options.batchWait;\n    }\n  }\n}\n\nexport default FlushScheduler;\n","import type { TrackerEvent } from '@/types';\nimport type Sender from './sender';\nimport type { BatchCompleteCallback } from './event-queue';\nimport type OfflineRecoveryManager from './offline-recovery-manager';\n\ninterface DeliveryCoordinatorOptions {\n  maxRetries: number;\n  enableOfflineStorage: boolean;\n}\n\nclass DeliveryCoordinator {\n  constructor(\n    private readonly sender: Sender,\n    private readonly offlineRecoveryManager: OfflineRecoveryManager\n  ) {}\n\n  async deliverBatch(\n    events: TrackerEvent[],\n    callbackMap: Map<BatchCompleteCallback, TrackerEvent[]>,\n    options: DeliveryCoordinatorOptions\n  ): Promise<void> {\n    try {\n      const success = await this.sender.sendBatch(events, { maxRetries: options.maxRetries });\n\n      if (!success && options.enableOfflineStorage) {\n        await this.offlineRecoveryManager.persistFailedEvents(events);\n      }\n\n      this.dispatchCallbacks(callbackMap, success);\n    } catch (error) {\n      console.error('BatchSender: Error flushing events:', error);\n\n      if (options.enableOfflineStorage) {\n        await this.offlineRecoveryManager.persistFailedEvents(events);\n      }\n\n      this.dispatchCallbacks(callbackMap, false);\n    }\n  }\n\n  private dispatchCallbacks(\n    callbackMap: Map<BatchCompleteCallback, TrackerEvent[]>,\n    success: boolean\n  ): void {\n    callbackMap.forEach((callbackEvents, callback) => {\n      try {\n        callback(callbackEvents, success);\n      } catch (error) {\n        console.error('BatchSender: Error in batch complete callback:', error);\n      }\n    });\n  }\n}\n\nexport default DeliveryCoordinator;\n","import type { TrackerEvent } from '@/types';\nimport type Sender from './sender';\nimport type OfflineStorage from './offline-storage';\n\ninterface OfflineRecoveryOptions {\n  batchSize: number;\n  maxRetries: number;\n}\n\nclass OfflineRecoveryManager {\n  constructor(\n    private readonly sender: Sender,\n    private readonly offlineStorage: OfflineStorage\n  ) {}\n\n  async persistFailedEvents(events: TrackerEvent[]): Promise<void> {\n    for (const event of events) {\n      await this.offlineStorage.save(event);\n    }\n  }\n\n  async recoverStoredEvents(options: OfflineRecoveryOptions): Promise<void> {\n    try {\n      const events = await this.offlineStorage.getAll();\n      if (events.length === 0) {\n        return;\n      }\n\n      for (let i = 0; i < events.length; i += options.batchSize) {\n        const batch = events.slice(i, i + options.batchSize);\n        const success = await this.sender.sendBatch(batch, { maxRetries: options.maxRetries });\n\n        if (success) {\n          await this.offlineStorage.remove(batch);\n        } else {\n          break;\n        }\n      }\n    } catch (error) {\n      console.error('BatchSender: Error flushing offline events:', error);\n    }\n  }\n}\n\nexport default OfflineRecoveryManager;\n","/**\r\n * 批量发送器\r\n */\r\nimport type { TrackerEvent } from '@/types';\nimport Sender from './sender';\nimport OfflineStorage from './offline-storage';\nimport EventQueue, { type AddEventOptions } from './event-queue';\nimport FlushScheduler from './flush-scheduler';\nimport DeliveryCoordinator from './delivery-coordinator';\nimport OfflineRecoveryManager from './offline-recovery-manager';\nimport type { BatchSenderState } from './batch-sender-state';\n\r\ninterface BatchSenderOptions {\r\n  /** 批量大小 */\r\n  batchSize?: number;\r\n  /** 批量等待时间（毫秒） */\r\n  batchWait?: number;\r\n  /** 是否启用离线存储 */\r\n  enableOfflineStorage?: boolean;\r\n  /** 离线存储最大事件数量 */\r\n  maxOfflineStorageSize?: number;\r\n  /** 最大重试次数（与 TrackerConfig.maxRetries 一致） */\r\n  maxRetries?: number;\r\n}\r\n\r\nclass BatchSender {\n  private sender: Sender;\n  private offlineStorage: OfflineStorage;\n  private eventQueue: EventQueue;\n  private flushScheduler: FlushScheduler;\n  private deliveryCoordinator: DeliveryCoordinator;\n  private offlineRecoveryManager: OfflineRecoveryManager;\n  private batchSize: number;\n  private maxRetries: number;\n  private enableOfflineStorage: boolean;\n  private state: BatchSenderState = 'idle';\n  private isProcessing: boolean = false;\n  private flushPromise: Promise<void> | null = null;\n  private isInitialized: boolean = false;\n  private initPromise: Promise<void> | null = null;\n\n  constructor(serverUrl: string, options: BatchSenderOptions = {}) {\n    this.maxRetries = options.maxRetries ?? 3;\n    this.sender = new Sender(serverUrl, { maxRetries: this.maxRetries });\n    this.offlineStorage = new OfflineStorage(options.maxOfflineStorageSize ?? 1000);\n    this.eventQueue = new EventQueue();\n    this.offlineRecoveryManager = new OfflineRecoveryManager(this.sender, this.offlineStorage);\n    this.deliveryCoordinator = new DeliveryCoordinator(this.sender, this.offlineRecoveryManager);\n    this.batchSize = options.batchSize ?? 10;\n    this.flushScheduler = new FlushScheduler(\n      {\n        batchSize: options.batchSize,\n        batchWait: options.batchWait\n      },\n      () => {\n        void this.flush();\n      }\n    );\n    this.enableOfflineStorage = options.enableOfflineStorage ?? true;\n\r\n    // 异步初始化，但不阻塞构造函数\n    this.initPromise = this.init();\n  }\n\n  get timer(): ReturnType<typeof setTimeout> | null {\n    return this.flushScheduler.getTimer();\n  }\n\n  getState(): BatchSenderState {\n    return this.state;\n  }\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  private async init(): Promise<void> {\n    if (this.enableOfflineStorage) {\n      await this.offlineStorage.init();\n      void this.offlineRecoveryManager.recoverStoredEvents({\n        batchSize: this.batchSize,\n        maxRetries: this.maxRetries\n      });\n    }\n    this.isInitialized = true;\n  }\n\r\n  /**\r\n   * 确保初始化完成\r\n   */\r\n  private async ensureInitialized(): Promise<void> {\r\n    if (!this.isInitialized && this.initPromise) {\r\n      await this.initPromise;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 添加事件到队列\r\n   */\r\n  add(event: TrackerEvent, options?: AddEventOptions): void {\n    const queueLength = this.eventQueue.add(event, options);\n    this.flushScheduler.schedule(queueLength);\n    if (this.state === 'idle' && queueLength > 0) {\n      this.state = this.timer ? 'scheduled' : this.state;\n    }\n  }\n\r\n  /**\r\n   * 添加事件到队列（异步版本，确保初始化完成）\r\n   */\r\n  async addAsync(event: TrackerEvent): Promise<void> {\r\n    await this.ensureInitialized();\r\n    this.add(event);\r\n  }\r\n\r\n  /**\r\n   * 立即发送队列中的所有事件\r\n   */\r\n  async flush(): Promise<void> {\n    // 如果正在处理，返回正在进行的 flush（保证调用方可 await）\n    if (this.isProcessing) {\n      await (this.flushPromise ?? Promise.resolve());\n      return;\n    }\n\n    // 如果队列为空，直接返回\n    if (this.eventQueue.isEmpty()) {\n      if (this.state === 'destroying') {\n        this.state = 'destroyed';\n      } else if (this.state !== 'destroyed') {\n        this.state = 'idle';\n      }\n      return;\n    }\n\r\n    // 确保初始化完成\r\n    await this.ensureInitialized();\n\n    // 设置处理标志，防止并发\n    this.isProcessing = true;\n    this.state = 'flushing';\n    this.flushPromise = (async () => {\n      this.flushScheduler.clear();\n\n      const { events, callbackMap } = this.eventQueue.drain();\n\n      try {\n        await this.deliveryCoordinator.deliverBatch(events, callbackMap, {\n          maxRetries: this.maxRetries,\n          enableOfflineStorage: this.enableOfflineStorage\n        });\n      } finally {\n        this.isProcessing = false;\n        this.flushPromise = null;\n\n        // 如果处理过程中有新事件加入队列，再次触发flush\n        if (!this.eventQueue.isEmpty()) {\n          this.state = this.state === 'destroying' ? 'destroying' : 'scheduled';\n          // 使用setTimeout避免递归调用栈溢出\n          setTimeout(() => {\n            this.flush().catch(error => {\n              console.error('BatchSender: Error in recursive flush:', error);\n            });\n          }, 0);\n        } else if (this.state === 'destroying') {\n          this.state = 'destroyed';\n        } else {\n          this.state = 'idle';\n        }\n      }\n    })();\n\r\n    await this.flushPromise;\r\n  }\r\n\r\n  /**\r\n   * 更新服务器地址\r\n   */\r\n  setServerUrl(url: string): void {\r\n    this.sender.setServerUrl(url);\r\n  }\r\n\r\n  /**\r\n   * 更新最大重试次数（与 Tracker.updateConfig 联动）\r\n   */\r\n  setMaxRetries(maxRetries: number): void {\r\n    this.maxRetries = maxRetries;\r\n    this.sender.setMaxRetries(maxRetries);\r\n  }\r\n\r\n  /**\r\n   * 更新批量参数（与 Tracker.updateConfig 联动）\r\n   */\r\n  setBatchOptions(options: { batchSize?: number; batchWait?: number }): void {\n    if (options.batchSize !== undefined) {\n      this.batchSize = options.batchSize;\n    }\n    this.flushScheduler.setOptions(options);\n  }\n\r\n  /**\r\n   * 获取离线存储的所有事件\r\n   */\r\n  async getOfflineEvents(): Promise<TrackerEvent[]> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.getAll();\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的事件数量\r\n   */\r\n  async getOfflineEventCount(): Promise<number> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.getCount();\r\n  }\r\n\r\n  /**\r\n   * 清空离线存储\r\n   */\r\n  async clearOfflineStorage(): Promise<boolean> {\r\n    await this.ensureInitialized();\r\n    return this.offlineStorage.clear();\r\n  }\r\n\r\n  /**\r\n   * 销毁（同步版本，不等待异步操作完成）\r\n   */\r\n  destroy(): void {\n    this.state = 'destroying';\n    this.flushScheduler.clear();\n    // 注意：flush是异步的，但destroy是同步的\n    // 在页面卸载时，浏览器可能会中断异步操作\n    // 如果需要确保事件发送完成，应该调用destroyAsync\n    this.flush().catch(error => {\r\n      console.error('BatchSender: Error during destroy flush:', error);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 异步销毁（等待所有事件发送完成）\r\n   */\r\n  async destroyAsync(): Promise<void> {\n    this.state = 'destroying';\n    this.flushScheduler.clear();\n    // 等待剩余事件发送完成\n    await this.flush();\n    this.state = 'destroyed';\n  }\n}\n\r\nexport default BatchSender;\r\n\r\n","import type { TrackerInstance, TrackerPlugin } from '@/types';\n\nclass PluginLifecycle {\n  canInstall(\n    plugin: TrackerPlugin,\n    installedPlugins: Map<string, TrackerPlugin>,\n    trackerInstance: TrackerInstance | null\n  ): boolean {\n    if (installedPlugins.has(plugin.name)) {\n      console.warn(`PluginManager: Plugin \"${plugin.name}\" is already installed`);\n      return false;\n    }\n\n    if (!trackerInstance) {\n      console.error('PluginManager: Tracker instance is not set');\n      return false;\n    }\n\n    return true;\n  }\n\n  install(plugin: TrackerPlugin, trackerInstance: TrackerInstance): boolean {\n    try {\n      plugin.install(trackerInstance);\n      return true;\n    } catch (error) {\n      console.error(`PluginManager: Error installing plugin \"${plugin.name}\":`, error);\n      return false;\n    }\n  }\n\n  uninstall(pluginName: string, plugin: TrackerPlugin, trackerInstance: TrackerInstance | null): void {\n    if (!plugin.uninstall || !trackerInstance) {\n      return;\n    }\n\n    try {\n      plugin.uninstall(trackerInstance);\n    } catch (error) {\n      console.error(`PluginManager: Error uninstalling plugin \"${pluginName}\":`, error);\n    }\n  }\n}\n\nexport default PluginLifecycle;\n","/**\n * 插件管理器\n */\nimport type { TrackerPlugin, TrackerInstance } from '@/types';\nimport PluginLifecycle from './plugin-lifecycle';\n\nclass PluginManager {\n  private plugins: Map<string, TrackerPlugin> = new Map();\n  private trackerInstance: TrackerInstance | null = null;\n  private lifecycle: PluginLifecycle;\n\n  constructor(lifecycle: PluginLifecycle = new PluginLifecycle()) {\n    this.lifecycle = lifecycle;\n  }\n\n  /**\n   * 设置Tracker实例\n   */\n  setTrackerInstance(instance: TrackerInstance): void {\r\n    this.trackerInstance = instance;\r\n  }\r\n\r\n  /**\n   * 安装插件\n   */\n  use(plugin: TrackerPlugin): void {\n    if (!this.lifecycle.canInstall(plugin, this.plugins, this.trackerInstance)) {\n      return;\n    }\n\n    if (this.lifecycle.install(plugin, this.trackerInstance!)) {\n      this.plugins.set(plugin.name, plugin);\n    }\n  }\n\r\n  /**\r\n   * 卸载插件\r\n   */\r\n  unuse(pluginName: string): void {\n    const plugin = this.plugins.get(pluginName);\n    if (!plugin) {\n      return;\n    }\n\n    this.lifecycle.uninstall(pluginName, plugin, this.trackerInstance);\n    this.plugins.delete(pluginName);\n  }\n\r\n  /**\r\n   * 获取插件\r\n   */\r\n  get(pluginName: string): TrackerPlugin | undefined {\r\n    return this.plugins.get(pluginName);\r\n  }\r\n\r\n  /**\r\n   * 获取所有插件\r\n   */\r\n  getAll(): TrackerPlugin[] {\r\n    return Array.from(this.plugins.values());\r\n  }\r\n\r\n  /**\r\n   * 清空所有插件\r\n   */\r\n  clear(): void {\r\n    for (const pluginName of this.plugins.keys()) {\r\n      this.unuse(pluginName);\r\n    }\r\n  }\r\n}\r\n\r\nexport default PluginManager;\r\n\r\n","/**\r\n * 用户行为分析\r\n */\r\nimport type { PageViewEvent } from '@/types';\r\n\r\nexport interface BehaviorMetrics {\r\n  /** 页面浏览量 */\r\n  pv: number;\r\n  /** 独立访客数 */\r\n  uv: number;\r\n  /** 会话数 */\r\n  sessions: number;\r\n  /** 平均停留时长 */\r\n  avgDuration: number;\r\n  /** 访问路径 */\r\n  paths: string[];\r\n}\r\n\r\nclass BehaviorAnalysis {\r\n  private pageViews: PageViewEvent[] = [];\r\n  private startTime: number = Date.now();\r\n\r\n  constructor() {\r\n    // deviceId和sessionId在getMetrics中从事件中获取，不需要单独存储\r\n  }\r\n\r\n  /**\r\n   * 分析页面浏览事件\r\n   */\r\n  analyzePageView(event: PageViewEvent): void {\r\n    this.pageViews.push(event);\r\n  }\r\n\r\n  /**\r\n   * 获取行为指标\r\n   */\r\n  getMetrics(): BehaviorMetrics {\r\n    const uniqueDevices = new Set<string>();\r\n    const uniqueSessions = new Set<string>();\r\n    let totalDuration = 0;\r\n    const paths: string[] = [];\r\n\r\n    this.pageViews.forEach(event => {\r\n      if (event.deviceId) {\r\n        uniqueDevices.add(event.deviceId);\r\n      }\r\n      if (event.sessionId) {\r\n        uniqueSessions.add(event.sessionId);\r\n      }\r\n      if (event.duration) {\r\n        totalDuration += event.duration;\r\n      }\r\n      paths.push(event.url);\r\n    });\r\n\r\n    return {\r\n      pv: this.pageViews.length,\r\n      uv: uniqueDevices.size,\r\n      sessions: uniqueSessions.size,\r\n      avgDuration: this.pageViews.length > 0 ? totalDuration / this.pageViews.length : 0,\r\n      paths\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 获取访问路径\r\n   */\r\n  getVisitPath(): string[] {\r\n    return this.pageViews.map(event => event.url);\r\n  }\r\n\r\n  /**\r\n   * 获取停留时长\r\n   */\r\n  getDuration(): number {\r\n    return Date.now() - this.startTime;\r\n  }\r\n\r\n  /**\r\n   * 重置\r\n   */\r\n  reset(): void {\r\n    this.pageViews = [];\r\n    this.startTime = Date.now();\r\n  }\r\n}\r\n\r\nexport default BehaviorAnalysis;\r\n\r\n","import type { PerformanceEvent } from '@/types/event';\nimport type { AlertRule, PerformanceAlert } from '@/types/performance';\n\ninterface PerformanceAlertEngineOptions {\n  onAlert: (alert: PerformanceAlert) => void;\n}\n\nclass PerformanceAlertEngine {\n  constructor(private readonly options: PerformanceAlertEngineOptions) {}\n\n  evaluate(\n    event: PerformanceEvent,\n    alertRules: AlertRule[],\n    alerts: PerformanceAlert[]\n  ): PerformanceAlert[] {\n    if (event.metricType !== 'navigation' && event.metricType !== 'longtask') {\n      return [];\n    }\n\n    const triggeredAlerts: PerformanceAlert[] = [];\n\n    for (const rule of alertRules) {\n      if (!rule.enabled) {\n        continue;\n      }\n\n      const value = this.resolveMetricValue(rule, event);\n      if (value === undefined || !this.isTriggered(rule, value)) {\n        continue;\n      }\n\n      const alert = this.createAlert(rule, value, event);\n      alerts.push(alert);\n      triggeredAlerts.push(alert);\n      this.options.onAlert(alert);\n    }\n\n    return triggeredAlerts;\n  }\n\n  private resolveMetricValue(rule: AlertRule, event: PerformanceEvent): number | undefined {\n    if (rule.metric === 'ttfb' && event.metricType === 'navigation') {\n      return event.metrics.ttfb;\n    }\n    if (rule.metric === 'total' && event.metricType === 'navigation') {\n      return event.metrics.total;\n    }\n    if (rule.metric === 'longtask' && event.metricType === 'longtask') {\n      return event.metrics.duration;\n    }\n    return undefined;\n  }\n\n  private isTriggered(rule: AlertRule, value: number): boolean {\n    switch (rule.operator) {\n      case '>':\n        return value > rule.threshold;\n      case '>=':\n        return value >= rule.threshold;\n      case '<':\n        return value < rule.threshold;\n      case '<=':\n        return value <= rule.threshold;\n      default:\n        return false;\n    }\n  }\n\n  private createAlert(\n    rule: AlertRule,\n    value: number,\n    event: PerformanceEvent\n  ): PerformanceAlert {\n    let level: 'warning' | 'error' | 'critical' = 'warning';\n    if (value > rule.threshold * 2) {\n      level = 'critical';\n    } else if (value > rule.threshold * 1.5) {\n      level = 'error';\n    }\n\n    return {\n      id: `alert-${Date.now()}-${Math.random().toString(36).substring(2, 11)}`,\n      ruleId: rule.id,\n      level,\n      message: rule.message || `${rule.name}: ${value.toFixed(2)}ms 超过阈值 ${rule.threshold}ms`,\n      value,\n      threshold: rule.threshold,\n      timestamp: Date.now(),\n      url: event.url,\n      resolved: false\n    };\n  }\n}\n\nexport default PerformanceAlertEngine;\n","class PerformanceCleanupScheduler {\n  private timer: number | null = null;\n\n  start(onCleanup: () => void): number | null {\n    if (this.timer || typeof window === 'undefined') {\n      return this.timer;\n    }\n\n    this.timer = window.setInterval(() => {\n      onCleanup();\n    }, 3600000);\n\n    return this.timer;\n  }\n\n  stop(): void {\n    if (!this.timer || typeof window === 'undefined') {\n      this.timer = null;\n      return;\n    }\n\n    clearInterval(this.timer);\n    this.timer = null;\n  }\n\n  getTimer(): number | null {\n    return this.timer;\n  }\n}\n\nexport default PerformanceCleanupScheduler;\n","import type { PerformanceEvent } from '@/types/event';\nimport type { PerformanceMetrics } from '@/types/performance';\n\nclass PerformanceMetricsAggregator {\n  build(\n    events: PerformanceEvent[],\n    startTime?: number,\n    endTime?: number\n  ): PerformanceMetrics {\n    const now = Date.now();\n    const start = startTime || now - 3600000;\n    const end = endTime || now;\n\n    const filteredEvents = events.filter(\n      event => event.timestamp >= start && event.timestamp <= end\n    );\n\n    const navigationEvents = filteredEvents.filter(\n      event => event.metricType === 'navigation'\n    );\n    const resourceEvents = filteredEvents.filter(\n      event => event.metricType === 'resource'\n    );\n    const longTaskEvents = filteredEvents.filter(\n      event => event.metricType === 'longtask'\n    );\n\n    const navigation = {\n      dns: this.average(navigationEvents.map(event => event.metrics), 'dns'),\n      tcp: this.average(navigationEvents.map(event => event.metrics), 'tcp'),\n      ssl: this.average(navigationEvents.map(event => event.metrics), 'ssl'),\n      ttfb: this.average(navigationEvents.map(event => event.metrics), 'ttfb'),\n      response: this.average(navigationEvents.map(event => event.metrics), 'response'),\n      domParse: this.average(navigationEvents.map(event => event.metrics), 'domParse'),\n      resourceLoad: this.average(navigationEvents.map(event => event.metrics), 'resourceLoad'),\n      total: this.average(navigationEvents.map(event => event.metrics), 'total'),\n      domContentLoaded: this.average(navigationEvents.map(event => event.metrics), 'domContentLoaded'),\n      load: this.average(navigationEvents.map(event => event.metrics), 'load')\n    };\n\n    const resources = this.buildResourceMetrics(resourceEvents);\n    const longTasks = this.buildLongTaskMetrics(longTaskEvents);\n\n    return {\n      navigation,\n      resources,\n      longTasks,\n      timeRange: {\n        start,\n        end\n      }\n    };\n  }\n\n  private buildResourceMetrics(resourceEvents: PerformanceEvent[]): PerformanceMetrics['resources'] {\n    const resources: PerformanceMetrics['resources'] = {\n      total: resourceEvents.length,\n      avgLoadTime: 0,\n      maxLoadTime: 0,\n      totalSize: 0,\n      byType: {}\n    };\n\n    if (resourceEvents.length === 0) {\n      return resources;\n    }\n\n    const loadTimes = resourceEvents.map(event => event.metrics.total || 0).filter(time => time > 0);\n    if (loadTimes.length > 0) {\n      resources.avgLoadTime = loadTimes.reduce((a, b) => a + b, 0) / loadTimes.length;\n      resources.maxLoadTime = Math.max(...loadTimes);\n    }\n\n    resources.totalSize = resourceEvents.reduce(\n      (sum, event) => sum + ((event.metrics as unknown as { size?: number }).size || 0),\n      0\n    );\n\n    const typeMap = new Map<string, number[]>();\n    resourceEvents.forEach(event => {\n      const metrics = event.metrics as unknown as { resourceType?: string; total?: number };\n      const type = metrics.resourceType || 'unknown';\n      if (!typeMap.has(type)) {\n        typeMap.set(type, []);\n      }\n      typeMap.get(type)!.push(metrics.total || 0);\n    });\n\n    typeMap.forEach((times, type) => {\n      const typeEvents = resourceEvents.filter(event => {\n        const metrics = event.metrics as unknown as { resourceType?: string };\n        return metrics.resourceType === type;\n      });\n\n      resources.byType[type] = {\n        count: times.length,\n        avgLoadTime: times.reduce((a, b) => a + b, 0) / times.length,\n        totalSize: typeEvents.reduce((sum, event) => {\n          const metrics = event.metrics as unknown as { size?: number };\n          return sum + (metrics.size || 0);\n        }, 0)\n      };\n    });\n\n    return resources;\n  }\n\n  private buildLongTaskMetrics(longTaskEvents: PerformanceEvent[]): PerformanceMetrics['longTasks'] {\n    const longTasks: PerformanceMetrics['longTasks'] = {\n      total: longTaskEvents.length,\n      avgDuration: 0,\n      maxDuration: 0,\n      recent: longTaskEvents\n        .slice(-10)\n        .map(event => ({\n          duration: event.metrics.duration || 0,\n          startTime: event.metrics.startTime || 0,\n          timestamp: event.timestamp\n        }))\n    };\n\n    if (longTaskEvents.length === 0) {\n      return longTasks;\n    }\n\n    const durations = longTaskEvents.map(event => event.metrics.duration || 0).filter(duration => duration > 0);\n    if (durations.length > 0) {\n      longTasks.avgDuration = durations.reduce((a, b) => a + b, 0) / durations.length;\n      longTasks.maxDuration = Math.max(...durations);\n    }\n\n    return longTasks;\n  }\n\n  private average(metrics: Array<Record<string, number>>, key: string): number {\n    const values = metrics.map(metric => metric[key] || 0).filter(value => value > 0);\n    if (values.length === 0) {\n      return 0;\n    }\n    return values.reduce((a, b) => a + b, 0) / values.length;\n  }\n}\n\nexport default PerformanceMetricsAggregator;\n","import { indexedDBStorage } from '@/core/storage';\nimport type { PerformanceAlert } from '@/types/performance';\nimport type { PerformanceEvent } from '@/types/event';\n\ninterface PerformanceMonitorStorageData {\n  events: PerformanceEvent[];\n  alerts: PerformanceAlert[];\n  timestamp: number;\n}\n\nclass PerformanceMonitorStorage {\n  constructor(private readonly storageKey: string) {}\n\n  async save(events: PerformanceEvent[], alerts: PerformanceAlert[]): Promise<void> {\n    try {\n      const data: PerformanceMonitorStorageData = {\n        events: events.slice(-1000),\n        alerts: alerts.slice(-100),\n        timestamp: Date.now()\n      };\n      await indexedDBStorage.setItem(this.storageKey, JSON.stringify(data));\n    } catch (error) {\n      console.error('PerformanceMonitor: Failed to save to storage:', error);\n    }\n  }\n\n  async load(): Promise<Partial<PerformanceMonitorStorageData>> {\n    try {\n      const dataStr = await indexedDBStorage.getItem(this.storageKey);\n      if (!dataStr) {\n        return {};\n      }\n      return JSON.parse(dataStr) as Partial<PerformanceMonitorStorageData>;\n    } catch (error) {\n      console.error('PerformanceMonitor: Failed to load history data:', error);\n      return {};\n    }\n  }\n}\n\nexport default PerformanceMonitorStorage;\n","/**\r\n * 性能监控管理器\r\n * 负责收集性能数据、告警规则引擎、报告生成\r\n */\r\nimport type { PerformanceEvent } from '@/types/event';\r\nimport type {\r\n  PerformanceMetrics,\r\n  PerformanceAlert,\r\n  PerformanceReport,\r\n  AlertRule,\r\n  ReportOptions,\r\n  PerformanceMonitorOptions\r\n} from '@/types/performance';\r\nimport { eventBus } from '@/core/event-bus';\nimport PerformanceAlertEngine from './performance-alert-engine';\nimport PerformanceCleanupScheduler from './performance-cleanup-scheduler';\nimport PerformanceMetricsAggregator from './performance-metrics-aggregator';\nimport PerformanceMonitorStorage from './performance-monitor-storage';\n\r\n/**\r\n * 性能监控管理器\r\n */\r\nexport class PerformanceMonitor {\r\n  private events: PerformanceEvent[] = [];\r\n  private alerts: PerformanceAlert[] = [];\r\n  private alertRules: AlertRule[] = [];\r\n  private options: Required<PerformanceMonitorOptions>;\n  private storageKey: string;\n  private maxStoredEvents: number;\n  private retentionTime: number;\n  private readonly alertEngine: PerformanceAlertEngine;\n  private readonly metricsAggregator: PerformanceMetricsAggregator;\n  private readonly storage: PerformanceMonitorStorage;\n  private readonly cleanupScheduler: PerformanceCleanupScheduler;\n\r\n  constructor(options: PerformanceMonitorOptions = {}) {\r\n    this.options = {\r\n      enableAlerts: options.enableAlerts ?? true,\r\n      defaultAlertRules: options.defaultAlertRules ?? this.getDefaultAlertRules(),\r\n      onAlert: options.onAlert ?? (() => {}),\r\n      storageKey: options.storageKey ?? '__tracker_performance_events__',\r\n      maxStoredEvents: options.maxStoredEvents ?? 10000,\r\n      retentionTime: options.retentionTime ?? 7 * 24 * 60 * 60 * 1000 // 7天\r\n    };\r\n\r\n    this.storageKey = this.options.storageKey;\n    this.maxStoredEvents = this.options.maxStoredEvents;\n    this.retentionTime = this.options.retentionTime;\n    this.alertRules = this.options.defaultAlertRules;\n    this.storage = new PerformanceMonitorStorage(this.storageKey);\n    this.cleanupScheduler = new PerformanceCleanupScheduler();\n    this.alertEngine = new PerformanceAlertEngine({\n      onAlert: alert => {\n        this.options.onAlert(alert);\n      }\n    });\n    this.metricsAggregator = new PerformanceMetricsAggregator();\n\n    this.init();\n  }\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  private init(): void {\r\n    // 监听性能事件\r\n    const handler = (...args: unknown[]) => {\r\n      const event = args[0] as PerformanceEvent;\r\n      this.handlePerformanceEvent(event);\r\n    };\r\n    eventBus.on('performance', handler);\r\n\r\n    // 保存handler引用，用于销毁时移除\r\n    (this as unknown as { _performanceHandler?: typeof handler })._performanceHandler = handler;\r\n\r\n    // 加载历史数据\r\n    this.loadHistoryData();\r\n\r\n    // 启动定期清理\r\n    this.startCleanupTimer();\r\n  }\r\n\r\n  /**\r\n   * 处理性能事件\r\n   */\r\n  private handlePerformanceEvent(event: PerformanceEvent): void {\r\n    // 添加到事件列表\r\n    this.events.push(event);\r\n\r\n    // 限制事件数量\r\n    if (this.events.length > this.maxStoredEvents) {\r\n      this.events = this.events.slice(-this.maxStoredEvents);\r\n    }\r\n\r\n    // 检查告警规则\r\n    if (this.options.enableAlerts) {\r\n      this.checkAlertRules(event);\r\n    }\r\n\r\n    // 异步保存到存储\r\n    this.saveToStorage();\r\n  }\r\n\r\n  /**\r\n   * 检查告警规则\r\n   */\r\n  private checkAlertRules(event: PerformanceEvent): void {\n    this.alertEngine.evaluate(event, this.alertRules, this.alerts);\n    if (this.alerts.length > 1000) {\n      this.alerts = this.alerts.slice(-1000);\n    }\n  }\n\r\n  /**\r\n   * 获取默认告警规则\r\n   */\r\n  private getDefaultAlertRules(): AlertRule[] {\r\n    return [\r\n      {\r\n        id: 'ttfb-warning',\r\n        name: 'TTFB告警',\r\n        metric: 'ttfb',\r\n        threshold: 1000,\r\n        operator: '>',\r\n        enabled: true,\r\n        message: 'TTFB超过1000ms，可能影响用户体验'\r\n      },\r\n      {\r\n        id: 'total-load-warning',\r\n        name: '总加载时间告警',\r\n        metric: 'total',\r\n        threshold: 3000,\r\n        operator: '>',\r\n        enabled: true,\r\n        message: '页面总加载时间超过3000ms，可能影响用户体验'\r\n      },\r\n      {\r\n        id: 'longtask-warning',\r\n        name: '长任务告警',\r\n        metric: 'longtask',\r\n        threshold: 50,\r\n        operator: '>',\r\n        enabled: true,\r\n        message: '检测到长任务超过50ms，可能阻塞主线程'\r\n      }\r\n    ];\r\n  }\r\n\r\n  /**\r\n   * 获取性能指标\r\n   */\r\n  getMetrics(startTime?: number, endTime?: number): PerformanceMetrics {\n    return this.metricsAggregator.build(this.events, startTime, endTime);\n  }\n\r\n  /**\r\n   * 生成性能报告\r\n   */\r\n  generateReport(options: ReportOptions = {}): PerformanceReport {\r\n    const now = Date.now();\r\n    const startTime = options.startTime || (options.duration ? now - options.duration : now - 3600000);\r\n    const endTime = options.endTime || now;\r\n\r\n    const metrics = this.getMetrics(startTime, endTime);\r\n\r\n    // 过滤时间范围内的告警\r\n    const filteredAlerts = this.alerts.filter(\r\n      a => a.timestamp >= startTime && a.timestamp <= endTime\r\n    );\r\n\r\n    // 计算摘要\r\n    const navigationEvents = this.events.filter(\r\n      e => e.metricType === 'navigation' && e.timestamp >= startTime && e.timestamp <= endTime\r\n    );\r\n\r\n    const summary = {\r\n      pageLoads: navigationEvents.length,\r\n      avgTTFB: metrics.navigation.ttfb,\r\n      avgTotalLoadTime: metrics.navigation.total,\r\n      totalLongTasks: metrics.longTasks.total,\r\n      totalResources: metrics.resources.total\r\n    };\r\n\r\n    // 生成趋势数据（按小时）\r\n    const trends = this.generateTrends(startTime, endTime);\r\n\r\n    return {\r\n      id: `report-${Date.now()}`,\r\n      generatedAt: now,\r\n      timeRange: {\r\n        start: startTime,\r\n        end: endTime\r\n      },\r\n      summary,\r\n      metrics,\r\n      alerts: filteredAlerts,\r\n      trends\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 生成趋势数据\r\n   */\r\n  private generateTrends(startTime: number, endTime: number): Array<{\r\n    time: number;\r\n    metrics: Partial<PerformanceMetrics>;\r\n  }> {\r\n    const trends: Array<{ time: number; metrics: Partial<PerformanceMetrics> }> = [];\r\n    const interval = 3600000; // 1小时\r\n    let current = startTime;\r\n\r\n    while (current < endTime) {\r\n      const next = Math.min(current + interval, endTime);\r\n      const hourMetrics = this.getMetrics(current, next);\r\n      trends.push({\r\n        time: current,\r\n        metrics: {\r\n          navigation: hourMetrics.navigation,\r\n          resources: {\r\n            total: hourMetrics.resources.total,\r\n            avgLoadTime: hourMetrics.resources.avgLoadTime,\r\n            maxLoadTime: hourMetrics.resources.maxLoadTime,\r\n            totalSize: hourMetrics.resources.totalSize,\r\n            byType: hourMetrics.resources.byType\r\n          },\r\n          longTasks: {\r\n            total: hourMetrics.longTasks.total,\r\n            avgDuration: hourMetrics.longTasks.avgDuration,\r\n            maxDuration: hourMetrics.longTasks.maxDuration,\r\n            recent: hourMetrics.longTasks.recent\r\n          }\r\n        }\r\n      });\r\n      current = next;\r\n    }\r\n\r\n    return trends;\r\n  }\r\n\r\n  /**\r\n   * 获取告警列表\r\n   */\r\n  getAlerts(resolved?: boolean): PerformanceAlert[] {\r\n    if (resolved === undefined) {\r\n      return [...this.alerts];\r\n    }\r\n    return this.alerts.filter(a => a.resolved === resolved);\r\n  }\r\n\r\n  /**\r\n   * 添加告警规则\r\n   */\r\n  addAlertRule(rule: AlertRule): void {\r\n    this.alertRules.push(rule);\r\n  }\r\n\r\n  /**\r\n   * 移除告警规则\r\n   */\r\n  removeAlertRule(ruleId: string): boolean {\r\n    const index = this.alertRules.findIndex(r => r.id === ruleId);\r\n    if (index >= 0) {\r\n      this.alertRules.splice(index, 1);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 获取告警规则\r\n   */\r\n  getAlertRules(): AlertRule[] {\r\n    return [...this.alertRules];\r\n  }\r\n\r\n  /**\r\n   * 标记告警为已处理\r\n   */\r\n  resolveAlert(alertId: string): boolean {\r\n    const alert = this.alerts.find(a => a.id === alertId);\r\n    if (alert) {\r\n      alert.resolved = true;\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 保存到存储\r\n   */\r\n  private async saveToStorage(): Promise<void> {\n    await this.storage.save(this.events, this.alerts);\n  }\n\r\n  /**\r\n   * 加载历史数据\r\n   */\r\n  private async loadHistoryData(): Promise<void> {\n    const data = await this.storage.load();\n    if (data.events) {\n      this.events = data.events;\n    }\n    if (data.alerts) {\n      this.alerts = data.alerts;\n    }\n  }\n\r\n  /**\r\n   * 启动清理定时器\r\n   */\r\n  private startCleanupTimer(): void {\n    this.cleanupScheduler.start(() => {\n      this.cleanup();\n    });\n  }\n\r\n  /**\r\n   * 清理过期数据\r\n   */\r\n  private cleanup(): void {\r\n    const now = Date.now();\r\n    const cutoffTime = now - this.retentionTime;\r\n\r\n    // 清理过期事件\r\n    this.events = this.events.filter(e => e.timestamp >= cutoffTime);\r\n\r\n    // 清理过期告警\r\n    this.alerts = this.alerts.filter(a => a.timestamp >= cutoffTime);\r\n\r\n    // 保存清理后的数据\r\n    this.saveToStorage();\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\n    const handler = (this as unknown as { _performanceHandler?: (...args: unknown[]) => void })._performanceHandler;\n    if (handler) {\n      eventBus.off('performance', handler);\n    }\n    this.cleanupScheduler.stop();\n  }\n}\n","/**\r\n * 性能监控面板HTML模板\r\n * 内置到SDK中，通过PanelManager打开\r\n */\r\n\r\nexport const PERFORMANCE_PANEL_HTML = `\r\n<!DOCTYPE html>\r\n<html lang=\"zh-CN\">\r\n<head>\r\n  <meta charset=\"UTF-8\">\r\n  <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\r\n  <title>性能监控面板 - Tracker SDK</title>\r\n  <style>\r\n    * {\r\n      margin: 0;\r\n      padding: 0;\r\n      box-sizing: border-box;\r\n    }\r\n    body {\r\n      font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, 'Helvetica Neue', Arial, sans-serif;\r\n      background: #f5f5f5;\r\n      padding: 20px;\r\n    }\r\n    .container {\r\n      max-width: 1400px;\r\n      margin: 0 auto;\r\n      background: white;\r\n      border-radius: 8px;\r\n      box-shadow: 0 2px 8px rgba(0,0,0,0.1);\r\n      padding: 30px;\r\n    }\r\n    h1 {\r\n      color: #333;\r\n      margin-bottom: 10px;\r\n      border-bottom: 3px solid #9C27B0;\r\n      padding-bottom: 10px;\r\n    }\r\n    .subtitle {\r\n      color: #666;\r\n      margin-bottom: 30px;\r\n    }\r\n    .toolbar {\r\n      display: flex;\r\n      gap: 10px;\r\n      margin-bottom: 20px;\r\n      flex-wrap: wrap;\r\n    }\r\n    button {\r\n      background: #9C27B0;\r\n      color: white;\r\n      border: none;\r\n      padding: 10px 20px;\r\n      border-radius: 4px;\r\n      cursor: pointer;\r\n      font-size: 14px;\r\n      transition: background 0.3s;\r\n    }\r\n    button:hover {\r\n      background: #7B1FA2;\r\n    }\r\n    button.secondary {\r\n      background: #2196F3;\r\n    }\r\n    button.secondary:hover {\r\n      background: #1976D2;\r\n    }\r\n    button.success {\r\n      background: #4CAF50;\r\n    }\r\n    button.success:hover {\r\n      background: #45a049;\r\n    }\r\n    .stats-grid {\r\n      display: grid;\r\n      grid-template-columns: repeat(auto-fit, minmax(200px, 1fr));\r\n      gap: 15px;\r\n      margin-bottom: 30px;\r\n    }\r\n    .stat-card {\r\n      background: linear-gradient(135deg, #667eea 0%, #764ba2 100%);\r\n      color: white;\r\n      padding: 20px;\r\n      border-radius: 8px;\r\n      box-shadow: 0 2px 4px rgba(0,0,0,0.1);\r\n    }\r\n    .stat-card.warning {\r\n      background: linear-gradient(135deg, #f093fb 0%, #f5576c 100%);\r\n    }\r\n    .stat-card.success {\r\n      background: linear-gradient(135deg, #11998e 0%, #38ef7d 100%);\r\n    }\r\n    .stat-card.info {\r\n      background: linear-gradient(135deg, #4facfe 0%, #00f2fe 100%);\r\n    }\r\n    .stat-label {\r\n      font-size: 12px;\r\n      opacity: 0.9;\r\n      margin-bottom: 5px;\r\n    }\r\n    .stat-value {\r\n      font-size: 32px;\r\n      font-weight: bold;\r\n    }\r\n    .stat-unit {\r\n      font-size: 14px;\r\n      opacity: 0.8;\r\n      margin-left: 5px;\r\n    }\r\n    .tabs {\r\n      display: flex;\r\n      gap: 10px;\r\n      margin-bottom: 20px;\r\n      border-bottom: 2px solid #eee;\r\n    }\r\n    .tab {\r\n      padding: 10px 20px;\r\n      cursor: pointer;\r\n      border: none;\r\n      background: none;\r\n      color: #666;\r\n      font-size: 14px;\r\n      border-bottom: 2px solid transparent;\r\n      margin-bottom: -2px;\r\n    }\r\n    .tab.active {\r\n      color: #9C27B0;\r\n      border-bottom-color: #9C27B0;\r\n      font-weight: bold;\r\n    }\r\n    .tab-content {\r\n      display: none;\r\n    }\r\n    .tab-content.active {\r\n      display: block;\r\n    }\r\n    .metrics-table {\r\n      width: 100%;\r\n      border-collapse: collapse;\r\n      margin-top: 20px;\r\n    }\r\n    .metrics-table th,\r\n    .metrics-table td {\r\n      padding: 12px;\r\n      text-align: left;\r\n      border-bottom: 1px solid #eee;\r\n    }\r\n    .metrics-table th {\r\n      background: #f9f9f9;\r\n      font-weight: bold;\r\n      color: #333;\r\n    }\r\n    .metrics-table tr:hover {\r\n      background: #f9f9f9;\r\n    }\r\n    .alert-item {\r\n      padding: 15px;\r\n      border-left: 4px solid #f44336;\r\n      background: #fff3f3;\r\n      margin-bottom: 10px;\r\n      border-radius: 4px;\r\n    }\r\n    .alert-item.warning {\r\n      border-left-color: #FF9800;\r\n      background: #fff8f0;\r\n    }\r\n    .alert-item.error {\r\n      border-left-color: #f44336;\r\n      background: #fff3f3;\r\n    }\r\n    .alert-item.critical {\r\n      border-left-color: #d32f2f;\r\n      background: #ffebee;\r\n    }\r\n    .alert-header {\r\n      display: flex;\r\n      justify-content: space-between;\r\n      align-items: center;\r\n      margin-bottom: 5px;\r\n    }\r\n    .alert-level {\r\n      display: inline-block;\r\n      padding: 4px 8px;\r\n      border-radius: 4px;\r\n      font-size: 12px;\r\n      font-weight: bold;\r\n      color: white;\r\n    }\r\n    .alert-level.warning {\r\n      background: #FF9800;\r\n    }\r\n    .alert-level.error {\r\n      background: #f44336;\r\n    }\r\n    .alert-level.critical {\r\n      background: #d32f2f;\r\n    }\r\n    .alert-time {\r\n      color: #999;\r\n      font-size: 12px;\r\n    }\r\n    .chart-container {\r\n      width: 100%;\r\n      height: 300px;\r\n      margin: 20px 0;\r\n      position: relative;\r\n    }\r\n    .chart-bar {\r\n      display: flex;\r\n      align-items: flex-end;\r\n      height: 250px;\r\n      gap: 10px;\r\n      padding: 20px;\r\n      background: #f9f9f9;\r\n      border-radius: 4px;\r\n    }\r\n    .chart-bar-item {\r\n      flex: 1;\r\n      background: linear-gradient(to top, #9C27B0, #7B1FA2);\r\n      border-radius: 4px 4px 0 0;\r\n      position: relative;\r\n      min-height: 10px;\r\n    }\r\n    .chart-bar-label {\r\n      text-align: center;\r\n      margin-top: 5px;\r\n      font-size: 12px;\r\n      color: #666;\r\n    }\r\n    .chart-bar-value {\r\n      position: absolute;\r\n      top: -20px;\r\n      left: 50%;\r\n      transform: translateX(-50%);\r\n      font-size: 11px;\r\n      color: #333;\r\n      font-weight: bold;\r\n    }\r\n    .loading {\r\n      text-align: center;\r\n      padding: 40px;\r\n      color: #666;\r\n    }\r\n    .spinner {\r\n      border: 3px solid #f3f3f3;\r\n      border-top: 3px solid #9C27B0;\r\n      border-radius: 50%;\r\n      width: 40px;\r\n      height: 40px;\r\n      animation: spin 1s linear infinite;\r\n      margin: 0 auto 20px;\r\n    }\r\n    @keyframes spin {\r\n      0% { transform: rotate(0deg); }\r\n      100% { transform: rotate(360deg); }\r\n    }\r\n    .empty-state {\r\n      text-align: center;\r\n      padding: 60px 20px;\r\n      color: #999;\r\n    }\r\n  </style>\r\n</head>\r\n<body>\r\n  <div class=\"container\">\r\n    <h1>📊 性能监控面板</h1>\r\n    <p class=\"subtitle\">实时性能指标监控和告警</p>\r\n\r\n    <div class=\"toolbar\">\r\n      <button onclick=\"refreshData()\">🔄 刷新数据</button>\r\n      <button class=\"secondary\" onclick=\"generateReport()\">📄 生成报告</button>\r\n      <button class=\"success\" onclick=\"exportData()\">📥 导出数据</button>\r\n    </div>\r\n\r\n    <div class=\"stats-grid\" id=\"stats-grid\">\r\n      <div class=\"stat-card\">\r\n        <div class=\"stat-label\">TTFB</div>\r\n        <div class=\"stat-value\" id=\"stat-ttfb\">-<span class=\"stat-unit\">ms</span></div>\r\n      </div>\r\n      <div class=\"stat-card\">\r\n        <div class=\"stat-label\">总加载时间</div>\r\n        <div class=\"stat-value\" id=\"stat-total\">-<span class=\"stat-unit\">ms</span></div>\r\n      </div>\r\n      <div class=\"stat-card info\">\r\n        <div class=\"stat-label\">资源总数</div>\r\n        <div class=\"stat-value\" id=\"stat-resources\">-</div>\r\n      </div>\r\n      <div class=\"stat-card warning\">\r\n        <div class=\"stat-label\">长任务</div>\r\n        <div class=\"stat-value\" id=\"stat-longtasks\">-</div>\r\n      </div>\r\n      <div class=\"stat-card warning\">\r\n        <div class=\"stat-label\">活跃告警</div>\r\n        <div class=\"stat-value\" id=\"stat-alerts\">-</div>\r\n      </div>\r\n    </div>\r\n\r\n    <div class=\"tabs\">\r\n      <button class=\"tab active\" onclick=\"switchTab('navigation')\" data-tab=\"navigation\">页面加载</button>\r\n      <button class=\"tab\" onclick=\"switchTab('resources')\" data-tab=\"resources\">资源加载</button>\r\n      <button class=\"tab\" onclick=\"switchTab('longtasks')\" data-tab=\"longtasks\">长任务</button>\r\n      <button class=\"tab\" onclick=\"switchTab('alerts')\" data-tab=\"alerts\">告警</button>\r\n    </div>\r\n\r\n    <div id=\"tab-navigation\" class=\"tab-content active\">\r\n      <h2>页面加载性能</h2>\r\n      <div class=\"chart-container\">\r\n        <div class=\"chart-bar\" id=\"navigation-chart\"></div>\r\n      </div>\r\n      <table class=\"metrics-table\">\r\n        <thead>\r\n          <tr>\r\n            <th>指标</th>\r\n            <th>值</th>\r\n            <th>说明</th>\r\n          </tr>\r\n        </thead>\r\n        <tbody id=\"navigation-metrics\">\r\n        </tbody>\r\n      </table>\r\n    </div>\r\n\r\n    <div id=\"tab-resources\" class=\"tab-content\">\r\n      <h2>资源加载性能</h2>\r\n      <table class=\"metrics-table\">\r\n        <thead>\r\n          <tr>\r\n            <th>资源类型</th>\r\n            <th>数量</th>\r\n            <th>平均加载时间</th>\r\n            <th>总大小</th>\r\n          </tr>\r\n        </thead>\r\n        <tbody id=\"resources-metrics\">\r\n        </tbody>\r\n      </table>\r\n    </div>\r\n\r\n    <div id=\"tab-longtasks\" class=\"tab-content\">\r\n      <h2>长任务监控</h2>\r\n      <table class=\"metrics-table\">\r\n        <thead>\r\n          <tr>\r\n            <th>时间</th>\r\n            <th>持续时间</th>\r\n            <th>开始时间</th>\r\n          </tr>\r\n        </thead>\r\n        <tbody id=\"longtasks-metrics\">\r\n        </tbody>\r\n      </table>\r\n    </div>\r\n\r\n    <div id=\"tab-alerts\" class=\"tab-content\">\r\n      <h2>性能告警</h2>\r\n      <div id=\"alerts-list\"></div>\r\n    </div>\r\n  </div>\r\n\r\n  <script>\r\n    // 标记这是SDK内部面板，不应被监控\r\n    window.__trackerInternalPanel = true;\r\n    \r\n    let metricsData = null;\r\n    let alertsData = [];\r\n\r\n    // 从父窗口获取Tracker实例\r\n    function getTrackerInstance() {\r\n      if (window.opener && window.opener.__trackerInstance) {\r\n        return window.opener.__trackerInstance;\r\n      }\r\n      // 尝试从全局变量获取\r\n      if (window.__trackerInstance) {\r\n        return window.__trackerInstance;\r\n      }\r\n      return null;\r\n    }\r\n\r\n    // 刷新数据\r\n    async function refreshData() {\r\n      const tracker = getTrackerInstance();\r\n      if (!tracker) {\r\n        alert('无法获取Tracker实例，请确保从Tracker打开此面板');\r\n        return;\r\n      }\r\n\r\n      try {\r\n        // 获取性能指标\r\n        metricsData = tracker.getPerformanceMetrics();\r\n        \r\n        // 获取告警\r\n        alertsData = tracker.getPerformanceMonitor().getAlerts(false);\r\n\r\n        // 更新UI\r\n        updateStats();\r\n        updateNavigationTab();\r\n        updateResourcesTab();\r\n        updateLongTasksTab();\r\n        updateAlertsTab();\r\n      } catch (error) {\r\n        console.error('刷新数据失败:', error);\r\n        alert('刷新数据失败: ' + (error instanceof Error ? error.message : String(error)));\r\n      }\r\n    }\r\n\r\n    // 更新统计卡片\r\n    function updateStats() {\r\n      if (!metricsData) return;\r\n\r\n      document.getElementById('stat-ttfb').innerHTML = \r\n        Math.round(metricsData.navigation.ttfb) + '<span class=\"stat-unit\">ms</span>';\r\n      document.getElementById('stat-total').innerHTML = \r\n        Math.round(metricsData.navigation.total) + '<span class=\"stat-unit\">ms</span>';\r\n      document.getElementById('stat-resources').textContent = metricsData.resources.total;\r\n      document.getElementById('stat-longtasks').textContent = metricsData.longTasks.total;\r\n      document.getElementById('stat-alerts').textContent = alertsData.length;\r\n    }\r\n\r\n    // 更新页面加载标签页\r\n    function updateNavigationTab() {\r\n      if (!metricsData) return;\r\n\r\n      const nav = metricsData.navigation;\r\n      const metrics = [\r\n        { name: 'DNS查询', value: nav.dns, desc: '域名解析时间' },\r\n        { name: 'TCP连接', value: nav.tcp, desc: 'TCP连接建立时间' },\r\n        { name: 'SSL握手', value: nav.ssl, desc: 'SSL/TLS握手时间' },\r\n        { name: 'TTFB', value: nav.ttfb, desc: '首字节时间' },\r\n        { name: '响应时间', value: nav.response, desc: '服务器响应时间' },\r\n        { name: 'DOM解析', value: nav.domParse, desc: 'DOM解析时间' },\r\n        { name: '资源加载', value: nav.resourceLoad, desc: '资源加载时间' },\r\n        { name: '总加载时间', value: nav.total, desc: '页面总加载时间' }\r\n      ];\r\n\r\n      const tbody = document.getElementById('navigation-metrics');\r\n      tbody.innerHTML = metrics.map(m => \\`\r\n        <tr>\r\n          <td><strong>\\${m.name}</strong></td>\r\n          <td>\\${Math.round(m.value)} ms</td>\r\n          <td>\\${m.desc}</td>\r\n        </tr>\r\n      \\`).join('');\r\n\r\n      // 更新图表\r\n      updateNavigationChart(metrics);\r\n    }\r\n\r\n    // 更新导航图表\r\n    function updateNavigationChart(metrics) {\r\n      const chart = document.getElementById('navigation-chart');\r\n      const values = metrics.map(m => m.value).filter(v => v > 0);\r\n      const maxValue = values.length > 0 ? Math.max(...values) : 1;\r\n      \r\n      chart.innerHTML = metrics.map(m => {\r\n        const height = maxValue > 0 ? (m.value / maxValue) * 100 : 0;\r\n        return \\`\r\n          <div class=\"chart-bar-item\" style=\"height: \\${height}%\">\r\n            <div class=\"chart-bar-value\">\\${Math.round(m.value)}ms</div>\r\n          </div>\r\n        \\`;\r\n      }).join('') + metrics.map(m => \\`\r\n        <div class=\"chart-bar-label\">\\${m.name}</div>\r\n      \\`).join('');\r\n    }\r\n\r\n    // 更新资源标签页\r\n    function updateResourcesTab() {\r\n      if (!metricsData) return;\r\n\r\n      const resources = metricsData.resources;\r\n      const tbody = document.getElementById('resources-metrics');\r\n      \r\n      if (Object.keys(resources.byType).length === 0) {\r\n        tbody.innerHTML = '<tr><td colspan=\"4\" style=\"text-align: center; color: #999;\">暂无资源数据</td></tr>';\r\n        return;\r\n      }\r\n\r\n      tbody.innerHTML = Object.entries(resources.byType).map(([type, stats]) => \\`\r\n        <tr>\r\n          <td><strong>\\${type}</strong></td>\r\n          <td>\\${stats.count}</td>\r\n          <td>\\${Math.round(stats.avgLoadTime)} ms</td>\r\n          <td>\\${formatSize(stats.totalSize)}</td>\r\n        </tr>\r\n      \\`).join('');\r\n\r\n      // 添加总计行\r\n      tbody.innerHTML += \\`\r\n        <tr style=\"background: #f9f9f9; font-weight: bold;\">\r\n          <td>总计</td>\r\n          <td>\\${resources.total}</td>\r\n          <td>\\${Math.round(resources.avgLoadTime)} ms</td>\r\n          <td>\\${formatSize(resources.totalSize)}</td>\r\n        </tr>\r\n      \\`;\r\n    }\r\n\r\n    // 更新长任务标签页\r\n    function updateLongTasksTab() {\r\n      if (!metricsData) return;\r\n\r\n      const longTasks = metricsData.longTasks;\r\n      const tbody = document.getElementById('longtasks-metrics');\r\n      \r\n      if (longTasks.recent.length === 0) {\r\n        tbody.innerHTML = '<tr><td colspan=\"3\" style=\"text-align: center; color: #999;\">暂无长任务数据</td></tr>';\r\n        return;\r\n      }\r\n\r\n      tbody.innerHTML = longTasks.recent.map(task => {\r\n        const date = new Date(task.timestamp);\r\n        return \\`\r\n          <tr>\r\n            <td>\\${date.toLocaleString()}</td>\r\n            <td>\\${Math.round(task.duration)} ms</td>\r\n            <td>\\${Math.round(task.startTime)}</td>\r\n          </tr>\r\n        \\`;\r\n      }).join('');\r\n    }\r\n\r\n    // 更新告警标签页\r\n    function updateAlertsTab() {\r\n      const container = document.getElementById('alerts-list');\r\n      \r\n      if (alertsData.length === 0) {\r\n        container.innerHTML = '<div class=\"empty-state\"><p>暂无告警</p></div>';\r\n        return;\r\n      }\r\n\r\n      container.innerHTML = alertsData.map(alert => {\r\n        const date = new Date(alert.timestamp);\r\n        return \\`\r\n          <div class=\"alert-item \\${alert.level}\">\r\n            <div class=\"alert-header\">\r\n              <div>\r\n                <span class=\"alert-level \\${alert.level}\">\\${alert.level.toUpperCase()}</span>\r\n                <strong style=\"margin-left: 10px;\">\\${alert.message}</strong>\r\n              </div>\r\n              <span class=\"alert-time\">\\${date.toLocaleString()}</span>\r\n            </div>\r\n            <div style=\"margin-top: 5px; color: #666; font-size: 13px;\">\r\n              值: \\${Math.round(alert.value)}ms | 阈值: \\${alert.threshold}ms\r\n              \\${alert.url ? ' | URL: ' + alert.url : ''}\r\n            </div>\r\n          </div>\r\n        \\`;\r\n      }).join('');\r\n    }\r\n\r\n    // 切换标签页\r\n    function switchTab(tabName) {\r\n      // 更新标签按钮\r\n      document.querySelectorAll('.tab').forEach(tab => {\r\n        tab.classList.remove('active');\r\n        if (tab.getAttribute('data-tab') === tabName) {\r\n          tab.classList.add('active');\r\n        }\r\n      });\r\n\r\n      // 更新内容\r\n      document.querySelectorAll('.tab-content').forEach(content => content.classList.remove('active'));\r\n      const targetTab = document.getElementById('tab-' + tabName);\r\n      if (targetTab) {\r\n        targetTab.classList.add('active');\r\n      }\r\n    }\r\n\r\n    // 生成报告\r\n    async function generateReport() {\r\n      const tracker = getTrackerInstance();\r\n      if (!tracker) {\r\n        alert('无法获取Tracker实例');\r\n        return;\r\n      }\r\n\r\n      try {\r\n        const report = tracker.generatePerformanceReport({\r\n          duration: 3600000 // 最近1小时\r\n        });\r\n\r\n        // 下载JSON报告\r\n        const dataStr = JSON.stringify(report, null, 2);\r\n        const dataBlob = new Blob([dataStr], { type: 'application/json' });\r\n        const url = URL.createObjectURL(dataBlob);\r\n        const link = document.createElement('a');\r\n        link.href = url;\r\n        link.download = \\`performance-report-\\${new Date().toISOString().split('T')[0]}.json\\`;\r\n        link.click();\r\n        URL.revokeObjectURL(url);\r\n      } catch (error) {\r\n        console.error('生成报告失败:', error);\r\n        alert('生成报告失败: ' + (error instanceof Error ? error.message : String(error)));\r\n      }\r\n    }\r\n\r\n    // 导出数据\r\n    function exportData() {\r\n      if (!metricsData) {\r\n        alert('请先刷新数据');\r\n        return;\r\n      }\r\n\r\n      const data = {\r\n        metrics: metricsData,\r\n        alerts: alertsData,\r\n        exportedAt: new Date().toISOString()\r\n      };\r\n\r\n      const dataStr = JSON.stringify(data, null, 2);\r\n      const dataBlob = new Blob([dataStr], { type: 'application/json' });\r\n      const url = URL.createObjectURL(dataBlob);\r\n      const link = document.createElement('a');\r\n      link.href = url;\r\n      link.download = \\`performance-data-\\${new Date().toISOString().split('T')[0]}.json\\`;\r\n      link.click();\r\n      URL.revokeObjectURL(url);\r\n    }\r\n\r\n    // 格式化文件大小\r\n    function formatSize(bytes) {\r\n      if (bytes === 0) return '0 B';\r\n      const k = 1024;\r\n      const sizes = ['B', 'KB', 'MB', 'GB'];\r\n      const i = Math.floor(Math.log(bytes) / Math.log(k));\r\n      return Math.round(bytes / Math.pow(k, i) * 100) / 100 + ' ' + sizes[i];\r\n    }\r\n\r\n    // 页面加载时自动刷新\r\n    window.addEventListener('load', () => {\r\n      setTimeout(refreshData, 500);\r\n      \r\n      // 每30秒自动刷新\r\n      setInterval(refreshData, 30000);\r\n    });\r\n  </script>\r\n</body>\r\n</html>\r\n`;\r\n","/**\r\n * 离线存储查看器HTML模板\r\n * 内置到SDK中，通过PanelManager打开\r\n */\r\n\r\nexport const OFFLINE_STORAGE_VIEWER_HTML = `\r\n<!DOCTYPE html>\r\n<html lang=\"zh-CN\">\r\n<head>\r\n  <meta charset=\"UTF-8\">\r\n  <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\r\n  <title>查看离线存储数据 - Tracker SDK</title>\r\n  <style>\r\n    * {\r\n      margin: 0;\r\n      padding: 0;\r\n      box-sizing: border-box;\r\n    }\r\n    body {\r\n      font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', Roboto, 'Helvetica Neue', Arial, sans-serif;\r\n      background: #f5f5f5;\r\n      padding: 20px;\r\n    }\r\n    .container {\r\n      max-width: 1400px;\r\n      margin: 0 auto;\r\n      background: white;\r\n      border-radius: 8px;\r\n      box-shadow: 0 2px 8px rgba(0,0,0,0.1);\r\n      padding: 30px;\r\n    }\r\n    h1 {\r\n      color: #333;\r\n      margin-bottom: 10px;\r\n      border-bottom: 3px solid #4CAF50;\r\n      padding-bottom: 10px;\r\n    }\r\n    .subtitle {\r\n      color: #666;\r\n      margin-bottom: 30px;\r\n    }\r\n    .toolbar {\r\n      display: flex;\r\n      gap: 10px;\r\n      margin-bottom: 20px;\r\n      flex-wrap: wrap;\r\n    }\r\n    button {\r\n      background: #4CAF50;\r\n      color: white;\r\n      border: none;\r\n      padding: 10px 20px;\r\n      border-radius: 4px;\r\n      cursor: pointer;\r\n      font-size: 14px;\r\n      transition: background 0.3s;\r\n    }\r\n    button:hover {\r\n      background: #45a049;\r\n    }\r\n    button.danger {\r\n      background: #f44336;\r\n    }\r\n    button.danger:hover {\r\n      background: #da190b;\r\n    }\r\n    button.secondary {\r\n      background: #2196F3;\r\n    }\r\n    button.secondary:hover {\r\n      background: #1976D2;\r\n    }\r\n    .stats {\r\n      display: grid;\r\n      grid-template-columns: repeat(auto-fit, minmax(200px, 1fr));\r\n      gap: 15px;\r\n      margin-bottom: 20px;\r\n    }\r\n    .stat-card {\r\n      background: linear-gradient(135deg, #667eea 0%, #764ba2 100%);\r\n      color: white;\r\n      padding: 20px;\r\n      border-radius: 8px;\r\n      box-shadow: 0 2px 4px rgba(0,0,0,0.1);\r\n    }\r\n    .stat-card.success {\r\n      background: linear-gradient(135deg, #11998e 0%, #38ef7d 100%);\r\n    }\r\n    .stat-card.warning {\r\n      background: linear-gradient(135deg, #f093fb 0%, #f5576c 100%);\r\n    }\r\n    .stat-card.info {\r\n      background: linear-gradient(135deg, #4facfe 0%, #00f2fe 100%);\r\n    }\r\n    .stat-label {\r\n      font-size: 12px;\r\n      opacity: 0.9;\r\n      margin-bottom: 5px;\r\n    }\r\n    .stat-value {\r\n      font-size: 32px;\r\n      font-weight: bold;\r\n    }\r\n    .filters {\r\n      background: #f9f9f9;\r\n      padding: 15px;\r\n      border-radius: 4px;\r\n      margin-bottom: 20px;\r\n    }\r\n    .filters label {\r\n      display: inline-block;\r\n      margin-right: 15px;\r\n      font-size: 14px;\r\n      color: #666;\r\n    }\r\n    .filters select, .filters input {\r\n      padding: 5px 10px;\r\n      border: 1px solid #ddd;\r\n      border-radius: 4px;\r\n      margin-left: 5px;\r\n    }\r\n    .events-container {\r\n      max-height: 600px;\r\n      overflow-y: auto;\r\n      border: 1px solid #ddd;\r\n      border-radius: 4px;\r\n    }\r\n    .event-item {\r\n      border-bottom: 1px solid #eee;\r\n      padding: 15px;\r\n      transition: background 0.2s;\r\n    }\r\n    .event-item:hover {\r\n      background: #f9f9f9;\r\n    }\r\n    .event-item:last-child {\r\n      border-bottom: none;\r\n    }\r\n    .event-header {\r\n      display: flex;\r\n      justify-content: space-between;\r\n      align-items: center;\r\n      margin-bottom: 10px;\r\n    }\r\n    .event-type {\r\n      display: inline-block;\r\n      padding: 4px 8px;\r\n      border-radius: 4px;\r\n      font-size: 12px;\r\n      font-weight: bold;\r\n      color: white;\r\n    }\r\n    .event-type.pageview { background: #4CAF50; }\r\n    .event-type.click { background: #2196F3; }\r\n    .event-type.exposure { background: #FF9800; }\r\n    .event-type.error { background: #f44336; }\r\n    .event-type.performance { background: #9C27B0; }\r\n    .event-type.custom { background: #607D8B; }\r\n    .event-time {\r\n      color: #999;\r\n      font-size: 12px;\r\n    }\r\n    .event-details {\r\n      font-size: 13px;\r\n      color: #666;\r\n      margin-top: 8px;\r\n    }\r\n    .event-details pre {\r\n      background: #f5f5f5;\r\n      padding: 10px;\r\n      border-radius: 4px;\r\n      overflow-x: auto;\r\n      font-size: 12px;\r\n      margin-top: 5px;\r\n    }\r\n    .empty-state {\r\n      text-align: center;\r\n      padding: 60px 20px;\r\n      color: #999;\r\n    }\r\n    .empty-state svg {\r\n      width: 100px;\r\n      height: 100px;\r\n      margin-bottom: 20px;\r\n      opacity: 0.3;\r\n    }\r\n    .loading {\r\n      text-align: center;\r\n      padding: 40px;\r\n      color: #666;\r\n    }\r\n    .spinner {\r\n      border: 3px solid #f3f3f3;\r\n      border-top: 3px solid #4CAF50;\r\n      border-radius: 50%;\r\n      width: 40px;\r\n      height: 40px;\r\n      animation: spin 1s linear infinite;\r\n      margin: 0 auto 20px;\r\n    }\r\n    @keyframes spin {\r\n      0% { transform: rotate(0deg); }\r\n      100% { transform: rotate(360deg); }\r\n    }\r\n    .json-viewer {\r\n      background: #f5f5f5;\r\n      padding: 10px;\r\n      border-radius: 4px;\r\n      font-family: 'Courier New', monospace;\r\n      font-size: 12px;\r\n      max-height: 300px;\r\n      overflow-y: auto;\r\n    }\r\n  </style>\r\n</head>\r\n<body>\r\n  <div class=\"container\">\r\n    <h1>📦 离线存储数据查看器</h1>\r\n    <p class=\"subtitle\">查看 Tracker SDK 离线存储的所有事件数据</p>\r\n\r\n    <div class=\"toolbar\">\r\n      <button onclick=\"loadEvents()\">🔄 刷新数据</button>\r\n      <button class=\"secondary\" onclick=\"exportData()\">📥 导出数据</button>\r\n      <button class=\"danger\" onclick=\"clearStorage()\">🗑️ 清空存储</button>\r\n      <button onclick=\"openDevTools()\">🔧 打开开发者工具</button>\r\n    </div>\r\n\r\n    <div class=\"stats\" id=\"stats\">\r\n      <div class=\"stat-card success\">\r\n        <div class=\"stat-label\">总事件数</div>\r\n        <div class=\"stat-value\" id=\"total-count\">-</div>\r\n      </div>\r\n      <div class=\"stat-card info\">\r\n        <div class=\"stat-label\">存储大小</div>\r\n        <div class=\"stat-value\" id=\"storage-size\">-</div>\r\n      </div>\r\n      <div class=\"stat-card warning\">\r\n        <div class=\"stat-label\">事件类型分布</div>\r\n        <div class=\"stat-value\" id=\"type-distribution\">-</div>\r\n      </div>\r\n    </div>\r\n\r\n    <div class=\"filters\">\r\n      <label>\r\n        事件类型:\r\n        <select id=\"filter-type\" onchange=\"filterEvents()\">\r\n          <option value=\"\">全部</option>\r\n          <option value=\"pageview\">页面浏览</option>\r\n          <option value=\"click\">点击</option>\r\n          <option value=\"exposure\">曝光</option>\r\n          <option value=\"error\">错误</option>\r\n          <option value=\"performance\">性能</option>\r\n          <option value=\"custom\">自定义</option>\r\n        </select>\r\n      </label>\r\n      <label>\r\n        搜索:\r\n        <input type=\"text\" id=\"search-input\" placeholder=\"搜索事件...\" oninput=\"filterEvents()\">\r\n      </label>\r\n      <label>\r\n        排序:\r\n        <select id=\"sort-order\" onchange=\"filterEvents()\">\r\n          <option value=\"desc\">最新优先</option>\r\n          <option value=\"asc\">最旧优先</option>\r\n        </select>\r\n      </label>\r\n    </div>\r\n\r\n    <div class=\"events-container\" id=\"events-container\">\r\n      <div class=\"loading\">\r\n        <div class=\"spinner\"></div>\r\n        <p>加载中...</p>\r\n      </div>\r\n    </div>\r\n  </div>\r\n\r\n  <script>\r\n    // 标记这是SDK内部面板，不应被监控\r\n    window.__trackerInternalPanel = true;\r\n    \r\n    let allEvents = [];\r\n    let filteredEvents = [];\r\n\r\n    // 从父窗口获取Tracker实例\r\n    function getTrackerInstance() {\r\n      if (window.opener && window.opener.__trackerInstance) {\r\n        return window.opener.__trackerInstance;\r\n      }\r\n      // 尝试从全局变量获取\r\n      if (window.__trackerInstance) {\r\n        return window.__trackerInstance;\r\n      }\r\n      return null;\r\n    }\r\n\r\n    // 加载事件\r\n    async function loadEvents() {\r\n      const container = document.getElementById('events-container');\r\n      container.innerHTML = '<div class=\"loading\"><div class=\"spinner\"></div><p>加载中...</p></div>';\r\n\r\n      try {\r\n        const tracker = getTrackerInstance();\r\n        if (tracker) {\r\n          allEvents = await tracker.getOfflineEvents();\r\n        } else {\r\n          // 直接访问IndexedDB\r\n          allEvents = await getEventsFromIndexedDB();\r\n        }\r\n\r\n        updateStats();\r\n        filterEvents();\r\n      } catch (error) {\r\n        container.innerHTML = \\`<div class=\"empty-state\"><p>加载失败: \\${error.message}</p></div>\\`;\r\n        console.error('加载事件失败:', error);\r\n      }\r\n    }\r\n\r\n    // 直接从IndexedDB获取事件\r\n    async function getEventsFromIndexedDB() {\r\n      return new Promise((resolve, reject) => {\r\n        const request = indexedDB.open('__tracker_db__', 1);\r\n        \r\n        request.onsuccess = (event) => {\r\n          const db = event.target.result;\r\n          if (!db.objectStoreNames.contains('__tracker_store__')) {\r\n            resolve([]);\r\n            return;\r\n          }\r\n          const transaction = db.transaction(['__tracker_store__'], 'readonly');\r\n          const store = transaction.objectStore('__tracker_store__');\r\n          const index = store.index('key');\r\n          const getRequest = index.get('__tracker_offline_events__');\r\n\r\n          getRequest.onsuccess = () => {\r\n            const result = getRequest.result;\r\n            if (result && result.value) {\r\n              try {\r\n                const events = JSON.parse(result.value);\r\n                resolve(events);\r\n              } catch (e) {\r\n                resolve([]);\r\n              }\r\n            } else {\r\n              resolve([]);\r\n            }\r\n          };\r\n\r\n          getRequest.onerror = () => {\r\n            reject(new Error('获取数据失败'));\r\n          };\r\n        };\r\n\r\n        request.onerror = () => {\r\n          reject(new Error('打开数据库失败'));\r\n        };\r\n      });\r\n    }\r\n\r\n    // 更新统计信息\r\n    function updateStats() {\r\n      const totalCount = allEvents.length;\r\n      document.getElementById('total-count').textContent = totalCount;\r\n\r\n      const size = new Blob([JSON.stringify(allEvents)]).size;\r\n      const sizeKB = (size / 1024).toFixed(2);\r\n      document.getElementById('storage-size').textContent = sizeKB + ' KB';\r\n\r\n      const typeCount = {};\r\n      allEvents.forEach(event => {\r\n        typeCount[event.type] = (typeCount[event.type] || 0) + 1;\r\n      });\r\n      const typeStr = Object.entries(typeCount)\r\n        .map(([type, count]) => \\`\\${type}: \\${count}\\`)\r\n        .join(', ');\r\n      document.getElementById('type-distribution').textContent = typeStr || '无';\r\n    }\r\n\r\n    // 过滤事件\r\n    function filterEvents() {\r\n      const typeFilter = document.getElementById('filter-type').value;\r\n      const searchText = document.getElementById('search-input').value.toLowerCase();\r\n      const sortOrder = document.getElementById('sort-order').value;\r\n\r\n      filteredEvents = allEvents.filter(event => {\r\n        const matchType = !typeFilter || event.type === typeFilter;\r\n        const matchSearch = !searchText || \r\n          JSON.stringify(event).toLowerCase().includes(searchText);\r\n        return matchType && matchSearch;\r\n      });\r\n\r\n      filteredEvents.sort((a, b) => {\r\n        return sortOrder === 'desc' ? b.timestamp - a.timestamp : a.timestamp - b.timestamp;\r\n      });\r\n\r\n      renderEvents();\r\n    }\r\n\r\n    // 渲染事件列表\r\n    function renderEvents() {\r\n      const container = document.getElementById('events-container');\r\n\r\n      if (filteredEvents.length === 0) {\r\n        container.innerHTML = \\`\r\n          <div class=\"empty-state\">\r\n            <svg viewBox=\"0 0 24 24\" fill=\"none\" stroke=\"currentColor\" stroke-width=\"2\">\r\n              <path d=\"M9 12h6m-6 4h6m2 5H7a2 2 0 01-2-2V5a2 2 0 012-2h5.586a1 1 0 01.707.293l5.414 5.414a1 1 0 01.293.707V19a2 2 0 01-2 2z\"/>\r\n            </svg>\r\n            <p>没有找到事件数据</p>\r\n            <p style=\"margin-top: 10px; font-size: 12px;\">请确保已经使用Tracker SDK收集了一些事件</p>\r\n          </div>\r\n        \\`;\r\n        return;\r\n      }\r\n\r\n      const typeLabels = {\r\n        pageview: '页面浏览',\r\n        click: '点击',\r\n        exposure: '曝光',\r\n        error: '错误',\r\n        performance: '性能',\r\n        custom: '自定义'\r\n      };\r\n\r\n      container.innerHTML = filteredEvents.map((event) => {\r\n        const date = new Date(event.timestamp);\r\n        return \\`\r\n          <div class=\"event-item\">\r\n            <div class=\"event-header\">\r\n              <div>\r\n                <span class=\"event-type \\${event.type}\">\\${typeLabels[event.type] || event.type}</span>\r\n                <span style=\"margin-left: 10px; font-weight: bold;\">\\${event.name || event.eventName || '-'}</span>\r\n              </div>\r\n              <div class=\"event-time\">\\${date.toLocaleString()}</div>\r\n            </div>\r\n            <div class=\"event-details\">\r\n              <div><strong>URL:</strong> \\${event.url || '-'}</div>\r\n              <div style=\"margin-top: 5px;\"><strong>标题:</strong> \\${event.title || '-'}</div>\r\n              \\${event.userId ? \\`<div style=\"margin-top: 5px;\"><strong>用户ID:</strong> \\${event.userId}</div>\\` : ''}\r\n              \\${event.properties ? \\`\r\n                <div style=\"margin-top: 10px;\">\r\n                  <strong>属性:</strong>\r\n                  <div class=\"json-viewer\">\\${JSON.stringify(event.properties, null, 2)}</div>\r\n                </div>\r\n              \\` : ''}\r\n              \\${event.errorType ? \\`<div style=\"margin-top: 5px;\"><strong>错误类型:</strong> \\${event.errorType}</div>\\` : ''}\r\n              \\${event.message ? \\`<div style=\"margin-top: 5px;\"><strong>消息:</strong> \\${event.message}</div>\\` : ''}\r\n              <div style=\"margin-top: 10px; font-size: 11px; color: #999;\">\r\n                <details>\r\n                  <summary style=\"cursor: pointer;\">查看完整数据</summary>\r\n                  <div class=\"json-viewer\" style=\"margin-top: 10px;\">\\${JSON.stringify(event, null, 2)}</div>\r\n                </details>\r\n              </div>\r\n            </div>\r\n          </div>\r\n        \\`;\r\n      }).join('');\r\n    }\r\n\r\n    // 导出数据\r\n    function exportData() {\r\n      const dataStr = JSON.stringify(allEvents, null, 2);\r\n      const dataBlob = new Blob([dataStr], { type: 'application/json' });\r\n      const url = URL.createObjectURL(dataBlob);\r\n      const link = document.createElement('a');\r\n      link.href = url;\r\n      link.download = \\`tracker-offline-events-\\${new Date().toISOString().split('T')[0]}.json\\`;\r\n      link.click();\r\n      URL.revokeObjectURL(url);\r\n    }\r\n\r\n    // 清空存储\r\n    async function clearStorage() {\r\n      if (!confirm('确定要清空所有离线存储的数据吗？此操作不可恢复！')) {\r\n        return;\r\n      }\r\n\r\n      try {\r\n        const tracker = getTrackerInstance();\r\n        if (tracker) {\r\n          await tracker.clearOfflineStorage();\r\n        } else {\r\n          const request = indexedDB.open('__tracker_db__', 1);\r\n          request.onsuccess = (event) => {\r\n            const db = event.target.result;\r\n            if (!db.objectStoreNames.contains('__tracker_store__')) {\r\n              alert('存储已清空（存储不存在）');\r\n              loadEvents();\r\n              return;\r\n            }\r\n            const transaction = db.transaction(['__tracker_store__'], 'readwrite');\r\n            const store = transaction.objectStore('__tracker_store__');\r\n            const index = store.index('key');\r\n            const getRequest = index.get('__tracker_offline_events__');\r\n            getRequest.onsuccess = () => {\r\n              if (getRequest.result) {\r\n                store.delete(getRequest.result.id);\r\n              }\r\n            };\r\n          };\r\n        }\r\n        alert('存储已清空');\r\n        loadEvents();\r\n      } catch (error) {\r\n        alert('清空失败: ' + error.message);\r\n        console.error('清空存储失败:', error);\r\n      }\r\n    }\r\n\r\n    // 打开开发者工具\r\n    function openDevTools() {\r\n      alert('请在浏览器中按F12打开开发者工具，然后：\\\\n\\\\n1. 打开 Application 标签\\\\n2. 选择 IndexedDB\\\\n3. 找到 TrackerStorage 数据库\\\\n4. 查看 keyValueStore 中的数据');\r\n    }\r\n\r\n    // 页面加载时自动加载数据\r\n    window.addEventListener('load', () => {\r\n      setTimeout(loadEvents, 500);\r\n    });\r\n  </script>\r\n</body>\r\n</html>\r\n`;\r\n","/**\r\n * 面板管理器\r\n * 管理内置HTML页面，提供打开面板的方法\r\n */\r\nimport { PERFORMANCE_PANEL_HTML } from '../panels/performance-panel.html';\r\nimport { OFFLINE_STORAGE_VIEWER_HTML } from '../panels/offline-storage-viewer.html';\r\n\r\n/**\r\n * 面板管理器\r\n */\r\nexport class PanelManager {\r\n  /**\r\n   * 设置Tracker实例\r\n   */\r\n  setTrackerInstance(instance: unknown): void {\r\n    // 将实例存储到全局变量，供面板访问\r\n    if (typeof window !== 'undefined') {\r\n      (window as unknown as { __trackerInstance?: unknown }).__trackerInstance = instance;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 打开性能监控面板\r\n   */\r\n  openPerformancePanel(): void {\r\n    if (typeof window === 'undefined') {\r\n      console.warn('PanelManager: Cannot open panel in non-browser environment');\r\n      return;\r\n    }\r\n\r\n    try {\r\n      // 创建新窗口，使用特殊的URL标识这是SDK内部面板\r\n      const win = window.open('about:blank', '_blank', 'width=1400,height=900,resizable=yes,scrollbars=yes');\r\n      \r\n      if (!win) {\r\n        alert('无法打开性能监控面板，请检查浏览器弹窗设置');\r\n        return;\r\n      }\r\n\r\n      // 写入HTML内容（HTML中已包含标识设置）\r\n      win.document.write(PERFORMANCE_PANEL_HTML);\r\n      win.document.close();\r\n\r\n      // 设置窗口标题\r\n      win.document.title = '性能监控面板 - Tracker SDK';\r\n    } catch (error) {\r\n      console.error('PanelManager: Failed to open performance panel:', error);\r\n      alert('打开性能监控面板失败: ' + (error instanceof Error ? error.message : String(error)));\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 打开离线存储查看器\r\n   */\r\n  openOfflineStorageViewer(): void {\r\n    if (typeof window === 'undefined') {\r\n      console.warn('PanelManager: Cannot open panel in non-browser environment');\r\n      return;\r\n    }\r\n\r\n    try {\r\n      // 创建新窗口，使用特殊的URL标识这是SDK内部面板\r\n      const win = window.open('about:blank', '_blank', 'width=1400,height=900,resizable=yes,scrollbars=yes');\r\n      \r\n      if (!win) {\r\n        alert('无法打开离线存储查看器，请检查浏览器弹窗设置');\r\n        return;\r\n      }\r\n\r\n      // 写入HTML内容（HTML中已包含标识设置）\r\n      win.document.write(OFFLINE_STORAGE_VIEWER_HTML);\r\n      win.document.close();\r\n\r\n      // 设置窗口标题\r\n      win.document.title = '离线存储数据查看器 - Tracker SDK';\r\n    } catch (error) {\r\n      console.error('PanelManager: Failed to open offline storage viewer:', error);\r\n      alert('打开离线存储查看器失败: ' + (error instanceof Error ? error.message : String(error)));\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取性能监控面板HTML\r\n   */\r\n  getPerformancePanelHTML(): string {\r\n    return PERFORMANCE_PANEL_HTML;\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储查看器HTML\r\n   */\r\n  getOfflineStorageViewerHTML(): string {\r\n    return OFFLINE_STORAGE_VIEWER_HTML;\r\n  }\r\n}\r\n\r\nexport default PanelManager;\r\n","import type { TrackerEvent, UserInfo } from '@/types';\n\nexport interface TrackerEventEnricherContext {\n  deviceId: string;\n  sessionId: string;\n  configUserId?: string;\n  userInfo?: UserInfo | null;\n  customProperties?: Record<string, unknown>;\n}\n\nclass TrackerEventEnricher {\n  enrich(event: TrackerEvent, context: TrackerEventEnricherContext): TrackerEvent {\n    const userId = event.userId || context.userInfo?.userId || context.configUserId;\n    const customProperties = context.customProperties || {};\n    const eventProperties = event.properties || {};\n\n    const mergedProperties = {\n      ...customProperties,\n      ...eventProperties\n    };\n\n    const finalProperties = Object.keys(mergedProperties).length > 0 ? mergedProperties : undefined;\n    const enriched: TrackerEvent = {\n      ...event,\n      deviceId: event.deviceId || context.deviceId,\n      sessionId: event.sessionId || context.sessionId\n    };\n\n    if (userId && userId !== '') {\n      enriched.userId = userId;\n    }\n\n    if (finalProperties) {\n      enriched.properties = finalProperties;\n    }\n\n    return enriched;\n  }\n}\n\nexport default TrackerEventEnricher;\n","import type { TrackerEvent } from '@/types';\nimport { eventBus } from '@/core/event-bus';\n\nconst TRACKER_EVENT_TYPES = ['pageview', 'click', 'exposure', 'input', 'error', 'performance'] as const;\n\ntype TrackerEventType = (typeof TRACKER_EVENT_TYPES)[number];\ntype TrackerEventHandler = (event: unknown) => void;\ntype WindowTrackerEventBus = { emit: (event: string, data: unknown) => void };\n\ndeclare global {\n  interface Window {\n    __trackerEventBus?: WindowTrackerEventBus;\n  }\n}\n\nclass TrackerEventBusBridge {\n  private handlers: Array<{ event: TrackerEventType; handler: TrackerEventHandler }> = [];\n\n  constructor(private readonly send: (event: TrackerEvent) => void) {}\n\n  setup(): void {\n    if (this.handlers.length > 0) {\n      return;\n    }\n\n    TRACKER_EVENT_TYPES.forEach(eventName => {\n      const handler = (event: unknown) => {\n        this.send(event as TrackerEvent);\n      };\n      eventBus.on(eventName, handler);\n      this.handlers.push({ event: eventName, handler });\n    });\n  }\n\n  teardown(): void {\n    this.handlers.forEach(({ event, handler }) => {\n      eventBus.off(event, handler);\n    });\n    this.handlers = [];\n  }\n\n  attachToWindow(): void {\n    if (typeof window === 'undefined') {\n      return;\n    }\n\n    window.__trackerEventBus = {\n      emit: (event: string, data: unknown) => {\n        eventBus.emit(event, data);\n      }\n    };\n  }\n}\n\nexport default TrackerEventBusBridge;\n","import type { TrackerConfig } from '@/types';\n\ninterface ConfigStore {\n  update(updates: Partial<TrackerConfig>): void;\n  get<K extends keyof TrackerConfig>(key: K): TrackerConfig[K];\n}\n\ninterface BatchSenderConfigTarget {\n  setServerUrl(url: string): void;\n  setMaxRetries(maxRetries: number): void;\n  setBatchOptions(options: { batchSize?: number; batchWait?: number }): void;\n}\n\nclass TrackerConfigCoordinator {\n  constructor(\n    private readonly configStore: ConfigStore,\n    private readonly batchSender: BatchSenderConfigTarget\n  ) {}\n\n  apply(updates: Partial<TrackerConfig>): void {\n    this.configStore.update(updates);\n\n    if (updates.serverUrl !== undefined) {\n      this.batchSender.setServerUrl(updates.serverUrl || '');\n    }\n\n    if (updates.maxRetries !== undefined) {\n      this.batchSender.setMaxRetries(updates.maxRetries);\n    }\n\n    if (updates.batchSize !== undefined || updates.batchWait !== undefined) {\n      this.batchSender.setBatchOptions({\n        batchSize: this.configStore.get('batchSize') ?? 10,\n        batchWait: this.configStore.get('batchWait') ?? 5000\n      });\n    }\n  }\n}\n\nexport default TrackerConfigCoordinator;\n","/**\n * 页面浏览采集器\n */\nimport type { PageViewEvent } from '@/types';\nimport { getCurrentUrl, getPageTitle, getReferrer, isTrackerInternalPanel } from '@/core/utils';\n\nclass ViewTracker {\n  private startTime: number = Date.now();\n  private currentUrl: string = '';\n  private popstateHandler: (() => void) | null = null;\n  private visibilityChangeHandler: (() => void) | null = null;\n  private beforeUnloadHandler: (() => void) | null = null;\n  private isTracking: boolean = false; // 防止递归调用\n  private pendingUrlCheck: ReturnType<typeof setTimeout> | null = null; // 延迟URL检查的定时器\n  private lastPageViewTime: number = 0; // 上次页面浏览时间\n  private minPageViewInterval: number = 1000; // 最小页面浏览间隔（1秒）\n  private hiddenStartTime: number | null = null; // 页面隐藏开始时间\n  private totalHiddenTime: number = 0; // 累计隐藏时长\n  private isVisible: boolean = true; // 页面是否可见\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    this.trackPageView();\n    this.setupSPARouter();\n    this.setupPageLifecycle();\n  }\n\n  /**\n   * 追踪页面浏览\n   */\n  trackPageView(): PageViewEvent {\n    // 如果是SDK内部面板，不进行监控\n    if (isTrackerInternalPanel()) {\n      return {\n        type: 'pageview',\n        name: 'pageview',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle()\n      };\n    }\n\n    // 防止递归调用\n    if (this.isTracking) {\n      return {\n        type: 'pageview',\n        name: 'pageview',\n        timestamp: Date.now(),\n        url: this.currentUrl || getCurrentUrl(),\n        title: getPageTitle()\n      };\n    }\n\n    this.isTracking = true;\n\n    try {\n      const now = Date.now();\n      const url = getCurrentUrl();\n      const title = getPageTitle();\n      const referrer = getReferrer();\n\n      // 如果 URL 没有变化，仍然计算 duration，但不更新 currentUrl\n      // 这样可以记录用户在同一页面的停留时间\n      const shouldUpdateUrl = url !== this.currentUrl || this.currentUrl === '';\n\n      // 增强URL变化检测：如果URL没有变化且时间间隔很短，不触发事件\n      if (!shouldUpdateUrl && this.lastPageViewTime > 0) {\n        const timeSinceLastPageView = now - this.lastPageViewTime;\n        if (timeSinceLastPageView < this.minPageViewInterval) {\n          // URL未变化且时间间隔太短，不触发新事件\n          return {\n            type: 'pageview',\n            name: 'pageview',\n            timestamp: now,\n            url: this.currentUrl,\n            title\n          };\n        }\n      }\n\n      // 计算停留时长（排除隐藏时间）\n      const visibleDuration = this.currentUrl ? now - this.startTime - this.totalHiddenTime : 0;\n      const duration = visibleDuration > 0 ? visibleDuration : 0;\n\n      const event: PageViewEvent = {\n        type: 'pageview',\n        name: 'pageview',\n        timestamp: now,\n        url,\n        title,\n        referrer: this.currentUrl ? referrer : undefined,\n        duration: duration > 0 ? duration : undefined\n      };\n\n      // 只有在 URL 真正改变时才更新 startTime 和 currentUrl\n      if (shouldUpdateUrl) {\n        this.startTime = now;\n        this.currentUrl = url;\n        this.totalHiddenTime = 0; // 重置隐藏时长\n      }\n\n      // 更新上次页面浏览时间\n      this.lastPageViewTime = now;\n\n      // 触发事件总线\n      if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n        (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('pageview', event);\n      }\n\n      return event;\n    } finally {\n      // 使用 setTimeout 确保在下一个事件循环中重置标志，避免同步递归\n      setTimeout(() => {\n        this.isTracking = false;\n      }, 0);\n    }\n  }\n\n  /**\n   * 设置SPA路由监听\n   */\n  private setupSPARouter(): void {\n    if (typeof window === 'undefined') {\n      return;\n    }\n\n    // 监听popstate事件（浏览器前进后退）\n    this.popstateHandler = () => {\n      this.trackPageView();\n    };\n    window.addEventListener('popstate', this.popstateHandler);\n\n    // 拦截pushState和replaceState（使用链式调用避免冲突）\n    const historyProto = history as unknown as {\n      _originalPushState?: typeof history.pushState;\n      _originalReplaceState?: typeof history.replaceState;\n      _trackerPushStateWrapped?: boolean;\n      _trackerReplaceStateWrapped?: boolean;\n    };\n\n    // 检查是否已经被包装过\n    if (!historyProto._trackerPushStateWrapped) {\n      const originalPushState = history.pushState.bind(history);\n      historyProto._originalPushState = originalPushState;\n      historyProto._trackerPushStateWrapped = true;\n\n      history.pushState = (...args) => {\n        const result = originalPushState.apply(history, args);\n        // 不触发 popstate 事件，避免与路由框架冲突\n        // 改为延迟检查 URL 变化并直接追踪\n        // 使用 requestAnimationFrame 确保在路由框架处理完成后执行\n        if (this.pendingUrlCheck) {\n          clearTimeout(this.pendingUrlCheck);\n        }\n        this.pendingUrlCheck = setTimeout(() => {\n          const newUrl = getCurrentUrl();\n          // 只在 URL 真正改变时追踪\n          if (newUrl !== this.currentUrl) {\n            this.trackPageView();\n          }\n          this.pendingUrlCheck = null;\n        }, 100); // 延迟 100ms，确保路由框架完成处理\n        return result;\n      };\n    }\n\n    if (!historyProto._trackerReplaceStateWrapped) {\n      const originalReplaceState = history.replaceState.bind(history);\n      historyProto._originalReplaceState = originalReplaceState;\n      historyProto._trackerReplaceStateWrapped = true;\n\n      history.replaceState = (...args) => {\n        const result = originalReplaceState.apply(history, args);\n        // 不触发 popstate 事件，避免与路由框架冲突\n        // replaceState 通常用于更新状态而不改变 URL，所以不追踪\n        // 但如果 URL 改变了，也应该追踪\n        if (this.pendingUrlCheck) {\n          clearTimeout(this.pendingUrlCheck);\n        }\n        this.pendingUrlCheck = setTimeout(() => {\n          const newUrl = getCurrentUrl();\n          // 只在 URL 真正改变时追踪\n          if (newUrl !== this.currentUrl) {\n            this.trackPageView();\n          }\n          this.pendingUrlCheck = null;\n        }, 100); // 延迟 100ms，确保路由框架完成处理\n        return result;\n      };\n    }\n  }\n\n  /**\n   * 设置页面生命周期事件监听\n   */\n  private setupPageLifecycle(): void {\n    if (typeof document === 'undefined') {\n      return;\n    }\n\n    // 监听页面可见性变化\n    this.visibilityChangeHandler = () => {\n      const isHidden = document.hidden;\n      const now = Date.now();\n\n      if (isHidden && this.isVisible) {\n        // 页面从可见变为隐藏\n        this.hiddenStartTime = now;\n        this.isVisible = false;\n      } else if (!isHidden && !this.isVisible) {\n        // 页面从隐藏变为可见\n        if (this.hiddenStartTime) {\n          this.totalHiddenTime += now - this.hiddenStartTime;\n          this.hiddenStartTime = null;\n        }\n        this.isVisible = true;\n      }\n    };\n\n    document.addEventListener('visibilitychange', this.visibilityChangeHandler);\n\n    // 监听页面卸载前事件\n    this.beforeUnloadHandler = () => {\n      const now = Date.now();\n      \n      // 如果页面正在隐藏，累计隐藏时长\n      if (this.hiddenStartTime) {\n        this.totalHiddenTime += now - this.hiddenStartTime;\n        this.hiddenStartTime = null;\n      }\n\n      // 计算最终停留时长\n      const finalDuration = this.currentUrl ? now - this.startTime - this.totalHiddenTime : 0;\n      \n      // 发送最终页面浏览事件（如果停留时长大于0）\n      if (finalDuration > 0 && this.currentUrl) {\n        try {\n          const finalEvent: PageViewEvent = {\n            type: 'pageview',\n            name: 'page-before-unload',\n            timestamp: now,\n            url: this.currentUrl,\n            title: getPageTitle(),\n            duration: finalDuration\n          };\n\n          // 触发事件总线\n          if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n            (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('pageview', finalEvent);\n          }\n        } catch (error) {\n          console.error('ViewTracker: Error sending final pageview event:', error);\n        }\n      }\n    };\n\n    window.addEventListener('beforeunload', this.beforeUnloadHandler);\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    // 清除待处理的 URL 检查\n    if (this.pendingUrlCheck) {\n      clearTimeout(this.pendingUrlCheck);\n      this.pendingUrlCheck = null;\n    }\n\n    // 移除popstate监听器\n    if (this.popstateHandler && typeof window !== 'undefined') {\n      window.removeEventListener('popstate', this.popstateHandler);\n      this.popstateHandler = null;\n    }\n\n    // 移除页面生命周期事件监听器\n    if (this.visibilityChangeHandler && typeof document !== 'undefined') {\n      document.removeEventListener('visibilitychange', this.visibilityChangeHandler);\n      this.visibilityChangeHandler = null;\n    }\n\n    if (this.beforeUnloadHandler && typeof window !== 'undefined') {\n      window.removeEventListener('beforeunload', this.beforeUnloadHandler);\n      this.beforeUnloadHandler = null;\n    }\n\n    // 恢复原始方法（仅当是我们包装的时才恢复）\n    if (typeof window !== 'undefined') {\n      const historyProto = history as unknown as {\n        _originalPushState?: typeof history.pushState;\n        _originalReplaceState?: typeof history.replaceState;\n        _trackerPushStateWrapped?: boolean;\n        _trackerReplaceStateWrapped?: boolean;\n      };\n\n      if (historyProto._trackerPushStateWrapped && historyProto._originalPushState) {\n        history.pushState = historyProto._originalPushState;\n        historyProto._trackerPushStateWrapped = false;\n        delete historyProto._originalPushState;\n      }\n\n      if (historyProto._trackerReplaceStateWrapped && historyProto._originalReplaceState) {\n        history.replaceState = historyProto._originalReplaceState;\n        historyProto._trackerReplaceStateWrapped = false;\n        delete historyProto._originalReplaceState;\n      }\n    }\n  }\n}\n\nexport default ViewTracker;\n\n","/**\r\n * Vue3 集成核心逻辑\r\n */\r\nimport type { ComponentInfo } from '@/types';\r\nimport {\r\n  getVueComponentInstance,\r\n  getComponentName,\r\n  getComponentProps,\r\n  getComponentAttrs,\r\n  getComponentValue,\r\n  filterSensitiveData,\r\n  identifyNaiveUIComponent\r\n} from '@/core/vue-utils';\r\n\r\n/**\r\n * Vue3 组件信息提取选项\r\n */\r\nexport interface VueComponentExtractOptions {\r\n  /** 是否提取组件 props（默认 true） */\r\n  extractProps?: boolean;\r\n  /** 是否提取组件 attrs（默认 true） */\r\n  extractAttrs?: boolean;\r\n  /** 是否提取组件值（默认 true） */\r\n  extractValue?: boolean;\r\n  /** 是否提取组件标签文本（默认 true） */\r\n  extractLabel?: boolean;\r\n}\r\n\r\n/**\r\n * 从 DOM 元素提取 Vue 组件信息\r\n */\r\nexport function extractVueComponentInfo(\r\n  element: Element | null,\r\n  options: VueComponentExtractOptions = {}\r\n): ComponentInfo | undefined {\r\n  if (!element || typeof window === 'undefined') {\r\n    return undefined;\r\n  }\r\n\r\n  const {\r\n    extractProps = true,\r\n    extractAttrs = true,\r\n    extractValue = true,\r\n    extractLabel = true\r\n  } = options;\r\n\r\n  // 首先尝试识别 naive-ui 组件（通过类名）\r\n  const naiveUIComponentName = identifyNaiveUIComponent(element);\r\n  \r\n  // 获取 Vue 组件实例\r\n  const vueInstance = getVueComponentInstance(element);\r\n  \r\n  // 获取组件名（优先使用 naive-ui 识别的名称）\r\n  const componentName = naiveUIComponentName || getComponentName(vueInstance);\r\n\r\n  // 如果没有识别到组件，返回 undefined\r\n  if (!componentName && !vueInstance) {\r\n    return undefined;\r\n  }\r\n\r\n  const componentInfo: ComponentInfo = {};\r\n\r\n  // 设置组件名\r\n  if (componentName) {\r\n    componentInfo.componentName = componentName;\r\n  }\r\n\r\n  // 提取 props\r\n  if (extractProps && vueInstance) {\r\n    const props = getComponentProps(vueInstance);\r\n    if (props) {\r\n      componentInfo.props = filterSensitiveData(props);\r\n      \r\n      // 从 props 中提取一些常用属性\r\n      if ('type' in props) {\r\n        componentInfo.componentType = String(props.type);\r\n      }\r\n      if ('disabled' in props) {\r\n        componentInfo.disabled = Boolean(props.disabled);\r\n      }\r\n      if ('label' in props && extractLabel) {\r\n        componentInfo.label = String(props.label);\r\n      }\r\n    }\r\n  }\r\n\r\n  // 提取 attrs\r\n  if (extractAttrs && vueInstance) {\r\n    const attrs = getComponentAttrs(vueInstance);\r\n    if (attrs) {\r\n      componentInfo.attrs = filterSensitiveData(attrs);\r\n      \r\n      // 从 attrs 中提取一些常用属性\r\n      if (!componentInfo.componentType && 'type' in attrs) {\r\n        componentInfo.componentType = String(attrs.type);\r\n      }\r\n      if (componentInfo.disabled === undefined && 'disabled' in attrs) {\r\n        componentInfo.disabled = Boolean(attrs.disabled);\r\n      }\r\n    }\r\n  }\r\n\r\n  // 提取组件值\r\n  if (extractValue && vueInstance) {\r\n    const value = getComponentValue(vueInstance);\r\n    if (value !== undefined && value !== null) {\r\n      // 对于敏感字段，只记录类型\r\n      const props = getComponentProps(vueInstance);\r\n      const isSensitive = props && (\r\n        ('type' in props && String(props.type).toLowerCase() === 'password') ||\r\n        ('password' in props) ||\r\n        (componentName === 'n-input' && 'type' in props && String(props.type).toLowerCase() === 'password')\r\n      );\r\n\r\n      if (isSensitive) {\r\n        // 敏感字段：只记录类型和长度（如果可能）\r\n        const valueLength = typeof value === 'string' ? value.length : undefined;\r\n        componentInfo.value = valueLength !== undefined \r\n          ? `[password:${valueLength} chars]` \r\n          : `[${typeof value}]`;\r\n      } else {\r\n        // 对于复杂对象，只记录类型和关键信息\r\n        if (typeof value === 'object') {\r\n          if (Array.isArray(value)) {\r\n            componentInfo.value = `[Array(${value.length})]`;\r\n            // 如果是 select 的选项，记录选项信息\r\n            if (componentName === 'n-select' || componentName === 'n-cascader') {\r\n              componentInfo.options = {\r\n                count: value.length,\r\n                multiple: props && 'multiple' in props ? Boolean(props.multiple) : false\r\n              };\r\n            }\r\n          } else {\r\n            componentInfo.value = `[Object]`;\r\n          }\r\n        } else {\r\n          componentInfo.value = value;\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  // 提取标签文本（从元素本身或子元素）\r\n  if (extractLabel && !componentInfo.label) {\r\n    const text = element.textContent?.trim();\r\n    if (text && text.length > 0 && text.length < 100) {\r\n      componentInfo.label = text.substring(0, 100);\r\n    }\r\n  }\r\n\r\n  // 对于 select 组件，尝试提取选项信息\r\n  if ((componentName === 'n-select' || componentName === 'n-cascader') && vueInstance) {\r\n    const props = getComponentProps(vueInstance);\r\n    if (props && 'options' in props && Array.isArray(props.options)) {\r\n      componentInfo.options = {\r\n        count: props.options.length,\r\n        multiple: props && 'multiple' in props ? Boolean(props.multiple) : false\r\n      };\r\n    }\r\n  }\r\n\r\n  return Object.keys(componentInfo).length > 0 ? componentInfo : undefined;\r\n}\r\n\r\n/**\r\n * 检查元素是否为 Vue 组件\r\n */\r\nexport function isVueComponent(element: Element | null): boolean {\r\n  if (!element) {\r\n    return false;\r\n  }\r\n\r\n  const vueInstance = getVueComponentInstance(element);\r\n  return vueInstance !== null;\r\n}\r\n\r\n/**\r\n * 检查元素是否为 naive-ui 组件\r\n */\r\nexport function isNaiveUIComponent(element: Element | null): boolean {\r\n  if (!element) {\r\n    return false;\r\n  }\r\n\r\n  const componentName = identifyNaiveUIComponent(element);\r\n  return componentName !== undefined && componentName.startsWith('n-');\r\n}\r\n","/**\r\n * Naive-UI 专用追踪器\r\n * 专门针对 naive-ui 组件的追踪和识别\r\n */\r\nimport type { ComponentInfo } from '@/types';\r\nimport { extractVueComponentInfo, isNaiveUIComponent } from './vue-integration';\r\nimport { identifyNaiveUIComponent } from '@/core/vue-utils';\r\n\r\n/**\r\n * Naive-UI 组件类型映射\r\n */\r\nconst NAIVE_UI_COMPONENT_TYPES: Record<string, string[]> = {\r\n  'n-button': ['default', 'primary', 'success', 'info', 'warning', 'error', 'tertiary', 'quaternary'],\r\n  'n-input': ['text', 'password', 'textarea', 'number', 'email', 'tel', 'url'],\r\n  'n-select': ['default', 'multiple', 'tags', 'filterable'],\r\n  'n-checkbox': ['default', 'indeterminate'],\r\n  'n-radio': ['default', 'button'],\r\n  'n-switch': ['default'],\r\n  'n-date-picker': ['date', 'datetime', 'daterange', 'datetimerange'],\r\n  'n-time-picker': ['time', 'timerange'],\r\n  'n-cascader': ['default', 'multiple', 'filterable'],\r\n  'n-transfer': ['default'],\r\n  'n-tree-select': ['default', 'multiple', 'filterable'],\r\n  'n-form': ['default', 'inline'],\r\n  'n-form-item': ['default'],\r\n  'n-table': ['default', 'bordered', 'striped'],\r\n  'n-pagination': ['default'],\r\n  'n-menu': ['default', 'horizontal', 'vertical'],\r\n  'n-tabs': ['default', 'card', 'bar'],\r\n  'n-drawer': ['default'],\r\n  'n-modal': ['default'],\r\n  'n-message': ['default', 'success', 'info', 'warning', 'error'],\r\n  'n-notification': ['default', 'success', 'info', 'warning', 'error'],\r\n  'n-popover': ['default'],\r\n  'n-tooltip': ['default'],\r\n  'n-dropdown': ['default'],\r\n  'n-breadcrumb': ['default'],\r\n  'n-steps': ['default', 'vertical'],\r\n  'n-timeline': ['default'],\r\n  'n-card': ['default', 'bordered', 'hoverable'],\r\n  'n-collapse': ['default', 'accordion'],\r\n  'n-divider': ['default', 'horizontal', 'vertical'],\r\n  'n-space': ['default', 'vertical'],\r\n  'n-grid': ['default'],\r\n  'n-layout': ['default'],\r\n  'n-back-top': ['default'],\r\n  'n-anchor': ['default'],\r\n  'n-affix': ['default'],\r\n  'n-watermark': ['default'],\r\n  'n-spin': ['default'],\r\n  'n-skeleton': ['default'],\r\n  'n-progress': ['default', 'line', 'circle', 'dashboard'],\r\n  'n-rate': ['default'],\r\n  'n-slider': ['default', 'range'],\r\n  'n-color-picker': ['default'],\r\n  'n-image': ['default'],\r\n  'n-avatar': ['default', 'circle', 'square'],\r\n  'n-badge': ['default'],\r\n  'n-tag': ['default', 'success', 'info', 'warning', 'error'],\r\n  'n-empty': ['default'],\r\n  'n-result': ['default', 'success', 'info', 'warning', 'error', '404', '500'],\r\n  'n-descriptions': ['default', 'bordered'],\r\n  'n-statistic': ['default'],\r\n  'n-list': ['default', 'bordered'],\r\n  'n-list-item': ['default'],\r\n  'n-carousel': ['default', 'dot', 'arrow'],\r\n  'n-calendar': ['default']\r\n};\r\n\r\n/**\r\n * 提取 Naive-UI 组件特定信息\r\n */\r\nexport function extractNaiveUIComponentInfo(\r\n  element: Element | null,\r\n  options: {\r\n    extractProps?: boolean;\r\n    extractAttrs?: boolean;\r\n    extractValue?: boolean;\r\n    extractLabel?: boolean;\r\n  } = {}\r\n): ComponentInfo | undefined {\r\n  if (!element) {\r\n    return undefined;\r\n  }\r\n\r\n  // 首先检查是否为 naive-ui 组件\r\n  if (!isNaiveUIComponent(element)) {\r\n    return undefined;\r\n  }\r\n\r\n  // 使用通用的 Vue 组件信息提取\r\n  const componentInfo = extractVueComponentInfo(element, {\r\n    extractProps: options.extractProps,\r\n    extractAttrs: options.extractAttrs,\r\n    extractValue: options.extractValue,\r\n    extractLabel: options.extractLabel\r\n  });\r\n\r\n  if (!componentInfo) {\r\n    return undefined;\r\n  }\r\n\r\n  const componentName = componentInfo.componentName;\r\n\r\n  if (!componentName || !componentName.startsWith('n-')) {\r\n    return componentInfo;\r\n  }\r\n\r\n  // 针对特定组件的增强信息提取\r\n  switch (componentName) {\r\n    case 'n-button':\r\n      // 按钮组件：提取按钮文本、类型、图标等\r\n      enhanceButtonInfo(element, componentInfo);\r\n      break;\r\n\r\n    case 'n-input':\r\n      // 输入框组件：提取类型、placeholder、值等\r\n      enhanceInputInfo(element, componentInfo);\r\n      break;\r\n\r\n    case 'n-select':\r\n    case 'n-cascader':\r\n    case 'n-tree-select':\r\n      // 选择器组件：提取选项、选中值等\r\n      enhanceSelectInfo(element, componentInfo);\r\n      break;\r\n\r\n    case 'n-checkbox':\r\n    case 'n-radio':\r\n      // 复选框/单选框：提取选中状态、标签等\r\n      enhanceCheckboxRadioInfo(element, componentInfo);\r\n      break;\r\n\r\n    case 'n-switch':\r\n      // 开关组件：提取开关状态\r\n      enhanceSwitchInfo(element, componentInfo);\r\n      break;\r\n\r\n    case 'n-form':\r\n    case 'n-form-item':\r\n      // 表单组件：提取表单相关信息\r\n      enhanceFormInfo(element, componentInfo);\r\n      break;\r\n\r\n    default:\r\n      // 其他组件使用默认提取\r\n      break;\r\n  }\r\n\r\n  return componentInfo;\r\n}\r\n\r\n/**\r\n * 增强按钮组件信息\r\n */\r\nfunction enhanceButtonInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 提取按钮文本\r\n  if (!componentInfo.label) {\r\n    const text = element.textContent?.trim();\r\n    if (text) {\r\n      componentInfo.label = text.substring(0, 50);\r\n    }\r\n  }\r\n\r\n  // 检查是否有图标\r\n  const iconElement = element.querySelector('.n-button__icon, [class*=\"icon\"]');\r\n  if (iconElement) {\r\n    componentInfo.hasIcon = true;\r\n  }\r\n\r\n  // 检查按钮状态\r\n  if (element.classList.contains('n-button--disabled') || element.hasAttribute('disabled')) {\r\n    componentInfo.disabled = true;\r\n  }\r\n\r\n  if (element.classList.contains('n-button--loading')) {\r\n    componentInfo.loading = true;\r\n  }\r\n}\r\n\r\n/**\r\n * 增强输入框组件信息\r\n */\r\nfunction enhanceInputInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 查找实际的 input 元素\r\n  const inputElement = element.querySelector('input, textarea') as HTMLInputElement | HTMLTextAreaElement | null;\r\n  \r\n  if (inputElement) {\r\n    // 提取 placeholder\r\n    if (!componentInfo.attrs?.placeholder && inputElement.placeholder) {\r\n      if (!componentInfo.attrs) {\r\n        componentInfo.attrs = {};\r\n      }\r\n      componentInfo.attrs.placeholder = inputElement.placeholder;\r\n    }\r\n\r\n    // 提取 input 类型\r\n    if (inputElement.tagName.toLowerCase() === 'input') {\r\n      const inputType = inputElement.type || 'text';\r\n      if (!componentInfo.componentType) {\r\n        componentInfo.componentType = inputType;\r\n      }\r\n      \r\n      // 如果是密码类型，标记为敏感\r\n      if (inputType === 'password') {\r\n        componentInfo.isSensitive = true;\r\n        // 如果之前提取的值不是密码格式，需要重新格式化\r\n        if (componentInfo.value && typeof componentInfo.value === 'string') {\r\n          // 检查是否已经是密码格式\r\n          if (!componentInfo.value.startsWith('[password:')) {\r\n            componentInfo.value = `[password:${componentInfo.value.length} chars]`;\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    // 提取值：优先使用 DOM 元素的实际值，因为它更准确（反映用户实际输入）\r\n    // 对于 input 元素，DOM 值比 Vue 实例中的值更可靠\r\n    const value = inputElement.value;\r\n    if (value) {\r\n      const isPassword = inputElement.type === 'password' || \r\n                        (componentInfo.props && 'type' in componentInfo.props && \r\n                         String(componentInfo.props.type).toLowerCase() === 'password');\r\n      \r\n      if (isPassword) {\r\n        // 密码字段：只记录长度\r\n        componentInfo.value = `[password:${value.length} chars]`;\r\n        componentInfo.isSensitive = true;\r\n      } else {\r\n        // 非敏感字段：记录实际值（限制长度），覆盖之前从 Vue 实例提取的值\r\n        componentInfo.value = value.length > 100 ? value.substring(0, 100) + '...' : value;\r\n      }\r\n    } else if (!componentInfo.value) {\r\n      // 如果 DOM 元素没有值，且之前也没有提取到值，保持 undefined\r\n      // 注意：这里不检查 === undefined，因为可能是 null 或其他 falsy 值\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * 增强选择器组件信息\r\n */\r\nfunction enhanceSelectInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 查找选中的值显示元素\r\n  const selectedElement = element.querySelector('.n-base-selection, .n-base-selection-label');\r\n  if (selectedElement) {\r\n    const selectedText = selectedElement.textContent?.trim();\r\n    if (selectedText && !componentInfo.label) {\r\n      componentInfo.label = selectedText.substring(0, 100);\r\n    }\r\n  }\r\n\r\n  // 检查是否多选\r\n  if (element.classList.contains('n-base-selection--multiple')) {\r\n    if (!componentInfo.options) {\r\n      componentInfo.options = {};\r\n    }\r\n    componentInfo.options.multiple = true;\r\n  }\r\n\r\n  // 检查是否可搜索\r\n  if (element.querySelector('.n-base-selection-input')) {\r\n    componentInfo.filterable = true;\r\n  }\r\n}\r\n\r\n/**\r\n * 增强复选框/单选框组件信息\r\n */\r\nfunction enhanceCheckboxRadioInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 查找实际的 input 元素\r\n  const inputElement = element.querySelector('input[type=\"checkbox\"], input[type=\"radio\"]') as HTMLInputElement | null;\r\n  \r\n  if (inputElement) {\r\n    // 提取选中状态\r\n    componentInfo.checked = inputElement.checked;\r\n\r\n    // 提取标签文本\r\n    const labelElement = element.querySelector('label, .n-checkbox__label, .n-radio__label');\r\n    if (labelElement) {\r\n      const labelText = labelElement.textContent?.trim();\r\n      if (labelText && !componentInfo.label) {\r\n        componentInfo.label = labelText.substring(0, 100);\r\n      }\r\n    }\r\n\r\n    // 提取值\r\n    if (inputElement.value) {\r\n      componentInfo.value = inputElement.value;\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * 增强开关组件信息\r\n */\r\nfunction enhanceSwitchInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 查找实际的 input 元素\r\n  const inputElement = element.querySelector('input[type=\"checkbox\"]') as HTMLInputElement | null;\r\n  \r\n  if (inputElement) {\r\n    componentInfo.checked = inputElement.checked;\r\n    componentInfo.value = inputElement.checked;\r\n  }\r\n}\r\n\r\n/**\r\n * 增强表单组件信息\r\n */\r\nfunction enhanceFormInfo(element: Element, componentInfo: ComponentInfo): void {\r\n  // 提取表单标签\r\n  const labelElement = element.querySelector('.n-form-item-label, label');\r\n  if (labelElement) {\r\n    const labelText = labelElement.textContent?.trim();\r\n    if (labelText && !componentInfo.label) {\r\n      componentInfo.label = labelText.substring(0, 100);\r\n    }\r\n  }\r\n\r\n  // 检查是否为必填项\r\n  const requiredElement = element.querySelector('.n-form-item-label__asterisk, [class*=\"required\"]');\r\n  if (requiredElement) {\r\n    componentInfo.required = true;\r\n  }\r\n}\r\n\r\n/**\r\n * 检查组件是否为特定的 naive-ui 组件类型\r\n */\r\nexport function isNaiveUIComponentType(element: Element | null, componentType: string): boolean {\r\n  if (!element) {\r\n    return false;\r\n  }\r\n\r\n  const componentName = identifyNaiveUIComponent(element);\r\n  return componentName === componentType;\r\n}\r\n\r\n/**\r\n * 获取 naive-ui 组件支持的类型列表\r\n */\r\nexport function getNaiveUIComponentTypes(componentName: string): string[] | undefined {\r\n  return NAIVE_UI_COMPONENT_TYPES[componentName];\r\n}\r\n","/**\r\n * 原生 data-* 约定解析（无框架或补充语义）\r\n */\r\nimport type { ComponentInfo } from '@/types';\r\n\r\nconst MAX_PROPS_ATTR_LEN = 8192;\r\n\r\n/**\r\n * 从 DOM 读取 data-track-name / data-track-component / data-track-props\r\n */\r\nexport function extractDomDataComponentInfo(element: Element | null): ComponentInfo | undefined {\r\n  if (!element) {\r\n    return undefined;\r\n  }\r\n\r\n  const name =\r\n    element.getAttribute('data-track-name') || element.getAttribute('data-track-component');\r\n  if (!name) {\r\n    return undefined;\r\n  }\r\n\r\n  const info: ComponentInfo = {\r\n    componentName: name\r\n  };\r\n\r\n  const propsRaw = element.getAttribute('data-track-props');\r\n  if (propsRaw && propsRaw.length <= MAX_PROPS_ATTR_LEN) {\r\n    try {\r\n      const parsed = JSON.parse(propsRaw) as Record<string, unknown>;\r\n      if (parsed && typeof parsed === 'object') {\r\n        info.props = parsed;\r\n      }\r\n    } catch {\r\n      /* ignore invalid JSON */\r\n    }\r\n  }\r\n\r\n  return info;\r\n}\r\n","/**\r\n * UI 库 DOM 兜底增强（启发式规则）\r\n *\r\n * 目标：\r\n * - 当没有框架适配器/也没有 data-track-* 兜底信息时，基于稳定的 class 前缀识别常见组件库组件类型\r\n * - 仅输出“组件类别信息”，不采集输入值/敏感信息\r\n */\r\nimport type { ComponentInfo } from '@/types';\r\nimport { walkParentElements } from './dom-context';\r\n\r\nconst MAX_ANCESTOR_DEPTH = 8;\r\n\r\nfunction hasClassPrefix(el: Element, prefix: string): boolean {\r\n  const cls = el.getAttribute('class');\r\n  if (!cls) {\r\n    return false;\r\n  }\r\n  return cls.split(/\\s+/).some(c => c === prefix || c.startsWith(`${prefix}-`));\r\n}\r\n\r\nfunction guessAntdComponent(el: Element): ComponentInfo | undefined {\r\n  let matched: ComponentInfo | undefined;\r\n\r\n  walkParentElements(el, MAX_ANCESTOR_DEPTH, candidate => {\r\n    if (hasClassPrefix(candidate, 'ant-btn')) {\r\n      matched = { componentName: 'AntButton' };\r\n      return false;\r\n    }\r\n    if (\r\n      hasClassPrefix(candidate, 'ant-input') ||\r\n      hasClassPrefix(candidate, 'ant-input-affix-wrapper') ||\r\n      hasClassPrefix(candidate, 'ant-input-group-wrapper')\r\n    ) {\r\n      matched = { componentName: 'AntInput' };\r\n      return false;\r\n    }\r\n  });\r\n\r\n  return matched;\r\n}\r\n\r\n/**\r\n * 基于 DOM/class 的 UI 库启发式识别\r\n */\r\nexport function guessUiLibComponentInfo(element: Element | null): ComponentInfo | undefined {\r\n  if (!element) {\r\n    return undefined;\r\n  }\r\n\r\n  // 目前仅覆盖 Ant Design / Ant Design Vue（均使用 ant- 前缀）\r\n  return guessAntdComponent(element);\r\n}\r\n\r\n","import type { TrackerConfig, ComponentInfo, FrameAdapter, FrameAdapterContext } from '@/types';\nimport { extractNaiveUIComponentInfo } from '@/extension/naive-ui-tracker';\nimport { extractVueComponentInfo } from '@/extension/vue-integration';\nimport { extractDomDataComponentInfo } from './dom-data';\nimport { guessUiLibComponentInfo } from './ui-lib-heuristics';\nimport { normalizeToElement } from './dom-context';\n\nexport type ComponentResolver = (ctx: FrameAdapterContext) => ComponentInfo | undefined;\n\nfunction sortAdapters(adapters: FrameAdapter[]): FrameAdapter[] {\n  return [...adapters].sort((a, b) => (b.priority ?? 0) - (a.priority ?? 0));\n}\n\nexport function createUserAdapterResolver(config: TrackerConfig): ComponentResolver {\n  return (ctx: FrameAdapterContext) => {\n    const userAdapters = config.frameAdapters ? sortAdapters(config.frameAdapters) : [];\n\n    for (const adapter of userAdapters) {\n      try {\n        const info = adapter.resolveComponentInfo(ctx);\n        if (info) {\n          return info;\n        }\n      } catch {\n        /* try next adapter */\n      }\n    }\n\n    return undefined;\n  };\n}\n\nexport function createBuiltinFrameworkResolver(config: TrackerConfig): ComponentResolver {\n  const extractOpts = {\n    extractProps: config.extractComponentProps ?? true,\n    extractValue: config.extractComponentValue ?? true\n  };\n\n  return (ctx: FrameAdapterContext) => {\n    const element = normalizeToElement(ctx.target);\n    if (!element) {\n      return undefined;\n    }\n\n    try {\n      if (config.enableNaiveUITracking) {\n        const naive = extractNaiveUIComponentInfo(element, extractOpts);\n        if (naive) {\n          return naive;\n        }\n      }\n\n      if (config.enableVueTracking) {\n        const vue = extractVueComponentInfo(element, extractOpts);\n        if (vue) {\n          return vue;\n        }\n      }\n    } catch {\n      return undefined;\n    }\n\n    return undefined;\n  };\n}\n\nexport function domDataResolver(ctx: FrameAdapterContext): ComponentInfo | undefined {\n  return extractDomDataComponentInfo(normalizeToElement(ctx.target));\n}\n\nexport function uiLibHeuristicsResolver(ctx: FrameAdapterContext): ComponentInfo | undefined {\n  return guessUiLibComponentInfo(normalizeToElement(ctx.target)) ?? undefined;\n}\n\nexport function resolveWithResolvers(\n  ctx: FrameAdapterContext,\n  resolvers: ComponentResolver[]\n): ComponentInfo | undefined {\n  for (const resolver of resolvers) {\n    const info = resolver(ctx);\n    if (info) {\n      return info;\n    }\n  }\n\n  return undefined;\n}\n","/**\n * 框架适配器链：用户适配器 → Naive/Vue → data-* 兜底\n */\nimport type { TrackerConfig, ComponentInfo, FrameAdapterContext } from '@/types';\nimport {\n  createBuiltinFrameworkResolver,\n  createUserAdapterResolver,\n  domDataResolver,\n  resolveWithResolvers,\n  uiLibHeuristicsResolver\n} from './component-resolvers';\n\r\n/**\r\n * 解析点击/输入等场景下的组件信息\r\n */\r\nexport function resolveClickComponentInfo(\r\n  element: Element | null,\r\n  event: Event | undefined,\r\n  getConfig: () => TrackerConfig\r\n): ComponentInfo | undefined {\r\n  if (!element) {\r\n    return undefined;\r\n  }\r\n\r\n  const config = getConfig();\r\n  const ctx: FrameAdapterContext = {\n    target: element,\n    event,\n    trackerConfig: config\n  };\n\n  return resolveWithResolvers(ctx, [\n    createUserAdapterResolver(config),\n    createBuiltinFrameworkResolver(config),\n    domDataResolver,\n    uiLibHeuristicsResolver\n  ]);\n}\n","import type { ClickEvent, TrackerConfig } from '@/types';\nimport { getElementInfo, getElementPath, getCurrentUrl, getPageTitle } from '@/core/utils';\nimport { resolveClickComponentInfo } from '@/extension/frame-adapters/resolve';\n\ninterface ClickEventFactoryOptions {\n  getConfig?: (() => TrackerConfig) | null;\n}\n\ninterface InteractionInput {\n  element: Element;\n  timestamp: number;\n  position: { x: number; y: number };\n  interactionType: 'mouse' | 'touch';\n  eventName: 'click' | 'touch-click';\n  nativeEvent?: Event;\n}\n\nclass ClickEventFactory {\n  constructor(private readonly options: ClickEventFactoryOptions = {}) {}\n\n  create(input: InteractionInput): ClickEvent {\n    const clickEvent: ClickEvent = {\n      type: 'click',\n      name: input.eventName,\n      timestamp: input.timestamp,\n      url: getCurrentUrl(),\n      title: getPageTitle(),\n      elementPath: getElementPath(input.element),\n      elementInfo: getElementInfo(input.element),\n      position: input.position,\n      interactionType: input.interactionType\n    };\n\n    const configGetter = this.options.getConfig;\n    if (configGetter) {\n      try {\n        const info = resolveClickComponentInfo(input.element, input.nativeEvent, configGetter);\n        if (info) {\n          clickEvent.componentInfo = info;\n        }\n      } catch (componentError) {\n        console.warn('ClickTracker: Error extracting component info:', componentError);\n      }\n    }\n\n    return clickEvent;\n  }\n}\n\nexport default ClickEventFactory;\n","import type { ClickEvent } from '@/types';\n\ntype TrackerEventBus = { emit: (event: string, data: unknown) => void };\n\nclass ClickEventDispatcher {\n  dispatch(event: ClickEvent): void {\n    const bus =\n      typeof window !== 'undefined'\n        ? ((window as unknown as { __trackerEventBus?: TrackerEventBus }).__trackerEventBus ?? null)\n        : null;\n\n    if (!bus) {\n      return;\n    }\n\n    bus.emit('click', event);\n  }\n\n  schedule(task: () => void, timeout: number): void {\n    if (typeof requestIdleCallback !== 'undefined') {\n      requestIdleCallback(task, { timeout });\n    } else {\n      setTimeout(task, 0);\n    }\n  }\n}\n\nexport default ClickEventDispatcher;\n","type TouchStartRecord = {\n  x: number;\n  y: number;\n  time: number;\n};\n\ntype TouchInteractionResult =\n  | {\n      isTap: true;\n      position: { x: number; y: number };\n    }\n  | {\n      isTap: false;\n    };\n\nclass TouchInteractionTracker {\n  private lastTouch: TouchStartRecord | null = null;\n\n  constructor(\n    private readonly clickThresholdMs: number = 300,\n    private readonly distanceThresholdPx: number = 10\n  ) {}\n\n  recordTouchStart(touch: Touch, now: number): void {\n    this.lastTouch = {\n      x: touch.clientX,\n      y: touch.clientY,\n      time: now\n    };\n  }\n\n  resolveTouchEnd(touch: Touch, now: number): TouchInteractionResult {\n    if (!this.lastTouch) {\n      return { isTap: false };\n    }\n\n    const deltaX = Math.abs(touch.clientX - this.lastTouch.x);\n    const deltaY = Math.abs(touch.clientY - this.lastTouch.y);\n    const deltaTime = now - this.lastTouch.time;\n    this.lastTouch = null;\n\n    if (\n      deltaTime < this.clickThresholdMs &&\n      deltaX < this.distanceThresholdPx &&\n      deltaY < this.distanceThresholdPx\n    ) {\n      return {\n        isTap: true,\n        position: {\n          x: touch.clientX,\n          y: touch.clientY\n        }\n      };\n    }\n\n    return { isTap: false };\n  }\n\n  reset(): void {\n    this.lastTouch = null;\n  }\n}\n\nexport default TouchInteractionTracker;\n","/**\r\n * 点击事件采集器\r\n */\r\nimport type { ClickEvent, TrackerConfig } from '@/types';\nimport { debounce, isTrackerInternalPanel } from '@/core/utils';\nimport ClickEventFactory from './click-event-factory';\nimport ClickEventDispatcher from './click-event-dispatcher';\nimport TouchInteractionTracker from './touch-interaction-tracker';\n\nclass ClickTracker {\n  private clickHandler: ((event: MouseEvent) => void) | null = null;\n  private touchStartHandler: ((event: TouchEvent) => void) | null = null;\n  private touchEndHandler: ((event: TouchEvent) => void) | null = null;\n  private debounceTime: number = 300;\n  private touchTimeout: number | null = null;\n  private configGetter: (() => TrackerConfig) | null = null;\n  private eventFactory: ClickEventFactory = new ClickEventFactory();\n  private eventDispatcher: ClickEventDispatcher = new ClickEventDispatcher();\n  private touchInteractionTracker: TouchInteractionTracker = new TouchInteractionTracker();\n\r\n  /**\r\n   * 初始化\r\n   * @param debounceTime 点击防抖毫秒（可选）\r\n   * @param options 可选；若含 `getConfig`，则用于解析组件信息；不传则仍可上报点击，无组件增强信息\r\n   */\r\n  init(debounceTime?: number, options?: {\r\n    enableVueTracking?: boolean;\r\n    enableNaiveUITracking?: boolean;\r\n    extractComponentProps?: boolean;\r\n    extractComponentValue?: boolean;\r\n    getConfig?: () => TrackerConfig;\r\n  }): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    if (debounceTime !== undefined) {\r\n      this.debounceTime = debounceTime;\r\n    }\r\n\r\n    if (options) {\n      this.configGetter = options.getConfig ?? null;\n    }\n    this.eventFactory = new ClickEventFactory({ getConfig: this.configGetter });\n\r\n    // 初始化鼠标点击处理器\r\n    this.clickHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as MouseEvent;\r\n      this.handleClick(event);\r\n    }, this.debounceTime);\r\n\r\n    // 初始化触摸事件处理器\r\n    // touchstart需要立即处理，不使用debounce\r\n    this.touchStartHandler = ((event: TouchEvent) => {\r\n      this.handleTouch(event);\r\n    }) as EventListener;\r\n    \r\n    // touchend使用debounce防止重复点击\r\n    this.touchEndHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as TouchEvent;\r\n      this.handleTouch(event);\r\n    }, this.debounceTime);\r\n\r\n    // 监听鼠标点击事件\r\n    document.addEventListener('click', this.clickHandler as EventListener, false);\r\n    \r\n    // 监听触摸事件，用于移动端兼容性\r\n    // touchstart立即处理，touchend使用debounce\r\n    document.addEventListener('touchstart', this.touchStartHandler, { passive: true, capture: false });\r\n    document.addEventListener('touchend', this.touchEndHandler as EventListener, { passive: true, capture: false });\r\n  }\r\n\r\n  /**\r\n   * 处理触摸事件\r\n   */\r\n  private handleTouch(event: TouchEvent): void {\r\n    try {\n      const now = Date.now();\n\n      switch (event.type) {\n        case 'touchstart':\n          if (event.touches.length > 0) {\n            this.touchInteractionTracker.recordTouchStart(event.touches[0], now);\n          }\n          break;\n\n        case 'touchend':\n          if (event.changedTouches.length > 0) {\n            const endTouch = event.changedTouches[0];\n            const result = this.touchInteractionTracker.resolveTouchEnd(endTouch, now);\n\n            if (result.isTap) {\n              if (this.touchTimeout) {\n                clearTimeout(this.touchTimeout);\n              }\n\n              this.touchTimeout = window.setTimeout(() => {\n                try {\n                  this.processTouchInteraction(endTouch, event.target as Element);\n                } catch (error) {\n                  console.error('ClickTracker: Error processing touch interaction:', error);\n                }\n                this.touchTimeout = null;\n              }, 100);\n            }\n          }\n          break;\n      }\n    } catch (error) {\r\n      console.error('ClickTracker: Error handling touch event:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理触摸交互（模拟点击行为）\r\n   */\r\n  private processTouchInteraction(touch: Touch, element: Element): void {\n    // 如果是SDK内部面板，不进行监控\n    if (isTrackerInternalPanel()) {\n      return;\n    }\r\n\r\n    if (!element) {\r\n      return;\r\n    }\r\n\r\n    const timestamp = Date.now();\n\n    // 异步处理，不阻塞主线程\n    const processTouch = () => {\n      try {\n        const touchEvent = this.eventFactory.create({\n          element,\n          timestamp,\n          position: {\n            x: touch.clientX,\n            y: touch.clientY\n          },\n          interactionType: 'touch',\n          eventName: 'touch-click'\n        });\n        this.eventDispatcher.dispatch(touchEvent);\n      } catch (error) {\n        console.error('ClickTracker: Error processing touch interaction:', error);\n      }\n    };\n\n    this.eventDispatcher.schedule(processTouch, 50);\n  }\n\r\n  /**\r\n   * 处理点击事件\r\n   */\r\n  private handleClick(event: MouseEvent): void {\r\n    // 如果是SDK内部面板，不进行监控\r\n    if (isTrackerInternalPanel()) {\r\n      return;\r\n    }\r\n\r\n    try {\r\n      const target = event.target as Element;\r\n      if (!target) {\r\n        return;\r\n      }\r\n\r\n      const timestamp = Date.now();\n\n      // 使用 requestIdleCallback 或 setTimeout 异步处理，不阻塞主线程\n      // 确保不影响页面正常功能\n      const processClick = () => {\n        try {\n          const clickEvent = this.eventFactory.create({\n            element: target,\n            timestamp,\n            position: {\n              x: event.clientX,\n              y: event.clientY\n            },\n            interactionType: 'mouse',\n            eventName: 'click',\n            nativeEvent: event\n          });\n          this.eventDispatcher.dispatch(clickEvent);\n        } catch (error) {\n          console.error('ClickTracker: Error processing click event:', error);\n        }\n      };\n\n      this.eventDispatcher.schedule(processClick, 100);\n    } catch (error) {\n      console.error('ClickTracker: Error handling click event:', error);\n    }\n  }\n\r\n  /**\r\n   * 获取点击事件\r\n   */\r\n  getClickEvent(event: MouseEvent): ClickEvent | null {\n    try {\n      const target = event.target as Element;\n      if (!target) {\n        return null;\n      }\n\n      return this.eventFactory.create({\n        element: target,\n        timestamp: Date.now(),\n        position: {\n          x: event.clientX,\n          y: event.clientY\n        },\n        interactionType: 'mouse',\n        eventName: 'click',\n        nativeEvent: event\n      });\n    } catch (error) {\n      console.error('ClickTracker: Error creating click event:', error);\n      return null;\n    }\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.clickHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('click', this.clickHandler as EventListener, false);\r\n      this.clickHandler = null;\r\n    }\r\n\r\n    if (this.touchStartHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('touchstart', this.touchStartHandler);\r\n      this.touchStartHandler = null;\r\n    }\r\n\r\n    if (this.touchEndHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('touchend', this.touchEndHandler as EventListener);\r\n      this.touchEndHandler = null;\r\n    }\r\n\r\n    if (this.touchTimeout) {\r\n      clearTimeout(this.touchTimeout);\r\n      this.touchTimeout = null;\r\n    }\r\n\n    this.touchInteractionTracker.reset();\n  }\n}\n\r\nexport default ClickTracker;\r\n\r\n","/**\r\n * 曝光采集器\r\n */\r\nimport type { ExposureEvent } from '@/types';\r\nimport { supportsIntersectionObserver } from '@/core/capabilities';\r\nimport { getElementPath, throttle, isTrackerInternalPanel } from '@/core/utils';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\ninterface ExposureOptions {\r\n  /** 曝光阈值（0-1），元素可见比例达到此值才触发曝光 */\r\n  threshold?: number;\r\n  /** 根元素，默认为viewport */\r\n  root?: Element | null;\r\n  /** 根元素边距 */\r\n  rootMargin?: string;\r\n}\r\n\r\nclass ExposureTracker {\r\n  private observer: IntersectionObserver | null = null;\r\n  private exposedElements: Set<Element> = new Set();\r\n  private options: ExposureOptions;\r\n  private exposureMap: Map<Element, number> = new Map();\r\n  private scrollFallbackHandler: (() => void) | null = null;\r\n  private resizeFallbackHandler: (() => void) | null = null;\r\n  private cachedElements: Element[] = []; // 缓存的曝光元素列表\r\n  private lastCacheUpdate: number = 0; // 上次缓存更新时间\r\n  private readonly CACHE_UPDATE_INTERVAL = 2000; // 缓存更新间隔（2秒）\r\n\r\n  constructor(options: ExposureOptions = {}) {\r\n    this.options = {\r\n      threshold: 0.5,\r\n      root: null,\r\n      rootMargin: '0px',\r\n      ...options\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  init(): void {\r\n    if (typeof window === 'undefined' || !supportsIntersectionObserver()) {\r\n      this.initScrollFallback();\r\n      return;\r\n    }\r\n\r\n    this.observer = new IntersectionObserver(\r\n      throttle((...args: unknown[]) => {\r\n        const entries = args[0] as IntersectionObserverEntry[];\r\n        entries.forEach(entry => {\r\n          this.handleIntersection(entry);\r\n        });\r\n      }, 100),\r\n      {\r\n        threshold: this.options.threshold || 0.5,\r\n        root: this.options.root,\r\n        rootMargin: this.options.rootMargin\r\n      }\r\n    );\r\n\r\n    // 观察所有带有data-track-exposure属性的元素\r\n    this.observeElements();\r\n  }\r\n\r\n  /**\r\n   * 观察元素\r\n   */\r\n  observeElements(): void {\r\n    if (!this.observer || typeof document === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    const elements = document.querySelectorAll('[data-track-exposure]');\r\n    elements.forEach(element => {\r\n      this.observer!.observe(element);\r\n    });\r\n    \r\n    // 更新缓存\r\n    this.cachedElements = Array.from(elements);\r\n    this.lastCacheUpdate = Date.now();\r\n  }\r\n\r\n  /**\r\n   * 手动添加观察元素\r\n   */\r\n  observe(element: Element): void {\r\n    if (!this.observer) {\r\n      return;\r\n    }\r\n    this.observer.observe(element);\r\n    \r\n    // 更新缓存\r\n    if (!this.cachedElements.includes(element)) {\r\n      this.cachedElements.push(element);\r\n      this.lastCacheUpdate = Date.now();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 取消观察元素\r\n   */\r\n  unobserve(element: Element): void {\r\n    if (!this.observer) {\r\n      return;\r\n    }\r\n    this.observer.unobserve(element);\r\n    this.exposedElements.delete(element);\r\n    this.exposureMap.delete(element);\r\n    \r\n    // 更新缓存\r\n    const index = this.cachedElements.indexOf(element);\r\n    if (index > -1) {\r\n      this.cachedElements.splice(index, 1);\r\n      this.lastCacheUpdate = Date.now();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理IntersectionObserver回调\r\n   */\r\n  private handleIntersection(entry: IntersectionObserverEntry): void {\r\n    // 如果是SDK内部面板，不进行监控\r\n    if (isTrackerInternalPanel()) {\r\n      return;\r\n    }\r\n\r\n    const { target, intersectionRatio, isIntersecting } = entry;\r\n\r\n    if (isIntersecting && intersectionRatio >= (this.options.threshold || 0.5)) {\r\n      if (!this.exposedElements.has(target)) {\r\n        this.exposedElements.add(target);\r\n        this.triggerExposure(target);\r\n      }\r\n      this.exposureMap.set(target, Date.now());\r\n    } else if (!isIntersecting) {\r\n      // 元素离开视口，计算曝光时长并上报\r\n      const startTime = this.exposureMap.get(target);\r\n      if (startTime) {\r\n        const duration = Date.now() - startTime;\r\n        this.triggerExposure(target, duration);\r\n        this.exposureMap.delete(target);\r\n        this.exposedElements.delete(target); // 允许元素再次曝光\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 触发曝光事件\r\n   * @param element 曝光元素\r\n   * @param duration 曝光时长（毫秒），可选\r\n   */\r\n  private triggerExposure(element: Element, duration?: number): void {\r\n    try {\r\n      const exposureEvent: ExposureEvent = {\r\n        type: 'exposure',\r\n        name: 'exposure',\r\n        timestamp: Date.now(),\r\n        url: getCurrentUrl(),\r\n        title: getPageTitle(),\r\n        elementPath: getElementPath(element),\r\n        duration // 包含曝光时长\r\n      };\r\n\r\n      // 触发事件\r\n      if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n        (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('exposure', exposureEvent);\r\n      }\r\n    } catch (error) {\r\n      console.error('ExposureTracker: Error triggering exposure event:', error);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取曝光元素列表（带缓存）\r\n   */\r\n  private getExposureElements(): Element[] {\r\n    const now = Date.now();\r\n    \r\n    // 如果缓存过期或为空，更新缓存\r\n    if (this.cachedElements.length === 0 || now - this.lastCacheUpdate > this.CACHE_UPDATE_INTERVAL) {\r\n      if (typeof document !== 'undefined') {\r\n        this.cachedElements = Array.from(document.querySelectorAll('[data-track-exposure]'));\r\n        this.lastCacheUpdate = now;\r\n      }\r\n    }\r\n    \r\n    return this.cachedElements;\r\n  }\r\n\r\n  /**\r\n   * 降级方案：使用scroll事件\r\n   */\r\n  private initScrollFallback(): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    // 初始缓存元素列表\r\n    this.cachedElements = Array.from(document.querySelectorAll('[data-track-exposure]'));\r\n    this.lastCacheUpdate = Date.now();\r\n\r\n    const checkExposure = throttle(() => {\r\n      const elements = this.getExposureElements(); // 使用缓存\r\n      const now = Date.now();\r\n      \r\n      elements.forEach(element => {\r\n        const rect = element.getBoundingClientRect();\r\n        const viewportHeight = window.innerHeight || document.documentElement.clientHeight;\r\n        const viewportWidth = window.innerWidth || document.documentElement.clientWidth;\r\n\r\n        const visibleHeight = Math.min(rect.bottom, viewportHeight) - Math.max(rect.top, 0);\r\n        const visibleWidth = Math.min(rect.right, viewportWidth) - Math.max(rect.left, 0);\r\n        const visibleArea = visibleHeight * visibleWidth;\r\n        const totalArea = rect.height * rect.width;\r\n        const visibleRatio = totalArea > 0 ? visibleArea / totalArea : 0;\r\n\r\n        if (visibleRatio >= (this.options.threshold || 0.5)) {\r\n          // 元素可见\r\n          if (!this.exposedElements.has(element)) {\r\n            // 首次曝光，记录开始时间\r\n            this.exposedElements.add(element);\r\n            this.exposureMap.set(element, now);\r\n            this.triggerExposure(element); // 曝光开始事件\r\n          }\r\n          // 注意：不更新曝光时间，保持首次曝光的时间戳，以便准确计算duration\r\n        } else {\r\n          // 元素不可见\r\n          if (this.exposedElements.has(element)) {\r\n            // 元素离开视口，计算曝光时长\r\n            const startTime = this.exposureMap.get(element);\r\n            if (startTime) {\r\n              const duration = now - startTime;\r\n              this.triggerExposure(element, duration); // 曝光结束事件，包含时长\r\n              this.exposureMap.delete(element);\r\n              this.exposedElements.delete(element); // 允许元素再次曝光\r\n            }\r\n          }\r\n        }\r\n      });\r\n    }, 100);\r\n\r\n    // 保存处理器引用以便清理\r\n    this.scrollFallbackHandler = checkExposure;\r\n    this.resizeFallbackHandler = checkExposure;\r\n\r\n    window.addEventListener('scroll', this.scrollFallbackHandler, { passive: true });\r\n    window.addEventListener('resize', this.resizeFallbackHandler, { passive: true });\r\n    // 初始检查\r\n    setTimeout(checkExposure, 0);\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.observer) {\r\n      this.observer.disconnect();\r\n      this.observer = null;\r\n    }\r\n\r\n    // 清理scroll降级方案的事件监听器\r\n    if (this.scrollFallbackHandler && typeof window !== 'undefined') {\r\n      window.removeEventListener('scroll', this.scrollFallbackHandler);\r\n      this.scrollFallbackHandler = null;\r\n    }\r\n\r\n    if (this.resizeFallbackHandler && typeof window !== 'undefined') {\r\n      window.removeEventListener('resize', this.resizeFallbackHandler);\r\n      this.resizeFallbackHandler = null;\r\n    }\r\n\r\n    this.exposedElements.clear();\r\n    this.exposureMap.clear();\r\n    this.cachedElements = [];\r\n    this.lastCacheUpdate = 0;\r\n  }\r\n}\r\n\r\nexport default ExposureTracker;\r\n\r\n","/**\r\n * 输入事件采集器\r\n */\r\nimport type { InputEvent, TrackerConfig, ComponentInfo } from '@/types';\nimport { getElementPath, getElementInfo, debounce, isTrackerInternalPanel, normalizeClassName } from '@/core/utils';\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\nimport { resolveClickComponentInfo } from '@/extension/frame-adapters/resolve';\n\r\nclass InputTracker {\r\n  private inputHandler: ((event: Event) => void) | null = null;\r\n  private changeHandler: ((event: Event) => void) | null = null;\r\n  private inputDebounceTime: number = 500; // text/textarea 防抖时间\r\n  private selectDebounceTime: number = 300; // select 防抖时间\r\n  private skipEmptyInput: boolean = true; // 默认跳过空输入\r\n  // 敏感字段关键词列表\r\n  private sensitiveKeywords: string[] = ['password', 'pwd', 'secret', 'token', 'key', 'auth', 'credential'];\r\n  private configGetter: (() => TrackerConfig) | null = null;\r\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  init(\r\n    debounceTime?: number, \r\n    skipEmptyInput?: boolean,\r\n    options?: {\r\n      enableVueTracking?: boolean;\r\n      enableNaiveUITracking?: boolean;\r\n      extractComponentProps?: boolean;\r\n      extractComponentValue?: boolean;\r\n      getConfig?: () => TrackerConfig;\r\n    }\r\n  ): void {\r\n    if (typeof window === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    // 如果提供了统一的防抖时间，则同时设置input和select的防抖时间\r\n    if (debounceTime !== undefined) {\r\n      this.inputDebounceTime = debounceTime;\r\n      this.selectDebounceTime = Math.min(debounceTime, 300); // select使用更短的防抖时间，但不超过提供的值\r\n    }\r\n\r\n    if (skipEmptyInput !== undefined) {\r\n      this.skipEmptyInput = skipEmptyInput;\r\n    }\r\n\r\n    // 设置 Vue 追踪选项\r\n    if (options) {\r\n      this.configGetter = options.getConfig ?? null;\r\n    }\r\n\r\n    // 监听 input 事件（实时输入，使用较长的防抖时间）\r\n    this.inputHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as Event;\r\n      this.handleInput(event);\r\n    }, this.inputDebounceTime);\r\n\r\n    // 监听 change 事件（值改变，适用于 select 等，使用较短的防抖时间）\r\n    this.changeHandler = debounce((...args: unknown[]) => {\r\n      const event = args[0] as Event;\r\n      this.handleChange(event);\r\n    }, this.selectDebounceTime);\r\n\r\n    // 使用事件委托，在冒泡阶段监听\r\n    document.addEventListener('input', this.inputHandler as EventListener, false);\r\n    document.addEventListener('change', this.changeHandler as EventListener, false);\r\n  }\r\n\r\n  /**\r\n   * 合并组件信息中的 value 到 input 事件（与原先 Vue/Naive 分支行为一致）\r\n   */\r\n  private mergeComponentValueIntoInput(inputEvent: InputEvent, info: ComponentInfo, isSensitive: boolean): void {\r\n    inputEvent.componentInfo = info;\r\n    if (info.value === undefined || isSensitive) {\r\n      return;\r\n    }\r\n    if (typeof info.value === 'string') {\r\n      if (!info.value.startsWith('[password:') && !info.value.startsWith('[FILTERED]')) {\r\n        inputEvent.value = info.value;\r\n      }\r\n    } else if (typeof info.value === 'number' || typeof info.value === 'boolean') {\r\n      inputEvent.value = String(info.value);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理 input 事件\r\n   */\r\n  private handleInput(event: Event): void {\r\n    // 如果是SDK内部面板，不进行监控\r\n    if (isTrackerInternalPanel()) {\r\n      return;\r\n    }\r\n\r\n    const target = event.target as HTMLInputElement | HTMLTextAreaElement;\r\n    if (!target) {\r\n      return;\r\n    }\r\n\r\n    // 只处理 input、textarea 元素\r\n    const tagName = target.tagName?.toLowerCase();\r\n    if (tagName !== 'input' && tagName !== 'textarea') {\r\n      return;\r\n    }\r\n\r\n    // 立即同步获取 URL 和页面信息\r\n    const url = getCurrentUrl();\r\n    const title = getPageTitle();\r\n    const timestamp = Date.now();\r\n\r\n    // 使用异步处理，不阻塞主线程\r\n    const processInput = () => {\r\n      try {\r\n        const elementPath = getElementPath(target);\r\n        const baseElementInfo = getElementInfo(target);\r\n        \r\n        // 扩展元素信息，包含 input 特有属性\r\n        const elementInfo = {\r\n          ...baseElementInfo,\r\n          name: (target as HTMLInputElement).name || undefined,\r\n          type: (target as HTMLInputElement).type || undefined,\r\n          placeholder: (target as HTMLInputElement).placeholder || undefined\r\n        };\r\n\r\n        // 判断是否为敏感字段\r\n        const isSensitive = this.isSensitiveField(target);\r\n        \r\n        // 获取输入类型\r\n        let inputType: 'text' | 'textarea' | 'select' | 'checkbox' | 'radio' = 'text';\r\n        if (tagName === 'textarea') {\r\n          inputType = 'textarea';\r\n        } else if (tagName === 'input') {\r\n          const type = (target as HTMLInputElement).type?.toLowerCase() || 'text';\r\n          if (type === 'checkbox') {\r\n            inputType = 'checkbox';\r\n          } else if (type === 'radio') {\r\n            inputType = 'radio';\r\n          } else {\r\n            inputType = 'text';\r\n          }\r\n        }\r\n\r\n        // 获取输入值\r\n        let value: string | undefined;\r\n        let valueLength: number | undefined;\r\n        \r\n        if (isSensitive) {\r\n          // 敏感字段：不记录内容，只记录长度\r\n          valueLength = target.value.length;\r\n          value = undefined;\r\n        } else {\r\n          // 非敏感字段：记录内容和长度\r\n          value = target.value;\r\n          valueLength = target.value.length;\r\n        }\r\n\r\n        // 如果配置为跳过空输入，且输入值为空，则不记录\r\n        if (this.skipEmptyInput && valueLength === 0) {\r\n          return;\r\n        }\r\n\r\n        const inputEvent: InputEvent = {\r\n          type: 'input',\r\n          name: 'input',\r\n          timestamp,\r\n          url,\r\n          title,\r\n          elementPath,\r\n          elementInfo,\r\n          inputType,\r\n          value,\r\n          valueLength,\r\n          isSensitive\r\n        };\r\n\r\n        if (this.configGetter) {\r\n          try {\r\n            const info = resolveClickComponentInfo(target, event, this.configGetter);\r\n            if (info) {\r\n              this.mergeComponentValueIntoInput(inputEvent, info, isSensitive);\r\n            }\r\n          } catch (componentError) {\r\n            console.warn('InputTracker: Error extracting component info:', componentError);\r\n          }\r\n        }\r\n\r\n        // 触发事件\r\n        if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n          (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('input', inputEvent);\r\n        }\r\n      } catch (error) {\r\n        console.error('InputTracker: Error processing input event:', error);\r\n      }\r\n    };\r\n\r\n    // 优先使用 requestIdleCallback，否则使用 setTimeout\r\n    if (typeof requestIdleCallback !== 'undefined') {\r\n      requestIdleCallback(processInput, { timeout: 100 });\r\n    } else {\r\n      setTimeout(processInput, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理 change 事件\r\n   */\r\n  private handleChange(event: Event): void {\r\n    // 如果是SDK内部面板，不进行监控\r\n    if (isTrackerInternalPanel()) {\r\n      return;\r\n    }\r\n\r\n    const target = event.target as HTMLInputElement | HTMLSelectElement | HTMLTextAreaElement;\r\n    if (!target) {\r\n      return;\r\n    }\r\n\r\n    // 只处理 select 元素（input 和 textarea 使用 input 事件）\r\n    const tagName = target.tagName?.toLowerCase();\r\n    if (tagName !== 'select') {\r\n      return;\r\n    }\r\n\r\n    // 立即同步获取 URL 和页面信息\r\n    const url = getCurrentUrl();\r\n    const title = getPageTitle();\r\n    const timestamp = Date.now();\r\n\r\n    // 使用异步处理\r\n    const processChange = () => {\r\n      try {\r\n        const elementPath = getElementPath(target);\r\n        const baseElementInfo = getElementInfo(target);\r\n        \r\n        // 扩展元素信息\r\n        const elementInfo = {\r\n          ...baseElementInfo,\r\n          name: (target as HTMLSelectElement).name || undefined\r\n        };\r\n\r\n        // 判断是否为敏感字段\r\n        const isSensitive = this.isSensitiveField(target);\r\n        \r\n        // 获取选中值\r\n        const selectElement = target as HTMLSelectElement;\r\n        let value: string | undefined;\r\n        let valueLength: number | undefined;\r\n        \r\n        if (isSensitive) {\r\n          // 敏感字段：不记录内容\r\n          valueLength = selectElement.value.length;\r\n          value = undefined;\r\n        } else {\r\n          // 非敏感字段：记录内容\r\n          value = selectElement.value;\r\n          valueLength = selectElement.value.length;\r\n        }\r\n\r\n        // select 元素通常都有值，但如果配置为跳过空输入且值为空，则不记录\r\n        if (this.skipEmptyInput && valueLength === 0) {\r\n          return;\r\n        }\r\n\r\n        const inputEvent: InputEvent = {\r\n          type: 'input',\r\n          name: 'input',\r\n          timestamp,\r\n          url,\r\n          title,\r\n          elementPath,\r\n          elementInfo,\r\n          inputType: 'select',\r\n          value,\r\n          valueLength,\r\n          isSensitive\r\n        };\r\n\r\n        if (this.configGetter) {\r\n          try {\r\n            const info = resolveClickComponentInfo(target, event, this.configGetter);\r\n            if (info) {\r\n              this.mergeComponentValueIntoInput(inputEvent, info, isSensitive);\r\n            }\r\n          } catch (componentError) {\r\n            console.warn('InputTracker: Error extracting component info:', componentError);\r\n          }\r\n        }\r\n\r\n        // 触发事件\r\n        if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\r\n          (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('input', inputEvent);\r\n        }\r\n      } catch (error) {\r\n        console.error('InputTracker: Error processing change event:', error);\r\n      }\r\n    };\r\n\r\n    // 优先使用 requestIdleCallback，否则使用 setTimeout\r\n    if (typeof requestIdleCallback !== 'undefined') {\r\n      requestIdleCallback(processChange, { timeout: 100 });\r\n    } else {\r\n      setTimeout(processChange, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 判断是否为敏感字段\r\n   */\r\n  private isSensitiveField(element: HTMLElement): boolean {\r\n    // 检查 type 属性\r\n    if (element instanceof HTMLInputElement) {\r\n      const type = element.type?.toLowerCase();\r\n      if (type === 'password') {\r\n        return true;\r\n      }\r\n    }\r\n\r\n    // 检查 name 属性\r\n    const name = (element as HTMLInputElement).name?.toLowerCase() || '';\r\n    if (name) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (name.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    // 检查 id 属性\r\n    const id = element.id?.toLowerCase() || '';\r\n    if (id) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (id.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    // 检查 className\r\n    const className = normalizeClassName((element as Element & { className?: unknown }).className).toLowerCase();\n    if (className) {\r\n      for (const keyword of this.sensitiveKeywords) {\r\n        if (className.includes(keyword)) {\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (this.inputHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('input', this.inputHandler as EventListener, false);\r\n      this.inputHandler = null;\r\n    }\r\n\r\n    if (this.changeHandler && typeof document !== 'undefined') {\r\n      document.removeEventListener('change', this.changeHandler as EventListener, false);\r\n      this.changeHandler = null;\r\n    }\r\n  }\r\n}\r\n\r\nexport default InputTracker;\r\n\r\n","/**\r\n * 自动埋点管理器\r\n */\r\nimport type { TrackerConfig } from '@/types';\r\nimport ViewTracker from './view-tracker';\r\nimport ClickTracker from './click-tracker';\r\nimport ExposureTracker from './exposure-tracker';\r\nimport InputTracker from './input-tracker';\r\n\r\nclass AutoTracker {\r\n  private viewTracker: ViewTracker;\r\n  private clickTracker: ClickTracker;\r\n  private exposureTracker: ExposureTracker;\r\n  private inputTracker: InputTracker;\r\n  private enabled: boolean = false;\r\n\r\n  constructor() {\r\n    this.viewTracker = new ViewTracker();\r\n    this.clickTracker = new ClickTracker();\r\n    this.exposureTracker = new ExposureTracker();\r\n    this.inputTracker = new InputTracker();\r\n  }\r\n\r\n  /**\r\n   * 初始化自动埋点\r\n   */\r\n  init(options?: { \r\n    enableClick?: boolean; \r\n    enableExposure?: boolean; \r\n    enableInput?: boolean; \r\n    clickDebounceTime?: number; \r\n    inputDebounceTime?: number;\r\n    enableVueTracking?: boolean;\r\n    enableNaiveUITracking?: boolean;\r\n    extractComponentProps?: boolean;\r\n    extractComponentValue?: boolean;\r\n    getConfig?: () => TrackerConfig;\r\n  }): void {\r\n    if (this.enabled) {\r\n      return;\r\n    }\r\n\r\n    const { \r\n      enableClick = true, \r\n      enableExposure = true, \r\n      enableInput = true, \r\n      clickDebounceTime, \r\n      inputDebounceTime,\r\n      enableVueTracking = false,\r\n      enableNaiveUITracking = false,\r\n      extractComponentProps = true,\r\n      extractComponentValue = true,\r\n      getConfig\r\n    } = options || {};\r\n\r\n    // 页面浏览追踪\r\n    this.viewTracker.init();\r\n\r\n    // 点击追踪\r\n    if (enableClick) {\r\n      this.clickTracker.init(clickDebounceTime, {\r\n        enableVueTracking,\r\n        enableNaiveUITracking,\r\n        extractComponentProps,\r\n        extractComponentValue,\r\n        getConfig\r\n      });\r\n    }\r\n\r\n    // 曝光追踪\r\n    if (enableExposure) {\r\n      this.exposureTracker.init();\r\n    }\r\n\r\n    // 输入追踪\r\n    if (enableInput) {\r\n      this.inputTracker.init(inputDebounceTime, undefined, {\r\n        enableVueTracking,\r\n        enableNaiveUITracking,\r\n        extractComponentProps,\r\n        extractComponentValue,\r\n        getConfig\r\n      });\r\n    }\r\n\r\n    this.enabled = true;\r\n  }\r\n\r\n  /**\r\n   * 获取ViewTracker实例\r\n   */\r\n  getViewTracker(): ViewTracker {\r\n    return this.viewTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取ClickTracker实例\r\n   */\r\n  getClickTracker(): ClickTracker {\r\n    return this.clickTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取ExposureTracker实例\r\n   */\r\n  getExposureTracker(): ExposureTracker {\r\n    return this.exposureTracker;\r\n  }\r\n\r\n  /**\r\n   * 获取InputTracker实例\r\n   */\r\n  getInputTracker(): InputTracker {\r\n    return this.inputTracker;\r\n  }\r\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    if (!this.enabled) {\r\n      return;\r\n    }\r\n\r\n    this.viewTracker.destroy();\r\n    this.clickTracker.destroy();\r\n    this.exposureTracker.destroy();\r\n    this.inputTracker.destroy();\r\n\r\n    this.enabled = false;\r\n  }\r\n}\r\n\r\nexport default AutoTracker;\r\n\r\n","/**\n * 错误监控采集器\n */\nimport type { ErrorEvent } from '@/types';\nimport { getCurrentUrl, getPageTitle, isTrackerInternalPanel } from '@/core/utils';\n\nclass ErrorTracker {\n  private handlers: Array<() => void> = [];\n  private errorCache: Map<string, number> = new Map(); // 错误缓存，防止短时间内重复上报\n  private debounceTime: number = 500; // 500ms内相同错误只记录一次\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    if (typeof window === 'undefined') {\n      return;\n    }\n\n    // 统一错误处理函数（避免重复监听）\n    const unifiedErrorHandler = (event: Event) => {\n      // 判断是JavaScript错误还是资源加载错误\n      if (event instanceof ErrorEvent) {\n        // JavaScript错误\n        this.handleJSError(event);\n      } else {\n        // 资源加载错误\n        this.handleResourceError(event);\n      }\n    };\n\n    window.addEventListener('error', unifiedErrorHandler, true);\n    this.handlers.push(() => {\n      window.removeEventListener('error', unifiedErrorHandler, true);\n    });\n\n    // Promise错误\n    const promiseErrorHandler = (event: PromiseRejectionEvent) => {\n      this.handlePromiseError(event);\n    };\n    window.addEventListener('unhandledrejection', promiseErrorHandler);\n    this.handlers.push(() => {\n      window.removeEventListener('unhandledrejection', promiseErrorHandler);\n    });\n  }\n\n  /**\n   * 处理JavaScript错误\n   */\n  private handleJSError(event: globalThis.ErrorEvent): void {\n    try {\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'js-error',\n        timestamp: Date.now(),\n        url: event.filename || getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'js',\n        message: event.message || 'Unknown error',\n        stack: (event.error as Error)?.stack,\n        filename: event.filename,\n        lineno: event.lineno,\n        colno: event.colno\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling JS error:', error);\n    }\n  }\n\n  /**\n   * 处理Promise错误\n   */\n  private handlePromiseError(event: PromiseRejectionEvent): void {\n    // 如果是SDK内部面板，不进行监控\n    if (isTrackerInternalPanel()) {\n      return;\n    }\n\n    try {\n      const reason = event.reason;\n      let message = 'Unhandled promise rejection';\n      let stack: string | undefined;\n\n      if (reason instanceof Error) {\n        message = reason.message;\n        stack = reason.stack;\n      } else if (typeof reason === 'string') {\n        message = reason;\n      } else {\n        message = JSON.stringify(reason);\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'promise-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'promise',\n        message,\n        stack\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling promise error:', error);\n    }\n  }\n\n  /**\n   * 处理资源加载错误\n   */\n  private handleResourceError(event: Event): void {\n    // 如果是SDK内部面板，不进行监控\n    if (isTrackerInternalPanel()) {\n      return;\n    }\n\n    try {\n      const target = event.target as HTMLElement;\n      if (!target) {\n        return;\n      }\n\n      // 判断是否为资源加载错误\n      const tagName = target.tagName?.toLowerCase();\n      if (!['img', 'script', 'link', 'audio', 'video'].includes(tagName)) {\n        return;\n      }\n\n      let resourceUrl = '';\n      if (target instanceof HTMLImageElement) {\n        resourceUrl = target.src || '';\n      } else if (target instanceof HTMLScriptElement) {\n        resourceUrl = target.src || '';\n      } else if (target instanceof HTMLLinkElement) {\n        resourceUrl = target.href || '';\n      } else if (target instanceof HTMLAudioElement || target instanceof HTMLVideoElement) {\n        resourceUrl = target.src || '';\n      }\n\n      if (!resourceUrl) {\n        return;\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'resource-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'resource',\n        message: `Failed to load resource: ${resourceUrl}`,\n        resourceUrl,\n        resourceType: tagName\n      };\n\n      this.emitError(errorEvent);\n    } catch (error) {\n      console.error('ErrorTracker: Error handling resource error:', error);\n    }\n  }\n\n  /**\n   * 获取错误唯一标识\n   */\n  private getErrorKey(errorEvent: ErrorEvent): string {\n    const parts: string[] = [errorEvent.errorType, errorEvent.message];\n    \n    // JS错误和Promise错误：使用 message + filename + lineno\n    if (errorEvent.errorType === 'js' || errorEvent.errorType === 'promise') {\n      if (errorEvent.filename) {\n        parts.push(errorEvent.filename);\n      }\n      if (errorEvent.lineno) {\n        parts.push(String(errorEvent.lineno));\n      }\n      if (errorEvent.colno) {\n        parts.push(String(errorEvent.colno));\n      }\n    }\n    \n    // 资源错误：使用 resourceUrl\n    if (errorEvent.errorType === 'resource' && errorEvent.resourceUrl) {\n      parts.push(errorEvent.resourceUrl);\n    }\n    \n    return parts.join('|');\n  }\n\n  /**\n   * 触发错误事件\n   */\n  private emitError(errorEvent: ErrorEvent): void {\n    // 防抖检查：相同错误在短时间内只记录一次\n    const errorKey = this.getErrorKey(errorEvent);\n    const lastTime = this.errorCache.get(errorKey);\n    const now = Date.now();\n    \n    if (lastTime && now - lastTime < this.debounceTime) {\n      // 短时间内相同错误，忽略\n      return;\n    }\n    \n    // 更新缓存\n    this.errorCache.set(errorKey, now);\n    \n    // 清理过期缓存（超过5分钟）\n    this.cleanExpiredErrorCache(now);\n    \n    // 触发事件\n    if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n      (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('error', errorEvent);\n    }\n  }\n\n  /**\n   * 清理过期的错误缓存\n   */\n  private cleanExpiredErrorCache(now: number): void {\n    const expireTime = 5 * 60 * 1000; // 5分钟\n    for (const [key, time] of this.errorCache.entries()) {\n      if (now - time > expireTime) {\n        this.errorCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 手动上报错误\n   */\n  trackError(error: Error | string, errorInfo?: Record<string, unknown>): void {\n    try {\n      let message: string;\n      let stack: string | undefined;\n\n      if (error instanceof Error) {\n        message = error.message;\n        stack = error.stack;\n      } else {\n        message = error;\n      }\n\n      const errorEvent: ErrorEvent = {\n        type: 'error',\n        name: 'custom-error',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        errorType: 'js',\n        message,\n        stack,\n        properties: errorInfo\n      };\n\n      this.emitError(errorEvent);\n    } catch (e) {\n      console.error('ErrorTracker: Error tracking custom error:', e);\n    }\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    this.handlers.forEach(handler => handler());\n    this.handlers = [];\n    this.errorCache.clear();\n  }\n}\n\nexport default ErrorTracker;\n\n","/**\n * 性能监控采集器\n */\nimport type { PerformanceEvent } from '@/types';\nimport { supportsLongTaskObserver } from '@/core/capabilities';\nimport { getCurrentUrl, getPageTitle, isTrackerInternalPanel } from '@/core/utils';\nimport { throttle } from '@/core/utils';\n\nclass PerformanceTracker {\n  private observer: PerformanceObserver | null = null;\n  private navigationTimingCollected: boolean = false; // 导航性能事件只记录一次\n  private resourceCache: Map<string, number> = new Map(); // 资源性能事件缓存\n  private longTaskCache: Map<string, number> = new Map(); // 长任务事件缓存\n  private resourceDebounceTime: number = 1000; // 资源事件去重时间窗口（1秒）\n  private longTaskDebounceTime: number = 100; // 长任务事件防抖时间（100ms）\n\n  /**\n   * 初始化\n   */\n  init(): void {\n    if (typeof window === 'undefined' || !window.performance) {\n      return;\n    }\n\n    // 页面加载完成后采集性能数据\n    if (document.readyState === 'complete') {\n      this.collectNavigationTiming();\n      this.collectResourceTiming();\n    } else {\n      window.addEventListener('load', () => {\n        this.collectNavigationTiming();\n        this.collectResourceTiming();\n      });\n    }\n\n    // 使用PerformanceObserver监控长任务\n    this.observeLongTasks();\n  }\n\n  /**\n   * 采集Navigation Timing数据\n   */\n  private collectNavigationTiming(): void {\n    // 如果是SDK内部面板，不进行监控\n    if (isTrackerInternalPanel()) {\n      return;\n    }\n\n    // 导航性能事件只记录一次\n    if (this.navigationTimingCollected) {\n      return;\n    }\n\n    try {\n      const timing = performance.getEntriesByType('navigation')[0] as PerformanceNavigationTiming;\n      if (!timing) {\n        return;\n      }\n\n      const metrics: Record<string, number> = {\n        // DNS查询时间\n        dns: timing.domainLookupEnd - timing.domainLookupStart,\n        // TCP连接时间\n        tcp: timing.connectEnd - timing.connectStart,\n        // SSL握手时间\n        ssl: timing.secureConnectionStart > 0 ? timing.connectEnd - timing.secureConnectionStart : 0,\n        // TTFB（首字节时间）\n        ttfb: timing.responseStart - timing.requestStart,\n        // 响应时间\n        response: timing.responseEnd - timing.responseStart,\n        // DOM解析时间\n        domParse: timing.domInteractive - timing.responseEnd,\n        // 资源加载时间\n        resourceLoad: timing.loadEventStart - timing.domContentLoadedEventEnd,\n        // 总加载时间\n        total: timing.loadEventEnd - timing.fetchStart,\n        // DOMContentLoaded时间\n        domContentLoaded: timing.domContentLoadedEventEnd - timing.fetchStart,\n        // Load时间\n        load: timing.loadEventEnd - timing.fetchStart\n      };\n\n      const performanceEvent: PerformanceEvent = {\n        type: 'performance',\n        name: 'navigation-timing',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        metricType: 'navigation',\n        metrics\n      };\n\n      this.navigationTimingCollected = true;\n      this.emitPerformance(performanceEvent);\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting navigation timing:', error);\n    }\n  }\n\n  /**\n   * 采集Resource Timing数据\n   */\n  private collectResourceTiming(): void {\n    try {\n      const resources = performance.getEntriesByType('resource') as PerformanceResourceTiming[];\n      if (!resources || resources.length === 0) {\n        return;\n      }\n\n      const now = Date.now();\n      resources.forEach(resource => {\n        const resourceUrl = resource.name;\n        \n        // 去重检查：相同资源在1秒内只记录一次\n        const lastTime = this.resourceCache.get(resourceUrl);\n        if (lastTime && now - lastTime < this.resourceDebounceTime) {\n          return;\n        }\n        \n        // 更新缓存\n        this.resourceCache.set(resourceUrl, now);\n        \n        const metrics: Record<string, number> = {\n          // DNS查询时间\n          dns: resource.domainLookupEnd - resource.domainLookupStart,\n          // TCP连接时间\n          tcp: resource.connectEnd - resource.connectStart,\n          // 请求时间\n          request: resource.responseStart - resource.requestStart,\n          // 响应时间\n          response: resource.responseEnd - resource.responseStart,\n          // 总时间\n          total: resource.responseEnd - resource.startTime,\n          // 资源大小\n          size: (resource as PerformanceResourceTiming & { transferSize?: number }).transferSize || 0\n        };\n\n        const performanceEvent: PerformanceEvent = {\n          type: 'performance',\n          name: 'resource-timing',\n          timestamp: now,\n          url: getCurrentUrl(),\n          title: getPageTitle(),\n          metricType: 'resource',\n          metrics: {\n            ...metrics,\n            resourceUrl: resource.name,\n            resourceType: resource.initiatorType\n          } as unknown as Record<string, number>\n        };\n\n        this.emitPerformance(performanceEvent);\n      });\n      \n      // 清理过期缓存（超过5分钟）\n      this.cleanExpiredResourceCache(now);\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting resource timing:', error);\n    }\n  }\n\n  /**\n   * 监控长任务\n   */\n  private observeLongTasks(): void {\n    if (typeof PerformanceObserver === 'undefined' || !supportsLongTaskObserver()) {\n      return;\n    }\n\n    try {\n      // 使用节流函数限制长任务事件的触发频率\n      const throttledEmitLongTask = throttle((...args: unknown[]) => {\n        const entry = args[0] as PerformanceEntry;\n        const now = Date.now();\n        // 使用 startTime 和 duration 作为唯一标识\n        const taskKey = `${entry.startTime}-${entry.duration}`;\n        \n        // 去重检查：相同长任务在100ms内只记录一次\n        const lastTime = this.longTaskCache.get(taskKey);\n        if (lastTime && now - lastTime < this.longTaskDebounceTime) {\n          return;\n        }\n        \n        // 更新缓存\n        this.longTaskCache.set(taskKey, now);\n        \n        const performanceEvent: PerformanceEvent = {\n          type: 'performance',\n          name: 'longtask',\n          timestamp: now,\n          url: getCurrentUrl(),\n          title: getPageTitle(),\n          metricType: 'longtask',\n          metrics: {\n            duration: entry.duration,\n            startTime: entry.startTime\n          }\n        };\n\n        this.emitPerformance(performanceEvent);\n        \n        // 清理过期缓存（超过1分钟）\n        this.cleanExpiredLongTaskCache(now);\n      }, this.longTaskDebounceTime);\n\n      this.observer = new PerformanceObserver(list => {\n        list.getEntries().forEach(entry => {\n          if (entry.entryType === 'longtask') {\n            throttledEmitLongTask(entry);\n          }\n        });\n      });\n\n      this.observer.observe({ entryTypes: ['longtask'] });\n    } catch (error) {\n      console.error('PerformanceTracker: Error observing long tasks:', error);\n    }\n  }\n\n  /**\n   * 清理过期的资源缓存\n   */\n  private cleanExpiredResourceCache(now: number): void {\n    const expireTime = 5 * 60 * 1000; // 5分钟\n    for (const [key, time] of this.resourceCache.entries()) {\n      if (now - time > expireTime) {\n        this.resourceCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 清理过期的长任务缓存\n   */\n  private cleanExpiredLongTaskCache(now: number): void {\n    const expireTime = 60 * 1000; // 1分钟\n    for (const [key, time] of this.longTaskCache.entries()) {\n      if (now - time > expireTime) {\n        this.longTaskCache.delete(key);\n      }\n    }\n  }\n\n  /**\n   * 触发性能事件\n   */\n  private emitPerformance(performanceEvent: PerformanceEvent): void {\n    // 触发事件\n    if (typeof window !== 'undefined' && (window as unknown as { __trackerEventBus?: { emit: (event: string, data: unknown) => void } }).__trackerEventBus) {\n      (window as unknown as { __trackerEventBus: { emit: (event: string, data: unknown) => void } }).__trackerEventBus.emit('performance', performanceEvent);\n    }\n  }\n\n  /**\n   * 手动采集性能指标\n   */\n  collectMetrics(): PerformanceEvent | null {\n    try {\n      const timing = performance.getEntriesByType('navigation')[0] as PerformanceNavigationTiming;\n      if (!timing) {\n        return null;\n      }\n\n      const metrics: Record<string, number> = {\n        dns: timing.domainLookupEnd - timing.domainLookupStart,\n        tcp: timing.connectEnd - timing.connectStart,\n        ttfb: timing.responseStart - timing.requestStart,\n        response: timing.responseEnd - timing.responseStart,\n        domParse: timing.domInteractive - timing.responseEnd,\n        resourceLoad: timing.loadEventStart - timing.domContentLoadedEventEnd,\n        total: timing.loadEventEnd - timing.fetchStart\n      };\n\n      return {\n        type: 'performance',\n        name: 'custom-performance',\n        timestamp: Date.now(),\n        url: getCurrentUrl(),\n        title: getPageTitle(),\n        metricType: 'navigation',\n        metrics\n      };\n    } catch (error) {\n      console.error('PerformanceTracker: Error collecting metrics:', error);\n      return null;\n    }\n  }\n\n  /**\n   * 销毁\n   */\n  destroy(): void {\n    if (this.observer) {\n      this.observer.disconnect();\n      this.observer = null;\n    }\n    this.navigationTimingCollected = false;\n    this.resourceCache.clear();\n    this.longTaskCache.clear();\n  }\n}\n\nexport default PerformanceTracker;\n\n","import type { DOMSnapshot, UserInteraction } from './session-replay';\n\n/** 单条 MutationRecord 的启发式字节权重（非精确序列化体积，用于预算与防失控） */\nexport const MUTATION_RECORD_BYTES_HEURISTIC = 384;\n\ninterface SessionReplayBudgetData {\n  snapshots: DOMSnapshot[];\n  interactions: UserInteraction[];\n}\n\nclass SessionReplayBudget {\n  private maxTotalBytes: number;\n  private stoppedByBudget: boolean = false;\n\n  constructor(maxTotalBytes: number = Number.POSITIVE_INFINITY) {\n    this.maxTotalBytes = maxTotalBytes;\n  }\n\n  getStoppedByBudget(): boolean {\n    return this.stoppedByBudget;\n  }\n\n  setStoppedByBudget(stopped: boolean): void {\n    this.stoppedByBudget = stopped;\n  }\n\n  estimateTotalBytes(data: SessionReplayBudgetData): number {\n    let totalBytes = 0;\n\n    for (const snapshot of data.snapshots) {\n      totalBytes += snapshot.html.length + 64;\n      totalBytes += snapshot.mutations.length * MUTATION_RECORD_BYTES_HEURISTIC;\n    }\n\n    for (const interaction of data.interactions) {\n      totalBytes += this.estimateInteractionBytes(interaction);\n    }\n\n    return totalBytes;\n  }\n\n  allowsWrite(data: SessionReplayBudgetData, extraBytes: number): boolean {\n    if (this.stoppedByBudget) {\n      return false;\n    }\n\n    if (this.maxTotalBytes === Number.POSITIVE_INFINITY) {\n      return true;\n    }\n\n    if (this.estimateTotalBytes(data) + extraBytes > this.maxTotalBytes) {\n      this.stoppedByBudget = true;\n      return false;\n    }\n\n    return true;\n  }\n\n  estimateInteractionBytes(interaction: UserInteraction): number {\n    try {\n      return JSON.stringify(interaction).length;\n    } catch {\n      return 128;\n    }\n  }\n}\n\nexport default SessionReplayBudget;\n","import { throttle } from '@/core/utils';\n\ntype SessionReplayInteractionType = 'click' | 'input' | 'scroll' | 'mousemove';\n\ninterface SessionReplayInteraction {\n  type: SessionReplayInteractionType;\n  timestamp: number;\n  data: Record<string, unknown>;\n}\n\ninterface SessionReplayInteractionLifecycleOptions {\n  recordMouseMove: boolean;\n  onInteraction: (interaction: SessionReplayInteraction) => void;\n}\n\nclass SessionReplayInteractionLifecycle {\n  private throttledMouseMoveHandler: EventListener | null = null;\n\n  constructor(private readonly options: SessionReplayInteractionLifecycleOptions) {}\n\n  start(): void {\n    if (typeof window === 'undefined' || typeof document === 'undefined') {\n      return;\n    }\n\n    document.addEventListener('click', this.handleClick, true);\n    document.addEventListener('input', this.handleInput, true);\n    window.addEventListener('scroll', this.handleScroll, { passive: true });\n\n    if (this.options.recordMouseMove) {\n      this.throttledMouseMoveHandler = throttle((...args: unknown[]) => {\n        const event = args[0] as MouseEvent;\n        this.handleMouseMove(event);\n      }, 100) as EventListener;\n      document.addEventListener('mousemove', this.throttledMouseMoveHandler, { passive: true });\n    }\n  }\n\n  stop(): void {\n    if (typeof document === 'undefined') {\n      return;\n    }\n\n    document.removeEventListener('click', this.handleClick, true);\n    document.removeEventListener('input', this.handleInput, true);\n    window.removeEventListener('scroll', this.handleScroll, { passive: true } as AddEventListenerOptions);\n\n    if (this.throttledMouseMoveHandler) {\n      document.removeEventListener('mousemove', this.throttledMouseMoveHandler, { passive: true } as AddEventListenerOptions);\n      this.throttledMouseMoveHandler = null;\n    }\n  }\n\n  private handleClick = (event: MouseEvent): void => {\n    this.options.onInteraction({\n      type: 'click',\n      timestamp: Date.now(),\n      data: {\n        x: event.clientX,\n        y: event.clientY,\n        target: (event.target as Element | null)?.tagName\n      }\n    });\n  };\n\n  private handleInput = (event: Event): void => {\n    const target = event.target as HTMLInputElement | HTMLTextAreaElement | null;\n    if (!target) {\n      return;\n    }\n\n    this.options.onInteraction({\n      type: 'input',\n      timestamp: Date.now(),\n      data: {\n        tagName: target.tagName,\n        value: target.value.substring(0, 100)\n      }\n    });\n  };\n\n  private handleScroll = (): void => {\n    this.options.onInteraction({\n      type: 'scroll',\n      timestamp: Date.now(),\n      data: {\n        scrollX: window.scrollX,\n        scrollY: window.scrollY\n      }\n    });\n  };\n\n  private handleMouseMove = (event: MouseEvent): void => {\n    this.options.onInteraction({\n      type: 'mousemove',\n      timestamp: Date.now(),\n      data: {\n        x: event.clientX,\n        y: event.clientY\n      }\n    });\n  };\n}\n\nexport default SessionReplayInteractionLifecycle;\n","import type { DOMSnapshot, UserInteraction } from './session-replay';\n\nclass SessionReplayStore {\n  private snapshots: DOMSnapshot[] = [];\n  private interactions: UserInteraction[] = [];\n\n  constructor(\n    private readonly maxSnapshots: number,\n    private readonly maxMutationRecordsPerSnapshot: number\n  ) {}\n\n  getSnapshots(): DOMSnapshot[] {\n    return this.snapshots;\n  }\n\n  setSnapshots(snapshots: DOMSnapshot[]): void {\n    this.snapshots = snapshots;\n  }\n\n  getInteractions(): UserInteraction[] {\n    return this.interactions;\n  }\n\n  setInteractions(interactions: UserInteraction[]): void {\n    this.interactions = interactions;\n  }\n\n  createSnapshot(html: string, timestamp: number): void {\n    if (this.snapshots.length >= this.maxSnapshots) {\n      this.snapshots.shift();\n    }\n\n    this.snapshots.push({\n      timestamp,\n      html,\n      mutations: []\n    });\n  }\n\n  hasSnapshots(): boolean {\n    return this.snapshots.length > 0;\n  }\n\n  planMutationsForLatestSnapshot(mutations: MutationRecord[]): MutationRecord[] {\n    const lastSnapshot = this.snapshots[this.snapshots.length - 1];\n\n    if (!lastSnapshot || mutations.length === 0) {\n      return [];\n    }\n\n    let toAppend = mutations;\n    const nextSize = lastSnapshot.mutations.length + toAppend.length;\n\n    if (nextSize > this.maxMutationRecordsPerSnapshot) {\n      const excess = nextSize - this.maxMutationRecordsPerSnapshot;\n\n      if (excess <= lastSnapshot.mutations.length) {\n        lastSnapshot.mutations.splice(0, excess);\n      } else {\n        const dropFromNew = excess - lastSnapshot.mutations.length;\n        lastSnapshot.mutations.length = 0;\n        toAppend = mutations.slice(dropFromNew);\n      }\n    }\n\n    return toAppend;\n  }\n\n  appendMutationsToLatestSnapshot(mutations: MutationRecord[]): void {\n    if (mutations.length === 0) {\n      return;\n    }\n\n    const lastSnapshot = this.snapshots[this.snapshots.length - 1];\n    if (!lastSnapshot) {\n      return;\n    }\n\n    lastSnapshot.mutations.push(...mutations);\n  }\n\n  appendInteraction(interaction: UserInteraction): void {\n    if (this.interactions.length >= this.maxSnapshots) {\n      this.interactions.shift();\n    }\n\n    this.interactions.push(interaction);\n  }\n\n  getData(): { snapshots: DOMSnapshot[]; interactions: UserInteraction[] } {\n    return {\n      snapshots: [...this.snapshots],\n      interactions: [...this.interactions]\n    };\n  }\n\n  clear(): void {\n    this.snapshots = [];\n    this.interactions = [];\n  }\n}\n\nexport default SessionReplayStore;\n","/**\n * 会话回放\n */\nimport type { SessionReplayOptions } from '@/types';\nimport { throttle } from '@/core/utils';\nimport SessionReplayBudget, { MUTATION_RECORD_BYTES_HEURISTIC } from './session-replay-budget';\nimport SessionReplayInteractionLifecycle from './session-replay-interaction-lifecycle';\nimport SessionReplayStore from './session-replay-store';\n\n/** 单条快照内最多保留的 mutation 条数（防极端 DOM 抖动） */\nconst DEFAULT_MAX_MUTATION_RECORDS_PER_SNAPSHOT = 8000;\n\r\nexport interface DOMSnapshot {\r\n  timestamp: number;\r\n  html: string;\r\n  mutations: MutationRecord[];\r\n}\r\n\r\nexport interface UserInteraction {\r\n  type: 'click' | 'input' | 'scroll' | 'mousemove';\r\n  timestamp: number;\r\n  data: Record<string, unknown>;\r\n}\r\n\r\nclass SessionReplay {\n  private observer: MutationObserver | null = null;\n  private isRecording: boolean = false;\n  private mutationThrottleMs: number = 100;\n  private readonly store: SessionReplayStore;\n  private readonly budget: SessionReplayBudget;\n  private readonly interactionLifecycle: SessionReplayInteractionLifecycle;\n\n  constructor(options: SessionReplayOptions = {}) {\n    const recordMouseMove = options.recordMouseMove ?? true;\n    this.mutationThrottleMs = options.snapshotThrottleMs ?? 100;\n    const maxSnapshots = options.maxSnapshots ?? 1000;\n    const maxTotalBytes = options.maxTotalBytes !== undefined && options.maxTotalBytes > 0\n      ? options.maxTotalBytes\n      : Number.POSITIVE_INFINITY;\n    const maxMutationRecordsPerSnapshot =\n      options.maxMutationRecordsPerSnapshot !== undefined && options.maxMutationRecordsPerSnapshot > 0\n        ? options.maxMutationRecordsPerSnapshot\n        : DEFAULT_MAX_MUTATION_RECORDS_PER_SNAPSHOT;\n\n    this.store = new SessionReplayStore(maxSnapshots, maxMutationRecordsPerSnapshot);\n    this.budget = new SessionReplayBudget(maxTotalBytes);\n    this.interactionLifecycle = new SessionReplayInteractionLifecycle({\n      recordMouseMove,\n      onInteraction: interaction => {\n        this.recordInteraction(interaction);\n      }\n    });\n  }\n\n  private get snapshots(): DOMSnapshot[] {\n    return this.store.getSnapshots();\n  }\n\n  private set snapshots(snapshots: DOMSnapshot[]) {\n    this.store.setSnapshots(snapshots);\n  }\n\n  private get interactions(): UserInteraction[] {\n    return this.store.getInteractions();\n  }\n\n  private set interactions(interactions: UserInteraction[]) {\n    this.store.setInteractions(interactions);\n  }\n\n  private get stoppedByBudget(): boolean {\n    return this.budget.getStoppedByBudget();\n  }\n\n  private set stoppedByBudget(stoppedByBudget: boolean) {\n    this.budget.setStoppedByBudget(stoppedByBudget);\n  }\n\n  /**\n   * 是否仍允许写入（未超总字节预算）\n   */\n  private withinByteBudget(extraBytes: number): boolean {\n    return this.budget.allowsWrite({\n      snapshots: this.snapshots,\n      interactions: this.interactions\n    }, extraBytes);\n  }\n\r\n  /**\r\n   * 开始录制\r\n   */\r\n  start(): void {\r\n    if (this.isRecording || typeof document === 'undefined') {\r\n      return;\r\n    }\r\n\r\n    this.isRecording = true;\r\n\r\n    // 初始快照\r\n    this.takeSnapshot();\r\n\r\n    // 创建节流的 mutation 处理器\r\n    const mutationHandler = throttle((...args: unknown[]) => {\n      const mutations = args[0] as MutationRecord[];\n      this.recordMutations(mutations);\n    }, this.mutationThrottleMs);\n\r\n    // 监听DOM变化（兼容缺失 MutationObserver 的环境）\n    if (typeof MutationObserver !== 'function') {\n      this.interactionLifecycle.start();\n      return;\n    }\n\r\n    this.observer = new MutationObserver(mutationHandler);\n\r\n    this.observer.observe(document.body, {\r\n      childList: true,\r\n      subtree: true,\r\n      attributes: true,\r\n      attributeOldValue: true,\r\n      characterData: true\r\n    });\r\n\r\n    // 监听用户交互\r\n    this.interactionLifecycle.start();\n  }\r\n\r\n  /**\r\n   * 停止录制\r\n   */\r\n  stop(): void {\r\n    if (!this.isRecording) {\r\n      return;\r\n    }\r\n\r\n    this.isRecording = false;\r\n\r\n    if (this.observer) {\r\n      this.observer.disconnect();\r\n      this.observer = null;\r\n    }\r\n\r\n    this.interactionLifecycle.stop();\n  }\r\n\r\n  /**\r\n   * 拍摄快照\r\n   */\r\n  private takeSnapshot(): void {\r\n    try {\r\n      const html = document.documentElement.outerHTML;\n      if (!this.withinByteBudget(html.length)) {\n        return;\n      }\n      this.store.createSnapshot(html, Date.now());\n    } catch (error) {\n      console.error('SessionReplay: Error taking snapshot:', error);\n    }\n  }\r\n\r\n  /**\r\n   * 记录DOM变化\r\n   */\r\n  private recordMutations(mutations: MutationRecord[]): void {\r\n    if (this.stoppedByBudget || !this.store.hasSnapshots() || mutations.length === 0) {\n      return;\n    }\n\n    const toAppend = this.store.planMutationsForLatestSnapshot(mutations);\n\n    if (toAppend.length === 0) {\n      return;\n    }\r\n\r\n    const approxBatch = toAppend.length * MUTATION_RECORD_BYTES_HEURISTIC;\r\n    if (!this.withinByteBudget(approxBatch)) {\n      return;\n    }\n\n    this.store.appendMutationsToLatestSnapshot(toAppend);\n  }\r\n\r\n  /**\n   * 记录交互\n   */\n  private recordInteraction(interaction: UserInteraction): void {\n    const extra = this.budget.estimateInteractionBytes(interaction);\n    if (!this.withinByteBudget(extra)) {\n      return;\n    }\n    this.store.appendInteraction(interaction);\n  }\n\r\n  /**\r\n   * 获取录制数据\r\n   */\r\n  getData(): {\n    snapshots: DOMSnapshot[];\n    interactions: UserInteraction[];\n  } {\n    return {\n      snapshots: [...this.snapshots],\n      interactions: [...this.interactions]\n    };\n  }\n\r\n  /**\r\n   * 清空录制数据\r\n   */\r\n  clear(): void {\n    this.snapshots = [];\n    this.interactions = [];\n  }\n\r\n  /**\r\n   * 销毁\r\n   */\r\n  destroy(): void {\r\n    this.stop();\r\n    this.clear();\r\n  }\r\n}\r\n\r\nexport default SessionReplay;\r\n\r\n","import type { TrackerConfig } from '@/types';\nimport AutoTracker from '@/collector/auto-tracker';\nimport ErrorTracker from '@/collector/error-tracker';\nimport PerformanceTracker from '@/collector/performance-tracker';\nimport SessionReplay from '@/extension/session-replay';\n\ninterface ConfigReader {\n  get<K extends keyof TrackerConfig>(key: K): TrackerConfig[K];\n  getAll(): TrackerConfig;\n}\n\nclass TrackerFeatureRegistry {\n  private autoTracker: AutoTracker | null = null;\n  private errorTracker: ErrorTracker | null = null;\n  private performanceTracker: PerformanceTracker | null = null;\n  private sessionReplay: SessionReplay | null = null;\n\n  constructor(private readonly config: ConfigReader) {}\n\n  init(): void {\n    if (this.config.get('enableAutoTrack') && !this.autoTracker) {\n      this.autoTracker = new AutoTracker();\n      this.autoTracker.init({\n        enableVueTracking: this.config.get('enableVueTracking') ?? false,\n        enableNaiveUITracking: this.config.get('enableNaiveUITracking') ?? false,\n        extractComponentProps: this.config.get('extractComponentProps') ?? true,\n        extractComponentValue: this.config.get('extractComponentValue') ?? true,\n        getConfig: () => this.config.getAll()\n      });\n    }\n\n    if (this.config.get('enableErrorTrack') && !this.errorTracker) {\n      this.errorTracker = new ErrorTracker();\n      this.errorTracker.init();\n    }\n\n    if (this.config.get('enablePerformanceTrack') && !this.performanceTracker) {\n      this.performanceTracker = new PerformanceTracker();\n      this.performanceTracker.init();\n    }\n\n    if (this.config.get('enableSessionReplay') && !this.sessionReplay) {\n      const sessionReplayOptions = this.config.get('sessionReplay') || {};\n      const maxSessionReplaySnapshots = this.config.get('maxSessionReplaySnapshots');\n\n      this.sessionReplay = new SessionReplay({\n        ...sessionReplayOptions,\n        maxSnapshots:\n          sessionReplayOptions.maxSnapshots ?? maxSessionReplaySnapshots\n      });\n      this.sessionReplay.start();\n    }\n  }\n\n  getAutoTracker(): AutoTracker | null {\n    return this.autoTracker;\n  }\n\n  getErrorTracker(): ErrorTracker | null {\n    return this.errorTracker;\n  }\n\n  getPerformanceTracker(): PerformanceTracker | null {\n    return this.performanceTracker;\n  }\n\n  getSessionReplay(): SessionReplay | null {\n    return this.sessionReplay;\n  }\n\n  destroy(): void {\n    this.autoTracker?.destroy();\n    this.errorTracker?.destroy();\n    this.performanceTracker?.destroy();\n    this.sessionReplay?.destroy();\n  }\n}\n\nexport default TrackerFeatureRegistry;\n","import type { TrackerEvent } from '@/types';\nimport type TrackerEventEnricher from '@/runtime/tracker-event-enricher';\nimport type DataProcessor from '@/processor/data-processor';\nimport type BatchSender from '@/transport/batch-sender';\nimport type BehaviorAnalysis from '@/extension/behavior-analysis';\n\ninterface DispatchContext {\n  deviceId: string;\n  sessionId: string;\n  configUserId?: string;\n  userInfo?: { userId?: string } | null;\n  customProperties?: Record<string, unknown>;\n  sampleRate?: number;\n  enableCompression?: boolean;\n  beforeSend?: (event: TrackerEvent) => TrackerEvent | null | false;\n  afterSend?: (event: TrackerEvent, success: boolean) => void;\n  onError?: (error: Error) => void;\n}\n\nclass TrackerEventDispatcher {\n  constructor(\n    private readonly enricher: TrackerEventEnricher,\n    private readonly dataProcessor: DataProcessor,\n    private readonly batchSender: BatchSender,\n    private readonly behaviorAnalysis: BehaviorAnalysis,\n    private readonly shouldSkip: () => boolean\n  ) {}\n\n  dispatch(event: TrackerEvent, context: DispatchContext): void {\n    if (this.shouldSkip()) {\n      return;\n    }\n\n    try {\n      const enrichedEvent = this.enricher.enrich(event, {\n        deviceId: context.deviceId,\n        sessionId: context.sessionId,\n        configUserId: context.configUserId,\n        userInfo: context.userInfo,\n        customProperties: context.customProperties\n      });\n\n      const processedEvent = this.dataProcessor.process(enrichedEvent, {\n        sampleRate: context.sampleRate,\n        enableDeduplication: true,\n        enableCompression: context.enableCompression ?? false,\n        isCritical: event.type === 'error'\n      });\n\n      if (!processedEvent) {\n        return;\n      }\n\n      if (context.beforeSend) {\n        const result = context.beforeSend(processedEvent);\n        if (result === false || result === null) {\n          return;\n        }\n        if (result) {\n          Object.assign(processedEvent, result);\n        }\n      }\n\n      this.batchSender.add(processedEvent, {\n        onBatchComplete: (events: TrackerEvent[], success: boolean) => {\n          if (!context.afterSend) {\n            return;\n          }\n\n          events.forEach(event => {\n            setTimeout(() => {\n              context.afterSend?.(event, success);\n            }, 0);\n          });\n        }\n      });\n\n      if (event.type === 'pageview') {\n        this.behaviorAnalysis.analyzePageView(processedEvent as typeof processedEvent & { type: 'pageview' });\n      }\n    } catch (error) {\n      if (context.onError) {\n        context.onError(error as Error);\n      } else {\n        console.error('Tracker: Error sending event:', error);\n      }\n    }\n  }\n}\n\nexport default TrackerEventDispatcher;\n","/**\r\n * 网络请求拦截插件\r\n * 自动拦截所有 fetch 和 XMLHttpRequest 请求，记录请求和响应信息\r\n */\r\nimport type { TrackerPlugin, TrackerInstance, CustomEvent } from '@/types';\r\nimport { getCurrentUrl, getPageTitle } from '@/core/utils';\r\n\r\n/**\r\n * 网络拦截器配置选项\r\n */\r\nexport interface NetworkInterceptorOptions {\r\n  /** 是否启用插件（默认 true） */\r\n  enabled?: boolean;\r\n  /** 是否记录请求体（默认 true） */\r\n  recordRequestBody?: boolean;\r\n  /** 是否记录响应体（默认 true） */\r\n  recordResponseBody?: boolean;\r\n  /** 最大响应体大小（字节，默认 100KB） */\r\n  maxResponseBodySize?: number;\r\n  /** 最大请求体大小（字节，默认 100KB） */\r\n  maxRequestBodySize?: number;\r\n  /** URL 过滤规则（支持字符串、正则表达式、函数） */\r\n  urlFilter?: string | RegExp | ((url: string) => boolean);\r\n  /** 是否只记录失败的请求（默认 false，记录所有请求） */\r\n  onlyFailedRequests?: boolean;\r\n  /** 敏感字段过滤（不记录这些字段的值） */\r\n  sensitiveFields?: string[];\r\n}\r\n\r\n/**\r\n * 默认配置\r\n */\r\nconst DEFAULT_OPTIONS: Required<Omit<NetworkInterceptorOptions, 'urlFilter' | 'sensitiveFields'>> & {\r\n  urlFilter?: NetworkInterceptorOptions['urlFilter'];\r\n  sensitiveFields?: string[];\r\n} = {\r\n  enabled: true,\r\n  recordRequestBody: true,\r\n  recordResponseBody: true,\r\n  maxResponseBodySize: 100 * 1024, // 100KB\r\n  maxRequestBodySize: 100 * 1024, // 100KB\r\n  onlyFailedRequests: false\r\n};\r\n\r\n/**\r\n * 检查URL是否应该被记录\r\n */\r\nfunction shouldRecordUrl(url: string, filter?: NetworkInterceptorOptions['urlFilter']): boolean {\r\n  if (!filter) {\r\n    return true;\r\n  }\r\n\r\n  if (typeof filter === 'string') {\r\n    return url.includes(filter);\r\n  }\r\n\r\n  if (filter instanceof RegExp) {\r\n    return filter.test(url);\r\n  }\r\n\r\n  if (typeof filter === 'function') {\r\n    return filter(url);\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\n/**\r\n * 过滤敏感字段\r\n */\r\nfunction filterSensitiveFields(data: unknown, sensitiveFields: string[]): unknown {\r\n  if (!data || typeof data !== 'object' || sensitiveFields.length === 0) {\r\n    return data;\r\n  }\r\n\r\n  if (Array.isArray(data)) {\r\n    return data.map(item => filterSensitiveFields(item, sensitiveFields));\r\n  }\r\n\r\n  const filtered: Record<string, unknown> = {};\r\n  for (const [key, value] of Object.entries(data as Record<string, unknown>)) {\r\n    const lowerKey = key.toLowerCase();\r\n    const isSensitive = sensitiveFields.some(field => lowerKey.includes(field.toLowerCase()));\r\n\r\n    if (isSensitive) {\r\n      filtered[key] = '[FILTERED]';\r\n    } else if (typeof value === 'object' && value !== null) {\r\n      filtered[key] = filterSensitiveFields(value, sensitiveFields);\r\n    } else {\r\n      filtered[key] = value;\r\n    }\r\n  }\r\n\r\n  return filtered;\r\n}\r\n\r\n/**\r\n * 读取请求体\r\n */\r\nasync function readRequestBody(\r\n  body: BodyInit | null | undefined,\r\n  maxSize: number,\r\n  recordBody: boolean\r\n): Promise<unknown> {\r\n  if (!body || !recordBody) {\r\n    return undefined;\r\n  }\r\n\r\n  try {\r\n    if (typeof body === 'string') {\r\n      if (body.length > maxSize) {\r\n        return body.substring(0, maxSize) + '...[TRUNCATED]';\r\n      }\r\n      return body;\r\n    }\r\n\r\n    if (body instanceof FormData) {\r\n      const formData: Record<string, unknown> = {};\r\n      for (const [key, value] of body.entries()) {\r\n        if (value instanceof File) {\r\n          formData[key] = `[File: ${value.name}, ${value.size} bytes]`;\r\n        } else {\r\n          formData[key] = value;\r\n        }\r\n      }\r\n      return formData;\r\n    }\r\n\r\n    if (body instanceof URLSearchParams) {\r\n      return Object.fromEntries(body.entries());\r\n    }\r\n\r\n    if (body instanceof Blob) {\r\n      if (body.size > maxSize) {\r\n        return `[Blob: ${body.size} bytes, type: ${body.type}]`;\r\n      }\r\n      // Blob.text() 不会修改原始 Blob，可以安全读取\r\n      try {\r\n        return await body.text();\r\n      } catch {\r\n        return `[Blob: ${body.size} bytes, type: ${body.type}]`;\r\n      }\r\n    }\r\n\r\n    if (body instanceof ArrayBuffer) {\r\n      if (body.byteLength > maxSize) {\r\n        return `[ArrayBuffer: ${body.byteLength} bytes]`;\r\n      }\r\n      return new TextDecoder().decode(body);\r\n    }\r\n\r\n    // 其他类型（如 ReadableStream）不读取\r\n    return '[Unsupported body type]';\r\n  } catch (error) {\r\n    console.warn('NetworkInterceptor: Failed to read request body:', error);\r\n    return '[Error reading body]';\r\n  }\r\n}\r\n\r\n/**\r\n * 读取响应体\r\n */\r\nasync function readResponseBody(\r\n  response: Response | XMLHttpRequest,\r\n  maxSize: number,\r\n  recordBody: boolean\r\n): Promise<unknown> {\r\n  if (!recordBody) {\r\n    return undefined;\r\n  }\r\n\r\n  try {\r\n    if (response instanceof Response) {\r\n      // 检查 Content-Length\r\n      const contentLength = response.headers.get('content-length');\r\n      if (contentLength && parseInt(contentLength, 10) > maxSize) {\r\n        return `[Response too large: ${contentLength} bytes]`;\r\n      }\r\n\r\n      // Clone 响应以便读取（响应体只能读取一次）\r\n      // 注意：如果响应体已经被读取过，clone() 会失败\r\n      let clonedResponse: Response;\r\n      try {\r\n        clonedResponse = response.clone();\r\n      } catch (error) {\r\n        // 如果 clone 失败（响应体已被读取），只返回基本信息\r\n        return '[Response body already consumed]';\r\n      }\r\n\r\n      const contentType = response.headers.get('content-type') || '';\r\n\r\n      if (contentType.includes('application/json')) {\r\n        const text = await clonedResponse.text();\r\n        if (text.length > maxSize) {\r\n          return text.substring(0, maxSize) + '...[TRUNCATED]';\r\n        }\r\n        try {\r\n          return JSON.parse(text);\r\n        } catch {\r\n          return text;\r\n        }\r\n      } else if (contentType.includes('text/')) {\r\n        const text = await clonedResponse.text();\r\n        if (text.length > maxSize) {\r\n          return text.substring(0, maxSize) + '...[TRUNCATED]';\r\n        }\r\n        return text;\r\n      } else {\r\n        // 二进制或其他类型，只记录大小和类型\r\n        try {\r\n          const blob = await clonedResponse.blob();\r\n          return `[${contentType || 'unknown'}: ${blob.size} bytes]`;\r\n        } catch {\r\n          return `[${contentType || 'unknown'}: unable to read]`;\r\n        }\r\n      }\r\n    } else {\r\n      // XMLHttpRequest\r\n      const xhr = response as XMLHttpRequest;\r\n      const responseText = xhr.responseText || '';\r\n      if (responseText.length > maxSize) {\r\n        return responseText.substring(0, maxSize) + '...[TRUNCATED]';\r\n      }\r\n\r\n      let contentType = '';\r\n      try {\r\n        contentType = xhr.getResponseHeader('content-type') || '';\r\n      } catch {\r\n        // 跨域请求可能无法读取响应头\r\n      }\r\n      \r\n      if (contentType.includes('application/json')) {\r\n        try {\r\n          return JSON.parse(responseText);\r\n        } catch {\r\n          return responseText;\r\n        }\r\n      }\r\n\r\n      return responseText;\r\n    }\r\n  } catch (error) {\r\n    console.warn('NetworkInterceptor: Failed to read response body:', error);\r\n    return '[Error reading response]';\r\n  }\r\n}\r\n\r\n/**\r\n * 创建网络拦截器插件\r\n */\r\nexport function createNetworkInterceptorPlugin(\r\n  options: NetworkInterceptorOptions = {}\r\n): TrackerPlugin {\r\n  const config = { ...DEFAULT_OPTIONS, ...options };\r\n  let originalFetch: typeof fetch | null = null;\r\n  let originalXHROpen: typeof XMLHttpRequest.prototype.open | null = null;\r\n  let originalXHRSend: typeof XMLHttpRequest.prototype.send | null = null;\r\n  let originalXHRSetRequestHeader: typeof XMLHttpRequest.prototype.setRequestHeader | null = null;\r\n\r\n  // 存储请求信息（用于关联请求和响应）\r\n  const requestMap = new Map<string, {\r\n    url: string;\r\n    method: string;\r\n    headers: Record<string, string>;\r\n    startTime: number;\r\n    requestBody?: unknown;\r\n  }>();\r\n\r\n  return {\r\n    name: 'network-interceptor',\r\n    install(trackerInstance: TrackerInstance) {\r\n      if (!config.enabled || typeof window === 'undefined') {\r\n        return;\r\n      }\r\n\r\n      // 拦截 fetch\r\n      if (typeof window.fetch !== 'undefined') {\r\n        originalFetch = window.fetch;\r\n        window.fetch = async function(input: RequestInfo | URL, init?: RequestInit): Promise<Response> {\r\n          const url = typeof input === 'string' ? input : input instanceof URL ? input.href : input.url;\r\n          // 优先使用 init?.method，然后是 Request 对象的 method，最后默认 GET\r\n          const method = init?.method || (typeof input !== 'string' && !(input instanceof URL) && 'method' in input ? input.method : undefined) || 'GET';\r\n\r\n          // 检查是否应该记录\r\n          if (!shouldRecordUrl(url, config.urlFilter)) {\r\n            return originalFetch!.call(this, input, init);\r\n          }\r\n\r\n          const requestId = `${Date.now()}-${Math.random().toString(36).substring(2, 9)}`;\r\n          const startTime = Date.now();\r\n          const headers: Record<string, string> = {};\r\n\r\n          // 读取请求头（合并 Request 对象和 init 的 headers）\r\n          if (typeof input !== 'string' && !(input instanceof URL) && 'headers' in input && input.headers instanceof Headers) {\r\n            input.headers.forEach((value, key) => {\r\n              headers[key] = value;\r\n            });\r\n          }\r\n          if (init?.headers) {\r\n            if (init.headers instanceof Headers) {\r\n              init.headers.forEach((value, key) => {\r\n                headers[key] = value;\r\n              });\r\n            } else if (Array.isArray(init.headers)) {\r\n              init.headers.forEach(([key, value]) => {\r\n                headers[key] = value;\r\n              });\r\n            } else {\r\n              Object.assign(headers, init.headers);\r\n            }\r\n          }\r\n\r\n          // 读取请求体（优先使用 init?.body，然后是 Request 对象的 body）\r\n          // 注意：如果 body 是 ReadableStream，读取会消耗流，所以需要 clone\r\n          let requestBody: unknown;\r\n          if (config.recordRequestBody) {\r\n            // 优先使用 init?.body，如果不存在且 input 是 Request 对象，使用 input.body\r\n            const bodyToRead = init?.body ?? (typeof input !== 'string' && !(input instanceof URL) && 'body' in input ? input.body : null);\r\n            requestBody = await readRequestBody(bodyToRead, config.maxRequestBodySize, config.recordRequestBody);\r\n            if (config.sensitiveFields && config.sensitiveFields.length > 0 && requestBody !== undefined) {\r\n              // 如果 requestBody 是 JSON 字符串，先解析\r\n              if (typeof requestBody === 'string') {\r\n                try {\r\n                  const parsed = JSON.parse(requestBody);\r\n                  requestBody = filterSensitiveFields(parsed, config.sensitiveFields);\r\n                } catch {\r\n                  // 不是 JSON，直接过滤字符串（虽然字符串通常不需要过滤）\r\n                  requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n                }\r\n              } else {\r\n                requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n              }\r\n            }\r\n          }\r\n\r\n          // 存储请求信息\r\n          requestMap.set(requestId, {\r\n            url,\r\n            method,\r\n            headers,\r\n            startTime,\r\n            requestBody\r\n          });\r\n\r\n          // 发送 api-request 事件\r\n          const requestEvent: CustomEvent = {\r\n            type: 'custom',\r\n            name: 'custom',\r\n            eventName: 'api-request',\r\n            timestamp: startTime,\r\n            url: getCurrentUrl(),\r\n            title: getPageTitle(),\r\n            properties: {\r\n              url: url.split('?')[0].split('#')[0], // 只记录路径，不记录查询参数和 hash\r\n              fullUrl: url,\r\n              method,\r\n              headers: config.sensitiveFields && config.sensitiveFields.length > 0\r\n                ? filterSensitiveFields(headers, config.sensitiveFields)\r\n                : headers,\r\n              body: requestBody,\r\n              timestamp: startTime\r\n            }\r\n          };\r\n          trackerInstance.send(requestEvent);\r\n\r\n          try {\r\n            // 执行原始请求\r\n            const response = await originalFetch!.call(this, input, init);\r\n            const endTime = Date.now();\r\n            const duration = endTime - startTime;\r\n            const statusCode = response.status;\r\n            const success = response.ok;\r\n\r\n            // 检查是否只记录失败的请求\r\n            if (config.onlyFailedRequests && success) {\r\n              requestMap.delete(requestId);\r\n              return response;\r\n            }\r\n\r\n            // 读取响应体\r\n            let responseBody: unknown;\r\n            if (config.recordResponseBody) {\r\n              responseBody = await readResponseBody(response, config.maxResponseBodySize, config.recordResponseBody);\r\n              if (config.sensitiveFields && config.sensitiveFields.length > 0 && responseBody !== undefined) {\r\n                // responseBody 应该已经是解析后的对象（readResponseBody 会解析 JSON）\r\n                responseBody = filterSensitiveFields(responseBody, config.sensitiveFields);\r\n              }\r\n            }\r\n\r\n            // 获取响应大小\r\n            const contentLength = response.headers.get('content-length');\r\n            const responseSize = contentLength ? parseInt(contentLength, 10) : undefined;\r\n\r\n            // 发送 api-response 事件\r\n            const responseEvent: CustomEvent = {\r\n              type: 'custom',\r\n              name: 'custom',\r\n              eventName: 'api-response',\r\n              timestamp: endTime,\r\n              url: getCurrentUrl(),\r\n              title: getPageTitle(),\r\n              properties: {\r\n                url: url.split('?')[0].split('#')[0],\r\n                fullUrl: url,\r\n                method,\r\n                statusCode,\r\n                duration,\r\n                responseSize,\r\n                success,\r\n                body: responseBody,\r\n                timestamp: endTime\r\n              }\r\n            };\r\n            trackerInstance.send(responseEvent);\r\n\r\n            requestMap.delete(requestId);\r\n            return response;\r\n          } catch (error) {\r\n            const endTime = Date.now();\r\n            const duration = endTime - startTime;\r\n\r\n            // 发送错误响应事件\r\n            const errorResponseEvent: CustomEvent = {\r\n              type: 'custom',\r\n              name: 'custom',\r\n              eventName: 'api-response',\r\n              timestamp: endTime,\r\n              url: getCurrentUrl(),\r\n              title: getPageTitle(),\r\n              properties: {\r\n                url: url.split('?')[0].split('#')[0],\r\n                fullUrl: url,\r\n                method,\r\n                statusCode: 0,\r\n                duration,\r\n                success: false,\r\n                error: error instanceof Error ? error.message : String(error),\r\n                timestamp: endTime\r\n              }\r\n            };\r\n            trackerInstance.send(errorResponseEvent);\r\n\r\n            requestMap.delete(requestId);\r\n            throw error;\r\n          }\r\n        };\r\n      }\r\n\r\n      // 拦截 XMLHttpRequest\r\n      if (typeof XMLHttpRequest !== 'undefined') {\r\n        originalXHROpen = XMLHttpRequest.prototype.open;\r\n        originalXHRSend = XMLHttpRequest.prototype.send;\r\n        originalXHRSetRequestHeader = XMLHttpRequest.prototype.setRequestHeader;\r\n\r\n        const xhrHeaders = new WeakMap<XMLHttpRequest, Record<string, string>>();\r\n        const xhrRequestInfo = new WeakMap<XMLHttpRequest, {\r\n          url: string;\r\n          method: string;\r\n          startTime: number;\r\n          requestBody?: unknown;\r\n        }>();\r\n\r\n        XMLHttpRequest.prototype.open = function(\r\n          method: string,\r\n          url: string | URL,\r\n          async?: boolean,\r\n          username?: string | null,\r\n          password?: string | null\r\n        ): void {\r\n          const urlString = typeof url === 'string' ? url : url.href;\r\n          xhrRequestInfo.set(this, {\r\n            url: urlString,\r\n            method: method.toUpperCase(),\r\n            startTime: Date.now()\r\n          });\r\n          xhrHeaders.set(this, {});\r\n          // 保持原始的 async 参数，如果未提供则默认为 true（异步）\r\n          return originalXHROpen!.call(this, method, url, async !== undefined ? async : true, username, password);\r\n        };\r\n\r\n        XMLHttpRequest.prototype.setRequestHeader = function(name: string, value: string): void {\r\n          const headers = xhrHeaders.get(this) || {};\r\n          headers[name] = value;\r\n          xhrHeaders.set(this, headers);\r\n          return originalXHRSetRequestHeader!.call(this, name, value);\r\n        };\r\n\r\n        XMLHttpRequest.prototype.send = function(body?: Document | XMLHttpRequestBodyInit | null): void {\r\n          const requestInfo = xhrRequestInfo.get(this);\r\n          if (!requestInfo) {\r\n            return originalXHRSend!.call(this, body);\r\n          }\r\n\r\n          const { url, method, startTime } = requestInfo;\r\n          const headers = xhrHeaders.get(this) || {};\r\n\r\n          // 检查是否应该记录\r\n          if (!shouldRecordUrl(url, config.urlFilter)) {\r\n            return originalXHRSend!.call(this, body);\r\n          }\r\n\r\n          // 读取请求体\r\n          let requestBody: unknown;\r\n          if (config.recordRequestBody && body) {\r\n            if (typeof body === 'string') {\r\n              requestBody = body.length > config.maxRequestBodySize\r\n                ? body.substring(0, config.maxRequestBodySize) + '...[TRUNCATED]'\r\n                : body;\r\n            } else if (body instanceof FormData) {\r\n              const formData: Record<string, unknown> = {};\r\n              for (const [key, value] of body.entries()) {\r\n                if (value instanceof File) {\r\n                  formData[key] = `[File: ${value.name}, ${value.size} bytes]`;\r\n                } else {\r\n                  formData[key] = value;\r\n                }\r\n              }\r\n              requestBody = formData;\r\n            } else if (body instanceof Blob) {\r\n              requestBody = body.size > config.maxRequestBodySize\r\n                ? `[Blob: ${body.size} bytes, type: ${body.type}]`\r\n                : '[Blob]';\r\n            } else {\r\n              requestBody = '[Unsupported body type]';\r\n            }\r\n\r\n            if (config.sensitiveFields && config.sensitiveFields.length > 0) {\r\n              requestBody = filterSensitiveFields(requestBody, config.sensitiveFields);\r\n            }\r\n          }\r\n\r\n          requestInfo.requestBody = requestBody;\r\n\r\n          // 发送 api-request 事件\r\n          const requestEvent: CustomEvent = {\r\n            type: 'custom',\r\n            name: 'custom',\r\n            eventName: 'api-request',\r\n            timestamp: startTime,\r\n            url: getCurrentUrl(),\r\n            title: getPageTitle(),\r\n            properties: {\r\n              url: url.split('?')[0].split('#')[0],\r\n              fullUrl: url,\r\n              method,\r\n              headers: config.sensitiveFields && config.sensitiveFields.length > 0\r\n                ? filterSensitiveFields(headers, config.sensitiveFields)\r\n                : headers,\r\n              body: requestBody,\r\n              timestamp: startTime\r\n            }\r\n          };\r\n          trackerInstance.send(requestEvent);\r\n\r\n          // 监听响应（使用箭头函数保存 this 上下文）\r\n          const readystatechangeHandler = () => {\r\n            if (this.readyState === XMLHttpRequest.DONE) {\r\n              const endTime = Date.now();\r\n              const duration = endTime - startTime;\r\n              const statusCode = this.status;\r\n              // 注意：statusCode 为 0 通常表示网络错误或请求被取消\r\n              const success = statusCode >= 200 && statusCode < 400;\r\n\r\n              // 检查是否只记录失败的请求\r\n              if (config.onlyFailedRequests && success) {\r\n                this.removeEventListener('readystatechange', readystatechangeHandler);\r\n                xhrRequestInfo.delete(this);\r\n                xhrHeaders.delete(this);\r\n                return;\r\n              }\r\n\r\n              // 读取响应体（XMLHttpRequest 是同步的）\r\n              let responseText = '';\r\n              try {\r\n                responseText = this.responseText || '';\r\n              } catch (error) {\r\n                // 某些情况下访问 responseText 可能失败（如跨域错误）\r\n                console.warn('NetworkInterceptor: Failed to read XHR responseText:', error);\r\n              }\r\n              \r\n              const responseSize = responseText.length;\r\n              let responseBody: unknown;\r\n              \r\n              if (config.recordResponseBody) {\r\n                if (responseText.length > config.maxResponseBodySize) {\r\n                  responseBody = responseText.substring(0, config.maxResponseBodySize) + '...[TRUNCATED]';\r\n                } else {\r\n                  let contentType = '';\r\n                  try {\r\n                    contentType = this.getResponseHeader('content-type') || '';\r\n                  } catch {\r\n                    // 跨域请求可能无法读取响应头\r\n                  }\r\n                  if (contentType.includes('application/json')) {\r\n                    try {\r\n                      responseBody = JSON.parse(responseText);\r\n                    } catch {\r\n                      responseBody = responseText;\r\n                    }\r\n                  } else {\r\n                    responseBody = responseText;\r\n                  }\r\n                }\r\n                if (config.sensitiveFields && config.sensitiveFields.length > 0) {\r\n                  responseBody = filterSensitiveFields(responseBody, config.sensitiveFields);\r\n                }\r\n              }\r\n\r\n              // 发送 api-response 事件\r\n              const responseEvent: CustomEvent = {\r\n                type: 'custom',\r\n                name: 'custom',\r\n                eventName: 'api-response',\r\n                timestamp: endTime,\r\n                url: getCurrentUrl(),\r\n                title: getPageTitle(),\r\n                properties: {\r\n                  url: url.split('?')[0].split('#')[0],\r\n                  fullUrl: url,\r\n                  method,\r\n                  statusCode,\r\n                  duration,\r\n                  responseSize,\r\n                  success,\r\n                  body: responseBody,\r\n                  timestamp: endTime\r\n                }\r\n              };\r\n              trackerInstance.send(responseEvent);\r\n\r\n              // 清理：移除事件监听器和 WeakMap 中的数据\r\n              this.removeEventListener('readystatechange', readystatechangeHandler);\r\n              xhrRequestInfo.delete(this);\r\n              xhrHeaders.delete(this);\r\n            }\r\n          };\r\n          this.addEventListener('readystatechange', readystatechangeHandler);\r\n\r\n          return originalXHRSend!.call(this, body);\r\n        };\r\n      }\r\n    },\r\n    uninstall() {\r\n      if (typeof window === 'undefined') {\r\n        return;\r\n      }\r\n\r\n      // 恢复原始 fetch\r\n      if (originalFetch) {\r\n        window.fetch = originalFetch;\r\n        originalFetch = null;\r\n      }\r\n\r\n      // 恢复原始 XMLHttpRequest\r\n      if (originalXHROpen && originalXHRSend && originalXHRSetRequestHeader) {\r\n        XMLHttpRequest.prototype.open = originalXHROpen;\r\n        XMLHttpRequest.prototype.send = originalXHRSend;\r\n        XMLHttpRequest.prototype.setRequestHeader = originalXHRSetRequestHeader;\r\n        originalXHROpen = null;\r\n        originalXHRSend = null;\r\n        originalXHRSetRequestHeader = null;\r\n      }\r\n\r\n      // 清空请求映射\r\n      requestMap.clear();\r\n    }\r\n  };\r\n}\r\n\r\n/**\r\n * 默认的网络拦截器插件实例\r\n */\r\nexport const networkInterceptorPlugin = createNetworkInterceptorPlugin();\r\n","/**\r\n * 用户操作序列管理器\r\n * 用于收集和管理用户从开始到结束的所有行为事件，构建完整的用户操作画像\r\n */\r\nimport type {\r\n  TrackerEvent,\r\n  PageViewEvent,\r\n  ClickEvent,\r\n  InputEvent,\r\n  ErrorEvent,\r\n  CustomEvent\r\n} from '@/types/event';\r\nimport type {\r\n  UserActionProfile,\r\n  UserJourneyStep,\r\n  BehaviorMetrics,\r\n  LightweightProfile,\r\n  PerformanceMode,\r\n  PerformanceBudget,\r\n  PerformanceStats\r\n} from '@/types/user-profile';\r\n\r\ninterface UserActionSequenceOptions {\r\n  /** 最大事件数 */\r\n  maxEvents?: number;\r\n  /** 事件采样率 */\r\n  sampleRate?: number;\r\n  /** 是否启用采样 */\r\n  enableSampling?: boolean;\r\n  /** 性能模式配置 */\r\n  performanceMode?: Partial<PerformanceMode>;\r\n  /** 性能预算配置 */\r\n  performanceBudget?: Partial<PerformanceBudget>;\r\n}\r\n\r\n/**\r\n * 用户操作序列管理器\r\n */\r\nexport class UserActionSequence {\r\n  private events: TrackerEvent[] = [];\r\n  private sessionId: string;\r\n  private userId?: string;\r\n  private deviceId: string;\r\n  private startTime: number;\r\n  private maxEvents: number;\r\n  private sampleRate: number;\r\n  private enableSampling: boolean;\r\n  private performanceMode: PerformanceMode;\r\n  private performanceBudget: PerformanceBudget;\r\n\r\n  // 索引优化\r\n  private eventTypeCounts: Map<string, number> = new Map();\r\n  private isSorted: boolean = true;\r\n  private lastEventTimestamp: number = 0;\r\n  private eventIndexes: {\r\n    pageViews: number[];\r\n    clicks: number[];\r\n    inputs: number[];\r\n    errors: number[];\r\n    customEvents: number[];\r\n  } = {\r\n    pageViews: [],\r\n    clicks: [],\r\n    inputs: [],\r\n    errors: [],\r\n    customEvents: []\r\n  };\r\n\r\n  // 缓存优化\r\n  private cachedProfile: UserActionProfile | null = null;\r\n  private cacheTimestamp: number = 0;\r\n  private cacheTTL: number = 5000; // 5秒缓存\r\n\r\n  // 异步处理队列\r\n  private eventQueue: TrackerEvent[] = [];\r\n  private isProcessing: boolean = false;\r\n  private maxQueueSize: number = 100;\r\n\r\n  // 性能监控\r\n  private performanceMetrics: {\r\n    addEventTimes: number[];\r\n    profileGenerationTimes: number[];\r\n  } = {\r\n    addEventTimes: [],\r\n    profileGenerationTimes: []\r\n  };\r\n\r\n  // 性能模式状态\r\n  private performanceModeActive: boolean = false;\r\n\r\n  constructor(\r\n    sessionId: string,\r\n    deviceId: string,\r\n    userId?: string,\r\n    options: UserActionSequenceOptions = {}\r\n  ) {\r\n    this.sessionId = sessionId;\r\n    this.deviceId = deviceId;\r\n    this.userId = userId;\r\n    this.startTime = Date.now();\r\n    this.maxEvents = options.maxEvents ?? 10000;\r\n    this.sampleRate = options.sampleRate ?? 1.0;\r\n    this.enableSampling = options.enableSampling ?? true;\r\n\r\n    // 性能模式配置\r\n    this.performanceMode = {\r\n      mode: options.performanceMode?.mode ?? 'balanced',\r\n      asyncProcessing: options.performanceMode?.asyncProcessing ?? true,\r\n      useWebWorker: options.performanceMode?.useWebWorker ?? false,\r\n      eventSampleRate: options.performanceMode?.eventSampleRate ?? this.sampleRate,\r\n      maxEvents: options.performanceMode?.maxEvents ?? this.maxEvents,\r\n      enablePerformanceMonitoring: options.performanceMode?.enablePerformanceMonitoring ?? true\r\n    };\r\n\r\n    // 性能预算配置\r\n    this.performanceBudget = {\r\n      addEventMaxTime: options.performanceBudget?.addEventMaxTime ?? 1,\r\n      profileGenerationMaxTime: options.performanceBudget?.profileGenerationMaxTime ?? 16\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 添加事件（异步版本，推荐使用）\r\n   * 快速入队，不阻塞主线程\r\n   */\r\n  addEventAsync(event: TrackerEvent): void {\r\n    // 如果异步处理被禁用，直接同步处理\r\n    if (!this.performanceMode.asyncProcessing) {\r\n      this.addEventInternal(event);\r\n      return;\r\n    }\r\n\r\n    // 快速入队，不进行任何处理\r\n    if (this.eventQueue.length >= this.maxQueueSize) {\r\n      // 队列满时，丢弃最旧的事件\r\n      this.eventQueue.shift();\r\n    }\r\n    this.eventQueue.push(event);\r\n\r\n    // 异步处理，不阻塞\r\n    if (!this.isProcessing) {\r\n      this.processQueueAsync();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 添加事件（同步版本）\r\n   * 注意：如果事件很多，可能影响性能\r\n   */\r\n  addEvent(event: TrackerEvent): void {\r\n    const start = performance.now();\r\n\r\n    try {\r\n      // 性能检查：如果处于性能模式，采样跳过部分事件\r\n      if (this.shouldSkipForPerformance(event)) {\r\n        return;\r\n      }\r\n\r\n      // 执行添加逻辑\r\n      this.addEventInternal(event);\r\n    } finally {\r\n      const duration = performance.now() - start;\r\n      this.recordPerformance('addEvent', duration);\r\n\r\n      // 如果超过预算，触发降级\r\n      if (duration > this.performanceBudget.addEventMaxTime) {\r\n        this.enablePerformanceMode();\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 内部添加事件逻辑\r\n   */\r\n  private addEventInternal(event: TrackerEvent): void {\r\n    // 检查是否需要清理旧事件\r\n    if (this.events.length >= this.maxEvents) {\r\n      this.cleanupOldEvents();\r\n    }\r\n\r\n    // 采样检查\r\n    if (this.enableSampling && Math.random() > this.sampleRate) {\r\n      // 关键事件始终收集\r\n      if (event.type !== 'error' && event.type !== 'custom') {\r\n        return;\r\n      }\r\n    }\r\n\r\n    // 优化：只存储必要字段，减少内存占用\r\n    const lightweightEvent: TrackerEvent = {\r\n      type: event.type,\r\n      name: event.name,\r\n      timestamp: event.timestamp,\r\n      url: event.url,\r\n      title: event.title,\r\n      sessionId: this.sessionId,\r\n      deviceId: this.deviceId,\r\n      userId: this.userId || event.userId,\r\n      properties: this.sanitizeProperties(event.properties),\r\n      // 如果是自定义事件，需要保留 eventName\r\n      ...(event.type === 'custom' && 'eventName' in event\r\n        ? { eventName: event.eventName }\r\n        : {})\r\n    } as TrackerEvent;\r\n\r\n    // 添加事件\r\n    const index = this.events.length;\r\n    this.events.push(lightweightEvent);\r\n\r\n    // 更新索引\r\n    this.updateIndexes(event.type, index);\r\n\r\n    // 更新统计\r\n    this.eventTypeCounts.set(\r\n      event.type,\r\n      (this.eventTypeCounts.get(event.type) || 0) + 1\r\n    );\r\n\r\n    // 检查是否需要排序\r\n    if (event.timestamp < this.lastEventTimestamp) {\r\n      this.isSorted = false;\r\n    }\r\n    this.lastEventTimestamp = event.timestamp;\r\n\r\n    // 清除缓存\r\n    this.cachedProfile = null;\r\n  }\r\n\r\n  /**\r\n   * 异步处理队列\r\n   */\r\n  private processQueueAsync(): void {\r\n    if (this.eventQueue.length === 0) {\r\n      this.isProcessing = false;\r\n      return;\r\n    }\r\n\r\n    this.isProcessing = true;\r\n\r\n    // 使用 requestIdleCallback 或 setTimeout 异步处理\r\n    if (typeof window !== 'undefined' && 'requestIdleCallback' in window) {\r\n      requestIdleCallback(\r\n        () => {\r\n          this.processBatch();\r\n          this.processQueueAsync();\r\n        },\r\n        { timeout: 100 }\r\n      );\r\n    } else {\r\n      setTimeout(() => {\r\n        this.processBatch();\r\n        this.processQueueAsync();\r\n      }, 0);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 处理一批事件\r\n   */\r\n  private processBatch(): void {\r\n    // 每次处理一小批，避免长时间阻塞\r\n    const batchSize = 10;\r\n    const batch = this.eventQueue.splice(0, batchSize);\r\n\r\n    batch.forEach(event => {\r\n      this.addEventInternal(event);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 判断是否应该跳过事件（性能模式）\r\n   */\r\n  private shouldSkipForPerformance(event: TrackerEvent): boolean {\r\n    if (!this.performanceModeActive) {\r\n      return false;\r\n    }\r\n\r\n    // 关键事件始终收集\r\n    if (event.type === 'error' || event.type === 'custom') {\r\n      return false;\r\n    }\r\n\r\n    // 性能模式下采样\r\n    return Math.random() > 0.5; // 50% 采样\r\n  }\r\n\r\n  /**\r\n   * 启用性能模式\r\n   */\r\n  private enablePerformanceMode(): void {\r\n    if (!this.performanceModeActive) {\r\n      console.warn('UserActionSequence: Entering performance mode due to slow operations');\r\n      this.performanceModeActive = true;\r\n\r\n      // 降低采样率\r\n      this.sampleRate = Math.max(0.1, this.sampleRate * 0.5);\r\n\r\n      // 减少最大事件数\r\n      this.maxEvents = Math.floor(this.maxEvents * 0.5);\r\n\r\n      // 清理旧事件\r\n      this.cleanupOldEvents();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清理属性，限制大小\r\n   */\r\n  private sanitizeProperties(\r\n    properties?: Record<string, unknown>\r\n  ): Record<string, unknown> | undefined {\r\n    if (!properties) return undefined;\r\n\r\n    const sanitized: Record<string, unknown> = {};\r\n    for (const [key, value] of Object.entries(properties)) {\r\n      const valueStr = JSON.stringify(value);\r\n      if (valueStr.length > 1000) {\r\n        // 截断过大的值\r\n        sanitized[key] = valueStr.substring(0, 1000) + '...';\r\n      } else {\r\n        sanitized[key] = value;\r\n      }\r\n    }\r\n    return Object.keys(sanitized).length > 0 ? sanitized : undefined;\r\n  }\r\n\r\n  /**\r\n   * 更新索引\r\n   */\r\n  private updateIndexes(eventType: string, index: number): void {\r\n    switch (eventType) {\r\n      case 'pageview':\r\n        this.eventIndexes.pageViews.push(index);\r\n        break;\r\n      case 'click':\r\n        this.eventIndexes.clicks.push(index);\r\n        break;\r\n      case 'input':\r\n        this.eventIndexes.inputs.push(index);\r\n        break;\r\n      case 'error':\r\n        this.eventIndexes.errors.push(index);\r\n        break;\r\n      case 'custom':\r\n        this.eventIndexes.customEvents.push(index);\r\n        break;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 清理旧事件\r\n   */\r\n  private cleanupOldEvents(): void {\r\n    // 保留最近的一半事件\r\n    const keepCount = Math.floor(this.maxEvents / 2);\r\n    const removedCount = this.events.length - keepCount;\r\n\r\n    // 移除旧事件\r\n    this.events = this.events.slice(-keepCount);\r\n\r\n    // 重建索引\r\n    this.rebuildIndexes();\r\n\r\n    // 更新统计\r\n    this.recalculateCounts();\r\n\r\n    if (this.performanceMode.enablePerformanceMonitoring) {\r\n      console.warn(\r\n        `UserActionSequence: Cleaned up ${removedCount} old events`\r\n      );\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 重建索引\r\n   */\r\n  private rebuildIndexes(): void {\r\n    this.eventIndexes = {\r\n      pageViews: [],\r\n      clicks: [],\r\n      inputs: [],\r\n      errors: [],\r\n      customEvents: []\r\n    };\r\n\r\n    this.events.forEach((event, index) => {\r\n      this.updateIndexes(event.type, index);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 重新计算统计\r\n   */\r\n  private recalculateCounts(): void {\r\n    this.eventTypeCounts.clear();\r\n    this.events.forEach(event => {\r\n      this.eventTypeCounts.set(\r\n        event.type,\r\n        (this.eventTypeCounts.get(event.type) || 0) + 1\r\n      );\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 获取事件序列（已排序）\r\n   */\r\n  getSequence(): TrackerEvent[] {\r\n    // 优化：只在需要时排序\r\n    if (!this.isSorted) {\r\n      this.events.sort((a, b) => a.timestamp - b.timestamp);\r\n      this.isSorted = true;\r\n      this.rebuildIndexes(); // 排序后重建索引\r\n    }\r\n    return this.events;\r\n  }\r\n\r\n  /**\r\n   * 获取会话时长\r\n   */\r\n  getDuration(): number {\r\n    if (this.events.length === 0) return 0;\r\n    const sequence = this.getSequence();\r\n    const lastEvent = sequence[sequence.length - 1];\r\n    return lastEvent.timestamp - this.startTime;\r\n  }\r\n\r\n  /**\r\n   * 使用索引快速获取特定类型的事件\r\n   */\r\n  getEventsByType(type: string): TrackerEvent[] {\r\n    const indexes = this.getIndexesByType(type);\r\n    const sequence = this.getSequence();\r\n    // 过滤无效索引（防止索引失效）\r\n    return indexes\r\n      .filter(index => index >= 0 && index < sequence.length)\r\n      .map(index => sequence[index])\r\n      .filter(Boolean);\r\n  }\r\n\r\n  /**\r\n   * 根据类型获取索引\r\n   */\r\n  private getIndexesByType(type: string): number[] {\r\n    switch (type) {\r\n      case 'pageview':\r\n        return this.eventIndexes.pageViews;\r\n      case 'click':\r\n        return this.eventIndexes.clicks;\r\n      case 'input':\r\n        return this.eventIndexes.inputs;\r\n      case 'error':\r\n        return this.eventIndexes.errors;\r\n      case 'custom':\r\n        return this.eventIndexes.customEvents;\r\n      default:\r\n        return [];\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 生成操作画像（同步版本）\r\n   */\r\n  generateProfile(): UserActionProfile {\r\n    // 检查缓存\r\n    const now = Date.now();\r\n    if (\r\n      this.cachedProfile &&\r\n      now - this.cacheTimestamp < this.cacheTTL\r\n    ) {\r\n      return this.cachedProfile;\r\n    }\r\n\r\n    const sequence = this.getSequence();\r\n\r\n    // 过滤无效索引（防止索引失效）\r\n    const filterValidIndexes = (indexes: number[]): TrackerEvent[] => {\r\n      return indexes\r\n        .filter(index => index >= 0 && index < sequence.length)\r\n        .map(index => sequence[index])\r\n        .filter(Boolean);\r\n    };\r\n\r\n    const profile: UserActionProfile = {\r\n      sessionId: this.sessionId,\r\n      userId: this.userId,\r\n      deviceId: this.deviceId,\r\n      startTime: this.startTime,\r\n      duration: this.getDuration(),\r\n      totalEvents: sequence.length,\r\n      eventTypes: Object.fromEntries(this.eventTypeCounts),\r\n      pageViews: filterValidIndexes(this.eventIndexes.pageViews),\r\n      clicks: filterValidIndexes(this.eventIndexes.clicks),\r\n      inputs: filterValidIndexes(this.eventIndexes.inputs),\r\n      errors: filterValidIndexes(this.eventIndexes.errors),\r\n      customEvents: filterValidIndexes(this.eventIndexes.customEvents),\r\n      userJourney: this.buildUserJourneyOptimized(sequence),\r\n      behaviorMetrics: this.calculateBehaviorMetricsOptimized(sequence)\r\n    };\r\n\r\n    // 缓存结果\r\n    this.cachedProfile = profile;\r\n    this.cacheTimestamp = now;\r\n\r\n    return profile;\r\n  }\r\n\r\n  /**\r\n   * 生成操作画像（异步版本）\r\n   */\r\n  generateProfileAsync(): Promise<UserActionProfile> {\r\n    return new Promise(resolve => {\r\n      // 使用 requestIdleCallback 在空闲时计算\r\n      if (\r\n        typeof window !== 'undefined' &&\r\n        'requestIdleCallback' in window\r\n      ) {\r\n        requestIdleCallback(\r\n          () => {\r\n            const start = performance.now();\r\n            const profile = this.generateProfile();\r\n            const duration = performance.now() - start;\r\n            this.recordPerformance('profileGeneration', duration);\r\n            resolve(profile);\r\n          },\r\n          { timeout: 1000 }\r\n        );\r\n      } else {\r\n        // 降级：使用 setTimeout\r\n        setTimeout(() => {\r\n          const start = performance.now();\r\n          const profile = this.generateProfile();\r\n          const duration = performance.now() - start;\r\n          this.recordPerformance('profileGeneration', duration);\r\n          resolve(profile);\r\n        }, 0);\r\n      }\r\n    });\r\n  }\r\n\r\n  /**\r\n   * 生成轻量级画像（不包含完整事件数组）\r\n   */\r\n  generateLightweightProfile(): LightweightProfile {\r\n    const sequence = this.getSequence();\r\n\r\n    return {\r\n      sessionId: this.sessionId,\r\n      userId: this.userId,\r\n      deviceId: this.deviceId,\r\n      startTime: this.startTime,\r\n      duration: this.getDuration(),\r\n      totalEvents: sequence.length,\r\n      eventTypes: Object.fromEntries(this.eventTypeCounts),\r\n      behaviorMetrics: this.calculateBehaviorMetricsOptimized(sequence)\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 优化的用户旅程构建\r\n   */\r\n  private buildUserJourneyOptimized(\r\n    events: TrackerEvent[]\r\n  ): UserJourneyStep[] {\r\n    const journey: UserJourneyStep[] = [];\r\n    let prevTimestamp = this.startTime;\r\n\r\n    for (let i = 0; i < events.length; i++) {\r\n      const event = events[i];\r\n      journey.push({\r\n        step: i + 1,\r\n        timestamp: event.timestamp,\r\n        type: event.type,\r\n        url: event.url,\r\n        title: event.title,\r\n        action: this.extractAction(event),\r\n        duration: event.timestamp - prevTimestamp\r\n      });\r\n      prevTimestamp = event.timestamp;\r\n    }\r\n\r\n    return journey;\r\n  }\r\n\r\n  /**\r\n   * 提取操作描述\r\n   */\r\n  private extractAction(event: TrackerEvent): string {\r\n    switch (event.type) {\r\n      case 'pageview':\r\n        return `访问页面: ${event.title || event.url}`;\r\n      case 'click':\r\n        {\r\n          const clickEvent = event as ClickEvent;\r\n          return `点击: ${\r\n            clickEvent.elementInfo?.text ||\r\n            clickEvent.elementPath ||\r\n            '未知元素'\r\n          }`;\r\n        }\r\n      case 'input':\r\n        {\r\n          const inputEvent = event as InputEvent;\r\n          return `输入: ${\r\n            inputEvent.elementInfo?.name ||\r\n            inputEvent.elementPath ||\r\n            '未知字段'\r\n          }`;\r\n        }\r\n      case 'error':\r\n        {\r\n          const errorEvent = event as ErrorEvent;\r\n          return `错误: ${errorEvent.message}`;\r\n        }\r\n      case 'custom':\r\n        {\r\n          const customEvent = event as CustomEvent;\r\n          return `自定义事件: ${customEvent.eventName}`;\r\n        }\r\n      default:\r\n        return `${event.type} 事件`;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 优化的行为指标计算\r\n   */\r\n  private calculateBehaviorMetricsOptimized(\r\n    events: TrackerEvent[]\r\n  ): BehaviorMetrics {\r\n    // 使用索引直接计算，避免多次遍历\r\n    // 过滤无效索引（防止索引失效）\r\n    const pageViewIndexes = this.eventIndexes.pageViews.filter(\r\n      i => i >= 0 && i < events.length\r\n    );\r\n    const pageViews = pageViewIndexes.map(\r\n      i => events[i] as PageViewEvent\r\n    );\r\n\r\n    let totalDuration = 0;\r\n    const uniquePages = new Set<string>();\r\n\r\n    for (const pv of pageViews) {\r\n      if (pv.duration) {\r\n        totalDuration += pv.duration;\r\n      }\r\n      uniquePages.add(pv.url);\r\n    }\r\n\r\n    return {\r\n      pv: pageViewIndexes.length,\r\n      avgPageDuration:\r\n        pageViewIndexes.length > 0\r\n          ? totalDuration / pageViewIndexes.length\r\n          : 0,\r\n      clickCount: this.eventIndexes.clicks.length,\r\n      inputCount: this.eventIndexes.inputs.length,\r\n      errorCount: this.eventIndexes.errors.length,\r\n      uniquePages: uniquePages.size\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 记录性能指标\r\n   */\r\n  private recordPerformance(operation: string, duration: number): void {\r\n    if (!this.performanceMode.enablePerformanceMonitoring) {\r\n      return;\r\n    }\r\n\r\n    const metrics =\r\n      this.performanceMetrics[\r\n        `${operation}Times` as keyof typeof this.performanceMetrics\r\n      ];\r\n    if (metrics) {\r\n      metrics.push(duration);\r\n      // 只保留最近100次\r\n      if (metrics.length > 100) {\r\n        metrics.shift();\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 获取性能统计\r\n   */\r\n  getPerformanceStats(): PerformanceStats {\r\n    const addEventTimes = this.performanceMetrics.addEventTimes;\r\n    const profileTimes = this.performanceMetrics.profileGenerationTimes;\r\n\r\n    return {\r\n      avgAddEventTime:\r\n        addEventTimes.length > 0\r\n          ? addEventTimes.reduce((a, b) => a + b, 0) / addEventTimes.length\r\n          : 0,\r\n      avgProfileGenerationTime:\r\n        profileTimes.length > 0\r\n          ? profileTimes.reduce((a, b) => a + b, 0) / profileTimes.length\r\n          : 0,\r\n      p95AddEventTime: this.percentile(addEventTimes, 95),\r\n      p95ProfileGenerationTime: this.percentile(profileTimes, 95)\r\n    };\r\n  }\r\n\r\n  /**\r\n   * 计算百分位数\r\n   */\r\n  private percentile(arr: number[], p: number): number {\r\n    if (arr.length === 0) return 0;\r\n    const sorted = [...arr].sort((a, b) => a - b);\r\n    const index = Math.ceil((p / 100) * sorted.length) - 1;\r\n    return sorted[Math.max(0, index)] || 0;\r\n  }\r\n\r\n  /**\r\n   * 重置序列\r\n   */\r\n  reset(): void {\r\n    this.events = [];\r\n    this.eventQueue = [];\r\n    this.eventTypeCounts.clear();\r\n    this.eventIndexes = {\r\n      pageViews: [],\r\n      clicks: [],\r\n      inputs: [],\r\n      errors: [],\r\n      customEvents: []\r\n    };\r\n    this.cachedProfile = null;\r\n    this.isSorted = true;\r\n    this.lastEventTimestamp = 0;\r\n    this.startTime = Date.now();\r\n    this.performanceModeActive = false;\r\n  }\r\n}\r\n","/**\r\n * Tracker主类\r\n */\r\nimport type { TrackerConfig, TrackerEvent, TrackerPlugin, UserInfo, ErrorEvent } from '@/types';\r\nimport { createReactFrameAdapter } from '@/extension/frame-adapters/react-adapter';\r\nimport { createAngularFrameAdapter } from '@/extension/frame-adapters/angular-adapter';\nimport ConfigManager from '@/core/config';\nimport { eventBus } from '@/core/event-bus';\nimport { getDeviceId, getSessionId, getCurrentUrl, getPageTitle, isTrackerInternalPanel } from '@/core/utils';\nimport AutoTracker from '@/collector/auto-tracker';\nimport CustomTracker from '@/collector/custom-tracker';\nimport DataProcessor from '@/processor/data-processor';\nimport BatchSender from '@/transport/batch-sender';\nimport PluginManager from '@/extension/plugin-manager';\nimport BehaviorAnalysis, { type BehaviorMetrics } from '@/extension/behavior-analysis';\nimport { type DOMSnapshot, type UserInteraction } from '@/extension/session-replay';\nimport { PerformanceMonitor } from '@/extension/performance-monitor';\r\nimport PanelManager from '@/core/panel-manager';\r\nimport type {\n  PerformanceMetrics,\n  PerformanceReport,\n  ReportOptions\n} from '@/types/performance';\nimport TrackerEventEnricher from '@/runtime/tracker-event-enricher';\nimport TrackerEventBusBridge from '@/runtime/tracker-event-bus-bridge';\nimport TrackerConfigCoordinator from '@/runtime/tracker-config-coordinator';\nimport TrackerFeatureRegistry from '@/runtime/tracker-feature-registry';\nimport TrackerEventDispatcher from '@/runtime/tracker-event-dispatcher';\nimport { createTrackerPluginContext } from '@/runtime/tracker-plugin-context';\n\nclass Tracker {\n  private config: ConfigManager;\n  private customTracker: CustomTracker;\n  private dataProcessor: DataProcessor;\n  private batchSender: BatchSender;\n  private pluginManager: PluginManager;\n  private behaviorAnalysis: BehaviorAnalysis;\n  private performanceMonitor: PerformanceMonitor;\n  private panelManager: PanelManager;\n  private eventEnricher: TrackerEventEnricher;\n  private eventBusBridge: TrackerEventBusBridge;\n  private configCoordinator: TrackerConfigCoordinator;\n  private featureRegistry: TrackerFeatureRegistry;\n  private eventDispatcher: TrackerEventDispatcher;\n  private userInfo: UserInfo | null = null;\n  private deviceId: string;\n  private sessionId: string;\n\n  constructor(config: TrackerConfig) {\n    // 验证配置\r\n    if (!config.appId) {\r\n      throw new Error('Tracker: appId is required');\r\n    }\r\n\r\n    const mergedConfig: TrackerConfig = {\r\n      ...config,\r\n      frameAdapters: [\r\n        ...(config.enableReactTracking ? [createReactFrameAdapter({ priority: 80 })] : []),\r\n        ...(config.enableAngularTracking\r\n          ? [\r\n              createAngularFrameAdapter({\r\n                getComponent: config.angularGetComponent,\r\n                priority: 79\r\n              })\r\n            ]\r\n          : []),\r\n        ...(config.frameAdapters ?? [])\r\n      ]\r\n    };\r\n    if (!mergedConfig.frameAdapters?.length) {\r\n      delete mergedConfig.frameAdapters;\r\n    }\r\n\r\n    this.config = new ConfigManager(mergedConfig);\r\n    this.deviceId = config.deviceId || getDeviceId();\r\n    this.sessionId = getSessionId();\r\n\r\n    // 初始化组件\r\n    this.customTracker = new CustomTracker();\r\n    this.dataProcessor = new DataProcessor();\r\n    \r\n    // 如果提供了serverUrl，初始化BatchSender；否则使用占位URL，仅保存到离线存储\r\n    const serverUrl = config.serverUrl || 'about:blank';\r\n    this.batchSender = new BatchSender(serverUrl, {\r\n      batchSize: this.config.get('batchSize'),\r\n      batchWait: this.config.get('batchWait'),\r\n      enableOfflineStorage: this.config.get('enableOfflineStorage') ?? true, // 未设置serverUrl时强制启用离线存储\r\n      maxOfflineStorageSize: this.config.get('maxOfflineStorageSize'),\r\n      maxRetries: this.config.get('maxRetries') ?? 3\r\n    });\r\n    \r\n    // 如果未设置serverUrl，禁用实际上报，仅保存到离线存储\r\n    if (!config.serverUrl) {\r\n      this.batchSender.setServerUrl(''); // 设置为空字符串，发送时会跳过网络请求\r\n    }\r\n    this.pluginManager = new PluginManager();\n    this.behaviorAnalysis = new BehaviorAnalysis();\n    this.performanceMonitor = new PerformanceMonitor();\n    this.panelManager = new PanelManager();\n    this.eventEnricher = new TrackerEventEnricher();\n    this.eventBusBridge = new TrackerEventBusBridge(this.send.bind(this));\n    this.configCoordinator = new TrackerConfigCoordinator(this.config, this.batchSender);\n    this.featureRegistry = new TrackerFeatureRegistry(this.config);\n    this.eventDispatcher = new TrackerEventDispatcher(\n      this.eventEnricher,\n      this.dataProcessor,\n      this.batchSender,\n      this.behaviorAnalysis,\n      () => typeof window !== 'undefined' && isTrackerInternalPanel()\n    );\n\n    // 设置插件管理器的Tracker实例\n    this.pluginManager.setTrackerInstance(createTrackerPluginContext({\n      send: this.send.bind(this),\n      getConfig: () => this.config.getAll(),\n      setUser: this.setUser.bind(this),\n      getUser: () => this.userInfo\n    }));\n\r\n    // 设置面板管理器的Tracker实例\r\n    this.panelManager.setTrackerInstance(this);\r\n\r\n    // 初始化功能模块\r\n    this.init();\r\n\r\n    // 设置全局事件总线（用于采集器触发事件）\n    this.eventBusBridge.attachToWindow();\n  }\n\r\n  /**\r\n   * 初始化\r\n   */\r\n  private init(): void {\n    // 监听事件总线：错误/性能等不应依赖 enableAutoTrack\n    // 即使未启用自动埋点，ErrorTracker / PerformanceTracker 仍会通过 eventBus.emit 上报\n    this.eventBusBridge.setup();\n\r\n    // 自动埋点\n    this.featureRegistry.init();\n\n    // 设置用户信息\n    if (this.config.get('userId')) {\n      this.setUser({ userId: this.config.get('userId') });\n    }\r\n  }\r\n\r\n  /**\n   * 发送事件\n   */\n  send(event: TrackerEvent): void {\n    this.eventDispatcher.dispatch(event, {\n      deviceId: this.deviceId,\n      sessionId: this.sessionId,\n      configUserId: this.config.get('userId'),\n      userInfo: this.userInfo,\n      customProperties: this.config.get('customProperties') || {},\n      sampleRate: this.config.get('sampleRate'),\n      enableCompression: this.config.get('enableCompression') ?? false,\n      beforeSend: this.config.get('beforeSend'),\n      afterSend: this.config.get('afterSend'),\n      onError: this.config.get('onError')\n    });\n  }\n\r\n  /**\r\n   * 追踪自定义事件\r\n   */\r\n  track(eventName: string, properties?: Record<string, unknown>): void {\r\n    const event = this.customTracker.track(eventName, properties);\r\n    this.send(event);\r\n  }\r\n\r\n  /**\r\n   * 设置用户信息\r\n   */\r\n  setUser(user: UserInfo): void {\r\n    this.userInfo = { ...this.userInfo, ...user };\r\n    this.config.set('userId', user.userId || '');\r\n  }\r\n\r\n  /**\r\n   * 获取用户信息\r\n   */\r\n  getUser(): UserInfo | null {\r\n    return this.userInfo;\r\n  }\r\n\r\n  /**\r\n   * 手动上报错误\r\n   */\r\n  trackError(error: Error | string, errorInfo?: Record<string, unknown>): void {\n    const errorTracker = this.featureRegistry.getErrorTracker();\n    if (errorTracker) {\n      // 通过errorTracker触发，会自动通过eventBus发送\n      errorTracker.trackError(error, errorInfo);\n    } else {\n      // 如果errorTracker未启用，直接发送错误事件\r\n      const errorEvent: ErrorEvent = {\r\n        type: 'error',\r\n        name: 'custom-error',\r\n        timestamp: Date.now(),\r\n        url: getCurrentUrl(),\r\n        title: getPageTitle(),\r\n        errorType: 'js',\r\n        message: error instanceof Error ? error.message : error,\r\n        stack: error instanceof Error ? error.stack : undefined,\r\n        properties: errorInfo\r\n      };\r\n      this.send(errorEvent);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * 手动上报性能\r\n   */\r\n  trackPerformance(): void {\n    const performanceTracker = this.featureRegistry.getPerformanceTracker();\n    if (performanceTracker) {\n      const event = performanceTracker.collectMetrics();\n      if (event) {\n        this.send(event);\n      }\n    }\r\n  }\r\n\r\n  /**\r\n   * 页面浏览追踪\r\n   */\r\n  trackPageView(): void {\n    const autoTracker = this.featureRegistry.getAutoTracker();\n    if (autoTracker) {\n      const event = autoTracker.getViewTracker().trackPageView();\n      this.send(event);\n    }\n  }\n\r\n  /**\r\n   * 使用插件\r\n   */\r\n  use(plugin: TrackerPlugin): void {\r\n    this.pluginManager.use(plugin);\r\n  }\r\n\r\n  /**\r\n   * 更新配置\r\n   */\r\n  updateConfig(config: Partial<TrackerConfig>): void {\n    this.configCoordinator.apply(config);\n  }\n\r\n  /**\r\n   * 获取配置\r\n   */\r\n  getConfig(): TrackerConfig {\r\n    return this.config.getAll();\r\n  }\r\n\r\n  /**\r\n   * 打开性能监控面板\r\n   */\r\n  openPerformancePanel(): void {\r\n    this.panelManager.openPerformancePanel();\r\n  }\r\n\r\n  /**\r\n   * 打开离线存储查看器\r\n   */\r\n  openOfflineStorageViewer(): void {\r\n    this.panelManager.openOfflineStorageViewer();\r\n  }\r\n\r\n  /**\r\n   * 获取性能监控数据\r\n   */\r\n  getPerformanceMetrics(startTime?: number, endTime?: number): PerformanceMetrics {\r\n    return this.performanceMonitor.getMetrics(startTime, endTime);\r\n  }\r\n\r\n  /**\r\n   * 生成性能报告\r\n   */\r\n  generatePerformanceReport(options?: ReportOptions): PerformanceReport {\r\n    return this.performanceMonitor.generateReport(options);\r\n  }\r\n\r\n  /**\r\n   * 获取性能监控器实例\r\n   */\r\n  getPerformanceMonitor(): PerformanceMonitor {\r\n    return this.performanceMonitor;\r\n  }\r\n\r\n  /**\r\n   * 获取行为分析数据\r\n   */\r\n  getBehaviorMetrics(): BehaviorMetrics {\r\n    return this.behaviorAnalysis.getMetrics();\r\n  }\r\n\r\n  /**\r\n   * 获取会话回放数据\r\n   */\r\n  getSessionReplayData(): { snapshots: DOMSnapshot[]; interactions: UserInteraction[] } | undefined {\n    return this.featureRegistry.getSessionReplay()?.getData();\n  }\n\r\n  /**\r\n   * 获取离线存储的所有事件\r\n   */\r\n  async getOfflineEvents(): Promise<TrackerEvent[]> {\r\n    return this.batchSender.getOfflineEvents();\r\n  }\r\n\r\n  /**\r\n   * 获取离线存储的事件数量\r\n   */\r\n  async getOfflineEventCount(): Promise<number> {\r\n    return this.batchSender.getOfflineEventCount();\r\n  }\r\n\r\n  /**\r\n   * 清空离线存储\r\n   */\r\n  async clearOfflineStorage(): Promise<boolean> {\r\n    return this.batchSender.clearOfflineStorage();\r\n  }\r\n\r\n  /**\r\n   * 获取自动追踪器实例\r\n   * 如果未启用自动埋点，返回null\r\n   */\r\n  getAutoTracker(): AutoTracker | null {\n    return this.featureRegistry.getAutoTracker();\n  }\n\r\n  /**\r\n   * 销毁（同步版本）\r\n   */\r\n  destroy(): void {\n    this.eventBusBridge.teardown();\n    this.featureRegistry.destroy();\n    this.performanceMonitor.destroy();\n    this.batchSender.destroy(); // 注意：这是异步的，但不会阻塞\n    this.pluginManager.clear();\n  }\r\n\r\n  /**\r\n   * 异步销毁（等待所有事件发送完成）\r\n   */\r\n  async destroyAsync(): Promise<void> {\n    this.eventBusBridge.teardown();\n    this.featureRegistry.destroy();\n    this.performanceMonitor.destroy();\n    await this.batchSender.destroyAsync(); // 等待事件发送完成\n    this.pluginManager.clear();\n    eventBus.clear();\r\n  }\r\n}\r\n\r\nexport default Tracker;\r\n\r\n","import type { TrackerConfig, TrackerEvent, TrackerInstance, UserInfo } from '@/types';\n\ninterface TrackerPluginContextOptions {\n  send: (event: TrackerEvent) => void;\n  getConfig: () => TrackerConfig;\n  setUser: (user: UserInfo) => void;\n  getUser: () => UserInfo | null;\n}\n\nexport function createTrackerPluginContext(\n  options: TrackerPluginContextOptions\n): TrackerInstance {\n  return {\n    send: options.send,\n    getConfig: options.getConfig,\n    setUser: options.setUser,\n    getUser: options.getUser\n  };\n}\n","/**\r\n * Vue3 插件入口\r\n * 提供 Vue3 应用集成支持\r\n */\r\n// Vue3 类型定义（避免依赖 vue 包，使用简化类型）\r\ninterface VueApp {\r\n  config: {\r\n    globalProperties: Record<string, unknown>;\r\n  };\r\n  provide: (key: string, value: unknown) => void;\r\n  mixin: (mixin: { mounted?: () => void; [key: string]: unknown }) => void;\r\n  mount?: (selector: string) => void;\r\n}\r\n\r\nimport type { TrackerInstance } from '@/types';\r\n\r\n/**\r\n * Vue3 插件选项\r\n */\r\nexport interface VuePluginOptions {\r\n  /** Tracker 实例 */\r\n  tracker: TrackerInstance;\r\n  /** 是否启用自动追踪（默认 true） */\r\n  enableAutoTrack?: boolean;\r\n  /** 是否启用组件信息提取（默认 true） */\r\n  enableComponentInfo?: boolean;\r\n}\r\n\r\n/**\r\n * Vue3 插件安装函数\r\n */\r\nexport function vuePlugin(app: VueApp, options: VuePluginOptions): void {\r\n  const { tracker, enableAutoTrack = true, enableComponentInfo = true } = options;\r\n\r\n  if (!tracker) {\r\n    console.error('VuePlugin: Tracker instance is required');\r\n    return;\r\n  }\r\n\r\n  // 将 tracker 实例挂载到全局属性，方便组件访问\r\n  app.config.globalProperties.$tracker = tracker;\r\n\r\n  // 提供全局属性访问 tracker\r\n  app.provide('tracker', tracker);\r\n\r\n  // 如果启用组件信息提取，设置全局配置\r\n  // 注意：配置应该在创建 Tracker 实例时设置，这里只是提示\r\n  // 实际使用时，应该在创建 Tracker 时设置 enableVueTracking 和 enableNaiveUITracking\r\n  if (enableComponentInfo) {\r\n    // 配置应该在 Tracker 构造函数中设置\r\n    // 这里不做任何操作，因为 TrackerConfig 不支持运行时修改\r\n  }\r\n\r\n  // 如果启用自动追踪，监听全局事件\r\n  if (enableAutoTrack) {\r\n    // Vue3 应用挂载后，组件信息提取会自动工作\r\n    // 因为我们的追踪器已经通过 DOM 事件监听来工作\r\n    app.mixin({\r\n      mounted() {\r\n        // 组件挂载后，可以在这里做一些初始化工作\r\n        // 但主要的追踪工作由 DOM 事件监听器完成\r\n      }\r\n    });\r\n  }\r\n}\r\n\r\n/**\r\n * Vue3 插件对象（符合 Vue3 插件规范）\r\n */\r\nexport default {\r\n  install: vuePlugin\r\n};\r\n\r\n/**\r\n * 在组件中使用 tracker 的组合式函数（Composition API）\r\n * \r\n * 注意：这个函数需要在 Vue3 环境中使用，实际使用时应该这样：\r\n * \r\n * ```typescript\r\n * import { inject } from 'vue';\r\n * import type { TrackerInstance } from '@feiyangdefeng/sdk';\r\n * \r\n * export function useTracker(): TrackerInstance | undefined {\r\n *   return inject<TrackerInstance>('tracker');\r\n * }\r\n * ```\r\n * \r\n * 或者从全局属性获取：\r\n * ```typescript\r\n * import { getCurrentInstance } from 'vue';\r\n * \r\n * export function useTracker(): TrackerInstance | undefined {\r\n *   const instance = getCurrentInstance();\r\n *   return instance?.appContext.config.globalProperties.$tracker;\r\n * }\r\n * ```\r\n * \r\n * 这里提供一个简化版本，尝试从可能的全局位置获取\r\n */\r\nexport function useTracker(): TrackerInstance | undefined {\r\n  if (typeof window === 'undefined') {\r\n    return undefined;\r\n  }\r\n\r\n  // 尝试从可能的全局位置获取 tracker\r\n  // 方法1: 从 window.__VUE_APP__ 获取（非标准，但可能在某些场景下存在）\r\n  const vueApp = (window as unknown as { \r\n    __VUE_APP__?: { \r\n      config: { \r\n        globalProperties: { \r\n          $tracker?: TrackerInstance \r\n        } \r\n      } \r\n    } \r\n  }).__VUE_APP__;\r\n  \r\n  if (vueApp?.config?.globalProperties?.$tracker) {\r\n    return vueApp.config.globalProperties.$tracker;\r\n  }\r\n\r\n  // 方法2: 从全局变量获取（如果用户手动设置了）\r\n  const globalTracker = (window as unknown as { \r\n    __TRACKER_INSTANCE__?: TrackerInstance \r\n  }).__TRACKER_INSTANCE__;\r\n  \r\n  if (globalTracker) {\r\n    return globalTracker;\r\n  }\r\n  \r\n  // 如果都获取不到，返回 undefined\r\n  // 实际使用时应该使用 Vue 的 inject API\r\n  return undefined;\r\n}\r\n"],"names":["getVueComponentInstance","element","window","vueInstance","__vueParentComponent","__vue__","current","parentElement","depth","parentVueInstance","getComponentName","instance","_a","$options","name","__name","_b","type","_c","_e","_d","$","_g","_f","getComponentProps","$props","props","getComponentAttrs","$attrs","attrs","getComponentValue","value","modelValue","setupState","ctx","SENSITIVE_KEYS","filterSensitiveData","data","filtered","key","Object","entries","lowerKey","toLowerCase","some","sensitiveKey","lowerSensitiveKey","index","indexOf","prevChar","nextChar","length","test","originalSensitivePart","substring","Array","isArray","nestedFiltered","identifyNaiveUIComponent","className","match","tagName","startsWith","parentClassName","parentTagName","mergeSanitizeLimits","cfg","maxDepth","maxKeys","stripFunctions","sanitizeValue","val","limits","seen","t","String","has","add","cap","Math","min","out","i","push","obj","keys","slice","k","sanitizeForComponentInfo","raw","WeakSet","normalizeToElement","target","Element","Text","Comment","REACT_FIBER_KEY","getFiberFromElement","el","node","names","Set","getOwnPropertyNames","findFiberKeyOnNode","unwrapComponentType","o","render","getComponentTypeFromFiber","f","elementType","isUserDefinedComponentFiber","resolveFiberToComponentInfo","startFiber","opts","selected","maxFiberHops","hops","return","walkFiberReturnChain","comp","fn","named","displayName","nameFromFunction","propsRaw","memoizedProps","pendingProps","rest","children","ref","extractPropsRaw","componentName","createReactFrameAdapter","options","priority","maxDomWalkDepth","resolveComponentInfo","trackerConfig","componentInfo","info","startElement","fiber","start","getFiber","cur","walkAncestorsForFiber","resolveReactFiberFromDom","nativeEventType","event","eventMeta","angularInstanceToComponentInfo","inst","ctor","constructor","filter","createAngularFrameAdapter","resolver","getComponent","useFallbackNgProbe","ng","globalThis","e","resolveGetComponent","defaultConfig","appId","serverUrl","enableAutoTrack","enableErrorTrack","enablePerformanceTrack","enableSessionReplay","batchSize","batchWait","sampleRate","enableOfflineStorage","maxOfflineStorageSize","maxRetries","enableCompression","userId","deviceId","customProperties","enableVueTracking","enableNaiveUITracking","componentInfoDepth","extractComponentProps","extractComponentValue","enableReactTracking","enableAngularTracking","ConfigManager","config","__publicField","this","get","getAll","set","update","updates","eventBus","Map","on","callback","events","off","delete","callbacks","splice","emit","args","forEach","error","console","once","wrapper","clear","generateId","Date","now","random","toString","getDeviceId","localStorage","getItem","setItem","getSessionId","sessionStorage","sessionId","getCurrentUrl","location","href","isTrackerInternalPanel","__trackerInternalPanel","getPageTitle","document","title","debounce","func","wait","timeout","clearTimeout","setTimeout","throttle","previous","remaining","deepClone","deepCloneWithRefs","visited","__circular","getTime","cloned","map","item","clonedObj","prototype","hasOwnProperty","call","normalizeClassName","baseVal","getElementPath","path","nodeType","Node","ELEMENT_NODE","selector","nodeName","id","unshift","normalizedClassName","classes","trim","split","cls","join","sibling","nth","previousElementSibling","getElementInfo","text","textContent","CustomTracker","track","eventName","properties","timestamp","url","Sampler","shouldSample","shouldSampleCritical","isCritical","Deduplicator","click","exposure","performance","pageview","input","custom","isDuplicate","getEventKey","lastTime","eventCache","cacheTimeout","cacheTimeouts","defaultCacheTimeout","cleanExpiredCache","parts","elementPath","position","tolerance","x","floor","y","valueStr","valueHash","simpleHash","valueLength","isSensitive","message","filename","lineno","colno","resourceUrl","metricType","metrics","startTime","duration","apiUrl","method","fullUrl","propsStr","JSON","stringify","timeWindow","str","hash","charCodeAt","abs","timeoutValues","values","expireTime","max","time","zero$1","buf","len","LITERALS$1","L_CODES$1","D_CODES$1","MAX_BITS$1","extra_lbits","Uint8Array","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","_dist_code","_length_code","MAX_MATCH$1","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","max_code","d_code","dist","put_short","s","w","pending_buf","pending","send_bits","bi_valid","bi_buf","send_code","c","tree","bi_reverse","code","res","gen_codes","bl_count","next_code","bits","n","init_block","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","sym_next","matches","bi_windup","smaller","m","_n2","_m2","pqdownheap","v","heap","j","heap_len","compress_block","ltree","dtree","lc","extra","sx","sym_buf","build_tree","desc","stree","heap_max","base","h","xbits","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","count","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block$1","stored_len","last","subarray","trees","_tr_init","LENGTH_CODES$1","tr_static_init","l_desc","d_desc","bl_desc","_tr_stored_block","_tr_flush_block","opt_lenb","static_lenb","max_blindex","level","strm","data_type","block_mask","detect_data_type","BL_CODES$1","build_bl_tree","strategy","lcodes","dcodes","blcodes","rank","send_all_trees","_tr_tally","sym_end","_tr_align","STATIC_TREES","bi_flush","adler32_1","adler","pos","s1","s2","crcTable","Uint32Array","table","makeTable","crc32_1","crc","end","messages","constants$2","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","Z_NO_FLUSH$2","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_DEFAULT_STRATEGY$1","Z_DEFLATED$2","MAX_MATCH","MIN_LOOKAHEAD","INIT_STATE","BUSY_STATE","FINISH_STATE","err","errorCode","msg","zero","slide_hash","p","wsize","w_size","hash_size","head","prev","HASH","hash_shift","hash_mask","flush_pending","state","avail_out","output","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","b","putShortMSB","read_buf","size","avail_in","next_in","wrap","total_in","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","limit","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","_w_size","more","window_size","insert","ins_h","deflate_stored","flush","left","have","min_block","pending_buf_size","used","high_water","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","configuration_table","DeflateState","status","gzhead","gzindex","last_flush","w_bits","hash_bits","Uint16Array","HEAP_SIZE","MAX_BITS","lit_bufsize","deflateStateCheck","deflateResetKeep","deflateReset","ret","deflateInit2","windowBits","memLevel","deflate_1$2","deflateInit","deflateSetHeader","deflate","old_flush","header","level_flags","hcrc","comment","os","beg","copy","gzhead_extra","bstate","deflate_huff","deflate_rle","deflateEnd","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","next","deflateInfo","_has","common","sources","arguments","source","shift","TypeError","chunks","l","result","chunk","STR_APPLY_UIA_OK","fromCharCode","apply","__","_utf8len","q","strings","TextEncoder","encode","c2","m_pos","str_len","buf_len","TextDecoder","decode","utf16buf","c_len","buf2binstring","zstream","toString$1","Z_NO_FLUSH$1","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFLATED$1","Deflate$1","chunkSize","opt","gzip","ended","Error","dict","_dict_set","deflate$1","deflator","flush_mode","_flush_mode","onData","onEnd","deflate_1$1","Deflate","deflateRaw","BAD$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","from","from_source","lencode","distcode","lenbits","distbits","top","dolen","mode","sane","MAXBITS","lbase","lext","dbase","dext","inftrees","lens","lens_index","codes","table_index","work","incr","fill","low","mask","sym","root","curr","drop","huff","offs","here_bits","here_op","here_val","Z_FINISH$1","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","HEAD","DICT","TYPE","TYPEDO","COPY_","LEN_","LEN","CHECK","BAD","zswap32","InflateState","havedict","flags","check","total","wbits","offset","ncode","nlen","ndist","lendyn","distdyn","back","was","inflateStateCheck","inflateResetKeep","Int32Array","inflateReset","inflateReset2","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","src","inflate_1$2","inflateInit","inflate","put","last_bits","last_op","last_val","hbuf","order","inf_leave","done","xflags","extra_len","inflateEnd","inflateGetHeader","inflateSetDictionary","dictid","inflateInfo","gzheader","Inflate$1","to","inflate$1","inflator","last_avail_out","next_out_utf8","tail","utf8str","inflate_1$1","Inflate","inflateRaw","ungzip","pako","constants","Compressor","compress","compressed","btoa","binaryString","Buffer","decompress","compressedData","binaryData","atob","buffer","shouldCompress","ProcessorPipeline","stages","process","context","currentEvent","stage","SampleStage","sampler","DeduplicateStage","deduplicator","enableDeduplication","CompressStage","compressor","processedEvent","propertiesStr","compressedProperties","DataProcessor","defaultOptions","pipeline","processBatch","serialize","deserialize","parse","getAbortController","AbortController","AbortSignalPolyfill","abort","aborted","signal","async","fetchPolyfill","init","Promise","resolve","reject","xhr","XMLHttpRequest","open","headers","Headers","setRequestHeader","DOMException","addEventListener","checkAborted","setInterval","clearInterval","cleanup","onload","headersString","getAllResponseHeaders","line","responseHeaders","responseText","responseUrl","responseURL","responseStatus","response","ok","statusText","redirected","body","bodyUsed","arrayBuffer","ArrayBuffer","blob","Blob","formData","FormData","json","clone","onerror","ontimeout","send","universalRequest","controller","timeoutId","fetchFn","fetch","getFetch","contentType","includes","post","request","RetryHandler","execute","initialDelay","maxDelay","shouldRetry","actualMaxRetries","lastError","delay","attempt","sleep","ms","isRetryableError","Sender","retryHandler","defaultMaxRetries","enableRetry","maxRetriesOpt","sendBatch","setServerUrl","setMaxRetries","supportsLongTaskObserver","PerformanceObserver","observe","entryTypes","disconnect","supportsIntersectionObserver","IntersectionObserver","supportsIndexedDBApi","indexedDB","removeItem","storage","memoryStorage","indexedDBStorage","db","initPromise","dbName","onsuccess","onupgradeneeded","objectStoreNames","contains","storeName","createObjectStore","keyPath","autoIncrement","createIndex","unique","transaction","onabort","objectStore","store","getRequest","updatedAt","deleteRequest","results","OfflineStorage","maxSize","useIndexedDB","warn","save","saveQueue","then","doSave","catch","storageKey","sanitizeEvent","fallbackError","safeEvent","safeStringify","sanitizeObject","sanitized","remove","allEvents","eventMap","remainingEvents","success","getCount","EventQueue","queue","onBatchComplete","eventCallbacks","isEmpty","drain","callbackMap","FlushScheduler","onFlush","schedule","queueLength","timer","getTimer","setOptions","DeliveryCoordinator","sender","offlineRecoveryManager","deliverBatch","persistFailedEvents","dispatchCallbacks","callbackEvents","OfflineRecoveryManager","offlineStorage","recoverStoredEvents","batch","BatchSender","eventQueue","deliveryCoordinator","flushScheduler","getState","isInitialized","ensureInitialized","addAsync","isProcessing","flushPromise","setBatchOptions","getOfflineEvents","getOfflineEventCount","clearOfflineStorage","destroy","destroyAsync","PluginLifecycle","canInstall","plugin","installedPlugins","trackerInstance","install","uninstall","pluginName","PluginManager","lifecycle","setTrackerInstance","use","plugins","unuse","BehaviorAnalysis","analyzePageView","pageViews","getMetrics","uniqueDevices","uniqueSessions","totalDuration","paths","pv","uv","sessions","avgDuration","getVisitPath","getDuration","reset","PerformanceAlertEngine","evaluate","alertRules","alerts","triggeredAlerts","rule","enabled","resolveMetricValue","isTriggered","alert","createAlert","onAlert","metric","ttfb","operator","threshold","ruleId","toFixed","resolved","PerformanceCleanupScheduler","onCleanup","stop","PerformanceMetricsAggregator","build","endTime","filteredEvents","navigationEvents","resourceEvents","longTaskEvents","navigation","dns","average","tcp","ssl","domParse","resourceLoad","domContentLoaded","load","resources","buildResourceMetrics","longTasks","buildLongTaskMetrics","timeRange","avgLoadTime","maxLoadTime","totalSize","byType","loadTimes","reduce","a","sum","typeMap","resourceType","times","typeEvents","maxDuration","recent","durations","PerformanceMonitorStorage","dataStr","PerformanceMonitor","enableAlerts","defaultAlertRules","getDefaultAlertRules","maxStoredEvents","retentionTime","cleanupScheduler","alertEngine","metricsAggregator","handler","handlePerformanceEvent","_performanceHandler","loadHistoryData","startCleanupTimer","checkAlertRules","saveToStorage","generateReport","filteredAlerts","summary","pageLoads","avgTTFB","avgTotalLoadTime","totalLongTasks","totalResources","trends","generateTrends","generatedAt","hourMetrics","getAlerts","addAlertRule","removeAlertRule","findIndex","r","getAlertRules","resolveAlert","alertId","find","cutoffTime","PERFORMANCE_PANEL_HTML","OFFLINE_STORAGE_VIEWER_HTML","PanelManager","__trackerInstance","openPerformancePanel","win","write","close","openOfflineStorageViewer","getPerformancePanelHTML","getOfflineStorageViewerHTML","TrackerEventEnricher","enrich","userInfo","configUserId","mergedProperties","finalProperties","enriched","TRACKER_EVENT_TYPES","TrackerEventBusBridge","setup","handlers","teardown","attachToWindow","__trackerEventBus","TrackerConfigCoordinator","configStore","batchSender","ViewTracker","trackPageView","setupSPARouter","setupPageLifecycle","isTracking","currentUrl","referrer","shouldUpdateUrl","lastPageViewTime","minPageViewInterval","visibleDuration","totalHiddenTime","popstateHandler","historyProto","history","_trackerPushStateWrapped","originalPushState","pushState","bind","_originalPushState","pendingUrlCheck","_trackerReplaceStateWrapped","originalReplaceState","replaceState","_originalReplaceState","visibilityChangeHandler","isHidden","hidden","isVisible","hiddenStartTime","beforeUnloadHandler","finalDuration","finalEvent","removeEventListener","extractVueComponentInfo","extractProps","extractAttrs","extractValue","extractLabel","naiveUIComponentName","componentType","disabled","Boolean","label","multiple","isNaiveUIComponent","NAIVE_UI_COMPONENT_TYPES","extractNaiveUIComponentInfo","iconElement","querySelector","hasIcon","classList","hasAttribute","loading","enhanceButtonInfo","inputElement","placeholder","inputType","enhanceInputInfo","selectedElement","selectedText","filterable","enhanceSelectInfo","checked","labelElement","labelText","enhanceCheckboxRadioInfo","enhanceSwitchInfo","requiredElement","required","enhanceFormInfo","extractDomDataComponentInfo","getAttribute","parsed","hasClassPrefix","prefix","guessUiLibComponentInfo","matched","visit","walkParentElements","candidate","guessAntdComponent","createUserAdapterResolver","userAdapters","frameAdapters","adapters","sort","adapter","createBuiltinFrameworkResolver","extractOpts","naive","vue","domDataResolver","uiLibHeuristicsResolver","resolveClickComponentInfo","getConfig","resolvers","resolveWithResolvers","ClickEventFactory","create","clickEvent","elementInfo","interactionType","configGetter","nativeEvent","componentError","ClickEventDispatcher","dispatch","bus","task","requestIdleCallback","TouchInteractionTracker","clickThresholdMs","distanceThresholdPx","recordTouchStart","touch","lastTouch","clientX","clientY","resolveTouchEnd","isTap","deltaX","deltaY","deltaTime","ClickTracker","debounceTime","eventFactory","clickHandler","handleClick","touchStartHandler","handleTouch","touchEndHandler","passive","capture","touches","touchInteractionTracker","changedTouches","endTouch","touchTimeout","processTouchInteraction","eventDispatcher","touchEvent","processClick","getClickEvent","ExposureTracker","rootMargin","observer","entry","handleIntersection","observeElements","initScrollFallback","elements","querySelectorAll","cachedElements","lastCacheUpdate","unobserve","exposedElements","exposureMap","intersectionRatio","isIntersecting","triggerExposure","exposureEvent","getExposureElements","CACHE_UPDATE_INTERVAL","checkExposure","rect","getBoundingClientRect","viewportHeight","innerHeight","documentElement","clientHeight","viewportWidth","innerWidth","clientWidth","visibleArea","bottom","right","totalArea","height","width","scrollFallbackHandler","resizeFallbackHandler","InputTracker","skipEmptyInput","inputDebounceTime","selectDebounceTime","inputHandler","handleInput","changeHandler","handleChange","mergeComponentValueIntoInput","inputEvent","processInput","isSensitiveField","processChange","selectElement","HTMLInputElement","keyword","sensitiveKeywords","AutoTracker","viewTracker","clickTracker","exposureTracker","inputTracker","enableClick","enableExposure","enableInput","clickDebounceTime","getViewTracker","getClickTracker","getExposureTracker","getInputTracker","ErrorTracker","unifiedErrorHandler","ErrorEvent","handleJSError","handleResourceError","promiseErrorHandler","handlePromiseError","errorEvent","errorType","stack","emitError","reason","HTMLImageElement","HTMLScriptElement","HTMLLinkElement","HTMLAudioElement","HTMLVideoElement","getErrorKey","errorKey","errorCache","cleanExpiredErrorCache","trackError","errorInfo","PerformanceTracker","readyState","collectNavigationTiming","collectResourceTiming","observeLongTasks","navigationTimingCollected","timing","getEntriesByType","domainLookupEnd","domainLookupStart","connectEnd","connectStart","secureConnectionStart","responseStart","requestStart","responseEnd","domInteractive","loadEventStart","domContentLoadedEventEnd","loadEventEnd","fetchStart","performanceEvent","emitPerformance","resource","resourceCache","resourceDebounceTime","transferSize","initiatorType","cleanExpiredResourceCache","throttledEmitLongTask","taskKey","longTaskCache","longTaskDebounceTime","cleanExpiredLongTaskCache","list","getEntries","entryType","collectMetrics","SessionReplayBudget","maxTotalBytes","Number","POSITIVE_INFINITY","getStoppedByBudget","stoppedByBudget","setStoppedByBudget","stopped","estimateTotalBytes","totalBytes","snapshot","snapshots","html","mutations","interaction","interactions","estimateInteractionBytes","allowsWrite","extraBytes","SessionReplayInteractionLifecycle","onInteraction","scrollX","scrollY","handleScroll","recordMouseMove","throttledMouseMoveHandler","handleMouseMove","SessionReplayStore","maxSnapshots","maxMutationRecordsPerSnapshot","getSnapshots","setSnapshots","getInteractions","setInteractions","createSnapshot","hasSnapshots","planMutationsForLatestSnapshot","lastSnapshot","toAppend","nextSize","excess","dropFromNew","appendMutationsToLatestSnapshot","appendInteraction","getData","SessionReplay","mutationThrottleMs","snapshotThrottleMs","budget","interactionLifecycle","recordInteraction","withinByteBudget","isRecording","takeSnapshot","mutationHandler","recordMutations","MutationObserver","childList","subtree","attributes","attributeOldValue","characterData","outerHTML","approxBatch","TrackerFeatureRegistry","autoTracker","errorTracker","performanceTracker","sessionReplay","sessionReplayOptions","maxSessionReplaySnapshots","getAutoTracker","getErrorTracker","getPerformanceTracker","getSessionReplay","TrackerEventDispatcher","enricher","dataProcessor","behaviorAnalysis","shouldSkip","enrichedEvent","beforeSend","assign","afterSend","onError","DEFAULT_OPTIONS","recordRequestBody","recordResponseBody","maxResponseBodySize","maxRequestBodySize","onlyFailedRequests","shouldRecordUrl","RegExp","filterSensitiveFields","sensitiveFields","field","createNetworkInterceptorPlugin","originalFetch","originalXHROpen","originalXHRSend","originalXHRSetRequestHeader","requestMap","URL","urlFilter","requestId","requestBody","bodyToRead","recordBody","File","URLSearchParams","fromEntries","byteLength","readRequestBody","requestEvent","statusCode","responseBody","Response","getResponseHeader","contentLength","parseInt","clonedResponse","readResponseBody","responseSize","responseEvent","errorResponseEvent","xhrHeaders","WeakMap","xhrRequestInfo","username","password","urlString","toUpperCase","requestInfo","readystatechangeHandler","DONE","networkInterceptorPlugin","clicks","inputs","errors","customEvents","addEventTimes","profileGenerationTimes","maxEvents","enableSampling","performanceMode","asyncProcessing","useWebWorker","eventSampleRate","enablePerformanceMonitoring","performanceBudget","addEventMaxTime","profileGenerationMaxTime","_h","addEventAsync","maxQueueSize","processQueueAsync","addEventInternal","addEvent","shouldSkipForPerformance","recordPerformance","enablePerformanceMode","cleanupOldEvents","lightweightEvent","sanitizeProperties","updateIndexes","eventTypeCounts","lastEventTimestamp","isSorted","cachedProfile","performanceModeActive","eventType","eventIndexes","keepCount","removedCount","rebuildIndexes","recalculateCounts","getSequence","sequence","getEventsByType","indexes","getIndexesByType","generateProfile","cacheTimestamp","cacheTTL","filterValidIndexes","profile","totalEvents","eventTypes","userJourney","buildUserJourneyOptimized","behaviorMetrics","calculateBehaviorMetricsOptimized","generateProfileAsync","generateLightweightProfile","journey","prevTimestamp","step","action","extractAction","pageViewIndexes","uniquePages","avgPageDuration","clickCount","inputCount","errorCount","operation","performanceMetrics","getPerformanceStats","profileTimes","avgAddEventTime","avgProfileGenerationTime","p95AddEventTime","percentile","p95ProfileGenerationTime","arr","sorted","ceil","mergedConfig","angularGetComponent","customTracker","pluginManager","performanceMonitor","panelManager","eventEnricher","eventBusBridge","configCoordinator","featureRegistry","setUser","getUser","user","trackPerformance","updateConfig","getPerformanceMetrics","generatePerformanceReport","getPerformanceMonitor","getBehaviorMetrics","getSessionReplayData","vueApp","__VUE_APP__","globalProperties","$tracker","globalTracker","__TRACKER_INSTANCE__","app","tracker","enableComponentInfo","provide","mixin","mounted"],"mappings":"kMAmCO,SAASA,EAAwBC,GACtC,IAAKA,GAA6B,oBAAXC,OACrB,OAAO,KAIT,MAAMC,EAAeF,EAMrB,GAAIE,EAAYC,qBACd,OAAOD,EAAYC,qBAGrB,GAAID,EAAYE,QACd,OAAOF,EAAYE,QAIrB,IAAIC,EAA0BL,EAAQM,cAClCC,EAAQ,EAGZ,KAAOF,GAAWE,EAFD,GAEmB,CAClC,MAAMC,EAAqBH,EAK3B,GAAIG,EAAkBL,qBACpB,OAAOK,EAAkBL,qBAG3B,GAAIK,EAAkBJ,QACpB,OAAOI,EAAkBJ,QAG3BC,EAAUA,EAAQC,cAClBC,GACF,CAEA,OAAO,IACT,CAKO,SAASE,EAAiBC,qBAC/B,GAAKA,EAKL,OAAI,OAAAC,EAAAD,EAASE,eAAT,EAAAD,EAAmBE,MACdH,EAASE,SAASC,KAGvBH,EAASI,OACJJ,EAASI,QAGd,OAAAC,EAAAL,EAASM,WAAT,EAAAD,EAAeF,MACVH,EAASM,KAAKH,MAGnB,OAAAI,EAAAP,EAASM,WAAT,EAAAC,EAAeH,QACVJ,EAASM,KAAKF,QAGnB,OAAAI,EAAA,OAAAC,EAAAT,EAASU,QAAT,EAAAD,EAAYH,eAAMH,MACbH,EAASU,EAAEJ,KAAKH,MAGrB,OAAAQ,EAAA,OAAAC,EAAAZ,EAASU,QAAT,EAAAE,EAAYN,eAAMF,QACbJ,EAASU,EAAEJ,KAAKF,YADzB,CAKF,CAKO,SAASS,EAAkBb,GAChC,GAAKA,EAKL,OAAIA,EAASc,OACJd,EAASc,OAGdd,EAASe,MACJf,EAASe,WADlB,CAKF,CAKO,SAASC,EAAkBhB,GAChC,GAAKA,EAKL,OAAIA,EAASiB,OACJjB,EAASiB,OAGdjB,EAASkB,MACJlB,EAASkB,WADlB,CAKF,CAKO,SAASC,EAAkBnB,GAChC,IAAKA,EACH,OAIF,MAAMe,EAAQF,EAAkBb,GAChC,GAAIe,EAAO,CACT,GAAI,UAAWA,EACb,OAAOA,EAAMK,MAEf,GAAI,eAAgBL,EAClB,OAAOA,EAAMM,UAEjB,CAGA,GAAIrB,EAASsB,WAAY,CACvB,GAAI,UAAWtB,EAASsB,WACtB,OAAOtB,EAASsB,WAAWF,MAE7B,GAAI,eAAgBpB,EAASsB,WAC3B,OAAOtB,EAASsB,WAAWD,UAE/B,CAGA,GAAIrB,EAASuB,IAAK,CAChB,GAAI,UAAWvB,EAASuB,IACtB,OAAOvB,EAASuB,IAAIH,MAEtB,GAAI,eAAgBpB,EAASuB,IAC3B,OAAOvB,EAASuB,IAAIF,UAExB,CAGF,CAKA,MAAMG,EAAiB,CAAC,WAAY,QAAS,SAAU,MAAO,OAAQ,aAAc,OAE7E,SAASC,EAAoBC,GAClC,IAAKA,EACH,OAGF,MAAMC,EAAoC,CAAA,EAE1C,IAAA,MAAYC,EAAKR,KAAUS,OAAOC,QAAQJ,GAAO,CAC/C,MAAMK,EAAWH,EAAII,cAyDrB,GArDoBR,EAAeS,KAAKC,IACtC,MAAMC,EAAoBD,EAAaF,cAEvC,GAAID,IAAaI,EAAmB,OAAO,EAG3C,MAAMC,EAAQL,EAASM,QAAQF,GAC/B,GAAIC,EAAQ,EAAG,OAAO,EAGtB,MAAME,EAAWF,EAAQ,EAAIR,EAAIQ,EAAQ,GAAK,KACxCG,EAAWH,EAAQD,EAAkBK,OAASZ,EAAIY,OACpDZ,EAAIQ,EAAQD,EAAkBK,QAC9B,KAGJ,GAAc,IAAVJ,GAA4B,OAAbG,IACA,MAAbA,GAAiC,MAAbA,GAAoB,QAAQE,KAAKF,IACvD,OAAO,EAKX,GAAIH,IAAUL,EAASS,OAASL,EAAkBK,QAAuB,OAAbF,EAAmB,CAC7E,GAAiB,MAAbA,GAAiC,MAAbA,GAAoB,QAAQG,KAAKH,GACvD,OAAO,EAGT,MAAMI,EAAwBd,EAAIe,UAAUP,EAAOA,EAAQD,EAAkBK,QAC7E,GAAI,QAAQC,KAAKC,EAAsB,IACrC,OAAO,CAEX,CAGA,GAAIN,EAAQ,GAAKA,EAAQL,EAASS,OAASL,EAAkBK,QAC1C,OAAbF,GAAkC,OAAbC,EAAmB,CAE1C,IAAkB,MAAbD,GAAiC,MAAbA,GAAoB,QAAQG,KAAKH,MACxC,MAAbC,GAAiC,MAAbA,GAAoB,QAAQE,KAAKF,IACxD,OAAO,EAGT,MAAMG,EAAwBd,EAAIe,UAAUP,EAAOA,EAAQD,EAAkBK,QAC7E,GAAI,QAAQC,KAAKC,EAAsB,IACrC,OAAO,CAEX,CAGF,OAAO,IAKP,GAAc,OAAVtB,EACFO,EAASC,GAAO,aAClB,SAAqB,IAAVR,EAET,SAEAO,EAASC,GAAO,WAAWR,IAC7B,MACF,GAA4B,iBAAVA,GAAgC,OAAVA,GAAmBwB,MAAMC,QAAQzB,GAMvEO,EAASC,GAAOR,MAN+D,CAE/E,MAAM0B,EAAiBrB,EAAoBL,GAE3CO,EAASC,QAA0B,IAAnBkB,EAA+BA,EAAiB,CAAA,CAClE,CAGF,CAEA,OAAOnB,CACT,CAMO,SAASoB,EAAyBzD,WACvC,IAAKA,EACH,OAIF,MAAM0D,EAAY1D,EAAQ0D,UAC1B,GAAyB,iBAAdA,EAAwB,CACjC,MAAMC,EAAQD,EAAUC,MAAM,mBAC9B,GAAIA,EACF,MAAO,KAAKA,EAAM,IAEtB,CAGA,MAAMC,EAAU,OAAAjD,EAAAX,EAAQ4D,cAAR,EAAAjD,EAAiB+B,cACjC,GAAIkB,GAAWA,EAAQC,WAAW,MAChC,OAAOD,EAIT,IAAIvD,EAA0BL,EAAQM,cAClCC,EAAQ,EAGZ,KAAOF,GAAWE,EAFD,GAEmB,CAClC,MAAMuD,EAAkBzD,EAAQqD,UAChC,GAA+B,iBAApBI,EAA8B,CACvC,MAAMH,EAAQG,EAAgBH,MAAM,mBACpC,GAAIA,EACF,MAAO,KAAKA,EAAM,IAEtB,CAEA,MAAMI,EAAgB,OAAAhD,EAAAV,EAAQuD,cAAR,EAAA7C,EAAiB2B,cACvC,GAAIqB,GAAiBA,EAAcF,WAAW,MAC5C,OAAOE,EAGT1D,EAAUA,EAAQC,cAClBC,GACF,CAGF,CCxUO,SAASyD,EACdC,GAEA,MAAO,CACLC,gBAAUD,WAAKC,WAAY,EAC3BC,eAASF,WAAKE,UAAW,GACzBC,sBAAgBH,WAAKG,kBAAkB,EAE3C,CAEA,SAASC,EACPC,EACAC,EACAhE,EACAiE,GAEA,GAAIjE,EAAQgE,EAAOL,SACjB,MAAO,cAET,GAAII,QACF,OAAOA,EAET,MAAMG,SAAWH,EACjB,GAAU,aAANG,EACF,OAAOF,EAAOH,oBAAiB,EAAY,aAE7C,GAAU,WAANK,GAAwB,WAANA,EACpB,OAAOC,OAAOJ,GAEhB,GAAU,WAANG,EACF,OAAOH,EAET,GAAIE,EAAKG,IAAIL,GACX,MAAO,aAET,GAAIhB,MAAMC,QAAQe,GAAM,CACtBE,EAAKI,IAAIN,GACT,MAAMO,EAAMC,KAAKC,IAAIT,EAAIpB,OAAQqB,EAAOJ,SAClCa,EAAiB,GACvB,IAAA,IAASC,EAAI,EAAGA,EAAIJ,EAAKI,IACvBD,EAAIE,KAAKb,EAAcC,EAAIW,GAAIV,EAAQhE,EAAQ,EAAGiE,IAEpD,OAAOQ,CACT,CACAR,EAAKI,IAAIN,GACT,MAAMa,EAAMb,EACNc,EAAO7C,OAAO6C,KAAKD,GAAKE,MAAM,EAAGd,EAAOJ,SACxCa,EAA+B,CAAA,EACrC,IAAA,MAAWM,KAAKF,EACdJ,EAAIM,GAAKjB,EAAcc,EAAIG,GAAIf,EAAQhE,EAAQ,EAAGiE,GAEpD,OAAOQ,CACT,CAEO,SAASO,EACdC,EACAjB,GAEA,IAAKiB,GAAmC,IAA5BjD,OAAO6C,KAAKI,GAAKtC,OAC3B,OAEF,IAAIb,EACJ,IACEA,EAAWF,EAAoBqD,EACjC,CAAA,MACEnD,EAAWmD,CACb,CACA,IAAKnD,GAA6C,IAAjCE,OAAO6C,KAAK/C,GAAUa,OACrC,OAGF,OAAOmB,EAAchC,EAAUkC,EAAQ,MADtBkB,QAEnB,CChFO,SAASC,EAAmBC,GACjC,OAAc,MAAVA,EACK,KAELA,aAAkBC,QACbD,EAELA,aAAkBE,MAAQF,aAAkBG,QACvCH,EAAOrF,cAET,IACT,CCXA,MAAMyF,EAAkB,kBAsBjB,SAASC,EAAoBC,GAClC,MAAM3D,EArBD,SAA4B4D,GACjC,IACE,MAAMC,MAAYC,IAClB,IAAA,MAAWd,KAAK/C,OAAO6C,KAAKc,GAC1BC,EAAMvB,IAAIU,GAEZ,IAAA,MAAWA,KAAK/C,OAAO8D,oBAAoBH,GACzCC,EAAMvB,IAAIU,GAEZ,IAAA,MAAWA,KAAKa,EACd,GAAIJ,EAAgB5C,KAAKmC,GACvB,OAAOA,CAGb,CAAA,MAEA,CACA,OAAO,IACT,CAGcgB,CAAmBL,GAC/B,IAAK3D,EACH,OAAO,KAET,IAEE,OADW2D,EAA0C3D,IACzC,IACd,CAAA,MACE,OAAO,IACT,CACF,CChBA,SAASiE,EAAoB9B,EAAYlE,EAAQ,GAC/C,GAAIA,EALa,EAMf,OAAO,KAET,GAAS,MAALkE,EACF,OAAO,KAET,GAAiB,mBAANA,EACT,OAAOA,EAET,GAAiB,iBAANA,EACT,OAAOA,EAET,GAAiB,iBAANA,GAAwB,OAANA,EAAY,CACvC,MAAM+B,EAAI/B,EACV,GAAsB,mBAAX+B,EAAExF,MAAyC,iBAAXwF,EAAExF,KAC3C,OAAOuF,EAAoBC,EAAExF,KAAMT,EAAQ,GAE7C,GAAwB,mBAAbiG,EAAEC,OACX,OAAOD,EAAEC,MAEb,CACA,OAAO,IACT,CAEA,SAASC,EAA0BC,GACjC,OAAOJ,EAAoBI,EAAE3F,MAAQ2F,EAAEC,YACzC,CAEA,SAASC,EAA4BF,GAEnC,MAAuB,mBADVD,EAA0BC,EAEzC,CAsCO,SAASG,EAA4BC,EAAqBC,GAC/D,IACE,MAAMC,EAjCH,SAA8BF,EAAqBG,GACxD,IAAI7G,EAAmB0G,EACnBI,EAAO,EACX,KAAkB,MAAX9G,GAAmB8G,EAAOD,GAAc,CAC7C,MAAMP,EAAItG,EACV,GAAIwG,EAA4BF,GAC9B,OAAOA,EAETtG,EAAUsG,EAAES,OACZD,GACF,CACA,OAAO,IACT,CAqBqBE,CAAqBN,EAAYC,EAAKE,cACvD,IAAKD,EACH,OAEF,MAAMK,EAAOZ,EAA0BO,GACvC,GAAoB,mBAATK,EACT,OAEF,MAAMzG,EA9CV,SAA0B0G,GACxB,MAAMC,EAAQD,EACd,OAAOC,EAAMC,aAAeD,EAAM3G,MAAQ,WAC5C,CA2CiB6G,CAAiBJ,GACxBK,EA5BV,SAAyBhB,GACvB,MAAMlF,EAASkF,EAAEiB,eAAiBjB,EAAEkB,aACpC,IAAKpG,GAA0B,iBAAVA,EACnB,MAAO,CAAA,EAET,MAAMqG,EAAgC,IAAKrG,GAI3C,cAHOqG,EAAKC,gBACLD,EAAKxF,WACLwF,EAAKE,IACLF,CACT,CAkBqBG,CAAgBhB,GAEjC,MAAO,CACLiB,cAAerH,EACf4G,YAAa5G,EACbY,MAJY8D,EAAyBoC,EAAUX,EAAKzC,QAMxD,CAAA,MACE,MACF,CACF,CC3FO,SAAS4D,EAAwBC,EAAoC,IAC1E,MAAMC,EAAWD,EAAQC,UALF,GAMjBC,EAAkBF,EAAQE,iBALR,GAMlBpB,EAAekB,EAAQlB,cALJ,GAOzB,MAAO,CACLrG,KAAM,cACNwH,WACA,oBAAAE,CAAqBtG,SACnB,IACE,MAAMgE,EAAKP,EAAmBzD,EAAI0D,QAClC,IAAKM,EACH,OAEF,MAAM1B,EAASP,EAAoB/B,EAAIuG,cAAcC,eAC/CC,ED8EP,SACLC,EACAL,EACApB,EACA3C,GAEA,IACE,MAAMqE,EDlFH,SACLC,EACA3E,EACA4E,GAEA,IAAIC,EAAsBF,EACtBtI,EAAQ,EACZ,KAAc,MAAPwI,GAAexI,GAAS2D,GAAU,CACvC,MAAM0E,EAAQE,EAASC,GACvB,GAAIH,EACF,OAAOA,EAETG,EAAMA,EAAIzI,cACVC,GACF,CACA,OAAO,IACT,CCkEkByI,CAAsBL,EAAcL,EAAiBtC,GACnE,IAAK4C,EACH,OAEF,OAAO9B,EAA4B8B,EAAO,CAAE1B,eAAc3C,UAC5D,CAAA,MACE,MACF,CACF,CC7FqB0E,CAAyBhD,EAAIqC,EAAiBpB,EAAc3C,GACzE,IAAKmE,EACH,OAEF,MAAMQ,EAAkB,OAAAvI,EAAAsB,EAAIkH,YAAJ,EAAAxI,EAAWK,KAOnC,OANIkI,IACFR,EAAKU,UAAY,IACZV,EAAKU,UACRF,oBAGGR,CACT,CAAA,MACE,MACF,CACF,EAEJ,CCdA,SAASW,EACPC,EACA/E,GAEA,MAAMgF,EAAOD,EAAKE,YACZtB,GACJ,MAAAqB,OAAA,EAAAA,EAAM1I,OAAsB,WAAd0I,EAAK1I,MAAmC,KAAd0I,EAAK1I,KAAc0I,EAAK1I,KAAO,UACnEuE,EAAO7C,OAAO6C,KAAKkE,GAAMG,OAAOnE,IAAMA,EAAEzB,WAAW,MAAMwB,MAAM,EAAGd,EAAOJ,SACzEqB,EAA+B,CAAA,EACrC,IAAA,MAAWF,KAAKF,EACdI,EAAIF,GAAMgE,EAAiChE,GAG7C,MAAO,CACL4C,gBACAT,YAAaS,EACbzG,MAJY8D,EAAyBC,EAAKjB,GAM9C,CAEO,SAASmF,EAA0BtB,EAAsC,IAC9E,MAAMC,EAAWD,EAAQC,UAvCF,GAwCjBC,EAAkBF,EAAQE,iBAvCR,GAyCxB,MAAO,CACLzH,KAAM,cACNwH,WACA,oBAAAE,CAAqBtG,SACnB,IACE,MAAMgE,EAAKP,EAAmBzD,EAAI0D,QAClC,IAAKM,EACH,OAEF,MAAM0D,EAhDd,SACEvB,GAEA,GAAIA,EAAQwB,aACV,OAAOxB,EAAQwB,aAEjB,GAAIxB,EAAQyB,mBAAoB,CAC9B,MAAMC,EAAMC,WAAmED,GAC/E,GAAgC,mBAArB,MAAAA,OAAA,EAAAA,EAAIF,cACb,OAAQI,GAAeF,EAAGF,aAAcI,IAAM,IAElD,CACA,OAAO,IACT,CAmCyBC,CAAoB7B,GACrC,IAAKuB,EACH,OAEF,MAAMpF,EAASP,EAAoB/B,EAAIuG,cAAcC,eACrD,IAAIM,EAAsB9C,EACtB1F,EAAQ,EACZ,KAAc,MAAPwI,GAAexI,GAAS+H,GAAiB,CAC9C,MAAMgB,EAAOK,EAASZ,GACtB,GAAY,MAARO,GAAgC,iBAATA,EAAmB,CAC5C,MAAMZ,EAAOW,EAA+BC,EAAM/E,GAC5C2E,EAAkB,OAAAvI,EAAAsB,EAAIkH,YAAJ,EAAAxI,EAAWK,KAOnC,OANIkI,IACFR,EAAKU,UAAY,IACZV,EAAKU,UACRF,oBAGGR,CACT,CACAK,EAAMA,EAAIzI,cACVC,GACF,CACA,MACF,CAAA,MACE,MACF,CACF,EAEJ,CC7FA,MAAM2J,EAGF,CACFC,MAAO,GACPC,eAAW,EACXC,iBAAiB,EACjBC,kBAAkB,EAClBC,wBAAwB,EACxBC,qBAAqB,EACrBC,UAAW,GACXC,UAAW,IACXC,WAAY,EACZC,sBAAsB,EACtBC,sBAAuB,IACvBC,WAAY,EACZC,mBAAmB,EACnBC,OAAQ,GACRC,SAAU,GACVC,iBAAkB,CAAA,EAClBC,mBAAmB,EACnBC,uBAAuB,EACvBC,mBAAoB,EACpBC,uBAAuB,EACvBC,uBAAuB,EACvBC,qBAAqB,EACrBC,uBAAuB,GAMzB,MAAMC,EAGJ,WAAAlC,CAAYmC,GAFJC,EAAAC,KAAA,UAGNA,KAAKF,OAAS,IACTzB,KACAyB,EACHT,iBAAkB,IACbhB,EAAcgB,oBACdS,EAAOT,kBAGhB,CAKA,GAAAY,CAAmCxJ,GACjC,OAAOuJ,KAAKF,OAAOrJ,EACrB,CAKA,MAAAyJ,GACE,MAAO,IAAKF,KAAKF,OACnB,CAKA,GAAAK,CAAmC1J,EAAQR,GACzC+J,KAAKF,OAAOrJ,GAAOR,CACrB,CAKA,MAAAmK,CAAOC,GACLL,KAAKF,OAAS,IACTE,KAAKF,UACLO,EACHhB,iBAAkB,IACbW,KAAKF,OAAOT,oBACXgB,EAAQhB,kBAAoB,CAAA,GAGtC,ECXK,MAAMiB,EAAW,IAtExB,MAAA,WAAA3C,GACUoC,EAAAC,KAAA,aAA2CO,IAAA,CAKnD,EAAAC,CAAGlD,EAAemD,GACXT,KAAKU,OAAO5H,IAAIwE,IACnB0C,KAAKU,OAAOP,IAAI7C,EAAO,IAEzB0C,KAAKU,OAAOT,IAAI3C,GAAQjE,KAAKoH,EAC/B,CAKA,GAAAE,CAAIrD,EAAemD,GACjB,IAAKT,KAAKU,OAAO5H,IAAIwE,GACnB,OAGF,IAAKmD,EAEH,YADAT,KAAKU,OAAOE,OAAOtD,GAIrB,MAAMuD,EAAYb,KAAKU,OAAOT,IAAI3C,GAC5BrG,EAAQ4J,EAAU3J,QAAQuJ,GAC5BxJ,GAAQ,GACV4J,EAAUC,OAAO7J,EAAO,EAE5B,CAKA,IAAA8J,CAAKzD,KAAkB0D,GACrB,IAAKhB,KAAKU,OAAO5H,IAAIwE,GACnB,OAGgB0C,KAAKU,OAAOT,IAAI3C,GACxB2D,QAAQR,IAChB,IACEA,KAAYO,EACd,OAASE,GACPC,QAAQD,MAAM,0CAA0C5D,MAAW4D,EACrE,GAEJ,CAKA,IAAAE,CAAK9D,EAAemD,GAClB,MAAMY,EAAU,IAAIL,KAClBP,KAAYO,GACZhB,KAAKW,IAAIrD,EAAO+D,IAElBrB,KAAKQ,GAAGlD,EAAO+D,EACjB,CAKA,KAAAC,GACEtB,KAAKU,OAAOY,OACd,GClEK,SAASC,IACd,MAAO,GAAGC,KAAKC,SAASxI,KAAKyI,SAASC,SAAS,IAAInK,UAAU,EAAG,IAClE,CAKO,SAASoK,IACd,GAAsB,oBAAXxN,OACT,OAAOmN,IAIT,GAA4B,oBAAjBM,eAAiCA,aAC1C,OAAON,IAGT,MAAM9K,EAAM,wBACZ,IAAI2I,EAA0B,KAE9B,IACEA,EAAWyC,aAAaC,QAAQrL,EAClC,OAAS0H,GAEP,OAAOoD,GACT,CAEA,IAAKnC,EAAU,CACbA,EAAWmC,IACX,IACEM,aAAaE,QAAQtL,EAAK2I,EAC5B,OAASjB,GAET,CACF,CAEA,OAAOiB,CACT,CAKO,SAAS4C,IACd,GAAsB,oBAAX5N,OACT,OAAOmN,IAIT,GAA8B,oBAAnBU,iBAAmCA,eAC5C,OAAOV,IAGT,MAAM9K,EAAM,yBACZ,IAAIyL,EAA2B,KAE/B,IACEA,EAAYD,eAAeH,QAAQrL,EACrC,OAAS0H,GAEP,OAAOoD,GACT,CAEA,IAAKW,EAAW,CACdA,EAAYX,IACZ,IACEU,eAAeF,QAAQtL,EAAKyL,EAC9B,OAAS/D,GAET,CACF,CAEA,OAAO+D,CACT,CAKO,SAASC,IACd,MAAsB,oBAAX/N,OACF,GAEFA,OAAOgO,SAASC,IACzB,CAKO,SAASC,IACd,MAAsB,oBAAXlO,UAGDA,OAA2DmO,sBACvE,CAKO,SAASC,IACd,MAAsB,oBAAXpO,OACF,GAEFqO,SAASC,OAAS,EAC3B,CAeO,SAASC,EACdC,EACAC,GAEA,IAAIC,EAAgD,KAEpD,OAAO,YAA6B9B,GAM9B8B,GACFC,aAAaD,GAEfA,EAAUE,WARI,KACZF,EAAU,KACVF,KAAQ5B,IAMkB6B,EAC9B,CACF,CAKO,SAASI,EACdL,EACAC,GAEA,IAAIC,EAAgD,KAChDI,EAAW,EAEf,OAAO,YAA6BlC,GAClC,MAAMS,EAAMD,KAAKC,MACX0B,EAAYN,GAAQpB,EAAMyB,GAE5BC,GAAa,GAAKA,EAAYN,GAC5BC,IACFC,aAAaD,GACbA,EAAU,MAEZI,EAAWzB,EACXmB,KAAQ5B,IACE8B,IACVA,EAAUE,WAAW,KACnBE,EAAW1B,KAAKC,MAChBqB,EAAU,KACVF,KAAQ5B,IACPmC,GAEP,CACF,CAMO,SAASC,EAAa9J,GAC3B,OAAO+J,EAAkB/J,EAAK,IAAIM,QACpC,CAKA,SAASyJ,EAAqB/J,EAAQgK,GACpC,GAAY,OAARhK,GAA+B,iBAARA,EACzB,OAAOA,EAIT,GAAIgK,EAAQxK,IAAIQ,GAKd,MAAO,CAAEiK,YAAY,GAGvB,GAAIjK,aAAekI,KACjB,OAAO,IAAIA,KAAKlI,EAAIkK,WAGtB,GAAIlK,aAAe7B,MAAO,CACxB6L,EAAQvK,IAAIO,GACZ,MAAMmK,EAASnK,EAAIoK,OAAYL,EAAkBM,EAAML,IAEvD,OADAA,EAAQ1C,OAAOtH,GACRmK,CACT,CAEA,GAAmB,iBAARnK,EAAkB,CAC3BgK,EAAQvK,IAAIO,GACZ,MAAMsK,EAAY,CAAA,EAClB,IAAA,MAAWnN,KAAO6C,EACZ5C,OAAOmN,UAAUC,eAAeC,KAAKzK,EAAK7C,KAC5CmN,EAAUnN,GAAO4M,EAAmB/J,EAAgC7C,GAAM6M,IAI9E,OADAA,EAAQ1C,OAAOtH,GACRsK,CACT,CAEA,OAAOtK,CACT,CAmBO,SAAS0K,EAAmBnM,GACjC,GAAyB,iBAAdA,EACT,OAAOA,EAGT,GACEA,GACqB,iBAAdA,GACP,YAAcA,EACd,CACA,MAAMoM,EAAWpM,EAAoCoM,QACrD,MAA0B,iBAAZA,EAAuBA,EAAU,EACjD,CAEA,GAAiB,MAAbpM,EACF,MAAO,GAGT,IACE,MAAM5B,EAAQ4C,OAAOhB,GACrB,MAAiB,+BAAV5B,EAAyC,GAAKA,CACvD,CAAA,MACE,MAAO,EACT,CACF,CAKO,SAASiO,EAAe/P,GAC7B,IAAKA,EACH,MAAO,GAGT,MAAMgQ,EAAiB,GAEvB,KAAOhQ,GAAWA,EAAQiQ,WAAaC,KAAKC,cAAc,CACxD,IAAIC,EAAWpQ,EAAQqQ,SAAS3N,cAEhC,GAAI1C,EAAQsQ,GAAI,CACdF,GAAY,IAAIpQ,EAAQsQ,KACxBN,EAAKO,QAAQH,GACb,KACF,CAEA,MAAMI,EAAsBX,EAAoB7P,EAA8C0D,WAC9F,GAAI8M,EAAqB,CACvB,MAAMC,EAAUD,EACbE,OACAC,MAAM,OACNlH,OAAOmH,GAAOA,EAAI1N,OAAS,GAC3B2N,KAAK,KACJJ,IACFL,GAAY,IAAIK,IAEpB,CAEA,IAAIK,EAAU9Q,EACV+Q,EAAM,EACV,KAAQD,EAAUA,EAAQE,wBACpBF,EAAQT,WAAarQ,EAAQqQ,UAC/BU,IAIAA,EAAM,IACRX,GAAY,gBAAgBW,MAG9Bf,EAAKO,QAAQH,GACbpQ,EAAUA,EAAQM,aACpB,CAEA,OAAO0P,EAAKa,KAAK,MACnB,CAKO,SAASI,EAAejR,SAM7B,OAAKA,EAIE,CACL4D,QAAS5D,EAAQ4D,QAAQlB,cACzB4N,GAAItQ,EAAQsQ,SAAM,EAClB5M,UAAWmM,EAAoB7P,EAA8C0D,iBAAc,EAC3FwN,MAAM,OAAAvQ,EAAAX,EAAQmR,sBAAaT,OAAOrN,UAAU,EAAG,YAAQ,GAPhD,CAAA,CASX,CC3UA,MAAM+N,EAIJ,KAAAC,CAAMC,EAAmBC,GAWvB,MAViC,CAC/BvQ,KAAM,SACNH,KAAM,SACNyQ,YACAE,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPkD,aAIJ,EClBF,MAAMG,EAKJ,YAAAC,CAAahH,GACX,OAAIA,GAAc,KAGdA,GAAc,IAGX7F,KAAKyI,SAAW5C,CACzB,CAKA,oBAAAiH,CAAqBC,EAAqBlH,GACxC,QAAIkH,GAGGhG,KAAK8F,aAAahH,EAC3B,ECtBF,MAAMmH,EAAN,WAAAtI,GACUoC,EAAAC,KAAA,iBAAsCO,KAEtCR,EAAAC,KAAA,gBAAwC,CAC9CkG,MAAO,IACPC,SAAU,IACVjF,MAAO,IACPkF,YAAa,IACbC,SAAU,IACVC,MAAO,IACPC,OAAQ,MAEFxG,EAAAC,KAAA,sBAA8B,IAAA,CAKtC,WAAAwG,CAAYlJ,GACV,MAAM7G,EAAMuJ,KAAKyG,YAAYnJ,GACvBoJ,EAAW1G,KAAK2G,WAAW1G,IAAIxJ,GAC/BgL,EAAMD,KAAKC,MAGjB,IAAImF,EAAe5G,KAAK6G,cAAcvJ,EAAMnI,OAAS6K,KAAK8G,oBAG1D,GAAmB,WAAfxJ,EAAMnI,MAAqB,cAAemI,EAAO,CACnD,MAAMmI,EAAYnI,EAAMmI,UACN,gBAAdA,GAA6C,iBAAdA,IACjCmB,EAAe,IAEnB,CAEA,SAAIF,GAAYjF,EAAMiF,EAAWE,KAIjC5G,KAAK2G,WAAWxG,IAAI1J,EAAKgL,GACzBzB,KAAK+G,kBAAkBtF,IAChB,EACT,CAKQ,WAAAgF,CAAYnJ,GAClB,MAAM0J,EAAkB,CAAC1J,EAAMnI,KAAMmI,EAAMtI,KAAMsI,EAAMsI,KAEvD,GAAmB,UAAftI,EAAMnI,MAAoB,gBAAiBmI,GAI7C,GAHA0J,EAAM3N,KAAKiE,EAAM2J,aAAe,IAG5B,aAAc3J,GAASA,EAAM4J,SAAU,CACzC,MAAMC,EAAY,GACZC,EAAInO,KAAKoO,MAAM/J,EAAM4J,SAASE,EAAID,GAAaA,EAC/CG,EAAIrO,KAAKoO,MAAM/J,EAAM4J,SAASI,EAAIH,GAAaA,EACrDH,EAAM3N,KAAK,GAAG+N,KAAKE,IACrB,OACF,GAA0B,aAAfhK,EAAMnI,MAAuB,gBAAiBmI,EACvD0J,EAAM3N,KAAKiE,EAAM2J,aAAe,SAClC,GAA0B,UAAf3J,EAAMnI,MAAoB,gBAAiBmI,EAAO,CAI3D,GAHA0J,EAAM3N,KAAKiE,EAAM2J,aAAe,IAG5B,UAAW3J,QAAyB,IAAhBA,EAAMrH,OAAuC,OAAhBqH,EAAMrH,MAAgB,CAEzE,MAAMsR,EAAW1O,OAAOyE,EAAMrH,OACxBuR,EAAYD,EAASlQ,OAAS,GAAKkQ,EAAS/P,UAAU,EAAG,IAAM+P,EACrEP,EAAM3N,KAAK2G,KAAKyH,WAAWD,GAC7B,KAAW,gBAAiBlK,QAA+B,IAAtBA,EAAMoK,aAEzCV,EAAM3N,KAAKR,OAAOyE,EAAMoK,cAGtB,gBAAiBpK,GAASA,EAAMqK,aAClCX,EAAM3N,KAAK,YAEf,MAAA,GAA0B,UAAfiE,EAAMnI,MAAoB,YAAamI,EAChD0J,EAAM3N,KAAKiE,EAAMsK,SAEb,aAActK,GAASA,EAAMuK,UAC/Bb,EAAM3N,KAAKiE,EAAMuK,UAEf,WAAYvK,GAASA,EAAMwK,QAC7Bd,EAAM3N,KAAKR,OAAOyE,EAAMwK,SAEtB,UAAWxK,GAASA,EAAMyK,OAC5Bf,EAAM3N,KAAKR,OAAOyE,EAAMyK,QAGtB,gBAAiBzK,GAASA,EAAM0K,aAClChB,EAAM3N,KAAKiE,EAAM0K,kBAErB,GAA0B,gBAAf1K,EAAMnI,MAA0B,eAAgBmI,EAGzD,GADA0J,EAAM3N,KAAKiE,EAAM2K,YACQ,aAArB3K,EAAM2K,YAA6B,YAAa3K,GAASA,EAAM4K,QAAS,CAE1E,MAAMF,EAAe1K,EAAM4K,QAAoCF,YAC3DA,GACFhB,EAAM3N,KAAKR,OAAOmP,GAEtB,SAAgC,aAArB1K,EAAM2K,YAA6B,YAAa3K,GAASA,EAAM4K,QAAS,CAEjF,MAAMA,EAAU5K,EAAM4K,aACI,IAAtBA,EAAQC,gBAAgD,IAArBD,EAAQE,UAC7CpB,EAAM3N,KAAK,GAAG6O,EAAQC,aAAaD,EAAQE,WAE/C,MAAW9K,EAAM2K,gBAInB,GAA0B,WAAf3K,EAAMnI,MAAqB,cAAemI,GAInD,GAHA0J,EAAM3N,KAAKiE,EAAMmI,WAGO,gBAApBnI,EAAMmI,WAAmD,iBAApBnI,EAAMmI,WAC7C,GAAInI,EAAMoI,WAAY,CACpB,MAAM9P,EAAQ0H,EAAMoI,WAEd2C,EAASzS,EAAMgQ,IAAM/M,OAAOjD,EAAMgQ,KAAO,GACzC0C,EAAS1S,EAAM0S,OAASzP,OAAOjD,EAAM0S,QAAU,GAC/CC,EAAU3S,EAAM2S,QAAU1P,OAAOjD,EAAM2S,SAAW,GAExD,GAAIF,GAAUC,GAAUC,EAEtBvB,EAAM3N,KAAKkP,GAAW,GAAGD,KAAUD,UAGnC,IACE,MAAMG,EAAWC,KAAKC,UAAUpL,EAAMoI,YACtCsB,EAAM3N,KAAKmP,EAAShR,UAAU,EAAG,KACnC,CAAA,MACEwP,EAAM3N,KAAKR,OAAOnC,OAAO6C,KAAK+D,EAAMoI,YAAYrO,QAClD,CAEJ,OAGA,GAAIiG,EAAMoI,WACR,IACE,MAAM8C,EAAWC,KAAKC,UAAUpL,EAAMoI,YAEtCsB,EAAM3N,KAAKmP,EAAShR,UAAU,EAAG,KACnC,CAAA,MAEEwP,EAAM3N,KAAKR,OAAOnC,OAAO6C,KAAK+D,EAAMoI,YAAYrO,QAClD,OAGN,GAA0B,aAAfiG,EAAMnI,KAAqB,CAEpC,MAAMwT,EAAa1P,KAAKoO,MAAM/J,EAAMqI,UAAY,KAChDqB,EAAM3N,KAAKR,OAAO8P,GACpB,CAEA,OAAO3B,EAAMhC,KAAK,IACpB,CAKQ,UAAAyC,CAAWmB,GACjB,IAAIC,EAAO,EACX,IAAA,IAASzP,EAAI,EAAGA,EAAIwP,EAAIvR,OAAQ+B,IAAK,CAEnCyP,GAASA,GAAQ,GAAKA,EADTD,EAAIE,WAAW1P,GAE5ByP,GAAcA,CAChB,CAEA,OAAO5P,KAAK8P,IAAIF,GAAMlH,SAAS,IAAInK,UAAU,EAAG,EAClD,CAKQ,iBAAAuP,CAAkBtF,GAExB,MAAMuH,EAAgBtS,OAAOuS,OAAOjJ,KAAK6G,eAInCqC,EAA0B,GAHbF,EAAc3R,OAAS,EACtC4B,KAAKkQ,OAAOH,EAAehJ,KAAK8G,qBAChC9G,KAAK8G,qBAGT,IAAA,MAAYrQ,EAAK2S,KAASpJ,KAAK2G,WAAWhQ,UACpC8K,EAAM2H,EAAOF,GACflJ,KAAK2G,WAAW/F,OAAOnK,EAG7B,CAKA,KAAA6K,GACEtB,KAAK2G,WAAWrF,OAClB;wEC/JF,SAAS+H,EAAOC,GAAO,IAAIC,EAAMD,EAAIjS,OAAQ,OAASkS,GAAO,GAAKD,EAAIC,GAAO,CAAK,CAIlF,MAiBMC,EAAkB,IAGlBC,EAAkBD,IAGlBE,EAAkB,GASlBC,EAAkB,GA2BlBC,EAAA,IACAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEpEC,EAAA,IACAD,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAE7EE,EAAA,IACAF,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEhDG,EACJ,IAAIH,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAgBxDI,EAAgB,IAAIxS,MAAA,KAC1B4R,EAAOY,GAOP,MAAMC,EAAgB,IAAIzS,MAAMiS,IAChCL,EAAOa,GAKP,MAAMC,GAAgB,IAAI1S,MAjBJ,KAkBtB4R,EAAOc,IAMP,MAAMC,GAAgB,IAAI3S,MAAM4S,KAChChB,EAAOe,IAGP,MAAME,GAAgB,IAAI7S,MAhGF,IAiGxB4R,EAAOiB,IAGP,MAAMC,GAAgB,IAAI9S,MAAMiS,GAKhC,SAASc,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElE7K,KAAKyK,YAAeA,EACpBzK,KAAK0K,WAAeA,EACpB1K,KAAK2K,WAAeA,EACpB3K,KAAK4K,MAAeA,EACpB5K,KAAK6K,WAAeA,EAGpB7K,KAAK8K,UAAeL,GAAeA,EAAYpT,MACjD,CAGA,IAAI0T,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,GAC1BpL,KAAKmL,SAAWA,EAChBnL,KAAKqL,SAAW,EAChBrL,KAAKoL,UAAYA,CACnB,CA1BA/B,EAAOkB,IA8BP,MAAMe,GAAUC,GAEPA,EAAO,IAAMpB,GAAWoB,GAAQpB,GAAW,KAAOoB,IAAS,IAQ9DC,GAAY,CAACC,EAAGC,KAGpBD,EAAEE,YAAYF,EAAEG,WAAmB,IAALF,EAC9BD,EAAEE,YAAYF,EAAEG,WAAcF,IAAM,EAAK,KAQrCG,GAAY,CAACJ,EAAGxV,EAAOoB,KAEvBoU,EAAEK,SAtIc,GAsISzU,GAC3BoU,EAAEM,QAAW9V,GAASwV,EAAEK,SAAY,MACpCN,GAAUC,EAAGA,EAAEM,QACfN,EAAEM,OAAS9V,GAzIO,GAyIcwV,EAAEK,SAClCL,EAAEK,UAAYzU,EA1II,KA4IlBoU,EAAEM,QAAW9V,GAASwV,EAAEK,SAAY,MACpCL,EAAEK,UAAYzU,IAKZ2U,GAAY,CAACP,EAAGQ,EAAGC,KAEvBL,GAAUJ,EAAGS,EAAS,EAAJD,GAAiBC,EAAS,EAAJD,EAAQ,KAS5CE,GAAa,CAACC,EAAM7C,KAExB,IAAI8C,EAAM,EACV,GACEA,GAAc,EAAPD,EACPA,KAAU,EACVC,IAAQ,UACC9C,EAAM,GACjB,OAAO8C,IAAQ,GAiIXC,GAAY,CAACJ,EAAMb,EAAUkB,KAKjC,MAAMC,EAAY,IAAI/U,MAAMkS,IAC5B,IACI8C,EACAC,EAFAN,EAAO,EAOX,IAAKK,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjCL,EAAQA,EAAOG,EAASE,EAAO,IAAO,EACtCD,EAAUC,GAAQL,EASpB,IAAKM,EAAI,EAAIA,GAAKrB,EAAUqB,IAAK,CAC/B,IAAInD,EAAM2C,EAAS,EAAJQ,EAAQ,GACX,IAARnD,IAEJ2C,EAAS,EAAJQ,GAAkBP,GAAWK,EAAUjD,KAAQA,GAItD,GAgHIoD,GAAclB,IAElB,IAAIiB,EAGJ,IAAKA,EAAI,EAAGA,EAAIjD,EAAYiD,IAAOjB,EAAEmB,UAAc,EAAJF,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAAIhD,EAAYgD,IAAOjB,EAAEoB,UAAc,EAAJH,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAtcU,GAscMA,IAAOjB,EAAEqB,QAAY,EAAJJ,GAAkB,EAE/DjB,EAAEmB,UAAUG,KAA0B,EACtCtB,EAAEuB,QAAUvB,EAAEwB,WAAa,EAC3BxB,EAAEyB,SAAWzB,EAAE0B,QAAU,GAOrBC,GAAa3B,IAEbA,EAAEK,SAAW,EACfN,GAAUC,EAAGA,EAAEM,QACNN,EAAEK,SAAW,IAEtBL,EAAEE,YAAYF,EAAEG,WAAaH,EAAEM,QAEjCN,EAAEM,OAAS,EACXN,EAAEK,SAAW,GAOTuB,GAAU,CAACnB,EAAMQ,EAAGY,EAAG5Y,KAE3B,MAAM6Y,EAAU,EAAJb,EACNc,EAAU,EAAJF,EACZ,OAAQpB,EAAKqB,GAAgBrB,EAAKsB,IAC1BtB,EAAKqB,KAAkBrB,EAAKsB,IAAiB9Y,EAAMgY,IAAMhY,EAAM4Y,IASnEG,GAAa,CAAChC,EAAGS,EAAMzS,KAK3B,MAAMiU,EAAIjC,EAAEkC,KAAKlU,GACjB,IAAImU,EAAInU,GAAK,EACb,KAAOmU,GAAKnC,EAAEoC,WAERD,EAAInC,EAAEoC,UACRR,GAAQnB,EAAMT,EAAEkC,KAAKC,EAAI,GAAInC,EAAEkC,KAAKC,GAAInC,EAAE/W,QAC1CkZ,KAGEP,GAAQnB,EAAMwB,EAAGjC,EAAEkC,KAAKC,GAAInC,EAAE/W,SAGlC+W,EAAEkC,KAAKlU,GAAKgS,EAAEkC,KAAKC,GACnBnU,EAAImU,EAGJA,IAAM,EAERnC,EAAEkC,KAAKlU,GAAKiU,GAURI,GAAiB,CAACrC,EAAGsC,EAAOC,KAKhC,IAAIzC,EACA0C,EAEA7B,EACA8B,EAFAC,EAAK,EAIT,GAAmB,IAAf1C,EAAEyB,SACJ,GACE3B,EAAyC,IAAlCE,EAAEE,YAAYF,EAAE2C,QAAUD,KACjC5C,IAA2C,IAAlCE,EAAEE,YAAYF,EAAE2C,QAAUD,OAAiB,EACpDF,EAAKxC,EAAEE,YAAYF,EAAE2C,QAAUD,KAClB,IAAT5C,EACFS,GAAUP,EAAGwC,EAAIF,IAIjB3B,EAAOhC,GAAa6D,GACpBjC,GAAUP,EAAGW,EAAO5C,EAAa,EAAGuE,GACpCG,EAAQtE,EAAYwC,GACN,IAAV8B,IACFD,GAAM3D,GAAY8B,GAClBP,GAAUJ,EAAGwC,EAAIC,IAEnB3C,IACAa,EAAOd,GAAOC,GAGdS,GAAUP,EAAGW,EAAM4B,GACnBE,EAAQpE,EAAYsC,GACN,IAAV8B,IACF3C,GAAQhB,GAAU6B,GAClBP,GAAUJ,EAAGF,EAAM2C,WAOhBC,EAAK1C,EAAEyB,UAGlBlB,GAAUP,EA1iBQ,IA0iBMsC,IAYpBM,GAAa,CAAC5C,EAAG6C,KAIrB,MAAMpC,EAAWoC,EAAKnD,SAChBoD,EAAWD,EAAKlD,UAAUX,YAC1BK,EAAYwD,EAAKlD,UAAUN,UAC3BF,EAAW0D,EAAKlD,UAAUR,MAChC,IAAI8B,EAAGY,EAEHjT,EADAgR,GAAW,EAUf,IAHAI,EAAEoC,SAAW,EACbpC,EAAE+C,SAxlBoB,IA0lBjB9B,EAAI,EAAGA,EAAI9B,EAAO8B,IACQ,IAAzBR,EAAS,EAAJQ,IACPjB,EAAEkC,OAAOlC,EAAEoC,UAAYxC,EAAWqB,EAClCjB,EAAE/W,MAAMgY,GAAK,GAGbR,EAAS,EAAJQ,EAAQ,GAAa,EAS9B,KAAOjB,EAAEoC,SAAW,GAClBxT,EAAOoR,EAAEkC,OAAOlC,EAAEoC,UAAaxC,EAAW,IAAMA,EAAW,EAC3Da,EAAY,EAAP7R,GAAqB,EAC1BoR,EAAE/W,MAAM2F,GAAQ,EAChBoR,EAAEuB,UAEElC,IACFW,EAAEwB,YAAcsB,EAAa,EAAPlU,EAAW,IASrC,IALAiU,EAAKjD,SAAWA,EAKXqB,EAAKjB,EAAEoC,UAAY,EAAcnB,GAAK,EAAGA,IAAOe,GAAWhC,EAAGS,EAAMQ,GAKzErS,EAAOuQ,EACP,GAGE8B,EAAIjB,EAAEkC,KAAK,GACXlC,EAAEkC,KAAK,GAAiBlC,EAAEkC,KAAKlC,EAAEoC,YACjCJ,GAAWhC,EAAGS,EAAM,GAGpBoB,EAAI7B,EAAEkC,KAAK,GAEXlC,EAAEkC,OAAOlC,EAAE+C,UAAY9B,EACvBjB,EAAEkC,OAAOlC,EAAE+C,UAAYlB,EAGvBpB,EAAY,EAAP7R,GAAqB6R,EAAS,EAAJQ,GAAkBR,EAAS,EAAJoB,GACtD7B,EAAE/W,MAAM2F,IAASoR,EAAE/W,MAAMgY,IAAMjB,EAAE/W,MAAM4Y,GAAK7B,EAAE/W,MAAMgY,GAAKjB,EAAE/W,MAAM4Y,IAAM,EACvEpB,EAAS,EAAJQ,EAAQ,GAAaR,EAAS,EAAJoB,EAAQ,GAAajT,EAGpDoR,EAAEkC,KAAK,GAAiBtT,IACxBoT,GAAWhC,EAAGS,EAAM,SAEbT,EAAEoC,UAAY,GAEvBpC,EAAEkC,OAAOlC,EAAE+C,UAAY/C,EAAEkC,KAAK,GA5cb,EAAClC,EAAG6C,KAIrB,MAAMpC,EAAkBoC,EAAKnD,SACvBE,EAAkBiD,EAAKjD,SACvBkD,EAAkBD,EAAKlD,UAAUX,YACjCK,EAAkBwD,EAAKlD,UAAUN,UACjCoD,EAAkBI,EAAKlD,UAAUV,WACjC+D,EAAkBH,EAAKlD,UAAUT,WACjCE,EAAkByD,EAAKlD,UAAUP,WACvC,IAAI6D,EACAhC,EAAGY,EACHb,EACAkC,EACA7T,EACA8T,EAAW,EAEf,IAAKnC,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjChB,EAAEc,SAASE,GAAQ,EAQrB,IAFAP,EAA0B,EAArBT,EAAEkC,KAAKlC,EAAE+C,UAAgB,GAAa,EAEtCE,EAAIjD,EAAE+C,SAAW,EAAGE,EAtOH,IAsOoBA,IACxChC,EAAIjB,EAAEkC,KAAKe,GACXjC,EAAOP,EAA+B,EAA1BA,EAAS,EAAJQ,EAAQ,GAAiB,GAAa,EACnDD,EAAO5B,IACT4B,EAAO5B,EACP+D,KAEF1C,EAAS,EAAJQ,EAAQ,GAAaD,EAGtBC,EAAIrB,IAERI,EAAEc,SAASE,KACXkC,EAAQ,EACJjC,GAAK+B,IACPE,EAAQT,EAAMxB,EAAI+B,IAEpB3T,EAAIoR,EAAS,EAAJQ,GACTjB,EAAEuB,SAAWlS,GAAK2R,EAAOkC,GACrB7D,IACFW,EAAEwB,YAAcnS,GAAKyT,EAAU,EAAJ7B,EAAQ,GAAaiC,KAGpD,GAAiB,IAAbC,EAAJ,CAMA,EAAG,CAED,IADAnC,EAAO5B,EAAa,EACQ,IAArBY,EAAEc,SAASE,IAAeA,IACjChB,EAAEc,SAASE,KACXhB,EAAEc,SAASE,EAAO,IAAM,EACxBhB,EAAEc,SAAS1B,KAIX+D,GAAY,CACd,OAASA,EAAW,GAOpB,IAAKnC,EAAO5B,EAAqB,IAAT4B,EAAYA,IAElC,IADAC,EAAIjB,EAAEc,SAASE,GACF,IAANC,GACLY,EAAI7B,EAAEkC,OAAOe,GACTpB,EAAIjC,IACJa,EAAS,EAAJoB,EAAQ,KAAeb,IAE9BhB,EAAEuB,UAAYP,EAAOP,EAAS,EAAJoB,EAAQ,IAAcpB,EAAS,EAAJoB,GACrDpB,EAAS,EAAJoB,EAAQ,GAAab,GAE5BC,IAjC0B,GA+Z9BmC,CAAWpD,EAAG6C,GAGdhC,GAAUJ,EAAMb,EAAUI,EAAEc,WAQxBuC,GAAY,CAACrD,EAAGS,EAAMb,KAK1B,IAAIqB,EAEAqC,EADAC,GAAU,EAGVC,EAAU/C,EAAK,GAEfgD,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZH,IACFE,EAAY,IACZC,EAAY,GAEdlD,EAAsB,GAAhBb,EAAW,GAAS,GAAa,MAElCqB,EAAI,EAAGA,GAAKrB,EAAUqB,IACzBqC,EAASE,EACTA,EAAU/C,EAAe,GAATQ,EAAI,GAAS,KAEvBwC,EAAQC,GAAaJ,IAAWE,IAG3BC,EAAQE,EACjB3D,EAAEqB,QAAiB,EAATiC,IAAwBG,EAEd,IAAXH,GAELA,IAAWC,GAAWvD,EAAEqB,QAAiB,EAATiC,KACpCtD,EAAEqB,QAAQuC,OAEDH,GAAS,GAClBzD,EAAEqB,QAAQwC,MAGV7D,EAAEqB,QAAQyC,MAGZL,EAAQ,EACRF,EAAUD,EAEM,IAAZE,GACFE,EAAY,IACZC,EAAY,GAEHL,IAAWE,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,KAUZI,GAAY,CAAC/D,EAAGS,EAAMb,KAK1B,IAAIqB,EAEAqC,EADAC,GAAU,EAGVC,EAAU/C,EAAK,GAEfgD,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZH,IACFE,EAAY,IACZC,EAAY,GAGT1C,EAAI,EAAGA,GAAKrB,EAAUqB,IAIzB,GAHAqC,EAASE,EACTA,EAAU/C,EAAe,GAATQ,EAAI,GAAS,OAEvBwC,EAAQC,GAAaJ,IAAWE,GAAtC,CAGA,GAAWC,EAAQE,EACjB,GAAKpD,GAAUP,EAAGsD,EAAQtD,EAAEqB,eAA+B,MAAVoC,QAE7B,IAAXH,GACLA,IAAWC,IACbhD,GAAUP,EAAGsD,EAAQtD,EAAEqB,SACvBoC,KAGFlD,GAAUP,EA1vBI,GA0vBQA,EAAEqB,SACxBjB,GAAUJ,EAAGyD,EAAQ,EAAG,IAEfA,GAAS,IAClBlD,GAAUP,EA3vBI,GA2vBUA,EAAEqB,SAC1BjB,GAAUJ,EAAGyD,EAAQ,EAAG,KAGxBlD,GAAUP,EA5vBI,GA4vBYA,EAAEqB,SAC5BjB,GAAUJ,EAAGyD,EAAQ,GAAI,IAG3BA,EAAQ,EACRF,EAAUD,EACM,IAAZE,GACFE,EAAY,IACZC,EAAY,GAEHL,IAAWE,GACpBE,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdd,GAsIJ,IAAIK,IAAmB,EAKvB,MAuBMC,GAAqB,CAACjE,EAAGnC,EAAKqG,EAAYC,KAM9C/D,GAAUJ,KAA0BmE,EAAO,EAAI,GAAI,GACnDxC,GAAU3B,GACVD,GAAUC,EAAGkE,GACbnE,GAAUC,GAAIkE,GACVA,GACFlE,EAAEE,YAAYxL,IAAIsL,EAAErX,OAAOyb,SAASvG,EAAKA,EAAMqG,GAAalE,EAAEG,SAEhEH,EAAEG,SAAW+D,GAoIf,IAMIG,GAAQ,CACXC,SA/KmBtE,IAGbgE,KAnlBgB,MAErB,IAAI/C,EACAD,EACApV,EACA+U,EACAb,EACJ,MAAMgB,EAAW,IAAI9U,MAAMkS,IAiB3B,IADAtS,EAAS,EACJ+U,EAAO,EAAGA,EAAO4D,GAAoB5D,IAExC,IADA9B,GAAY8B,GAAQ/U,EACfqV,EAAI,EAAGA,EAAK,GAAK9C,EAAYwC,GAAQM,IACxCtC,GAAa/S,KAAY+U,EAY7B,IAJAhC,GAAa/S,EAAS,GAAK+U,EAG3Bb,EAAO,EACFa,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA7B,GAAU6B,GAAQb,EACbmB,EAAI,EAAGA,EAAK,GAAK5C,EAAYsC,GAAQM,IACxCvC,GAAWoB,KAAUa,EAKzB,IADAb,IAAS,EACFa,EAAO1C,EAAW0C,IAEvB,IADA7B,GAAU6B,GAAQb,GAAQ,EACrBmB,EAAI,EAAGA,EAAK,GAAM5C,EAAYsC,GAAQ,EAAKM,IAC9CvC,GAAW,IAAMoB,KAAUa,EAM/B,IAAKK,EAAO,EAAGA,GAAQ9C,EAAY8C,IACjCF,EAASE,GAAQ,EAInB,IADAC,EAAI,EACGA,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KAEX,KAAOG,GAAK,KACVzC,EAAiB,EAAJyC,EAAQ,GAAa,EAClCA,IACAH,EAAS,KASX,IAHAD,GAAUrC,EAAcR,IAAe8C,GAGlCG,EAAI,EAAGA,EAAIhD,EAAWgD,IACzBxC,EAAiB,EAAJwC,EAAQ,GAAa,EAClCxC,EAAiB,EAAJwC,GAAkBP,GAAWO,EAAG,GAI/C3B,GAAgB,IAAIP,GAAeP,EAAcL,EAAaJ,IAAgBC,EAAWE,GACzFqB,GAAgB,IAAIR,GAAeN,EAAcJ,EAAa,EAAYJ,EAAWC,GACrFsB,GAAiB,IAAIT,GAAe,IAAI/S,MAAM,GAAIsS,EAAc,EAtb1C,GAiBJ,IAy5BhBkG,GACAR,IAAmB,GAGrBhE,EAAEyE,OAAU,IAAIhF,GAASO,EAAEmB,UAAW7B,IACtCU,EAAE0E,OAAU,IAAIjF,GAASO,EAAEoB,UAAW7B,IACtCS,EAAE2E,QAAU,IAAIlF,GAASO,EAAEqB,QAAS7B,IAEpCQ,EAAEM,OAAS,EACXN,EAAEK,SAAW,EAGba,GAAWlB,IAgKZ4E,iBAPwBX,GAQxBY,gBA1HyB,CAAC7E,EAAGnC,EAAKqG,EAAYC,KAM7C,IAAIW,EAAUC,EACVC,EAAc,EAGdhF,EAAEiF,MAAQ,GA1gCgB,IA6gCxBjF,EAAEkF,KAAKC,YACTnF,EAAEkF,KAAKC,UA3GY,CAACnF,IAKxB,IACIiB,EADAmE,EAAa,WAIjB,IAAKnE,EAAI,EAAGA,GAAK,GAAIA,IAAKmE,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhCpF,EAAEmB,UAAc,EAAJF,GACnC,OAj7BwB,EAs7B5B,GAAoC,IAAhCjB,EAAEmB,UAAU,KAA0D,IAAjCnB,EAAEmB,UAAU,KAChB,IAAjCnB,EAAEmB,UAAU,IACd,OAv7B0B,EAy7B5B,IAAKF,EAAI,GAAIA,EAAIlD,EAAYkD,IAC3B,GAAoC,IAAhCjB,EAAEmB,UAAc,EAAJF,GACd,OA37BwB,EAk8B5B,OAn8B4B,GAihCLoE,CAAiBrF,IAItC4C,GAAW5C,EAAGA,EAAEyE,QAIhB7B,GAAW5C,EAAGA,EAAE0E,QAUhBM,EA1MkB,CAAChF,IAErB,IAAIgF,EAgBJ,IAbA3B,GAAUrD,EAAGA,EAAEmB,UAAWnB,EAAEyE,OAAO7E,UACnCyD,GAAUrD,EAAGA,EAAEoB,UAAWpB,EAAE0E,OAAO9E,UAGnCgD,GAAW5C,EAAGA,EAAE2E,SASXK,EAAcM,GAAgBN,GAAe,GACS,IAArDhF,EAAEqB,QAAgC,EAAxB9C,EAASyG,GAAmB,GADSA,KAUrD,OAJAhF,EAAEuB,SAAW,GAAKyD,EAAc,GAAK,EAAI,EAAI,EAItCA,GA8KSO,CAAcvF,GAG5B8E,EAAY9E,EAAEuB,QAAU,EAAI,IAAO,EACnCwD,EAAe/E,EAAEwB,WAAa,EAAI,IAAO,EAMrCuD,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcb,EAAa,EAGnCA,EAAa,GAAKY,IAAsB,IAARjH,EASnCoG,GAAmBjE,EAAGnC,EAAKqG,EAAYC,GAjkCX,IAmkCnBnE,EAAEwF,UAA0BT,IAAgBD,GAErD1E,GAAUJ,KAA0BmE,EAAO,EAAI,GAAI,GACnD9B,GAAerC,EAAGxB,EAAcC,KAGhC2B,GAAUJ,KAAuBmE,EAAO,EAAI,GAAI,GAvM7B,EAACnE,EAAGyF,EAAQC,EAAQC,KAIzC,IAAIC,EASJ,IAHAxF,GAAUJ,EAAGyF,EAAS,IAAK,GAC3BrF,GAAUJ,EAAG0F,EAAS,EAAK,GAC3BtF,GAAUJ,EAAG2F,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7BxF,GAAUJ,EAAGA,EAAEqB,QAAyB,EAAjB9C,EAASqH,GAAY,GAAY,GAI1D7B,GAAU/D,EAAGA,EAAEmB,UAAWsE,EAAS,GAGnC1B,GAAU/D,EAAGA,EAAEoB,UAAWsE,EAAS,IAkLjCG,CAAe7F,EAAGA,EAAEyE,OAAO7E,SAAW,EAAGI,EAAE0E,OAAO9E,SAAW,EAAGoF,EAAc,GAC9E3C,GAAerC,EAAGA,EAAEmB,UAAWnB,EAAEoB,YAMnCF,GAAWlB,GAEPmE,GACFxC,GAAU3B,IA8Cb8F,UApCmB,CAAC9F,EAAGF,EAAM0C,KAK5BxC,EAAEE,YAAYF,EAAE2C,QAAU3C,EAAEyB,YAAc3B,EAC1CE,EAAEE,YAAYF,EAAE2C,QAAU3C,EAAEyB,YAAc3B,GAAQ,EAClDE,EAAEE,YAAYF,EAAE2C,QAAU3C,EAAEyB,YAAce,EAC7B,IAAT1C,EAEFE,EAAEmB,UAAe,EAALqB,MAEZxC,EAAE0B,UAEF5B,IAKAE,EAAEmB,UAAgD,GAArCxC,GAAa6D,GAAMzE,EAAa,MAC7CiC,EAAEoB,UAAyB,EAAfvB,GAAOC,OAGbE,EAAEyB,WAAazB,EAAE+F,SAc1BC,UAvIoBhG,IACnBI,GAAUJ,EAAGiG,EAAmB,GAChC1F,GAAUP,EAh8BQ,IAg8BMxB,GA/xBT,CAACwB,IAEG,KAAfA,EAAEK,UACJN,GAAUC,EAAGA,EAAEM,QACfN,EAAEM,OAAS,EACXN,EAAEK,SAAW,GAEJL,EAAEK,UAAY,IACvBL,EAAEE,YAAYF,EAAEG,WAAwB,IAAXH,EAAEM,OAC/BN,EAAEM,SAAW,EACbN,EAAEK,UAAY,IAsxBhB6F,CAASlG,KAuLX,IAAImG,GAzBY,CAACC,EAAOvI,EAAKC,EAAKuI,KAChC,IAAIC,EAAc,MAARF,EACNG,EAAOH,IAAU,GAAM,MACvBnF,EAAI,EAER,KAAe,IAARnD,GAAW,CAIhBmD,EAAInD,EAAM,IAAO,IAAOA,EACxBA,GAAOmD,EAEP,GACEqF,EAAMA,EAAKzI,EAAIwI,KAAS,EACxBE,EAAMA,EAAKD,EAAK,UACPrF,GAEXqF,GAAM,MACNC,GAAM,KACR,CAEA,OAAQD,EAAMC,GAAM,IA8BtB,MAeMC,GAAW,IAAIC,YAfH,MAChB,IAAIjG,EAAGkG,EAAQ,GAEf,IAAA,IAASzF,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BT,EAAIS,EACJ,IAAA,IAASjT,EAAI,EAAGA,EAAI,EAAGA,IACrBwS,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDkG,EAAMzF,GAAKT,CACb,CAEA,OAAOkG,GAIwBC,IAiBjC,IAAIC,GAdU,CAACC,EAAKhJ,EAAKC,EAAKuI,KAC5B,MAAMlZ,EAAIqZ,GACJM,EAAMT,EAAMvI,EAElB+I,IAAO,EAEP,IAAA,IAASlZ,EAAI0Y,EAAK1Y,EAAImZ,EAAKnZ,IACzBkZ,EAAOA,IAAQ,EAAK1Z,EAAmB,KAAhB0Z,EAAMhJ,EAAIlQ,KAGnC,OAAe,EAAPkZ,GAyBNE,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,wBAsBNC,GAAc,CAGhBC,WAAoB,EACpBC,gBAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EACpBC,SAAoB,EACpBC,QAAoB,EACpBC,QAAoB,EAKpBC,KAAoB,EACpBC,aAAoB,EACpBC,YAAoB,EACpBC,SAAmB,EACnBC,gBAAmB,EACnBC,cAAmB,EACnBC,aAAmB,EACnBC,aAAmB,EAInBC,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAAyB,EAGzBC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B,GAuB5B,MAAMtE,SAAEA,GAAAM,iBAAUA,GAAAC,gBAAkBA,GAAAiB,UAAiBA,GAAAE,UAAWA,IAAc3B,IAS5E4C,WAAY4B,GAAA3B,gBAAcA,GAAiBE,aAAc0B,GAAgBzB,SAAU0B,GAAYzB,QAAS0B,GACxGxB,KAAMyB,GAAQxB,aAAcyB,GAAgBtB,eAAgBuB,GAAkBtB,aAAcuB,GAAgBrB,YAAasB,GACzHlB,sBAAuBmB,GAAAlB,WACvBA,GAAAC,eAAYA,GAAAC,MAAgBA,GAAAC,QAAOA,GAASC,mBAAoBe,GAAAZ,UAChEA,GACAC,WAAYY,IACVxC,GA4BEyC,GAAY,IACZC,GAAiBD,IAIjBE,GAAiB,GAQjBC,GAAgB,IAChBC,GAAgB,IAShBC,GAAM,CAAC5E,EAAM6E,KACjB7E,EAAK8E,IAAMjD,GAASgD,GACbA,GAGHnE,GAAQvW,GACE,EAALA,GAAYA,EAAK,EAAI,EAAI,GAG9B4a,GAAQpM,IACZ,IAAIC,EAAMD,EAAIjS,OAAQ,OAASkS,GAAO,GAAKD,EAAIC,GAAO,GAQlDoM,GAAclK,IAClB,IAAIiB,EAAGY,EACHsI,EACAC,EAAQpK,EAAEqK,OAEdpJ,EAAIjB,EAAEsK,UACNH,EAAIlJ,EACJ,GACEY,EAAI7B,EAAEuK,OAAOJ,GACbnK,EAAEuK,KAAKJ,GAAMtI,GAAKuI,EAAQvI,EAAIuI,EAAQ,UAC7BnJ,GACXA,EAAImJ,EAEJD,EAAIlJ,EACJ,GACEY,EAAI7B,EAAEwK,OAAOL,GACbnK,EAAEwK,KAAKL,GAAMtI,GAAKuI,EAAQvI,EAAIuI,EAAQ,UAI7BnJ,IAKb,IAIIwJ,GAJY,CAACzK,EAAGwK,EAAM1f,KAAW0f,GAAQxK,EAAE0K,WAAc5f,GAAQkV,EAAE2K,UAavE,MAAMC,GAAiB1F,IACrB,MAAMlF,EAAIkF,EAAK2F,MAGf,IAAI/M,EAAMkC,EAAEG,QACRrC,EAAMoH,EAAK4F,YACbhN,EAAMoH,EAAK4F,WAED,IAARhN,IAEJoH,EAAK6F,OAAOrW,IAAIsL,EAAEE,YAAYkE,SAASpE,EAAEgL,YAAahL,EAAEgL,YAAclN,GAAMoH,EAAK+F,UACjF/F,EAAK+F,UAAanN,EAClBkC,EAAEgL,aAAgBlN,EAClBoH,EAAKgG,WAAapN,EAClBoH,EAAK4F,WAAahN,EAClBkC,EAAEG,SAAgBrC,EACA,IAAdkC,EAAEG,UACJH,EAAEgL,YAAc,KAKdG,GAAmB,CAACnL,EAAGmE,KAC3BU,GAAgB7E,EAAIA,EAAEoL,aAAe,EAAIpL,EAAEoL,aAAc,EAAKpL,EAAEqL,SAAWrL,EAAEoL,YAAajH,GAC1FnE,EAAEoL,YAAcpL,EAAEqL,SAClBT,GAAc5K,EAAEkF,OAIZoG,GAAW,CAACtL,EAAGuL,KACnBvL,EAAEE,YAAYF,EAAEG,WAAaoL,GASzBC,GAAc,CAACxL,EAAGuL,KAItBvL,EAAEE,YAAYF,EAAEG,WAAcoL,IAAM,EAAK,IACzCvL,EAAEE,YAAYF,EAAEG,WAAiB,IAAJoL,GAWzBE,GAAW,CAACvG,EAAMrH,EAAKtM,EAAOma,KAElC,IAAI5N,EAAMoH,EAAKyG,SAGf,OADI7N,EAAM4N,IAAQ5N,EAAM4N,GACZ,IAAR5N,EAAoB,GAExBoH,EAAKyG,UAAY7N,EAGjBD,EAAInJ,IAAIwQ,EAAKrK,MAAMuJ,SAASc,EAAK0G,QAAS1G,EAAK0G,QAAU9N,GAAMvM,GACvC,IAApB2T,EAAK2F,MAAMgB,KACb3G,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAOvI,EAAKC,EAAKvM,GAGlB,IAApB2T,EAAK2F,MAAMgB,OAClB3G,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOvI,EAAKC,EAAKvM,IAG7C2T,EAAK0G,SAAW9N,EAChBoH,EAAK4G,UAAYhO,EAEVA,IAaHiO,GAAgB,CAAC/L,EAAGgM,KAExB,IAEI3f,EACAyR,EAHAmO,EAAejM,EAAEkM,iBACjBC,EAAOnM,EAAEqL,SAGTe,EAAWpM,EAAEqM,YACbC,EAAatM,EAAEsM,WACnB,MAAMC,EAASvM,EAAEqL,SAAYrL,EAAEqK,OAASX,GACpC1J,EAAEqL,UAAYrL,EAAEqK,OAASX,IAAiB,EAExC8C,EAAOxM,EAAErX,OAET8jB,EAAQzM,EAAE0M,OACVlC,EAAQxK,EAAEwK,KAMVmC,EAAS3M,EAAEqL,SAAW5B,GAC5B,IAAImD,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzBpM,EAAEqM,aAAerM,EAAE8M,aACrBb,IAAiB,GAKfK,EAAatM,EAAE+M,YAAaT,EAAatM,EAAE+M,WAI/C,GAaE,GAXA1gB,EAAQ2f,EAWJQ,EAAKngB,EAAQ+f,KAAkBS,GAC/BL,EAAKngB,EAAQ+f,EAAW,KAAOQ,GAC/BJ,EAAKngB,KAA0BmgB,EAAKL,IACpCK,IAAOngB,KAAwBmgB,EAAKL,EAAO,GAH/C,CAaAA,GAAQ,EACR9f,IAMA,UAESmgB,IAAOL,KAAUK,IAAOngB,IAAUmgB,IAAOL,KAAUK,IAAOngB,IAC1DmgB,IAAOL,KAAUK,IAAOngB,IAAUmgB,IAAOL,KAAUK,IAAOngB,IAC1DmgB,IAAOL,KAAUK,IAAOngB,IAAUmgB,IAAOL,KAAUK,IAAOngB,IAC1DmgB,IAAOL,KAAUK,IAAOngB,IAAUmgB,IAAOL,KAAUK,IAAOngB,IAC1D8f,EAAOQ,GAOhB,GAHA7O,EAAM2L,IAAakD,EAASR,GAC5BA,EAAOQ,EAASlD,GAEZ3L,EAAMsO,EAAU,CAGlB,GAFApM,EAAEgN,YAAchB,EAChBI,EAAWtO,EACPA,GAAOwO,EACT,MAEFM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,EAC3B,CApCA,SAqCQJ,EAAYxB,EAAKwB,EAAYS,IAAUF,GAA4B,MAAjBN,GAE5D,OAAIG,GAAYpM,EAAE+M,UACTX,EAEFpM,EAAE+M,WAcLE,GAAejN,IAEnB,MAAMkN,EAAUlN,EAAEqK,OAClB,IAAIpJ,EAAGkM,EAAMhQ,EAIb,EAAG,CAkCD,GAjCAgQ,EAAOnN,EAAEoN,YAAcpN,EAAE+M,UAAY/M,EAAEqL,SAoBnCrL,EAAEqL,UAAY6B,GAAWA,EAAUxD,MAErC1J,EAAErX,OAAO+L,IAAIsL,EAAErX,OAAOyb,SAAS8I,EAASA,EAAUA,EAAUC,GAAO,GACnEnN,EAAEgN,aAAeE,EACjBlN,EAAEqL,UAAY6B,EAEdlN,EAAEoL,aAAe8B,EACblN,EAAEqN,OAASrN,EAAEqL,WACfrL,EAAEqN,OAASrN,EAAEqL,UAEfnB,GAAWlK,GACXmN,GAAQD,GAEc,IAApBlN,EAAEkF,KAAKyG,SACT,MAmBF,GAJA1K,EAAIwK,GAASzL,EAAEkF,KAAMlF,EAAErX,OAAQqX,EAAEqL,SAAWrL,EAAE+M,UAAWI,GACzDnN,EAAE+M,WAAa9L,EAGXjB,EAAE+M,UAAY/M,EAAEqN,QAzVN,EAkWZ,IARAlQ,EAAM6C,EAAEqL,SAAWrL,EAAEqN,OACrBrN,EAAEsN,MAAQtN,EAAErX,OAAOwU,GAGnB6C,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOwU,EAAM,IAInC6C,EAAEqN,SAEPrN,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOwU,EApW1B,EAoW4C,IAEtD6C,EAAEwK,KAAKrN,EAAM6C,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OAClCtN,EAAEuK,KAAKvK,EAAEsN,OAASnQ,EAClBA,IACA6C,EAAEqN,WACErN,EAAE+M,UAAY/M,EAAEqN,OA1WV,MAmXhB,OAASrN,EAAE+M,UAAYrD,IAAqC,IAApB1J,EAAEkF,KAAKyG,WAuD3C4B,GAAiB,CAACvN,EAAGwN,KAMzB,IAMI1P,EAAK2P,EAAMC,EANXC,EAAY3N,EAAE4N,iBAAmB,EAAI5N,EAAEqK,OAASrK,EAAEqK,OAASrK,EAAE4N,iBAAmB,EAM/DzJ,EAAO,EACxB0J,EAAO7N,EAAEkF,KAAKyG,SAClB,EAAG,CAOD,GAFA7N,EAAM,MACN4P,EAAQ1N,EAAEK,SAAW,IAAO,EACxBL,EAAEkF,KAAK4F,UAAY4C,EACrB,MAiBF,GAdAA,EAAO1N,EAAEkF,KAAK4F,UAAY4C,EAC1BD,EAAOzN,EAAEqL,SAAWrL,EAAEoL,YAClBtN,EAAM2P,EAAOzN,EAAEkF,KAAKyG,WACtB7N,EAAM2P,EAAOzN,EAAEkF,KAAKyG,UAElB7N,EAAM4P,IACR5P,EAAM4P,GAQJ5P,EAAM6P,IAAuB,IAAR7P,GAAa0P,IAAUzE,IAC5ByE,IAAU3E,IACV/K,IAAQ2P,EAAOzN,EAAEkF,KAAKyG,UACxC,MAMFxH,EAAOqJ,IAAUzE,IAAcjL,IAAQ2P,EAAOzN,EAAEkF,KAAKyG,SAAW,EAAI,EACpE/G,GAAiB5E,EAAG,EAAG,EAAGmE,GAG1BnE,EAAEE,YAAYF,EAAEG,QAAU,GAAKrC,EAC/BkC,EAAEE,YAAYF,EAAEG,QAAU,GAAKrC,GAAO,EACtCkC,EAAEE,YAAYF,EAAEG,QAAU,IAAMrC,EAChCkC,EAAEE,YAAYF,EAAEG,QAAU,IAAMrC,GAAO,EAGvC8M,GAAc5K,EAAEkF,MASZuI,IACEA,EAAO3P,IACT2P,EAAO3P,GAGTkC,EAAEkF,KAAK6F,OAAOrW,IAAIsL,EAAErX,OAAOyb,SAASpE,EAAEoL,YAAapL,EAAEoL,YAAcqC,GAAOzN,EAAEkF,KAAK+F,UACjFjL,EAAEkF,KAAK+F,UAAYwC,EACnBzN,EAAEkF,KAAK4F,WAAa2C,EACpBzN,EAAEkF,KAAKgG,WAAauC,EACpBzN,EAAEoL,aAAeqC,EACjB3P,GAAO2P,GAML3P,IACF2N,GAASzL,EAAEkF,KAAMlF,EAAEkF,KAAK6F,OAAQ/K,EAAEkF,KAAK+F,SAAUnN,GACjDkC,EAAEkF,KAAK+F,UAAYnN,EACnBkC,EAAEkF,KAAK4F,WAAahN,EACpBkC,EAAEkF,KAAKgG,WAAapN,EAExB,OAAkB,IAATqG,GA6CT,OArCA0J,GAAQ7N,EAAEkF,KAAKyG,SACXkC,IAIEA,GAAQ7N,EAAEqK,QACZrK,EAAE0B,QAAU,EAEZ1B,EAAErX,OAAO+L,IAAIsL,EAAEkF,KAAKrK,MAAMuJ,SAASpE,EAAEkF,KAAK0G,QAAU5L,EAAEqK,OAAQrK,EAAEkF,KAAK0G,SAAU,GAC/E5L,EAAEqL,SAAWrL,EAAEqK,OACfrK,EAAEqN,OAASrN,EAAEqL,WAGTrL,EAAEoN,YAAcpN,EAAEqL,UAAYwC,IAEhC7N,EAAEqL,UAAYrL,EAAEqK,OAEhBrK,EAAErX,OAAO+L,IAAIsL,EAAErX,OAAOyb,SAASpE,EAAEqK,OAAQrK,EAAEqK,OAASrK,EAAEqL,UAAW,GAC7DrL,EAAE0B,QAAU,GACd1B,EAAE0B,UAEA1B,EAAEqN,OAASrN,EAAEqL,WACfrL,EAAEqN,OAASrN,EAAEqL,WAIjBrL,EAAErX,OAAO+L,IAAIsL,EAAEkF,KAAKrK,MAAMuJ,SAASpE,EAAEkF,KAAK0G,QAAUiC,EAAM7N,EAAEkF,KAAK0G,SAAU5L,EAAEqL,UAC7ErL,EAAEqL,UAAYwC,EACd7N,EAAEqN,QAAUQ,EAAO7N,EAAEqK,OAASrK,EAAEqN,OAASrN,EAAEqK,OAASrK,EAAEqN,OAASQ,GAEjE7N,EAAEoL,YAAcpL,EAAEqL,UAEhBrL,EAAE8N,WAAa9N,EAAEqL,WACnBrL,EAAE8N,WAAa9N,EAAEqL,UAIflH,EA5hBoB,EAiiBpBqJ,IAAU3E,IAAgB2E,IAAUzE,IAClB,IAApB/I,EAAEkF,KAAKyG,UAAkB3L,EAAEqL,WAAarL,EAAEoL,YApiBpB,GAyiBxBsC,EAAO1N,EAAEoN,YAAcpN,EAAEqL,SACrBrL,EAAEkF,KAAKyG,SAAW+B,GAAQ1N,EAAEoL,aAAepL,EAAEqK,SAE/CrK,EAAEoL,aAAepL,EAAEqK,OACnBrK,EAAEqL,UAAYrL,EAAEqK,OAEhBrK,EAAErX,OAAO+L,IAAIsL,EAAErX,OAAOyb,SAASpE,EAAEqK,OAAQrK,EAAEqK,OAASrK,EAAEqL,UAAW,GAC7DrL,EAAE0B,QAAU,GACd1B,EAAE0B,UAEJgM,GAAQ1N,EAAEqK,OACNrK,EAAEqN,OAASrN,EAAEqL,WACfrL,EAAEqN,OAASrN,EAAEqL,WAGbqC,EAAO1N,EAAEkF,KAAKyG,WAChB+B,EAAO1N,EAAEkF,KAAKyG,UAEZ+B,IACFjC,GAASzL,EAAEkF,KAAMlF,EAAErX,OAAQqX,EAAEqL,SAAUqC,GACvC1N,EAAEqL,UAAYqC,EACd1N,EAAEqN,QAAUK,EAAO1N,EAAEqK,OAASrK,EAAEqN,OAASrN,EAAEqK,OAASrK,EAAEqN,OAASK,GAE7D1N,EAAE8N,WAAa9N,EAAEqL,WACnBrL,EAAE8N,WAAa9N,EAAEqL,UAQnBqC,EAAQ1N,EAAEK,SAAW,IAAO,EAE5BqN,EAAO1N,EAAE4N,iBAAmBF,EAAO,MAAwB,MAAwB1N,EAAE4N,iBAAmBF,EACxGC,EAAYD,EAAO1N,EAAEqK,OAASrK,EAAEqK,OAASqD,EACzCD,EAAOzN,EAAEqL,SAAWrL,EAAEoL,aAClBqC,GAAQE,IACPF,GAAQD,IAAUzE,KAAeyE,IAAU3E,IACzB,IAApB7I,EAAEkF,KAAKyG,UAAkB8B,GAAQC,KAClC5P,EAAM2P,EAAOC,EAAOA,EAAOD,EAC3BtJ,EAAOqJ,IAAUzE,IAAkC,IAApB/I,EAAEkF,KAAKyG,UACjC7N,IAAQ2P,EAAO,EAAI,EACxB7I,GAAiB5E,EAAGA,EAAEoL,YAAatN,EAAKqG,GACxCnE,EAAEoL,aAAetN,EACjB8M,GAAc5K,EAAEkF,OAIXf,EAzlBiB,EAFA,IAsmBpB4J,GAAe,CAAC/N,EAAGwN,KAEvB,IAAIQ,EACAC,EAEJ,OAAS,CAMP,GAAIjO,EAAE+M,UAAYrD,GAAe,CAE/B,GADAuD,GAAYjN,GACRA,EAAE+M,UAAYrD,IAAiB8D,IAAU3E,GAC3C,OApnBkB,EAsnBpB,GAAoB,IAAhB7I,EAAE+M,UACJ,KAEJ,CAyBA,GApBAiB,EAAY,EACRhO,EAAE+M,WAhpBQ,IAkpBZ/M,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOqX,EAAEqL,SAlpB1B,EAkpBiD,IAC7D2C,EAAYhO,EAAEwK,KAAKxK,EAAEqL,SAAWrL,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OACrDtN,EAAEuK,KAAKvK,EAAEsN,OAAStN,EAAEqL,UAOJ,IAAd2C,GAA4BhO,EAAEqL,SAAW2C,GAAehO,EAAEqK,OAASX,KAKrE1J,EAAEkO,aAAenC,GAAc/L,EAAGgO,IAGhChO,EAAEkO,cAnqBQ,EA+qBZ,GAPAD,EAASnI,GAAU9F,EAAGA,EAAEqL,SAAWrL,EAAEgN,YAAahN,EAAEkO,aAxqBxC,GA0qBZlO,EAAE+M,WAAa/M,EAAEkO,aAKblO,EAAEkO,cAAgBlO,EAAEmO,gBAAuCnO,EAAE+M,WA/qBrD,EA+qB6E,CACvF/M,EAAEkO,eACF,GACElO,EAAEqL,WAEFrL,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOqX,EAAEqL,SAprB9B,EAorBqD,IAC7D2C,EAAYhO,EAAEwK,KAAKxK,EAAEqL,SAAWrL,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OACrDtN,EAAEuK,KAAKvK,EAAEsN,OAAStN,EAAEqL,eAKQ,MAAnBrL,EAAEkO,cACblO,EAAEqL,UACJ,MAEErL,EAAEqL,UAAYrL,EAAEkO,aAChBlO,EAAEkO,aAAe,EACjBlO,EAAEsN,MAAQtN,EAAErX,OAAOqX,EAAEqL,UAErBrL,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOqX,EAAEqL,SAAW,SAanD4C,EAASnI,GAAU9F,EAAG,EAAGA,EAAErX,OAAOqX,EAAEqL,WAEpCrL,EAAE+M,YACF/M,EAAEqL,WAEJ,GAAI4C,IAEF9C,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WACT,OAxsBkB,CA4sBxB,CAEA,OADA9K,EAAEqN,OAAWrN,EAAEqL,SAAY+C,EAAkBpO,EAAEqL,SAAW+C,EACtDZ,IAAUzE,IAEZoC,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,UA/sBW,EACA,GAotBpB9K,EAAEyB,WAEJ0J,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WA1tBW,EACA,GAsuBpBuD,GAAe,CAACrO,EAAGwN,KAEvB,IAAIQ,EACAC,EAEAK,EAGJ,OAAS,CAMP,GAAItO,EAAE+M,UAAYrD,GAAe,CAE/B,GADAuD,GAAYjN,GACRA,EAAE+M,UAAYrD,IAAiB8D,IAAU3E,GAC3C,OAxvBkB,EA0vBpB,GAAoB,IAAhB7I,EAAE+M,UAAmB,KAC3B,CAyCA,GApCAiB,EAAY,EACRhO,EAAE+M,WAlxBQ,IAoxBZ/M,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOqX,EAAEqL,SApxB1B,EAoxBiD,IAC7D2C,EAAYhO,EAAEwK,KAAKxK,EAAEqL,SAAWrL,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OACrDtN,EAAEuK,KAAKvK,EAAEsN,OAAStN,EAAEqL,UAMtBrL,EAAEqM,YAAcrM,EAAEkO,aAClBlO,EAAEuO,WAAavO,EAAEgN,YACjBhN,EAAEkO,aAAeE,EAEC,IAAdJ,GAA0BhO,EAAEqM,YAAcrM,EAAEmO,gBAC5CnO,EAAEqL,SAAW2C,GAAchO,EAAEqK,OAASX,KAKxC1J,EAAEkO,aAAenC,GAAc/L,EAAGgO,GAG9BhO,EAAEkO,cAAgB,IAClBlO,EAAEwF,WAAa4C,IA1yBP,IA0yBsBpI,EAAEkO,cAA8BlO,EAAEqL,SAAWrL,EAAEgN,YAAc,QAK7FhN,EAAEkO,aAAeE,IAMjBpO,EAAEqM,aArzBQ,GAqzBoBrM,EAAEkO,cAAgBlO,EAAEqM,YAAa,CACjEiC,EAAatO,EAAEqL,SAAWrL,EAAE+M,UAtzBhB,EA6zBZkB,EAASnI,GAAU9F,EAAGA,EAAEqL,SAAW,EAAIrL,EAAEuO,WAAYvO,EAAEqM,YA7zB3C,GAm0BZrM,EAAE+M,WAAa/M,EAAEqM,YAAc,EAC/BrM,EAAEqM,aAAe,EACjB,KACQrM,EAAEqL,UAAYiD,IAElBtO,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOqX,EAAEqL,SAx0B9B,EAw0BqD,IAC7D2C,EAAYhO,EAAEwK,KAAKxK,EAAEqL,SAAWrL,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OACrDtN,EAAEuK,KAAKvK,EAAEsN,OAAStN,EAAEqL,gBAGK,MAAlBrL,EAAEqM,aAKb,GAJArM,EAAEwO,gBAAkB,EACpBxO,EAAEkO,aAAeE,EACjBpO,EAAEqL,WAEE4C,IAEF9C,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WACT,OAr0BgB,CA00BtB,MAAA,GAAW9K,EAAEwO,iBAgBX,GATAP,EAASnI,GAAU9F,EAAG,EAAGA,EAAErX,OAAOqX,EAAEqL,SAAW,IAE3C4C,GAEF9C,GAAiBnL,GAAG,GAGtBA,EAAEqL,WACFrL,EAAE+M,YACuB,IAArB/M,EAAEkF,KAAK4F,UACT,OA31BkB,OAi2BpB9K,EAAEwO,gBAAkB,EACpBxO,EAAEqL,WACFrL,EAAE+M,WAEN,CAUA,OARI/M,EAAEwO,kBAGJP,EAASnI,GAAU9F,EAAG,EAAGA,EAAErX,OAAOqX,EAAEqL,SAAW,IAE/CrL,EAAEwO,gBAAkB,GAEtBxO,EAAEqN,OAASrN,EAAEqL,SAAW+C,EAAgBpO,EAAEqL,SAAW+C,EACjDZ,IAAUzE,IAEZoC,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,UAh3BW,EACA,GAq3BpB9K,EAAEyB,WAEJ0J,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WA33BW,EACA,GAmiC1B,SAAS2D,GAAOC,EAAaC,EAAUC,EAAaC,EAAW1X,GAE7D5C,KAAKma,YAAcA,EACnBna,KAAKoa,SAAWA,EAChBpa,KAAKqa,YAAcA,EACnBra,KAAKsa,UAAYA,EACjBta,KAAK4C,KAAOA,CACd,CAEA,MAAM2X,GAAsB,CAE1B,IAAIL,GAAO,EAAG,EAAG,EAAG,EAAGlB,IACvB,IAAIkB,GAAO,EAAG,EAAG,EAAG,EAAGV,IACvB,IAAIU,GAAO,EAAG,EAAG,GAAI,EAAGV,IACxB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIV,IAEzB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIJ,IACzB,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,IAC1B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,IAC/B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,KA+BjC,SAASU,KACPxa,KAAK2Q,KAAO,KACZ3Q,KAAKya,OAAS,EACdza,KAAK2L,YAAc,KACnB3L,KAAKqZ,iBAAmB,EACxBrZ,KAAKyW,YAAc,EACnBzW,KAAK4L,QAAU,EACf5L,KAAKsX,KAAO,EACZtX,KAAK0a,OAAS,KACd1a,KAAK2a,QAAU,EACf3a,KAAKsI,OAAS2M,GACdjV,KAAK4a,YAAa,EAElB5a,KAAK8V,OAAS,EACd9V,KAAK6a,OAAS,EACd7a,KAAKmY,OAAS,EAEdnY,KAAK5L,OAAS,KAQd4L,KAAK6Y,YAAc,EAKnB7Y,KAAKiW,KAAO,KAMZjW,KAAKgW,KAAO,KAEZhW,KAAK+Y,MAAQ,EACb/Y,KAAK+V,UAAY,EACjB/V,KAAK8a,UAAY,EACjB9a,KAAKoW,UAAY,EAEjBpW,KAAKmW,WAAa,EAOlBnW,KAAK6W,YAAc,EAKnB7W,KAAK2Z,aAAe,EACpB3Z,KAAKga,WAAa,EAClBha,KAAKia,gBAAkB,EACvBja,KAAK8W,SAAW,EAChB9W,KAAKyY,YAAc,EACnBzY,KAAKwY,UAAY,EAEjBxY,KAAK8X,YAAc,EAKnB9X,KAAK2X,iBAAmB,EAMxB3X,KAAK4Z,eAAiB,EAYtB5Z,KAAK0Q,MAAQ,EACb1Q,KAAKiR,SAAW,EAEhBjR,KAAKuY,WAAa,EAGlBvY,KAAK+X,WAAa,EAYlB/X,KAAK4M,UAAa,IAAImO,YAAYC,MAClChb,KAAK6M,UAAa,IAAIkO,YAAA,KACtB/a,KAAK8M,QAAa,IAAIiO,YAAA,IACtBrF,GAAK1V,KAAK4M,WACV8I,GAAK1V,KAAK6M,WACV6I,GAAK1V,KAAK8M,SAEV9M,KAAKkQ,OAAW,KAChBlQ,KAAKmQ,OAAW,KAChBnQ,KAAKoQ,QAAW,KAGhBpQ,KAAKuM,SAAW,IAAIwO,YAAYE,IAIhCjb,KAAK2N,KAAO,IAAIoN,YAAY,KAC5BrF,GAAK1V,KAAK2N,MAEV3N,KAAK6N,SAAW,EAChB7N,KAAKwO,SAAW,EAKhBxO,KAAKtL,MAAQ,IAAIqmB,YAAY,KAC7BrF,GAAK1V,KAAKtL,OAIVsL,KAAKoO,QAAU,EAEfpO,KAAKkb,YAAc,EAoBnBlb,KAAKkN,SAAW,EAChBlN,KAAKwR,QAAU,EAEfxR,KAAKgN,QAAU,EACfhN,KAAKiN,WAAa,EAClBjN,KAAKmN,QAAU,EACfnN,KAAK8Y,OAAS,EAGd9Y,KAAK+L,OAAS,EAId/L,KAAK8L,SAAW,CAalB,CAMA,MAAMqP,GAAqBxK,IAEzB,IAAKA,EACH,OAAO,EAET,MAAMlF,EAAIkF,EAAK2F,MACf,OAAK7K,GAAKA,EAAEkF,OAASA,GAASlF,EAAEgP,SAAWrF,IAlyCtB,KAoyCS3J,EAAEgP,QAlyCX,KAoyCShP,EAAEgP,QAnyCX,KAoyCShP,EAAEgP,QAnyCX,KAoyCShP,EAAEgP,QAnyCZ,MAoyCUhP,EAAEgP,QACFhP,EAAEgP,SAAWpF,IACb5J,EAAEgP,SAAWnF,GAClC,EAEF,GAIH8F,GAAoBzK,IAExB,GAAIwK,GAAkBxK,GACpB,OAAO4E,GAAI5E,EAAMiE,IAGnBjE,EAAK4G,SAAW5G,EAAKgG,UAAY,EACjChG,EAAKC,UAAYwD,GAEjB,MAAM3I,EAAIkF,EAAK2F,MAmBf,OAlBA7K,EAAEG,QAAU,EACZH,EAAEgL,YAAc,EAEZhL,EAAE6L,KAAO,IACX7L,EAAE6L,MAAQ7L,EAAE6L,MAGd7L,EAAEgP,OAEW,IAAXhP,EAAE6L,KAr0CiB,GAu0CnB7L,EAAE6L,KAAOlC,GAAaC,GACxB1E,EAAKkB,MAAoB,IAAXpG,EAAE6L,KACd,EAEA,EACF7L,EAAEmP,YAAa,EACf7K,GAAStE,GACFiJ,IAIH2G,GAAgB1K,IAEpB,MAAM2K,EAAMF,GAAiBzK,GA3Qf,IAAClF,EA+Qf,OAHI6P,IAAQ5G,MA5QGjJ,EA6QLkF,EAAK2F,OA3QbuC,YAAc,EAAIpN,EAAEqK,OAGtBJ,GAAKjK,EAAEuK,MAIPvK,EAAEmO,eAAiBW,GAAoB9O,EAAEiF,OAAO0J,SAChD3O,EAAE8M,WAAagC,GAAoB9O,EAAEiF,OAAOyJ,YAC5C1O,EAAEsM,WAAawC,GAAoB9O,EAAEiF,OAAO2J,YAC5C5O,EAAEkM,iBAAmB4C,GAAoB9O,EAAEiF,OAAO4J,UAElD7O,EAAEqL,SAAW,EACbrL,EAAEoL,YAAc,EAChBpL,EAAE+M,UAAY,EACd/M,EAAEqN,OAAS,EACXrN,EAAEkO,aAAelO,EAAEqM,YAAc+B,EACjCpO,EAAEwO,gBAAkB,EACpBxO,EAAEsN,MAAQ,GA2PHuC,GAcHC,GAAe,CAAC5K,EAAMD,EAAOpI,EAAQkT,EAAYC,EAAUxK,KAE/D,IAAKN,EACH,OAAOiE,GAET,IAAI0C,EAAO,EAiBX,GAfI5G,IAAUqE,KACZrE,EAAQ,GAGN8K,EAAa,GACflE,EAAO,EACPkE,GAAcA,GAGPA,EAAa,KACpBlE,EAAO,EACPkE,GAAc,IAIZC,EAAW,GAAKA,EA15CA,GA05C4BnT,IAAW2M,IACzDuG,EAAa,GAAKA,EAAa,IAAM9K,EAAQ,GAAKA,EAAQ,GAC1DO,EAAW,GAAKA,EAAW+C,IAA2B,IAAfwH,GAA6B,IAATlE,EAC3D,OAAO/B,GAAI5E,EAAMiE,IAIA,IAAf4G,IACFA,EAAa,GAIf,MAAM/P,EAAI,IAAI+O,GAmFd,OAjFA7J,EAAK2F,MAAQ7K,EACbA,EAAEkF,KAAOA,EACTlF,EAAEgP,OAASrF,GAEX3J,EAAE6L,KAAOA,EACT7L,EAAEiP,OAAS,KACXjP,EAAEoP,OAASW,EACX/P,EAAEqK,OAAS,GAAKrK,EAAEoP,OAClBpP,EAAE0M,OAAS1M,EAAEqK,OAAS,EAEtBrK,EAAEqP,UAAYW,EAAW,EACzBhQ,EAAEsK,UAAY,GAAKtK,EAAEqP,UACrBrP,EAAE2K,UAAY3K,EAAEsK,UAAY,EAC5BtK,EAAE0K,eAAiB1K,EAAEqP,UA/5CL,EA+5C6B,GA/5C7B,GAi6ChBrP,EAAErX,OAAS,IAAIyV,WAAsB,EAAX4B,EAAEqK,QAC5BrK,EAAEuK,KAAO,IAAI+E,YAAYtP,EAAEsK,WAC3BtK,EAAEwK,KAAO,IAAI8E,YAAYtP,EAAEqK,QAK3BrK,EAAEyP,YAAc,GAAMO,EAAW,EAyCjChQ,EAAE4N,iBAAmC,EAAhB5N,EAAEyP,YACvBzP,EAAEE,YAAc,IAAI9B,WAAW4B,EAAE4N,kBAIjC5N,EAAE2C,QAAU3C,EAAEyP,YAGdzP,EAAE+F,QAAgC,GAArB/F,EAAEyP,YAAc,GAM7BzP,EAAEiF,MAAQA,EACVjF,EAAEwF,SAAWA,EACbxF,EAAEnD,OAASA,EAEJ+S,GAAa1K,IA2ctB,IAoBI+K,GAAc,CACjBC,YA7dmB,CAAChL,EAAMD,IAElB6K,GAAa5K,EAAMD,EAAOuE,GA5/Cf,GAEE,EA0/CuDD,IA4d5EuG,aArBoBA,GAsBpBF,aArBoBA,GAsBpBD,iBArBwBA,GAsBxBQ,iBAnmBwB,CAACjL,EAAMqF,IAE1BmF,GAAkBxK,IAA6B,IAApBA,EAAK2F,MAAMgB,KACjC1C,IAETjE,EAAK2F,MAAMoE,OAAS1E,EACbtB,IA8lBRmH,QA3diB,CAAClL,EAAMsI,KAEvB,GAAIkC,GAAkBxK,IAASsI,EAAQxE,IAAawE,EAAQ,EAC1D,OAAOtI,EAAO4E,GAAI5E,EAAMiE,IAAoBA,GAG9C,MAAMnJ,EAAIkF,EAAK2F,MAEf,IAAK3F,EAAK6F,QACa,IAAlB7F,EAAKyG,WAAmBzG,EAAKrK,OAC7BmF,EAAEgP,SAAWnF,IAAgB2D,IAAUzE,GAC1C,OAAOe,GAAI5E,EAA0B,IAAnBA,EAAK4F,UAAmBzB,GAAgBF,IAG5D,MAAMkH,EAAYrQ,EAAEmP,WAIpB,GAHAnP,EAAEmP,WAAa3B,EAGG,IAAdxN,EAAEG,SAEJ,GADAyK,GAAc1F,GACS,IAAnBA,EAAK4F,UAQP,OADA9K,EAAEmP,YAAa,EACRlG,QAOX,GAA6B,IAAlB/D,EAAKyG,UAAkB/F,GAAK4H,IAAU5H,GAAKyK,IACpD7C,IAAUzE,GACV,OAAOe,GAAI5E,EAAMmE,IAInB,GAAIrJ,EAAEgP,SAAWnF,IAAkC,IAAlB3E,EAAKyG,SACpC,OAAO7B,GAAI5E,EAAMmE,IAOnB,GAHIrJ,EAAEgP,SAAWrF,IAAyB,IAAX3J,EAAE6L,OAC/B7L,EAAEgP,OAASpF,IAET5J,EAAEgP,SAAWrF,GAAY,CAE3B,IAAI2G,EAAU9G,IAAiBxJ,EAAEoP,OAAS,GAAM,IAAO,EACnDmB,GAAc,EA2BlB,GAxBEA,EADEvQ,EAAEwF,UAAY6C,IAAkBrI,EAAEiF,MAAQ,EAC9B,EACLjF,EAAEiF,MAAQ,EACL,EACO,IAAZjF,EAAEiF,MACG,EAEA,EAEhBqL,GAAWC,GAAe,EACP,IAAfvQ,EAAEqL,WAAkBiF,GAziDR,IA0iDhBA,GAAU,GAAMA,EAAS,GAEzB9E,GAAYxL,EAAGsQ,GAGI,IAAftQ,EAAEqL,WACJG,GAAYxL,EAAGkF,EAAKkB,QAAU,IAC9BoF,GAAYxL,EAAgB,MAAbkF,EAAKkB,QAEtBlB,EAAKkB,MAAQ,EACbpG,EAAEgP,OAASpF,GAGXgB,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,EAEX,CAEA,GA1jDqB,KA0jDjBjJ,EAAEgP,OAMJ,GAJA9J,EAAKkB,MAAQ,EACbkF,GAAStL,EAAG,IACZsL,GAAStL,EAAG,KACZsL,GAAStL,EAAG,GACPA,EAAEiP,OAoBL3D,GAAStL,GAAIA,EAAEiP,OAAOrV,KAAO,EAAI,IACpBoG,EAAEiP,OAAOuB,KAAO,EAAI,IACnBxQ,EAAEiP,OAAOxM,MAAY,EAAJ,IACjBzC,EAAEiP,OAAO1lB,KAAW,EAAJ,IAChByW,EAAEiP,OAAOwB,QAAc,GAAJ,IAEjCnF,GAAStL,EAAmB,IAAhBA,EAAEiP,OAAOtR,MACrB2N,GAAStL,EAAIA,EAAEiP,OAAOtR,MAAQ,EAAK,KACnC2N,GAAStL,EAAIA,EAAEiP,OAAOtR,MAAQ,GAAM,KACpC2N,GAAStL,EAAIA,EAAEiP,OAAOtR,MAAQ,GAAM,KACpC2N,GAAStL,EAAe,IAAZA,EAAEiF,MAAc,EACfjF,EAAEwF,UAAY6C,IAAkBrI,EAAEiF,MAAQ,EAC1C,EAAI,GACjBqG,GAAStL,EAAiB,IAAdA,EAAEiP,OAAOyB,IACjB1Q,EAAEiP,OAAOxM,OAASzC,EAAEiP,OAAOxM,MAAM7W,SACnC0f,GAAStL,EAA2B,IAAxBA,EAAEiP,OAAOxM,MAAM7W,QAC3B0f,GAAStL,EAAIA,EAAEiP,OAAOxM,MAAM7W,QAAU,EAAK,MAEzCoU,EAAEiP,OAAOuB,OACXtL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAS,IAE7DH,EAAEkP,QAAU,EACZlP,EAAEgP,OAxmDe,QA4kDjB,GAbA1D,GAAStL,EAAG,GACZsL,GAAStL,EAAG,GACZsL,GAAStL,EAAG,GACZsL,GAAStL,EAAG,GACZsL,GAAStL,EAAG,GACZsL,GAAStL,EAAe,IAAZA,EAAEiF,MAAc,EACfjF,EAAEwF,UAAY6C,IAAkBrI,EAAEiF,MAAQ,EAC1C,EAAI,GACjBqG,GAAStL,EA3jDC,GA4jDVA,EAAEgP,OAASpF,GAGXgB,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,GA6Bb,GA3mDqB,KA2mDjBjJ,EAAEgP,OAAwB,CAC5B,GAAIhP,EAAEiP,OAAOxM,MAAqB,CAChC,IAAIkO,EAAM3Q,EAAEG,QACRsN,GAAgC,MAAxBzN,EAAEiP,OAAOxM,MAAM7W,QAAmBoU,EAAEkP,QAChD,KAAOlP,EAAEG,QAAUsN,EAAOzN,EAAE4N,kBAAkB,CAC5C,IAAIgD,EAAO5Q,EAAE4N,iBAAmB5N,EAAEG,QAYlC,GATAH,EAAEE,YAAYxL,IAAIsL,EAAEiP,OAAOxM,MAAM2B,SAASpE,EAAEkP,QAASlP,EAAEkP,QAAU0B,GAAO5Q,EAAEG,SAC1EH,EAAEG,QAAUH,EAAE4N,iBAEV5N,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,IAGnE3Q,EAAEkP,SAAW0B,EACbhG,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,GAET0H,EAAM,EACNlD,GAAQmD,CACV,CAGA,IAAIC,EAAe,IAAIzS,WAAW4B,EAAEiP,OAAOxM,OAG3CzC,EAAEE,YAAYxL,IAAImc,EAAazM,SAASpE,EAAEkP,QAASlP,EAAEkP,QAAUzB,GAAOzN,EAAEG,SACxEH,EAAEG,SAAWsN,EAETzN,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,IAGnE3Q,EAAEkP,QAAU,CACd,CACAlP,EAAEgP,OAhpDiB,EAipDrB,CACA,GAlpDqB,KAkpDjBhP,EAAEgP,OAAuB,CAC3B,GAAIhP,EAAEiP,OAAO1lB,KAAoB,CAC/B,IACIyD,EADA2jB,EAAM3Q,EAAEG,QAEZ,EAAG,CACD,GAAIH,EAAEG,UAAYH,EAAE4N,iBAAkB,CAOpC,GALI5N,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,IAGnE/F,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,GAET0H,EAAM,CACR,CAGE3jB,EADEgT,EAAEkP,QAAUlP,EAAEiP,OAAO1lB,KAAKqC,OACkB,IAAxCoU,EAAEiP,OAAO1lB,KAAK8T,WAAW2C,EAAEkP,WAE3B,EAER5D,GAAStL,EAAGhT,EACd,OAAiB,IAARA,GAELgT,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,IAGnE3Q,EAAEkP,QAAU,CACd,CACAlP,EAAEgP,OAlrDiB,EAmrDrB,CACA,GAprDqB,KAorDjBhP,EAAEgP,OAA0B,CAC9B,GAAIhP,EAAEiP,OAAOwB,QAAuB,CAClC,IACIzjB,EADA2jB,EAAM3Q,EAAEG,QAEZ,EAAG,CACD,GAAIH,EAAEG,UAAYH,EAAE4N,iBAAkB,CAOpC,GALI5N,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,IAGnE/F,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,GAET0H,EAAM,CACR,CAGE3jB,EADEgT,EAAEkP,QAAUlP,EAAEiP,OAAOwB,QAAQ7kB,OACkB,IAA3CoU,EAAEiP,OAAOwB,QAAQpT,WAAW2C,EAAEkP,WAE9B,EAER5D,GAAStL,EAAGhT,EACd,OAAiB,IAARA,GAELgT,EAAEiP,OAAOuB,MAAQxQ,EAAEG,QAAUwQ,IAC/BzL,EAAKkB,MAAQQ,GAAQ1B,EAAKkB,MAAOpG,EAAEE,YAAaF,EAAEG,QAAUwQ,EAAKA,GAGrE,CACA3Q,EAAEgP,OAntDgB,GAotDpB,CACA,GArtDoB,MAqtDhBhP,EAAEgP,OAAuB,CAC3B,GAAIhP,EAAEiP,OAAOuB,KAAM,CACjB,GAAIxQ,EAAEG,QAAU,EAAIH,EAAE4N,mBACpBhD,GAAc1F,GACI,IAAdlF,EAAEG,SAEJ,OADAH,EAAEmP,YAAa,EACRlG,GAGXqC,GAAStL,EAAgB,IAAbkF,EAAKkB,OACjBkF,GAAStL,EAAIkF,EAAKkB,OAAS,EAAK,KAChClB,EAAKkB,MAAQ,CACf,CAKA,GAJApG,EAAEgP,OAASpF,GAGXgB,GAAc1F,GACI,IAAdlF,EAAEG,QAEJ,OADAH,EAAEmP,YAAa,EACRlG,EAEX,CAKA,GAAsB,IAAlB/D,EAAKyG,UAAkC,IAAhB3L,EAAE+M,WAC1BS,IAAU3E,IAAgB7I,EAAEgP,SAAWnF,GAAe,CACvD,IAAIiH,EAAqB,IAAZ9Q,EAAEiF,MAAcsI,GAAevN,EAAGwN,GAClCxN,EAAEwF,WAAa6C,GApwBX,EAACrI,EAAGwN,KAEvB,IAAIS,EAEJ,OAAS,CAEP,GAAoB,IAAhBjO,EAAE+M,YACJE,GAAYjN,GACQ,IAAhBA,EAAE+M,WAAiB,CACrB,GAAIS,IAAU3E,GACZ,OAp/BgB,EAs/BlB,KACF,CAUF,GANA7I,EAAEkO,aAAe,EAGjBD,EAASnI,GAAU9F,EAAG,EAAGA,EAAErX,OAAOqX,EAAEqL,WACpCrL,EAAE+M,YACF/M,EAAEqL,WACE4C,IAEF9C,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WACT,OArgCkB,CAygCxB,CAEA,OADA9K,EAAEqN,OAAS,EACPG,IAAUzE,IAEZoC,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,UA5gCW,EACA,GAihCpB9K,EAAEyB,WAEJ0J,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WAvhCW,EACA,GA6uDuBiG,CAAa/Q,EAAGwN,GAChDxN,EAAEwF,WAAa8C,GAr2BZ,EAACtI,EAAGwN,KAEtB,IAAIS,EACAzD,EACA2B,EAAMQ,EAEV,MAAMH,EAAOxM,EAAErX,OAEf,OAAS,CAKP,GAAIqX,EAAE+M,WAAatD,GAAW,CAE5B,GADAwD,GAAYjN,GACRA,EAAE+M,WAAatD,IAAa+D,IAAU3E,GACxC,OA15BkB,EA45BpB,GAAoB,IAAhB7I,EAAE+M,UAAmB,KAC3B,CAIA,GADA/M,EAAEkO,aAAe,EACblO,EAAE+M,WAl7BQ,GAk7BkB/M,EAAEqL,SAAW,IAC3Cc,EAAOnM,EAAEqL,SAAW,EACpBb,EAAOgC,EAAKL,GACR3B,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IAAO,CAC3EQ,EAAS3M,EAAEqL,SAAW5B,GACtB,UAESe,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IACzC3B,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IACzC3B,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IACzC3B,IAASgC,IAAOL,IAAS3B,IAASgC,IAAOL,IACzCA,EAAOQ,GAChB3M,EAAEkO,aAAezE,IAAakD,EAASR,GACnCnM,EAAEkO,aAAelO,EAAE+M,YACrB/M,EAAEkO,aAAelO,EAAE+M,UAEvB,CAuBF,GAlBI/M,EAAEkO,cAv8BQ,GA28BZD,EAASnI,GAAU9F,EAAG,EAAGA,EAAEkO,aA38Bf,GA68BZlO,EAAE+M,WAAa/M,EAAEkO,aACjBlO,EAAEqL,UAAYrL,EAAEkO,aAChBlO,EAAEkO,aAAe,IAKjBD,EAASnI,GAAU9F,EAAG,EAAGA,EAAErX,OAAOqX,EAAEqL,WAEpCrL,EAAE+M,YACF/M,EAAEqL,YAEA4C,IAEF9C,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WACT,OA58BkB,CAg9BxB,CAEA,OADA9K,EAAEqN,OAAS,EACPG,IAAUzE,IAEZoC,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,UAn9BW,EACA,GAw9BpB9K,EAAEyB,WAEJ0J,GAAiBnL,GAAG,GACK,IAArBA,EAAEkF,KAAK4F,WA99BW,EACA,GA8uDckG,CAAYhR,EAAGwN,GACtCsB,GAAoB9O,EAAEiF,OAAO9N,KAAK6I,EAAGwN,GAKlD,GAnvDsB,IAgvDlBsD,GA/uDkB,IA+uDcA,IAClC9Q,EAAEgP,OAASnF,IAnvDS,IAqvDlBiH,GAnvDkB,IAmvDSA,EAK7B,OAJuB,IAAnB5L,EAAK4F,YACP9K,EAAEmP,YAAa,GAGVlG,GAST,GAlwDsB,IAkwDlB6H,IACEtD,IAAUtG,GACZlB,GAAUhG,GAEHwN,IAAUxE,KAEjBpE,GAAiB5E,EAAG,EAAG,GAAG,GAItBwN,IAAU1E,KAEZmB,GAAKjK,EAAEuK,MAEa,IAAhBvK,EAAE+M,YACJ/M,EAAEqL,SAAW,EACbrL,EAAEoL,YAAc,EAChBpL,EAAEqN,OAAS,KAIjBzC,GAAc1F,GACS,IAAnBA,EAAK4F,WAEP,OADA9K,EAAEmP,YAAa,EACRlG,EAGb,CAEA,OAAIuE,IAAUzE,GAAqBE,GAC/BjJ,EAAE6L,MAAQ,EAAY3C,IAGX,IAAXlJ,EAAE6L,MACJP,GAAStL,EAAgB,IAAbkF,EAAKkB,OACjBkF,GAAStL,EAAIkF,EAAKkB,OAAS,EAAK,KAChCkF,GAAStL,EAAIkF,EAAKkB,OAAS,GAAM,KACjCkF,GAAStL,EAAIkF,EAAKkB,OAAS,GAAM,KACjCkF,GAAStL,EAAmB,IAAhBkF,EAAK4G,UACjBR,GAAStL,EAAIkF,EAAK4G,UAAY,EAAK,KACnCR,GAAStL,EAAIkF,EAAK4G,UAAY,GAAM,KACpCR,GAAStL,EAAIkF,EAAK4G,UAAY,GAAM,OAIpCN,GAAYxL,EAAGkF,EAAKkB,QAAU,IAC9BoF,GAAYxL,EAAgB,MAAbkF,EAAKkB,QAGtBwE,GAAc1F,GAIVlF,EAAE6L,KAAO,IAAK7L,EAAE6L,MAAQ7L,EAAE6L,MAET,IAAd7L,EAAEG,QAAgB8I,GAASC,KA8HnC+H,WA1HmB/L,IAElB,GAAIwK,GAAkBxK,GACpB,OAAOiE,GAGT,MAAM6F,EAAS9J,EAAK2F,MAAMmE,OAI1B,OAFA9J,EAAK2F,MAAQ,KAENmE,IAAWpF,GAAaE,GAAI5E,EAAMkE,IAAkBH,IAiH5DiI,qBAzG4B,CAAChM,EAAMiM,KAElC,IAAIC,EAAaD,EAAWvlB,OAE5B,GAAI8jB,GAAkBxK,GACpB,OAAOiE,GAGT,MAAMnJ,EAAIkF,EAAK2F,MACTgB,EAAO7L,EAAE6L,KAEf,GAAa,IAATA,GAAwB,IAATA,GAAc7L,EAAEgP,SAAWrF,IAAe3J,EAAE+M,UAC7D,OAAO5D,GAYT,GARa,IAAT0C,IAEF3G,EAAKkB,MAAQD,GAAUjB,EAAKkB,MAAO+K,EAAYC,EAAY,IAG7DpR,EAAE6L,KAAO,EAGLuF,GAAcpR,EAAEqK,OAAQ,CACb,IAATwB,IAEF5B,GAAKjK,EAAEuK,MACPvK,EAAEqL,SAAW,EACbrL,EAAEoL,YAAc,EAChBpL,EAAEqN,OAAS,GAIb,IAAIgE,EAAU,IAAIjT,WAAW4B,EAAEqK,QAC/BgH,EAAQ3c,IAAIyc,EAAW/M,SAASgN,EAAapR,EAAEqK,OAAQ+G,GAAa,GACpED,EAAaE,EACbD,EAAapR,EAAEqK,MACjB,CAEA,MAAMiH,EAAQpM,EAAKyG,SACb4F,EAAOrM,EAAK0G,QACZ/Q,EAAQqK,EAAKrK,MAKnB,IAJAqK,EAAKyG,SAAWyF,EAChBlM,EAAK0G,QAAU,EACf1G,EAAKrK,MAAQsW,EACblE,GAAYjN,GACLA,EAAE+M,WAh5DO,GAg5DiB,CAC/B,IAAI5P,EAAM6C,EAAEqL,SACRpK,EAAIjB,EAAE+M,UAAA,EACV,GAEE/M,EAAEsN,MAAQ7C,GAAKzK,EAAGA,EAAEsN,MAAOtN,EAAErX,OAAOwU,EAr5DxB,EAq5D0C,IAEtD6C,EAAEwK,KAAKrN,EAAM6C,EAAE0M,QAAU1M,EAAEuK,KAAKvK,EAAEsN,OAElCtN,EAAEuK,KAAKvK,EAAEsN,OAASnQ,EAClBA,YACS8D,GACXjB,EAAEqL,SAAWlO,EACb6C,EAAE+M,UAAYqB,EACdnB,GAAYjN,EACd,CAWA,OAVAA,EAAEqL,UAAYrL,EAAE+M,UAChB/M,EAAEoL,YAAcpL,EAAEqL,SAClBrL,EAAEqN,OAASrN,EAAE+M,UACb/M,EAAE+M,UAAY,EACd/M,EAAEkO,aAAelO,EAAEqM,YAAc+B,EACjCpO,EAAEwO,gBAAkB,EACpBtJ,EAAK0G,QAAU2F,EACfrM,EAAKrK,MAAQA,EACbqK,EAAKyG,SAAW2F,EAChBtR,EAAE6L,KAAOA,EACF5C,IAiCRuI,YArBiB,sCAwBlB,MAAMC,GAAO,CAAC5jB,EAAK7C,IACVC,OAAOmN,UAAUC,eAAeC,KAAKzK,EAAK7C,GAGnD,IA0CI0mB,GA1CS,SAAU7jB,GACrB,MAAM8jB,EAAU3lB,MAAMoM,UAAUrK,MAAMuK,KAAKsZ,UAAW,GACtD,KAAOD,EAAQ/lB,QAAQ,CACrB,MAAMimB,EAASF,EAAQG,QACvB,GAAKD,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIE,UAAUF,EAAS,sBAG/B,IAAA,MAAW1H,KAAK0H,EACVJ,GAAKI,EAAQ1H,KACftc,EAAIsc,GAAK0H,EAAO1H,GARK,CAW3B,CAEA,OAAOtc,CACT,EAwBI6jB,GApBiBM,IAEnB,IAAIlU,EAAM,EAEV,IAAA,IAASnQ,EAAI,EAAGskB,EAAID,EAAOpmB,OAAQ+B,EAAIskB,EAAGtkB,IACxCmQ,GAAOkU,EAAOrkB,GAAG/B,OAInB,MAAMsmB,EAAS,IAAI9T,WAAWN,GAE9B,IAAA,IAASnQ,EAAI,EAAG0Y,EAAM,EAAG4L,EAAID,EAAOpmB,OAAQ+B,EAAIskB,EAAGtkB,IAAK,CACtD,IAAIwkB,EAAQH,EAAOrkB,GACnBukB,EAAOxd,IAAIyd,EAAO9L,GAClBA,GAAO8L,EAAMvmB,MACf,CAEA,OAAOsmB,GAgBT,IAAIE,IAAmB,EAEvB,IAAMhlB,OAAOilB,aAAaC,MAAM,KAAM,IAAIlU,WAAW,GAAK,OAASmU,IAAMH,IAAmB,CAAO,CAMnG,MAAMI,GAAW,IAAIpU,WAAW,KAChC,IAAA,IAASqU,GAAI,EAAGA,GAAI,IAAKA,KACvBD,GAASC,IAAMA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAIA,IAAK,IAAM,EAAI,EAE5FD,GAAS,KAAOA,GAAS,KAAO,EAiFhC,IAyEIE,GAtJcvV,IAChB,GAA2B,mBAAhBwV,aAA8BA,YAAYva,UAAUwa,OAC7D,OAAO,IAAID,aAAcC,OAAOzV,GAGlC,IAAIU,EAAK2C,EAAGqS,EAAIC,EAAOnlB,EAAGolB,EAAU5V,EAAIvR,OAAQonB,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/BtS,EAAIrD,EAAIE,WAAWyV,GACE,QAAZ,MAAJtS,IAA2BsS,EAAQ,EAAIC,IAC1CF,EAAK1V,EAAIE,WAAWyV,EAAQ,GACN,QAAZ,MAALD,KACHrS,EAAI,OAAYA,EAAI,OAAW,KAAOqS,EAAK,OAC3CC,MAGJE,GAAWxS,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHA3C,EAAM,IAAIO,WAAW4U,GAGhBrlB,EAAI,EAAGmlB,EAAQ,EAAGnlB,EAAIqlB,EAASF,IAClCtS,EAAIrD,EAAIE,WAAWyV,GACE,QAAZ,MAAJtS,IAA2BsS,EAAQ,EAAIC,IAC1CF,EAAK1V,EAAIE,WAAWyV,EAAQ,GACN,QAAZ,MAALD,KACHrS,EAAI,OAAYA,EAAI,OAAW,KAAOqS,EAAK,OAC3CC,MAGAtS,EAAI,IAEN3C,EAAIlQ,KAAO6S,EACFA,EAAI,MAEb3C,EAAIlQ,KAAO,IAAQ6S,IAAM,EACzB3C,EAAIlQ,KAAO,IAAY,GAAJ6S,GACVA,EAAI,OAEb3C,EAAIlQ,KAAO,IAAQ6S,IAAM,GACzB3C,EAAIlQ,KAAO,IAAQ6S,IAAM,EAAI,GAC7B3C,EAAIlQ,KAAO,IAAY,GAAJ6S,IAGnB3C,EAAIlQ,KAAO,IAAQ6S,IAAM,GACzB3C,EAAIlQ,KAAO,IAAQ6S,IAAM,GAAK,GAC9B3C,EAAIlQ,KAAO,IAAQ6S,IAAM,EAAI,GAC7B3C,EAAIlQ,KAAO,IAAY,GAAJ6S,GAIvB,OAAO3C,GAgGL6U,GAzEa,CAAC7U,EAAKH,KACrB,MAAMI,EAAMJ,GAAOG,EAAIjS,OAEvB,GAA2B,mBAAhBqnB,aAA8BA,YAAY7a,UAAU8a,OAC7D,OAAO,IAAID,aAAcC,OAAOrV,EAAIuG,SAAS,EAAG1G,IAGlD,IAAI/P,EAAGD,EAKP,MAAMylB,EAAW,IAAInnB,MAAY,EAAN8R,GAE3B,IAAKpQ,EAAM,EAAGC,EAAI,EAAGA,EAAImQ,GAAM,CAC7B,IAAI0C,EAAI3C,EAAIlQ,KAEZ,GAAI6S,EAAI,IAAM,CAAE2S,EAASzlB,KAAS8S,EAAG,QAAU,CAE/C,IAAI4S,EAAQZ,GAAShS,GAErB,GAAI4S,EAAQ,EAAKD,EAASzlB,KAAS,MAAQC,GAAKylB,EAAQ,MAAxD,CAKA,IAFA5S,GAAe,IAAV4S,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAKzlB,EAAImQ,GACtB0C,EAAKA,GAAK,EAAiB,GAAX3C,EAAIlQ,KACpBylB,IAIEA,EAAQ,EAAKD,EAASzlB,KAAS,MAE/B8S,EAAI,MACN2S,EAASzlB,KAAS8S,GAElBA,GAAK,MACL2S,EAASzlB,KAAS,MAAW8S,GAAK,GAAM,KACxC2S,EAASzlB,KAAS,MAAc,KAAJ8S,EAlBuC,CAoBvE,CAEA,MA9DoB,EAAC3C,EAAKC,KAI1B,GAAIA,EAAM,OACJD,EAAIuG,UAAYgO,GAClB,OAAOhlB,OAAOilB,aAAaC,MAAM,KAAMzU,EAAIjS,SAAWkS,EAAMD,EAAMA,EAAIuG,SAAS,EAAGtG,IAItF,IAAIoU,EAAS,GACb,IAAA,IAASvkB,EAAI,EAAGA,EAAImQ,EAAKnQ,IACvBukB,GAAU9kB,OAAOilB,aAAaxU,EAAIlQ,IAEpC,OAAOukB,GAgDAmB,CAAcF,EAAUzlB,IA8B7BglB,GApBa,CAAC7U,EAAKH,MAErBA,EAAMA,GAAOG,EAAIjS,QACPiS,EAAIjS,SAAU8R,EAAMG,EAAIjS,QAGlC,IAAIya,EAAM3I,EAAM,EAChB,KAAO2I,GAAO,GAA2B,MAAV,IAAXxI,EAAIwI,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkB3I,EAMd2I,EAAMmM,GAAS3U,EAAIwI,IAAQ3I,EAAO2I,EAAM3I,GAqDlD,IAAI4V,GAzBJ,WAEE/e,KAAKsG,MAAQ,KACbtG,KAAKqX,QAAU,EAEfrX,KAAKoX,SAAW,EAEhBpX,KAAKuX,SAAW,EAEhBvX,KAAKwW,OAAS,KACdxW,KAAK0W,SAAW,EAEhB1W,KAAKuW,UAAY,EAEjBvW,KAAK2W,UAAY,EAEjB3W,KAAKyV,IAAM,GAEXzV,KAAKsW,MAAQ,KAEbtW,KAAK4Q,UAAY,EAEjB5Q,KAAK6R,MAAQ,CACf,EAIA,MAAMmN,GAAatoB,OAAOmN,UAAUlC,UAMlC+Q,WAAYuM,GAAArM,aAAcA,GAAAC,aAAcA,GAAcC,SAAUoM,GAChEjM,KAAMkM,GAAQjM,aAAckM,GAAAxL,sBAC5BA,GAAAK,mBACAA,GACAI,WAAYgL,IACV5M,GA0FJ,SAAS6M,GAAU/iB,GACjByD,KAAKzD,QAAU4gB,GAAc,CAC3BzM,MAAOkD,GACPtL,OAAQ+W,GACRE,UAAW,MACX/D,WAAY,GACZC,SAAU,EACVxK,SAAUgD,IACT1X,GAAW,CAAA,GAEd,IAAIijB,EAAMxf,KAAKzD,QAEXijB,EAAI7lB,KAAQ6lB,EAAIhE,WAAa,EAC/BgE,EAAIhE,YAAcgE,EAAIhE,WAGfgE,EAAIC,MAASD,EAAIhE,WAAa,GAAOgE,EAAIhE,WAAa,KAC7DgE,EAAIhE,YAAc,IAGpBxb,KAAKuV,IAAS,EACdvV,KAAKyV,IAAS,GACdzV,KAAK0f,OAAS,EACd1f,KAAKyd,OAAS,GAEdzd,KAAK2Q,KAAO,IAAIoO,GAChB/e,KAAK2Q,KAAK4F,UAAY,EAEtB,IAAIkE,EAASiB,GAAYH,aACvBvb,KAAK2Q,KACL6O,EAAI9O,MACJ8O,EAAIlX,OACJkX,EAAIhE,WACJgE,EAAI/D,SACJ+D,EAAIvO,UAGN,GAAIwJ,IAAW0E,GACb,MAAM,IAAIQ,MAAMnN,GAASiI,IAO3B,GAJI+E,EAAIzD,QACNL,GAAYE,iBAAiB5b,KAAK2Q,KAAM6O,EAAIzD,QAG1CyD,EAAI5C,WAAY,CAClB,IAAIgD,EAaJ,GATEA,EAF4B,iBAAnBJ,EAAI5C,WAENuB,GAAmBqB,EAAI5C,YACe,yBAApCoC,GAAWjb,KAAKyb,EAAI5C,YACtB,IAAI/S,WAAW2V,EAAI5C,YAEnB4C,EAAI5C,WAGbnC,EAASiB,GAAYiB,qBAAqB3c,KAAK2Q,KAAMiP,GAEjDnF,IAAW0E,GACb,MAAM,IAAIQ,MAAMnN,GAASiI,IAG3Bza,KAAK6f,WAAY,CACnB,CACF,CA8JA,SAASC,GAAUxZ,EAAO/J,GACxB,MAAMwjB,EAAW,IAAIT,GAAU/iB,GAK/B,GAHAwjB,EAAS1mB,KAAKiN,GAAO,GAGjByZ,EAASxK,IAAO,MAAMwK,EAAStK,KAAOjD,GAASuN,EAASxK,KAE5D,OAAOwK,EAASpC,MAClB,CA/IA2B,GAAUzb,UAAUxK,KAAO,SAAU9C,EAAMypB,GACzC,MAAMrP,EAAO3Q,KAAK2Q,KACZ4O,EAAYvf,KAAKzD,QAAQgjB,UAC/B,IAAI9E,EAAQwF,EAEZ,GAAIjgB,KAAK0f,MAAS,OAAO,EAkBzB,IAhBiCO,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBd,GAAaD,GAGlC,iBAAT1oB,EAEToa,EAAKrK,MAAQ6X,GAAmB5nB,GACG,yBAA1ByoB,GAAWjb,KAAKxN,GACzBoa,EAAKrK,MAAQ,IAAIuD,WAAWtT,GAE5Boa,EAAKrK,MAAQ/P,EAGfoa,EAAK0G,QAAU,EACf1G,EAAKyG,SAAWzG,EAAKrK,MAAMjP,SAUzB,GAPuB,IAAnBsZ,EAAK4F,YACP5F,EAAK6F,OAAS,IAAI3M,WAAW0V,GAC7B5O,EAAK+F,SAAW,EAChB/F,EAAK4F,UAAYgJ,IAIdU,IAAgBrN,IAAgBqN,IAAgBpN,KAAiBlC,EAAK4F,WAAa,EACtFvW,KAAKkgB,OAAOvP,EAAK6F,OAAO3G,SAAS,EAAGc,EAAK+F,WACzC/F,EAAK4F,UAAY,MAFnB,CASA,GAHAkE,EAASiB,GAAYG,QAAQlL,EAAMsP,GAG/BxF,IAAW2E,GAOb,OANIzO,EAAK+F,SAAW,GAClB1W,KAAKkgB,OAAOvP,EAAK6F,OAAO3G,SAAS,EAAGc,EAAK+F,WAE3C+D,EAASiB,GAAYgB,WAAW1c,KAAK2Q,MACrC3Q,KAAKmgB,MAAM1F,GACXza,KAAK0f,OAAQ,EACNjF,IAAW0E,GAIpB,GAAuB,IAAnBxO,EAAK4F,WAMT,GAAI0J,EAAc,GAAKtP,EAAK+F,SAAW,EACrC1W,KAAKkgB,OAAOvP,EAAK6F,OAAO3G,SAAS,EAAGc,EAAK+F,WACzC/F,EAAK4F,UAAY,OAInB,GAAsB,IAAlB5F,EAAKyG,SAAgB,WAXvBpX,KAAKkgB,OAAOvP,EAAK6F,OAjBnB,CA+BF,OAAO,CACT,EAUA8I,GAAUzb,UAAUqc,OAAS,SAAUtC,GACrC5d,KAAKyd,OAAOpkB,KAAKukB,EACnB,EAYA0B,GAAUzb,UAAUsc,MAAQ,SAAU1F,GAEhCA,IAAW0E,KACbnf,KAAK2d,OAASR,GAAqBnd,KAAKyd,SAE1Czd,KAAKyd,OAAS,GACdzd,KAAKuV,IAAMkF,EACXza,KAAKyV,IAAMzV,KAAK2Q,KAAK8E,GACvB,EA6EA,IAMI2K,GAAc,CACjBC,QAPiBf,GAQjBzD,QAPeiE,GAQfQ,WA/BD,SAAsBha,EAAO/J,GAG3B,OAFAA,EAAUA,GAAW,CAAA,GACb5C,KAAM,EACPmmB,GAAUxZ,EAAO/J,EAC1B,EA4BCkjB,KAjBD,SAAgBnZ,EAAO/J,GAGrB,OAFAA,EAAUA,GAAW,CAAA,GACbkjB,MAAO,EACRK,GAAUxZ,EAAO/J,EAC1B,GAqCA,MAAMgkB,GAAQ,MAsCd,IAAIC,GAAU,SAAsB7P,EAAM3T,GACxC,IAAIyjB,EACA7Q,EACA8Q,EACAtE,EACA7J,EAEAoO,EAEA9K,EACA+K,EACAC,EAEAC,EACAC,EACAtU,EACAuU,EACAC,EACAC,EACAC,EACAC,EACAC,EAEA9X,EACAgC,EACA+V,EACAC,EAGAjb,EAAOkQ,EAGX,MAAMF,EAAQ3F,EAAK2F,MAEnBmK,EAAM9P,EAAK0G,QACX/Q,EAAQqK,EAAKrK,MACbsJ,EAAO6Q,GAAO9P,EAAKyG,SAAW,GAC9BsJ,EAAO/P,EAAK+F,SACZF,EAAS7F,EAAK6F,OACd4F,EAAMsE,GAAQ1jB,EAAQ2T,EAAK4F,WAC3BhE,EAAMmO,GAAQ/P,EAAK4F,UAAY,KAE/BoK,EAAOrK,EAAMqK,KAEb9K,EAAQS,EAAMT,MACd+K,EAAQtK,EAAMsK,MACdC,EAAQvK,EAAMuK,MACdC,EAAWxK,EAAMliB,OACjB2sB,EAAOzK,EAAMyK,KACbtU,EAAO6J,EAAM7J,KACbuU,EAAQ1K,EAAMkL,QACdP,EAAQ3K,EAAMmL,SACdP,GAAS,GAAK5K,EAAMoL,SAAW,EAC/BP,GAAS,GAAK7K,EAAMqL,UAAY,EAMhCC,EACA,EAAG,CACGnV,EAAO,KACTsU,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,EACRsU,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,GAGV2U,EAAOJ,EAAMD,EAAOG,GAEpBW,EACA,OAAS,CAKP,GAJAR,EAAKD,IAAS,GACdL,KAAUM,EACV5U,GAAQ4U,EACRA,EAAMD,IAAS,GAAM,IACV,IAAPC,EAIF7K,EAAOkK,KAAiB,MAAPU,MACnB,MACc,GAALC,GAuKT,IACe,GAALA,EAGV,IACc,GAALA,EAAS,CAEhB/K,EAAMwL,KArSC,MAsSP,MAAMF,CACR,CAEEjR,EAAK8E,IAAM,8BACXa,EAAMwL,KAAOvB,GACb,MAAMqB,CACR,CAZER,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASQ,CAWX,CA/JE,IArBAtY,EAAa,MAAP6X,EACNC,GAAM,GACFA,IACE5U,EAAO4U,IACTN,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,GAEVlD,GAAOwX,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACV5U,GAAQ4U,GAGN5U,EAAO,KACTsU,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,EACRsU,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,GAEV2U,EAAOH,EAAMF,EAAOI,KAGX,CAMP,GALAE,EAAKD,IAAS,GACdL,KAAUM,EACV5U,GAAQ4U,EACRA,EAAMD,IAAS,GAAM,IAEZ,GAALC,EAAJ,CAaE,GAZA9V,EAAc,MAAP6V,EACPC,GAAM,GACF5U,EAAO4U,IACTN,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,EACJA,EAAO4U,IACTN,GAAQza,EAAMma,MAAUhU,EACxBA,GAAQ,IAGZlB,GAAQwV,GAAS,GAAKM,GAAM,EAExB9V,EAAOoV,EAAM,CACfhQ,EAAK8E,IAAM,gCACXa,EAAMwL,KAAOvB,GACb,MAAMqB,CACR,CAMA,GAJAb,KAAUM,EACV5U,GAAQ4U,EAERA,EAAKX,EAAOtE,EACR7Q,EAAO8V,EAAI,CAEb,GADAA,EAAK9V,EAAO8V,EACRA,EAAKT,GACHtK,EAAMyL,KAAM,CACdpR,EAAK8E,IAAM,gCACXa,EAAMwL,KAAOvB,GACb,MAAMqB,CACR,CA0BF,GAFAN,EAAO,EACPC,EAAcT,EACA,IAAVD,GAEF,GADAS,GAAQzL,EAAQwL,EACZA,EAAK9X,EAAK,CACZA,GAAO8X,EACP,GACE7K,EAAOkK,KAAUI,EAASQ,aACjBD,GACXC,EAAOZ,EAAOnV,EACdgW,EAAc/K,CAChB,OACF,GACSqK,EAAQQ,GAGf,GAFAC,GAAQzL,EAAQgL,EAAQQ,EACxBA,GAAMR,EACFQ,EAAK9X,EAAK,CACZA,GAAO8X,EACP,GACE7K,EAAOkK,KAAUI,EAASQ,aACjBD,GAEX,GADAC,EAAO,EACHT,EAAQtX,EAAK,CACf8X,EAAKR,EACLtX,GAAO8X,EACP,GACE7K,EAAOkK,KAAUI,EAASQ,aACjBD,GACXC,EAAOZ,EAAOnV,EACdgW,EAAc/K,CAChB,CACF,OAIA,GADA8K,GAAQT,EAAQQ,EACZA,EAAK9X,EAAK,CACZA,GAAO8X,EACP,GACE7K,EAAOkK,KAAUI,EAASQ,aACjBD,GACXC,EAAOZ,EAAOnV,EACdgW,EAAc/K,CAChB,CAEF,KAAOjN,EAAM,GACXiN,EAAOkK,KAAUa,EAAYD,KAC7B9K,EAAOkK,KAAUa,EAAYD,KAC7B9K,EAAOkK,KAAUa,EAAYD,KAC7B/X,GAAO,EAELA,IACFiN,EAAOkK,KAAUa,EAAYD,KACzB/X,EAAM,IACRiN,EAAOkK,KAAUa,EAAYD,MAGnC,KACK,CACHA,EAAOZ,EAAOnV,EACd,GACEiL,EAAOkK,KAAUlK,EAAO8K,KACxB9K,EAAOkK,KAAUlK,EAAO8K,KACxB9K,EAAOkK,KAAUlK,EAAO8K,KACxB/X,GAAO,QACAA,EAAM,GACXA,IACFiN,EAAOkK,KAAUlK,EAAO8K,KACpB/X,EAAM,IACRiN,EAAOkK,KAAUlK,EAAO8K,MAG9B,CAYF,KAFA,CATA,GACe,GAALD,EAIL,CACH1Q,EAAK8E,IAAM,wBACXa,EAAMwL,KAAOvB,GACb,MAAMqB,CACR,CAPER,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKM,GAAM,GAUpE,CAeF,CAEA,KACF,CACF,OAASZ,EAAM7Q,GAAQ8Q,EAAOnO,GAG9BhJ,EAAMkD,GAAQ,EACdgU,GAAOlX,EACPkD,GAAQlD,GAAO,EACfwX,IAAS,GAAKtU,GAAQ,EAGtBkE,EAAK0G,QAAUoJ,EACf9P,EAAK+F,SAAWgK,EAChB/P,EAAKyG,SAAYqJ,EAAM7Q,EAAYA,EAAO6Q,EAAZ,EAAmB,GAAKA,EAAM7Q,GAC5De,EAAK4F,UAAamK,EAAOnO,EAAaA,EAAMmO,EAAb,IAAqB,KAAOA,EAAOnO,GAClE+D,EAAMyK,KAAOA,EACbzK,EAAM7J,KAAOA,CAEf,EAqBA,MAAMuV,GAAU,GASVC,GAAQ,IAAIlH,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAGzDmH,GAAO,IAAIrY,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAGpDsY,GAAQ,IAAIpH,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,IAG1BqH,GAAO,IAAIvY,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,KAkStB,IAAIwY,GA/RkB,CAACltB,EAAMmtB,EAAMC,EAAYC,EAAOrQ,EAAOsQ,EAAaC,EAAMvnB,KAE9E,MAAMsR,EAAOtR,EAAKsR,KAGlB,IASIkW,EACAC,EACAC,EACAC,EACA9F,EAGAllB,EAhBAyR,EAAM,EACNwZ,EAAM,EACN7pB,EAAM,EAAGiQ,EAAM,EACf6Z,EAAO,EACPC,EAAO,EACPC,EAAO,EACPhK,EAAO,EACPI,EAAO,EACP6J,EAAO,EAMP1U,EAAO,KAGX,MAAMS,EAAQ,IAAI6L,YAAYiH,IACxBoB,EAAO,IAAIrI,YAAYiH,IAC7B,IAEIqB,EAAWC,EAASC,EAFpBrV,EAAQ,KAoCZ,IAAK3E,EAAM,EAAGA,GAAOyY,GAASzY,IAC5B2F,EAAM3F,GAAO,EAEf,IAAKwZ,EAAM,EAAGA,EAAMP,EAAOO,IACzB7T,EAAMoT,EAAKC,EAAaQ,MAK1B,IADAC,EAAOvW,EACFtD,EAAM6Y,GAAS7Y,GAAO,GACN,IAAf+F,EAAM/F,GADkBA,KAM9B,GAHI6Z,EAAO7Z,IACT6Z,EAAO7Z,GAEG,IAARA,EAaF,OATAgJ,EAAMsQ,KAAkB,SAMxBtQ,EAAMsQ,KAAkB,SAExBtnB,EAAKsR,KAAO,EACL,EAET,IAAKvT,EAAM,EAAGA,EAAMiQ,GACC,IAAf+F,EAAMhW,GADaA,KASzB,IANI8pB,EAAO9pB,IACT8pB,EAAO9pB,GAITggB,EAAO,EACF3P,EAAM,EAAGA,GAAOyY,GAASzY,IAG5B,GAFA2P,IAAS,EACTA,GAAQhK,EAAM3F,GACV2P,EAAO,EACT,OAAO,EAGX,GAAIA,EAAO,IApIG,IAoIG/jB,GAA4B,IAARgU,GACnC,OAAO,EAKT,IADAia,EAAK,GAAK,EACL7Z,EAAM,EAAGA,EAAMyY,GAASzY,IAC3B6Z,EAAK7Z,EAAM,GAAK6Z,EAAK7Z,GAAO2F,EAAM3F,GAIpC,IAAKwZ,EAAM,EAAGA,EAAMP,EAAOO,IACM,IAA3BT,EAAKC,EAAaQ,KACpBL,EAAKU,EAAKd,EAAKC,EAAaQ,OAAWA,GAiE3C,GAlNc,IAuLV5tB,GACFsZ,EAAOP,EAAQwU,EACf5qB,EAAQ,IAxLG,IA0LF3C,GACTsZ,EAAOwT,GACP/T,EAAQgU,GACRpqB,EAAQ,MAGR2W,EAAO0T,GACPjU,EAAQkU,GACRtqB,EAAQ,GAIVqrB,EAAO,EACPJ,EAAM,EACNxZ,EAAMrQ,EACN8jB,EAAOyF,EACPQ,EAAOD,EACPE,EAAO,EACPL,GAAM,EACNvJ,EAAO,GAAK0J,EACZF,EAAOxJ,EAAO,EA9MD,IAiNRnkB,GAAmBmkB,EAtNJ,KAMN,IAiNXnkB,GAAoBmkB,EAtNF,IAuNnB,OAAO,EAIT,OAAS,CAEP+J,EAAY9Z,EAAM2Z,EACdR,EAAKK,GAAO,EAAIjrB,GAClBwrB,EAAU,EACVC,EAAWb,EAAKK,IAETL,EAAKK,IAAQjrB,GACpBwrB,EAAUpV,EAAMwU,EAAKK,GAAOjrB,GAC5ByrB,EAAW9U,EAAKiU,EAAKK,GAAOjrB,KAG5BwrB,EAAU,GACVC,EAAW,GAIbZ,EAAO,GAAMpZ,EAAM2Z,EACnBN,EAAO,GAAKK,EACZ/pB,EAAM0pB,EACN,GACEA,GAAQD,EACRxQ,EAAM6K,GAAQmG,GAAQD,GAAQN,GAASS,GAAa,GAAOC,GAAW,GAAMC,QAC5D,IAATX,GAIT,IADAD,EAAO,GAAMpZ,EAAM,EACZ4Z,EAAOR,GACZA,IAAS,EAWX,GATa,IAATA,GACFQ,GAAQR,EAAO,EACfQ,GAAQR,GAERQ,EAAO,EAITJ,IACqB,MAAf7T,EAAM3F,GAAY,CACtB,GAAIA,IAAQJ,EAAO,MACnBI,EAAM+Y,EAAKC,EAAaG,EAAKK,GAC/B,CAGA,GAAIxZ,EAAMyZ,IAASG,EAAOL,KAAUD,EAAK,CAYvC,IAVa,IAATK,IACFA,EAAOF,GAIThG,GAAQ9jB,EAGR+pB,EAAO1Z,EAAM2Z,EACbhK,EAAO,GAAK+J,EACLA,EAAOC,EAAO/Z,IACnB+P,GAAQhK,EAAM+T,EAAOC,KACjBhK,GAAQ,KACZ+J,IACA/J,IAAS,EAKX,GADAI,GAAQ,GAAK2J,EAxRJ,IAyRJ9tB,GAAmBmkB,EA9RR,KAMN,IAyRPnkB,GAAoBmkB,EA9RN,IA+Rf,OAAO,EAITuJ,EAAMM,EAAOL,EAIb3Q,EAAM0Q,GAAQG,GAAQ,GAAOC,GAAQ,GAAOjG,EAAOyF,CACrD,CACF,CAeA,OAVa,IAATU,IAIFhR,EAAM6K,EAAOmG,GAAU5Z,EAAM2Z,GAAS,GAAO,IAAM,IAKrD/nB,EAAKsR,KAAOuW,EACL,GA8BT,MAQElQ,SAAU0Q,GAAAzQ,QAAYA,GAAAC,QAASA,GAC/BC,KAAMwQ,GAAQvQ,aAAcwQ,GAAgBvQ,YAAawQ,GAAetQ,eAAgBuQ,GAAkBtQ,aAAcuQ,GAAgBtQ,YAAauQ,GAAAtQ,YAAeA,GAAAa,WACpKA,IACE5B,GAOKsR,GAAO,MAUPC,GAAO,MACHC,GAAO,MACPC,GAAS,MAETC,GAAQ,MAKJC,GAAO,MACPC,GAAM,MAMdC,GAAQ,MAGRC,GAAM,MAiBTC,GAAWtG,IAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,IAIzB,SAASuG,KACPzkB,KAAK2Q,KAAO,KACZ3Q,KAAK8hB,KAAO,EACZ9hB,KAAK4P,MAAO,EACZ5P,KAAKsX,KAAO,EAEZtX,KAAK0kB,UAAW,EAChB1kB,KAAK2kB,MAAQ,EAEb3kB,KAAK2gB,KAAO,EACZ3gB,KAAK4kB,MAAQ,EACb5kB,KAAK6kB,MAAQ,EAEb7kB,KAAKgW,KAAO,KAGZhW,KAAK8kB,MAAQ,EACb9kB,KAAK6V,MAAQ,EACb7V,KAAK4gB,MAAQ,EACb5gB,KAAK6gB,MAAQ,EACb7gB,KAAK5L,OAAS,KAGd4L,KAAK+gB,KAAO,EACZ/gB,KAAKyM,KAAO,EAGZzM,KAAK3I,OAAS,EACd2I,KAAK+kB,OAAS,EAGd/kB,KAAKkO,MAAQ,EAGblO,KAAKwhB,QAAU,KACfxhB,KAAKyhB,SAAW,KAChBzhB,KAAK0hB,QAAU,EACf1hB,KAAK2hB,SAAW,EAGhB3hB,KAAKglB,MAAQ,EACbhlB,KAAKilB,KAAO,EACZjlB,KAAKklB,MAAQ,EACbllB,KAAKmZ,KAAO,EACZnZ,KAAKgd,KAAO,KAEZhd,KAAKsiB,KAAO,IAAIvH,YAAY,KAC5B/a,KAAK0iB,KAAO,IAAI3H,YAAY,KAO5B/a,KAAKmlB,OAAS,KACdnlB,KAAKolB,QAAU,KACfplB,KAAK+hB,KAAO,EACZ/hB,KAAKqlB,KAAO,EACZrlB,KAAKslB,IAAM,CACb,CAGA,MAAMC,GAAqB5U,IAEzB,IAAKA,EACH,OAAO,EAET,MAAM2F,EAAQ3F,EAAK2F,MACnB,OAAKA,GAASA,EAAM3F,OAASA,GAC3B2F,EAAMwL,KAAOiC,IAAQzN,EAAMwL,KA7Ff,MA8FL,EAEF,GAIH0D,GAAoB7U,IAExB,GAAI4U,GAAkB5U,GAAS,OAAOiT,GACtC,MAAMtN,EAAQ3F,EAAK2F,MAqBnB,OApBA3F,EAAK4G,SAAW5G,EAAKgG,UAAYL,EAAMuO,MAAQ,EAC/ClU,EAAK8E,IAAM,GACPa,EAAMgB,OACR3G,EAAKkB,MAAqB,EAAbyE,EAAMgB,MAErBhB,EAAMwL,KAAOiC,GACbzN,EAAM1G,KAAO,EACb0G,EAAMoO,SAAW,EACjBpO,EAAMqO,OAAQ,EACdrO,EAAMqK,KAAO,MACbrK,EAAMN,KAAO,KACbM,EAAMyK,KAAO,EACbzK,EAAM7J,KAAO,EAEb6J,EAAMkL,QAAUlL,EAAM6O,OAAS,IAAIM,WAhHjB,KAiHlBnP,EAAMmL,SAAWnL,EAAM8O,QAAU,IAAIK,WAhHlB,KAkHnBnP,EAAMyL,KAAO,EACbzL,EAAM+O,MAAO,EAEN5B,IAIHiC,GAAgB/U,IAEpB,GAAI4U,GAAkB5U,GAAS,OAAOiT,GACtC,MAAMtN,EAAQ3F,EAAK2F,MAInB,OAHAA,EAAMT,MAAQ,EACdS,EAAMsK,MAAQ,EACdtK,EAAMuK,MAAQ,EACP2E,GAAiB7U,IAKpBgV,GAAgB,CAAChV,EAAM6K,KAC3B,IAAIlE,EAGJ,GAAIiO,GAAkB5U,GAAS,OAAOiT,GACtC,MAAMtN,EAAQ3F,EAAK2F,MAenB,OAZIkF,EAAa,GACflE,EAAO,EACPkE,GAAcA,IAGdlE,EAA2B,GAAnBkE,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCoI,IAEY,OAAjBtN,EAAMliB,QAAmBkiB,EAAMwO,QAAUtJ,IAC3ClF,EAAMliB,OAAS,MAIjBkiB,EAAMgB,KAAOA,EACbhB,EAAMwO,MAAQtJ,EACPkK,GAAa/U,KAIhBiV,GAAe,CAACjV,EAAM6K,KAE1B,IAAK7K,EAAQ,OAAOiT,GAGpB,MAAMtN,EAAQ,IAAImO,GAIlB9T,EAAK2F,MAAQA,EACbA,EAAM3F,KAAOA,EACb2F,EAAMliB,OAAS,KACfkiB,EAAMwL,KAAOiC,GACb,MAAMzI,EAAMqK,GAAchV,EAAM6K,GAIhC,OAHIF,IAAQmI,KACV9S,EAAK2F,MAAQ,MAERgF,GAoBT,IAEIuK,GAAQC,GAFRC,IAAS,EAKb,MAAMC,GAAe1P,IAGnB,GAAIyP,GAAQ,CACVF,GAAS,IAAIJ,WAAW,KACxBK,GAAU,IAAIL,WAAW,IAGzB,IAAI1C,EAAM,EACV,KAAOA,EAAM,KAAOzM,EAAMgM,KAAKS,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAMgM,KAAKS,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAMgM,KAAKS,KAAS,EACxC,KAAOA,EAAM,KAAOzM,EAAMgM,KAAKS,KAAS,EAMxC,IAJAV,GAtRS,EAsRO/L,EAAMgM,KAAM,EAAG,IAAKuD,GAAU,EAAGvP,EAAMoM,KAAM,CAAEjW,KAAM,IAGrEsW,EAAM,EACCA,EAAM,IAAMzM,EAAMgM,KAAKS,KAAS,EAEvCV,GA3RU,EA2RM/L,EAAMgM,KAAM,EAAG,GAAMwD,GAAS,EAAGxP,EAAMoM,KAAM,CAAEjW,KAAM,IAGrEsZ,IAAS,CACX,CAEAzP,EAAMkL,QAAUqE,GAChBvP,EAAMoL,QAAU,EAChBpL,EAAMmL,SAAWqE,GACjBxP,EAAMqL,SAAW,GAkBbsE,GAAe,CAACtV,EAAMuV,EAAK3T,EAAK8J,KAEpC,IAAI9Q,EACJ,MAAM+K,EAAQ3F,EAAK2F,MAqCnB,OAlCqB,OAAjBA,EAAMliB,SACRkiB,EAAMT,MAAQ,GAAKS,EAAMwO,MACzBxO,EAAMuK,MAAQ,EACdvK,EAAMsK,MAAQ,EAEdtK,EAAMliB,OAAS,IAAIyV,WAAWyM,EAAMT,QAIlCwG,GAAQ/F,EAAMT,OAChBS,EAAMliB,OAAO+L,IAAI+lB,EAAIrW,SAAS0C,EAAM+D,EAAMT,MAAOtD,GAAM,GACvD+D,EAAMuK,MAAQ,EACdvK,EAAMsK,MAAQtK,EAAMT,QAGpBtK,EAAO+K,EAAMT,MAAQS,EAAMuK,MACvBtV,EAAO8Q,IACT9Q,EAAO8Q,GAGT/F,EAAMliB,OAAO+L,IAAI+lB,EAAIrW,SAAS0C,EAAM8J,EAAM9J,EAAM8J,EAAO9Q,GAAO+K,EAAMuK,QACpExE,GAAQ9Q,IAGN+K,EAAMliB,OAAO+L,IAAI+lB,EAAIrW,SAAS0C,EAAM8J,EAAM9J,GAAM,GAChD+D,EAAMuK,MAAQxE,EACd/F,EAAMsK,MAAQtK,EAAMT,QAGpBS,EAAMuK,OAAStV,EACX+K,EAAMuK,QAAUvK,EAAMT,QAASS,EAAMuK,MAAQ,GAC7CvK,EAAMsK,MAAQtK,EAAMT,QAASS,EAAMsK,OAASrV,KAG7C,GAipCT,IAuBI4a,GAAc,CACjBT,aAxBoBA,GAyBpBC,cAxBqBA,GAyBrBH,iBAxBwBA,GAyBxBY,YAxxCoBzV,GAEZiV,GAAajV,EA3LJ,IAk9CjBiV,aAxBoBA,GAyBpBS,QA1qCiB,CAAC1V,EAAMsI,KAEvB,IAAI3C,EACAhQ,EAAOkQ,EACPwG,EACAsJ,EACAnN,EAAMD,EACN6H,EACAtU,EACAgU,EAAKC,EACLrE,EACAiF,EACAC,EAEA8B,EAAWC,EAASC,EAEpBgD,EAAWC,EAASC,EACpBld,EACA+R,EALA8F,EAAO,EAMX,MAAMsF,EAAO,IAAI7c,WAAW,GAC5B,IAAI1O,EAEAuR,EAEJ,MAAMia,EAAA,IACA9c,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAGjF,GAAI0b,GAAkB5U,KAAUA,EAAK6F,SAC/B7F,EAAKrK,OAA2B,IAAlBqK,EAAKyG,SACvB,OAAOwM,GAGTtN,EAAQ3F,EAAK2F,MACTA,EAAMwL,OAASmC,KAAQ3N,EAAMwL,KAAOoC,IAIxCoC,EAAM3V,EAAK+F,SACXF,EAAS7F,EAAK6F,OACd0C,EAAOvI,EAAK4F,UACZyG,EAAOrM,EAAK0G,QACZ/Q,EAAQqK,EAAKrK,MACb6S,EAAOxI,EAAKyG,SACZ2J,EAAOzK,EAAMyK,KACbtU,EAAO6J,EAAM7J,KAGbgU,EAAMtH,EACNuH,EAAOxH,EACPoC,EAAMmI,GAENmD,EACA,OACE,OAAQtQ,EAAMwL,MACZ,KAAKiC,GACH,GAAmB,IAAfzN,EAAMgB,KAAY,CACpBhB,EAAMwL,KAAOoC,GACb,KACF,CAEA,KAAOzX,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb6J,EAAMgB,MAAsB,QAATyJ,EAAiB,CACnB,IAAhBzK,EAAMwO,QACRxO,EAAMwO,MAAQ,IAEhBxO,EAAMsO,MAAQ,EAEd8B,EAAK,GAAY,IAAP3F,EACV2F,EAAK,GAAM3F,IAAS,EAAK,IACzBzK,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAO8B,EAAM,EAAG,GAI5C3F,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KApaC,MAqaP,KACF,CAIA,GAHIxL,EAAMN,OACRM,EAAMN,KAAK6Q,MAAO,KAED,EAAbvQ,EAAMgB,UACA,IAAPyJ,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDpQ,EAAK8E,IAAM,yBACXa,EAAMwL,KAAOyC,GACb,KACF,CACA,IAAY,GAAPxD,KAA4B1M,GAAY,CAC3C1D,EAAK8E,IAAM,6BACXa,EAAMwL,KAAOyC,GACb,KACF,CASA,GAPAxD,KAAU,EACVtU,GAAQ,EAERlD,EAAiC,GAAnB,GAAPwX,GACa,IAAhBzK,EAAMwO,QACRxO,EAAMwO,MAAQvb,GAEZA,EAAM,IAAMA,EAAM+M,EAAMwO,MAAO,CACjCnU,EAAK8E,IAAM,sBACXa,EAAMwL,KAAOyC,GACb,KACF,CAIAjO,EAAMqK,KAAO,GAAKrK,EAAMwO,MAGxBxO,EAAMqO,MAAQ,EAEdhU,EAAKkB,MAAQyE,EAAMsO,MAAQ,EAC3BtO,EAAMwL,KAAc,IAAPf,EAncH,MAmc2BkD,GAErClD,EAAO,EACPtU,EAAO,EAEP,MACF,KAjdW,MAmdT,KAAOA,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAGA,GADA6J,EAAMqO,MAAQ5D,GACK,IAAdzK,EAAMqO,SAAkBtQ,GAAY,CACvC1D,EAAK8E,IAAM,6BACXa,EAAMwL,KAAOyC,GACb,KACF,CACA,GAAkB,MAAdjO,EAAMqO,MAAgB,CACxBhU,EAAK8E,IAAM,2BACXa,EAAMwL,KAAOyC,GACb,KACF,CACIjO,EAAMN,OACRM,EAAMN,KAAK3Q,KAAS0b,GAAQ,EAAK,GAEhB,IAAdzK,EAAMqO,OAAiC,EAAbrO,EAAMgB,OAEnCoP,EAAK,GAAY,IAAP3F,EACV2F,EAAK,GAAM3F,IAAS,EAAK,IACzBzK,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAO8B,EAAM,EAAG,IAI9C3F,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KAlfE,MAofV,KApfU,MAsfR,KAAOrV,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEI6J,EAAMN,OACRM,EAAMN,KAAK5M,KAAO2X,GAED,IAAdzK,EAAMqO,OAAiC,EAAbrO,EAAMgB,OAEnCoP,EAAK,GAAY,IAAP3F,EACV2F,EAAK,GAAM3F,IAAS,EAAK,IACzB2F,EAAK,GAAM3F,IAAS,GAAM,IAC1B2F,EAAK,GAAM3F,IAAS,GAAM,IAC1BzK,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAO8B,EAAM,EAAG,IAI9C3F,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KA5gBA,MA8gBR,KA9gBQ,MAghBN,KAAOrV,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEI6J,EAAMN,OACRM,EAAMN,KAAK8Q,OAAiB,IAAP/F,EACrBzK,EAAMN,KAAKmG,GAAM4E,GAAQ,GAER,IAAdzK,EAAMqO,OAAiC,EAAbrO,EAAMgB,OAEnCoP,EAAK,GAAY,IAAP3F,EACV2F,EAAK,GAAM3F,IAAS,EAAK,IACzBzK,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAO8B,EAAM,EAAG,IAI9C3F,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KAriBG,MAuiBX,KAviBW,MAwiBT,GAAkB,KAAdxL,EAAMqO,MAAgB,CAExB,KAAOlY,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA6J,EAAMjf,OAAS0pB,EACXzK,EAAMN,OACRM,EAAMN,KAAK+Q,UAAYhG,GAEN,IAAdzK,EAAMqO,OAAiC,EAAbrO,EAAMgB,OAEnCoP,EAAK,GAAY,IAAP3F,EACV2F,EAAK,GAAM3F,IAAS,EAAK,IACzBzK,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAO8B,EAAM,EAAG,IAI9C3F,EAAO,EACPtU,EAAO,CAET,MACS6J,EAAMN,OACbM,EAAMN,KAAK9H,MAAQ,MAErBoI,EAAMwL,KAnkBG,MAqkBX,KArkBW,MAskBT,GAAkB,KAAdxL,EAAMqO,QACRtI,EAAO/F,EAAMjf,OACTglB,EAAOlD,IAAQkD,EAAOlD,GACtBkD,IACE/F,EAAMN,OACRzM,EAAM+M,EAAMN,KAAK+Q,UAAYzQ,EAAMjf,OAC9Bif,EAAMN,KAAK9H,QAEdoI,EAAMN,KAAK9H,MAAQ,IAAIrE,WAAWyM,EAAMN,KAAK+Q,YAE/CzQ,EAAMN,KAAK9H,MAAM/N,IACfmG,EAAMuJ,SACJmN,EAGAA,EAAOX,GAGT9S,IAMe,IAAd+M,EAAMqO,OAAiC,EAAbrO,EAAMgB,OACnChB,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAOte,EAAO+V,EAAMW,IAElD7D,GAAQkD,EACRW,GAAQX,EACR/F,EAAMjf,QAAUglB,GAEd/F,EAAMjf,QAAU,MAAMuvB,EAE5BtQ,EAAMjf,OAAS,EACfif,EAAMwL,KAvmBE,MAymBV,KAzmBU,MA0mBR,GAAkB,KAAdxL,EAAMqO,MAAgB,CACxB,GAAa,IAATxL,EAAc,MAAMyN,EACxBvK,EAAO,EACP,GAEE9S,EAAMjD,EAAM0W,EAAOX,KAEf/F,EAAMN,MAAQzM,GACb+M,EAAMjf,OAAS,QAClBif,EAAMN,KAAKhhB,MAAQ6D,OAAOilB,aAAavU,UAElCA,GAAO8S,EAAOlD,GAOvB,GALmB,IAAd7C,EAAMqO,OAAiC,EAAbrO,EAAMgB,OACnChB,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAOte,EAAO+V,EAAMW,IAElD7D,GAAQkD,EACRW,GAAQX,EACJ9S,EAAO,MAAMqd,CACnB,MACStQ,EAAMN,OACbM,EAAMN,KAAKhhB,KAAO,MAEpBshB,EAAMjf,OAAS,EACfif,EAAMwL,KAjoBK,MAmoBb,KAnoBa,MAooBX,GAAkB,KAAdxL,EAAMqO,MAAgB,CACxB,GAAa,IAATxL,EAAc,MAAMyN,EACxBvK,EAAO,EACP,GACE9S,EAAMjD,EAAM0W,EAAOX,KAEf/F,EAAMN,MAAQzM,GACb+M,EAAMjf,OAAS,QAClBif,EAAMN,KAAKkG,SAAWrjB,OAAOilB,aAAavU,UAErCA,GAAO8S,EAAOlD,GAMvB,GALmB,IAAd7C,EAAMqO,OAAiC,EAAbrO,EAAMgB,OACnChB,EAAMsO,MAAQvS,GAAQiE,EAAMsO,MAAOte,EAAO+V,EAAMW,IAElD7D,GAAQkD,EACRW,GAAQX,EACJ9S,EAAO,MAAMqd,CACnB,MACStQ,EAAMN,OACbM,EAAMN,KAAKkG,QAAU,MAEvB5F,EAAMwL,KAxpBE,MA0pBV,KA1pBU,MA2pBR,GAAkB,IAAdxL,EAAMqO,MAAgB,CAExB,KAAOlY,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb6J,EAAMgB,MAAayJ,KAAwB,MAAdzK,EAAMsO,OAAiB,CACvDjU,EAAK8E,IAAM,sBACXa,EAAMwL,KAAOyC,GACb,KACF,CAEAxD,EAAO,EACPtU,EAAO,CAET,CACI6J,EAAMN,OACRM,EAAMN,KAAKiG,KAAS3F,EAAMqO,OAAS,EAAK,EACxCrO,EAAMN,KAAK6Q,MAAO,GAEpBlW,EAAKkB,MAAQyE,EAAMsO,MAAQ,EAC3BtO,EAAMwL,KAAOmC,GACb,MACF,KAprBY,MAsrBV,KAAOxX,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEAkE,EAAKkB,MAAQyE,EAAMsO,MAAQJ,GAAQzD,GAEnCA,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KAAOkC,GAEf,KAAKA,GACH,GAAuB,IAAnB1N,EAAMoO,SASR,OAPA/T,EAAK+F,SAAW4P,EAChB3V,EAAK4F,UAAY2C,EACjBvI,EAAK0G,QAAU2F,EACfrM,EAAKyG,SAAW+B,EAChB7C,EAAMyK,KAAOA,EACbzK,EAAM7J,KAAOA,EAENkX,GAEThT,EAAKkB,MAAQyE,EAAMsO,MAAQ,EAC3BtO,EAAMwL,KAAOmC,GAEf,KAAKA,GACH,GAAIhL,IAAUlG,IAAWkG,IAAUjG,GAAW,MAAM4T,EAEtD,KAAK1C,GACH,GAAI5N,EAAM1G,KAAM,CAEdmR,KAAiB,EAAPtU,EACVA,GAAe,EAAPA,EAER6J,EAAMwL,KAAOwC,GACb,KACF,CAEA,KAAO7X,EAAO,GAAG,CACf,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAQA,OANA6J,EAAM1G,KAAe,EAAPmR,EAEdA,KAAU,EACVtU,GAAQ,EAGQ,EAAPsU,GACP,KAAK,EAGHzK,EAAMwL,KA7uBI,MA8uBV,MACF,KAAK,EAKH,GAJAkE,GAAY1P,GAGZA,EAAMwL,KAAOsC,GACTnL,IAAUjG,GAAS,CAErB+N,KAAU,EACVtU,GAAQ,EAER,MAAMma,CACR,CACA,MACF,KAAK,EAGHtQ,EAAMwL,KA5vBG,MA6vBT,MACF,KAAK,EACHnR,EAAK8E,IAAM,qBACXa,EAAMwL,KAAOyC,GAGjBxD,KAAU,EACVtU,GAAQ,EAER,MACF,KA1wBgB,MAgxBd,IAJAsU,KAAiB,EAAPtU,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA,IAAY,MAAPsU,KAAqBA,IAAS,GAAM,OAAS,CAChDpQ,EAAK8E,IAAM,+BACXa,EAAMwL,KAAOyC,GACb,KACF,CASA,GARAjO,EAAMjf,OAAgB,MAAP0pB,EAIfA,EAAO,EACPtU,EAAO,EAEP6J,EAAMwL,KAAOqC,GACTlL,IAAUjG,GAAW,MAAM4T,EAEjC,KAAKzC,GACH7N,EAAMwL,KAryBM,MAuyBd,KAvyBc,MAyyBZ,GADAzF,EAAO/F,EAAMjf,OACTglB,EAAM,CAGR,GAFIA,EAAOlD,IAAQkD,EAAOlD,GACtBkD,EAAOnD,IAAQmD,EAAOnD,GACb,IAATmD,EAAc,MAAMuK,EAExBpQ,EAAOrW,IAAImG,EAAMuJ,SAASmN,EAAMA,EAAOX,GAAOiK,GAE9CnN,GAAQkD,EACRW,GAAQX,EACRnD,GAAQmD,EACRiK,GAAOjK,EACP/F,EAAMjf,QAAUglB,EAChB,KACF,CAEA/F,EAAMwL,KAAOmC,GACb,MACF,KAzzBe,MA2zBb,KAAOxX,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAkBA,GAhBA6J,EAAM2O,KAAkC,KAAnB,GAAPlE,GAEdA,KAAU,EACVtU,GAAQ,EAER6J,EAAM4O,MAAmC,GAAnB,GAAPnE,GAEfA,KAAU,EACVtU,GAAQ,EAER6J,EAAM0O,MAAmC,GAAnB,GAAPjE,GAEfA,KAAU,EACVtU,GAAQ,EAGJ6J,EAAM2O,KAAO,KAAO3O,EAAM4O,MAAQ,GAAI,CACxCvU,EAAK8E,IAAM,sCACXa,EAAMwL,KAAOyC,GACb,KACF,CAGAjO,EAAM6C,KAAO,EACb7C,EAAMwL,KAz1BS,MA21BjB,KA31BiB,MA41Bf,KAAOxL,EAAM6C,KAAO7C,EAAM0O,OAAO,CAE/B,KAAOvY,EAAO,GAAG,CACf,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA6J,EAAMgM,KAAKqE,EAAMrQ,EAAM6C,SAAmB,EAAP4H,EAEnCA,KAAU,EACVtU,GAAQ,CAEV,CACA,KAAO6J,EAAM6C,KAAO,IAClB7C,EAAMgM,KAAKqE,EAAMrQ,EAAM6C,SAAW,EAapC,GAPA7C,EAAMkL,QAAUlL,EAAM6O,OACtB7O,EAAMoL,QAAU,EAEhBvmB,EAAO,CAAEsR,KAAM6J,EAAMoL,SACrBpG,EAAM+G,GAz5BA,EAy5BgB/L,EAAMgM,KAAM,EAAG,GAAIhM,EAAMkL,QAAS,EAAGlL,EAAMoM,KAAMvnB,GACvEmb,EAAMoL,QAAUvmB,EAAKsR,KAEjB6O,EAAK,CACP3K,EAAK8E,IAAM,2BACXa,EAAMwL,KAAOyC,GACb,KACF,CAEAjO,EAAM6C,KAAO,EACb7C,EAAMwL,KA/3BU,MAi4BlB,KAj4BkB,MAk4BhB,KAAOxL,EAAM6C,KAAO7C,EAAM2O,KAAO3O,EAAM4O,OAAO,CAC5C,KACE9D,EAAO9K,EAAMkL,QAAQT,GAAS,GAAKzK,EAAMoL,SAAW,GACpD2B,EAAYjC,IAAS,GACrBkC,EAAWlC,IAAS,GAAM,IAC1BmC,EAAkB,MAAPnC,IAENiC,GAAc5W,IANZ,CAQP,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CAEV,CACA,GAAI8W,EAAW,GAEbxC,KAAUsC,EACV5W,GAAQ4W,EAER/M,EAAMgM,KAAKhM,EAAM6C,QAAUoK,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADA7W,EAAI2W,EAAY,EACT5W,EAAOC,GAAG,CACf,GAAa,IAATyM,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAMA,GAHAsU,KAAUsC,EACV5W,GAAQ4W,EAEW,IAAf/M,EAAM6C,KAAY,CACpBxI,EAAK8E,IAAM,4BACXa,EAAMwL,KAAOyC,GACb,KACF,CACAhb,EAAM+M,EAAMgM,KAAKhM,EAAM6C,KAAO,GAC9BkD,EAAO,GAAY,EAAP0E,GAEZA,KAAU,EACVtU,GAAQ,CAEV,MAAA,GACsB,KAAb8W,EAAiB,CAGxB,IADA7W,EAAI2W,EAAY,EACT5W,EAAOC,GAAG,CACf,GAAa,IAATyM,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAGAsU,KAAUsC,EACV5W,GAAQ4W,EAER9Z,EAAM,EACN8S,EAAO,GAAY,EAAP0E,GAEZA,KAAU,EACVtU,GAAQ,CAEV,KACK,CAGH,IADAC,EAAI2W,EAAY,EACT5W,EAAOC,GAAG,CACf,GAAa,IAATyM,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAGAsU,KAAUsC,EACV5W,GAAQ4W,EAER9Z,EAAM,EACN8S,EAAO,IAAa,IAAP0E,GAEbA,KAAU,EACVtU,GAAQ,CAEV,CACA,GAAI6J,EAAM6C,KAAOkD,EAAO/F,EAAM2O,KAAO3O,EAAM4O,MAAO,CAChDvU,EAAK8E,IAAM,4BACXa,EAAMwL,KAAOyC,GACb,KACF,CACA,KAAOlI,KACL/F,EAAMgM,KAAKhM,EAAM6C,QAAU5P,CAE/B,CACF,CAGA,GAAI+M,EAAMwL,OAASyC,GAAO,MAG1B,GAAwB,IAApBjO,EAAMgM,KAAK,KAAY,CACzB3R,EAAK8E,IAAM,uCACXa,EAAMwL,KAAOyC,GACb,KACF,CAcA,GATAjO,EAAMoL,QAAU,EAEhBvmB,EAAO,CAAEsR,KAAM6J,EAAMoL,SACrBpG,EAAM+G,GA3hCD,EA2hCgB/L,EAAMgM,KAAM,EAAGhM,EAAM2O,KAAM3O,EAAMkL,QAAS,EAAGlL,EAAMoM,KAAMvnB,GAG9Emb,EAAMoL,QAAUvmB,EAAKsR,KAGjB6O,EAAK,CACP3K,EAAK8E,IAAM,8BACXa,EAAMwL,KAAOyC,GACb,KACF,CAaA,GAXAjO,EAAMqL,SAAW,EAGjBrL,EAAMmL,SAAWnL,EAAM8O,QACvBjqB,EAAO,CAAEsR,KAAM6J,EAAMqL,UACrBrG,EAAM+G,GA3iCA,EA2iCgB/L,EAAMgM,KAAMhM,EAAM2O,KAAM3O,EAAM4O,MAAO5O,EAAMmL,SAAU,EAAGnL,EAAMoM,KAAMvnB,GAG1Fmb,EAAMqL,SAAWxmB,EAAKsR,KAGlB6O,EAAK,CACP3K,EAAK8E,IAAM,wBACXa,EAAMwL,KAAOyC,GACb,KACF,CAGA,GADAjO,EAAMwL,KAAOsC,GACTnL,IAAUjG,GAAW,MAAM4T,EAEjC,KAAKxC,GACH9N,EAAMwL,KAAOuC,GAEf,KAAKA,GACH,GAAIlL,GAAQ,GAAKD,GAAQ,IAAK,CAE5BvI,EAAK+F,SAAW4P,EAChB3V,EAAK4F,UAAY2C,EACjBvI,EAAK0G,QAAU2F,EACfrM,EAAKyG,SAAW+B,EAChB7C,EAAMyK,KAAOA,EACbzK,EAAM7J,KAAOA,EAEb+T,GAAQ7P,EAAM+P,GAEd4F,EAAM3V,EAAK+F,SACXF,EAAS7F,EAAK6F,OACd0C,EAAOvI,EAAK4F,UACZyG,EAAOrM,EAAK0G,QACZ/Q,EAAQqK,EAAKrK,MACb6S,EAAOxI,EAAKyG,SACZ2J,EAAOzK,EAAMyK,KACbtU,EAAO6J,EAAM7J,KAGT6J,EAAMwL,OAASmC,KACjB3N,EAAM+O,MAAO,GAEf,KACF,CAEA,IADA/O,EAAM+O,KAAO,EAEXjE,EAAO9K,EAAMkL,QAAQT,GAAS,GAAKzK,EAAMoL,SAAW,GACpD2B,EAAYjC,IAAS,GACrBkC,EAAWlC,IAAS,GAAM,IAC1BmC,EAAkB,MAAPnC,IAEPiC,GAAa5W,IANV,CAQP,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CAEV,CACA,GAAI6W,KAAsB,IAAVA,GAAuB,CAIrC,IAHAiD,EAAYlD,EACZmD,EAAUlD,EACVmD,EAAWlD,EAETnC,EAAO9K,EAAMkL,QAAQiF,IACX1F,GAAS,GAAMwF,EAAYC,GAAY,IAAoCD,IACrFlD,EAAYjC,IAAS,GACrBkC,EAAWlC,IAAS,GAAM,IAC1BmC,EAAkB,MAAPnC,IAENmF,EAAYlD,GAAc5W,IAPxB,CASP,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CAEV,CAEAsU,KAAUwF,EACV9Z,GAAQ8Z,EAERjQ,EAAM+O,MAAQkB,CAChB,CAOA,GALAxF,KAAUsC,EACV5W,GAAQ4W,EAER/M,EAAM+O,MAAQhC,EACd/M,EAAMjf,OAASksB,EACC,IAAZD,EAAe,CAIjBhN,EAAMwL,KAjmCO,MAkmCb,KACF,CACA,GAAc,GAAVwB,EAAc,CAEhBhN,EAAM+O,MAAO,EACb/O,EAAMwL,KAAOmC,GACb,KACF,CACA,GAAc,GAAVX,EAAc,CAChB3S,EAAK8E,IAAM,8BACXa,EAAMwL,KAAOyC,GACb,KACF,CACAjO,EAAMpI,MAAkB,GAAVoV,EACdhN,EAAMwL,KApnCY,MAsnCpB,KAtnCoB,MAunClB,GAAIxL,EAAMpI,MAAO,CAGf,IADAxB,EAAI4J,EAAMpI,MACHzB,EAAOC,GAAG,CACf,GAAa,IAATyM,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA6J,EAAMjf,QAAU0pB,GAAS,GAAKzK,EAAMpI,OAAS,EAE7C6S,KAAUzK,EAAMpI,MAChBzB,GAAQ6J,EAAMpI,MAEdoI,EAAM+O,MAAQ/O,EAAMpI,KACtB,CAEAoI,EAAMgP,IAAMhP,EAAMjf,OAClBif,EAAMwL,KAzoCU,MA2oClB,KA3oCkB,MA4oChB,KACEV,EAAO9K,EAAMmL,SAASV,GAAS,GAAKzK,EAAMqL,UAAY,GACtD0B,EAAYjC,IAAS,GACrBkC,EAAWlC,IAAS,GAAM,IAC1BmC,EAAkB,MAAPnC,IAENiC,GAAc5W,IANZ,CAQP,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CAEV,CACA,KAAe,IAAV6W,GAAuB,CAI1B,IAHAiD,EAAYlD,EACZmD,EAAUlD,EACVmD,EAAWlD,EAETnC,EAAO9K,EAAMmL,SAASgF,IACZ1F,GAAS,GAAMwF,EAAYC,GAAY,IAAoCD,IACrFlD,EAAYjC,IAAS,GACrBkC,EAAWlC,IAAS,GAAM,IAC1BmC,EAAkB,MAAPnC,IAENmF,EAAYlD,GAAc5W,IAPxB,CASP,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CAEV,CAEAsU,KAAUwF,EACV9Z,GAAQ8Z,EAERjQ,EAAM+O,MAAQkB,CAChB,CAMA,GAJAxF,KAAUsC,EACV5W,GAAQ4W,EAER/M,EAAM+O,MAAQhC,EACA,GAAVC,EAAc,CAChB3S,EAAK8E,IAAM,wBACXa,EAAMwL,KAAOyC,GACb,KACF,CACAjO,EAAMyO,OAASxB,EACfjN,EAAMpI,MAAoB,GAAXoV,EACfhN,EAAMwL,KA9rCa,MAgsCrB,KAhsCqB,MAisCnB,GAAIxL,EAAMpI,MAAO,CAGf,IADAxB,EAAI4J,EAAMpI,MACHzB,EAAOC,GAAG,CACf,GAAa,IAATyM,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA6J,EAAMyO,QAAUhE,GAAS,GAAKzK,EAAMpI,OAAS,EAE7C6S,KAAUzK,EAAMpI,MAChBzB,GAAQ6J,EAAMpI,MAEdoI,EAAM+O,MAAQ/O,EAAMpI,KACtB,CAEA,GAAIoI,EAAMyO,OAASzO,EAAMqK,KAAM,CAC7BhQ,EAAK8E,IAAM,gCACXa,EAAMwL,KAAOyC,GACb,KACF,CAGAjO,EAAMwL,KAztCW,MA2tCnB,KA3tCmB,MA4tCjB,GAAa,IAAT5I,EAAc,MAAM0N,EAExB,GADAvK,EAAOqE,EAAOxH,EACV5C,EAAMyO,OAAS1I,EAAM,CAEvB,GADAA,EAAO/F,EAAMyO,OAAS1I,EAClBA,EAAO/F,EAAMsK,OACXtK,EAAMyL,KAAM,CACdpR,EAAK8E,IAAM,gCACXa,EAAMwL,KAAOyC,GACb,KACF,CAiBElI,EAAO/F,EAAMuK,OACfxE,GAAQ/F,EAAMuK,MACdS,EAAOhL,EAAMT,MAAQwG,GAGrBiF,EAAOhL,EAAMuK,MAAQxE,EAEnBA,EAAO/F,EAAMjf,SAAUglB,EAAO/F,EAAMjf,QACxCkqB,EAAcjL,EAAMliB,MACtB,MAEEmtB,EAAc/K,EACd8K,EAAOgF,EAAMhQ,EAAMyO,OACnB1I,EAAO/F,EAAMjf,OAEXglB,EAAOnD,IAAQmD,EAAOnD,GAC1BA,GAAQmD,EACR/F,EAAMjf,QAAUglB,EAChB,GACE7F,EAAO8P,KAAS/E,EAAYD,aACnBjF,GACU,IAAjB/F,EAAMjf,SAAgBif,EAAMwL,KAAOuC,IACvC,MACF,KA5wCiB,MA6wCf,GAAa,IAATnL,EAAc,MAAM0N,EACxBpQ,EAAO8P,KAAShQ,EAAMjf,OACtB6hB,IACA5C,EAAMwL,KAAOuC,GACb,MACF,KAAKC,GACH,GAAIhO,EAAMgB,KAAM,CAEd,KAAO7K,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IAEA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAaA,GAXAiU,GAAQxH,EACRvI,EAAKgG,WAAa+J,EAClBpK,EAAMuO,OAASnE,EACG,EAAbpK,EAAMgB,MAAaoJ,IACtB/P,EAAKkB,MAAQyE,EAAMsO,MAEdtO,EAAMqO,MAAQtS,GAAQiE,EAAMsO,MAAOpO,EAAQkK,EAAM4F,EAAM5F,GAAQ9O,GAAU0E,EAAMsO,MAAOpO,EAAQkK,EAAM4F,EAAM5F,IAGjHA,EAAOxH,EAEW,EAAb5C,EAAMgB,OAAchB,EAAMqO,MAAQ5D,EAAOyD,GAAQzD,MAAWzK,EAAMsO,MAAO,CAC5EjU,EAAK8E,IAAM,uBACXa,EAAMwL,KAAOyC,GACb,KACF,CAEAxD,EAAO,EACPtU,EAAO,CAGT,CACA6J,EAAMwL,KAjzCI,MAmzCZ,KAnzCY,MAozCV,GAAIxL,EAAMgB,MAAQhB,EAAMqO,MAAO,CAE7B,KAAOlY,EAAO,IAAI,CAChB,GAAa,IAAT0M,EAAc,MAAMyN,EACxBzN,IACA4H,GAAQza,EAAM0W,MAAWvQ,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb6J,EAAMgB,MAAayJ,KAAwB,WAAdzK,EAAMuO,OAAqB,CAC3DlU,EAAK8E,IAAM,yBACXa,EAAMwL,KAAOyC,GACb,KACF,CAEAxD,EAAO,EACPtU,EAAO,CAGT,CACA6J,EAAMwL,KAv0CE,MAy0CV,KAz0CU,MA00CRxG,EAAMoI,GACN,MAAMkD,EACR,KAAKrC,GACHjJ,EAAMuI,GACN,MAAM+C,EACR,KA70CS,MA80CP,OAAO9C,GAGT,QACE,OAAOF,GAyCb,OA3BAjT,EAAK+F,SAAW4P,EAChB3V,EAAK4F,UAAY2C,EACjBvI,EAAK0G,QAAU2F,EACfrM,EAAKyG,SAAW+B,EAChB7C,EAAMyK,KAAOA,EACbzK,EAAM7J,KAAOA,GAGT6J,EAAMT,OAAU6K,IAAS/P,EAAK4F,WAAaD,EAAMwL,KAAOyC,KACvCjO,EAAMwL,KAAOwC,IAASrL,IAAUuK,MAC/CyC,GAAatV,EAAMA,EAAK6F,OAAQ7F,EAAK+F,SAAUgK,EAAO/P,EAAK4F,WAEjEkK,GAAO9P,EAAKyG,SACZsJ,GAAQ/P,EAAK4F,UACb5F,EAAK4G,UAAYkJ,EACjB9P,EAAKgG,WAAa+J,EAClBpK,EAAMuO,OAASnE,EACG,EAAbpK,EAAMgB,MAAaoJ,IACtB/P,EAAKkB,MAAQyE,EAAMsO,MAChBtO,EAAMqO,MAAQtS,GAAQiE,EAAMsO,MAAOpO,EAAQkK,EAAM/P,EAAK+F,SAAWgK,GAAQ9O,GAAU0E,EAAMsO,MAAOpO,EAAQkK,EAAM/P,EAAK+F,SAAWgK,IAEnI/P,EAAKC,UAAY0F,EAAM7J,MAAQ6J,EAAM1G,KAAO,GAAK,IAC9B0G,EAAMwL,OAASmC,GAAO,IAAM,IAC5B3N,EAAMwL,OAASsC,IAAQ9N,EAAMwL,OAASqC,GAAQ,IAAM,IACzD,IAAR1D,GAAsB,IAATC,GAAezH,IAAUuK,KAAelI,IAAQmI,KACjEnI,EAAM9H,IAED8H,GAoGR0L,WAhGmBrW,IAElB,GAAI4U,GAAkB5U,GACpB,OAAOiT,GAGT,IAAItN,EAAQ3F,EAAK2F,MAKjB,OAJIA,EAAMliB,SACRkiB,EAAMliB,OAAS,MAEjBuc,EAAK2F,MAAQ,KACNmN,IAsFRwD,iBAlFwB,CAACtW,EAAMqF,KAG9B,GAAIuP,GAAkB5U,GAAS,OAAOiT,GACtC,MAAMtN,EAAQ3F,EAAK2F,MACnB,OAAkB,EAAbA,EAAMgB,MAGXhB,EAAMN,KAAOA,EACbA,EAAK6Q,MAAO,EACLpD,IAL8BG,IA8EtCsD,qBArE4B,CAACvW,EAAMiM,KAClC,MAAMC,EAAaD,EAAWvlB,OAE9B,IAAIif,EACA6Q,EACA7L,EAGJ,OAAIiK,GAAkB5U,GAAgBiT,IACtCtN,EAAQ3F,EAAK2F,MAEM,IAAfA,EAAMgB,MAAchB,EAAMwL,OAASkC,GAC9BJ,GAILtN,EAAMwL,OAASkC,KACjBmD,EAAS,EAETA,EAASvV,GAAUuV,EAAQvK,EAAYC,EAAY,GAC/CsK,IAAW7Q,EAAMsO,OACZf,IAKXvI,EAAM2K,GAAatV,EAAMiM,EAAYC,EAAYA,GAC7CvB,GACFhF,EAAMwL,KAx7CK,MAy7CJgC,KAETxN,EAAMoO,SAAW,EAEVjB,OAqCR2D,YAxBiB,sCAkFlB,IAAIC,GApCJ,WAEErnB,KAAKqF,KAAa,EAElBrF,KAAKoJ,KAAa,EAElBpJ,KAAK8mB,OAAa,EAElB9mB,KAAKmc,GAAa,EAElBnc,KAAKkO,MAAa,KAElBlO,KAAK+mB,UAAa,EAWlB/mB,KAAKhL,KAAa,GAIlBgL,KAAKkc,QAAa,GAIlBlc,KAAKic,KAAa,EAElBjc,KAAK6mB,MAAa,CACpB,EAIA,MAAMllB,GAAWjL,OAAOmN,UAAUlC,UAK5B+Q,WACJA,GAAAI,SAAYA,GAAAG,KACZA,GAAAC,aAAMA,GAAAC,YAAcA,GAAAE,eAAaA,GAAAC,aAAgBA,GAAAC,YAAcA,IAC7Dd,GAkFJ,SAAS6U,GAAU/qB,GACjByD,KAAKzD,QAAU4gB,GAAc,CAC3BoC,UAAW,MACX/D,WAAY,GACZ+L,GAAI,IACHhrB,GAAW,CAAA,GAEd,MAAMijB,EAAMxf,KAAKzD,QAIbijB,EAAI7lB,KAAQ6lB,EAAIhE,YAAc,GAAOgE,EAAIhE,WAAa,KACxDgE,EAAIhE,YAAcgE,EAAIhE,WACC,IAAnBgE,EAAIhE,aAAoBgE,EAAIhE,YAAa,OAI1CgE,EAAIhE,YAAc,GAAOgE,EAAIhE,WAAa,KACzCjf,GAAWA,EAAQif,aACvBgE,EAAIhE,YAAc,IAKfgE,EAAIhE,WAAa,IAAQgE,EAAIhE,WAAa,KAGvB,GAAjBgE,EAAIhE,aACPgE,EAAIhE,YAAc,KAItBxb,KAAKuV,IAAS,EACdvV,KAAKyV,IAAS,GACdzV,KAAK0f,OAAS,EACd1f,KAAKyd,OAAS,GAEdzd,KAAK2Q,KAAS,IAAIoO,GAClB/e,KAAK2Q,KAAK4F,UAAY,EAEtB,IAAIkE,EAAU0L,GAAYP,aACxB5lB,KAAK2Q,KACL6O,EAAIhE,YAGN,GAAIf,IAAWxH,GACb,MAAM,IAAI0M,MAAMnN,GAASiI,IAQ3B,GALAza,KAAK+b,OAAS,IAAIsL,GAElBlB,GAAYc,iBAAiBjnB,KAAK2Q,KAAM3Q,KAAK+b,QAGzCyD,EAAI5C,aAEwB,iBAAnB4C,EAAI5C,WACb4C,EAAI5C,WAAauB,GAAmBqB,EAAI5C,YACG,yBAAlCjb,GAASoC,KAAKyb,EAAI5C,cAC3B4C,EAAI5C,WAAa,IAAI/S,WAAW2V,EAAI5C,aAElC4C,EAAI7lB,MACN8gB,EAAS0L,GAAYe,qBAAqBlnB,KAAK2Q,KAAM6O,EAAI5C,YACrDnC,IAAWxH,KACb,MAAM,IAAI0M,MAAMnN,GAASiI,GAIjC,CAiNA,SAAS+M,GAAUlhB,EAAO/J,GACxB,MAAMkrB,EAAW,IAAIH,GAAU/qB,GAK/B,GAHAkrB,EAASpuB,KAAKiN,GAGVmhB,EAASlS,IAAK,MAAMkS,EAAShS,KAAOjD,GAASiV,EAASlS,KAE1D,OAAOkS,EAAS9J,MAClB,CA/LA2J,GAAUzjB,UAAUxK,KAAO,SAAU9C,EAAMypB,GACzC,MAAMrP,EAAO3Q,KAAK2Q,KACZ4O,EAAYvf,KAAKzD,QAAQgjB,UACzB3C,EAAa5c,KAAKzD,QAAQqgB,WAChC,IAAInC,EAAQwF,EAAayH,EAEzB,GAAI1nB,KAAK0f,MAAO,OAAO,EAevB,IAbiCO,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBlN,GAAWJ,GAGxB,yBAAxB/Q,GAASoC,KAAKxN,GAChBoa,EAAKrK,MAAQ,IAAIuD,WAAWtT,GAE5Boa,EAAKrK,MAAQ/P,EAGfoa,EAAK0G,QAAU,EACf1G,EAAKyG,SAAWzG,EAAKrK,MAAMjP,SAElB,CAqBP,IApBuB,IAAnBsZ,EAAK4F,YACP5F,EAAK6F,OAAS,IAAI3M,WAAW0V,GAC7B5O,EAAK+F,SAAW,EAChB/F,EAAK4F,UAAYgJ,GAGnB9E,EAAS0L,GAAYE,QAAQ1V,EAAMsP,GAE/BxF,IAAWtH,IAAeyJ,IAC5BnC,EAAS0L,GAAYe,qBAAqBvW,EAAMiM,GAE5CnC,IAAWxH,GACbwH,EAAS0L,GAAYE,QAAQ1V,EAAMsP,GAC1BxF,IAAWnH,KAEpBmH,EAAStH,KAKNxC,EAAKyG,SAAW,GAChBqD,IAAWvH,IACXvC,EAAK2F,MAAMgB,KAAO,GACK,IAAvB/gB,EAAKoa,EAAK0G,UAEf8O,GAAYT,aAAa/U,GACzB8J,EAAS0L,GAAYE,QAAQ1V,EAAMsP,GAGrC,OAAQxF,GACN,KAAKpH,GACL,KAAKC,GACL,KAAKH,GACL,KAAKI,GAGH,OAFAvT,KAAKmgB,MAAM1F,GACXza,KAAK0f,OAAQ,GACN,EAOX,GAFAgI,EAAiB/W,EAAK4F,UAElB5F,EAAK+F,WACgB,IAAnB/F,EAAK4F,WAAmBkE,IAAWvH,IAErC,GAAwB,WAApBlT,KAAKzD,QAAQgrB,GAAiB,CAEhC,IAAII,EAAgBxJ,GAAmBxN,EAAK6F,OAAQ7F,EAAK+F,UAErDkR,EAAOjX,EAAK+F,SAAWiR,EACvBE,EAAU1J,GAAmBxN,EAAK6F,OAAQmR,GAG9ChX,EAAK+F,SAAWkR,EAChBjX,EAAK4F,UAAYgJ,EAAYqI,EACzBA,GAAMjX,EAAK6F,OAAOrW,IAAIwQ,EAAK6F,OAAO3G,SAAS8X,EAAeA,EAAgBC,GAAO,GAErF5nB,KAAKkgB,OAAO2H,EAEd,MACE7nB,KAAKkgB,OAAOvP,EAAK6F,OAAOnf,SAAWsZ,EAAK+F,SAAW/F,EAAK6F,OAAS7F,EAAK6F,OAAO3G,SAAS,EAAGc,EAAK+F,WAMpG,GAAI+D,IAAWxH,IAA2B,IAAnByU,EAAvB,CAGA,GAAIjN,IAAWvH,GAIb,OAHAuH,EAAS0L,GAAYa,WAAWhnB,KAAK2Q,MACrC3Q,KAAKmgB,MAAM1F,GACXza,KAAK0f,OAAQ,GACN,EAGT,GAAsB,IAAlB/O,EAAKyG,SAAgB,KAVoB,CAW/C,CAEA,OAAO,CACT,EAWAkQ,GAAUzjB,UAAUqc,OAAS,SAAUtC,GACrC5d,KAAKyd,OAAOpkB,KAAKukB,EACnB,EAYA0J,GAAUzjB,UAAUsc,MAAQ,SAAU1F,GAEhCA,IAAWxH,KACW,WAApBjT,KAAKzD,QAAQgrB,GACfvnB,KAAK2d,OAAS3d,KAAKyd,OAAOzY,KAAK,IAE/BhF,KAAK2d,OAASR,GAAqBnd,KAAKyd,SAG5Czd,KAAKyd,OAAS,GACdzd,KAAKuV,IAAMkF,EACXza,KAAKyV,IAAMzV,KAAK2Q,KAAK8E,GACvB,EA+EA,IAMIqS,GAAc,CACjBC,QAPiBT,GAQjBjB,QAPemB,GAQfQ,WA1BD,SAAsB1hB,EAAO/J,GAG3B,OAFAA,EAAUA,GAAW,CAAA,GACb5C,KAAM,EACP6tB,GAAUlhB,EAAO/J,EAC1B,EAuBC0rB,OAPcT,IAWf,MAAMnH,QAAEA,GAAAxE,QAASA,GAAAyE,WAASA,GAAAb,KAAYA,IAASW,IAEzC2H,QAAEA,GAAA1B,QAASA,GAAA2B,WAASA,GAAAC,OAAYA,IAAWH,GAIjD,IAUII,GAAO,CACV7H,QAXeA,GAYfxE,QAXeA,GAYfyE,WAXkBA,GAYlBb,KAXYA,GAYZsI,QAXeA,GAYf1B,QAXeA,GAYf2B,WAXkBA,GAYlBC,OAXcA,GAYdE,UAXiB1V,ICzsNlB,MAAM2V,GAIJ,QAAAC,CAAS9xB,GACP,IAEE,MAAM+xB,EAAaJ,GAAKrM,QAAQtlB,GAGhC,GAAoB,oBAATgyB,KAAsB,CAE/B,IAAIC,EAAe,GACnB,IAAA,IAASpvB,EAAI,EAAGA,EAAIkvB,EAAWjxB,OAAQ+B,IACrCovB,GAAgB3vB,OAAOilB,aAAawK,EAAWlvB,IAEjD,OAAOmvB,KAAKC,EACd,CAAA,MAA6B,oBAAXC,OAETA,OAAOnH,KAAKgH,GAAY3mB,SAAS,UAEnCpL,CACT,OAAS2K,GAEP,OADAC,QAAQD,MAAM,sCAAuCA,GAC9C3K,CACT,CACF,CAKA,UAAAmyB,CAAWC,GACT,IAEE,IAAIC,EACJ,GAAoB,oBAATC,KAAsB,CAE/B,MAAML,EAAeK,KAAKF,GAC1BC,EAAa,IAAI/e,WAAW2e,EAAanxB,QACzC,IAAA,IAAS+B,EAAI,EAAGA,EAAIovB,EAAanxB,OAAQ+B,IACvCwvB,EAAWxvB,GAAKovB,EAAa1f,WAAW1P,EAE5C,KAAA,IAA6B,oBAAXqvB,OAKhB,OAAOE,EALiC,CAExC,MAAMG,EAASL,OAAOnH,KAAKqH,EAAgB,UAC3CC,EAAa,IAAI/e,WAAWif,EAC9B,CAEA,CAIA,OADqBZ,GAAK7B,QAAQuC,EAAY,CAAErB,GAAI,UAEtD,OAASrmB,GAEP,OADAC,QAAQD,MAAM,wCAAyCA,GAChDynB,CACT,CACF,CAKA,cAAAI,CAAexyB,GACb,OAAOA,EAAKc,OAAS,IACvB,ECjEF,MAAM2xB,GACJ,WAAArrB,CAA6BsrB,GAAAjpB,KAAAipB,OAAAA,CAA2B,CAExD,OAAAC,CAAQ5rB,EAAqB6rB,GAC3B,IAAIC,EAAoC9rB,EAExC,IAAA,MAAW+rB,KAASrpB,KAAKipB,OAAQ,CAC/B,IAAKG,EACH,OAAO,KAETA,EAAeC,EAAMH,QAAQE,EAAcD,EAC7C,CAEA,OAAOC,CACT,ECbF,MAAME,GACJ,WAAA3rB,CAA6B4rB,GAAAvpB,KAAAupB,QAAAA,CAAmB,CAEhD,OAAAL,CAAQ5rB,EAAqB6rB,GAC3B,OAAKnpB,KAAKupB,QAAQxjB,qBAAqBojB,EAAQnjB,WAAYmjB,EAAQrqB,YAI5DxB,EAHE,IAIX,ECTF,MAAMksB,GACJ,WAAA7rB,CAA6B8rB,GAAAzpB,KAAAypB,aAAAA,CAA6B,CAE1D,OAAAP,CAAQ5rB,EAAqB6rB,GAC3B,OAAIA,EAAQO,qBAAuB1pB,KAAKypB,aAAajjB,YAAYlJ,GACxD,KAGFA,CACT,ECRF,MAAMqsB,GACJ,WAAAhsB,CAA6BisB,GAAA5pB,KAAA4pB,WAAAA,CAAyB,CAEtD,OAAAV,CAAQ5rB,EAAqB6rB,GAC3B,MAAMU,EAAiBzmB,EAAU9F,GAEjC,IAAK6rB,EAAQjqB,oBAAsB2qB,EAAenkB,WAChD,OAAOmkB,EAGT,MAAMC,EAAgBrhB,KAAKC,UAAUmhB,EAAenkB,YAOpD,OANI1F,KAAK4pB,WAAWb,eAAee,KAChCD,EAAoEE,qBACnE/pB,KAAK4pB,WAAWvB,SAASyB,UACpBD,EAAenkB,YAGjBmkB,CACT,ECAF,MAAMG,GAOJ,WAAArsB,CAAYssB,EAAiC,IANrClqB,EAAAC,KAAA,WACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,cACAD,EAAAC,KAAA,YACAD,EAAAC,KAAA,kBAGNA,KAAKupB,QAAU,IAAI1jB,EACnB7F,KAAKypB,aAAe,IAAIxjB,EACxBjG,KAAK4pB,WAAa,IAAIxB,GACtBpoB,KAAKiqB,eAAiB,CACpBnrB,WAAYmrB,EAAenrB,YAAc,EACzC4qB,oBAAqBO,EAAeP,sBAAuB,EAC3DxqB,kBAAmB+qB,EAAe/qB,oBAAqB,EACvD8G,WAAYikB,EAAejkB,aAAc,GAE3ChG,KAAKkqB,SAAW,IAAIlB,GAAkB,CACpC,IAAIM,GAAYtpB,KAAKupB,SACrB,IAAIC,GAAiBxpB,KAAKypB,cAC1B,IAAIE,GAAc3pB,KAAK4pB,aAE3B,CAKA,OAAAV,CAAQ5rB,EAAqBf,EAA0B,IACrD,MAAM4sB,EAA2B,CAC/BrqB,WAAYvC,EAAQuC,YAAckB,KAAKiqB,eAAenrB,WACtD4qB,oBACEntB,EAAQmtB,qBAAuB1pB,KAAKiqB,eAAeP,oBACrDxqB,kBACE3C,EAAQ2C,mBAAqBc,KAAKiqB,eAAe/qB,kBACnD8G,WAAYzJ,EAAQyJ,YAAchG,KAAKiqB,eAAejkB,YAGxD,OAAOhG,KAAKkqB,SAAShB,QAAQ5rB,EAAO6rB,EACtC,CAKA,YAAAgB,CAAazpB,EAAwBnE,EAA0B,IAC7D,OAAOmE,EACJgD,IAAIpG,GAAS0C,KAAKkpB,QAAQ5rB,EAAOf,IACjCqB,OAAQN,GAA2C,OAAVA,EAC9C,CAKA,SAAA8sB,CAAU9sB,GACR,IACE,OAAOmL,KAAKC,UAAUpL,EACxB,OAAS4D,GAEP,OADAC,QAAQD,MAAM,0CAA2CA,GAClD,EACT,CACF,CAKA,WAAAmpB,CAAY9zB,GACV,IACE,OAAOkS,KAAK6hB,MAAM/zB,EACpB,OAAS2K,GAEP,OADAC,QAAQD,MAAM,4CAA6CA,GACpD,IACT,CACF,ECxFF,SAASqpB,KACP,GAA+B,oBAApBC,gBACT,OAAOA,gBAIT,MAAMC,EAAN,WAAA9sB,GACEoC,EAAAC,KAAA,WAAmB,EAAA,CAEnB,KAAA0qB,GACE1qB,KAAK2qB,SAAU,CACjB,EAeF,OAZA,MAGE,WAAAhtB,GAFAoC,EAAAC,KAAA,UAGEA,KAAK4qB,OAAS,IAAIH,CACpB,CAEA,KAAAC,GACE1qB,KAAK4qB,OAAOF,OACd,EAIJ,CAUAG,eAAeC,GAAcllB,EAAamlB,GACxC,OAAO,IAAIC,QAAQ,CAACC,EAASC,KAC3B,MAAMC,EAAM,IAAIC,eACV9iB,SAASyiB,WAAMziB,SAAU,MAK/B,GAHA6iB,EAAIE,KAAK/iB,EAAQ1C,GAAK,SAGlBmlB,WAAMO,QAAS,CACD,IAAIC,QAAQR,EAAKO,SACzBrqB,QAAQ,CAAChL,EAAOQ,KACT,MAATR,GACFk1B,EAAIK,iBAAiB/0B,EAAKoC,OAAO5C,KAGvC,CAGA,SAAI80B,WAAMH,OAAQ,CAChB,MAAMA,EAASG,EAAKH,OACpB,GAAIA,EAAOD,QAET,YADAO,EAAO,IAAIO,aAAa,UAAW,eAMrC,GAA0H,mBAA9Gb,EAAyFc,iBAClGd,EAAwFc,iBAAiB,QAAS,KACjHP,EAAIT,QACJQ,EAAO,IAAIO,aAAa,UAAW,qBAEhC,CAEL,MAAME,EAAeC,YAAY,KAC3BhB,EAAOD,UACTkB,cAAcF,GACdR,EAAIT,QACJQ,EAAO,IAAIO,aAAa,UAAW,iBAEpC,KAGGK,EAAU,IAAMD,cAAcF,GACpCR,EAAIO,iBAAiB,UAAWI,GAChCX,EAAIO,iBAAiB,QAASI,GAC9BX,EAAIO,iBAAiB,UAAWI,EAClC,CACF,CAGAX,EAAIY,OAAS,KACX,MAAMC,EAAgBb,EAAIc,wBACpBX,EAAkC,CAAA,EAExCU,EAAclnB,MAAM,MAAM7D,QAAQirB,IAChC,MAAMllB,EAAQklB,EAAKpnB,MAAM,MACrBkC,EAAM,IAAMA,EAAM,KACpBskB,EAAQtkB,EAAM,GAAGnQ,eAAiBmQ,EAAM,MAI5C,MAAMmlB,EAAkB,IAAIZ,QAAQD,GAC9Bc,EAAejB,EAAIiB,cAAgB,GACnCC,EAAclB,EAAImB,aAAe1mB,EACjC2mB,EAAiBpB,EAAI1Q,OAIrB+R,EAA8B,CAClCC,GAHiBF,GAAkB,KAAOA,EAAiB,IAI3D9R,OAAQ8R,EACRG,WANyBvB,EAAIuB,WAO7Bv3B,KAAM,QACNyQ,IAAKymB,EACLf,QAASa,EACTQ,YAAY,EACZC,KAAM,KACNC,UAAU,EACVC,YAAa,IAAM9B,QAAQC,QAAQ,IAAI8B,YAAY,IACnDC,KAAM,IAAMhC,QAAQC,QAAQ,IAAIgC,MAChCC,SAAU,IAAMlC,QAAQC,QAAQ,IAAIkC,UACpCC,KAAMvC,UACJ,IACE,OAAOpiB,KAAK6hB,MAAM8B,GAAgB,KACpC,CAAA,MACE,MAAM,IAAI5O,UAAU,wBACtB,GAEFnY,KAAM,IAAM2lB,QAAQC,QAAQmB,GAC5BiB,MAAO,KAEE,IACFb,EACHlB,QAAS,IAAIC,QAAQD,MAK3BL,EAAQuB,IAGVrB,EAAImC,QAAU,KACZpC,EAAO,IAAI1N,UAAU,4BAGvB2N,EAAIoC,UAAY,KACdrC,EAAO,IAAIvL,MAAM,qBAGnB,MAAMiN,EAAO,MAAA7B,OAAA,EAAAA,EAAM6B,KACfA,aAAgBO,UAAYP,aAAgBK,MAAwB,iBAATL,GAA8B,OAATA,EAClFzB,EAAIqC,KAAKZ,GACAA,EACTzB,EAAIqC,KAAK30B,OAAO+zB,IAEhBzB,EAAIqC,KAAK,OAGf,CA+DA3C,eAAe4C,GAAiB7nB,EAAarJ,EAA0B,IACrE,MAAM+L,OAAEA,EAAS,OAAAgjB,QAAQA,EAAU,CAAA,EAAAsB,KAAIA,EAAA9pB,QAAMA,EAAU,KAAUvG,EAG3DmxB,EAAa,IADUnD,MAEvBoD,EAAY3qB,WAAW,IAAM0qB,EAAWhD,QAAS5nB,GAEvD,IACE,MAAM8qB,EA5DV,WACE,GAAqB,mBAAVC,MAET,IAEE,OADA,IAAKtD,MACEsD,KACT,CAAA,MAEE,GAA8B,oBAAnBzC,eACT,OAAON,GAGT,MAAM,IAAInL,MAAM,8FAClB,CAIF,GAA8B,oBAAnByL,eACT,OAAON,GAIT,MAAM,IAAInL,MAAM,+JAClB,CAqCoBmO,GACVtB,QAAiBoB,EAAQhoB,EAAK,CAClC0C,SACAgjB,QAAS,CACP,eAAgB,sBACbA,GAELsB,OACAhC,OAAQ8C,EAAW9C,SAKrB,IAAIr0B,EAFJwM,aAAa4qB,GAGb,MAAMI,EAAcvB,EAASlB,QAAQrrB,IAAI,gBAOzC,OALE1J,EADEw3B,GAAeA,EAAYC,SAAS,0BACzBxB,EAASY,aAETZ,EAASnnB,OAGjB,CACLonB,GAAID,EAASC,GACbhS,OAAQ+R,EAAS/R,OACjBiS,WAAYF,EAASE,WACrBn2B,OAEJ,OAAS2K,GAEP,MADA6B,aAAa4qB,GACPzsB,CACR,CACF,CAyBO,SAAS+sB,GAAKroB,EAAarP,EAAegG,EAAmD,CAAA,GAElG,OAnBFsuB,eAA8BjlB,EAAarJ,EAA0B,IAInE,OAAOkxB,GAAiB7nB,EAAKrJ,EAC/B,CAcS2xB,CAAQtoB,EAAK,IAAKrJ,EAAS+L,OAAQ,OAAQskB,KADrB,iBAATr2B,EAAoBA,EAAOkS,KAAKC,UAAUnS,IAEhE,CCtRA,MAAM43B,GAIJ,aAAMC,CACJ1yB,EACAa,EAAwB,IAExB,MAAM0C,WACJA,EAAa,EAAAovB,aACbA,EAAe,IAAAC,SACfA,EAAW,IAAAC,YACXA,EAAc,KAAM,GAClBhyB,EAGEiyB,EAAmBv1B,KAAKC,IAAI+F,EAAY,KAE9C,IAAIwvB,EACAC,EAAQL,EAEZ,IAAA,IAASM,EAAU,EAAGA,GAAWH,EAAkBG,IACjD,IACE,aAAajzB,GACf,OAASwF,GAIP,GAHAutB,EAAYvtB,IAGRytB,EAAUH,GAAoBD,EAAYrtB,IAK5C,YAHMlB,KAAK4uB,MAAMF,GACjBA,EAAQz1B,KAAKC,IAAY,EAARw1B,EAAWJ,EAIhC,CAGF,MAAMG,CACR,CAKQ,KAAAG,CAAMC,GACZ,OAAO,IAAI7D,QAAQC,GAAWjoB,WAAWioB,EAAS4D,GACpD,CAKA,gBAAAC,CAAiB5tB,GAEf,GAAIA,aAAiBye,MAAO,CAC1B,MAAM/X,EAAU1G,EAAM0G,QAAQ/Q,cAC9B,OACE+Q,EAAQomB,SAAS,YACjBpmB,EAAQomB,SAAS,YACjBpmB,EAAQomB,SAAS,UACjBpmB,EAAQomB,SAAS,aAErB,CAGA,OAAO,CACT,EClEF,MAAMe,GAKJ,WAAApxB,CAAYY,EAAmBhC,EAAmC,IAJ1DwD,EAAAC,KAAA,aACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,qBAGNA,KAAKzB,UAAYA,EACjByB,KAAKgvB,aAAe,IAAIb,GACxBnuB,KAAKivB,kBAAoB1yB,EAAQ0C,YAAc,CACjD,CAKA,UAAMuuB,CAAKlwB,EAAqBf,EAAuB,IAErD,IAAKyD,KAAKzB,WAAgC,gBAAnByB,KAAKzB,UAC1B,OAAO,EAGT,MAAM2wB,YAAEA,GAAc,EAAMjwB,WAAYkwB,GAAkB5yB,EACpD0C,EAAakwB,GAAiBnvB,KAAKivB,kBAEzC,IACE,GAAIC,QACIlvB,KAAKgvB,aAAaZ,QACtBvD,UACE,MAAM2B,QAAiByB,GAAKjuB,KAAKzB,UAAWjB,GAC5C,IAAKkvB,EAASC,GACZ,MAAM,IAAI9M,MAAM,QAAQ6M,EAAS/R,WAAW+R,EAASE,cAEvD,OAAOF,GAET,CACEvtB,aACAsvB,YAAartB,GAASlB,KAAKgvB,aAAaF,iBAAiB5tB,SAGxD,CACL,MAAMsrB,QAAiByB,GAAKjuB,KAAKzB,UAAWjB,GAC5C,IAAKkvB,EAASC,GACZ,MAAM,IAAI9M,MAAM,QAAQ6M,EAAS/R,WAAW+R,EAASE,aAEzD,CAEA,OAAO,CACT,OAASxrB,GAEP,OADAC,QAAQD,MAAM,+BAAgCA,IACvC,CACT,CACF,CAKA,eAAMkuB,CAAU1uB,EAAwBnE,EAAuB,IAC7D,GAAsB,IAAlBmE,EAAOrJ,OACT,OAAO,EAIT,IAAK2I,KAAKzB,WAAgC,gBAAnByB,KAAKzB,UAC1B,OAAO,EAGT,MAAM2wB,YAAEA,GAAc,EAAMjwB,WAAYkwB,GAAkB5yB,EACpD0C,EAAakwB,GAAiBnvB,KAAKivB,kBAEzC,IACE,GAAIC,QACIlvB,KAAKgvB,aAAaZ,QACtBvD,UACE,MAAM2B,QAAiByB,GAAKjuB,KAAKzB,UAAW,CAAEmC,WAC9C,IAAK8rB,EAASC,GACZ,MAAM,IAAI9M,MAAM,QAAQ6M,EAAS/R,WAAW+R,EAASE,cAEvD,OAAOF,GAET,CACEvtB,aACAsvB,YAAartB,GAASlB,KAAKgvB,aAAaF,iBAAiB5tB,SAGxD,CACL,MAAMsrB,QAAiByB,GAAKjuB,KAAKzB,UAAW,CAAEmC,WAC9C,IAAK8rB,EAASC,GACZ,MAAM,IAAI9M,MAAM,QAAQ6M,EAAS/R,WAAW+R,EAASE,aAEzD,CAEA,OAAO,CACT,OAASxrB,GAEP,OADAC,QAAQD,MAAM,sCAAuCA,IAC9C,CACT,CACF,CAKA,YAAAmuB,CAAazpB,GACX5F,KAAKzB,UAAYqH,CACnB,CAKA,aAAA0pB,CAAcrwB,GACZe,KAAKivB,kBAAoBhwB,CAC3B,ECpHK,SAASswB,KACd,GAAmC,oBAAxBC,oBACT,OAAO,EAET,IACE,MAAM70B,EAAI,IAAI60B,oBAAoB,QAGlC,OAFA70B,EAAE80B,QAAQ,CAAEC,WAAY,CAAC,cACzB/0B,EAAEg1B,cACK,CACT,CAAA,MACE,OAAO,CACT,CACF,CAKO,SAASC,KACd,MAAuC,oBAAzBC,oBAChB,CAKO,SAASC,KACd,MAA4B,oBAAdC,SAChB,CC+WO,MAAMluB,GAAe,IA/X5B,MAGE,WAAAlE,GACE,GAHMoC,EAAAC,KAAA,UAA0B,MAGV,oBAAX5L,QAA0BA,OAAOyN,aAC1C,IACE,MAAMvK,EAAO,mBACblD,OAAOyN,aAAaE,QAAQzK,EAAMA,GAClClD,OAAOyN,aAAamuB,WAAW14B,GAC/B0I,KAAKiwB,QAAU77B,OAAOyN,YACxB,OAAS1D,GAET,CAEJ,CAEA,OAAA2D,CAAQrL,GACN,IAAKuJ,KAAKiwB,QACR,OAAO,KAET,IACE,OAAOjwB,KAAKiwB,QAAQnuB,QAAQrL,EAC9B,OAAS0H,GACP,OAAO,IACT,CACF,CAEA,OAAA4D,CAAQtL,EAAaR,GACnB,GAAK+J,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQluB,QAAQtL,EAAKR,EAC5B,OAASkI,GAET,CACF,CAEA,UAAA6xB,CAAWv5B,GACT,GAAKuJ,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQD,WAAWv5B,EAC1B,OAAS0H,GAET,CACF,CAEA,KAAAmD,GACE,GAAKtB,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQ3uB,OACf,OAASnD,GAET,CACF,GAsUW8D,GAAiB,IAhU9B,MAGE,WAAAtE,GACE,GAHMoC,EAAAC,KAAA,UAA0B,MAGV,oBAAX5L,QAA0BA,OAAO6N,eAC1C,IACE,MAAM3K,EAAO,mBACblD,OAAO6N,eAAeF,QAAQzK,EAAMA,GACpClD,OAAO6N,eAAe+tB,WAAW14B,GACjC0I,KAAKiwB,QAAU77B,OAAO6N,cACxB,OAAS9D,GAET,CAEJ,CAEA,OAAA2D,CAAQrL,GACN,IAAKuJ,KAAKiwB,QACR,OAAO,KAET,IACE,OAAOjwB,KAAKiwB,QAAQnuB,QAAQrL,EAC9B,OAAS0H,GACP,OAAO,IACT,CACF,CAEA,OAAA4D,CAAQtL,EAAaR,GACnB,GAAK+J,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQluB,QAAQtL,EAAKR,EAC5B,OAASkI,GAET,CACF,CAEA,UAAA6xB,CAAWv5B,GACT,GAAKuJ,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQD,WAAWv5B,EAC1B,OAAS0H,GAET,CACF,CAEA,KAAAmD,GACE,GAAKtB,KAAKiwB,QAGV,IACEjwB,KAAKiwB,QAAQ3uB,OACf,OAASnD,GAET,CACF,GAuQW+xB,GAAgB,IAjQ7B,MAAA,WAAAvyB,GACUoC,EAAAC,KAAA,WAAgCO,IAAA,CAExC,OAAAuB,CAAQrL,GACN,OAAOuJ,KAAKzJ,KAAK0J,IAAIxJ,IAAQ,IAC/B,CAEA,OAAAsL,CAAQtL,EAAaR,GACnB+J,KAAKzJ,KAAK4J,IAAI1J,EAAKR,EACrB,CAEA,UAAA+5B,CAAWv5B,GACTuJ,KAAKzJ,KAAKqK,OAAOnK,EACnB,CAEA,KAAA6K,GACEtB,KAAKzJ,KAAK+K,OACZ,GAiPW6uB,GAAmB,IA3OhC,MAAA,WAAAxyB,GACUoC,EAAAC,KAAA,SAAS,kBACTD,EAAAC,KAAA,YAAY,qBACZD,EAAAC,KAAA,KAAyB,MACzBD,EAAAC,KAAA,cAAuC,KAAA,CAE/C,UAAM+qB,GAEJ,QAAI/qB,KAAKowB,KAKLpwB,KAAKqwB,YACArwB,KAAKqwB,cAGQ,oBAAXj8B,SAA2BA,OAAO27B,aAK7C/vB,KAAKqwB,YAAc,IAAIrF,QAASC,IAC9B,MAAMiD,EAAU6B,UAAU1E,KAAKrrB,KAAKswB,OAAQ,GAE5CpC,EAAQZ,QAAU,KAChBttB,KAAKqwB,YAAc,KACnBpF,GAAQ,IAGViD,EAAQqC,UAAY,KAClBvwB,KAAKowB,GAAKlC,EAAQvQ,OAClB3d,KAAKqwB,YAAc,KACnBpF,GAAQ,IAGViD,EAAQsC,gBAAmBlzB,IACzB,MAAM8yB,EAAM9yB,EAAMxD,OAA4B6jB,OAC9C,IAAKyS,EAAGK,iBAAiBC,SAAS1wB,KAAK2wB,WAAY,CACnCP,EAAGQ,kBAAkB5wB,KAAK2wB,UAAW,CAAEE,QAAS,KAAMC,eAAe,IAC7EC,YAAY,MAAO,MAAO,CAAEC,QAAQ,GAC5C,KAIGhxB,KAAKqwB,aACd,CAEA,aAAMvuB,CAAQrL,GAIZ,OAHKuJ,KAAKowB,UACFpwB,KAAK+qB,OAER/qB,KAAKowB,GAIH,IAAIpF,QAASC,IAClB,IAAIgG,EACJ,IACEA,EAAcjxB,KAAKowB,GAAIa,YAAY,CAACjxB,KAAK2wB,WAAY,WACvD,OAASzvB,GAGP,OAFAC,QAAQD,MAAM,wDAAyDA,QACvE+pB,EAAQ,KAEV,CAGAgG,EAAY3D,QAAU,KACpBnsB,QAAQD,MAAM,8CAA+C+vB,EAAY/vB,OACzE+pB,EAAQ,OAGVgG,EAAYC,QAAU,KACpB/vB,QAAQD,MAAM,gDACd+pB,EAAQ,OAGV,MAEMiD,EAFQ+C,EAAYE,YAAYnxB,KAAK2wB,WACvB15B,MAAM,OACJgJ,IAAIxJ,GAE1By3B,EAAQqC,UAAY,KAClB,MAAM5S,EAASuQ,EAAQvQ,OACvBsN,EAAQtN,EAASA,EAAO1nB,MAAQ,OAGlCi4B,EAAQZ,QAAU,KAChBnsB,QAAQD,MAAM,0CAA2CgtB,EAAQhtB,OACjE+pB,EAAQ,SAnCH,IAsCX,CAEA,aAAMlpB,CAAQtL,EAAaR,GAIzB,OAHK+J,KAAKowB,UACFpwB,KAAK+qB,SAER/qB,KAAKowB,IAIH,IAAIpF,QAASC,IAClB,IAAIgG,EACJ,IACEA,EAAcjxB,KAAKowB,GAAIa,YAAY,CAACjxB,KAAK2wB,WAAY,YACvD,OAASzvB,GAGP,OAFAC,QAAQD,MAAM,gDAAiDA,QAC/D+pB,GAAQ,EAEV,CAGAgG,EAAY3D,QAAU,KACpBnsB,QAAQD,MAAM,uCAAwC+vB,EAAY/vB,OAClE+pB,GAAQ,IAGVgG,EAAYC,QAAU,KACpB/vB,QAAQD,MAAM,yCACd+pB,GAAQ,IAGV,MAAMmG,EAAQH,EAAYE,YAAYnxB,KAAK2wB,WAErCU,EADQD,EAAMn6B,MAAM,OACDgJ,IAAIxJ,GAE7B46B,EAAWd,UAAY,KACrB,MAAMh6B,EAAuE,CAAEE,MAAKR,QAAOq7B,UAAW9vB,KAAKC,OAC3G,IAAIysB,EAEAmD,EAAW1T,QACbpnB,EAAKkO,GAAM4sB,EAAW1T,OAA0BlZ,GAChDypB,EAAUkD,EAAM9K,IAAI/vB,IAEpB23B,EAAUkD,EAAMr4B,IAAIxC,GAGtB23B,EAAQqC,UAAY,KAClBtF,GAAQ,IAGViD,EAAQZ,QAAU,KAChBnsB,QAAQD,MAAM,8CAA+CgtB,EAAQhtB,OACrE+pB,GAAQ,KAIZoG,EAAW/D,QAAU,KACnBnsB,QAAQD,MAAM,0CAA2CmwB,EAAWnwB,OACpE+pB,GAAQ,KAGd,CAEA,gBAAM+E,CAAWv5B,GACf,QAAKuJ,KAAKowB,IAIH,IAAIpF,QAASC,IAClB,IAAIgG,EACJ,IACEA,EAAcjxB,KAAKowB,GAAIa,YAAY,CAACjxB,KAAK2wB,WAAY,YACvD,OAASzvB,GAGP,OAFAC,QAAQD,MAAM,2DAA4DA,QAC1E+pB,GAAQ,EAEV,CAGAgG,EAAY3D,QAAU,KACpBnsB,QAAQD,MAAM,iDAAkD+vB,EAAY/vB,OAC5E+pB,GAAQ,IAGVgG,EAAYC,QAAU,KACpB/vB,QAAQD,MAAM,mDACd+pB,GAAQ,IAGV,MAAMmG,EAAQH,EAAYE,YAAYnxB,KAAK2wB,WAErCzC,EADQkD,EAAMn6B,MAAM,OACJgJ,IAAIxJ,GAE1By3B,EAAQqC,UAAY,KAClB,GAAIrC,EAAQvQ,OAAQ,CAClB,MAAM4T,EAAgBH,EAAMxwB,OAAOstB,EAAQvQ,OAAOlZ,IAClD8sB,EAAchB,UAAY,IAAMtF,GAAQ,GACxCsG,EAAcjE,QAAU,KACtBnsB,QAAQD,MAAM,6CAA8CqwB,EAAcrwB,OAC1E+pB,GAAQ,GAEZ,MACEA,GAAQ,IAIZiD,EAAQZ,QAAU,KAChBnsB,QAAQD,MAAM,qDAAsDgtB,EAAQhtB,OAC5E+pB,GAAQ,KAGd,CAEA,YAAM/qB,GAIJ,OAHKF,KAAKowB,UACFpwB,KAAK+qB,OAER/qB,KAAKowB,GAIH,IAAIpF,QAASC,IAClB,MAEMiD,EAFcluB,KAAKowB,GAAIa,YAAY,CAACjxB,KAAK2wB,WAAY,YACjCQ,YAAYnxB,KAAK2wB,WACrBzwB,SAEtBguB,EAAQqC,UAAY,KAClB,MAAMiB,EAAUtD,EAAQvQ,OAAOja,IAAKC,IAAA,CAClClN,IAAKkN,EAAKlN,IACVR,MAAO0N,EAAK1N,SAEdg1B,EAAQuG,IAGVtD,EAAQZ,QAAU,KAChBrC,EAAQ,OAjBH,EAoBX,GCtYF,MAAMwG,GAWJ,WAAA9zB,CAAY+zB,EAAkB,KAC5B,GAXM3xB,EAAAC,KAAA,aAAa,8BACbD,EAAAC,KAAA,WACAD,EAAAC,KAAA,gBAAwB,GACxBD,EAAAC,KAAA,oBAAiDO,KACjDR,EAAAC,KAAA,YAA2BgrB,QAAQC,WAOrCyG,GAAW,EACb,MAAM,IAAI/R,MAAM,4CAElB3f,KAAK0xB,QAAUA,CACjB,CAKA,UAAM3G,GACJ,IAAK+E,KAEH,YADA9vB,KAAK2xB,cAAe,SAGAxB,GAAiBpF,SAErC/qB,KAAK2xB,cAAe,EACpBxwB,QAAQywB,KAAK,wFAEjB,CAKA,UAAMC,CAAKv0B,GACT,IAWE,OATA0C,KAAK8xB,UAAY9xB,KAAK8xB,UAAUC,KAAKlH,gBAC7B7qB,KAAKgyB,OAAO10B,KACjB20B,MAAM/wB,IAGP,MAFAC,QAAQD,MAAM,uCAAwCA,GAEhDA,UAGFlB,KAAK8xB,WACJ,CACT,OAAS5wB,GACPC,QAAQD,MAAM,sCAAuCA,GAErD,IACE,MAAMR,EAASV,KAAKkwB,cAAcjwB,IAAID,KAAKkyB,aAAe,GAM1D,OALIxxB,EAAOrJ,QAAU2I,KAAK0xB,SACxBhxB,EAAO6c,QAET7c,EAAOrH,KAAK2G,KAAKmyB,cAAc70B,IAC/B0C,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYxxB,IACjC,CACT,OAAS0xB,GAEP,OADAjxB,QAAQD,MAAM,gDAAiDkxB,IACxD,CACT,CACF,CACF,CAKA,YAAcJ,CAAO10B,GACnB,IAEE,MAAM+0B,EAAYryB,KAAKmyB,cAAc70B,GAE/BoD,QAAeV,KAAKE,SAQ1B,GAPIQ,EAAOrJ,QAAU2I,KAAK0xB,SAExBhxB,EAAO6c,QAGT7c,EAAOrH,KAAKg5B,GAERryB,KAAK2xB,aAAc,CACrB,MAAMp7B,EAAOyJ,KAAKsyB,cAAc5xB,GAChC,IAAKnK,EACH,MAAM,IAAIopB,MAAM,oCAGIwQ,GAAiBpuB,QAAQ/B,KAAKkyB,WAAY37B,KAG9DyJ,KAAK2xB,cAAe,EACpB3xB,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYxxB,GAE5C,MAEEV,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYxxB,EAE5C,OAASQ,GAGP,GAFAC,QAAQD,MAAM,mCAAoCA,IAE9ClB,KAAK2xB,aASP,MAAMzwB,EATe,CACrBlB,KAAK2xB,cAAe,EACpB,MAAMjxB,EAASV,KAAKkwB,cAAcjwB,IAAID,KAAKkyB,aAAe,GACtDxxB,EAAOrJ,QAAU2I,KAAK0xB,SACxBhxB,EAAO6c,QAET7c,EAAOrH,KAAK2G,KAAKmyB,cAAc70B,IAC/B0C,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYxxB,EAC1C,CAGF,CACF,CAKQ,aAAAyxB,CAAc70B,GAMpB,MAJgC,IAC3BA,EACHoI,WAAYpI,EAAMoI,WAAa1F,KAAKuyB,eAAej1B,EAAMoI,iBAAc,EAG3E,CAKQ,cAAA6sB,CAAej5B,EAA8BgK,EAAU,IAAI1J,SACjE,GAAmB,iBAARN,GAA4B,OAARA,EAC7B,OAAOA,EAGT,GAAIgK,EAAQxK,IAAIQ,GACd,MAAO,CAAA,EAGTgK,EAAQvK,IAAIO,GACZ,MAAMqkB,EAAkC,CAAA,EAExC,IAAA,MAAYlnB,EAAKR,KAAUS,OAAOC,QAAQ2C,GAEtCqkB,EAAOlnB,GADY,iBAAVR,GAAgC,OAAVA,EACjB+J,KAAKuyB,eAAet8B,EAAkCqN,GAEtDrN,EAIlB,OAAO0nB,CACT,CAKQ,aAAA2U,CAAch5B,GACpB,IACE,OAAOmP,KAAKC,UAAUpP,EACxB,OAAS4H,GAEP,IACE,GAAmB,iBAAR5H,GAA4B,OAARA,EAAc,CAC3C,MAAMk5B,EAAYxyB,KAAKuyB,eAAej5B,GACtC,OAAOmP,KAAKC,UAAU8pB,EACxB,CACA,OAAO/pB,KAAKC,UAAUpP,EACxB,OAAS6E,GAEP,OADAgD,QAAQD,MAAM,0DAA2D/C,GAClE,IACT,CACF,CACF,CAKA,YAAM+B,GACJ,IACE,GAAIF,KAAK2xB,aAAc,CACrB,MAAMp7B,QAAa45B,GAAiBruB,QAAQ9B,KAAKkyB,YACjD,OAAK37B,EAGEkS,KAAK6hB,MAAM/zB,GAFT,EAGX,CAEE,OAAOyJ,KAAKkwB,cAAcjwB,IAAID,KAAKkyB,aAAe,EAEtD,OAAShxB,GAGP,OAFAC,QAAQD,MAAM,wCAAyCA,GAEnDlB,KAAK2xB,cACP3xB,KAAK2xB,cAAe,EACb3xB,KAAKkwB,cAAcjwB,IAAID,KAAKkyB,aAAe,IAE7C,EACT,CACF,CAKA,YAAMO,CAAO/xB,GACX,IACE,MAAMgyB,QAAkB1yB,KAAKE,SACvByyB,EAAW,IAAIpyB,IAAIG,EAAOgD,IAAIvF,GAAK,CAAC6B,KAAKyG,YAAYtI,GAAIA,KAEzDy0B,EAAkBF,EAAU90B,OAAOO,IAAMw0B,EAAS75B,IAAIkH,KAAKyG,YAAYtI,KAE7E,GAA+B,IAA3By0B,EAAgBv7B,OAMlB,OALI2I,KAAK2xB,mBACDxB,GAAiBH,WAAWhwB,KAAKkyB,YAEvClyB,KAAKkwB,cAActvB,OAAOZ,KAAKkyB,aAE1B,EAGT,GAAIlyB,KAAK2xB,aAAc,CACrB,MAAMp7B,EAAOyJ,KAAKsyB,cAAcM,GAChC,IAAKr8B,EACH,MAAM,IAAIopB,MAAM,wCAElB,MAAMkT,QAAgB1C,GAAiBpuB,QAAQ/B,KAAKkyB,WAAY37B,GAChE,OAAKs8B,IAEH7yB,KAAK2xB,cAAe,EACpB3xB,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYU,IACjC,EAGX,CAEE,OADA5yB,KAAKkwB,cAAc/vB,IAAIH,KAAKkyB,WAAYU,IACjC,CAEX,OAAS1xB,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,IACjD,CACT,CACF,CAKA,WAAMI,GACJ,IAME,OALItB,KAAK2xB,mBACDxB,GAAiBH,WAAWhwB,KAAKkyB,YAEvClyB,KAAKkwB,cAActvB,OAAOZ,KAAKkyB,aAE1B,CACT,OAAShxB,GAEP,OADAC,QAAQD,MAAM,yCAA0CA,IACjD,CACT,CACF,CAKA,cAAM4xB,GAEJ,aADqB9yB,KAAKE,UACZ7I,MAChB,CAKQ,WAAAoP,CAAYnJ,GAClB,MAAO,GAAGA,EAAMnI,QAAQmI,EAAMtI,QAAQsI,EAAMqI,aAAarI,EAAMsI,KACjE,EChRF,MAAMmtB,GAAN,WAAAp1B,GACUoC,EAAAC,KAAA,QAAwB,IACxBD,EAAAC,KAAA,qBAAyDO,IAAA,CAEjE,GAAAxH,CAAIuE,EAAqBf,GAOvB,OANAyD,KAAKgzB,MAAM35B,KAAKiE,UAEZf,WAAS02B,kBACXjzB,KAAKkzB,eAAe/yB,IAAI7C,EAAOf,GAG1ByD,KAAKgzB,MAAM37B,MACpB,CAEA,IAAA8f,GACE,OAAOnX,KAAKgzB,MAAM37B,MACpB,CAEA,OAAA87B,GACE,OAA6B,IAAtBnzB,KAAKgzB,MAAM37B,MACpB,CAEA,KAAA+7B,GAIE,MAAM1yB,EAAS,IAAIV,KAAKgzB,OACxBhzB,KAAKgzB,MAAQ,GAEb,MAAMK,MAAkB9yB,IAcxB,OAZAG,EAAOO,QAAQ3D,IACb,MAAMf,EAAUyD,KAAKkzB,eAAejzB,IAAI3C,GACxC,SAAIf,WAAS02B,gBAAiB,CAC5B,MAAMxyB,EAAWlE,EAAQ02B,gBACpBI,EAAYv6B,IAAI2H,IACnB4yB,EAAYlzB,IAAIM,EAAU,IAE5B4yB,EAAYpzB,IAAIQ,GAAWpH,KAAKiE,EAClC,CACA0C,KAAKkzB,eAAetyB,OAAOtD,KAGtB,CAAEoD,SAAQ2yB,cACnB,ECpDF,MAAMC,GAKJ,WAAA31B,CACEpB,EAAsD,CAAA,EACrCg3B,GANXxzB,EAAAC,KAAA,QAA8C,MAC9CD,EAAAC,KAAA,aACAD,EAAAC,KAAA,aAIWA,KAAAuzB,QAAAA,EAEjBvzB,KAAKpB,UAAYrC,EAAQqC,WAAa,GACtCoB,KAAKnB,UAAYtC,EAAQsC,WAAa,GACxC,CAEA,QAAA20B,CAASC,GACgB,IAAnBzzB,KAAKpB,UAKL60B,GAAezzB,KAAKpB,UACtBoB,KAAKuzB,UAIgB,IAAnBvzB,KAAKnB,UAKJmB,KAAK0zB,QACR1zB,KAAK0zB,MAAQ1wB,WAAW,KACtBhD,KAAKuzB,WACJvzB,KAAKnB,YAPRmB,KAAKuzB,UAVLvzB,KAAKuzB,SAmBT,CAEA,KAAAjyB,GACMtB,KAAK0zB,QACP3wB,aAAa/C,KAAK0zB,OAClB1zB,KAAK0zB,MAAQ,KAEjB,CAEA,QAAAC,GACE,OAAO3zB,KAAK0zB,KACd,CAEA,UAAAE,CAAWr3B,QACiB,IAAtBA,EAAQqC,YACVoB,KAAKpB,UAAYrC,EAAQqC,gBAED,IAAtBrC,EAAQsC,YACVmB,KAAKnB,UAAYtC,EAAQsC,UAE7B,EC5CF,MAAMg1B,GACJ,WAAAl2B,CACmBm2B,EACAC,GADA/zB,KAAA8zB,OAAAA,EACA9zB,KAAA+zB,uBAAAA,CAChB,CAEH,kBAAMC,CACJtzB,EACA2yB,EACA92B,GAEA,IACE,MAAMs2B,QAAgB7yB,KAAK8zB,OAAO1E,UAAU1uB,EAAQ,CAAEzB,WAAY1C,EAAQ0C,cAErE4zB,GAAWt2B,EAAQwC,4BAChBiB,KAAK+zB,uBAAuBE,oBAAoBvzB,GAGxDV,KAAKk0B,kBAAkBb,EAAaR,EACtC,OAAS3xB,GACPC,QAAQD,MAAM,sCAAuCA,GAEjD3E,EAAQwC,4BACJiB,KAAK+zB,uBAAuBE,oBAAoBvzB,GAGxDV,KAAKk0B,kBAAkBb,GAAa,EACtC,CACF,CAEQ,iBAAAa,CACNb,EACAR,GAEAQ,EAAYpyB,QAAQ,CAACkzB,EAAgB1zB,KACnC,IACEA,EAAS0zB,EAAgBtB,EAC3B,OAAS3xB,GACPC,QAAQD,MAAM,iDAAkDA,EAClE,GAEJ,EC1CF,MAAMkzB,GACJ,WAAAz2B,CACmBm2B,EACAO,GADAr0B,KAAA8zB,OAAAA,EACA9zB,KAAAq0B,eAAAA,CAChB,CAEH,yBAAMJ,CAAoBvzB,GACxB,IAAA,MAAWpD,KAASoD,QACZV,KAAKq0B,eAAexC,KAAKv0B,EAEnC,CAEA,yBAAMg3B,CAAoB/3B,GACxB,IACE,MAAMmE,QAAeV,KAAKq0B,eAAen0B,SACzC,GAAsB,IAAlBQ,EAAOrJ,OACT,OAGF,IAAA,IAAS+B,EAAI,EAAGA,EAAIsH,EAAOrJ,OAAQ+B,GAAKmD,EAAQqC,UAAW,CACzD,MAAM21B,EAAQ7zB,EAAOlH,MAAMJ,EAAGA,EAAImD,EAAQqC,WAG1C,WAFsBoB,KAAK8zB,OAAO1E,UAAUmF,EAAO,CAAEt1B,WAAY1C,EAAQ0C,cAKvE,YAFMe,KAAKq0B,eAAe5B,OAAO8B,EAIrC,CACF,OAASrzB,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,CACF,EChBF,MAAMszB,GAgBJ,WAAA72B,CAAYY,EAAmBhC,EAA8B,IAfrDwD,EAAAC,KAAA,UACAD,EAAAC,KAAA,kBACAD,EAAAC,KAAA,cACAD,EAAAC,KAAA,kBACAD,EAAAC,KAAA,uBACAD,EAAAC,KAAA,0BACAD,EAAAC,KAAA,aACAD,EAAAC,KAAA,cACAD,EAAAC,KAAA,wBACAD,EAAAC,KAAA,QAA0B,QAC1BD,EAAAC,KAAA,gBAAwB,GACxBD,EAAAC,KAAA,eAAqC,MACrCD,EAAAC,KAAA,iBAAyB,GACzBD,EAAAC,KAAA,cAAoC,MAG1CA,KAAKf,WAAa1C,EAAQ0C,YAAc,EACxCe,KAAK8zB,OAAS,IAAI/E,GAAOxwB,EAAW,CAAEU,WAAYe,KAAKf,aACvDe,KAAKq0B,eAAiB,IAAI5C,GAAel1B,EAAQyC,uBAAyB,KAC1EgB,KAAKy0B,WAAa,IAAI1B,GACtB/yB,KAAK+zB,uBAAyB,IAAIK,GAAuBp0B,KAAK8zB,OAAQ9zB,KAAKq0B,gBAC3Er0B,KAAK00B,oBAAsB,IAAIb,GAAoB7zB,KAAK8zB,OAAQ9zB,KAAK+zB,wBACrE/zB,KAAKpB,UAAYrC,EAAQqC,WAAa,GACtCoB,KAAK20B,eAAiB,IAAIrB,GACxB,CACE10B,UAAWrC,EAAQqC,UACnBC,UAAWtC,EAAQsC,WAErB,KACOmB,KAAKiZ,UAGdjZ,KAAKjB,qBAAuBxC,EAAQwC,uBAAwB,EAG5DiB,KAAKqwB,YAAcrwB,KAAK+qB,MAC1B,CAEA,SAAI2I,GACF,OAAO1zB,KAAK20B,eAAehB,UAC7B,CAEA,QAAAiB,GACE,OAAO50B,KAAKsW,KACd,CAKA,UAAcyU,GACR/qB,KAAKjB,6BACDiB,KAAKq0B,eAAetJ,OACrB/qB,KAAK+zB,uBAAuBO,oBAAoB,CACnD11B,UAAWoB,KAAKpB,UAChBK,WAAYe,KAAKf,cAGrBe,KAAK60B,eAAgB,CACvB,CAKA,uBAAcC,IACP90B,KAAK60B,eAAiB70B,KAAKqwB,mBACxBrwB,KAAKqwB,WAEf,CAKA,GAAAt3B,CAAIuE,EAAqBf,GACvB,MAAMk3B,EAAczzB,KAAKy0B,WAAW17B,IAAIuE,EAAOf,GAC/CyD,KAAK20B,eAAenB,SAASC,GACV,SAAfzzB,KAAKsW,OAAoBmd,EAAc,IACzCzzB,KAAKsW,MAAQtW,KAAK0zB,MAAQ,YAAc1zB,KAAKsW,MAEjD,CAKA,cAAMye,CAASz3B,SACP0C,KAAK80B,oBACX90B,KAAKjH,IAAIuE,EACX,CAKA,WAAM2b,GAEAjZ,KAAKg1B,mBACAh1B,KAAKi1B,cAAgBjK,QAAQC,WAKlCjrB,KAAKy0B,WAAWtB,UACC,eAAfnzB,KAAKsW,MACPtW,KAAKsW,MAAQ,YACW,cAAftW,KAAKsW,QACdtW,KAAKsW,MAAQ,eAMXtW,KAAK80B,oBAGX90B,KAAKg1B,cAAe,EACpBh1B,KAAKsW,MAAQ,WACbtW,KAAKi1B,wBACHj1B,KAAK20B,eAAerzB,QAEpB,MAAMZ,OAAEA,EAAA2yB,YAAQA,GAAgBrzB,KAAKy0B,WAAWrB,QAEhD,UACQpzB,KAAK00B,oBAAoBV,aAAatzB,EAAQ2yB,EAAa,CAC/Dp0B,WAAYe,KAAKf,WACjBF,qBAAsBiB,KAAKjB,sBAE/B,CAAA,QACEiB,KAAKg1B,cAAe,EACpBh1B,KAAKi1B,aAAe,KAGfj1B,KAAKy0B,WAAWtB,UAQK,eAAfnzB,KAAKsW,MACdtW,KAAKsW,MAAQ,YAEbtW,KAAKsW,MAAQ,QAVbtW,KAAKsW,MAAuB,eAAftW,KAAKsW,MAAyB,aAAe,YAE1DtT,WAAW,KACThD,KAAKiZ,QAAQgZ,MAAM/wB,IACjBC,QAAQD,MAAM,yCAA0CA,MAEzD,GAMP,CACF,WAEMlB,KAAKi1B,aACb,CAKA,YAAA5F,CAAazpB,GACX5F,KAAK8zB,OAAOzE,aAAazpB,EAC3B,CAKA,aAAA0pB,CAAcrwB,GACZe,KAAKf,WAAaA,EAClBe,KAAK8zB,OAAOxE,cAAcrwB,EAC5B,CAKA,eAAAi2B,CAAgB34B,QACY,IAAtBA,EAAQqC,YACVoB,KAAKpB,UAAYrC,EAAQqC,WAE3BoB,KAAK20B,eAAef,WAAWr3B,EACjC,CAKA,sBAAM44B,GAEJ,aADMn1B,KAAK80B,oBACJ90B,KAAKq0B,eAAen0B,QAC7B,CAKA,0BAAMk1B,GAEJ,aADMp1B,KAAK80B,oBACJ90B,KAAKq0B,eAAevB,UAC7B,CAKA,yBAAMuC,GAEJ,aADMr1B,KAAK80B,oBACJ90B,KAAKq0B,eAAe/yB,OAC7B,CAKA,OAAAg0B,GACEt1B,KAAKsW,MAAQ,aACbtW,KAAK20B,eAAerzB,QAIpBtB,KAAKiZ,QAAQgZ,MAAM/wB,IACjBC,QAAQD,MAAM,2CAA4CA,IAE9D,CAKA,kBAAMq0B,GACJv1B,KAAKsW,MAAQ,aACbtW,KAAK20B,eAAerzB,cAEdtB,KAAKiZ,QACXjZ,KAAKsW,MAAQ,WACf,ECpPF,MAAMkf,GACJ,UAAAC,CACEC,EACAC,EACAC,GAEA,OAAID,EAAiB78B,IAAI48B,EAAO1gC,OAC9BmM,QAAQywB,KAAK,0BAA0B8D,EAAO1gC,+BACvC,KAGJ4gC,IACHz0B,QAAQD,MAAM,+CACP,EAIX,CAEA,OAAA20B,CAAQH,EAAuBE,GAC7B,IAEE,OADAF,EAAOG,QAAQD,IACR,CACT,OAAS10B,GAEP,OADAC,QAAQD,MAAM,2CAA2Cw0B,EAAO1gC,SAAUkM,IACnE,CACT,CACF,CAEA,SAAA40B,CAAUC,EAAoBL,EAAuBE,GACnD,GAAKF,EAAOI,WAAcF,EAI1B,IACEF,EAAOI,UAAUF,EACnB,OAAS10B,GACPC,QAAQD,MAAM,6CAA6C60B,MAAgB70B,EAC7E,CACF,ECnCF,MAAM80B,GAKJ,WAAAr4B,CAAYs4B,EAA6B,IAAIT,IAJrCz1B,EAAAC,KAAA,cAA0CO,KAC1CR,EAAAC,KAAA,kBAA0C,MAC1CD,EAAAC,KAAA,aAGNA,KAAKi2B,UAAYA,CACnB,CAKA,kBAAAC,CAAmBrhC,GACjBmL,KAAK41B,gBAAkB/gC,CACzB,CAKA,GAAAshC,CAAIT,GACG11B,KAAKi2B,UAAUR,WAAWC,EAAQ11B,KAAKo2B,QAASp2B,KAAK41B,kBAItD51B,KAAKi2B,UAAUJ,QAAQH,EAAQ11B,KAAK41B,kBACtC51B,KAAKo2B,QAAQj2B,IAAIu1B,EAAO1gC,KAAM0gC,EAElC,CAKA,KAAAW,CAAMN,GACJ,MAAML,EAAS11B,KAAKo2B,QAAQn2B,IAAI81B,GAC3BL,IAIL11B,KAAKi2B,UAAUH,UAAUC,EAAYL,EAAQ11B,KAAK41B,iBAClD51B,KAAKo2B,QAAQx1B,OAAOm1B,GACtB,CAKA,GAAA91B,CAAI81B,GACF,OAAO/1B,KAAKo2B,QAAQn2B,IAAI81B,EAC1B,CAKA,MAAA71B,GACE,OAAOzI,MAAM6pB,KAAKthB,KAAKo2B,QAAQntB,SACjC,CAKA,KAAA3H,GACE,IAAA,MAAWy0B,KAAc/1B,KAAKo2B,QAAQ78B,OACpCyG,KAAKq2B,MAAMN,EAEf,ECnDF,MAAMO,GAIJ,WAAA34B,GAHQoC,EAAAC,KAAA,YAA6B,IAC7BD,EAAAC,KAAA,YAAoBwB,KAAKC,MAIjC,CAKA,eAAA80B,CAAgBj5B,GACd0C,KAAKw2B,UAAUn9B,KAAKiE,EACtB,CAKA,UAAAm5B,GACE,MAAMC,MAAoBn8B,IACpBo8B,MAAqBp8B,IAC3B,IAAIq8B,EAAgB,EACpB,MAAMC,EAAkB,GAexB,OAbA72B,KAAKw2B,UAAUv1B,QAAQ3D,IACjBA,EAAM8B,UACRs3B,EAAc39B,IAAIuE,EAAM8B,UAEtB9B,EAAM4E,WACRy0B,EAAe59B,IAAIuE,EAAM4E,WAEvB5E,EAAM8K,WACRwuB,GAAiBt5B,EAAM8K,UAEzByuB,EAAMx9B,KAAKiE,EAAMsI,OAGZ,CACLkxB,GAAI92B,KAAKw2B,UAAUn/B,OACnB0/B,GAAIL,EAAcvf,KAClB6f,SAAUL,EAAexf,KACzB8f,YAAaj3B,KAAKw2B,UAAUn/B,OAAS,EAAIu/B,EAAgB52B,KAAKw2B,UAAUn/B,OAAS,EACjFw/B,QAEJ,CAKA,YAAAK,GACE,OAAOl3B,KAAKw2B,UAAU9yB,IAAIpG,GAASA,EAAMsI,IAC3C,CAKA,WAAAuxB,GACE,OAAO31B,KAAKC,MAAQzB,KAAKmI,SAC3B,CAKA,KAAAivB,GACEp3B,KAAKw2B,UAAY,GACjBx2B,KAAKmI,UAAY3G,KAAKC,KACxB,EC7EF,MAAM41B,GACJ,WAAA15B,CAA6BpB,GAAAyD,KAAAzD,QAAAA,CAAyC,CAEtE,QAAA+6B,CACEh6B,EACAi6B,EACAC,GAEA,GAAyB,eAArBl6B,EAAM2K,YAAoD,aAArB3K,EAAM2K,WAC7C,MAAO,GAGT,MAAMwvB,EAAsC,GAE5C,IAAA,MAAWC,KAAQH,EAAY,CAC7B,IAAKG,EAAKC,QACR,SAGF,MAAM1hC,EAAQ+J,KAAK43B,mBAAmBF,EAAMp6B,GAC5C,QAAc,IAAVrH,IAAwB+J,KAAK63B,YAAYH,EAAMzhC,GACjD,SAGF,MAAM6hC,EAAQ93B,KAAK+3B,YAAYL,EAAMzhC,EAAOqH,GAC5Ck6B,EAAOn+B,KAAKy+B,GACZL,EAAgBp+B,KAAKy+B,GACrB93B,KAAKzD,QAAQy7B,QAAQF,EACvB,CAEA,OAAOL,CACT,CAEQ,kBAAAG,CAAmBF,EAAiBp6B,GAC1C,MAAoB,SAAhBo6B,EAAKO,QAA0C,eAArB36B,EAAM2K,WAC3B3K,EAAM4K,QAAQgwB,KAEH,UAAhBR,EAAKO,QAA2C,eAArB36B,EAAM2K,WAC5B3K,EAAM4K,QAAQ2c,MAEH,aAAhB6S,EAAKO,QAA8C,aAArB36B,EAAM2K,WAC/B3K,EAAM4K,QAAQE,cADvB,CAIF,CAEQ,WAAAyvB,CAAYH,EAAiBzhC,GACnC,OAAQyhC,EAAKS,UACX,IAAK,IACH,OAAOliC,EAAQyhC,EAAKU,UACtB,IAAK,KACH,OAAOniC,GAASyhC,EAAKU,UACvB,IAAK,IACH,OAAOniC,EAAQyhC,EAAKU,UACtB,IAAK,KACH,OAAOniC,GAASyhC,EAAKU,UACvB,QACE,OAAO,EAEb,CAEQ,WAAAL,CACNL,EACAzhC,EACAqH,GAEA,IAAIoT,EAA0C,UAO9C,OANIza,EAAyB,EAAjByhC,EAAKU,UACf1nB,EAAQ,WACCza,EAAyB,IAAjByhC,EAAKU,YACtB1nB,EAAQ,SAGH,CACLjM,GAAI,SAASjD,KAAKC,SAASxI,KAAKyI,SAASC,SAAS,IAAInK,UAAU,EAAG,MACnE6gC,OAAQX,EAAKjzB,GACbiM,QACA9I,QAAS8vB,EAAK9vB,SAAW,GAAG8vB,EAAK1iC,SAASiB,EAAMqiC,QAAQ,aAAaZ,EAAKU,cAC1EniC,QACAmiC,UAAWV,EAAKU,UAChBzyB,UAAWnE,KAAKC,MAChBmE,IAAKtI,EAAMsI,IACX2yB,UAAU,EAEd,EC3FF,MAAMC,GAAN,WAAA76B,GACUoC,EAAAC,KAAA,QAAuB,KAAA,CAE/B,KAAAhD,CAAMy7B,GACJ,OAAIz4B,KAAK0zB,OAA2B,oBAAXt/B,SAIzB4L,KAAK0zB,MAAQt/B,OAAOw3B,YAAY,KAC9B6M,KACC,OALMz4B,KAAK0zB,KAQhB,CAEA,IAAAgF,GACO14B,KAAK0zB,OAA2B,oBAAXt/B,QAK1By3B,cAAc7rB,KAAK0zB,OACnB1zB,KAAK0zB,MAAQ,MALX1zB,KAAK0zB,MAAQ,IAMjB,CAEA,QAAAC,GACE,OAAO3zB,KAAK0zB,KACd,ECxBF,MAAMiF,GACJ,KAAAC,CACEl4B,EACAyH,EACA0wB,GAEA,MAAMp3B,EAAMD,KAAKC,MACXzE,EAAQmL,GAAa1G,EAAM,KAC3B8Q,EAAMsmB,GAAWp3B,EAEjBq3B,EAAiBp4B,EAAO9C,OAC5BN,GAASA,EAAMqI,WAAa3I,GAASM,EAAMqI,WAAa4M,GAGpDwmB,EAAmBD,EAAel7B,OACtCN,GAA8B,eAArBA,EAAM2K,YAEX+wB,EAAiBF,EAAel7B,OACpCN,GAA8B,aAArBA,EAAM2K,YAEXgxB,EAAiBH,EAAel7B,OACpCN,GAA8B,aAArBA,EAAM2K,YAmBjB,MAAO,CACLixB,WAjBiB,CACjBC,IAAKn5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,OAChEmxB,IAAKr5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,OAChEoxB,IAAKt5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,OAChEgwB,KAAMl4B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,QACjEskB,SAAUxsB,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,YACrEqxB,SAAUv5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,YACrEsxB,aAAcx5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,gBACzE2c,MAAO7kB,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,SAClEuxB,iBAAkBz5B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,oBAC7EwxB,KAAM15B,KAAKo5B,QAAQL,EAAiBr1B,IAAIpG,GAASA,EAAM4K,SAAU,SAQjEyxB,UALgB35B,KAAK45B,qBAAqBZ,GAM1Ca,UALgB75B,KAAK85B,qBAAqBb,GAM1Cc,UAAW,CACT/8B,QACAuV,OAGN,CAEQ,oBAAAqnB,CAAqBZ,GAC3B,MAAMW,EAA6C,CACjD9U,MAAOmU,EAAe3hC,OACtB2iC,YAAa,EACbC,YAAa,EACbC,UAAW,EACXC,OAAQ,CAAA,GAGV,GAA8B,IAA1BnB,EAAe3hC,OACjB,OAAOsiC,EAGT,MAAMS,EAAYpB,EAAet1B,IAAIpG,GAASA,EAAM4K,QAAQ2c,OAAS,GAAGjnB,OAAOwL,GAAQA,EAAO,GAC1FgxB,EAAU/iC,OAAS,IACrBsiC,EAAUK,YAAcI,EAAUC,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAKojB,EAAU/iC,OACzEsiC,EAAUM,YAAchhC,KAAKkQ,OAAOixB,IAGtCT,EAAUO,UAAYlB,EAAeqB,OACnC,CAACE,EAAKj9B,IAAUi9B,GAAQj9B,EAAM4K,QAAyCiP,MAAQ,GAC/E,GAGF,MAAMqjB,MAAcj6B,IA0BpB,OAzBAy4B,EAAe/3B,QAAQ3D,IACrB,MAAM4K,EAAU5K,EAAM4K,QAChB/S,EAAO+S,EAAQuyB,cAAgB,UAChCD,EAAQ1hC,IAAI3D,IACfqlC,EAAQr6B,IAAIhL,EAAM,IAEpBqlC,EAAQv6B,IAAI9K,GAAOkE,KAAK6O,EAAQ2c,OAAS,KAG3C2V,EAAQv5B,QAAQ,CAACy5B,EAAOvlC,KACtB,MAAMwlC,EAAa3B,EAAep7B,OAAON,GACvBA,EAAM4K,QACPuyB,eAAiBtlC,GAGlCwkC,EAAUQ,OAAOhlC,GAAQ,CACvB+Z,MAAOwrB,EAAMrjC,OACb2iC,YAAaU,EAAML,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAK0jB,EAAMrjC,OACtD6iC,UAAWS,EAAWN,OAAO,CAACE,EAAKj9B,IAE1Bi9B,GADSj9B,EAAM4K,QACAiP,MAAQ,GAC7B,MAIAwiB,CACT,CAEQ,oBAAAG,CAAqBb,GAC3B,MAAMY,EAA6C,CACjDhV,MAAOoU,EAAe5hC,OACtB4/B,YAAa,EACb2D,YAAa,EACbC,OAAQ5B,EACLz/B,WACAkK,IAAIpG,IAAA,CACH8K,SAAU9K,EAAM4K,QAAQE,UAAY,EACpCD,UAAW7K,EAAM4K,QAAQC,WAAa,EACtCxC,UAAWrI,EAAMqI,cAIvB,GAA8B,IAA1BszB,EAAe5hC,OACjB,OAAOwiC,EAGT,MAAMiB,EAAY7B,EAAev1B,IAAIpG,GAASA,EAAM4K,QAAQE,UAAY,GAAGxK,OAAOwK,GAAYA,EAAW,GAMzG,OALI0yB,EAAUzjC,OAAS,IACrBwiC,EAAU5C,YAAc6D,EAAUT,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAK8jB,EAAUzjC,OACzEwiC,EAAUe,YAAc3hC,KAAKkQ,OAAO2xB,IAG/BjB,CACT,CAEQ,OAAAT,CAAQlxB,EAAwCzR,GACtD,MAAMwS,EAASf,EAAQxE,IAAIu0B,GAAUA,EAAOxhC,IAAQ,GAAGmH,OAAO3H,GAASA,EAAQ,GAC/E,OAAsB,IAAlBgT,EAAO5R,OACF,EAEF4R,EAAOoxB,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAK/N,EAAO5R,MACpD,EClIF,MAAM0jC,GACJ,WAAAp9B,CAA6Bu0B,GAAAlyB,KAAAkyB,WAAAA,CAAqB,CAElD,UAAML,CAAKnxB,EAA4B82B,GACrC,IACE,MAAMjhC,EAAsC,CAC1CmK,OAAQA,EAAOlH,OAAM,KACrBg+B,OAAQA,EAAOh+B,OAAM,KACrBmM,UAAWnE,KAAKC,aAEZ0uB,GAAiBpuB,QAAQ/B,KAAKkyB,WAAYzpB,KAAKC,UAAUnS,GACjE,OAAS2K,GACPC,QAAQD,MAAM,iDAAkDA,EAClE,CACF,CAEA,UAAMw4B,GACJ,IACE,MAAMsB,QAAgB7K,GAAiBruB,QAAQ9B,KAAKkyB,YACpD,OAAK8I,EAGEvyB,KAAK6hB,MAAM0Q,GAFT,CAAA,CAGX,OAAS95B,GAEP,OADAC,QAAQD,MAAM,mDAAoDA,GAC3D,CAAA,CACT,CACF,ECfK,MAAM+5B,GAaX,WAAAt9B,CAAYpB,EAAqC,IAZzCwD,EAAAC,KAAA,SAA6B,IAC7BD,EAAAC,KAAA,SAA6B,IAC7BD,EAAAC,KAAA,aAA0B,IAC1BD,EAAAC,KAAA,WACAD,EAAAC,KAAA,cACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,iBACSD,EAAAC,KAAA,eACAD,EAAAC,KAAA,qBACAD,EAAAC,KAAA,WACAD,EAAAC,KAAA,oBAGfA,KAAKzD,QAAU,CACb2+B,aAAc3+B,EAAQ2+B,eAAgB,EACtCC,kBAAmB5+B,EAAQ4+B,mBAAqBn7B,KAAKo7B,uBACrDpD,QAASz7B,EAAQy7B,SAAA,MAAmB,GACpC9F,WAAY31B,EAAQ21B,YAAc,iCAClCmJ,gBAAiB9+B,EAAQ8+B,iBAAmB,IAC5CC,cAAe/+B,EAAQ++B,eAAiB,QAG1Ct7B,KAAKkyB,WAAalyB,KAAKzD,QAAQ21B,WAC/BlyB,KAAKq7B,gBAAkBr7B,KAAKzD,QAAQ8+B,gBACpCr7B,KAAKs7B,cAAgBt7B,KAAKzD,QAAQ++B,cAClCt7B,KAAKu3B,WAAav3B,KAAKzD,QAAQ4+B,kBAC/Bn7B,KAAKiwB,QAAU,IAAI8K,GAA0B/6B,KAAKkyB,YAClDlyB,KAAKu7B,iBAAmB,IAAI/C,GAC5Bx4B,KAAKw7B,YAAc,IAAInE,GAAuB,CAC5CW,QAASF,IACP93B,KAAKzD,QAAQy7B,QAAQF,MAGzB93B,KAAKy7B,kBAAoB,IAAI9C,GAE7B34B,KAAK+qB,MACP,CAKQ,IAAAA,GAEN,MAAM2Q,EAAU,IAAI16B,KAClB,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAK27B,uBAAuBr+B,IAE9BgD,EAASE,GAAG,cAAek7B,GAG1B17B,KAA6D47B,oBAAsBF,EAGpF17B,KAAK67B,kBAGL77B,KAAK87B,mBACP,CAKQ,sBAAAH,CAAuBr+B,GAE7B0C,KAAKU,OAAOrH,KAAKiE,GAGb0C,KAAKU,OAAOrJ,OAAS2I,KAAKq7B,kBAC5Br7B,KAAKU,OAASV,KAAKU,OAAOlH,OAAOwG,KAAKq7B,kBAIpCr7B,KAAKzD,QAAQ2+B,cACfl7B,KAAK+7B,gBAAgBz+B,GAIvB0C,KAAKg8B,eACP,CAKQ,eAAAD,CAAgBz+B,GACtB0C,KAAKw7B,YAAYlE,SAASh6B,EAAO0C,KAAKu3B,WAAYv3B,KAAKw3B,QACnDx3B,KAAKw3B,OAAOngC,OAAS,MACvB2I,KAAKw3B,OAASx3B,KAAKw3B,OAAOh+B,OAAM,KAEpC,CAKQ,oBAAA4hC,GACN,MAAO,CACL,CACE32B,GAAI,eACJzP,KAAM,SACNijC,OAAQ,OACRG,UAAW,IACXD,SAAU,IACVR,SAAS,EACT/vB,QAAS,yBAEX,CACEnD,GAAI,qBACJzP,KAAM,UACNijC,OAAQ,QACRG,UAAW,IACXD,SAAU,IACVR,SAAS,EACT/vB,QAAS,4BAEX,CACEnD,GAAI,mBACJzP,KAAM,QACNijC,OAAQ,WACRG,UAAW,GACXD,SAAU,IACVR,SAAS,EACT/vB,QAAS,wBAGf,CAKA,UAAA6uB,CAAWtuB,EAAoB0wB,GAC7B,OAAO74B,KAAKy7B,kBAAkB7C,MAAM54B,KAAKU,OAAQyH,EAAW0wB,EAC9D,CAKA,cAAAoD,CAAe1/B,EAAyB,IACtC,MAAMkF,EAAMD,KAAKC,MACX0G,EAAY5L,EAAQ4L,YAAc5L,EAAQ6L,SAAW3G,EAAMlF,EAAQ6L,SAAW3G,EAAM,MACpFo3B,EAAUt8B,EAAQs8B,SAAWp3B,EAE7ByG,EAAUlI,KAAKy2B,WAAWtuB,EAAW0wB,GAGrCqD,EAAiBl8B,KAAKw3B,OAAO55B,OACjC08B,GAAKA,EAAE30B,WAAawC,GAAamyB,EAAE30B,WAAakzB,GAQ5CsD,EAAU,CACdC,UALuBp8B,KAAKU,OAAO9C,OACnCO,GAAsB,eAAjBA,EAAE8J,YAA+B9J,EAAEwH,WAAawC,GAAahK,EAAEwH,WAAakzB,GAIrDxhC,OAC5BglC,QAASn0B,EAAQgxB,WAAWhB,KAC5BoE,iBAAkBp0B,EAAQgxB,WAAWrU,MACrC0X,eAAgBr0B,EAAQ2xB,UAAUhV,MAClC2X,eAAgBt0B,EAAQyxB,UAAU9U,OAI9B4X,EAASz8B,KAAK08B,eAAev0B,EAAW0wB,GAE9C,MAAO,CACLp0B,GAAI,UAAUjD,KAAKC,QACnBk7B,YAAal7B,EACbs4B,UAAW,CACT/8B,MAAOmL,EACPoK,IAAKsmB,GAEPsD,UACAj0B,UACAsvB,OAAQ0E,EACRO,SAEJ,CAKQ,cAAAC,CAAev0B,EAAmB0wB,GAIxC,MAAM4D,EAAwE,GAE9E,IAAIjoC,EAAU2T,EAEd,KAAO3T,EAAUqkC,GAAS,CACxB,MAAM7b,EAAO/jB,KAAKC,IAAI1E,EAJP,KAI2BqkC,GACpC+D,EAAc58B,KAAKy2B,WAAWjiC,EAASwoB,GAC7Cyf,EAAOpjC,KAAK,CACV+P,KAAM5U,EACN0T,QAAS,CACPgxB,WAAY0D,EAAY1D,WACxBS,UAAW,CACT9U,MAAO+X,EAAYjD,UAAU9U,MAC7BmV,YAAa4C,EAAYjD,UAAUK,YACnCC,YAAa2C,EAAYjD,UAAUM,YACnCC,UAAW0C,EAAYjD,UAAUO,UACjCC,OAAQyC,EAAYjD,UAAUQ,QAEhCN,UAAW,CACThV,MAAO+X,EAAY/C,UAAUhV,MAC7BoS,YAAa2F,EAAY/C,UAAU5C,YACnC2D,YAAagC,EAAY/C,UAAUe,YACnCC,OAAQ+B,EAAY/C,UAAUgB,WAIpCrmC,EAAUwoB,CACZ,CAEA,OAAOyf,CACT,CAKA,SAAAI,CAAUtE,GACR,YAAiB,IAAbA,EACK,IAAIv4B,KAAKw3B,QAEXx3B,KAAKw3B,OAAO55B,OAAO08B,GAAKA,EAAE/B,WAAaA,EAChD,CAKA,YAAAuE,CAAapF,GACX13B,KAAKu3B,WAAWl+B,KAAKq+B,EACvB,CAKA,eAAAqF,CAAgB1E,GACd,MAAMphC,EAAQ+I,KAAKu3B,WAAWyF,UAAUC,GAAKA,EAAEx4B,KAAO4zB,GACtD,OAAIphC,GAAS,IACX+I,KAAKu3B,WAAWz2B,OAAO7J,EAAO,IACvB,EAGX,CAKA,aAAAimC,GACE,MAAO,IAAIl9B,KAAKu3B,WAClB,CAKA,YAAA4F,CAAaC,GACX,MAAMtF,EAAQ93B,KAAKw3B,OAAO6F,KAAK/C,GAAKA,EAAE71B,KAAO24B,GAC7C,QAAItF,IACFA,EAAMS,UAAW,GACV,EAGX,CAKA,mBAAcyD,SACNh8B,KAAKiwB,QAAQ4B,KAAK7xB,KAAKU,OAAQV,KAAKw3B,OAC5C,CAKA,qBAAcqE,GACZ,MAAMtlC,QAAayJ,KAAKiwB,QAAQyJ,OAC5BnjC,EAAKmK,SACPV,KAAKU,OAASnK,EAAKmK,QAEjBnK,EAAKihC,SACPx3B,KAAKw3B,OAASjhC,EAAKihC,OAEvB,CAKQ,iBAAAsE,GACN97B,KAAKu7B,iBAAiBv+B,MAAM,KAC1BgD,KAAK8rB,WAET,CAKQ,OAAAA,GACN,MACMwR,EADM97B,KAAKC,MACQzB,KAAKs7B,cAG9Bt7B,KAAKU,OAASV,KAAKU,OAAO9C,OAAOO,GAAKA,EAAEwH,WAAa23B,GAGrDt9B,KAAKw3B,OAASx3B,KAAKw3B,OAAO55B,OAAO08B,GAAKA,EAAE30B,WAAa23B,GAGrDt9B,KAAKg8B,eACP,CAKA,OAAA1G,GACE,MAAMoG,EAAW17B,KAA2E47B,oBACxFF,GACFp7B,EAASK,IAAI,cAAe+6B,GAE9B17B,KAAKu7B,iBAAiB7C,MACxB,ECjVK,MAAM6E,GAAyB,mpjBCAzBC,GAA8B,63eCKpC,MAAMC,GAIX,kBAAAvH,CAAmBrhC,GAEK,oBAAXT,SACRA,OAAsDspC,kBAAoB7oC,EAE/E,CAKA,oBAAA8oC,GACE,GAAsB,oBAAXvpC,OAKX,IAEE,MAAMwpC,EAAMxpC,OAAOi3B,KAAK,cAAe,SAAU,sDAEjD,IAAKuS,EAEH,YADA9F,MAAM,yBAKR8F,EAAIn7B,SAASo7B,MAAMN,IACnBK,EAAIn7B,SAASq7B,QAGbF,EAAIn7B,SAASC,MAAQ,sBACvB,OAASxB,GACPC,QAAQD,MAAM,kDAAmDA,GACjE42B,MAAM,gBAAkB52B,aAAiBye,MAAQze,EAAM0G,QAAU/O,OAAOqI,IAC1E,MAtBEC,QAAQywB,KAAK,6DAuBjB,CAKA,wBAAAmM,GACE,GAAsB,oBAAX3pC,OAKX,IAEE,MAAMwpC,EAAMxpC,OAAOi3B,KAAK,cAAe,SAAU,sDAEjD,IAAKuS,EAEH,YADA9F,MAAM,0BAKR8F,EAAIn7B,SAASo7B,MAAML,IACnBI,EAAIn7B,SAASq7B,QAGbF,EAAIn7B,SAASC,MAAQ,yBACvB,OAASxB,GACPC,QAAQD,MAAM,uDAAwDA,GACtE42B,MAAM,iBAAmB52B,aAAiBye,MAAQze,EAAM0G,QAAU/O,OAAOqI,IAC3E,MAtBEC,QAAQywB,KAAK,6DAuBjB,CAKA,uBAAAoM,GACE,OAAOT,EACT,CAKA,2BAAAU,GACE,OAAOT,EACT,ECnFF,MAAMU,GACJ,MAAAC,CAAO7gC,EAAqB6rB,SAC1B,MAAMhqB,EAAS7B,EAAM6B,SAAU,OAAArK,IAAQspC,eAAR,EAAAtpC,EAAkBqK,SAAUgqB,EAAQkV,aAI7DC,EAAmB,IAHAnV,EAAQ9pB,kBAAoB,CAAA,KAC7B/B,EAAMoI,YAAc,CAAA,GAOtC64B,EAAkB7nC,OAAO6C,KAAK+kC,GAAkBjnC,OAAS,EAAIinC,OAAmB,EAChFE,EAAyB,IAC1BlhC,EACH8B,SAAU9B,EAAM8B,UAAY+pB,EAAQ/pB,SACpC8C,UAAW5E,EAAM4E,WAAainB,EAAQjnB,WAWxC,OARI/C,GAAqB,KAAXA,IACZq/B,EAASr/B,OAASA,GAGhBo/B,IACFC,EAAS94B,WAAa64B,GAGjBC,CACT,EClCF,MAAMC,GAAsB,CAAC,WAAY,QAAS,WAAY,QAAS,QAAS,eAYhF,MAAMC,GAGJ,WAAA/gC,CAA6B6vB,GAFrBztB,EAAAC,KAAA,WAA6E,IAExDA,KAAAwtB,KAAAA,CAAsC,CAEnE,KAAAmR,GACM3+B,KAAK4+B,SAASvnC,OAAS,GAI3BonC,GAAoBx9B,QAAQwE,IAC1B,MAAMi2B,EAAWp+B,IACf0C,KAAKwtB,KAAKlwB,IAEZgD,EAASE,GAAGiF,EAAWi2B,GACvB17B,KAAK4+B,SAASvlC,KAAK,CAAEiE,MAAOmI,EAAWi2B,aAE3C,CAEA,QAAAmD,GACE7+B,KAAK4+B,SAAS39B,QAAQ,EAAG3D,QAAOo+B,cAC9Bp7B,EAASK,IAAIrD,EAAOo+B,KAEtB17B,KAAK4+B,SAAW,EAClB,CAEA,cAAAE,GACwB,oBAAX1qC,SAIXA,OAAO2qC,kBAAoB,CACzBh+B,KAAM,CAACzD,EAAe/G,KACpB+J,EAASS,KAAKzD,EAAO/G,KAG3B,ECtCF,MAAMyoC,GACJ,WAAArhC,CACmBshC,EACAC,GADAl/B,KAAAi/B,YAAAA,EACAj/B,KAAAk/B,YAAAA,CAChB,CAEH,KAAAnhB,CAAM1d,GACJL,KAAKi/B,YAAY7+B,OAAOC,QAEE,IAAtBA,EAAQ9B,WACVyB,KAAKk/B,YAAY7P,aAAahvB,EAAQ9B,WAAa,SAG1B,IAAvB8B,EAAQpB,YACVe,KAAKk/B,YAAY5P,cAAcjvB,EAAQpB,iBAGf,IAAtBoB,EAAQzB,gBAAiD,IAAtByB,EAAQxB,WAC7CmB,KAAKk/B,YAAYhK,gBAAgB,CAC/Bt2B,UAAWoB,KAAKi/B,YAAYh/B,IAAI,cAAgB,GAChDpB,UAAWmB,KAAKi/B,YAAYh/B,IAAI,cAAgB,KAGtD,EC9BF,MAAMk/B,GAAN,WAAAxhC,GACUoC,EAAAC,KAAA,YAAoBwB,KAAKC,OACzB1B,EAAAC,KAAA,aAAqB,IACrBD,EAAAC,KAAA,kBAAuC,MACvCD,EAAAC,KAAA,0BAA+C,MAC/CD,EAAAC,KAAA,sBAA2C,MAC3CD,EAAAC,KAAA,cAAsB,GACtBD,EAAAC,KAAA,kBAAwD,MACxDD,EAAAC,KAAA,mBAA2B,GAC3BD,EAAAC,KAAA,sBAA8B,KAC9BD,EAAAC,KAAA,kBAAiC,MACjCD,EAAAC,KAAA,kBAA0B,GAC1BD,EAAAC,KAAA,aAAqB,EAAA,CAK7B,IAAA+qB,GACE/qB,KAAKo/B,gBACLp/B,KAAKq/B,iBACLr/B,KAAKs/B,oBACP,CAKA,aAAAF,GAEE,GAAI98B,IACF,MAAO,CACLnN,KAAM,WACNH,KAAM,WACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,KAKX,GAAIxC,KAAKu/B,WACP,MAAO,CACLpqC,KAAM,WACNH,KAAM,WACN2Q,UAAWnE,KAAKC,MAChBmE,IAAK5F,KAAKw/B,YAAcr9B,IACxBO,MAAOF,KAIXxC,KAAKu/B,YAAa,EAElB,IACE,MAAM99B,EAAMD,KAAKC,MACXmE,EAAMzD,IACNO,EAAQF,IACRi9B,EpCsDY,oBAAXrrC,OACF,GAEFqO,SAASg9B,UAAY,GoCrDlBC,EAAkB95B,IAAQ5F,KAAKw/B,YAAkC,KAApBx/B,KAAKw/B,WAGxD,IAAKE,GAAmB1/B,KAAK2/B,iBAAmB,EAAG,CAEjD,GAD8Bl+B,EAAMzB,KAAK2/B,iBACb3/B,KAAK4/B,oBAE/B,MAAO,CACLzqC,KAAM,WACNH,KAAM,WACN2Q,UAAWlE,EACXmE,IAAK5F,KAAKw/B,WACV98B,QAGN,CAGA,MAAMm9B,EAAkB7/B,KAAKw/B,WAAa/9B,EAAMzB,KAAKmI,UAAYnI,KAAK8/B,gBAAkB,EAClF13B,EAAWy3B,EAAkB,EAAIA,EAAkB,EAEnDviC,EAAuB,CAC3BnI,KAAM,WACNH,KAAM,WACN2Q,UAAWlE,EACXmE,MACAlD,QACA+8B,SAAUz/B,KAAKw/B,WAAaC,OAAW,EACvCr3B,SAAUA,EAAW,EAAIA,OAAW,GAkBtC,OAdIs3B,IACF1/B,KAAKmI,UAAY1G,EACjBzB,KAAKw/B,WAAa55B,EAClB5F,KAAK8/B,gBAAkB,GAIzB9/B,KAAK2/B,iBAAmBl+B,EAGF,oBAAXrN,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,WAAYzD,GAG7HA,CACT,CAAA,QAEE0F,WAAW,KACThD,KAAKu/B,YAAa,GACjB,EACL,CACF,CAKQ,cAAAF,GACN,GAAsB,oBAAXjrC,OACT,OAIF4L,KAAK+/B,gBAAkB,KACrB//B,KAAKo/B,iBAEPhrC,OAAOs3B,iBAAiB,WAAY1rB,KAAK+/B,iBAGzC,MAAMC,EAAeC,QAQrB,IAAKD,EAAaE,yBAA0B,CAC1C,MAAMC,EAAoBF,QAAQG,UAAUC,KAAKJ,SACjDD,EAAaM,mBAAqBH,EAClCH,EAAaE,0BAA2B,EAExCD,QAAQG,UAAY,IAAIp/B,KACtB,MAAM2c,EAASwiB,EAAkBpiB,MAAMkiB,QAASj/B,GAehD,OAXIhB,KAAKugC,iBACPx9B,aAAa/C,KAAKugC,iBAEpBvgC,KAAKugC,gBAAkBv9B,WAAW,KACjBb,MAEAnC,KAAKw/B,YAClBx/B,KAAKo/B,gBAEPp/B,KAAKugC,gBAAkB,MACtB,KACI5iB,EAEX,CAEA,IAAKqiB,EAAaQ,4BAA6B,CAC7C,MAAMC,EAAuBR,QAAQS,aAAaL,KAAKJ,SACvDD,EAAaW,sBAAwBF,EACrCT,EAAaQ,6BAA8B,EAE3CP,QAAQS,aAAe,IAAI1/B,KACzB,MAAM2c,EAAS8iB,EAAqB1iB,MAAMkiB,QAASj/B,GAenD,OAXIhB,KAAKugC,iBACPx9B,aAAa/C,KAAKugC,iBAEpBvgC,KAAKugC,gBAAkBv9B,WAAW,KACjBb,MAEAnC,KAAKw/B,YAClBx/B,KAAKo/B,gBAEPp/B,KAAKugC,gBAAkB,MACtB,KACI5iB,EAEX,CACF,CAKQ,kBAAA2hB,GACkB,oBAAb78B,WAKXzC,KAAK4gC,wBAA0B,KAC7B,MAAMC,EAAWp+B,SAASq+B,OACpBr/B,EAAMD,KAAKC,MAEbo/B,GAAY7gC,KAAK+gC,WAEnB/gC,KAAKghC,gBAAkBv/B,EACvBzB,KAAK+gC,WAAY,GACPF,GAAa7gC,KAAK+gC,YAExB/gC,KAAKghC,kBACPhhC,KAAK8/B,iBAAmBr+B,EAAMzB,KAAKghC,gBACnChhC,KAAKghC,gBAAkB,MAEzBhhC,KAAK+gC,WAAY,IAIrBt+B,SAASipB,iBAAiB,mBAAoB1rB,KAAK4gC,yBAGnD5gC,KAAKihC,oBAAsB,KACzB,MAAMx/B,EAAMD,KAAKC,MAGbzB,KAAKghC,kBACPhhC,KAAK8/B,iBAAmBr+B,EAAMzB,KAAKghC,gBACnChhC,KAAKghC,gBAAkB,MAIzB,MAAME,EAAgBlhC,KAAKw/B,WAAa/9B,EAAMzB,KAAKmI,UAAYnI,KAAK8/B,gBAAkB,EAGtF,GAAIoB,EAAgB,GAAKlhC,KAAKw/B,WAC5B,IACE,MAAM2B,EAA4B,CAChChsC,KAAM,WACNH,KAAM,qBACN2Q,UAAWlE,EACXmE,IAAK5F,KAAKw/B,WACV98B,MAAOF,IACP4F,SAAU84B,GAIU,oBAAX9sC,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,WAAYogC,EAEtI,OAASjgC,GACPC,QAAQD,MAAM,mDAAoDA,EACpE,GAIJ9M,OAAOs3B,iBAAiB,eAAgB1rB,KAAKihC,qBAC/C,CAKA,OAAA3L,GAyBE,GAvBIt1B,KAAKugC,kBACPx9B,aAAa/C,KAAKugC,iBAClBvgC,KAAKugC,gBAAkB,MAIrBvgC,KAAK+/B,iBAAqC,oBAAX3rC,SACjCA,OAAOgtC,oBAAoB,WAAYphC,KAAK+/B,iBAC5C//B,KAAK+/B,gBAAkB,MAIrB//B,KAAK4gC,yBAA+C,oBAAbn+B,WACzCA,SAAS2+B,oBAAoB,mBAAoBphC,KAAK4gC,yBACtD5gC,KAAK4gC,wBAA0B,MAG7B5gC,KAAKihC,qBAAyC,oBAAX7sC,SACrCA,OAAOgtC,oBAAoB,eAAgBphC,KAAKihC,qBAChDjhC,KAAKihC,oBAAsB,MAIP,oBAAX7sC,OAAwB,CACjC,MAAM4rC,EAAeC,QAOjBD,EAAaE,0BAA4BF,EAAaM,qBACxDL,QAAQG,UAAYJ,EAAaM,mBACjCN,EAAaE,0BAA2B,SACjCF,EAAaM,oBAGlBN,EAAaQ,6BAA+BR,EAAaW,wBAC3DV,QAAQS,aAAeV,EAAaW,sBACpCX,EAAaQ,6BAA8B,SACpCR,EAAaW,sBAExB,CACF,ECtRK,SAASU,GACdltC,EACAoI,EAAsC,UAEtC,IAAKpI,GAA6B,oBAAXC,OACrB,OAGF,MAAMktC,aACJA,GAAe,EAAAC,aACfA,GAAe,EAAAC,aACfA,GAAe,EAAAC,aACfA,GAAe,GACbllC,EAGEmlC,EAAuB9pC,EAAyBzD,GAGhDE,EAAcH,EAAwBC,GAGtCkI,EAAgBqlC,GAAwB9sC,EAAiBP,GAG/D,IAAKgI,IAAkBhI,EACrB,OAGF,MAAMuI,EAA+B,CAAA,EAQrC,GALIP,IACFO,EAAcP,cAAgBA,GAI5BilC,GAAgBjtC,EAAa,CAC/B,MAAMuB,EAAQF,EAAkBrB,GAC5BuB,IACFgH,EAAchH,MAAQU,EAAoBV,GAGtC,SAAUA,IACZgH,EAAc+kC,cAAgB9oC,OAAOjD,EAAMT,OAEzC,aAAcS,IAChBgH,EAAcglC,SAAWC,QAAQjsC,EAAMgsC,WAErC,UAAWhsC,GAAS6rC,IACtB7kC,EAAcklC,MAAQjpC,OAAOjD,EAAMksC,QAGzC,CAGA,GAAIP,GAAgBltC,EAAa,CAC/B,MAAM0B,EAAQF,EAAkBxB,GAC5B0B,IACF6G,EAAc7G,MAAQO,EAAoBP,IAGrC6G,EAAc+kC,eAAiB,SAAU5rC,IAC5C6G,EAAc+kC,cAAgB9oC,OAAO9C,EAAMZ,YAEd,IAA3ByH,EAAcglC,UAA0B,aAAc7rC,IACxD6G,EAAcglC,SAAWC,QAAQ9rC,EAAM6rC,WAG7C,CAGA,GAAIJ,GAAgBntC,EAAa,CAC/B,MAAM4B,EAAQD,EAAkB3B,GAChC,GAAI4B,QAAuC,CAEzC,MAAML,EAAQF,EAAkBrB,GAOhC,GANoBuB,IACjB,SAAUA,GAA8C,aAArCiD,OAAOjD,EAAMT,MAAM0B,eACtC,aAAcjB,GACI,YAAlByG,GAA+B,SAAUzG,GAA8C,aAArCiD,OAAOjD,EAAMT,MAAM0B,eAGvD,CAEf,MAAM6Q,EAA+B,iBAAVzR,EAAqBA,EAAMoB,YAAS,EAC/DuF,EAAc3G,WAAwB,IAAhByR,EAClB,aAAaA,WACb,WAAWzR,IACjB,KAEuB,iBAAVA,EACLwB,MAAMC,QAAQzB,IAChB2G,EAAc3G,MAAQ,UAAUA,EAAMoB,WAEhB,aAAlBgF,GAAkD,eAAlBA,IAClCO,EAAcL,QAAU,CACtB2S,MAAOjZ,EAAMoB,OACb0qC,YAAUnsC,KAAS,aAAcA,KAAQisC,QAAQjsC,EAAMmsC,aAI3DnlC,EAAc3G,MAAQ,WAGxB2G,EAAc3G,MAAQA,CAG5B,CACF,CAGA,GAAIwrC,IAAiB7kC,EAAcklC,MAAO,CACxC,MAAMz8B,EAAO,OAAAvQ,EAAAX,EAAQmR,kBAAR,EAAAxQ,EAAqB+P,OAC9BQ,GAAQA,EAAKhO,OAAS,GAAKgO,EAAKhO,OAAS,MAC3CuF,EAAcklC,MAAQz8B,EAAK7N,UAAU,EAAG,KAE5C,CAGA,IAAuB,aAAlB6E,GAAkD,eAAlBA,IAAmChI,EAAa,CACnF,MAAMuB,EAAQF,EAAkBrB,GAC5BuB,GAAS,YAAaA,GAAS6B,MAAMC,QAAQ9B,EAAM2G,WACrDK,EAAcL,QAAU,CACtB2S,MAAOtZ,EAAM2G,QAAQlF,OACrB0qC,YAAUnsC,KAAS,aAAcA,KAAQisC,QAAQjsC,EAAMmsC,WAG7D,CAEA,OAAOrrC,OAAO6C,KAAKqD,GAAevF,OAAS,EAAIuF,OAAgB,CACjE,CAiBO,SAASolC,GAAmB7tC,GACjC,IAAKA,EACH,OAAO,EAGT,MAAMkI,EAAgBzE,EAAyBzD,GAC/C,YAAyB,IAAlBkI,GAA+BA,EAAcrE,WAAW,KACjE,CC/KA,MAAMiqC,GAAqD,CACzD,WAAY,CAAC,UAAW,UAAW,UAAW,OAAQ,UAAW,QAAS,WAAY,cACtF,UAAW,CAAC,OAAQ,WAAY,WAAY,SAAU,QAAS,MAAO,OACtE,WAAY,CAAC,UAAW,WAAY,OAAQ,cAC5C,aAAc,CAAC,UAAW,iBAC1B,UAAW,CAAC,UAAW,UACvB,WAAY,CAAC,WACb,gBAAiB,CAAC,OAAQ,WAAY,YAAa,iBACnD,gBAAiB,CAAC,OAAQ,aAC1B,aAAc,CAAC,UAAW,WAAY,cACtC,aAAc,CAAC,WACf,gBAAiB,CAAC,UAAW,WAAY,cACzC,SAAU,CAAC,UAAW,UACtB,cAAe,CAAC,WAChB,UAAW,CAAC,UAAW,WAAY,WACnC,eAAgB,CAAC,WACjB,SAAU,CAAC,UAAW,aAAc,YACpC,SAAU,CAAC,UAAW,OAAQ,OAC9B,WAAY,CAAC,WACb,UAAW,CAAC,WACZ,YAAa,CAAC,UAAW,UAAW,OAAQ,UAAW,SACvD,iBAAkB,CAAC,UAAW,UAAW,OAAQ,UAAW,SAC5D,YAAa,CAAC,WACd,YAAa,CAAC,WACd,aAAc,CAAC,WACf,eAAgB,CAAC,WACjB,UAAW,CAAC,UAAW,YACvB,aAAc,CAAC,WACf,SAAU,CAAC,UAAW,WAAY,aAClC,aAAc,CAAC,UAAW,aAC1B,YAAa,CAAC,UAAW,aAAc,YACvC,UAAW,CAAC,UAAW,YACvB,SAAU,CAAC,WACX,WAAY,CAAC,WACb,aAAc,CAAC,WACf,WAAY,CAAC,WACb,UAAW,CAAC,WACZ,cAAe,CAAC,WAChB,SAAU,CAAC,WACX,aAAc,CAAC,WACf,aAAc,CAAC,UAAW,OAAQ,SAAU,aAC5C,SAAU,CAAC,WACX,WAAY,CAAC,UAAW,SACxB,iBAAkB,CAAC,WACnB,UAAW,CAAC,WACZ,WAAY,CAAC,UAAW,SAAU,UAClC,UAAW,CAAC,WACZ,QAAS,CAAC,UAAW,UAAW,OAAQ,UAAW,SACnD,UAAW,CAAC,WACZ,WAAY,CAAC,UAAW,UAAW,OAAQ,UAAW,QAAS,MAAO,OACtE,iBAAkB,CAAC,UAAW,YAC9B,cAAe,CAAC,WAChB,SAAU,CAAC,UAAW,YACtB,cAAe,CAAC,WAChB,aAAc,CAAC,UAAW,MAAO,SACjC,aAAc,CAAC,YAMV,SAASC,GACd/tC,EACAoI,EAKI,IAEJ,IAAKpI,EACH,OAIF,IAAK6tC,GAAmB7tC,GACtB,OAIF,MAAMyI,EAAgBykC,GAAwBltC,EAAS,CACrDmtC,aAAc/kC,EAAQ+kC,aACtBC,aAAchlC,EAAQglC,aACtBC,aAAcjlC,EAAQilC,aACtBC,aAAcllC,EAAQklC,eAGxB,IAAK7kC,EACH,OAGF,MAAMP,EAAgBO,EAAcP,cAEpC,IAAKA,IAAkBA,EAAcrE,WAAW,MAC9C,OAAO4E,EAIT,OAAQP,GACN,IAAK,YA6CT,SAA2BlI,EAAkByI,SAE3C,IAAKA,EAAcklC,MAAO,CACxB,MAAMz8B,EAAO,OAAAvQ,EAAAX,EAAQmR,kBAAR,EAAAxQ,EAAqB+P,OAC9BQ,IACFzI,EAAcklC,MAAQz8B,EAAK7N,UAAU,EAAG,IAE5C,CAGA,MAAM2qC,EAAchuC,EAAQiuC,cAAc,oCACtCD,IACFvlC,EAAcylC,SAAU,IAItBluC,EAAQmuC,UAAU5R,SAAS,uBAAyBv8B,EAAQouC,aAAa,eAC3E3lC,EAAcglC,UAAW,GAGvBztC,EAAQmuC,UAAU5R,SAAS,uBAC7B9zB,EAAc4lC,SAAU,EAE5B,CAlEMC,CAAkBtuC,EAASyI,GAC3B,MAEF,IAAK,WAoET,SAA0BzI,EAAkByI,SAE1C,MAAM8lC,EAAevuC,EAAQiuC,cAAc,mBAE3C,GAAIM,EAAc,CAUhB,KARK,OAAA5tC,EAAA8H,EAAc7G,YAAd,EAAAjB,EAAqB6tC,cAAeD,EAAaC,cAC/C/lC,EAAc7G,QACjB6G,EAAc7G,MAAQ,CAAA,GAExB6G,EAAc7G,MAAM4sC,YAAcD,EAAaC,aAIN,UAAvCD,EAAa3qC,QAAQlB,cAA2B,CAClD,MAAM+rC,EAAYF,EAAavtC,MAAQ,OAClCyH,EAAc+kC,gBACjB/kC,EAAc+kC,cAAgBiB,GAId,aAAdA,IACFhmC,EAAc+K,aAAc,EAExB/K,EAAc3G,OAAwC,iBAAxB2G,EAAc3G,QAEzC2G,EAAc3G,MAAM+B,WAAW,gBAClC4E,EAAc3G,MAAQ,aAAa2G,EAAc3G,MAAMoB,kBAI/D,CAIA,MAAMpB,EAAQysC,EAAazsC,MAC3B,GAAIA,EAAO,CACgC,aAAtBysC,EAAavtC,MACbyH,EAAchH,OAAS,SAAUgH,EAAchH,OACI,aAAnDiD,OAAO+D,EAAchH,MAAMT,MAAM0B,eAIlD+F,EAAc3G,MAAQ,aAAaA,EAAMoB,gBACzCuF,EAAc+K,aAAc,GAG5B/K,EAAc3G,MAAQA,EAAMoB,OAAS,IAAMpB,EAAMuB,UAAU,EAAG,KAAO,MAAQvB,CAEjF,MAAY2G,EAAc3G,KAI5B,CACF,CAxHM4sC,CAAiB1uC,EAASyI,GAC1B,MAEF,IAAK,WACL,IAAK,aACL,IAAK,iBAwHT,SAA2BzI,EAAkByI,SAE3C,MAAMkmC,EAAkB3uC,EAAQiuC,cAAc,8CAC9C,GAAIU,EAAiB,CACnB,MAAMC,EAAe,OAAAjuC,EAAAguC,EAAgBx9B,kBAAhB,EAAAxQ,EAA6B+P,OAC9Ck+B,IAAiBnmC,EAAcklC,QACjCllC,EAAcklC,MAAQiB,EAAavrC,UAAU,EAAG,KAEpD,CAGIrD,EAAQmuC,UAAU5R,SAAS,gCACxB9zB,EAAcL,UACjBK,EAAcL,QAAU,CAAA,GAE1BK,EAAcL,QAAQwlC,UAAW,GAI/B5tC,EAAQiuC,cAAc,6BACxBxlC,EAAcomC,YAAa,EAE/B,CA5IMC,CAAkB9uC,EAASyI,GAC3B,MAEF,IAAK,aACL,IAAK,WA6IT,SAAkCzI,EAAkByI,SAElD,MAAM8lC,EAAevuC,EAAQiuC,cAAc,+CAE3C,GAAIM,EAAc,CAEhB9lC,EAAcsmC,QAAUR,EAAaQ,QAGrC,MAAMC,EAAehvC,EAAQiuC,cAAc,8CAC3C,GAAIe,EAAc,CAChB,MAAMC,EAAY,OAAAtuC,EAAAquC,EAAa79B,kBAAb,EAAAxQ,EAA0B+P,OACxCu+B,IAAcxmC,EAAcklC,QAC9BllC,EAAcklC,MAAQsB,EAAU5rC,UAAU,EAAG,KAEjD,CAGIkrC,EAAazsC,QACf2G,EAAc3G,MAAQysC,EAAazsC,MAEvC,CACF,CAjKMotC,CAAyBlvC,EAASyI,GAClC,MAEF,IAAK,YAmKT,SAA2BzI,EAAkByI,GAE3C,MAAM8lC,EAAevuC,EAAQiuC,cAAc,0BAEvCM,IACF9lC,EAAcsmC,QAAUR,EAAaQ,QACrCtmC,EAAc3G,MAAQysC,EAAaQ,QAEvC,CAzKMI,CAAkBnvC,EAASyI,GAC3B,MAEF,IAAK,SACL,IAAK,eA0KT,SAAyBzI,EAAkByI,SAEzC,MAAMumC,EAAehvC,EAAQiuC,cAAc,6BAC3C,GAAIe,EAAc,CAChB,MAAMC,EAAY,OAAAtuC,EAAAquC,EAAa79B,kBAAb,EAAAxQ,EAA0B+P,OACxCu+B,IAAcxmC,EAAcklC,QAC9BllC,EAAcklC,MAAQsB,EAAU5rC,UAAU,EAAG,KAEjD,CAGA,MAAM+rC,EAAkBpvC,EAAQiuC,cAAc,qDAC1CmB,IACF3mC,EAAc4mC,UAAW,EAE7B,CAvLMC,CAAgBtvC,EAASyI,GAQ7B,OAAOA,CACT,CC5IO,SAAS8mC,GAA4BvvC,GAC1C,IAAKA,EACH,OAGF,MAAMa,EACJb,EAAQwvC,aAAa,oBAAsBxvC,EAAQwvC,aAAa,wBAClE,IAAK3uC,EACH,OAGF,MAAM6H,EAAsB,CAC1BR,cAAerH,GAGX8G,EAAW3H,EAAQwvC,aAAa,oBACtC,GAAI7nC,GAAYA,EAASzE,QArBA,KAsBvB,IACE,MAAMusC,EAASn7B,KAAK6hB,MAAMxuB,GACtB8nC,GAA4B,iBAAXA,IACnB/mC,EAAKjH,MAAQguC,EAEjB,CAAA,MAEA,CAGF,OAAO/mC,CACT,CC1BA,SAASgnC,GAAezpC,EAAa0pC,GACnC,MAAM/+B,EAAM3K,EAAGupC,aAAa,SAC5B,QAAK5+B,GAGEA,EAAID,MAAM,OAAOhO,KAAKmV,GAAKA,IAAM63B,GAAU73B,EAAEjU,WAAW,GAAG8rC,MACpE,CA0BO,SAASC,GAAwB5vC,GACtC,GAAKA,EAKL,OA9BF,SAA4BiG,GAC1B,IAAI4pC,EAiBJ,O/CrBK,SACLhnC,EACA3E,EACA4rC,GAEA,IAAI/mC,EAAsBF,EACtBtI,EAAQ,EACZ,KAAc,MAAPwI,GAAexI,GAAS2D,GAAU,CAEvC,IAAa,IADA4rC,EAAM/mC,EAAKxI,GAEtB,OAEFwI,EAAMA,EAAIzI,cACVC,GACF,CACF,C+CTEwvC,CAAmB9pC,EAbM,EAakB+pC,GACrCN,GAAeM,EAAW,YAC5BH,EAAU,CAAE3nC,cAAe,cACpB,GAGPwnC,GAAeM,EAAW,cAC1BN,GAAeM,EAAW,4BAC1BN,GAAeM,EAAW,4BAE1BH,EAAU,CAAE3nC,cAAe,aACpB,QANT,GAUK2nC,CACT,CAWSI,CAAmBjwC,EAC5B,CCtCO,SAASkwC,GAA0BvkC,GACxC,OAAQ1J,IACN,MAAMkuC,EAAexkC,EAAOykC,eANVC,EAMuC1kC,EAAOykC,cAL3D,IAAIC,GAAUC,KAAK,CAACnK,EAAGtjB,KAAOA,EAAExa,UAAY,IAAM89B,EAAE99B,UAAY,KAKY,GANrF,IAAsBgoC,EAQlB,IAAA,MAAWE,KAAWJ,EACpB,IACE,MAAMznC,EAAO6nC,EAAQhoC,qBAAqBtG,GAC1C,GAAIyG,EACF,OAAOA,CAEX,CAAA,MAEA,EAKN,CAEO,SAAS8nC,GAA+B7kC,GAC7C,MAAM8kC,EAAc,CAClBtD,aAAcxhC,EAAOL,wBAAyB,EAC9C+hC,aAAc1hC,EAAOJ,wBAAyB,GAGhD,OAAQtJ,IACN,MAAMjC,EAAU0F,EAAmBzD,EAAI0D,QACvC,GAAK3F,EAIL,IACE,GAAI2L,EAAOP,sBAAuB,CAChC,MAAMslC,EAAQ3C,GAA4B/tC,EAASywC,GACnD,GAAIC,EACF,OAAOA,CAEX,CAEA,GAAI/kC,EAAOR,kBAAmB,CAC5B,MAAMwlC,EAAMzD,GAAwBltC,EAASywC,GAC7C,GAAIE,EACF,OAAOA,CAEX,CACF,CAAA,MACE,MACF,EAIJ,CAEO,SAASC,GAAgB3uC,GAC9B,OAAOstC,GAA4B7pC,EAAmBzD,EAAI0D,QAC5D,CAEO,SAASkrC,GAAwB5uC,GACtC,OAAO2tC,GAAwBlqC,EAAmBzD,EAAI0D,eAAY,CACpE,CCzDO,SAASmrC,GACd9wC,EACAmJ,EACA4nC,GAEA,IAAK/wC,EACH,OAGF,MAAM2L,EAASolC,IAOf,OD2CK,SACL9uC,EACA+uC,GAEA,IAAA,MAAWrnC,KAAYqnC,EAAW,CAChC,MAAMtoC,EAAOiB,EAAS1H,GACtB,GAAIyG,EACF,OAAOA,CAEX,CAGF,CCvDSuoC,CAN0B,CAC/BtrC,OAAQ3F,EACRmJ,QACAX,cAAemD,GAGgB,CAC/BukC,GAA0BvkC,GAC1B6kC,GAA+B7kC,GAC/BilC,GACAC,IAEJ,CCpBA,MAAMK,GACJ,WAAA1nC,CAA6BpB,EAAoC,IAApCyD,KAAAzD,QAAAA,CAAyC,CAEtE,MAAA+oC,CAAOh/B,GACL,MAAMi/B,EAAyB,CAC7BpwC,KAAM,QACNH,KAAMsR,EAAMb,UACZE,UAAWW,EAAMX,UACjBC,IAAKzD,IACLO,MAAOF,IACPyE,YAAa/C,EAAeoC,EAAMnS,SAClCqxC,YAAapgC,EAAekB,EAAMnS,SAClC+S,SAAUZ,EAAMY,SAChBu+B,gBAAiBn/B,EAAMm/B,iBAGnBC,EAAe1lC,KAAKzD,QAAQ2oC,UAClC,GAAIQ,EACF,IACE,MAAM7oC,EAAOooC,GAA0B3+B,EAAMnS,QAASmS,EAAMq/B,YAAaD,GACrE7oC,IACF0oC,EAAW3oC,cAAgBC,EAE/B,OAAS+oC,GACPzkC,QAAQywB,KAAK,iDAAkDgU,EACjE,CAGF,OAAOL,CACT,EC1CF,MAAMM,GACJ,QAAAC,CAASxoC,GACP,MAAMyoC,EACc,oBAAX3xC,OACDA,OAA8D2qC,mBAAqB,KACrF,KAEDgH,GAILA,EAAIhlC,KAAK,QAASzD,EACpB,CAEA,QAAAk2B,CAASwS,EAAkBljC,GACU,oBAAxBmjC,oBACTA,oBAAoBD,EAAM,CAAEljC,YAE5BE,WAAWgjC,EAAM,EAErB,ECTF,MAAME,GAGJ,WAAAvoC,CACmBwoC,EAA2B,IAC3BC,EAA8B,IAJzCrmC,EAAAC,KAAA,YAAqC,MAG1BA,KAAAmmC,iBAAAA,EACAnmC,KAAAomC,oBAAAA,CAChB,CAEH,gBAAAC,CAAiBC,EAAc7kC,GAC7BzB,KAAKumC,UAAY,CACfn/B,EAAGk/B,EAAME,QACTl/B,EAAGg/B,EAAMG,QACTr9B,KAAM3H,EAEV,CAEA,eAAAilC,CAAgBJ,EAAc7kC,GAC5B,IAAKzB,KAAKumC,UACR,MAAO,CAAEI,OAAO,GAGlB,MAAMC,EAAS3tC,KAAK8P,IAAIu9B,EAAME,QAAUxmC,KAAKumC,UAAUn/B,GACjDy/B,EAAS5tC,KAAK8P,IAAIu9B,EAAMG,QAAUzmC,KAAKumC,UAAUj/B,GACjDw/B,EAAYrlC,EAAMzB,KAAKumC,UAAUn9B,KAGvC,OAFApJ,KAAKumC,UAAY,KAGfO,EAAY9mC,KAAKmmC,kBACjBS,EAAS5mC,KAAKomC,qBACdS,EAAS7mC,KAAKomC,oBAEP,CACLO,OAAO,EACPz/B,SAAU,CACRE,EAAGk/B,EAAME,QACTl/B,EAAGg/B,EAAMG,UAKR,CAAEE,OAAO,EAClB,CAEA,KAAAvP,GACEp3B,KAAKumC,UAAY,IACnB,ECnDF,MAAMQ,GAAN,WAAAppC,GACUoC,EAAAC,KAAA,eAAqD,MACrDD,EAAAC,KAAA,oBAA0D,MAC1DD,EAAAC,KAAA,kBAAwD,MACxDD,EAAAC,KAAA,eAAuB,KACvBD,EAAAC,KAAA,eAA8B,MAC9BD,EAAAC,KAAA,eAA6C,MAC7CD,EAAAC,KAAA,eAAkC,IAAIqlC,IACtCtlC,EAAAC,KAAA,kBAAwC,IAAI6lC,IAC5C9lC,EAAAC,KAAA,0BAAmD,IAAIkmC,GAAA,CAO/D,IAAAnb,CAAKic,EAAuBzqC,GAOJ,oBAAXnI,cAIU,IAAjB4yC,IACFhnC,KAAKgnC,aAAeA,GAGlBzqC,IACFyD,KAAK0lC,aAAenpC,EAAQ2oC,WAAa,MAE3CllC,KAAKinC,aAAe,IAAI5B,GAAkB,CAAEH,UAAWllC,KAAK0lC,eAG5D1lC,KAAKknC,aAAevkC,EAAS,IAAI3B,KAC/B,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAKmnC,YAAY7pC,IAChB0C,KAAKgnC,cAIRhnC,KAAKonC,kBAAsB9pC,IACzB0C,KAAKqnC,YAAY/pC,IAInB0C,KAAKsnC,gBAAkB3kC,EAAS,IAAI3B,KAClC,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAKqnC,YAAY/pC,IAChB0C,KAAKgnC,cAGRvkC,SAASipB,iBAAiB,QAAS1rB,KAAKknC,cAA+B,GAIvEzkC,SAASipB,iBAAiB,aAAc1rB,KAAKonC,kBAAmB,CAAEG,SAAS,EAAMC,SAAS,IAC1F/kC,SAASipB,iBAAiB,WAAY1rB,KAAKsnC,gBAAkC,CAAEC,SAAS,EAAMC,SAAS,IACzG,CAKQ,WAAAH,CAAY/pC,GAClB,IACE,MAAMmE,EAAMD,KAAKC,MAEjB,OAAQnE,EAAMnI,MACZ,IAAK,aACCmI,EAAMmqC,QAAQpwC,OAAS,GACzB2I,KAAK0nC,wBAAwBrB,iBAAiB/oC,EAAMmqC,QAAQ,GAAIhmC,GAElE,MAEF,IAAK,WACH,GAAInE,EAAMqqC,eAAetwC,OAAS,EAAG,CACnC,MAAMuwC,EAAWtqC,EAAMqqC,eAAe,GACvB3nC,KAAK0nC,wBAAwBhB,gBAAgBkB,EAAUnmC,GAE3DklC,QACL3mC,KAAK6nC,cACP9kC,aAAa/C,KAAK6nC,cAGpB7nC,KAAK6nC,aAAezzC,OAAO4O,WAAW,KACpC,IACEhD,KAAK8nC,wBAAwBF,EAAUtqC,EAAMxD,OAC/C,OAASoH,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,CACAlB,KAAK6nC,aAAe,MACnB,KAEP,EAGN,OAAS3mC,GACPC,QAAQD,MAAM,4CAA6CA,EAC7D,CACF,CAKQ,uBAAA4mC,CAAwBxB,EAAcnyC,GAE5C,GAAImO,IACF,OAGF,IAAKnO,EACH,OAGF,MAAMwR,EAAYnE,KAAKC,MAqBvBzB,KAAK+nC,gBAAgBvU,SAlBA,KACnB,IACE,MAAMwU,EAAahoC,KAAKinC,aAAa3B,OAAO,CAC1CnxC,UACAwR,YACAuB,SAAU,CACRE,EAAGk/B,EAAME,QACTl/B,EAAGg/B,EAAMG,SAEXhB,gBAAiB,QACjBhgC,UAAW,gBAEbzF,KAAK+nC,gBAAgBjC,SAASkC,EAChC,OAAS9mC,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,GAG0C,GAC9C,CAKQ,WAAAimC,CAAY7pC,GAElB,IAAIgF,IAIJ,IACE,MAAMxI,EAASwD,EAAMxD,OACrB,IAAKA,EACH,OAGF,MAAM6L,EAAYnE,KAAKC,MAIjBwmC,EAAe,KACnB,IACE,MAAM1C,EAAavlC,KAAKinC,aAAa3B,OAAO,CAC1CnxC,QAAS2F,EACT6L,YACAuB,SAAU,CACRE,EAAG9J,EAAMkpC,QACTl/B,EAAGhK,EAAMmpC,SAEXhB,gBAAiB,QACjBhgC,UAAW,QACXkgC,YAAaroC,IAEf0C,KAAK+nC,gBAAgBjC,SAASP,EAChC,OAASrkC,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,GAGFlB,KAAK+nC,gBAAgBvU,SAASyU,EAAc,IAC9C,OAAS/mC,GACPC,QAAQD,MAAM,4CAA6CA,EAC7D,CACF,CAKA,aAAAgnC,CAAc5qC,GACZ,IACE,MAAMxD,EAASwD,EAAMxD,OACrB,OAAKA,EAIEkG,KAAKinC,aAAa3B,OAAO,CAC9BnxC,QAAS2F,EACT6L,UAAWnE,KAAKC,MAChByF,SAAU,CACRE,EAAG9J,EAAMkpC,QACTl/B,EAAGhK,EAAMmpC,SAEXhB,gBAAiB,QACjBhgC,UAAW,QACXkgC,YAAaroC,IAZN,IAcX,OAAS4D,GAEP,OADAC,QAAQD,MAAM,4CAA6CA,GACpD,IACT,CACF,CAKA,OAAAo0B,GACMt1B,KAAKknC,cAAoC,oBAAbzkC,WAC9BA,SAAS2+B,oBAAoB,QAASphC,KAAKknC,cAA+B,GAC1ElnC,KAAKknC,aAAe,MAGlBlnC,KAAKonC,mBAAyC,oBAAb3kC,WACnCA,SAAS2+B,oBAAoB,aAAcphC,KAAKonC,mBAChDpnC,KAAKonC,kBAAoB,MAGvBpnC,KAAKsnC,iBAAuC,oBAAb7kC,WACjCA,SAAS2+B,oBAAoB,WAAYphC,KAAKsnC,iBAC9CtnC,KAAKsnC,gBAAkB,MAGrBtnC,KAAK6nC,eACP9kC,aAAa/C,KAAK6nC,cAClB7nC,KAAK6nC,aAAe,MAGtB7nC,KAAK0nC,wBAAwBtQ,OAC/B,ECrOF,MAAM+Q,GAWJ,WAAAxqC,CAAYpB,EAA2B,IAV/BwD,EAAAC,KAAA,WAAwC,MACxCD,EAAAC,KAAA,sBAAoCzF,KACpCwF,EAAAC,KAAA,WACAD,EAAAC,KAAA,kBAAwCO,KACxCR,EAAAC,KAAA,wBAA6C,MAC7CD,EAAAC,KAAA,wBAA6C,MAC7CD,EAAAC,KAAA,iBAA4B,IAC5BD,EAAAC,KAAA,kBAA0B,GACjBD,EAAAC,KAAA,wBAAwB,KAGvCA,KAAKzD,QAAU,CACb67B,UAAW,GACXpV,KAAM,KACNolB,WAAY,SACT7rC,EAEP,CAKA,IAAAwuB,GACwB,oBAAX32B,QAA2Bw7B,MAKtC5vB,KAAKqoC,SAAW,IAAIxY,qBAClB5sB,EAAS,IAAIjC,KACKA,EAAK,GACbC,QAAQqnC,IACdtoC,KAAKuoC,mBAAmBD,MAEzB,KACH,CACElQ,UAAWp4B,KAAKzD,QAAQ67B,WAAa,GACrCpV,KAAMhjB,KAAKzD,QAAQymB,KACnBolB,WAAYpoC,KAAKzD,QAAQ6rC,aAK7BpoC,KAAKwoC,mBAnBHxoC,KAAKyoC,oBAoBT,CAKA,eAAAD,GACE,IAAKxoC,KAAKqoC,UAAgC,oBAAb5lC,SAC3B,OAGF,MAAMimC,EAAWjmC,SAASkmC,iBAAiB,yBAC3CD,EAASznC,QAAQ9M,IACf6L,KAAKqoC,SAAU5Y,QAAQt7B,KAIzB6L,KAAK4oC,eAAiBnxC,MAAM6pB,KAAKonB,GACjC1oC,KAAK6oC,gBAAkBrnC,KAAKC,KAC9B,CAKA,OAAAguB,CAAQt7B,GACD6L,KAAKqoC,WAGVroC,KAAKqoC,SAAS5Y,QAAQt7B,GAGjB6L,KAAK4oC,eAAe5a,SAAS75B,KAChC6L,KAAK4oC,eAAevvC,KAAKlF,GACzB6L,KAAK6oC,gBAAkBrnC,KAAKC,OAEhC,CAKA,SAAAqnC,CAAU30C,GACR,IAAK6L,KAAKqoC,SACR,OAEFroC,KAAKqoC,SAASS,UAAU30C,GACxB6L,KAAK+oC,gBAAgBnoC,OAAOzM,GAC5B6L,KAAKgpC,YAAYpoC,OAAOzM,GAGxB,MAAM8C,EAAQ+I,KAAK4oC,eAAe1xC,QAAQ/C,GACtC8C,GAAQ,IACV+I,KAAK4oC,eAAe9nC,OAAO7J,EAAO,GAClC+I,KAAK6oC,gBAAkBrnC,KAAKC,MAEhC,CAKQ,kBAAA8mC,CAAmBD,GAEzB,GAAIhmC,IACF,OAGF,MAAMxI,OAAEA,EAAAmvC,kBAAQA,EAAAC,eAAmBA,GAAmBZ,EAEtD,GAAIY,GAAkBD,IAAsBjpC,KAAKzD,QAAQ67B,WAAa,IAC/Dp4B,KAAK+oC,gBAAgBjwC,IAAIgB,KAC5BkG,KAAK+oC,gBAAgBhwC,IAAIe,GACzBkG,KAAKmpC,gBAAgBrvC,IAEvBkG,KAAKgpC,YAAY7oC,IAAIrG,EAAQ0H,KAAKC,YACpC,IAAYynC,EAAgB,CAE1B,MAAM/gC,EAAYnI,KAAKgpC,YAAY/oC,IAAInG,GACvC,GAAIqO,EAAW,CACb,MAAMC,EAAW5G,KAAKC,MAAQ0G,EAC9BnI,KAAKmpC,gBAAgBrvC,EAAQsO,GAC7BpI,KAAKgpC,YAAYpoC,OAAO9G,GACxBkG,KAAK+oC,gBAAgBnoC,OAAO9G,EAC9B,CACF,CACF,CAOQ,eAAAqvC,CAAgBh1C,EAAkBiU,GACxC,IACE,MAAMghC,EAA+B,CACnCj0C,KAAM,WACNH,KAAM,WACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPyE,YAAa/C,EAAe/P,GAC5BiU,YAIoB,oBAAXhU,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,WAAYqoC,EAEtI,OAASloC,GACPC,QAAQD,MAAM,oDAAqDA,EACrE,CACF,CAKQ,mBAAAmoC,GACN,MAAM5nC,EAAMD,KAAKC,MAUjB,OAPmC,IAA/BzB,KAAK4oC,eAAevxC,QAAgBoK,EAAMzB,KAAK6oC,gBAAkB7oC,KAAKspC,wBAChD,oBAAb7mC,WACTzC,KAAK4oC,eAAiBnxC,MAAM6pB,KAAK7e,SAASkmC,iBAAiB,0BAC3D3oC,KAAK6oC,gBAAkBpnC,GAIpBzB,KAAK4oC,cACd,CAKQ,kBAAAH,GACN,GAAsB,oBAAXr0C,OACT,OAIF4L,KAAK4oC,eAAiBnxC,MAAM6pB,KAAK7e,SAASkmC,iBAAiB,0BAC3D3oC,KAAK6oC,gBAAkBrnC,KAAKC,MAE5B,MAAM8nC,EAAgBtmC,EAAS,KAC7B,MAAMylC,EAAW1oC,KAAKqpC,sBAChB5nC,EAAMD,KAAKC,MAEjBinC,EAASznC,QAAQ9M,IACf,MAAMq1C,EAAOr1C,EAAQs1C,wBACfC,EAAiBt1C,OAAOu1C,aAAelnC,SAASmnC,gBAAgBC,aAChEC,EAAgB11C,OAAO21C,YAActnC,SAASmnC,gBAAgBI,YAI9DC,GAFgBhxC,KAAKC,IAAIswC,EAAKU,OAAQR,GAAkBzwC,KAAKkQ,IAAIqgC,EAAK5nB,IAAK,KAC5D3oB,KAAKC,IAAIswC,EAAKW,MAAOL,GAAiB7wC,KAAKkQ,IAAIqgC,EAAKtwB,KAAM,IAEzEkxB,EAAYZ,EAAKa,OAASb,EAAKc,MAGrC,IAFqBF,EAAY,EAAIH,EAAcG,EAAY,KAE1CpqC,KAAKzD,QAAQ67B,WAAa,IAExCp4B,KAAK+oC,gBAAgBjwC,IAAI3E,KAE5B6L,KAAK+oC,gBAAgBhwC,IAAI5E,GACzB6L,KAAKgpC,YAAY7oC,IAAIhM,EAASsN,GAC9BzB,KAAKmpC,gBAAgBh1C,SAKvB,GAAI6L,KAAK+oC,gBAAgBjwC,IAAI3E,GAAU,CAErC,MAAMgU,EAAYnI,KAAKgpC,YAAY/oC,IAAI9L,GACvC,GAAIgU,EAAW,CACb,MAAMC,EAAW3G,EAAM0G,EACvBnI,KAAKmpC,gBAAgBh1C,EAASiU,GAC9BpI,KAAKgpC,YAAYpoC,OAAOzM,GACxB6L,KAAK+oC,gBAAgBnoC,OAAOzM,EAC9B,CACF,KAGH,KAGH6L,KAAKuqC,sBAAwBhB,EAC7BvpC,KAAKwqC,sBAAwBjB,EAE7Bn1C,OAAOs3B,iBAAiB,SAAU1rB,KAAKuqC,sBAAuB,CAAEhD,SAAS,IACzEnzC,OAAOs3B,iBAAiB,SAAU1rB,KAAKwqC,sBAAuB,CAAEjD,SAAS,IAEzEvkC,WAAWumC,EAAe,EAC5B,CAKA,OAAAjU,GACMt1B,KAAKqoC,WACProC,KAAKqoC,SAAS1Y,aACd3vB,KAAKqoC,SAAW,MAIdroC,KAAKuqC,uBAA2C,oBAAXn2C,SACvCA,OAAOgtC,oBAAoB,SAAUphC,KAAKuqC,uBAC1CvqC,KAAKuqC,sBAAwB,MAG3BvqC,KAAKwqC,uBAA2C,oBAAXp2C,SACvCA,OAAOgtC,oBAAoB,SAAUphC,KAAKwqC,uBAC1CxqC,KAAKwqC,sBAAwB,MAG/BxqC,KAAK+oC,gBAAgBznC,QACrBtB,KAAKgpC,YAAY1nC,QACjBtB,KAAK4oC,eAAiB,GACtB5oC,KAAK6oC,gBAAkB,CACzB,EC3QF,MAAM4B,GAAN,WAAA9sC,GACUoC,EAAAC,KAAA,eAAgD,MAChDD,EAAAC,KAAA,gBAAiD,MACjDD,EAAAC,KAAA,oBAA4B,KAC5BD,EAAAC,KAAA,qBAA6B,KAC7BD,EAAAC,KAAA,kBAA0B,GAE1BD,EAAAC,KAAA,oBAA8B,CAAC,WAAY,MAAO,SAAU,QAAS,MAAO,OAAQ,eACpFD,EAAAC,KAAA,eAA6C,KAAA,CAKrD,IAAA+qB,CACEic,EACA0D,EACAnuC,GAQsB,oBAAXnI,cAKU,IAAjB4yC,IACFhnC,KAAK2qC,kBAAoB3D,EACzBhnC,KAAK4qC,mBAAqB3xC,KAAKC,IAAI8tC,EAAc,WAG5B,IAAnB0D,IACF1qC,KAAK0qC,eAAiBA,GAIpBnuC,IACFyD,KAAK0lC,aAAenpC,EAAQ2oC,WAAa,MAI3CllC,KAAK6qC,aAAeloC,EAAS,IAAI3B,KAC/B,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAK8qC,YAAYxtC,IAChB0C,KAAK2qC,mBAGR3qC,KAAK+qC,cAAgBpoC,EAAS,IAAI3B,KAChC,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAKgrC,aAAa1tC,IACjB0C,KAAK4qC,oBAGRnoC,SAASipB,iBAAiB,QAAS1rB,KAAK6qC,cAA+B,GACvEpoC,SAASipB,iBAAiB,SAAU1rB,KAAK+qC,eAAgC,GAC3E,CAKQ,4BAAAE,CAA6BC,EAAwBruC,EAAqB8K,GAChFujC,EAAWtuC,cAAgBC,OACR,IAAfA,EAAK5G,OAAuB0R,IAGN,iBAAf9K,EAAK5G,MACT4G,EAAK5G,MAAM+B,WAAW,eAAkB6E,EAAK5G,MAAM+B,WAAW,gBACjEkzC,EAAWj1C,MAAQ4G,EAAK5G,OAEK,iBAAf4G,EAAK5G,OAA4C,kBAAf4G,EAAK5G,QACvDi1C,EAAWj1C,MAAQ4C,OAAOgE,EAAK5G,QAEnC,CAKQ,WAAA60C,CAAYxtC,SAElB,GAAIgF,IACF,OAGF,MAAMxI,EAASwD,EAAMxD,OACrB,IAAKA,EACH,OAIF,MAAM/B,EAAU,OAAAjD,EAAAgF,EAAO/B,cAAP,EAAAjD,EAAgB+B,cAChC,GAAgB,UAAZkB,GAAmC,aAAZA,EACzB,OAIF,MAAM6N,EAAMzD,IACNO,EAAQF,IACRmD,EAAYnE,KAAKC,MAGjB0pC,EAAe,WACnB,IACE,MAAMlkC,EAAc/C,EAAepK,GAI7B0rC,EAAc,IAHIpgC,EAAetL,GAKrC9E,KAAO8E,EAA4B9E,WAAQ,EAC3CG,KAAO2E,EAA4B3E,WAAQ,EAC3CwtC,YAAc7oC,EAA4B6oC,kBAAe,GAIrDh7B,EAAc3H,KAAKorC,iBAAiBtxC,GAG1C,IAeI7D,EACAyR,EAhBAk7B,EAAmE,OACvE,GAAgB,aAAZ7qC,EACF6qC,EAAY,gBACd,GAAuB,UAAZ7qC,EAAqB,CAC9B,MAAM5C,GAAQ,OAAAL,EAAAgF,EAA4B3E,WAA5B,EAAAL,EAAkC+B,gBAAiB,OAE/D+rC,EADW,aAATztC,EACU,WACM,UAATA,EACG,QAEA,MAEhB,CAiBA,GAXIwS,GAEFD,EAAc5N,EAAO7D,MAAMoB,OAC3BpB,OAAQ,IAGRA,EAAQ6D,EAAO7D,MACfyR,EAAc5N,EAAO7D,MAAMoB,QAIzB2I,KAAK0qC,gBAAkC,IAAhBhjC,EACzB,OAGF,MAAMwjC,EAAyB,CAC7B/1C,KAAM,QACNH,KAAM,QACN2Q,YACAC,MACAlD,QACAuE,cACAu+B,cACA5C,YACA3sC,QACAyR,cACAC,eAGF,GAAI3H,KAAK0lC,aACP,IACE,MAAM7oC,EAAOooC,GAA0BnrC,EAAQwD,EAAO0C,KAAK0lC,cACvD7oC,GACFmD,KAAKirC,6BAA6BC,EAAYruC,EAAM8K,EAExD,OAASi+B,GACPzkC,QAAQywB,KAAK,iDAAkDgU,EACjE,CAIoB,oBAAXxxC,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,QAASmqC,EAEnI,OAAShqC,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,GAIiC,oBAAxB+kC,oBACTA,oBAAoBkF,EAAc,CAAEroC,QAAS,MAE7CE,WAAWmoC,EAAc,EAE7B,CAKQ,YAAAH,CAAa1tC,SAEnB,GAAIgF,IACF,OAGF,MAAMxI,EAASwD,EAAMxD,OACrB,IAAKA,EACH,OAKF,GAAgB,YADA,OAAAhF,EAAAgF,EAAO/B,cAAP,EAAAjD,EAAgB+B,eAE9B,OAIF,MAAM+O,EAAMzD,IACNO,EAAQF,IACRmD,EAAYnE,KAAKC,MAGjB4pC,EAAgB,KACpB,IACE,MAAMpkC,EAAc/C,EAAepK,GAI7B0rC,EAAc,IAHIpgC,EAAetL,GAKrC9E,KAAO8E,EAA6B9E,WAAQ,GAIxC2S,EAAc3H,KAAKorC,iBAAiBtxC,GAGpCwxC,EAAgBxxC,EACtB,IAAI7D,EACAyR,EAaJ,GAXIC,GAEFD,EAAc4jC,EAAcr1C,MAAMoB,OAClCpB,OAAQ,IAGRA,EAAQq1C,EAAcr1C,MACtByR,EAAc4jC,EAAcr1C,MAAMoB,QAIhC2I,KAAK0qC,gBAAkC,IAAhBhjC,EACzB,OAGF,MAAMwjC,EAAyB,CAC7B/1C,KAAM,QACNH,KAAM,QACN2Q,YACAC,MACAlD,QACAuE,cACAu+B,cACA5C,UAAW,SACX3sC,QACAyR,cACAC,eAGF,GAAI3H,KAAK0lC,aACP,IACE,MAAM7oC,EAAOooC,GAA0BnrC,EAAQwD,EAAO0C,KAAK0lC,cACvD7oC,GACFmD,KAAKirC,6BAA6BC,EAAYruC,EAAM8K,EAExD,OAASi+B,GACPzkC,QAAQywB,KAAK,iDAAkDgU,EACjE,CAIoB,oBAAXxxC,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,QAASmqC,EAEnI,OAAShqC,GACPC,QAAQD,MAAM,+CAAgDA,EAChE,GAIiC,oBAAxB+kC,oBACTA,oBAAoBoF,EAAe,CAAEvoC,QAAS,MAE9CE,WAAWqoC,EAAe,EAE9B,CAKQ,gBAAAD,CAAiBj3C,aAEvB,GAAIA,aAAmBo3C,iBAAkB,CAEvC,GAAa,cADA,OAAAz2C,EAAAX,EAAQgB,WAAR,EAAAL,EAAc+B,eAEzB,OAAO,CAEX,CAGA,MAAM7B,GAAQ,OAAAE,EAAAf,EAA6Ba,WAA7B,EAAAE,EAAmC2B,gBAAiB,GAClE,GAAI7B,EACF,IAAA,MAAWw2C,KAAWxrC,KAAKyrC,kBACzB,GAAIz2C,EAAKg5B,SAASwd,GAChB,OAAO,EAMb,MAAM/mC,GAAK,OAAArP,EAAAjB,EAAQsQ,SAAR,EAAArP,EAAYyB,gBAAiB,GACxC,GAAI4N,EACF,IAAA,MAAW+mC,KAAWxrC,KAAKyrC,kBACzB,GAAIhnC,EAAGupB,SAASwd,GACd,OAAO,EAMb,MAAM3zC,EAAYmM,EAAoB7P,EAA8C0D,WAAWhB,cAC/F,GAAIgB,EACF,IAAA,MAAW2zC,KAAWxrC,KAAKyrC,kBACzB,GAAI5zC,EAAUm2B,SAASwd,GACrB,OAAO,EAKb,OAAO,CACT,CAKA,OAAAlW,GACMt1B,KAAK6qC,cAAoC,oBAAbpoC,WAC9BA,SAAS2+B,oBAAoB,QAASphC,KAAK6qC,cAA+B,GAC1E7qC,KAAK6qC,aAAe,MAGlB7qC,KAAK+qC,eAAqC,oBAAbtoC,WAC/BA,SAAS2+B,oBAAoB,SAAUphC,KAAK+qC,eAAgC,GAC5E/qC,KAAK+qC,cAAgB,KAEzB,EClWF,MAAMW,GAOJ,WAAA/tC,GANQoC,EAAAC,KAAA,eACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,WAAmB,GAGzBA,KAAK2rC,YAAc,IAAIxM,GACvBn/B,KAAK4rC,aAAe,IAAI7E,GACxB/mC,KAAK6rC,gBAAkB,IAAI1D,GAC3BnoC,KAAK8rC,aAAe,IAAIrB,EAC1B,CAKA,IAAA1f,CAAKxuB,GAYH,GAAIyD,KAAK23B,QACP,OAGF,MAAMoU,YACJA,GAAc,EAAAC,eACdA,GAAiB,EAAAC,YACjBA,GAAc,EAAAC,kBACdA,EAAAvB,kBACAA,EAAArrC,kBACAA,GAAoB,EAAAC,sBACpBA,GAAwB,EAAAE,sBACxBA,GAAwB,EAAAC,sBACxBA,GAAwB,EAAAwlC,UACxBA,GACE3oC,GAAW,CAAA,EAGfyD,KAAK2rC,YAAY5gB,OAGbghB,GACF/rC,KAAK4rC,aAAa7gB,KAAKmhB,EAAmB,CACxC5sC,oBACAC,wBACAE,wBACAC,wBACAwlC,cAKA8G,GACFhsC,KAAK6rC,gBAAgB9gB,OAInBkhB,GACFjsC,KAAK8rC,aAAa/gB,KAAK4f,OAAmB,EAAW,CACnDrrC,oBACAC,wBACAE,wBACAC,wBACAwlC,cAIJllC,KAAK23B,SAAU,CACjB,CAKA,cAAAwU,GACE,OAAOnsC,KAAK2rC,WACd,CAKA,eAAAS,GACE,OAAOpsC,KAAK4rC,YACd,CAKA,kBAAAS,GACE,OAAOrsC,KAAK6rC,eACd,CAKA,eAAAS,GACE,OAAOtsC,KAAK8rC,YACd,CAKA,OAAAxW,GACOt1B,KAAK23B,UAIV33B,KAAK2rC,YAAYrW,UACjBt1B,KAAK4rC,aAAatW,UAClBt1B,KAAK6rC,gBAAgBvW,UACrBt1B,KAAK8rC,aAAaxW,UAElBt1B,KAAK23B,SAAU,EACjB,EC5HF,MAAM4U,GAAN,WAAA5uC,GACUoC,EAAAC,KAAA,WAA8B,IAC9BD,EAAAC,KAAA,iBAAsCO,KACtCR,EAAAC,KAAA,eAAuB,IAAA,CAK/B,IAAA+qB,GACE,GAAsB,oBAAX32B,OACT,OAIF,MAAMo4C,EAAuBlvC,IAEvBA,aAAiBmvC,WAEnBzsC,KAAK0sC,cAAcpvC,GAGnB0C,KAAK2sC,oBAAoBrvC,IAI7BlJ,OAAOs3B,iBAAiB,QAAS8gB,GAAqB,GACtDxsC,KAAK4+B,SAASvlC,KAAK,KACjBjF,OAAOgtC,oBAAoB,QAASoL,GAAqB,KAI3D,MAAMI,EAAuBtvC,IAC3B0C,KAAK6sC,mBAAmBvvC,IAE1BlJ,OAAOs3B,iBAAiB,qBAAsBkhB,GAC9C5sC,KAAK4+B,SAASvlC,KAAK,KACjBjF,OAAOgtC,oBAAoB,qBAAsBwL,IAErD,CAKQ,aAAAF,CAAcpvC,SACpB,IACE,MAAMwvC,EAAyB,CAC7B33C,KAAM,QACNH,KAAM,WACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKtI,EAAMuK,UAAY1F,IACvBO,MAAOF,IACPuqC,UAAW,KACXnlC,QAAStK,EAAMsK,SAAW,gBAC1BolC,MAAQ,OAAAl4C,EAAAwI,EAAM4D,YAAN,EAAApM,EAAuBk4C,MAC/BnlC,SAAUvK,EAAMuK,SAChBC,OAAQxK,EAAMwK,OACdC,MAAOzK,EAAMyK,OAGf/H,KAAKitC,UAAUH,EACjB,OAAS5rC,GACPC,QAAQD,MAAM,yCAA0CA,EAC1D,CACF,CAKQ,kBAAA2rC,CAAmBvvC,GAEzB,IAAIgF,IAIJ,IACE,MAAM4qC,EAAS5vC,EAAM4vC,OACrB,IACIF,EADAplC,EAAU,8BAGVslC,aAAkBvtB,OACpB/X,EAAUslC,EAAOtlC,QACjBolC,EAAQE,EAAOF,OAEfplC,EAD2B,iBAAXslC,EACNA,EAEAzkC,KAAKC,UAAUwkC,GAG3B,MAAMJ,EAAyB,CAC7B33C,KAAM,QACNH,KAAM,gBACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPuqC,UAAW,UACXnlC,UACAolC,SAGFhtC,KAAKitC,UAAUH,EACjB,OAAS5rC,GACPC,QAAQD,MAAM,8CAA+CA,EAC/D,CACF,CAKQ,mBAAAyrC,CAAoBrvC,SAE1B,IAAIgF,IAIJ,IACE,MAAMxI,EAASwD,EAAMxD,OACrB,IAAKA,EACH,OAIF,MAAM/B,EAAU,OAAAjD,EAAAgF,EAAO/B,cAAP,EAAAjD,EAAgB+B,cAChC,IAAK,CAAC,MAAO,SAAU,OAAQ,QAAS,SAASm3B,SAASj2B,GACxD,OAGF,IAAIiQ,EAAc,GAWlB,GAVIlO,aAAkBqzC,kBAEXrzC,aAAkBszC,kBAD3BplC,EAAclO,EAAOosB,KAAO,GAGnBpsB,aAAkBuzC,gBAC3BrlC,EAAclO,EAAOuI,MAAQ,IACpBvI,aAAkBwzC,kBAAoBxzC,aAAkByzC,oBACjEvlC,EAAclO,EAAOosB,KAAO,KAGzBle,EACH,OAGF,MAAM8kC,EAAyB,CAC7B33C,KAAM,QACNH,KAAM,iBACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPuqC,UAAW,WACXnlC,QAAS,4BAA4BI,IACrCA,cACAyyB,aAAc1iC,GAGhBiI,KAAKitC,UAAUH,EACjB,OAAS5rC,GACPC,QAAQD,MAAM,+CAAgDA,EAChE,CACF,CAKQ,WAAAssC,CAAYV,GAClB,MAAM9lC,EAAkB,CAAC8lC,EAAWC,UAAWD,EAAWllC,SAoB1D,MAjB6B,OAAzBklC,EAAWC,WAA+C,YAAzBD,EAAWC,YAC1CD,EAAWjlC,UACbb,EAAM3N,KAAKyzC,EAAWjlC,UAEpBilC,EAAWhlC,QACbd,EAAM3N,KAAKR,OAAOi0C,EAAWhlC,SAE3BglC,EAAW/kC,OACbf,EAAM3N,KAAKR,OAAOi0C,EAAW/kC,SAKJ,aAAzB+kC,EAAWC,WAA4BD,EAAW9kC,aACpDhB,EAAM3N,KAAKyzC,EAAW9kC,aAGjBhB,EAAMhC,KAAK,IACpB,CAKQ,SAAAioC,CAAUH,GAEhB,MAAMW,EAAWztC,KAAKwtC,YAAYV,GAC5BpmC,EAAW1G,KAAK0tC,WAAWztC,IAAIwtC,GAC/BhsC,EAAMD,KAAKC,MAEbiF,GAAYjF,EAAMiF,EAAW1G,KAAKgnC,eAMtChnC,KAAK0tC,WAAWvtC,IAAIstC,EAAUhsC,GAG9BzB,KAAK2tC,uBAAuBlsC,GAGN,oBAAXrN,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,QAAS+rC,GAEnI,CAKQ,sBAAAa,CAAuBlsC,GAE7B,IAAA,MAAYhL,EAAK2S,KAASpJ,KAAK0tC,WAAW/2C,UACpC8K,EAAM2H,EAFO,KAGfpJ,KAAK0tC,WAAW9sC,OAAOnK,EAG7B,CAKA,UAAAm3C,CAAW1sC,EAAuB2sC,GAChC,IACE,IAAIjmC,EACAolC,EAEA9rC,aAAiBye,OACnB/X,EAAU1G,EAAM0G,QAChBolC,EAAQ9rC,EAAM8rC,OAEdplC,EAAU1G,EAGZ,MAAM4rC,EAAyB,CAC7B33C,KAAM,QACNH,KAAM,eACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPuqC,UAAW,KACXnlC,UACAolC,QACAtnC,WAAYmoC,GAGd7tC,KAAKitC,UAAUH,EACjB,OAAS3uC,GACPgD,QAAQD,MAAM,6CAA8C/C,EAC9D,CACF,CAKA,OAAAm3B,GACEt1B,KAAK4+B,SAAS39B,QAAQy6B,GAAWA,KACjC17B,KAAK4+B,SAAW,GAChB5+B,KAAK0tC,WAAWpsC,OAClB,ECtQF,MAAMwsC,GAAN,WAAAnwC,GACUoC,EAAAC,KAAA,WAAuC,MACvCD,EAAAC,KAAA,6BAAqC,GACrCD,EAAAC,KAAA,oBAAyCO,KACzCR,EAAAC,KAAA,oBAAyCO,KACzCR,EAAAC,KAAA,uBAA+B,KAC/BD,EAAAC,KAAA,uBAA+B,IAAA,CAKvC,IAAA+qB,GACwB,oBAAX32B,QAA2BA,OAAOgS,cAKjB,aAAxB3D,SAASsrC,YACX/tC,KAAKguC,0BACLhuC,KAAKiuC,yBAEL75C,OAAOs3B,iBAAiB,OAAQ,KAC9B1rB,KAAKguC,0BACLhuC,KAAKiuC,0BAKTjuC,KAAKkuC,mBACP,CAKQ,uBAAAF,GAEN,IAAI1rC,MAKAtC,KAAKmuC,0BAIT,IACE,MAAMC,EAAShoC,YAAYioC,iBAAiB,cAAc,GAC1D,IAAKD,EACH,OAGF,MAAMlmC,EAAkC,CAEtCixB,IAAKiV,EAAOE,gBAAkBF,EAAOG,kBAErClV,IAAK+U,EAAOI,WAAaJ,EAAOK,aAEhCnV,IAAK8U,EAAOM,sBAAwB,EAAIN,EAAOI,WAAaJ,EAAOM,sBAAwB,EAE3FxW,KAAMkW,EAAOO,cAAgBP,EAAOQ,aAEpCpiB,SAAU4hB,EAAOS,YAAcT,EAAOO,cAEtCpV,SAAU6U,EAAOU,eAAiBV,EAAOS,YAEzCrV,aAAc4U,EAAOW,eAAiBX,EAAOY,yBAE7CnqB,MAAOupB,EAAOa,aAAeb,EAAOc,WAEpCzV,iBAAkB2U,EAAOY,yBAA2BZ,EAAOc,WAE3DxV,KAAM0U,EAAOa,aAAeb,EAAOc,YAG/BC,EAAqC,CACzCh6C,KAAM,cACNH,KAAM,oBACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPyF,WAAY,aACZC,WAGFlI,KAAKmuC,2BAA4B,EACjCnuC,KAAKovC,gBAAgBD,EACvB,OAASjuC,GACPC,QAAQD,MAAM,0DAA2DA,EAC3E,CACF,CAKQ,qBAAA+sC,GACN,IACE,MAAMtU,EAAYvzB,YAAYioC,iBAAiB,YAC/C,IAAK1U,GAAkC,IAArBA,EAAUtiC,OAC1B,OAGF,MAAMoK,EAAMD,KAAKC,MACjBk4B,EAAU14B,QAAQouC,IAChB,MAAMrnC,EAAcqnC,EAASr6C,KAGvB0R,EAAW1G,KAAKsvC,cAAcrvC,IAAI+H,GACxC,GAAItB,GAAYjF,EAAMiF,EAAW1G,KAAKuvC,qBACpC,OAIFvvC,KAAKsvC,cAAcnvC,IAAI6H,EAAavG,GAEpC,MAAMyG,EAAkC,CAEtCixB,IAAKkW,EAASf,gBAAkBe,EAASd,kBAEzClV,IAAKgW,EAASb,WAAaa,EAASZ,aAEpCvgB,QAASmhB,EAASV,cAAgBU,EAAST,aAE3CpiB,SAAU6iB,EAASR,YAAcQ,EAASV,cAE1C9pB,MAAOwqB,EAASR,YAAcQ,EAASlnC,UAEvCgP,KAAOk4B,EAAmEG,cAAgB,GAGtFL,EAAqC,CACzCh6C,KAAM,cACNH,KAAM,kBACN2Q,UAAWlE,EACXmE,IAAKzD,IACLO,MAAOF,IACPyF,WAAY,WACZC,QAAS,IACJA,EACHF,YAAaqnC,EAASr6C,KACtBylC,aAAc4U,EAASI,gBAI3BzvC,KAAKovC,gBAAgBD,KAIvBnvC,KAAK0vC,0BAA0BjuC,EACjC,OAASP,GACPC,QAAQD,MAAM,wDAAyDA,EACzE,CACF,CAKQ,gBAAAgtC,GACN,GAAmC,oBAAxB1e,qBAAwCD,KAInD,IAEE,MAAMogB,EAAwB1sC,EAAS,IAAIjC,KACzC,MAAMsnC,EAAQtnC,EAAK,GACbS,EAAMD,KAAKC,MAEXmuC,EAAU,GAAGtH,EAAMngC,aAAamgC,EAAMlgC,WAGtC1B,EAAW1G,KAAK6vC,cAAc5vC,IAAI2vC,GACxC,GAAIlpC,GAAYjF,EAAMiF,EAAW1G,KAAK8vC,qBACpC,OAIF9vC,KAAK6vC,cAAc1vC,IAAIyvC,EAASnuC,GAEhC,MAAM0tC,EAAqC,CACzCh6C,KAAM,cACNH,KAAM,WACN2Q,UAAWlE,EACXmE,IAAKzD,IACLO,MAAOF,IACPyF,WAAY,WACZC,QAAS,CACPE,SAAUkgC,EAAMlgC,SAChBD,UAAWmgC,EAAMngC,YAIrBnI,KAAKovC,gBAAgBD,GAGrBnvC,KAAK+vC,0BAA0BtuC,IAC9BzB,KAAK8vC,sBAER9vC,KAAKqoC,SAAW,IAAI7Y,oBAAoBwgB,IACtCA,EAAKC,aAAahvC,QAAQqnC,IACA,aAApBA,EAAM4H,WACRP,EAAsBrH,OAK5BtoC,KAAKqoC,SAAS5Y,QAAQ,CAAEC,WAAY,CAAC,aACvC,OAASxuB,GACPC,QAAQD,MAAM,kDAAmDA,EACnE,CACF,CAKQ,yBAAAwuC,CAA0BjuC,GAEhC,IAAA,MAAYhL,EAAK2S,KAASpJ,KAAKsvC,cAAc34C,UACvC8K,EAAM2H,EAFO,KAGfpJ,KAAKsvC,cAAc1uC,OAAOnK,EAGhC,CAKQ,yBAAAs5C,CAA0BtuC,GAEhC,IAAA,MAAYhL,EAAK2S,KAASpJ,KAAK6vC,cAAcl5C,UACvC8K,EAAM2H,EAFO,KAGfpJ,KAAK6vC,cAAcjvC,OAAOnK,EAGhC,CAKQ,eAAA24C,CAAgBD,GAEA,oBAAX/6C,QAA2BA,OAA+F2qC,mBAClI3qC,OAA8F2qC,kBAAkBh+B,KAAK,cAAeouC,EAEzI,CAKA,cAAAgB,GACE,IACE,MAAM/B,EAAShoC,YAAYioC,iBAAiB,cAAc,GAC1D,IAAKD,EACH,OAAO,KAGT,MAAMlmC,EAAkC,CACtCixB,IAAKiV,EAAOE,gBAAkBF,EAAOG,kBACrClV,IAAK+U,EAAOI,WAAaJ,EAAOK,aAChCvW,KAAMkW,EAAOO,cAAgBP,EAAOQ,aACpCpiB,SAAU4hB,EAAOS,YAAcT,EAAOO,cACtCpV,SAAU6U,EAAOU,eAAiBV,EAAOS,YACzCrV,aAAc4U,EAAOW,eAAiBX,EAAOY,yBAC7CnqB,MAAOupB,EAAOa,aAAeb,EAAOc,YAGtC,MAAO,CACL/5C,KAAM,cACNH,KAAM,qBACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPyF,WAAY,aACZC,UAEJ,OAAShH,GAEP,OADAC,QAAQD,MAAM,gDAAiDA,GACxD,IACT,CACF,CAKA,OAAAo0B,GACMt1B,KAAKqoC,WACProC,KAAKqoC,SAAS1Y,aACd3vB,KAAKqoC,SAAW,MAElBroC,KAAKmuC,2BAA4B,EACjCnuC,KAAKsvC,cAAchuC,QACnBtB,KAAK6vC,cAAcvuC,OACrB,ECjSF,MAAM8uC,GAIJ,WAAAzyC,CAAY0yC,EAAwBC,OAAOC,mBAHnCxwC,EAAAC,KAAA,iBACAD,EAAAC,KAAA,mBAA2B,GAGjCA,KAAKqwC,cAAgBA,CACvB,CAEA,kBAAAG,GACE,OAAOxwC,KAAKywC,eACd,CAEA,kBAAAC,CAAmBC,GACjB3wC,KAAKywC,gBAAkBE,CACzB,CAEA,kBAAAC,CAAmBr6C,GACjB,IAAIs6C,EAAa,EAEjB,IAAA,MAAWC,KAAYv6C,EAAKw6C,UAC1BF,GAAcC,EAASE,KAAK35C,OAAS,GACrCw5C,GA5ByC,IA4B3BC,EAASG,UAAU55C,OAGnC,IAAA,MAAW65C,KAAe36C,EAAK46C,aAC7BN,GAAc7wC,KAAKoxC,yBAAyBF,GAG9C,OAAOL,CACT,CAEA,WAAAQ,CAAY96C,EAA+B+6C,GACzC,OAAItxC,KAAKywC,kBAILzwC,KAAKqwC,gBAAkBC,OAAOC,sBAI9BvwC,KAAK4wC,mBAAmBr6C,GAAQ+6C,EAAatxC,KAAKqwC,iBACpDrwC,KAAKywC,iBAAkB,GAChB,IAIX,CAEA,wBAAAW,CAAyBF,GACvB,IACE,OAAOzoC,KAAKC,UAAUwoC,GAAa75C,MACrC,CAAA,MACE,OAAO,GACT,CACF,ECjDF,MAAMk6C,GAGJ,WAAA5zC,CAA6BpB,GAFrBwD,EAAAC,KAAA,4BAAkD,MAqClDD,EAAAC,KAAA,cAAe1C,UACrB0C,KAAKzD,QAAQi1C,cAAc,CACzBr8C,KAAM,QACNwQ,UAAWnE,KAAKC,MAChBlL,KAAM,CACJ6Q,EAAG9J,EAAMkpC,QACTl/B,EAAGhK,EAAMmpC,QACT3sC,OAAS,OAAAhF,EAAAwI,EAAMxD,aAAN,EAAAhF,EAAiCiD,aAKxCgI,EAAAC,KAAA,cAAe1C,IACrB,MAAMxD,EAASwD,EAAMxD,OAChBA,GAILkG,KAAKzD,QAAQi1C,cAAc,CACzBr8C,KAAM,QACNwQ,UAAWnE,KAAKC,MAChBlL,KAAM,CACJwB,QAAS+B,EAAO/B,QAChB9B,MAAO6D,EAAO7D,MAAMuB,UAAU,EAAG,UAK/BuI,EAAAC,KAAA,eAAe,KACrBA,KAAKzD,QAAQi1C,cAAc,CACzBr8C,KAAM,SACNwQ,UAAWnE,KAAKC,MAChBlL,KAAM,CACJk7C,QAASr9C,OAAOq9C,QAChBC,QAASt9C,OAAOs9C,aAKd3xC,EAAAC,KAAA,kBAAmB1C,IACzB0C,KAAKzD,QAAQi1C,cAAc,CACzBr8C,KAAM,YACNwQ,UAAWnE,KAAKC,MAChBlL,KAAM,CACJ6Q,EAAG9J,EAAMkpC,QACTl/B,EAAGhK,EAAMmpC,aAhFczmC,KAAAzD,QAAAA,CAAoD,CAEjF,KAAAS,GACwB,oBAAX5I,QAA8C,oBAAbqO,WAI5CA,SAASipB,iBAAiB,QAAS1rB,KAAKmnC,aAAa,GACrD1kC,SAASipB,iBAAiB,QAAS1rB,KAAK8qC,aAAa,GACrD12C,OAAOs3B,iBAAiB,SAAU1rB,KAAK2xC,aAAc,CAAEpK,SAAS,IAE5DvnC,KAAKzD,QAAQq1C,kBACf5xC,KAAK6xC,0BAA4B5uC,EAAS,IAAIjC,KAC5C,MAAM1D,EAAQ0D,EAAK,GACnBhB,KAAK8xC,gBAAgBx0C,IACpB,KACHmF,SAASipB,iBAAiB,YAAa1rB,KAAK6xC,0BAA2B,CAAEtK,SAAS,KAEtF,CAEA,IAAA7O,GAC0B,oBAAbj2B,WAIXA,SAAS2+B,oBAAoB,QAASphC,KAAKmnC,aAAa,GACxD1kC,SAAS2+B,oBAAoB,QAASphC,KAAK8qC,aAAa,GACxD12C,OAAOgtC,oBAAoB,SAAUphC,KAAK2xC,aAAc,CAAEpK,SAAS,IAE/DvnC,KAAK6xC,4BACPpvC,SAAS2+B,oBAAoB,YAAaphC,KAAK6xC,0BAA2B,CAAEtK,SAAS,IACrFvnC,KAAK6xC,0BAA4B,MAErC,ECjDF,MAAME,GAIJ,WAAAp0C,CACmBq0C,EACAC,GALXlyC,EAAAC,KAAA,YAA2B,IAC3BD,EAAAC,KAAA,eAAkC,IAGvBA,KAAAgyC,aAAAA,EACAhyC,KAAAiyC,8BAAAA,CAChB,CAEH,YAAAC,GACE,OAAOlyC,KAAK+wC,SACd,CAEA,YAAAoB,CAAapB,GACX/wC,KAAK+wC,UAAYA,CACnB,CAEA,eAAAqB,GACE,OAAOpyC,KAAKmxC,YACd,CAEA,eAAAkB,CAAgBlB,GACdnxC,KAAKmxC,aAAeA,CACtB,CAEA,cAAAmB,CAAetB,EAAcrrC,GACvB3F,KAAK+wC,UAAU15C,QAAU2I,KAAKgyC,cAChChyC,KAAK+wC,UAAUxzB,QAGjBvd,KAAK+wC,UAAU13C,KAAK,CAClBsM,YACAqrC,OACAC,UAAW,IAEf,CAEA,YAAAsB,GACE,OAAOvyC,KAAK+wC,UAAU15C,OAAS,CACjC,CAEA,8BAAAm7C,CAA+BvB,GAC7B,MAAMwB,EAAezyC,KAAK+wC,UAAU/wC,KAAK+wC,UAAU15C,OAAS,GAE5D,IAAKo7C,GAAqC,IAArBxB,EAAU55C,OAC7B,MAAO,GAGT,IAAIq7C,EAAWzB,EACf,MAAM0B,EAAWF,EAAaxB,UAAU55C,OAASq7C,EAASr7C,OAE1D,GAAIs7C,EAAW3yC,KAAKiyC,8BAA+B,CACjD,MAAMW,EAASD,EAAW3yC,KAAKiyC,8BAE/B,GAAIW,GAAUH,EAAaxB,UAAU55C,OACnCo7C,EAAaxB,UAAUnwC,OAAO,EAAG8xC,OAC5B,CACL,MAAMC,EAAcD,EAASH,EAAaxB,UAAU55C,OACpDo7C,EAAaxB,UAAU55C,OAAS,EAChCq7C,EAAWzB,EAAUz3C,MAAMq5C,EAC7B,CACF,CAEA,OAAOH,CACT,CAEA,+BAAAI,CAAgC7B,GAC9B,GAAyB,IAArBA,EAAU55C,OACZ,OAGF,MAAMo7C,EAAezyC,KAAK+wC,UAAU/wC,KAAK+wC,UAAU15C,OAAS,GACvDo7C,GAILA,EAAaxB,UAAU53C,QAAQ43C,EACjC,CAEA,iBAAA8B,CAAkB7B,GACZlxC,KAAKmxC,aAAa95C,QAAU2I,KAAKgyC,cACnChyC,KAAKmxC,aAAa5zB,QAGpBvd,KAAKmxC,aAAa93C,KAAK63C,EACzB,CAEA,OAAA8B,GACE,MAAO,CACLjC,UAAW,IAAI/wC,KAAK+wC,WACpBI,aAAc,IAAInxC,KAAKmxC,cAE3B,CAEA,KAAA7vC,GACEtB,KAAK+wC,UAAY,GACjB/wC,KAAKmxC,aAAe,EACtB,EC3EF,MAAM8B,GAQJ,WAAAt1C,CAAYpB,EAAgC,IAPpCwD,EAAAC,KAAA,WAAoC,MACpCD,EAAAC,KAAA,eAAuB,GACvBD,EAAAC,KAAA,qBAA6B,KACpBD,EAAAC,KAAA,SACAD,EAAAC,KAAA,UACAD,EAAAC,KAAA,wBAGf,MAAM4xC,EAAkBr1C,EAAQq1C,kBAAmB,EACnD5xC,KAAKkzC,mBAAqB32C,EAAQ42C,oBAAsB,IACxD,MAAMnB,EAAez1C,EAAQy1C,cAAgB,IACvC3B,OAA0C,IAA1B9zC,EAAQ8zC,eAA+B9zC,EAAQ8zC,cAAgB,EACjF9zC,EAAQ8zC,cACRC,OAAOC,kBACL0B,OACsC,IAA1C11C,EAAQ01C,+BAA+C11C,EAAQ01C,8BAAgC,EAC3F11C,EAAQ01C,8BA/BgC,IAkC9CjyC,KAAKoxB,MAAQ,IAAI2gB,GAAmBC,EAAcC,GAClDjyC,KAAKozC,OAAS,IAAIhD,GAAoBC,GACtCrwC,KAAKqzC,qBAAuB,IAAI9B,GAAkC,CAChEK,kBACAJ,cAAeN,IACblxC,KAAKszC,kBAAkBpC,KAG7B,CAEA,aAAYH,GACV,OAAO/wC,KAAKoxB,MAAM8gB,cACpB,CAEA,aAAYnB,CAAUA,GACpB/wC,KAAKoxB,MAAM+gB,aAAapB,EAC1B,CAEA,gBAAYI,GACV,OAAOnxC,KAAKoxB,MAAMghB,iBACpB,CAEA,gBAAYjB,CAAaA,GACvBnxC,KAAKoxB,MAAMihB,gBAAgBlB,EAC7B,CAEA,mBAAYV,GACV,OAAOzwC,KAAKozC,OAAO5C,oBACrB,CAEA,mBAAYC,CAAgBA,GAC1BzwC,KAAKozC,OAAO1C,mBAAmBD,EACjC,CAKQ,gBAAA8C,CAAiBjC,GACvB,OAAOtxC,KAAKozC,OAAO/B,YAAY,CAC7BN,UAAW/wC,KAAK+wC,UAChBI,aAAcnxC,KAAKmxC,cAClBG,EACL,CAKA,KAAAt0C,GACE,GAAIgD,KAAKwzC,aAAmC,oBAAb/wC,SAC7B,OAGFzC,KAAKwzC,aAAc,EAGnBxzC,KAAKyzC,eAGL,MAAMC,EAAkBzwC,EAAS,IAAIjC,KACnC,MAAMiwC,EAAYjwC,EAAK,GACvBhB,KAAK2zC,gBAAgB1C,IACpBjxC,KAAKkzC,oBAGwB,mBAArBU,kBAKX5zC,KAAKqoC,SAAW,IAAIuL,iBAAiBF,GAErC1zC,KAAKqoC,SAAS5Y,QAAQhtB,SAASmqB,KAAM,CACnCinB,WAAW,EACXC,SAAS,EACTC,YAAY,EACZC,mBAAmB,EACnBC,eAAe,IAIjBj0C,KAAKqzC,qBAAqBr2C,SAfxBgD,KAAKqzC,qBAAqBr2C,OAgB9B,CAKA,IAAA07B,GACO14B,KAAKwzC,cAIVxzC,KAAKwzC,aAAc,EAEfxzC,KAAKqoC,WACProC,KAAKqoC,SAAS1Y,aACd3vB,KAAKqoC,SAAW,MAGlBroC,KAAKqzC,qBAAqB3a,OAC5B,CAKQ,YAAA+a,GACN,IACE,MAAMzC,EAAOvuC,SAASmnC,gBAAgBsK,UACtC,IAAKl0C,KAAKuzC,iBAAiBvC,EAAK35C,QAC9B,OAEF2I,KAAKoxB,MAAMkhB,eAAetB,EAAMxvC,KAAKC,MACvC,OAASP,GACPC,QAAQD,MAAM,wCAAyCA,EACzD,CACF,CAKQ,eAAAyyC,CAAgB1C,GACtB,GAAIjxC,KAAKywC,kBAAoBzwC,KAAKoxB,MAAMmhB,gBAAuC,IAArBtB,EAAU55C,OAClE,OAGF,MAAMq7C,EAAW1yC,KAAKoxB,MAAMohB,+BAA+BvB,GAE3D,GAAwB,IAApByB,EAASr7C,OACX,OAGF,MAAM88C,EH3KqC,IG2KvBzB,EAASr7C,OACxB2I,KAAKuzC,iBAAiBY,IAI3Bn0C,KAAKoxB,MAAM0hB,gCAAgCJ,EAC7C,CAKQ,iBAAAY,CAAkBpC,GACxB,MAAMhjC,EAAQlO,KAAKozC,OAAOhC,yBAAyBF,GAC9ClxC,KAAKuzC,iBAAiBrlC,IAG3BlO,KAAKoxB,MAAM2hB,kBAAkB7B,EAC/B,CAKA,OAAA8B,GAIE,MAAO,CACLjC,UAAW,IAAI/wC,KAAK+wC,WACpBI,aAAc,IAAInxC,KAAKmxC,cAE3B,CAKA,KAAA7vC,GACEtB,KAAK+wC,UAAY,GACjB/wC,KAAKmxC,aAAe,EACtB,CAKA,OAAA7b,GACEt1B,KAAK04B,OACL14B,KAAKsB,OACP,ECjNF,MAAM8yC,GAMJ,WAAAz2C,CAA6BmC,GALrBC,EAAAC,KAAA,cAAkC,MAClCD,EAAAC,KAAA,eAAoC,MACpCD,EAAAC,KAAA,qBAAgD,MAChDD,EAAAC,KAAA,gBAAsC,MAEjBA,KAAAF,OAAAA,CAAuB,CAEpD,IAAAirB,GAsBE,GArBI/qB,KAAKF,OAAOG,IAAI,qBAAuBD,KAAKq0C,cAC9Cr0C,KAAKq0C,YAAc,IAAI3I,GACvB1rC,KAAKq0C,YAAYtpB,KAAK,CACpBzrB,kBAAmBU,KAAKF,OAAOG,IAAI,uBAAwB,EAC3DV,sBAAuBS,KAAKF,OAAOG,IAAI,2BAA4B,EACnER,sBAAuBO,KAAKF,OAAOG,IAAI,2BAA4B,EACnEP,sBAAuBM,KAAKF,OAAOG,IAAI,2BAA4B,EACnEilC,UAAW,IAAMllC,KAAKF,OAAOI,YAI7BF,KAAKF,OAAOG,IAAI,sBAAwBD,KAAKs0C,eAC/Ct0C,KAAKs0C,aAAe,IAAI/H,GACxBvsC,KAAKs0C,aAAavpB,QAGhB/qB,KAAKF,OAAOG,IAAI,4BAA8BD,KAAKu0C,qBACrDv0C,KAAKu0C,mBAAqB,IAAIzG,GAC9B9tC,KAAKu0C,mBAAmBxpB,QAGtB/qB,KAAKF,OAAOG,IAAI,yBAA2BD,KAAKw0C,cAAe,CACjE,MAAMC,EAAuBz0C,KAAKF,OAAOG,IAAI,kBAAoB,CAAA,EAC3Dy0C,EAA4B10C,KAAKF,OAAOG,IAAI,6BAElDD,KAAKw0C,cAAgB,IAAIvB,GAAc,IAClCwB,EACHzC,aACEyC,EAAqBzC,cAAgB0C,IAEzC10C,KAAKw0C,cAAcx3C,OACrB,CACF,CAEA,cAAA23C,GACE,OAAO30C,KAAKq0C,WACd,CAEA,eAAAO,GACE,OAAO50C,KAAKs0C,YACd,CAEA,qBAAAO,GACE,OAAO70C,KAAKu0C,kBACd,CAEA,gBAAAO,GACE,OAAO90C,KAAKw0C,aACd,CAEA,OAAAlf,eACE,OAAAxgC,EAAAkL,KAAKq0C,cAALv/C,EAAkBwgC,UAClB,OAAApgC,EAAA8K,KAAKs0C,eAALp/C,EAAmBogC,UACnB,OAAAlgC,EAAA4K,KAAKu0C,qBAALn/C,EAAyBkgC,UACzB,OAAAhgC,EAAA0K,KAAKw0C,gBAALl/C,EAAoBggC,SACtB,ECxDF,MAAMyf,GACJ,WAAAp3C,CACmBq3C,EACAC,EACA/V,EACAgW,EACAC,GAJAn1C,KAAAg1C,SAAAA,EACAh1C,KAAAi1C,cAAAA,EACAj1C,KAAAk/B,YAAAA,EACAl/B,KAAAk1C,iBAAAA,EACAl1C,KAAAm1C,WAAAA,CAChB,CAEH,QAAArP,CAASxoC,EAAqB6rB,GAC5B,IAAInpB,KAAKm1C,aAIT,IACE,MAAMC,EAAgBp1C,KAAKg1C,SAAS7W,OAAO7gC,EAAO,CAChD8B,SAAU+pB,EAAQ/pB,SAClB8C,UAAWinB,EAAQjnB,UACnBm8B,aAAclV,EAAQkV,aACtBD,SAAUjV,EAAQiV,SAClB/+B,iBAAkB8pB,EAAQ9pB,mBAGtBwqB,EAAiB7pB,KAAKi1C,cAAc/rB,QAAQksB,EAAe,CAC/Dt2C,WAAYqqB,EAAQrqB,WACpB4qB,qBAAqB,EACrBxqB,kBAAmBiqB,EAAQjqB,oBAAqB,EAChD8G,WAA2B,UAAf1I,EAAMnI,OAGpB,IAAK00B,EACH,OAGF,GAAIV,EAAQksB,WAAY,CACtB,MAAM13B,EAASwL,EAAQksB,WAAWxrB,GAClC,IAAe,IAAXlM,GAA+B,OAAXA,EACtB,OAEEA,GACFjnB,OAAO4+C,OAAOzrB,EAAgBlM,EAElC,CAEA3d,KAAKk/B,YAAYnmC,IAAI8wB,EAAgB,CACnCoJ,gBAAiB,CAACvyB,EAAwBmyB,KACnC1J,EAAQosB,WAIb70C,EAAOO,QAAQ3D,IACb0F,WAAW,WACT,OAAAlO,EAAAq0B,EAAQosB,qBAAYj4C,EAAOu1B,IAC1B,QAKU,aAAfv1B,EAAMnI,MACR6K,KAAKk1C,iBAAiB3e,gBAAgB1M,EAE1C,OAAS3oB,GACHioB,EAAQqsB,QACVrsB,EAAQqsB,QAAQt0C,GAEhBC,QAAQD,MAAM,gCAAiCA,EAEnD,CACF,ECvDF,MAAMu0C,GAGF,CACF9d,SAAS,EACT+d,mBAAmB,EACnBC,oBAAoB,EACpBC,oBAAqB,OACrBC,mBAAoB,OACpBC,oBAAoB,GAMtB,SAASC,GAAgBnwC,EAAahI,GACpC,OAAKA,IAIiB,iBAAXA,EACFgI,EAAIooB,SAASpwB,GAGlBA,aAAkBo4C,OACbp4C,EAAOtG,KAAKsO,GAGC,mBAAXhI,GACFA,EAAOgI,GAIlB,CAKA,SAASqwC,GAAsB1/C,EAAe2/C,GAC5C,IAAK3/C,GAAwB,iBAATA,GAAgD,IAA3B2/C,EAAgB7+C,OACvD,OAAOd,EAGT,GAAIkB,MAAMC,QAAQnB,GAChB,OAAOA,EAAKmN,IAAIC,GAAQsyC,GAAsBtyC,EAAMuyC,IAGtD,MAAM1/C,EAAoC,CAAA,EAC1C,IAAA,MAAYC,EAAKR,KAAUS,OAAOC,QAAQJ,GAAkC,CAC1E,MAAMK,EAAWH,EAAII,cACf8Q,EAAcuuC,EAAgBp/C,KAAKq/C,GAASv/C,EAASo3B,SAASmoB,EAAMt/C,gBAGxEL,EAASC,GADPkR,EACc,aACU,iBAAV1R,GAAgC,OAAVA,EACtBggD,GAAsBhgD,EAAOigD,GAE7BjgD,CAEpB,CAEA,OAAOO,CACT,CA4JO,SAAS4/C,GACd75C,EAAqC,IAErC,MAAMuD,EAAS,IAAK21C,MAAoBl5C,GACxC,IAAI85C,EAAqC,KACrCC,EAA+D,KAC/DC,EAA+D,KAC/DC,EAAuF,KAG3F,MAAMC,MAAiBl2C,IAQvB,MAAO,CACLvL,KAAM,sBACN,OAAA6gC,CAAQD,GACN,GAAK91B,EAAO63B,SAA6B,oBAAXvjC,cAKF,IAAjBA,OAAOy5B,QAChBwoB,EAAgBjiD,OAAOy5B,MACvBz5B,OAAOy5B,MAAQhD,eAAevkB,EAA0BykB,GACtD,MAAMnlB,EAAuB,iBAAVU,EAAqBA,EAAQA,aAAiBowC,IAAMpwC,EAAMjE,KAAOiE,EAAMV,IAEpF0C,GAAS,MAAAyiB,OAAA,EAAAA,EAAMziB,UAA4B,iBAAVhC,GAAwBA,aAAiBowC,OAAQ,WAAYpwC,QAAuB,EAAfA,EAAMgC,SAAuB,MAGzI,IAAKytC,GAAgBnwC,EAAK9F,EAAO62C,WAC/B,OAAON,EAAetyC,KAAK/D,KAAMsG,EAAOykB,GAG1C,MAAM6rB,EAAY,GAAGp1C,KAAKC,SAASxI,KAAKyI,SAASC,SAAS,IAAInK,UAAU,EAAG,KACrE2Q,EAAY3G,KAAKC,MACjB6pB,EAAkC,CAAA,EAwBxC,IAAIurB,EACJ,GAtBqB,iBAAVvwC,KAAwBA,aAAiBowC,MAAQ,YAAapwC,GAASA,EAAMglB,mBAAmBC,SACzGjlB,EAAMglB,QAAQrqB,QAAQ,CAAChL,EAAOQ,KAC5B60B,EAAQ70B,GAAOR,WAGf80B,WAAMO,WACJP,EAAKO,mBAAmBC,QAC1BR,EAAKO,QAAQrqB,QAAQ,CAAChL,EAAOQ,KAC3B60B,EAAQ70B,GAAOR,IAERwB,MAAMC,QAAQqzB,EAAKO,SAC5BP,EAAKO,QAAQrqB,QAAQ,EAAExK,EAAKR,MAC1Bq1B,EAAQ70B,GAAOR,IAGjBS,OAAO4+C,OAAOhqB,EAASP,EAAKO,UAO5BxrB,EAAO41C,kBAAmB,CAE5B,MAAMoB,GAAa,MAAA/rB,OAAA,EAAAA,EAAM6B,QAA0B,iBAAVtmB,GAAwBA,aAAiBowC,OAAQ,SAAUpwC,GAAqB,KAAbA,EAAMsmB,MAElH,GADAiqB,QA3NZhsB,eACE+B,EACA8E,EACAqlB,GAEA,GAAKnqB,GAASmqB,EAId,IACE,GAAoB,iBAATnqB,EACT,OAAIA,EAAKv1B,OAASq6B,EACT9E,EAAKp1B,UAAU,EAAGk6B,GAAW,iBAE/B9E,EAGT,GAAIA,aAAgBO,SAAU,CAC5B,MAAMD,EAAoC,CAAA,EAC1C,IAAA,MAAYz2B,EAAKR,KAAU22B,EAAKj2B,UAC1BV,aAAiB+gD,KACnB9pB,EAASz2B,GAAO,UAAUR,EAAMjB,SAASiB,EAAMkhB,cAE/C+V,EAASz2B,GAAOR,EAGpB,OAAOi3B,CACT,CAEA,GAAIN,aAAgBqqB,gBAClB,OAAOvgD,OAAOwgD,YAAYtqB,EAAKj2B,WAGjC,GAAIi2B,aAAgBK,KAAM,CACxB,GAAIL,EAAKzV,KAAOua,EACd,MAAO,UAAU9E,EAAKzV,qBAAqByV,EAAKz3B,QAGlD,IACE,aAAay3B,EAAKvnB,MACpB,CAAA,MACE,MAAO,UAAUunB,EAAKzV,qBAAqByV,EAAKz3B,OAClD,CACF,CAEA,OAAIy3B,aAAgBG,YACdH,EAAKuqB,WAAazlB,EACb,iBAAiB9E,EAAKuqB,qBAExB,IAAIz4B,aAAcC,OAAOiO,GAI3B,yBACT,OAAS1rB,GAEP,OADAC,QAAQywB,KAAK,mDAAoD1wB,GAC1D,sBACT,CACF,CAiKgCk2C,CAAgBN,EAAYh3C,EAAO+1C,mBAAoB/1C,EAAO41C,mBAC9E51C,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,QAAqB,IAAhBw/C,EAEjE,GAA2B,iBAAhBA,EACT,IAEEA,EAAcZ,GADCxtC,KAAK6hB,MAAMusB,GACkB/2C,EAAOo2C,gBACrD,CAAA,MAEEW,EAAcZ,GAAsBY,EAAa/2C,EAAOo2C,gBAC1D,MAEAW,EAAcZ,GAAsBY,EAAa/2C,EAAOo2C,gBAG9D,CAGAO,EAAWt2C,IAAIy2C,EAAW,CACxBhxC,MACA0C,SACAgjB,UACAnjB,YACA0uC,gBAIF,MAAMQ,EAA4B,CAChCliD,KAAM,SACNH,KAAM,SACNyQ,UAAW,cACXE,UAAWwC,EACXvC,IAAKzD,IACLO,MAAOF,IACPkD,WAAY,CACVE,IAAKA,EAAId,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCyD,QAAS3C,EACT0C,SACAgjB,QAASxrB,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,EAC/D4+C,GAAsB3qB,EAASxrB,EAAOo2C,iBACtC5qB,EACJsB,KAAMiqB,EACNlxC,UAAWwC,IAGfytB,EAAgBpI,KAAK6pB,GAErB,IAEE,MAAM7qB,QAAiB6pB,EAAetyC,KAAK/D,KAAMsG,EAAOykB,GAClD8N,EAAUr3B,KAAKC,MACf2G,EAAWywB,EAAU1wB,EACrBmvC,EAAa9qB,EAAS/R,OACtBoY,EAAUrG,EAASC,GAGzB,GAAI3sB,EAAOg2C,oBAAsBjjB,EAE/B,OADA4jB,EAAW71C,OAAOg2C,GACXpqB,EAIT,IAAI+qB,EACAz3C,EAAO61C,qBACT4B,QA5Nd1sB,eACE2B,EACAkF,EACAqlB,GAEA,GAAKA,EAIL,IACE,KAAIvqB,aAAoBgrB,UA4CjB,CAEL,MAAMrsB,EAAMqB,EACNJ,EAAejB,EAAIiB,cAAgB,GACzC,GAAIA,EAAa/0B,OAASq6B,EACxB,OAAOtF,EAAa50B,UAAU,EAAGk6B,GAAW,iBAG9C,IAAI3D,EAAc,GAClB,IACEA,EAAc5C,EAAIssB,kBAAkB,iBAAmB,EACzD,CAAA,MAEA,CAEA,GAAI1pB,EAAYC,SAAS,oBACvB,IACE,OAAOvlB,KAAK6hB,MAAM8B,EACpB,CAAA,MACE,OAAOA,CACT,CAGF,OAAOA,CACT,CApEkC,CAEhC,MAAMsrB,EAAgBlrB,EAASlB,QAAQrrB,IAAI,kBAC3C,GAAIy3C,GAAiBC,SAASD,EAAe,IAAMhmB,EACjD,MAAO,wBAAwBgmB,WAKjC,IAAIE,EACJ,IACEA,EAAiBprB,EAASa,OAC5B,OAASnsB,GAEP,MAAO,kCACT,CAEA,MAAM6sB,EAAcvB,EAASlB,QAAQrrB,IAAI,iBAAmB,GAE5D,GAAI8tB,EAAYC,SAAS,oBAAqB,CAC5C,MAAM3oB,QAAauyC,EAAevyC,OAClC,GAAIA,EAAKhO,OAASq6B,EAChB,OAAOrsB,EAAK7N,UAAU,EAAGk6B,GAAW,iBAEtC,IACE,OAAOjpB,KAAK6hB,MAAMjlB,EACpB,CAAA,MACE,OAAOA,CACT,CACF,KAAA,IAAW0oB,EAAYC,SAAS,SAAU,CACxC,MAAM3oB,QAAauyC,EAAevyC,OAClC,OAAIA,EAAKhO,OAASq6B,EACTrsB,EAAK7N,UAAU,EAAGk6B,GAAW,iBAE/BrsB,CACT,CAEE,IAEE,MAAO,IAAI0oB,GAAe,qBADP6pB,EAAe5qB,QACW7V,aAC/C,CAAA,MACE,MAAO,IAAI4W,GAAe,4BAC5B,CACF,CACF,CAyBF,OAAS7sB,GAEP,OADAC,QAAQywB,KAAK,oDAAqD1wB,GAC3D,0BACT,CACF,CAyImC22C,CAAiBrrB,EAAU1sB,EAAO81C,oBAAqB91C,EAAO61C,oBAC/E71C,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,QAAsB,IAAjBkgD,IAEjEA,EAAetB,GAAsBsB,EAAcz3C,EAAOo2C,mBAK9D,MAAMwB,EAAgBlrB,EAASlB,QAAQrrB,IAAI,kBACrC63C,EAAeJ,EAAgBC,SAASD,EAAe,SAAM,EAG7DK,EAA6B,CACjC5iD,KAAM,SACNH,KAAM,SACNyQ,UAAW,eACXE,UAAWkzB,EACXjzB,IAAKzD,IACLO,MAAOF,IACPkD,WAAY,CACVE,IAAKA,EAAId,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCyD,QAAS3C,EACT0C,SACAgvC,aACAlvC,WACA0vC,eACAjlB,UACAjG,KAAM2qB,EACN5xC,UAAWkzB,IAMf,OAHAjD,EAAgBpI,KAAKuqB,GAErBtB,EAAW71C,OAAOg2C,GACXpqB,CACT,OAAStrB,GACP,MAAM23B,EAAUr3B,KAAKC,MACf2G,EAAWywB,EAAU1wB,EAGrB6vC,EAAkC,CACtC7iD,KAAM,SACNH,KAAM,SACNyQ,UAAW,eACXE,UAAWkzB,EACXjzB,IAAKzD,IACLO,MAAOF,IACPkD,WAAY,CACVE,IAAKA,EAAId,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCyD,QAAS3C,EACT0C,SACAgvC,WAAY,EACZlvC,WACAyqB,SAAS,EACT3xB,MAAOA,aAAiBye,MAAQze,EAAM0G,QAAU/O,OAAOqI,GACvDyE,UAAWkzB,IAMf,MAHAjD,EAAgBpI,KAAKwqB,GAErBvB,EAAW71C,OAAOg2C,GACZ11C,CACR,CACF,GAI4B,oBAAnBkqB,gBAAgC,CACzCkrB,EAAkBlrB,eAAevnB,UAAUwnB,KAC3CkrB,EAAkBnrB,eAAevnB,UAAU2pB,KAC3CgpB,EAA8BprB,eAAevnB,UAAU2nB,iBAEvD,MAAMysB,MAAiBC,QACjBC,MAAqBD,QAO3B9sB,eAAevnB,UAAUwnB,KAAO,SAC9B/iB,EACA1C,EACAilB,EACAutB,EACAC,GAEA,MAAMC,EAA2B,iBAAR1yC,EAAmBA,EAAMA,EAAIvD,KAQtD,OAPA81C,EAAeh4C,IAAIH,KAAM,CACvB4F,IAAK0yC,EACLhwC,OAAQA,EAAOiwC,cACfpwC,UAAW3G,KAAKC,QAElBw2C,EAAW93C,IAAIH,KAAM,IAEds2C,EAAiBvyC,KAAK/D,KAAMsI,EAAQ1C,OAAe,IAAVilB,GAAsBA,EAAcutB,EAAUC,EAChG,EAEAjtB,eAAevnB,UAAU2nB,iBAAmB,SAASx2B,EAAciB,GACjE,MAAMq1B,EAAU2sB,EAAWh4C,IAAID,OAAS,CAAA,EAGxC,OAFAsrB,EAAQt2B,GAAQiB,EAChBgiD,EAAW93C,IAAIH,KAAMsrB,GACdkrB,EAA6BzyC,KAAK/D,KAAMhL,EAAMiB,EACvD,EAEAm1B,eAAevnB,UAAU2pB,KAAO,SAASZ,GACvC,MAAM4rB,EAAcL,EAAel4C,IAAID,MACvC,IAAKw4C,EACH,OAAOjC,EAAiBxyC,KAAK/D,KAAM4sB,GAGrC,MAAMhnB,IAAEA,EAAA0C,OAAKA,EAAAH,UAAQA,GAAcqwC,EAC7BltB,EAAU2sB,EAAWh4C,IAAID,OAAS,CAAA,EAGxC,IAAK+1C,GAAgBnwC,EAAK9F,EAAO62C,WAC/B,OAAOJ,EAAiBxyC,KAAK/D,KAAM4sB,GAIrC,IAAIiqB,EACJ,GAAI/2C,EAAO41C,mBAAqB9oB,EAAM,CACpC,GAAoB,iBAATA,EACTiqB,EAAcjqB,EAAKv1B,OAASyI,EAAO+1C,mBAC/BjpB,EAAKp1B,UAAU,EAAGsI,EAAO+1C,oBAAsB,iBAC/CjpB,OACN,GAAWA,aAAgBO,SAAU,CACnC,MAAMD,EAAoC,CAAA,EAC1C,IAAA,MAAYz2B,EAAKR,KAAU22B,EAAKj2B,UAC1BV,aAAiB+gD,KACnB9pB,EAASz2B,GAAO,UAAUR,EAAMjB,SAASiB,EAAMkhB,cAE/C+V,EAASz2B,GAAOR,EAGpB4gD,EAAc3pB,CAChB,MACE2pB,EADSjqB,aAAgBK,KACXL,EAAKzV,KAAOrX,EAAO+1C,mBAC7B,UAAUjpB,EAAKzV,qBAAqByV,EAAKz3B,QACzC,SAEU,0BAGZ2K,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,IAC5Dw/C,EAAcZ,GAAsBY,EAAa/2C,EAAOo2C,iBAE5D,CAEAsC,EAAY3B,YAAcA,EAG1B,MAAMQ,EAA4B,CAChCliD,KAAM,SACNH,KAAM,SACNyQ,UAAW,cACXE,UAAWwC,EACXvC,IAAKzD,IACLO,MAAOF,IACPkD,WAAY,CACVE,IAAKA,EAAId,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCyD,QAAS3C,EACT0C,SACAgjB,QAASxrB,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,EAC/D4+C,GAAsB3qB,EAASxrB,EAAOo2C,iBACtC5qB,EACJsB,KAAMiqB,EACNlxC,UAAWwC,IAGfytB,EAAgBpI,KAAK6pB,GAGrB,MAAMoB,EAA0B,KAC9B,GAAIz4C,KAAK+tC,aAAe3iB,eAAestB,KAAM,CAC3C,MAAM7f,EAAUr3B,KAAKC,MACf2G,EAAWywB,EAAU1wB,EACrBmvC,EAAat3C,KAAKya,OAElBoY,EAAUykB,GAAc,KAAOA,EAAa,IAGlD,GAAIx3C,EAAOg2C,oBAAsBjjB,EAI/B,OAHA7yB,KAAKohC,oBAAoB,mBAAoBqX,GAC7CN,EAAev3C,OAAOZ,WACtBi4C,EAAWr3C,OAAOZ,MAKpB,IAAIosB,EAAe,GACnB,IACEA,EAAepsB,KAAKosB,cAAgB,EACtC,OAASlrB,GAEPC,QAAQywB,KAAK,uDAAwD1wB,EACvE,CAEA,MAAM42C,EAAe1rB,EAAa/0B,OAClC,IAAIkgD,EAEJ,GAAIz3C,EAAO61C,mBAAoB,CAC7B,GAAIvpB,EAAa/0B,OAASyI,EAAO81C,oBAC/B2B,EAAenrB,EAAa50B,UAAU,EAAGsI,EAAO81C,qBAAuB,qBAClE,CACL,IAAI7nB,EAAc,GAClB,IACEA,EAAc/tB,KAAKy3C,kBAAkB,iBAAmB,EAC1D,CAAA,MAEA,CACA,GAAI1pB,EAAYC,SAAS,oBACvB,IACEupB,EAAe9uC,KAAK6hB,MAAM8B,EAC5B,CAAA,MACEmrB,EAAenrB,CACjB,MAEAmrB,EAAenrB,CAEnB,CACItsB,EAAOo2C,iBAAmBp2C,EAAOo2C,gBAAgB7+C,OAAS,IAC5DkgD,EAAetB,GAAsBsB,EAAcz3C,EAAOo2C,iBAE9D,CAGA,MAAM6B,EAA6B,CACjC5iD,KAAM,SACNH,KAAM,SACNyQ,UAAW,eACXE,UAAWkzB,EACXjzB,IAAKzD,IACLO,MAAOF,IACPkD,WAAY,CACVE,IAAKA,EAAId,MAAM,KAAK,GAAGA,MAAM,KAAK,GAClCyD,QAAS3C,EACT0C,SACAgvC,aACAlvC,WACA0vC,eACAjlB,UACAjG,KAAM2qB,EACN5xC,UAAWkzB,IAGfjD,EAAgBpI,KAAKuqB,GAGrB/3C,KAAKohC,oBAAoB,mBAAoBqX,GAC7CN,EAAev3C,OAAOZ,MACtBi4C,EAAWr3C,OAAOZ,KACpB,GAIF,OAFAA,KAAK0rB,iBAAiB,mBAAoB+sB,GAEnClC,EAAiBxyC,KAAK/D,KAAM4sB,EACrC,CACF,CACF,EACA,SAAAkJ,GACwB,oBAAX1hC,SAKPiiD,IACFjiD,OAAOy5B,MAAQwoB,EACfA,EAAgB,MAIdC,GAAmBC,GAAmBC,IACxCprB,eAAevnB,UAAUwnB,KAAOirB,EAChClrB,eAAevnB,UAAU2pB,KAAO+oB,EAChCnrB,eAAevnB,UAAU2nB,iBAAmBgrB,EAC5CF,EAAkB,KAClBC,EAAkB,KAClBC,EAA8B,MAIhCC,EAAWn1C,QACb,EAEJ,CAKO,MAAMq3C,GAA2BvC,yDC1nBjC,MAoDL,WAAAz4C,CACEuE,EACA9C,EACAD,EACA5C,EAAqC,CAAA,uBAvD/BwD,EAAAC,KAAA,SAAyB,IACzBD,EAAAC,KAAA,aACAD,EAAAC,KAAA,UACAD,EAAAC,KAAA,YACAD,EAAAC,KAAA,aACAD,EAAAC,KAAA,aACAD,EAAAC,KAAA,cACAD,EAAAC,KAAA,kBACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,qBAGAD,EAAAC,KAAA,sBAA2CO,KAC3CR,EAAAC,KAAA,YAAoB,GACpBD,EAAAC,KAAA,qBAA6B,GAC7BD,EAAAC,KAAA,eAMJ,CACFw2B,UAAW,GACXoiB,OAAQ,GACRC,OAAQ,GACRC,OAAQ,GACRC,aAAc,KAIRh5C,EAAAC,KAAA,gBAA0C,MAC1CD,EAAAC,KAAA,iBAAyB,GACzBD,EAAAC,KAAA,WAAmB,KAGnBD,EAAAC,KAAA,aAA6B,IAC7BD,EAAAC,KAAA,gBAAwB,GACxBD,EAAAC,KAAA,eAAuB,KAGvBD,EAAAC,KAAA,qBAGJ,CACFg5C,cAAe,GACfC,uBAAwB,KAIlBl5C,EAAAC,KAAA,yBAAiC,GAQvCA,KAAKkC,UAAYA,EACjBlC,KAAKZ,SAAWA,EAChBY,KAAKb,OAASA,EACda,KAAKmI,UAAY3G,KAAKC,MACtBzB,KAAKk5C,UAAY38C,EAAQ28C,WAAa,IACtCl5C,KAAKlB,WAAavC,EAAQuC,YAAc,EACxCkB,KAAKm5C,eAAiB58C,EAAQ48C,iBAAkB,EAGhDn5C,KAAKo5C,gBAAkB,CACrBt3B,MAAM,OAAAhtB,EAAAyH,EAAQ68C,sBAAR,EAAAtkD,EAAyBgtB,OAAQ,WACvCu3B,iBAAiB,OAAAnkD,EAAAqH,EAAQ68C,sBAAR,EAAAlkD,EAAyBmkD,mBAAmB,EAC7DC,cAAc,OAAAlkD,EAAAmH,EAAQ68C,sBAAR,EAAAhkD,EAAyBkkD,gBAAgB,EACvDC,iBAAiB,OAAAjkD,EAAAiH,EAAQ68C,sBAAR,EAAA9jD,EAAyBikD,kBAAmBv5C,KAAKlB,WAClEo6C,WAAW,OAAA7jD,EAAAkH,EAAQ68C,sBAAR,EAAA/jD,EAAyB6jD,YAAal5C,KAAKk5C,UACtDM,6BAA6B,OAAA/jD,EAAA8G,EAAQ68C,sBAAR,EAAA3jD,EAAyB+jD,+BAA+B,GAIvFx5C,KAAKy5C,kBAAoB,CACvBC,iBAAiB,OAAAlkD,EAAA+G,EAAQk9C,wBAAR,EAAAjkD,EAA2BkkD,kBAAmB,EAC/DC,0BAA0B,OAAAC,EAAAr9C,EAAQk9C,wBAAR,EAAAG,EAA2BD,2BAA4B,GAErF,CAMA,aAAAE,CAAcv8C,GAEP0C,KAAKo5C,gBAAgBC,iBAMtBr5C,KAAKy0B,WAAWp9B,QAAU2I,KAAK85C,cAEjC95C,KAAKy0B,WAAWlX,QAElBvd,KAAKy0B,WAAWp7B,KAAKiE,GAGhB0C,KAAKg1B,cACRh1B,KAAK+5C,qBAbL/5C,KAAKg6C,iBAAiB18C,EAe1B,CAMA,QAAA28C,CAAS38C,GACP,MAAMN,EAAQoJ,YAAY3E,MAE1B,IAEE,GAAIzB,KAAKk6C,yBAAyB58C,GAChC,OAIF0C,KAAKg6C,iBAAiB18C,EACxB,CAAA,QACE,MAAM8K,EAAWhC,YAAY3E,MAAQzE,EACrCgD,KAAKm6C,kBAAkB,WAAY/xC,GAG/BA,EAAWpI,KAAKy5C,kBAAkBC,iBACpC15C,KAAKo6C,uBAET,CACF,CAKQ,gBAAAJ,CAAiB18C,GAOvB,GALI0C,KAAKU,OAAOrJ,QAAU2I,KAAKk5C,WAC7Bl5C,KAAKq6C,mBAIHr6C,KAAKm5C,gBAAkBlgD,KAAKyI,SAAW1B,KAAKlB,YAE3B,UAAfxB,EAAMnI,MAAmC,WAAfmI,EAAMnI,KAClC,OAKJ,MAAMmlD,EAAiC,CACrCnlD,KAAMmI,EAAMnI,KACZH,KAAMsI,EAAMtI,KACZ2Q,UAAWrI,EAAMqI,UACjBC,IAAKtI,EAAMsI,IACXlD,MAAOpF,EAAMoF,MACbR,UAAWlC,KAAKkC,UAChB9C,SAAUY,KAAKZ,SACfD,OAAQa,KAAKb,QAAU7B,EAAM6B,OAC7BuG,WAAY1F,KAAKu6C,mBAAmBj9C,EAAMoI,eAEvB,WAAfpI,EAAMnI,MAAqB,cAAemI,EAC1C,CAAEmI,UAAWnI,EAAMmI,WACnB,CAAA,GAIAxO,EAAQ+I,KAAKU,OAAOrJ,OAC1B2I,KAAKU,OAAOrH,KAAKihD,GAGjBt6C,KAAKw6C,cAAcl9C,EAAMnI,KAAM8B,GAG/B+I,KAAKy6C,gBAAgBt6C,IACnB7C,EAAMnI,MACL6K,KAAKy6C,gBAAgBx6C,IAAI3C,EAAMnI,OAAS,GAAK,GAI5CmI,EAAMqI,UAAY3F,KAAK06C,qBACzB16C,KAAK26C,UAAW,GAElB36C,KAAK06C,mBAAqBp9C,EAAMqI,UAGhC3F,KAAK46C,cAAgB,IACvB,CAKQ,iBAAAb,GACyB,IAA3B/5C,KAAKy0B,WAAWp9B,QAKpB2I,KAAKg1B,cAAe,EAGE,oBAAX5gC,QAA0B,wBAAyBA,OAC5D6xC,oBACE,KACEjmC,KAAKmqB,eACLnqB,KAAK+5C,qBAEP,CAAEj3C,QAAS,MAGbE,WAAW,KACThD,KAAKmqB,eACLnqB,KAAK+5C,qBACJ,IAnBH/5C,KAAKg1B,cAAe,CAqBxB,CAKQ,YAAA7K,GAGQnqB,KAAKy0B,WAAW3zB,OAAO,EADnB,IAGZG,QAAQ3D,IACZ0C,KAAKg6C,iBAAiB18C,IAE1B,CAKQ,wBAAA48C,CAAyB58C,GAC/B,QAAK0C,KAAK66C,wBAKS,UAAfv9C,EAAMnI,MAAmC,WAAfmI,EAAMnI,MAK7B8D,KAAKyI,SAAW,GACzB,CAKQ,qBAAA04C,GACDp6C,KAAK66C,wBACR15C,QAAQywB,KAAK,wEACb5xB,KAAK66C,uBAAwB,EAG7B76C,KAAKlB,WAAa7F,KAAKkQ,IAAI,GAAuB,GAAlBnJ,KAAKlB,YAGrCkB,KAAKk5C,UAAYjgD,KAAKoO,MAAuB,GAAjBrH,KAAKk5C,WAGjCl5C,KAAKq6C,mBAET,CAKQ,kBAAAE,CACN70C,GAEA,IAAKA,EAAY,OAEjB,MAAM8sB,EAAqC,CAAA,EAC3C,IAAA,MAAY/7B,EAAKR,KAAUS,OAAOC,QAAQ+O,GAAa,CACrD,MAAM6B,EAAWkB,KAAKC,UAAUzS,GAC5BsR,EAASlQ,OAAS,IAEpBm7B,EAAU/7B,GAAO8Q,EAAS/P,UAAU,EAAG,KAAQ,MAE/Cg7B,EAAU/7B,GAAOR,CAErB,CACA,OAAOS,OAAO6C,KAAKi5B,GAAWn7B,OAAS,EAAIm7B,OAAY,CACzD,CAKQ,aAAAgoB,CAAcM,EAAmB7jD,GACvC,OAAQ6jD,GACN,IAAK,WACH96C,KAAK+6C,aAAavkB,UAAUn9B,KAAKpC,GACjC,MACF,IAAK,QACH+I,KAAK+6C,aAAanC,OAAOv/C,KAAKpC,GAC9B,MACF,IAAK,QACH+I,KAAK+6C,aAAalC,OAAOx/C,KAAKpC,GAC9B,MACF,IAAK,QACH+I,KAAK+6C,aAAajC,OAAOz/C,KAAKpC,GAC9B,MACF,IAAK,SACH+I,KAAK+6C,aAAahC,aAAa1/C,KAAKpC,GAG1C,CAKQ,gBAAAojD,GAEN,MAAMW,EAAY/hD,KAAKoO,MAAMrH,KAAKk5C,UAAY,GACxC+B,EAAej7C,KAAKU,OAAOrJ,OAAS2jD,EAG1Ch7C,KAAKU,OAASV,KAAKU,OAAOlH,OAAOwhD,GAGjCh7C,KAAKk7C,iBAGLl7C,KAAKm7C,oBAEDn7C,KAAKo5C,gBAAgBI,6BACvBr4C,QAAQywB,KACN,kCAAkCqpB,eAGxC,CAKQ,cAAAC,GACNl7C,KAAK+6C,aAAe,CAClBvkB,UAAW,GACXoiB,OAAQ,GACRC,OAAQ,GACRC,OAAQ,GACRC,aAAc,IAGhB/4C,KAAKU,OAAOO,QAAQ,CAAC3D,EAAOrG,KAC1B+I,KAAKw6C,cAAcl9C,EAAMnI,KAAM8B,IAEnC,CAKQ,iBAAAkkD,GACNn7C,KAAKy6C,gBAAgBn5C,QACrBtB,KAAKU,OAAOO,QAAQ3D,IAClB0C,KAAKy6C,gBAAgBt6C,IACnB7C,EAAMnI,MACL6K,KAAKy6C,gBAAgBx6C,IAAI3C,EAAMnI,OAAS,GAAK,IAGpD,CAKA,WAAAimD,GAOE,OALKp7C,KAAK26C,WACR36C,KAAKU,OAAO+jC,KAAK,CAACnK,EAAGtjB,IAAMsjB,EAAE30B,UAAYqR,EAAErR,WAC3C3F,KAAK26C,UAAW,EAChB36C,KAAKk7C,kBAEAl7C,KAAKU,MACd,CAKA,WAAAy2B,GACE,GAA2B,IAAvBn3B,KAAKU,OAAOrJ,OAAc,OAAO,EACrC,MAAMgkD,EAAWr7C,KAAKo7C,cAEtB,OADkBC,EAASA,EAAShkD,OAAS,GAC5BsO,UAAY3F,KAAKmI,SACpC,CAKA,eAAAmzC,CAAgBnmD,GACd,MAAMomD,EAAUv7C,KAAKw7C,iBAAiBrmD,GAChCkmD,EAAWr7C,KAAKo7C,cAEtB,OAAOG,EACJ39C,OAAO3G,GAASA,GAAS,GAAKA,EAAQokD,EAAShkD,QAC/CqM,OAAa23C,EAASpkD,IACtB2G,OAAOikC,QACZ,CAKQ,gBAAA2Z,CAAiBrmD,GACvB,OAAQA,GACN,IAAK,WACH,OAAO6K,KAAK+6C,aAAavkB,UAC3B,IAAK,QACH,OAAOx2B,KAAK+6C,aAAanC,OAC3B,IAAK,QACH,OAAO54C,KAAK+6C,aAAalC,OAC3B,IAAK,QACH,OAAO74C,KAAK+6C,aAAajC,OAC3B,IAAK,SACH,OAAO94C,KAAK+6C,aAAahC,aAC3B,QACE,MAAO,GAEb,CAKA,eAAA0C,GAEE,MAAMh6C,EAAMD,KAAKC,MACjB,GACEzB,KAAK46C,eACLn5C,EAAMzB,KAAK07C,eAAiB17C,KAAK27C,SAEjC,OAAO37C,KAAK46C,cAGd,MAAMS,EAAWr7C,KAAKo7C,cAGhBQ,EAAsBL,GACnBA,EACJ39C,OAAO3G,GAASA,GAAS,GAAKA,EAAQokD,EAAShkD,QAC/CqM,OAAa23C,EAASpkD,IACtB2G,OAAOikC,SAGNga,EAA6B,CACjC35C,UAAWlC,KAAKkC,UAChB/C,OAAQa,KAAKb,OACbC,SAAUY,KAAKZ,SACf+I,UAAWnI,KAAKmI,UAChBC,SAAUpI,KAAKm3B,cACf2kB,YAAaT,EAAShkD,OACtB0kD,WAAYrlD,OAAOwgD,YAAYl3C,KAAKy6C,iBACpCjkB,UAAWolB,EAAmB57C,KAAK+6C,aAAavkB,WAChDoiB,OAAQgD,EAAmB57C,KAAK+6C,aAAanC,QAC7CC,OAAQ+C,EAAmB57C,KAAK+6C,aAAalC,QAC7CC,OAAQ8C,EAAmB57C,KAAK+6C,aAAajC,QAC7CC,aAAc6C,EAAmB57C,KAAK+6C,aAAahC,cACnDiD,YAAah8C,KAAKi8C,0BAA0BZ,GAC5Ca,gBAAiBl8C,KAAKm8C,kCAAkCd,IAO1D,OAHAr7C,KAAK46C,cAAgBiB,EACrB77C,KAAK07C,eAAiBj6C,EAEfo6C,CACT,CAKA,oBAAAO,GACE,OAAO,IAAIpxB,QAAQC,IAGG,oBAAX72B,QACP,wBAAyBA,OAEzB6xC,oBACE,KACE,MAAMjpC,EAAQoJ,YAAY3E,MACpBo6C,EAAU77C,KAAKy7C,kBACfrzC,EAAWhC,YAAY3E,MAAQzE,EACrCgD,KAAKm6C,kBAAkB,oBAAqB/xC,GAC5C6iB,EAAQ4wB,IAEV,CAAE/4C,QAAS,MAIbE,WAAW,KACT,MAAMhG,EAAQoJ,YAAY3E,MACpBo6C,EAAU77C,KAAKy7C,kBACfrzC,EAAWhC,YAAY3E,MAAQzE,EACrCgD,KAAKm6C,kBAAkB,oBAAqB/xC,GAC5C6iB,EAAQ4wB,IACP,IAGT,CAKA,0BAAAQ,GACE,MAAMhB,EAAWr7C,KAAKo7C,cAEtB,MAAO,CACLl5C,UAAWlC,KAAKkC,UAChB/C,OAAQa,KAAKb,OACbC,SAAUY,KAAKZ,SACf+I,UAAWnI,KAAKmI,UAChBC,SAAUpI,KAAKm3B,cACf2kB,YAAaT,EAAShkD,OACtB0kD,WAAYrlD,OAAOwgD,YAAYl3C,KAAKy6C,iBACpCyB,gBAAiBl8C,KAAKm8C,kCAAkCd,GAE5D,CAKQ,yBAAAY,CACNv7C,GAEA,MAAM47C,EAA6B,GACnC,IAAIC,EAAgBv8C,KAAKmI,UAEzB,IAAA,IAAS/O,EAAI,EAAGA,EAAIsH,EAAOrJ,OAAQ+B,IAAK,CACtC,MAAMkE,EAAQoD,EAAOtH,GACrBkjD,EAAQjjD,KAAK,CACXmjD,KAAMpjD,EAAI,EACVuM,UAAWrI,EAAMqI,UACjBxQ,KAAMmI,EAAMnI,KACZyQ,IAAKtI,EAAMsI,IACXlD,MAAOpF,EAAMoF,MACb+5C,OAAQz8C,KAAK08C,cAAcp/C,GAC3B8K,SAAU9K,EAAMqI,UAAY42C,IAE9BA,EAAgBj/C,EAAMqI,SACxB,CAEA,OAAO22C,CACT,CAKQ,aAAAI,CAAcp/C,WACpB,OAAQA,EAAMnI,MACZ,IAAK,WACH,MAAO,SAASmI,EAAMoF,OAASpF,EAAMsI,MACvC,IAAK,QACH,CACE,MAAM2/B,EAAajoC,EACnB,MAAO,QACL,OAAAxI,EAAAywC,EAAWC,sBAAangC,OACxBkgC,EAAWt+B,aACX,QAEJ,CACF,IAAK,QACH,CACE,MAAMikC,EAAa5tC,EACnB,MAAO,QACL,OAAApI,EAAAg2C,EAAW1F,sBAAaxwC,OACxBk2C,EAAWjkC,aACX,QAEJ,CACF,IAAK,QAGD,MAAO,OADY3J,EACMsK,UAE7B,IAAK,SAGD,MAAO,UADatK,EACSmI,YAEjC,QACE,MAAO,GAAGnI,EAAMnI,UAEtB,CAKQ,iCAAAgnD,CACNz7C,GAIA,MAAMi8C,EAAkB38C,KAAK+6C,aAAavkB,UAAU54B,OAClDxE,GAAKA,GAAK,GAAKA,EAAIsH,EAAOrJ,QAEtBm/B,EAAYmmB,EAAgBj5C,IAChCtK,GAAKsH,EAAOtH,IAGd,IAAIw9B,EAAgB,EACpB,MAAMgmB,MAAkBriD,IAExB,IAAA,MAAWu8B,KAAMN,EACXM,EAAG1uB,WACLwuB,GAAiBE,EAAG1uB,UAEtBw0C,EAAY7jD,IAAI+9B,EAAGlxB,KAGrB,MAAO,CACLkxB,GAAI6lB,EAAgBtlD,OACpBwlD,gBACEF,EAAgBtlD,OAAS,EACrBu/B,EAAgB+lB,EAAgBtlD,OAChC,EACNylD,WAAY98C,KAAK+6C,aAAanC,OAAOvhD,OACrC0lD,WAAY/8C,KAAK+6C,aAAalC,OAAOxhD,OACrC2lD,WAAYh9C,KAAK+6C,aAAajC,OAAOzhD,OACrCulD,YAAaA,EAAYzlC,KAE7B,CAKQ,iBAAAgjC,CAAkB8C,EAAmB70C,GAC3C,IAAKpI,KAAKo5C,gBAAgBI,4BACxB,OAGF,MAAMtxC,EACJlI,KAAKk9C,mBACH,GAAGD,UAEH/0C,IACFA,EAAQ7O,KAAK+O,GAETF,EAAQ7Q,OAAS,KACnB6Q,EAAQqV,QAGd,CAKA,mBAAA4/B,GACE,MAAMnE,EAAgBh5C,KAAKk9C,mBAAmBlE,cACxCoE,EAAep9C,KAAKk9C,mBAAmBjE,uBAE7C,MAAO,CACLoE,gBACErE,EAAc3hD,OAAS,EACnB2hD,EAAc3e,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAKgiC,EAAc3hD,OACzD,EACNimD,yBACEF,EAAa/lD,OAAS,EAClB+lD,EAAa/iB,OAAO,CAACC,EAAGtjB,IAAMsjB,EAAItjB,EAAG,GAAKomC,EAAa/lD,OACvD,EACNkmD,gBAAiBv9C,KAAKw9C,WAAWxE,EAAe,IAChDyE,yBAA0Bz9C,KAAKw9C,WAAWJ,EAAc,IAE5D,CAKQ,UAAAI,CAAWE,EAAe9nC,GAChC,GAAmB,IAAf8nC,EAAIrmD,OAAc,OAAO,EAC7B,MAAMsmD,EAAS,IAAID,GAAKjZ,KAAK,CAACnK,EAAGtjB,IAAMsjB,EAAItjB,GACrC/f,EAAQgC,KAAK2kD,KAAMhoC,EAAI,IAAO+nC,EAAOtmD,QAAU,EACrD,OAAOsmD,EAAO1kD,KAAKkQ,IAAI,EAAGlS,KAAW,CACvC,CAKA,KAAAmgC,GACEp3B,KAAKU,OAAS,GACdV,KAAKy0B,WAAa,GAClBz0B,KAAKy6C,gBAAgBn5C,QACrBtB,KAAK+6C,aAAe,CAClBvkB,UAAW,GACXoiB,OAAQ,GACRC,OAAQ,GACRC,OAAQ,GACRC,aAAc,IAEhB/4C,KAAK46C,cAAgB,KACrB56C,KAAK26C,UAAW,EAChB36C,KAAK06C,mBAAqB,EAC1B16C,KAAKmI,UAAY3G,KAAKC,MACtBzB,KAAK66C,uBAAwB,CAC/B,2GC9rBF,MAkBE,WAAAl9C,CAAYmC,SAEV,GAnBMC,EAAAC,KAAA,UACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,eACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,oBACAD,EAAAC,KAAA,sBACAD,EAAAC,KAAA,gBACAD,EAAAC,KAAA,iBACAD,EAAAC,KAAA,kBACAD,EAAAC,KAAA,qBACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,mBACAD,EAAAC,KAAA,WAA4B,MAC5BD,EAAAC,KAAA,YACAD,EAAAC,KAAA,cAIDF,EAAOxB,MACV,MAAM,IAAIqhB,MAAM,8BAGlB,MAAMk+B,EAA8B,IAC/B/9C,EACHykC,cAAe,IACTzkC,EAAOH,oBAAsB,CAACrD,EAAwB,CAAEE,SAAU,MAAS,MAC3EsD,EAAOF,sBACP,CACE/B,EAA0B,CACxBE,aAAc+B,EAAOg+C,oBACrBthD,SAAU,MAGd,MACAsD,EAAOykC,eAAiB,MAG3B,OAAAzvC,EAAA+oD,EAAatZ,oBAAb,EAAAzvC,EAA4BuC,gBACxBwmD,EAAatZ,cAGtBvkC,KAAKF,OAAS,IAAID,EAAcg+C,GAChC79C,KAAKZ,SAAWU,EAAOV,UAAYwC,IACnC5B,KAAKkC,UAAYF,IAGjBhC,KAAK+9C,cAAgB,IAAIx4C,EACzBvF,KAAKi1C,cAAgB,IAAIjrB,GAGzB,MAAMzrB,EAAYuB,EAAOvB,WAAa,cCzEnC,IACLhC,EDyEEyD,KAAKk/B,YAAc,IAAI1K,GAAYj2B,EAAW,CAC5CK,UAAWoB,KAAKF,OAAOG,IAAI,aAC3BpB,UAAWmB,KAAKF,OAAOG,IAAI,aAC3BlB,qBAAsBiB,KAAKF,OAAOG,IAAI,0BAA2B,EACjEjB,sBAAuBgB,KAAKF,OAAOG,IAAI,yBACvChB,WAAYe,KAAKF,OAAOG,IAAI,eAAiB,IAI1CH,EAAOvB,WACVyB,KAAKk/B,YAAY7P,aAAa,IAEhCrvB,KAAKg+C,cAAgB,IAAIhoB,GACzBh2B,KAAKk1C,iBAAmB,IAAI5e,GAC5Bt2B,KAAKi+C,mBAAqB,IAAIhjB,GAC9Bj7B,KAAKk+C,aAAe,IAAIzgB,GACxBz9B,KAAKm+C,cAAgB,IAAIjgB,GACzBl+B,KAAKo+C,eAAiB,IAAI1f,GAAsB1+B,KAAKwtB,KAAK6S,KAAKrgC,OAC/DA,KAAKq+C,kBAAoB,IAAIrf,GAAyBh/B,KAAKF,OAAQE,KAAKk/B,aACxEl/B,KAAKs+C,gBAAkB,IAAIlK,GAAuBp0C,KAAKF,QACvDE,KAAK+nC,gBAAkB,IAAIgN,GACzB/0C,KAAKm+C,cACLn+C,KAAKi1C,cACLj1C,KAAKk/B,YACLl/B,KAAKk1C,iBACL,IAAwB,oBAAX9gD,QAA0BkO,KAIzCtC,KAAKg+C,cAAc9nB,mBCpGd,CACL1I,MAHFjxB,EDsGmE,CAC/DixB,KAAMxtB,KAAKwtB,KAAK6S,KAAKrgC,MACrBklC,UAAW,IAAMllC,KAAKF,OAAOI,SAC7Bq+C,QAASv+C,KAAKu+C,QAAQle,KAAKrgC,MAC3Bw+C,QAAS,IAAMx+C,KAAKo+B,WCvGR5Q,KACd0X,UAAW3oC,EAAQ2oC,UACnBqZ,QAAShiD,EAAQgiD,QACjBC,QAASjiD,EAAQiiD,UDwGjBx+C,KAAKk+C,aAAahoB,mBAAmBl2B,MAGrCA,KAAK+qB,OAGL/qB,KAAKo+C,eAAetf,gBACtB,CAKQ,IAAA/T,GAGN/qB,KAAKo+C,eAAezf,QAGpB3+B,KAAKs+C,gBAAgBvzB,OAGjB/qB,KAAKF,OAAOG,IAAI,WAClBD,KAAKu+C,QAAQ,CAAEp/C,OAAQa,KAAKF,OAAOG,IAAI,WAE3C,CAKA,IAAAutB,CAAKlwB,GACH0C,KAAK+nC,gBAAgBjC,SAASxoC,EAAO,CACnC8B,SAAUY,KAAKZ,SACf8C,UAAWlC,KAAKkC,UAChBm8B,aAAcr+B,KAAKF,OAAOG,IAAI,UAC9Bm+B,SAAUp+B,KAAKo+B,SACf/+B,iBAAkBW,KAAKF,OAAOG,IAAI,qBAAuB,CAAA,EACzDnB,WAAYkB,KAAKF,OAAOG,IAAI,cAC5Bf,kBAAmBc,KAAKF,OAAOG,IAAI,uBAAwB,EAC3Do1C,WAAYr1C,KAAKF,OAAOG,IAAI,cAC5Bs1C,UAAWv1C,KAAKF,OAAOG,IAAI,aAC3Bu1C,QAASx1C,KAAKF,OAAOG,IAAI,YAE7B,CAKA,KAAAuF,CAAMC,EAAmBC,GACvB,MAAMpI,EAAQ0C,KAAK+9C,cAAcv4C,MAAMC,EAAWC,GAClD1F,KAAKwtB,KAAKlwB,EACZ,CAKA,OAAAihD,CAAQE,GACNz+C,KAAKo+B,SAAW,IAAKp+B,KAAKo+B,YAAaqgB,GACvCz+C,KAAKF,OAAOK,IAAI,SAAUs+C,EAAKt/C,QAAU,GAC3C,CAKA,OAAAq/C,GACE,OAAOx+C,KAAKo+B,QACd,CAKA,UAAAwP,CAAW1sC,EAAuB2sC,GAChC,MAAMyG,EAAet0C,KAAKs+C,gBAAgB1J,kBAC1C,GAAIN,EAEFA,EAAa1G,WAAW1sC,EAAO2sC,OAC1B,CAEL,MAAMf,EAAyB,CAC7B33C,KAAM,QACNH,KAAM,eACN2Q,UAAWnE,KAAKC,MAChBmE,IAAKzD,IACLO,MAAOF,IACPuqC,UAAW,KACXnlC,QAAS1G,aAAiBye,MAAQze,EAAM0G,QAAU1G,EAClD8rC,MAAO9rC,aAAiBye,MAAQze,EAAM8rC,WAAQ,EAC9CtnC,WAAYmoC,GAEd7tC,KAAKwtB,KAAKsf,EACZ,CACF,CAKA,gBAAA4R,GACE,MAAMnK,EAAqBv0C,KAAKs+C,gBAAgBzJ,wBAChD,GAAIN,EAAoB,CACtB,MAAMj3C,EAAQi3C,EAAmBpE,iBAC7B7yC,GACF0C,KAAKwtB,KAAKlwB,EAEd,CACF,CAKA,aAAA8hC,GACE,MAAMiV,EAAcr0C,KAAKs+C,gBAAgB3J,iBACzC,GAAIN,EAAa,CACf,MAAM/2C,EAAQ+2C,EAAYlI,iBAAiB/M,gBAC3Cp/B,KAAKwtB,KAAKlwB,EACZ,CACF,CAKA,GAAA64B,CAAIT,GACF11B,KAAKg+C,cAAc7nB,IAAIT,EACzB,CAKA,YAAAipB,CAAa7+C,GACXE,KAAKq+C,kBAAkBtgC,MAAMje,EAC/B,CAKA,SAAAolC,GACE,OAAOllC,KAAKF,OAAOI,QACrB,CAKA,oBAAAy9B,GACE39B,KAAKk+C,aAAavgB,sBACpB,CAKA,wBAAAI,GACE/9B,KAAKk+C,aAAangB,0BACpB,CAKA,qBAAA6gB,CAAsBz2C,EAAoB0wB,GACxC,OAAO74B,KAAKi+C,mBAAmBxnB,WAAWtuB,EAAW0wB,EACvD,CAKA,yBAAAgmB,CAA0BtiD,GACxB,OAAOyD,KAAKi+C,mBAAmBhiB,eAAe1/B,EAChD,CAKA,qBAAAuiD,GACE,OAAO9+C,KAAKi+C,kBACd,CAKA,kBAAAc,GACE,OAAO/+C,KAAKk1C,iBAAiBze,YAC/B,CAKA,oBAAAuoB,SACE,OAAO,OAAAlqD,EAAAkL,KAAKs+C,gBAAgBxJ,yBAArB,EAAAhgD,EAAyCk+C,SAClD,CAKA,sBAAM7d,GACJ,OAAOn1B,KAAKk/B,YAAY/J,kBAC1B,CAKA,0BAAMC,GACJ,OAAOp1B,KAAKk/B,YAAY9J,sBAC1B,CAKA,yBAAMC,GACJ,OAAOr1B,KAAKk/B,YAAY7J,qBAC1B,CAMA,cAAAsf,GACE,OAAO30C,KAAKs+C,gBAAgB3J,gBAC9B,CAKA,OAAArf,GACEt1B,KAAKo+C,eAAevf,WACpB7+B,KAAKs+C,gBAAgBhpB,UACrBt1B,KAAKi+C,mBAAmB3oB,UACxBt1B,KAAKk/B,YAAY5J,UACjBt1B,KAAKg+C,cAAc18C,OACrB,CAKA,kBAAMi0B,GACJv1B,KAAKo+C,eAAevf,WACpB7+B,KAAKs+C,gBAAgBhpB,UACrBt1B,KAAKi+C,mBAAmB3oB,gBAClBt1B,KAAKk/B,YAAY3J,eACvBv1B,KAAKg+C,cAAc18C,QACnBhB,EAASgB,OACX,yQtBfK,SAAkCjF,GACvC,OAAO4lC,GAAyB5lC,EAClC,mJAdO,SAAgClI,EAAyBwtC,GAC9D,QAAKxtC,GAIiByD,EAAyBzD,KACtBwtC,CAC3B,mBDzKO,SAAwBxtC,GAC7B,QAAKA,GAKkB,OADHD,EAAwBC,EAE9C,oRyB3EO,mBACL,GAAsB,oBAAXC,OACT,OAKF,MAAM6qD,EAAU7qD,OAQb8qD,YAEH,GAAI,OAAAhqD,EAAA,OAAAJ,EAAA,MAAAmqD,OAAA,EAAAA,EAAQn/C,aAAR,EAAAhL,EAAgBqqD,2BAAkBC,SACpC,OAAOH,EAAOn/C,OAAOq/C,iBAAiBC,SAIxC,MAAMC,EAAiBjrD,OAEpBkrD,qBAEH,OAAID,QAAJ,CAOF,cArGO,SAAmBE,EAAahjD,GACrC,MAAMijD,QAAEA,EAAAhhD,gBAASA,GAAkB,EAAAihD,oBAAMA,GAAsB,GAASljD,EAEnEijD,GAMLD,EAAIz/C,OAAOq/C,iBAAiBC,SAAWI,EAGvCD,EAAIG,QAAQ,UAAWF,GAWnBhhD,GAGF+gD,EAAII,MAAM,CACR,OAAAC,GAGA,KA1BFz+C,QAAQD,MAAM,0CA6BlB","x_google_ignoreList":[13]}