@editframe/elements 0.47.2 → 0.48.1

package/dist/render/EFRenderAPI.js.map

@@ -1 +1 @@
-{"version":3,"file":"EFRenderAPI.js","names":["api: IEFRenderAPI"],"sources":["../../src/render/EFRenderAPI.ts"],"sourcesContent":["/**\n * Window API for programmatic video rendering.\n *\n * Exposes renderTimegroupToVideo for use from Playwright/CLI.\n * Supports streaming output and custom data injection.\n */\n\nimport type { EFTimegroup } from \"../elements/EFTimegroup.js\";\nimport type { EFWorkbench } from \"../gui/EFWorkbench.js\";\nimport { getRenderInfo, type RenderInfo } from \"../getRenderInfo.js\";\n// Import only types - actual function loaded dynamically\nimport type {\n  RenderToVideoOptions,\n  RenderProgress,\n} from \"../preview/renderTimegroupToVideo.types.js\";\n\n// ============================================================================\n// Types\n// ============================================================================\n\nexport interface IEFRenderAPI {\n  /**\n   * Render with streaming output (calls window.onRenderChunk for each chunk).\n   * Use this for CLI/Playwright to avoid memory buffering.\n   */\n  renderStreaming(options?: RenderToVideoOptions): Promise<void>;\n\n  /**\n   * Render and return buffer (for shorter videos or in-browser use).\n   * Returns the video as Uint8Array.\n   */\n  render(options?: RenderToVideoOptions): Promise<Uint8Array>;\n\n  /**\n   * Get render info (dimensions, duration, assets).\n   * Same as the exported getRenderInfo function.\n   */\n  getRenderInfo(): Promise<RenderInfo>;\n\n  /**\n   * Check if SDK is ready for rendering.\n   * Returns true if a root timegroup is found.\n   */\n  isReady(): boolean;\n}\n\ndeclare global {\n  interface Window {\n    EF_RENDER?: IEFRenderAPI;\n    EF_RENDER_DATA?: Record<string, unknown>;\n    onRenderChunk?: (chunk: Uint8Array) => void; // Set by Playwright\n    onRenderProgress?: (progress: RenderProgress) => void; // Optional progress callback\n  }\n}\n\n// ============================================================================\n// Implementation\n// ============================================================================\n\nfunction findRootTimegroup(): EFTimegroup | null {\n  // Try to find timegroup from workbench first\n  const workbench = document.querySelector(\"ef-workbench\") as EFWorkbench | null;\n  if (workbench) {\n    const timegroup = workbench.querySelector(\"ef-timegroup\") as EFTimegroup | null;\n    if (timegroup) {\n      return timegroup;\n    }\n  }\n\n  // Fallback: find first root timegroup\n  const rootTimegroup = document.querySelector(\"ef-timegroup\") as EFTimegroup | null;\n  return rootTimegroup;\n}\n\nfunction setWorkbenchRendering(rendering: boolean): void {\n  const workbench = document.querySelector(\"ef-workbench\") as EFWorkbench | null;\n  if (workbench) {\n    workbench.rendering = rendering;\n  }\n}\n\nasync function waitForTimegroupDimensions(timegroup: EFTimegroup): Promise<void> {\n  await Promise.all(\n    Array.from(document.styleSheets).map((sheet) => {\n      if (sheet.href) {\n        const link = Array.from(document.querySelectorAll('link[rel=\"stylesheet\"]')).find(\n          (l) => (l as HTMLLinkElement).href === sheet.href,\n        );\n        if (link && !(link as HTMLLinkElement).sheet) {\n          return new Promise((resolve) => {\n            link.addEventListener(\"load\", resolve);\n            link.addEventListener(\"error\", resolve);\n          });\n        }\n      }\n      return Promise.resolve();\n    }),\n  );\n\n  // Force layout immediately after stylesheets load\n  void timegroup.offsetHeight;\n\n  const rect = timegroup.getBoundingClientRect();\n  const hasOffset = timegroup.offsetWidth > 0 && timegroup.offsetHeight > 0;\n  const hasRect = rect.width > 0 && rect.height > 0;\n  const computedWidth = getComputedStyle(timegroup).width;\n  const computedHeight = getComputedStyle(timegroup).height;\n  const hasComputed = parseFloat(computedWidth) > 0 && parseFloat(computedHeight) > 0;\n\n  if (!hasOffset && !hasRect && !hasComputed) {\n    throw new Error(\n      `Timegroup has no dimensions (${timegroup.offsetWidth}x${timegroup.offsetHeight}). ` +\n        `Computed styles: width=${computedWidth}, height=${computedHeight}. ` +\n        `Classes: \"${timegroup.className}\". ` +\n        `\\n\\nTailwind CSS did not generate styles for these classes. ` +\n        `Check that:\\n` +\n        `1. Your Tailwind config 'content' array includes the HTML file\\n` +\n        `2. Tailwind CSS is properly configured in your project\\n` +\n        `3. The dev server successfully compiled CSS (check for Tailwind warnings above)`,\n    );\n  }\n}\n\nconst api: IEFRenderAPI = {\n  async renderStreaming(options: RenderToVideoOptions = {}): Promise<void> {\n    const timegroup = findRootTimegroup();\n    if (!timegroup) {\n      throw new Error(\"No ef-timegroup found. Cannot render.\");\n    }\n\n    // Check if window.onRenderChunk is available\n    if (typeof window === \"undefined\" || !window.onRenderChunk) {\n      throw new Error(\n        \"window.onRenderChunk is not set. \" +\n          \"Call page.exposeFunction('onRenderChunk', callback) from Playwright first.\",\n      );\n    }\n\n    // Hide workbench UI during render\n    setWorkbenchRendering(true);\n\n    try {\n      // Wait for timegroup to have dimensions\n      await waitForTimegroupDimensions(timegroup);\n\n      // Wait for media to be ready\n      await timegroup.waitForMediaDurations();\n\n      // Create custom writable stream that calls window.onRenderChunk\n      const chunkWriter = new WritableStream<Uint8Array>({\n        write(chunk: Uint8Array) {\n          if (window.onRenderChunk) {\n            window.onRenderChunk(chunk);\n          }\n        },\n      });\n\n      // Merge progress callback if window.onRenderProgress is set\n      const onProgress = options.onProgress || window.onRenderProgress;\n\n      // Render with custom stream\n      // Dynamic import to avoid loading render utilities during module initialization\n      const { renderTimegroupToVideo } = await import(\"../preview/renderTimegroupToVideo.js\");\n      await renderTimegroupToVideo(timegroup, {\n        ...options,\n        customWritableStream: chunkWriter,\n        onProgress,\n        returnBuffer: false,\n      });\n    } finally {\n      // Restore workbench UI\n      setWorkbenchRendering(false);\n    }\n  },\n\n  async render(options: RenderToVideoOptions = {}): Promise<Uint8Array> {\n    const timegroup = findRootTimegroup();\n    if (!timegroup) {\n      throw new Error(\"No ef-timegroup found. Cannot render.\");\n    }\n\n    // Hide workbench UI during render\n    setWorkbenchRendering(true);\n\n    try {\n      // Wait for timegroup to have dimensions\n      await waitForTimegroupDimensions(timegroup);\n\n      // Wait for media to be ready\n      await timegroup.waitForMediaDurations();\n\n      // Merge progress callback if window.onRenderProgress is set\n      const onProgress = options.onProgress || window.onRenderProgress;\n\n      // Dynamic import to avoid loading render utilities during module initialization\n      const { renderTimegroupToVideo } = await import(\"../preview/renderTimegroupToVideo.js\");\n      const buffer = await renderTimegroupToVideo(timegroup, {\n        ...options,\n        returnBuffer: true,\n        onProgress,\n      });\n\n      if (!buffer) {\n        throw new Error(\"Render failed: no buffer returned\");\n      }\n\n      return buffer;\n    } finally {\n      // Restore workbench UI\n      setWorkbenchRendering(false);\n    }\n  },\n\n  async getRenderInfo(): Promise<RenderInfo> {\n    return getRenderInfo();\n  },\n\n  isReady(): boolean {\n    return findRootTimegroup() !== null;\n  },\n};\n\n// Export and register on window\nif (typeof window !== \"undefined\") {\n  window.EF_RENDER = api;\n}\n\nexport { api as EFRenderAPI };\nexport type { IEFRenderAPI as EFRenderAPIInterface };\n"],"mappings":";;;AA2DA,SAAS,oBAAwC;CAE/C,MAAM,YAAY,SAAS,cAAc,eAAe;AACxD,KAAI,WAAW;EACb,MAAM,YAAY,UAAU,cAAc,eAAe;AACzD,MAAI,UACF,QAAO;;AAMX,QADsB,SAAS,cAAc,eAAe;;AAI9D,SAAS,sBAAsB,WAA0B;CACvD,MAAM,YAAY,SAAS,cAAc,eAAe;AACxD,KAAI,UACF,WAAU,YAAY;;AAI1B,eAAe,2BAA2B,WAAuC;AAC/E,OAAM,QAAQ,IACZ,MAAM,KAAK,SAAS,YAAY,CAAC,KAAK,UAAU;AAC9C,MAAI,MAAM,MAAM;GACd,MAAM,OAAO,MAAM,KAAK,SAAS,iBAAiB,2BAAyB,CAAC,CAAC,MAC1E,MAAO,EAAsB,SAAS,MAAM,KAC9C;AACD,OAAI,QAAQ,CAAE,KAAyB,MACrC,QAAO,IAAI,SAAS,YAAY;AAC9B,SAAK,iBAAiB,QAAQ,QAAQ;AACtC,SAAK,iBAAiB,SAAS,QAAQ;KACvC;;AAGN,SAAO,QAAQ,SAAS;GACxB,CACH;AAGD,CAAK,UAAU;CAEf,MAAM,OAAO,UAAU,uBAAuB;CAC9C,MAAM,YAAY,UAAU,cAAc,KAAK,UAAU,eAAe;CACxE,MAAM,UAAU,KAAK,QAAQ,KAAK,KAAK,SAAS;CAChD,MAAM,gBAAgB,iBAAiB,UAAU,CAAC;CAClD,MAAM,iBAAiB,iBAAiB,UAAU,CAAC;AAGnD,KAAI,CAAC,aAAa,CAAC,WAAW,EAFV,WAAW,cAAc,GAAG,KAAK,WAAW,eAAe,GAAG,GAGhF,OAAM,IAAI,MACR,gCAAgC,UAAU,YAAY,GAAG,UAAU,aAAa,4BACpD,cAAc,WAAW,eAAe,cACrD,UAAU,UAAU,qRAMpC;;AAIL,MAAMA,MAAoB;CACxB,MAAM,gBAAgB,UAAgC,EAAE,EAAiB;EACvE,MAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,UACH,OAAM,IAAI,MAAM,wCAAwC;AAI1D,MAAI,OAAO,WAAW,eAAe,CAAC,OAAO,cAC3C,OAAM,IAAI,MACR,8GAED;AAIH,wBAAsB,KAAK;AAE3B,MAAI;AAEF,SAAM,2BAA2B,UAAU;AAG3C,SAAM,UAAU,uBAAuB;GAGvC,MAAM,cAAc,IAAI,eAA2B,EACjD,MAAM,OAAmB;AACvB,QAAI,OAAO,cACT,QAAO,cAAc,MAAM;MAGhC,CAAC;GAGF,MAAM,aAAa,QAAQ,cAAc,OAAO;GAIhD,MAAM,EAAE,2BAA2B,MAAM,OAAO;AAChD,SAAM,uBAAuB,WAAW;IACtC,GAAG;IACH,sBAAsB;IACtB;IACA,cAAc;IACf,CAAC;YACM;AAER,yBAAsB,MAAM;;;CAIhC,MAAM,OAAO,UAAgC,EAAE,EAAuB;EACpE,MAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,UACH,OAAM,IAAI,MAAM,wCAAwC;AAI1D,wBAAsB,KAAK;AAE3B,MAAI;AAEF,SAAM,2BAA2B,UAAU;AAG3C,SAAM,UAAU,uBAAuB;GAGvC,MAAM,aAAa,QAAQ,cAAc,OAAO;GAGhD,MAAM,EAAE,2BAA2B,MAAM,OAAO;GAChD,MAAM,SAAS,MAAM,uBAAuB,WAAW;IACrD,GAAG;IACH,cAAc;IACd;IACD,CAAC;AAEF,OAAI,CAAC,OACH,OAAM,IAAI,MAAM,oCAAoC;AAGtD,UAAO;YACC;AAER,yBAAsB,MAAM;;;CAIhC,MAAM,gBAAqC;AACzC,SAAO,eAAe;;CAGxB,UAAmB;AACjB,SAAO,mBAAmB,KAAK;;CAElC;AAGD,IAAI,OAAO,WAAW,YACpB,QAAO,YAAY"}
+{"version":3,"file":"EFRenderAPI.js","names":[],"sources":["../../src/render/EFRenderAPI.ts"],"mappings":";;AA2DA,SAAS,oBAAwC;CAE/C,MAAM,YAAY,SAAS,cAAc,eAAe;AACxD,KAAI,WAAW;EACb,MAAM,YAAY,UAAU,cAAc,eAAe;AACzD,MAAI,UACF,QAAO;;AAMX,QADsB,SAAS,cAAc,eAAe;;AAI9D,SAAS,sBAAsB,WAA0B;CACvD,MAAM,YAAY,SAAS,cAAc,eAAe;AACxD,KAAI,UACF,WAAU,YAAY;;AAI1B,eAAe,2BAA2B,WAAuC;AAC/E,OAAM,QAAQ,IACZ,MAAM,KAAK,SAAS,YAAY,CAAC,KAAK,UAAU;AAC9C,MAAI,MAAM,MAAM;GACd,MAAM,OAAO,MAAM,KAAK,SAAS,iBAAiB,2BAAyB,CAAC,CAAC,MAC1E,MAAO,EAAsB,SAAS,MAAM,KAC9C;AACD,OAAI,QAAQ,CAAE,KAAyB,MACrC,QAAO,IAAI,SAAS,YAAY;AAC9B,SAAK,iBAAiB,QAAQ,QAAQ;AACtC,SAAK,iBAAiB,SAAS,QAAQ;KACvC;;AAGN,SAAO,QAAQ,SAAS;GACxB,CACH;AAGI,WAAU;CAEf,MAAM,OAAO,UAAU,uBAAuB;CAC9C,MAAM,YAAY,UAAU,cAAc,KAAK,UAAU,eAAe;CACxE,MAAM,UAAU,KAAK,QAAQ,KAAK,KAAK,SAAS;CAChD,MAAM,gBAAgB,iBAAiB,UAAU,CAAC;CAClD,MAAM,iBAAiB,iBAAiB,UAAU,CAAC;AAGnD,KAAI,CAAC,aAAa,CAAC,WAAW,EAFV,WAAW,cAAc,GAAG,KAAK,WAAW,eAAe,GAAG,GAGhF,OAAM,IAAI,MACR,gCAAgC,UAAU,YAAY,GAAG,UAAU,aAAa,4BACpD,cAAc,WAAW,eAAe,cACrD,UAAU,UAAU,qRAMpC;;AAIL,MAAM,MAAoB;CACxB,MAAM,gBAAgB,UAAgC,EAAE,EAAiB;EACvE,MAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,UACH,OAAM,IAAI,MAAM,wCAAwC;AAI1D,MAAI,OAAO,WAAW,eAAe,CAAC,OAAO,cAC3C,OAAM,IAAI,MACR,8GAED;AAIH,wBAAsB,KAAK;AAE3B,MAAI;AAEF,SAAM,2BAA2B,UAAU;AAG3C,SAAM,UAAU,uBAAuB;GAGvC,MAAM,cAAc,IAAI,eAA2B,EACjD,MAAM,OAAmB;AACvB,QAAI,OAAO,cACT,QAAO,cAAc,MAAM;MAGhC,CAAC;GAGF,MAAM,aAAa,QAAQ,cAAc,OAAO;GAIhD,MAAM,EAAE,2BAA2B,MAAM,OAAO;AAChD,SAAM,uBAAuB,WAAW;IACtC,GAAG;IACH,sBAAsB;IACtB;IACA,cAAc;IACf,CAAC;YACM;AAER,yBAAsB,MAAM;;;CAIhC,MAAM,OAAO,UAAgC,EAAE,EAAuB;EACpE,MAAM,YAAY,mBAAmB;AACrC,MAAI,CAAC,UACH,OAAM,IAAI,MAAM,wCAAwC;AAI1D,wBAAsB,KAAK;AAE3B,MAAI;AAEF,SAAM,2BAA2B,UAAU;AAG3C,SAAM,UAAU,uBAAuB;GAGvC,MAAM,aAAa,QAAQ,cAAc,OAAO;GAGhD,MAAM,EAAE,2BAA2B,MAAM,OAAO;GAChD,MAAM,SAAS,MAAM,uBAAuB,WAAW;IACrD,GAAG;IACH,cAAc;IACd;IACD,CAAC;AAEF,OAAI,CAAC,OACH,OAAM,IAAI,MAAM,oCAAoC;AAGtD,UAAO;YACC;AAER,yBAAsB,MAAM;;;CAIhC,MAAM,gBAAqC;AACzC,SAAO,eAAe;;CAGxB,UAAmB;AACjB,SAAO,mBAAmB,KAAK;;CAElC;AAGD,IAAI,OAAO,WAAW,YACpB,QAAO,YAAY"}

