@editframe/elements 0.37.3-beta → 0.38.1

package/dist/style.css

@@ -1,5 +1,8 @@
+/* Import theme tokens first so they're available to all components */
+@import "./gui/ef-theme.css";
+
 /* biome-ignore lint/suspicious/noUnknownAtRules: @tailwind is a valid Tailwind CSS directive */
-*, ::before, ::after {
+*, ::before, ::after{
   --tw-border-spacing-x: 0;
   --tw-border-spacing-y: 0;
   --tw-translate-x: 0;
@@ -52,7 +55,7 @@
   --tw-contain-paint:  ;
   --tw-contain-style:  ;
 }
-::backdrop {
+::backdrop{
   --tw-border-spacing-x: 0;
   --tw-border-spacing-y: 0;
   --tw-translate-x: 0;
@@ -433,348 +436,296 @@ video {
   display: none;
 }
 /* biome-ignore lint/suspicious/noUnknownAtRules: @tailwind is a valid Tailwind CSS directive */
-.\!container {
+.\!container{
   width: 100% !important;
 }
-.container {
+.container{
   width: 100%;
 }
-@media (min-width: 640px) {
-  .\!container {
+@media (min-width: 640px){
+  .\!container{
     max-width: 640px !important;
   }
-  .container {
+  .container{
     max-width: 640px;
   }
 }
-@media (min-width: 768px) {
-  .\!container {
+@media (min-width: 768px){
+  .\!container{
     max-width: 768px !important;
   }
-  .container {
+  .container{
     max-width: 768px;
   }
 }
-@media (min-width: 1024px) {
-  .\!container {
+@media (min-width: 1024px){
+  .\!container{
     max-width: 1024px !important;
   }
-  .container {
+  .container{
     max-width: 1024px;
   }
 }
-@media (min-width: 1280px) {
-  .\!container {
+@media (min-width: 1280px){
+  .\!container{
     max-width: 1280px !important;
   }
-  .container {
+  .container{
     max-width: 1280px;
   }
 }
-@media (min-width: 1536px) {
-  .\!container {
+@media (min-width: 1536px){
+  .\!container{
     max-width: 1536px !important;
   }
-  .container {
+  .container{
     max-width: 1536px;
   }
 }
 /* biome-ignore lint/suspicious/noUnknownAtRules: @tailwind is a valid Tailwind CSS directive */
-.\!visible {
-  visibility: visible !important;
-}
-.visible {
+.visible{
   visibility: visible;
 }
-.invisible {
+.invisible{
   visibility: hidden;
 }
-.collapse {
+.collapse{
   visibility: collapse;
 }
-.static {
+.static{
   position: static;
 }
-.fixed {
+.fixed{
   position: fixed;
 }
-.absolute {
+.absolute{
   position: absolute;
 }
-.relative {
+.relative{
   position: relative;
 }
-.sticky {
+.sticky{
   position: sticky;
 }
-.inset-0 {
+.inset-0{
   inset: 0px;
 }
-.left-0 {
+.left-0{
   left: 0px;
 }
-.top-0 {
+.right-0{
+  right: 0px;
+}
+.top-0{
   top: 0px;
 }
-.isolate {
+.top-8{
+  top: 2rem;
+}
+.isolate{
   isolation: isolate;
 }
-.z-\[5\] {
+.z-\[5\]{
   z-index: 5;
 }
-.mb-0 {
+.mb-0{
   margin-bottom: 0px;
 }
-.mb-\[1px\] {
+.mb-\[1px\]{
   margin-bottom: 1px;
 }
-.block {
+.block{
   display: block;
 }
-.inline-block {
+.inline-block{
   display: inline-block;
 }
-.inline {
+.inline{
   display: inline;
 }
-.flex {
+.flex{
   display: flex;
 }
-.inline-flex {
+.inline-flex{
   display: inline-flex;
 }
-.table {
+.table{
   display: table;
 }
-.grid {
+.grid{
   display: grid;
 }
-.inline-grid {
+.inline-grid{
   display: inline-grid;
 }
-.contents {
+.contents{
   display: contents;
 }
-.hidden {
+.hidden{
   display: none;
 }
-.size-full {
+.size-full{
   width: 100%;
   height: 100%;
 }
-.h-\[1\.1rem\] {
+.h-\[1\.1rem\]{
   height: 1.1rem;
 }
-.h-\[1080px\] {
+.h-\[1080px\]{
   height: 1080px;
 }
-.h-\[200px\] {
-  height: 200px;
-}
-.h-\[270px\] {
-  height: 270px;
-}
-.h-\[300px\] {
-  height: 300px;
-}
-.h-\[360px\] {
-  height: 360px;
-}
-.h-\[400px\] {
-  height: 400px;
-}
-.h-\[500px\] {
+.h-\[500px\]{
   height: 500px;
 }
-.h-\[5px\] {
+.h-\[5px\]{
   height: 5px;
 }
-.h-full {
+.h-\[calc\(50vh-4rem\)\]{
+  height: calc(50vh - 4rem);
+}
+.h-full{
   height: 100%;
 }
-.w-1 {
+.w-1{
   width: 0.25rem;
 }
-.w-\[1000px\] {
+.w-\[1000px\]{
   width: 1000px;
 }
-.w-\[1080px\] {
-  width: 1080px;
-}
-.w-\[1920px\] {
+.w-\[1920px\]{
   width: 1920px;
 }
-.w-\[200px\] {
-  width: 200px;
-}
-.w-\[420px\] {
+.w-\[420px\]{
   width: 420px;
 }
-.w-\[480px\] {
-  width: 480px;
-}
-.w-\[600px\] {
-  width: 600px;
-}
-.w-\[640px\] {
-  width: 640px;
-}
-.w-full {
+.w-full{
   width: 100%;
 }
-.flex-shrink {
+.flex-1{
+  flex: 1 1 0%;
+}
+.flex-shrink{
   flex-shrink: 1;
 }
-.shrink {
+.shrink{
   flex-shrink: 1;
 }
-.\!transform {
+.\!transform{
   transform: translate(var(--tw-translate-x), var(--tw-translate-y)) rotate(var(--tw-rotate)) skewX(var(--tw-skew-x)) skewY(var(--tw-skew-y)) scaleX(var(--tw-scale-x)) scaleY(var(--tw-scale-y)) !important;
 }
-.transform {
+.transform{
   transform: translate(var(--tw-translate-x), var(--tw-translate-y)) rotate(var(--tw-rotate)) skewX(var(--tw-skew-x)) skewY(var(--tw-skew-y)) scaleX(var(--tw-scale-x)) scaleY(var(--tw-scale-y));
 }
-.cursor-grabbing {
-  cursor: grabbing;
-}
-.cursor-pointer {
-  cursor: pointer;
-}
-.resize {
+.resize{
   resize: both;
 }
-.flex-row {
-  flex-direction: row;
-}
-.flex-wrap {
+.flex-wrap{
   flex-wrap: wrap;
 }
-.items-center {
+.items-center{
   align-items: center;
 }
-.gap-2 {
-  gap: 0.5rem;
-}
-.overflow-hidden {
+.overflow-hidden{
   overflow: hidden;
 }
-.overflow-visible {
+.overflow-visible{
   overflow: visible;
 }
-.whitespace-nowrap {
+.whitespace-nowrap{
   white-space: nowrap;
 }
-.text-nowrap {
+.text-nowrap{
   text-wrap: nowrap;
 }
-.rounded {
+.rounded{
   border-radius: 0.25rem;
 }
-.border {
+.border{
   border-width: 1px;
 }
-.bg-black {
-  --tw-bg-opacity: 1;
-  background-color: rgb(0 0 0 / var(--tw-bg-opacity, 1));
-}
-.bg-lime-400 {
-  --tw-bg-opacity: 1;
-  background-color: rgb(163 230 53 / var(--tw-bg-opacity, 1));
-}
-.bg-slate-500 {
+.bg-slate-500{
   --tw-bg-opacity: 1;
   background-color: rgb(100 116 139 / var(--tw-bg-opacity, 1));
 }
-.bg-yellow-400 {
-  --tw-bg-opacity: 1;
-  background-color: rgb(250 204 21 / var(--tw-bg-opacity, 1));
-}
-.object-contain {
-  -o-object-fit: contain;
-     object-fit: contain;
+.object-cover{
+  -o-object-fit: cover;
+     object-fit: cover;
 }
-.p-4 {
-  padding: 1rem;
-}
-.px-0\.5 {
+.px-0\.5{
   padding-left: 0.125rem;
   padding-right: 0.125rem;
 }
-.text-center {
+.text-center{
   text-align: center;
 }
-.text-\[8px\] {
+.text-3xl{
+  font-size: 1.875rem;
+  line-height: 2.25rem;
+}
+.text-\[8px\]{
   font-size: 8px;
 }
-.text-sm {
+.text-sm{
   font-size: 0.875rem;
   line-height: 1.25rem;
 }
-.text-xs {
+.text-xs{
   font-size: 0.75rem;
   line-height: 1rem;
 }
-.font-bold {
+.font-bold{
   font-weight: 700;
 }
-.uppercase {
+.uppercase{
   text-transform: uppercase;
 }
-.capitalize {
+.capitalize{
   text-transform: capitalize;
 }
-.italic {
+.italic{
   font-style: italic;
 }
-.text-black {
-  --tw-text-opacity: 1;
-  color: rgb(0 0 0 / var(--tw-text-opacity, 1));
-}
-.text-green-200 {
-  --tw-text-opacity: 1;
-  color: rgb(187 247 208 / var(--tw-text-opacity, 1));
-}
-.text-green-900 {
+.text-white{
   --tw-text-opacity: 1;
-  color: rgb(20 83 45 / var(--tw-text-opacity, 1));
+  color: rgb(255 255 255 / var(--tw-text-opacity, 1));
 }
-.opacity-50 {
+.opacity-50{
   opacity: 0.5;
 }
-.shadow {
+.shadow{
   --tw-shadow: 0 1px 3px 0 rgb(0 0 0 / 0.1), 0 1px 2px -1px rgb(0 0 0 / 0.1);
   --tw-shadow-colored: 0 1px 3px 0 var(--tw-shadow-color), 0 1px 2px -1px var(--tw-shadow-color);
   box-shadow: var(--tw-ring-offset-shadow, 0 0 #0000), var(--tw-ring-shadow, 0 0 #0000), var(--tw-shadow);
 }
-.outline {
+.outline{
   outline-style: solid;
 }
-.blur {
+.blur{
   --tw-blur: blur(8px);
   filter: var(--tw-blur) var(--tw-brightness) var(--tw-contrast) var(--tw-grayscale) var(--tw-hue-rotate) var(--tw-invert) var(--tw-saturate) var(--tw-sepia) var(--tw-drop-shadow);
 }
-.drop-shadow {
-  --tw-drop-shadow: drop-shadow(0 1px 2px rgb(0 0 0 / 0.1)) drop-shadow(0 1px 1px rgb(0 0 0 / 0.06));
+.grayscale{
+  --tw-grayscale: grayscale(100%);
   filter: var(--tw-blur) var(--tw-brightness) var(--tw-contrast) var(--tw-grayscale) var(--tw-hue-rotate) var(--tw-invert) var(--tw-saturate) var(--tw-sepia) var(--tw-drop-shadow);
 }
-.filter {
+.filter{
   filter: var(--tw-blur) var(--tw-brightness) var(--tw-contrast) var(--tw-grayscale) var(--tw-hue-rotate) var(--tw-invert) var(--tw-saturate) var(--tw-sepia) var(--tw-drop-shadow);
 }
-.backdrop-filter {
+.backdrop-filter{
   backdrop-filter: var(--tw-backdrop-blur) var(--tw-backdrop-brightness) var(--tw-backdrop-contrast) var(--tw-backdrop-grayscale) var(--tw-backdrop-hue-rotate) var(--tw-backdrop-invert) var(--tw-backdrop-opacity) var(--tw-backdrop-saturate) var(--tw-backdrop-sepia);
 }
-.transition {
+.transition{
   transition-property: color, background-color, border-color, text-decoration-color, fill, stroke, opacity, box-shadow, transform, filter, backdrop-filter;
   transition-timing-function: cubic-bezier(0.4, 0, 0.2, 1);
   transition-duration: 150ms;
 }
-.ease-in {
+.ease-in{
   transition-timing-function: cubic-bezier(0.4, 0, 1, 1);
 }
-.ease-in-out {
+.ease-in-out{
   transition-timing-function: cubic-bezier(0.4, 0, 0.2, 1);
 }
-.ease-out {
+.ease-out{
   transition-timing-function: cubic-bezier(0, 0, 0.2, 1);
 }
 

package/dist/transcoding/cache/RequestDeduplicator.js

@@ -17,6 +17,7 @@ var RequestDeduplicator = class {
 		if (existingRequest) return existingRequest;
 		const requestPromise = requestFactory();
 		this.pendingRequests.set(key, requestPromise);
+		requestPromise.catch(() => {});
 		try {
 			const result = await requestPromise;
 			this.pendingRequests.delete(key);

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>(\n    key: string,\n    requestFactory: () => Promise<T>,\n  ): 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    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,eACJ,KACA,gBACY;EAEZ,MAAM,kBAAkB,KAAK,gBAAgB,IAAI,IAAI;AACrD,MAAI,gBACF,QAAO;EAIT,MAAM,iBAAiB,gBAAgB;AACvC,OAAK,gBAAgB,IAAI,KAAK,eAAe;AAE7C,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"],"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>(\n    key: string,\n    requestFactory: () => Promise<T>,\n  ): 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,eACJ,KACA,gBACY;EAEZ,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/types/index.d.ts

@@ -40,7 +40,7 @@ interface MediaEngine {
     id?: RenditionId;
     trackId: number | undefined;
     src: string;
-  }, signal?: AbortSignal) => Promise<ArrayBuffer>;
+  }, signal: AbortSignal) => Promise<ArrayBuffer>;
   computeSegmentId: (desiredSeekTimeMs: number, rendition: MediaRendition) => number | undefined;
   /**
    * Get the video rendition if available, otherwise return undefined.

package/dist/transcoding/utils/UrlGenerator.js

@@ -15,10 +15,17 @@ var UrlGenerator = class {
 	generateSegmentUrl(segmentId, renditionId, metadata) {
 		const audioRendition = metadata.audioRendition;
 		const videoRendition = metadata.videoRendition;
-		const rendition = audioRendition ?? videoRendition;
+		let rendition;
+		if (renditionId === "audio") rendition = audioRendition;
+		else rendition = videoRendition;
 		if (!rendition) {
-			console.error("Rendition not found", metadata);
-			throw new Error(`Rendition ${renditionId} not found`);
+			console.error("Rendition not found", {
+				renditionId,
+				hasAudio: !!audioRendition,
+				hasVideo: !!videoRendition,
+				metadata
+			});
+			throw new Error(`Rendition ${renditionId} not found (hasAudio=${!!audioRendition}, hasVideo=${!!videoRendition})`);
 		}
 		return (segmentId === "init" ? metadata.templates.initSegment : metadata.templates.mediaSegment).replace("{rendition}", renditionId).replace("{segmentId}", segmentId.toString()).replace("{src}", metadata.src).replace("{trackId}", rendition.trackId?.toString() ?? "");
 	}

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\nimport type { RenditionId } from \"../types/index.js\";\nimport type { MediaEngine } from \"../types/index.ts\";\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 video segment URL\n   */\n  generateSegmentUrl(\n    segmentId: \"init\" | number,\n    renditionId: RenditionId,\n    metadata: MediaEngine,\n  ): string {\n    const audioRendition = metadata.audioRendition;\n    const videoRendition = metadata.videoRendition;\n    const rendition = audioRendition ?? videoRendition;\n    if (!rendition) {\n      console.error(\"Rendition not found\", metadata);\n      throw new Error(`Rendition ${renditionId} not found`);\n    }\n\n    const template =\n      segmentId === \"init\"\n        ? metadata.templates.initSegment\n        : metadata.templates.mediaSegment;\n    return template\n      .replace(\"{rendition}\", renditionId)\n      .replace(\"{segmentId}\", segmentId.toString())\n      .replace(\"{src}\", metadata.src)\n      .replace(\"{trackId}\", rendition.trackId?.toString() ?? \"\");\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 track fragment index URL using production API format\n   * @deprecated Use MD5-based URL generation in AssetMediaEngine.fetch() instead\n   */\n  generateTrackFragmentIndexUrl(mediaUrl: string): string {\n    // Normalize the path: remove leading slash and any double slashes\n    let normalizedSrc = mediaUrl.startsWith(\"/\")\n      ? mediaUrl.slice(1)\n      : mediaUrl;\n    // Remove any remaining leading slashes (handles cases like \"//assets/video.mp4\")\n    normalizedSrc = normalizedSrc.replace(/^\\/+/, \"\");\n    // Legacy format - kept for backward compatibility but should not be used\n    return `@ef-track-fragment-index/${normalizedSrc}`;\n  }\n\n  /**\n   * Generate quality presets URL\n   */\n  generatePresetsUrl(): string {\n    return `${this.baseUrl()}/api/v1/transcode/presets`;\n  }\n}\n"],"mappings":";AAOA,IAAa,eAAb,MAA0B;CACxB,YAAY,AAAQA,SAAuB;EAAvB;;;;;CAKpB,aAAqB;AACnB,SAAO,KAAK,SAAS;;;;;CAMvB,mBACE,WACA,aACA,UACQ;EACR,MAAM,iBAAiB,SAAS;EAChC,MAAM,iBAAiB,SAAS;EAChC,MAAM,YAAY,kBAAkB;AACpC,MAAI,CAAC,WAAW;AACd,WAAQ,MAAM,uBAAuB,SAAS;AAC9C,SAAM,IAAI,MAAM,aAAa,YAAY,YAAY;;AAOvD,UAHE,cAAc,SACV,SAAS,UAAU,cACnB,SAAS,UAAU,cAEtB,QAAQ,eAAe,YAAY,CACnC,QAAQ,eAAe,UAAU,UAAU,CAAC,CAC5C,QAAQ,SAAS,SAAS,IAAI,CAC9B,QAAQ,aAAa,UAAU,SAAS,UAAU,IAAI,GAAG;;;;;CAM9D,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;;;;;;CAO7F,8BAA8B,UAA0B;EAEtD,IAAI,gBAAgB,SAAS,WAAW,IAAI,GACxC,SAAS,MAAM,EAAE,GACjB;AAEJ,kBAAgB,cAAc,QAAQ,QAAQ,GAAG;AAEjD,SAAO,4BAA4B;;;;;CAMrC,qBAA6B;AAC3B,SAAO,GAAG,KAAK,SAAS,CAAC"}
+{"version":3,"file":"UrlGenerator.js","names":["baseUrl: () => string"],"sources":["../../../src/transcoding/utils/UrlGenerator.ts"],"sourcesContent":["/**\n * URL generation utilities for transcoding endpoints\n */\n\nimport type { RenditionId } from \"../types/index.js\";\nimport type { MediaEngine } from \"../types/index.ts\";\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 video segment URL\n   */\n  generateSegmentUrl(\n    segmentId: \"init\" | number,\n    renditionId: RenditionId,\n    metadata: MediaEngine,\n  ): string {\n    // Determine which rendition to use based on renditionId\n    // Audio renditions: \"audio\"\n    // Video renditions: \"high\", \"scrub\", \"low\", \"medium\", etc.\n    const audioRendition = metadata.audioRendition;\n    const videoRendition = metadata.videoRendition;\n\n    let rendition;\n    if (renditionId === \"audio\") {\n      rendition = audioRendition;\n    } else {\n      // For all other rendition IDs (high, scrub, low, medium), use video rendition\n      rendition = videoRendition;\n    }\n\n    if (!rendition) {\n      console.error(\"Rendition not found\", {\n        renditionId,\n        hasAudio: !!audioRendition,\n        hasVideo: !!videoRendition,\n        metadata,\n      });\n      throw new Error(\n        `Rendition ${renditionId} not found (hasAudio=${!!audioRendition}, hasVideo=${!!videoRendition})`,\n      );\n    }\n\n    const template =\n      segmentId === \"init\"\n        ? metadata.templates.initSegment\n        : metadata.templates.mediaSegment;\n    return template\n      .replace(\"{rendition}\", renditionId)\n      .replace(\"{segmentId}\", segmentId.toString())\n      .replace(\"{src}\", metadata.src)\n      .replace(\"{trackId}\", rendition.trackId?.toString() ?? \"\");\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 track fragment index URL using production API format\n   * @deprecated Use MD5-based URL generation in AssetMediaEngine.fetch() instead\n   */\n  generateTrackFragmentIndexUrl(mediaUrl: string): string {\n    // Normalize the path: remove leading slash and any double slashes\n    let normalizedSrc = mediaUrl.startsWith(\"/\") ? mediaUrl.slice(1) : mediaUrl;\n    // Remove any remaining leading slashes (handles cases like \"//assets/video.mp4\")\n    normalizedSrc = normalizedSrc.replace(/^\\/+/, \"\");\n    // Legacy format - kept for backward compatibility but should not be used\n    return `@ef-track-fragment-index/${normalizedSrc}`;\n  }\n\n  /**\n   * Generate quality presets URL\n   */\n  generatePresetsUrl(): string {\n    return `${this.baseUrl()}/api/v1/transcode/presets`;\n  }\n}\n"],"mappings":";AAOA,IAAa,eAAb,MAA0B;CACxB,YAAY,AAAQA,SAAuB;EAAvB;;;;;CAKpB,aAAqB;AACnB,SAAO,KAAK,SAAS;;;;;CAMvB,mBACE,WACA,aACA,UACQ;EAIR,MAAM,iBAAiB,SAAS;EAChC,MAAM,iBAAiB,SAAS;EAEhC,IAAI;AACJ,MAAI,gBAAgB,QAClB,aAAY;MAGZ,aAAY;AAGd,MAAI,CAAC,WAAW;AACd,WAAQ,MAAM,uBAAuB;IACnC;IACA,UAAU,CAAC,CAAC;IACZ,UAAU,CAAC,CAAC;IACZ;IACD,CAAC;AACF,SAAM,IAAI,MACR,aAAa,YAAY,uBAAuB,CAAC,CAAC,eAAe,aAAa,CAAC,CAAC,eAAe,GAChG;;AAOH,UAHE,cAAc,SACV,SAAS,UAAU,cACnB,SAAS,UAAU,cAEtB,QAAQ,eAAe,YAAY,CACnC,QAAQ,eAAe,UAAU,UAAU,CAAC,CAC5C,QAAQ,SAAS,SAAS,IAAI,CAC9B,QAAQ,aAAa,UAAU,SAAS,UAAU,IAAI,GAAG;;;;;CAM9D,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;;;;;;CAO7F,8BAA8B,UAA0B;EAEtD,IAAI,gBAAgB,SAAS,WAAW,IAAI,GAAG,SAAS,MAAM,EAAE,GAAG;AAEnE,kBAAgB,cAAc,QAAQ,QAAQ,GAAG;AAEjD,SAAO,4BAA4B;;;;;CAMrC,qBAA6B;AAC3B,SAAO,GAAG,KAAK,SAAS,CAAC"}

package/dist/utils/LRUCache.js

@@ -76,6 +76,7 @@ var SizeAwareLRUCache = class {
 			this.sizes.delete(key);
 			throw error;
 		});
+		sizeTrackingPromise.catch(() => {});
 		this.cache.set(key, sizeTrackingPromise);
 	}
 	evictIfNecessary() {

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) {\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) {\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\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 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    }\n\n    // Track the size when the promise resolves\n    const sizeTrackingPromise = value\n      .then((buffer) => {\n        const bufferSize = buffer.byteLength;\n        this.sizes.set(key, bufferSize);\n        this.currentSize += bufferSize;\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        throw error;\n      });\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) {\n        const size = this.sizes.get(firstKey) || 0;\n        this.currentSize -= size;\n        this.cache.delete(firstKey);\n        this.sizes.delete(firstKey);\n      } else {\n        break;\n      }\n    }\n  }\n\n  has(key: K): boolean {\n    return this.cache.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    return this.cache.delete(key);\n  }\n\n  clear(): void {\n    this.cache.clear();\n    this.sizes.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 (\n          sibling?.left?.color !== Color.RED &&\n          sibling?.right?.color !== Color.RED\n        ) {\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 (\n          sibling?.right?.color !== Color.RED &&\n          sibling?.left?.color !== Color.RED\n        ) {\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(\n    node: RBTreeNode<K> | null,\n    start: K,\n    end: K,\n    result: K[],\n  ): 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) {\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) {\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,OAAO;AAET,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,SACF,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;;;;;;;AAQtB,IAAa,oBAAb,MAAkC;CAMhC,YAAY,cAAsB;+BALlB,IAAI,KAA8B;+BAClC,IAAI,KAAgB;qBACd;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;;EAIxB,MAAM,sBAAsB,MACzB,MAAM,WAAW;GAChB,MAAM,aAAa,OAAO;AAC1B,QAAK,MAAM,IAAI,KAAK,WAAW;AAC/B,QAAK,eAAe;AAGpB,QAAK,kBAAkB;AAEvB,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,SAAM;IACN;AAEJ,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,UAAU;IACZ,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS,IAAI;AACzC,SAAK,eAAe;AACpB,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,SAAS;SAE3B;;;CAKN,IAAI,KAAiB;AACnB,SAAO,KAAK,MAAM,IAAI,IAAI;;CAG5B,OAAO,KAAiB;EACtB,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,OAAK,eAAe;AACpB,OAAK,MAAM,OAAO,IAAI;AACtB,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;AAClB,OAAK,MAAM,OAAO;AAClB,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"],"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) {\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) {\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\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 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    }\n\n    // Track the size when the promise resolves\n    const sizeTrackingPromise = value\n      .then((buffer) => {\n        const bufferSize = buffer.byteLength;\n        this.sizes.set(key, bufferSize);\n        this.currentSize += bufferSize;\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        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) {\n        const size = this.sizes.get(firstKey) || 0;\n        this.currentSize -= size;\n        this.cache.delete(firstKey);\n        this.sizes.delete(firstKey);\n      } else {\n        break;\n      }\n    }\n  }\n\n  has(key: K): boolean {\n    return this.cache.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    return this.cache.delete(key);\n  }\n\n  clear(): void {\n    this.cache.clear();\n    this.sizes.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 (\n          sibling?.left?.color !== Color.RED &&\n          sibling?.right?.color !== Color.RED\n        ) {\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 (\n          sibling?.right?.color !== Color.RED &&\n          sibling?.left?.color !== Color.RED\n        ) {\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(\n    node: RBTreeNode<K> | null,\n    start: K,\n    end: K,\n    result: K[],\n  ): 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) {\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) {\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,OAAO;AAET,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,SACF,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;;;;;;;AAQtB,IAAa,oBAAb,MAAkC;CAMhC,YAAY,cAAsB;+BALlB,IAAI,KAA8B;+BAClC,IAAI,KAAgB;qBACd;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;;EAIxB,MAAM,sBAAsB,MACzB,MAAM,WAAW;GAChB,MAAM,aAAa,OAAO;AAC1B,QAAK,MAAM,IAAI,KAAK,WAAW;AAC/B,QAAK,eAAe;AAGpB,QAAK,kBAAkB;AAEvB,UAAO;IACP,CACD,OAAO,UAAU;AAEhB,QAAK,MAAM,OAAO,IAAI;AACtB,QAAK,MAAM,OAAO,IAAI;AACtB,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,UAAU;IACZ,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS,IAAI;AACzC,SAAK,eAAe;AACpB,SAAK,MAAM,OAAO,SAAS;AAC3B,SAAK,MAAM,OAAO,SAAS;SAE3B;;;CAKN,IAAI,KAAiB;AACnB,SAAO,KAAK,MAAM,IAAI,IAAI;;CAG5B,OAAO,KAAiB;EACtB,MAAM,OAAO,KAAK,MAAM,IAAI,IAAI,IAAI;AACpC,OAAK,eAAe;AACpB,OAAK,MAAM,OAAO,IAAI;AACtB,SAAO,KAAK,MAAM,OAAO,IAAI;;CAG/B,QAAc;AACZ,OAAK,MAAM,OAAO;AAClB,OAAK,MAAM,OAAO;AAClB,OAAK,cAAc;;CAGrB,IAAI,OAAe;AACjB,SAAO,KAAK,MAAM;;CAGpB,IAAI,mBAA2B;AAC7B,SAAO,KAAK;;CAGd,IAAI,UAAkB;AACpB,SAAO,KAAK"}