package/dist/render/getRenderData.js

@@ -23,7 +23,7 @@ function getRenderData() {
 	if (typeof window !== "undefined" && window.EF_RENDER_DATA) return window.EF_RENDER_DATA;
 	if (typeof RENDER_DATA !== "undefined") return RENDER_DATA;
 }
-
 //#endregion
 export { getRenderData };
+
 //# sourceMappingURL=getRenderData.js.map

package/dist/render/getRenderData.js.map

@@ -1 +1 @@
-{"version":3,"file":"getRenderData.js","names":[],"sources":["../../src/render/getRenderData.ts"],"sourcesContent":["/**\n * Helper function for compositions to read custom render data.\n *\n * Supports both runtime data (set by Playwright/CLI via window.EF_RENDER_DATA)\n * and build-time data (set by Vite define as RENDER_DATA).\n */\n\n// Declare RENDER_DATA for TypeScript (set via Vite define at build time)\ndeclare const RENDER_DATA: unknown | undefined;\n\n/**\n * Get custom render data that was passed to the render process.\n *\n * @returns The render data object, or undefined if no data was provided\n *\n * @example\n * ```typescript\n * import { getRenderData } from \"@editframe/elements\";\n *\n * interface MyRenderData {\n *   userName: string;\n *   theme: \"light\" | \"dark\";\n * }\n *\n * const data = getRenderData<MyRenderData>();\n * if (data) {\n *   console.log(data.userName);  // \"John\"\n * }\n * ```\n */\nexport function getRenderData<T = unknown>(): T | undefined {\n  // Runtime data (set by Playwright/CLI)\n  if (typeof window !== \"undefined\" && window.EF_RENDER_DATA) {\n    return window.EF_RENDER_DATA as T;\n  }\n\n  // Build-time data (set by Vite define)\n  if (typeof RENDER_DATA !== \"undefined\") {\n    return RENDER_DATA as T;\n  }\n\n  return undefined;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,gBAA4C;AAE1D,KAAI,OAAO,WAAW,eAAe,OAAO,eAC1C,QAAO,OAAO;AAIhB,KAAI,OAAO,gBAAgB,YACzB,QAAO"}
+{"version":3,"file":"getRenderData.js","names":[],"sources":["../../src/render/getRenderData.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA8BA,SAAgB,gBAA4C;AAE1D,KAAI,OAAO,WAAW,eAAe,OAAO,eAC1C,QAAO,OAAO;AAIhB,KAAI,OAAO,gBAAgB,YACzB,QAAO"}

package/dist/transcoding/cache/RequestDeduplicator.js

@@ -52,7 +52,7 @@ var RequestDeduplicator = class {
 		return Array.from(this.pendingRequests.keys());
 	}
 };
-
 //#endregion
 export { RequestDeduplicator };
+
 //# sourceMappingURL=RequestDeduplicator.js.map

package/dist/transcoding/cache/RequestDeduplicator.js.map

@@ -1 +1 @@
-{"version":3,"file":"RequestDeduplicator.js","names":[],"sources":["../../../src/transcoding/cache/RequestDeduplicator.ts"],"sourcesContent":["/**\n * Request deduplication utility\n * Manages pending requests to prevent concurrent duplicate requests\n */\n\nexport class RequestDeduplicator {\n  private pendingRequests = new Map<string, Promise<any>>();\n\n  /**\n   * Execute a request with deduplication\n   * If a request with the same key is already pending, return the existing promise\n   * Otherwise, execute the request factory and track the promise\n   */\n  async executeRequest<T>(key: string, requestFactory: () => Promise<T>): Promise<T> {\n    // Check if there's already a pending request for this key\n    const existingRequest = this.pendingRequests.get(key);\n    if (existingRequest) {\n      return existingRequest;\n    }\n\n    // Create and track the new request\n    const requestPromise = requestFactory();\n    this.pendingRequests.set(key, requestPromise);\n\n    // Prevent unhandled rejection on the raw factory promise. Chrome's V8\n    // may detect a rejection as unhandled if no synchronous .catch() is\n    // attached before any microtask boundary, even when the promise is\n    // currently being await-ed. The error still propagates via the try/catch.\n    requestPromise.catch(() => {});\n\n    try {\n      const result = await requestPromise;\n      this.pendingRequests.delete(key);\n      return result;\n    } catch (error) {\n      this.pendingRequests.delete(key);\n      throw error;\n    }\n  }\n\n  /**\n   * Clear all pending requests (used in cache clearing)\n   */\n  clear(): void {\n    this.pendingRequests.clear();\n  }\n\n  /**\n   * Get number of pending requests\n   */\n  getPendingCount(): number {\n    return this.pendingRequests.size;\n  }\n\n  /**\n   * Check if a request is pending\n   */\n  isPending(key: string): boolean {\n    return this.pendingRequests.has(key);\n  }\n\n  /**\n   * Get all pending request keys\n   */\n  getPendingKeys(): string[] {\n    return Array.from(this.pendingRequests.keys());\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,sBAAb,MAAiC;;yCACL,IAAI,KAA2B;;;;;;;CAOzD,MAAM,eAAkB,KAAa,gBAA8C;EAEjF,MAAM,kBAAkB,KAAK,gBAAgB,IAAI,IAAI;AACrD,MAAI,gBACF,QAAO;EAIT,MAAM,iBAAiB,gBAAgB;AACvC,OAAK,gBAAgB,IAAI,KAAK,eAAe;AAM7C,iBAAe,YAAY,GAAG;AAE9B,MAAI;GACF,MAAM,SAAS,MAAM;AACrB,QAAK,gBAAgB,OAAO,IAAI;AAChC,UAAO;WACA,OAAO;AACd,QAAK,gBAAgB,OAAO,IAAI;AAChC,SAAM;;;;;;CAOV,QAAc;AACZ,OAAK,gBAAgB,OAAO;;;;;CAM9B,kBAA0B;AACxB,SAAO,KAAK,gBAAgB;;;;;CAM9B,UAAU,KAAsB;AAC9B,SAAO,KAAK,gBAAgB,IAAI,IAAI;;;;;CAMtC,iBAA2B;AACzB,SAAO,MAAM,KAAK,KAAK,gBAAgB,MAAM,CAAC"}
+{"version":3,"file":"RequestDeduplicator.js","names":[],"sources":["../../../src/transcoding/cache/RequestDeduplicator.ts"],"mappings":";;;;;AAKA,IAAa,sBAAb,MAAiC;;yCACL,IAAI,KAA2B;;;;;;;CAOzD,MAAM,eAAkB,KAAa,gBAA8C;EAEjF,MAAM,kBAAkB,KAAK,gBAAgB,IAAI,IAAI;AACrD,MAAI,gBACF,QAAO;EAIT,MAAM,iBAAiB,gBAAgB;AACvC,OAAK,gBAAgB,IAAI,KAAK,eAAe;AAM7C,iBAAe,YAAY,GAAG;AAE9B,MAAI;GACF,MAAM,SAAS,MAAM;AACrB,QAAK,gBAAgB,OAAO,IAAI;AAChC,UAAO;WACA,OAAO;AACd,QAAK,gBAAgB,OAAO,IAAI;AAChC,SAAM;;;;;;CAOV,QAAc;AACZ,OAAK,gBAAgB,OAAO;;;;;CAM9B,kBAA0B;AACxB,SAAO,KAAK,gBAAgB;;;;;CAM9B,UAAU,KAAsB;AAC9B,SAAO,KAAK,gBAAgB,IAAI,IAAI;;;;;CAMtC,iBAA2B;AACzB,SAAO,MAAM,KAAK,KAAK,gBAAgB,MAAM,CAAC"}

package/dist/transcoding/cache/URLTokenDeduplicator.js

@@ -63,7 +63,7 @@ var URLTokenDeduplicator = class {
 	}
 };
 const globalURLTokenDeduplicator = new URLTokenDeduplicator();
-
 //#endregion
 export { globalURLTokenDeduplicator };
+
 //# sourceMappingURL=URLTokenDeduplicator.js.map

package/dist/transcoding/cache/URLTokenDeduplicator.js.map

@@ -1 +1 @@
-{"version":3,"file":"URLTokenDeduplicator.js","names":[],"sources":["../../../src/transcoding/cache/URLTokenDeduplicator.ts"],"sourcesContent":["/**\n * Global URL token deduplication utility\n * Ensures that multiple EFMedia elements requesting tokens for the same resource\n * share a single token request, preventing unnecessary duplicate token generation\n */\n\nexport interface TokenCacheEntry {\n  tokenPromise: Promise<string>;\n  expiration: number;\n}\n\nexport class URLTokenDeduplicator {\n  private tokenCache = new Map<string, TokenCacheEntry>();\n\n  /**\n   * Get or create a URL token with global deduplication\n   * Multiple requests for the same cache key will share the same token promise\n   */\n  async getToken(\n    cacheKey: string,\n    tokenFactory: () => Promise<string>,\n    parseExpiration: (token: string) => number,\n  ): Promise<string> {\n    const now = Date.now();\n    const cached = this.tokenCache.get(cacheKey);\n\n    // Check if we have a valid cached token\n    if (cached && now < cached.expiration) {\n      return cached.tokenPromise;\n    }\n\n    // Create new token request\n    const tokenPromise = tokenFactory()\n      .then(async (token) => {\n        // Update expiration after we get the token\n        const expiration = parseExpiration(token);\n        this.tokenCache.set(cacheKey, { tokenPromise, expiration });\n        return token;\n      })\n      .catch((error) => {\n        // Remove failed request from cache\n        this.tokenCache.delete(cacheKey);\n        throw error;\n      });\n\n    // Cache the promise immediately to deduplicate concurrent requests\n    this.tokenCache.set(cacheKey, {\n      tokenPromise,\n      expiration: now + 60000, // Temporary 1-minute expiration, will be updated when token is received\n    });\n\n    return tokenPromise;\n  }\n\n  /**\n   * Clear all cached tokens (used in testing)\n   */\n  clear(): void {\n    this.tokenCache.clear();\n  }\n\n  /**\n   * Get number of cached tokens\n   */\n  getCachedCount(): number {\n    return this.tokenCache.size;\n  }\n\n  /**\n   * Check if a token is cached and valid\n   */\n  hasValidToken(cacheKey: string): boolean {\n    const cached = this.tokenCache.get(cacheKey);\n    if (!cached) return false;\n\n    const now = Date.now();\n    return now < cached.expiration;\n  }\n\n  /**\n   * Get all cached token keys\n   */\n  getCachedKeys(): string[] {\n    return Array.from(this.tokenCache.keys());\n  }\n\n  /**\n   * Remove expired tokens from cache\n   */\n  cleanup(): void {\n    const now = Date.now();\n    for (const [key, entry] of this.tokenCache.entries()) {\n      if (now >= entry.expiration) {\n        this.tokenCache.delete(key);\n      }\n    }\n  }\n}\n\n// Global instance shared across all context providers\nexport const globalURLTokenDeduplicator = new URLTokenDeduplicator();\n"],"mappings":";AAWA,IAAa,uBAAb,MAAkC;;oCACX,IAAI,KAA8B;;;;;;CAMvD,MAAM,SACJ,UACA,cACA,iBACiB;EACjB,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,SAAS,KAAK,WAAW,IAAI,SAAS;AAG5C,MAAI,UAAU,MAAM,OAAO,WACzB,QAAO,OAAO;EAIhB,MAAM,eAAe,cAAc,CAChC,KAAK,OAAO,UAAU;GAErB,MAAM,aAAa,gBAAgB,MAAM;AACzC,QAAK,WAAW,IAAI,UAAU;IAAE;IAAc;IAAY,CAAC;AAC3D,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,WAAW,OAAO,SAAS;AAChC,SAAM;IACN;AAGJ,OAAK,WAAW,IAAI,UAAU;GAC5B;GACA,YAAY,MAAM;GACnB,CAAC;AAEF,SAAO;;;;;CAMT,QAAc;AACZ,OAAK,WAAW,OAAO;;;;;CAMzB,iBAAyB;AACvB,SAAO,KAAK,WAAW;;;;;CAMzB,cAAc,UAA2B;EACvC,MAAM,SAAS,KAAK,WAAW,IAAI,SAAS;AAC5C,MAAI,CAAC,OAAQ,QAAO;AAGpB,SADY,KAAK,KAAK,GACT,OAAO;;;;;CAMtB,gBAA0B;AACxB,SAAO,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;;;;;CAM3C,UAAgB;EACd,MAAM,MAAM,KAAK,KAAK;AACtB,OAAK,MAAM,CAAC,KAAK,UAAU,KAAK,WAAW,SAAS,CAClD,KAAI,OAAO,MAAM,WACf,MAAK,WAAW,OAAO,IAAI;;;AAOnC,MAAa,6BAA6B,IAAI,sBAAsB"}
+{"version":3,"file":"URLTokenDeduplicator.js","names":[],"sources":["../../../src/transcoding/cache/URLTokenDeduplicator.ts"],"mappings":";AAWA,IAAa,uBAAb,MAAkC;;oCACX,IAAI,KAA8B;;;;;;CAMvD,MAAM,SACJ,UACA,cACA,iBACiB;EACjB,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,SAAS,KAAK,WAAW,IAAI,SAAS;AAG5C,MAAI,UAAU,MAAM,OAAO,WACzB,QAAO,OAAO;EAIhB,MAAM,eAAe,cAAc,CAChC,KAAK,OAAO,UAAU;GAErB,MAAM,aAAa,gBAAgB,MAAM;AACzC,QAAK,WAAW,IAAI,UAAU;IAAE;IAAc;IAAY,CAAC;AAC3D,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,WAAW,OAAO,SAAS;AAChC,SAAM;IACN;AAGJ,OAAK,WAAW,IAAI,UAAU;GAC5B;GACA,YAAY,MAAM;GACnB,CAAC;AAEF,SAAO;;;;;CAMT,QAAc;AACZ,OAAK,WAAW,OAAO;;;;;CAMzB,iBAAyB;AACvB,SAAO,KAAK,WAAW;;;;;CAMzB,cAAc,UAA2B;EACvC,MAAM,SAAS,KAAK,WAAW,IAAI,SAAS;AAC5C,MAAI,CAAC,OAAQ,QAAO;AAGpB,SADY,KAAK,KAAK,GACT,OAAO;;;;;CAMtB,gBAA0B;AACxB,SAAO,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC;;;;;CAM3C,UAAgB;EACd,MAAM,MAAM,KAAK,KAAK;AACtB,OAAK,MAAM,CAAC,KAAK,UAAU,KAAK,WAAW,SAAS,CAClD,KAAI,OAAO,MAAM,WACf,MAAK,WAAW,OAAO,IAAI;;;AAOnC,MAAa,6BAA6B,IAAI,sBAAsB"}

package/dist/transcoding/types/index.d.ts

@@ -4,7 +4,6 @@ import { TimingModel } from "../../elements/EFMedia/TimingModel.js";
 import { MediaEngine } from "../../elements/EFMedia/MediaEngine.js";
 
 //#region src/transcoding/types/index.d.ts
-
 interface ThumbnailResult {
   timestamp: number;
   thumbnail: HTMLCanvasElement | OffscreenCanvas;

package/dist/transcoding/utils/UrlGenerator.js

@@ -31,7 +31,7 @@ var UrlGenerator = class {
 		return `${this.baseUrl()}/api/v1/transcode/presets`;
 	}
 };
-
 //#endregion
 export { UrlGenerator };
+
 //# sourceMappingURL=UrlGenerator.js.map

package/dist/transcoding/utils/UrlGenerator.js.map

@@ -1 +1 @@
-{"version":3,"file":"UrlGenerator.js","names":["baseUrl: () => string"],"sources":["../../../src/transcoding/utils/UrlGenerator.ts"],"sourcesContent":["/**\n * URL generation utilities for transcoding endpoints\n */\n\nexport class UrlGenerator {\n  constructor(private baseUrl: () => string) {}\n\n  /**\n   * Get the base URL for constructing absolute URLs\n   */\n  getBaseUrl(): string {\n    return this.baseUrl();\n  }\n\n  /**\n   * Generate init segment URL\n   */\n  generateInitSegmentUrl(mediaUrl: string, rendition: string): string {\n    return `${this.baseUrl()}/api/v1/transcode/${rendition}/init.mp4?url=${encodeURIComponent(mediaUrl)}`;\n  }\n\n  /**\n   * Generate manifest URL\n   */\n  generateManifestUrl(mediaUrl: string): string {\n    return `${this.baseUrl()}/api/v1/transcode/manifest.json?url=${encodeURIComponent(mediaUrl)}`;\n  }\n\n  /**\n   * Generate quality presets URL\n   */\n  generatePresetsUrl(): string {\n    return `${this.baseUrl()}/api/v1/transcode/presets`;\n  }\n}\n"],"mappings":";;;;AAIA,IAAa,eAAb,MAA0B;CACxB,YAAY,AAAQA,SAAuB;EAAvB;;;;;CAKpB,aAAqB;AACnB,SAAO,KAAK,SAAS;;;;;CAMvB,uBAAuB,UAAkB,WAA2B;AAClE,SAAO,GAAG,KAAK,SAAS,CAAC,oBAAoB,UAAU,gBAAgB,mBAAmB,SAAS;;;;;CAMrG,oBAAoB,UAA0B;AAC5C,SAAO,GAAG,KAAK,SAAS,CAAC,sCAAsC,mBAAmB,SAAS;;;;;CAM7F,qBAA6B;AAC3B,SAAO,GAAG,KAAK,SAAS,CAAC"}
+{"version":3,"file":"UrlGenerator.js","names":[],"sources":["../../../src/transcoding/utils/UrlGenerator.ts"],"mappings":";;;;AAIA,IAAa,eAAb,MAA0B;CACxB,YAAY,SAA+B;AAAvB,OAAA,UAAA;;;;;CAKpB,aAAqB;AACnB,SAAO,KAAK,SAAS;;;;;CAMvB,uBAAuB,UAAkB,WAA2B;AAClE,SAAO,GAAG,KAAK,SAAS,CAAC,oBAAoB,UAAU,gBAAgB,mBAAmB,SAAS;;;;;CAMrG,oBAAoB,UAA0B;AAC5C,SAAO,GAAG,KAAK,SAAS,CAAC,sCAAsC,mBAAmB,SAAS;;;;;CAM7F,qBAA6B;AAC3B,SAAO,GAAG,KAAK,SAAS,CAAC"}

package/dist/utils/LRUCache.js

@@ -126,7 +126,7 @@ var SizeAwareLRUCache = class {
 		return this.maxSizeBytes;
 	}
 };
-
 //#endregion
 export { LRUCache, SizeAwareLRUCache };
+
 //# sourceMappingURL=LRUCache.js.map

package/dist/utils/LRUCache.js.map

@@ -1 +1 @@
-{"version":3,"file":"LRUCache.js","names":[],"sources":["../../src/utils/LRUCache.ts"],"sourcesContent":["/**\n * A simple LRU (Least Recently Used) cache implementation\n */\nexport class LRUCache<K, V> {\n  private cache = new Map<K, V>();\n  private readonly maxSize: number;\n\n  constructor(maxSize: number) {\n    this.maxSize = maxSize;\n  }\n\n  get(key: K): V | undefined {\n    const value = this.cache.get(key);\n    if (value !== undefined) {\n      // Refresh position by removing and re-adding\n      this.cache.delete(key);\n      this.cache.set(key, value);\n    }\n    return value;\n  }\n\n  set(key: K, value: V): void {\n    if (this.cache.has(key)) {\n      this.cache.delete(key);\n    } else if (this.cache.size >= this.maxSize) {\n      // Remove oldest entry (first item in map)\n      const firstKey = this.cache.keys().next().value;\n      if (firstKey !== undefined) {\n        this.cache.delete(firstKey);\n      }\n    }\n    this.cache.set(key, value);\n  }\n\n  has(key: K): boolean {\n    return this.cache.has(key);\n  }\n\n  delete(key: K): boolean {\n    return this.cache.delete(key);\n  }\n\n  clear(): void {\n    this.cache.clear();\n  }\n\n  get size(): number {\n    return this.cache.size;\n  }\n\n  keys(): IterableIterator<K> {\n    return this.cache.keys();\n  }\n}\n\n/**\n * Size-aware LRU cache that tracks memory usage in bytes\n * Evicts entries when total size exceeds the maximum\n */\nexport class SizeAwareLRUCache<K> {\n  private cache = new Map<K, Promise<ArrayBuffer>>();\n  private sizes = new Map<K, number>();\n  private resolvedKeys = new Set<K>();\n  private currentSize = 0;\n  private readonly maxSizeBytes: number;\n\n  constructor(maxSizeBytes: number) {\n    this.maxSizeBytes = maxSizeBytes;\n  }\n\n  get(key: K): Promise<ArrayBuffer> | undefined {\n    const value = this.cache.get(key);\n    if (value) {\n      // Refresh position by removing and re-adding\n      const size = this.sizes.get(key) || 0;\n      this.cache.delete(key);\n      this.cache.set(key, value);\n      this.sizes.delete(key);\n      this.sizes.set(key, size);\n    }\n    return value;\n  }\n\n  set(key: K, value: Promise<ArrayBuffer>): void {\n    // If key already exists, remove it first\n    if (this.cache.has(key)) {\n      const oldSize = this.sizes.get(key) || 0;\n      this.currentSize -= oldSize;\n      this.cache.delete(key);\n      this.sizes.delete(key);\n      this.resolvedKeys.delete(key);\n    }\n\n    // Track the size when the promise resolves\n    const sizeTrackingPromise = value\n      .then((buffer) => {\n        // Guard against the case where this entry was evicted while the\n        // promise was in-flight. Without this check, resolvedKeys.add() would\n        // mark a key as cached even though the cache entry no longer exists,\n        // causing has() to return true while get() returns undefined.\n        if (!this.cache.has(key)) return buffer;\n\n        const bufferSize = buffer.byteLength;\n        this.sizes.set(key, bufferSize);\n        this.currentSize += bufferSize;\n        this.resolvedKeys.add(key);\n\n        // Evict oldest entries if we exceed the size limit\n        this.evictIfNecessary();\n\n        return buffer;\n      })\n      .catch((error) => {\n        // If the promise fails, clean up the entry\n        this.cache.delete(key);\n        this.sizes.delete(key);\n        this.resolvedKeys.delete(key);\n        throw error;\n      });\n\n    // Suppress unhandled rejection on the derived promise. This promise sits in\n    // the cache and may reject before any caller retrieves and awaits it.\n    // Zone.js checks for handlers synchronously at rejection time — without this,\n    // the re-thrown error triggers an unhandledrejection event. Callers who later\n    // await the cached promise still see the rejection (this just adds a no-op branch).\n    sizeTrackingPromise.catch(() => {});\n\n    this.cache.set(key, sizeTrackingPromise);\n  }\n\n  private evictIfNecessary(): void {\n    while (this.currentSize > this.maxSizeBytes && this.cache.size > 0) {\n      // Remove oldest entry (first item in map)\n      const firstKey = this.cache.keys().next().value;\n      if (firstKey !== undefined) {\n        const size = this.sizes.get(firstKey) ?? 0;\n        this.currentSize -= size;\n        this.cache.delete(firstKey);\n        this.sizes.delete(firstKey);\n        this.resolvedKeys.delete(firstKey);\n        // If this entry had zero bytes, currentSize didn't change. Break to\n        // avoid evicting the entire cache when size tracking is stale.\n        if (size === 0) break;\n      } else {\n        break;\n      }\n    }\n  }\n\n  has(key: K): boolean {\n    return this.resolvedKeys.has(key);\n  }\n\n  delete(key: K): boolean {\n    const size = this.sizes.get(key) || 0;\n    this.currentSize -= size;\n    this.sizes.delete(key);\n    this.resolvedKeys.delete(key);\n    return this.cache.delete(key);\n  }\n\n  clear(): void {\n    this.cache.clear();\n    this.sizes.clear();\n    this.resolvedKeys.clear();\n    this.currentSize = 0;\n  }\n\n  get size(): number {\n    return this.cache.size;\n  }\n\n  get currentSizeBytes(): number {\n    return this.currentSize;\n  }\n\n  get maxSize(): number {\n    return this.maxSizeBytes;\n  }\n}\n\n/**\n * Red-Black Tree node colors\n */\nenum Color {\n  RED = \"RED\",\n  BLACK = \"BLACK\",\n}\n\n/**\n * Red-Black Tree node for ordered key storage\n */\nclass RBTreeNode<K> {\n  constructor(\n    public key: K,\n    public color: Color = Color.RED,\n    public left: RBTreeNode<K> | null = null,\n    public right: RBTreeNode<K> | null = null,\n    public parent: RBTreeNode<K> | null = null,\n  ) {}\n}\n\n/**\n * Red-Black Tree implementation for O(log n) operations\n * Supports insert, delete, search, range queries, and nearest neighbor\n */\nclass RedBlackTree<K> {\n  private root: RBTreeNode<K> | null = null;\n  private readonly compareFn: (a: K, b: K) => number;\n\n  constructor(compareFn: (a: K, b: K) => number) {\n    this.compareFn = compareFn;\n  }\n\n  insert(key: K): void {\n    const node = new RBTreeNode(key);\n\n    if (!this.root) {\n      this.root = node;\n      node.color = Color.BLACK;\n      return;\n    }\n\n    this.insertNode(node);\n    this.fixInsert(node);\n  }\n\n  delete(key: K): boolean {\n    const node = this.findNode(key);\n    if (!node) return false;\n\n    this.deleteNode(node);\n    return true;\n  }\n\n  find(key: K): K | null {\n    const node = this.findNode(key);\n    return node ? node.key : null;\n  }\n\n  findNearestInRange(center: K, distance: K): K[] {\n    // Calculate the range bounds\n    const start = this.subtractDistance(center, distance);\n    const end = this.addDistance(center, distance);\n\n    // Use existing range search (O(log n + k))\n    return this.findRange(start, end);\n  }\n\n  private subtractDistance(center: K, distance: K): K {\n    if (typeof center === \"number\" && typeof distance === \"number\") {\n      return (center - distance) as K;\n    }\n\n    // For strings, we can't easily subtract distance, so just return center\n    // This means string searches will be exact matches only\n    return center;\n  }\n\n  private addDistance(center: K, distance: K): K {\n    if (typeof center === \"number\" && typeof distance === \"number\") {\n      return (center + distance) as K;\n    }\n\n    // For strings, we can't easily add distance, so just return center\n    // This means string searches will be exact matches only\n    return center;\n  }\n\n  findRange(start: K, end: K): K[] {\n    const result: K[] = [];\n    this.inorderRange(this.root, start, end, result);\n    return result;\n  }\n\n  getAllSorted(): K[] {\n    const result: K[] = [];\n    this.inorder(this.root, result);\n    return result;\n  }\n\n  private findNode(key: K): RBTreeNode<K> | null {\n    let current = this.root;\n\n    while (current) {\n      const cmp = this.compareFn(key, current.key);\n      if (cmp === 0) return current;\n      current = cmp < 0 ? current.left : current.right;\n    }\n\n    return null;\n  }\n\n  private insertNode(node: RBTreeNode<K>): void {\n    let parent = null;\n    let current = this.root;\n\n    while (current) {\n      parent = current;\n      const cmp = this.compareFn(node.key, current.key);\n      current = cmp < 0 ? current.left : current.right;\n    }\n\n    node.parent = parent;\n    if (!parent) {\n      this.root = node;\n    } else {\n      const cmp = this.compareFn(node.key, parent.key);\n      if (cmp < 0) {\n        parent.left = node;\n      } else {\n        parent.right = node;\n      }\n    }\n  }\n\n  private fixInsert(node: RBTreeNode<K>): void {\n    while (node.parent && node.parent.color === Color.RED) {\n      if (node.parent === node.parent.parent?.left) {\n        const uncle = node.parent.parent.right;\n\n        if (uncle?.color === Color.RED) {\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          node.parent.parent.color = Color.RED;\n          node = node.parent.parent;\n        } else {\n          if (node === node.parent.right) {\n            node = node.parent;\n            this.rotateLeft(node);\n          }\n\n          if (node.parent) {\n            node.parent.color = Color.BLACK;\n            if (node.parent.parent) {\n              node.parent.parent.color = Color.RED;\n              this.rotateRight(node.parent.parent);\n            }\n          }\n        }\n      } else {\n        const uncle = node.parent.parent?.left;\n\n        if (uncle?.color === Color.RED) {\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          if (node.parent.parent) {\n            node.parent.parent.color = Color.RED;\n            node = node.parent.parent;\n          }\n        } else {\n          if (node === node.parent.left) {\n            node = node.parent;\n            this.rotateRight(node);\n          }\n\n          if (node.parent) {\n            node.parent.color = Color.BLACK;\n            if (node.parent.parent) {\n              node.parent.parent.color = Color.RED;\n              this.rotateLeft(node.parent.parent);\n            }\n          }\n        }\n      }\n    }\n\n    if (this.root) {\n      this.root.color = Color.BLACK;\n    }\n  }\n\n  private deleteNode(node: RBTreeNode<K>): void {\n    let y = node;\n    let yOriginalColor = y.color;\n    let x: RBTreeNode<K> | null;\n\n    if (!node.left) {\n      x = node.right;\n      this.transplant(node, node.right);\n    } else if (!node.right) {\n      x = node.left;\n      this.transplant(node, node.left);\n    } else {\n      y = this.minimum(node.right);\n      yOriginalColor = y.color;\n      x = y.right;\n\n      if (y.parent === node) {\n        if (x) x.parent = y;\n      } else {\n        this.transplant(y, y.right);\n        y.right = node.right;\n        if (y.right) y.right.parent = y;\n      }\n\n      this.transplant(node, y);\n      y.left = node.left;\n      if (y.left) y.left.parent = y;\n      y.color = node.color;\n    }\n\n    if (yOriginalColor === Color.BLACK && x) {\n      this.fixDelete(x);\n    }\n  }\n\n  private fixDelete(node: RBTreeNode<K>): void {\n    while (node !== this.root && node.color === Color.BLACK) {\n      if (node === node.parent?.left) {\n        let sibling = node.parent.right;\n\n        if (sibling?.color === Color.RED) {\n          sibling.color = Color.BLACK;\n          node.parent.color = Color.RED;\n          this.rotateLeft(node.parent);\n          sibling = node.parent.right;\n        }\n\n        if (sibling?.left?.color !== Color.RED && sibling?.right?.color !== Color.RED) {\n          if (sibling) {\n            sibling.color = Color.RED;\n          }\n          node = node.parent;\n        } else {\n          if (sibling?.right?.color !== Color.RED) {\n            if (sibling.left) sibling.left.color = Color.BLACK;\n            sibling.color = Color.RED;\n            this.rotateRight(sibling);\n            sibling = node.parent.right;\n          }\n\n          if (sibling) {\n            sibling.color = node.parent.color;\n            node.parent.color = Color.BLACK;\n            if (sibling.right) sibling.right.color = Color.BLACK;\n            this.rotateLeft(node.parent);\n          }\n          if (!this.root) {\n            throw new Error(\"Root is null\");\n          }\n          node = this.root;\n        }\n      } else {\n        let sibling = node.parent?.left;\n\n        if (sibling?.color === Color.RED) {\n          sibling.color = Color.BLACK;\n          if (node.parent) node.parent.color = Color.RED;\n          if (node.parent) this.rotateRight(node.parent);\n          sibling = node.parent?.left;\n        }\n\n        if (sibling?.right?.color !== Color.RED && sibling?.left?.color !== Color.RED) {\n          if (sibling) {\n            sibling.color = Color.RED;\n          }\n          if (node.parent === null) {\n            throw new Error(\"Node parent is null\");\n          }\n          node = node.parent;\n        } else {\n          if (sibling?.left?.color !== Color.RED) {\n            if (sibling.right) sibling.right.color = Color.BLACK;\n            sibling.color = Color.RED;\n            this.rotateLeft(sibling);\n            sibling = node.parent?.left;\n          }\n\n          if (sibling) {\n            sibling.color = node.parent?.color || Color.BLACK;\n            if (node.parent) node.parent.color = Color.BLACK;\n            if (sibling.left) sibling.left.color = Color.BLACK;\n            if (node.parent) this.rotateRight(node.parent);\n          }\n          if (!this.root) {\n            throw new Error(\"Root is null\");\n          }\n          node = this.root;\n        }\n      }\n    }\n\n    node.color = Color.BLACK;\n  }\n\n  private rotateLeft(node: RBTreeNode<K>): void {\n    const rightChild = node.right;\n    if (!rightChild) {\n      throw new Error(\"Right child is null\");\n    }\n    node.right = rightChild.left;\n\n    if (rightChild.left) {\n      rightChild.left.parent = node;\n    }\n\n    rightChild.parent = node.parent;\n\n    if (!node.parent) {\n      this.root = rightChild;\n    } else if (node === node.parent.left) {\n      node.parent.left = rightChild;\n    } else {\n      node.parent.right = rightChild;\n    }\n\n    rightChild.left = node;\n    node.parent = rightChild;\n  }\n\n  private rotateRight(node: RBTreeNode<K>): void {\n    const leftChild = node.left;\n    if (!leftChild) {\n      throw new Error(\"Left child is null\");\n    }\n    node.left = leftChild.right;\n\n    if (leftChild.right) {\n      leftChild.right.parent = node;\n    }\n\n    leftChild.parent = node.parent;\n\n    if (!node.parent) {\n      this.root = leftChild;\n    } else if (node === node.parent.right) {\n      node.parent.right = leftChild;\n    } else {\n      node.parent.left = leftChild;\n    }\n\n    leftChild.right = node;\n    node.parent = leftChild;\n  }\n\n  private transplant(u: RBTreeNode<K>, v: RBTreeNode<K> | null): void {\n    if (!u.parent) {\n      this.root = v;\n    } else if (u === u.parent.left) {\n      u.parent.left = v;\n    } else {\n      u.parent.right = v;\n    }\n\n    if (v) {\n      v.parent = u.parent;\n    }\n  }\n\n  private minimum(node: RBTreeNode<K>): RBTreeNode<K> {\n    while (node.left) {\n      node = node.left;\n    }\n    return node;\n  }\n\n  private inorder(node: RBTreeNode<K> | null, result: K[]): void {\n    if (node) {\n      this.inorder(node.left, result);\n      result.push(node.key);\n      this.inorder(node.right, result);\n    }\n  }\n\n  private inorderRange(node: RBTreeNode<K> | null, start: K, end: K, result: K[]): void {\n    if (!node) return;\n\n    const startCmp = this.compareFn(node.key, start);\n    const endCmp = this.compareFn(node.key, end);\n\n    if (startCmp > 0) {\n      this.inorderRange(node.left, start, end, result);\n    }\n\n    if (startCmp >= 0 && endCmp <= 0) {\n      result.push(node.key);\n    }\n\n    if (endCmp < 0) {\n      this.inorderRange(node.right, start, end, result);\n    }\n  }\n}\n\n/**\n * LRU cache with binary search capabilities using Red-Black tree\n * All operations are O(log n) for ordered queries and O(1) for LRU operations\n */\nexport class OrderedLRUCache<K extends number | string, V> {\n  private cache = new Map<K, V>();\n  private tree: RedBlackTree<K>;\n  private readonly maxSize: number;\n  private readonly compareFn: (a: K, b: K) => number;\n\n  constructor(maxSize: number, compareFn?: (a: K, b: K) => number) {\n    this.maxSize = maxSize;\n    this.compareFn = compareFn || ((a, b) => (a < b ? -1 : a > b ? 1 : 0));\n    this.tree = new RedBlackTree(this.compareFn);\n  }\n\n  /**\n   * Get value by exact key (O(1))\n   */\n  get(key: K): V | undefined {\n    const value = this.cache.get(key);\n    if (value !== undefined) {\n      // Refresh position by removing and re-adding\n      this.cache.delete(key);\n      this.cache.set(key, value);\n    }\n    return value;\n  }\n\n  /**\n   * Set key-value pair (O(log n) for tree operations, O(1) for cache)\n   */\n  set(key: K, value: V): void {\n    const isUpdate = this.cache.has(key);\n\n    if (isUpdate) {\n      this.cache.delete(key);\n    } else {\n      if (this.cache.size >= this.maxSize) {\n        // Remove oldest entry (first item in map)\n        const firstKey = this.cache.keys().next().value;\n        if (firstKey !== undefined) {\n          this.cache.delete(firstKey);\n          this.tree.delete(firstKey);\n        }\n      }\n      // Add to tree index for new keys\n      this.tree.insert(key);\n    }\n\n    this.cache.set(key, value);\n  }\n\n  /**\n   * Find exact key using tree search (O(log n))\n   */\n  findExact(key: K): V | undefined {\n    const foundKey = this.tree.find(key);\n    if (foundKey !== null) {\n      return this.get(key);\n    }\n    return undefined;\n  }\n\n  /**\n   * Find keys within distance of center point (O(log n + k) where k is result count)\n   * Returns empty array if no keys found in range\n   */\n  findNearestInRange(center: K, distance: K): Array<{ key: K; value: V }> {\n    const nearestKeys = this.tree.findNearestInRange(center, distance);\n    const result: Array<{ key: K; value: V }> = [];\n\n    for (const key of nearestKeys) {\n      const value = this.get(key);\n      if (value !== undefined) {\n        result.push({ key, value });\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Find all key-value pairs in range [start, end] (O(log n + k) where k is result count)\n   */\n  findRange(start: K, end: K): Array<{ key: K; value: V }> {\n    const keys = this.tree.findRange(start, end);\n    const result: Array<{ key: K; value: V }> = [];\n\n    for (const key of keys) {\n      const value = this.get(key);\n      if (value !== undefined) {\n        result.push({ key, value });\n      }\n    }\n\n    return result;\n  }\n\n  /**\n   * Get all keys in sorted order (O(n))\n   */\n  getSortedKeys(): ReadonlyArray<K> {\n    return this.tree.getAllSorted();\n  }\n\n  has(key: K): boolean {\n    return this.cache.has(key);\n  }\n\n  delete(key: K): boolean {\n    const deleted = this.cache.delete(key);\n    if (deleted) {\n      this.tree.delete(key);\n    }\n    return deleted;\n  }\n\n  clear(): void {\n    this.cache.clear();\n    this.tree = new RedBlackTree(this.compareFn);\n  }\n\n  get size(): number {\n    return this.cache.size;\n  }\n}\n"],"mappings":";;;;AAGA,IAAa,WAAb,MAA4B;CAI1B,YAAY,SAAiB;+BAHb,IAAI,KAAW;AAI7B,OAAK,UAAU;;CAGjB,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI;AACjC,MAAI,UAAU,QAAW;AAEvB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,MAAM;;AAE5B,SAAO;;CAGT,IAAI,KAAQ,OAAgB;AAC1B,MAAI,KAAK,MAAM,IAAI,IAAI,CACrB,MAAK,MAAM,OAAO,IAAI;WACb,KAAK,MAAM,QAAQ,KAAK,SAAS;GAE1C,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC;AAC1C,OAAI,aAAa,OACf,MAAK,MAAM,OAAO,SAAS;;AAG/B,OAAK,MAAM,IAAI,KAAK,MAAM;;CAG5B,IAAI,KAAiB;AACnB,SAAO,KAAK,MAAM,IAAI,IAAI;;CAG5B,OAAO,KAAiB;AACtB,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;;CAGpB,IAAI,OAAe;AACjB,SAAO,KAAK,MAAM;;CAGpB,OAA4B;AAC1B,SAAO,KAAK,MAAM,MAAM;;;;;;;AAQ5B,IAAa,oBAAb,MAAkC;CAOhC,YAAY,cAAsB;+BANlB,IAAI,KAA8B;+BAClC,IAAI,KAAgB;sCACb,IAAI,KAAQ;qBACb;AAIpB,OAAK,eAAe;;CAGtB,IAAI,KAA0C;EAC5C,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI;AACjC,MAAI,OAAO;GAET,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,MAAM;AAC1B,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,KAAK;;AAE3B,SAAO;;CAGT,IAAI,KAAQ,OAAmC;AAE7C,MAAI,KAAK,MAAM,IAAI,IAAI,EAAE;GACvB,MAAM,UAAU,KAAK,MAAM,IAAI,IAAI,IAAI;AACvC,QAAK,eAAe;AACpB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,aAAa,OAAO,IAAI;;EAI/B,MAAM,sBAAsB,MACzB,MAAM,WAAW;AAKhB,OAAI,CAAC,KAAK,MAAM,IAAI,IAAI,CAAE,QAAO;GAEjC,MAAM,aAAa,OAAO;AAC1B,QAAK,MAAM,IAAI,KAAK,WAAW;AAC/B,QAAK,eAAe;AACpB,QAAK,aAAa,IAAI,IAAI;AAG1B,QAAK,kBAAkB;AAEvB,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,aAAa,OAAO,IAAI;AAC7B,SAAM;IACN;AAOJ,sBAAoB,YAAY,GAAG;AAEnC,OAAK,MAAM,IAAI,KAAK,oBAAoB;;CAG1C,AAAQ,mBAAyB;AAC/B,SAAO,KAAK,cAAc,KAAK,gBAAgB,KAAK,MAAM,OAAO,GAAG;GAElE,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC;AAC1C,OAAI,aAAa,QAAW;IAC1B,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS,IAAI;AACzC,SAAK,eAAe;AACpB,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,aAAa,OAAO,SAAS;AAGlC,QAAI,SAAS,EAAG;SAEhB;;;CAKN,IAAI,KAAiB;AACnB,SAAO,KAAK,aAAa,IAAI,IAAI;;CAGnC,OAAO,KAAiB;EACtB,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,OAAK,eAAe;AACpB,OAAK,MAAM,OAAO,IAAI;AACtB,OAAK,aAAa,OAAO,IAAI;AAC7B,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;AAClB,OAAK,MAAM,OAAO;AAClB,OAAK,aAAa,OAAO;AACzB,OAAK,cAAc;;CAGrB,IAAI,OAAe;AACjB,SAAO,KAAK,MAAM;;CAGpB,IAAI,mBAA2B;AAC7B,SAAO,KAAK;;CAGd,IAAI,UAAkB;AACpB,SAAO,KAAK"}
+{"version":3,"file":"LRUCache.js","names":[],"sources":["../../src/utils/LRUCache.ts"],"mappings":";;;;AAGA,IAAa,WAAb,MAA4B;CAI1B,YAAY,SAAiB;+BAHb,IAAI,KAAW;AAI7B,OAAK,UAAU;;CAGjB,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI;AACjC,MAAI,UAAU,KAAA,GAAW;AAEvB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,MAAM;;AAE5B,SAAO;;CAGT,IAAI,KAAQ,OAAgB;AAC1B,MAAI,KAAK,MAAM,IAAI,IAAI,CACrB,MAAK,MAAM,OAAO,IAAI;WACb,KAAK,MAAM,QAAQ,KAAK,SAAS;GAE1C,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC;AAC1C,OAAI,aAAa,KAAA,EACf,MAAK,MAAM,OAAO,SAAS;;AAG/B,OAAK,MAAM,IAAI,KAAK,MAAM;;CAG5B,IAAI,KAAiB;AACnB,SAAO,KAAK,MAAM,IAAI,IAAI;;CAG5B,OAAO,KAAiB;AACtB,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;;CAGpB,IAAI,OAAe;AACjB,SAAO,KAAK,MAAM;;CAGpB,OAA4B;AAC1B,SAAO,KAAK,MAAM,MAAM;;;;;;;AAQ5B,IAAa,oBAAb,MAAkC;CAOhC,YAAY,cAAsB;+BANlB,IAAI,KAA8B;+BAClC,IAAI,KAAgB;sCACb,IAAI,KAAQ;qBACb;AAIpB,OAAK,eAAe;;CAGtB,IAAI,KAA0C;EAC5C,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI;AACjC,MAAI,OAAO;GAET,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,MAAM;AAC1B,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,IAAI,KAAK,KAAK;;AAE3B,SAAO;;CAGT,IAAI,KAAQ,OAAmC;AAE7C,MAAI,KAAK,MAAM,IAAI,IAAI,EAAE;GACvB,MAAM,UAAU,KAAK,MAAM,IAAI,IAAI,IAAI;AACvC,QAAK,eAAe;AACpB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,aAAa,OAAO,IAAI;;EAI/B,MAAM,sBAAsB,MACzB,MAAM,WAAW;AAKhB,OAAI,CAAC,KAAK,MAAM,IAAI,IAAI,CAAE,QAAO;GAEjC,MAAM,aAAa,OAAO;AAC1B,QAAK,MAAM,IAAI,KAAK,WAAW;AAC/B,QAAK,eAAe;AACpB,QAAK,aAAa,IAAI,IAAI;AAG1B,QAAK,kBAAkB;AAEvB,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,aAAa,OAAO,IAAI;AAC7B,SAAM;IACN;AAOJ,sBAAoB,YAAY,GAAG;AAEnC,OAAK,MAAM,IAAI,KAAK,oBAAoB;;CAG1C,mBAAiC;AAC/B,SAAO,KAAK,cAAc,KAAK,gBAAgB,KAAK,MAAM,OAAO,GAAG;GAElE,MAAM,WAAW,KAAK,MAAM,MAAM,CAAC,MAAM,CAAC;AAC1C,OAAI,aAAa,KAAA,GAAW;IAC1B,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS,IAAI;AACzC,SAAK,eAAe;AACpB,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,aAAa,OAAO,SAAS;AAGlC,QAAI,SAAS,EAAG;SAEhB;;;CAKN,IAAI,KAAiB;AACnB,SAAO,KAAK,aAAa,IAAI,IAAI;;CAGnC,OAAO,KAAiB;EACtB,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,OAAK,eAAe;AACpB,OAAK,MAAM,OAAO,IAAI;AACtB,OAAK,aAAa,OAAO,IAAI;AAC7B,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;AAClB,OAAK,MAAM,OAAO;AAClB,OAAK,aAAa,OAAO;AACzB,OAAK,cAAc;;CAGrB,IAAI,OAAe;AACjB,SAAO,KAAK,MAAM;;CAGpB,IAAI,mBAA2B;AAC7B,SAAO,KAAK;;CAGd,IAAI,UAAkB;AACpB,SAAO,KAAK"}

package/dist/utils/frameTime.js

@@ -1,15 +1,8 @@
-//#region src/utils/frameTime.ts
-/**
-* Frame timing utilities for quantizing time values to frame boundaries.
-* These utilities ensure consistent frame-aligned timing across the codebase.
-*/
-/** Default FPS when none is specified */
-const DEFAULT_FPS = 30;
 /**
 * Calculate the duration of a single frame in milliseconds.
 */
 function calculateFrameIntervalMs(fps) {
-	if (fps <= 0) return 1e3 / DEFAULT_FPS;
+	if (fps <= 0) return 1e3 / 30;
 	return 1e3 / fps;
 }
 /**
@@ -30,7 +23,7 @@ function quantizeToFrameTimeS(timeSeconds, fps) {
 	const frameDurationS = 1 / fps;
 	return Math.round(timeSeconds / frameDurationS) * frameDurationS;
 }
-
 //#endregion
 export { quantizeToFrameTimeMs, quantizeToFrameTimeS };
+
 //# sourceMappingURL=frameTime.js.map

package/dist/utils/frameTime.js.map

@@ -1 +1 @@
-{"version":3,"file":"frameTime.js","names":[],"sources":["../../src/utils/frameTime.ts"],"sourcesContent":["/**\n * Frame timing utilities for quantizing time values to frame boundaries.\n * These utilities ensure consistent frame-aligned timing across the codebase.\n */\n\n/** Default FPS when none is specified */\nexport const DEFAULT_FPS = 30;\n\n/**\n * Calculate the duration of a single frame in milliseconds.\n */\nexport function calculateFrameIntervalMs(fps: number): number {\n  if (fps <= 0) return 1000 / DEFAULT_FPS;\n  return 1000 / fps;\n}\n\n/**\n * Quantize a time value (in milliseconds) to the nearest frame boundary.\n * This ensures frame markers align perfectly with playhead position.\n */\nexport function quantizeToFrameTimeMs(timeMs: number, fps: number): number {\n  if (!fps || fps <= 0) return timeMs;\n  const frameDurationMs = calculateFrameIntervalMs(fps);\n  return Math.round(timeMs / frameDurationMs) * frameDurationMs;\n}\n\n/**\n * Quantize a time value (in seconds) to the nearest frame boundary.\n * This ensures time values align with frame boundaries for consistent rendering.\n */\nexport function quantizeToFrameTimeS(timeSeconds: number, fps: number): number {\n  if (!fps || fps <= 0) return timeSeconds;\n  const frameDurationS = 1 / fps;\n  return Math.round(timeSeconds / frameDurationS) * frameDurationS;\n}\n\n/**\n * Clamp and quantize a seek time to valid range.\n * Prevents \"Sample not found\" errors at video boundaries.\n *\n * @param desiredSeekTimeMs - The desired seek time in milliseconds\n * @param durationMs - The total duration in milliseconds\n * @param fps - Frames per second (defaults to 30)\n * @returns Clamped and quantized time in milliseconds\n */\nexport function clampAndQuantizeSeekTimeMs(\n  desiredSeekTimeMs: number,\n  durationMs: number,\n  fps: number = DEFAULT_FPS,\n): number {\n  if (durationMs <= 0) return 0;\n\n  // Quantize to frame boundaries\n  const quantizedMs = quantizeToFrameTimeMs(desiredSeekTimeMs, fps);\n\n  // Clamp to valid range [0, lastFrameTime]\n  // The last valid frame is at durationMs - frameDurationMs to ensure we don't\n  // seek past the last decodable frame\n  const frameDurationMs = calculateFrameIntervalMs(fps);\n  const maxValidTime = Math.max(0, durationMs - frameDurationMs);\n  return Math.max(0, Math.min(quantizedMs, maxValidTime));\n}\n"],"mappings":";;;;;;AAMA,MAAa,cAAc;;;;AAK3B,SAAgB,yBAAyB,KAAqB;AAC5D,KAAI,OAAO,EAAG,QAAO,MAAO;AAC5B,QAAO,MAAO;;;;;;AAOhB,SAAgB,sBAAsB,QAAgB,KAAqB;AACzE,KAAI,CAAC,OAAO,OAAO,EAAG,QAAO;CAC7B,MAAM,kBAAkB,yBAAyB,IAAI;AACrD,QAAO,KAAK,MAAM,SAAS,gBAAgB,GAAG;;;;;;AAOhD,SAAgB,qBAAqB,aAAqB,KAAqB;AAC7E,KAAI,CAAC,OAAO,OAAO,EAAG,QAAO;CAC7B,MAAM,iBAAiB,IAAI;AAC3B,QAAO,KAAK,MAAM,cAAc,eAAe,GAAG"}
+{"version":3,"file":"frameTime.js","names":[],"sources":["../../src/utils/frameTime.ts"],"mappings":";;;AAWA,SAAgB,yBAAyB,KAAqB;AAC5D,KAAI,OAAO,EAAG,QAAO,MAAA;AACrB,QAAO,MAAO;;;;;;AAOhB,SAAgB,sBAAsB,QAAgB,KAAqB;AACzE,KAAI,CAAC,OAAO,OAAO,EAAG,QAAO;CAC7B,MAAM,kBAAkB,yBAAyB,IAAI;AACrD,QAAO,KAAK,MAAM,SAAS,gBAAgB,GAAG;;;;;;AAOhD,SAAgB,qBAAqB,aAAqB,KAAqB;AAC7E,KAAI,CAAC,OAAO,OAAO,EAAG,QAAO;CAC7B,MAAM,iBAAiB,IAAI;AAC3B,QAAO,KAAK,MAAM,cAAc,eAAe,GAAG"}

package/dist/version.js

@@ -1,7 +1,7 @@
 //#region src/version.ts
-const version = "0.47.2";
+const version = "0.48.1";
 globalThis.__EF_VERSION__ = version;
-
 //#endregion
 export { version };
+
 //# sourceMappingURL=version.js.map

package/dist/version.js.map

@@ -1 +1 @@
-{"version":3,"file":"version.js","names":["version: string"],"sources":["../src/version.ts"],"sourcesContent":["declare const __EF_VERSION__: string;\n\nexport const version: string = __EF_VERSION__;\n\n(globalThis as any).__EF_VERSION__ = version;\n"],"mappings":";AAEA,MAAaA;AAEb,AAAC,WAAmB,iBAAiB"}
+{"version":3,"file":"version.js","names":[],"sources":["../src/version.ts"],"mappings":";AAEA,MAAa,UAAA;AAEb,WAAoB,iBAAiB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@editframe/elements",
-  "version": "0.47.2",
+  "version": "0.48.1",
   "description": "",
   "repository": {
     "type": "git",
@@ -24,7 +24,7 @@
   ],
   "dependencies": {
     "@bramus/style-observer": "^1.3.0",
-    "@editframe/assets": "0.47.2",
+    "@editframe/assets": "0.48.1",
     "@lit/context": "^1.1.6",
     "@opentelemetry/api": "^1.9.0",
     "@opentelemetry/context-zone": "^1.26.0",
@@ -115,6 +115,7 @@
       "./types.json": "./types.json"
     }
   },
-  "main": "./dist/index.js",
-  "module": "./dist/index.js"
+  "inlinedDependencies": {
+    "lit-html": "3.3.1"
+  }
 }