@livekit/agents 1.0.48 → 1.1.0-dev.0

package/dist/inference/interruption/utils.cjs

@@ -0,0 +1,130 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var utils_exports = {};
+__export(utils_exports, {
+  BoundedCache: () => BoundedCache,
+  estimateProbability: () => estimateProbability
+});
+module.exports = __toCommonJS(utils_exports);
+var import_defaults = require("./defaults.cjs");
+class BoundedCache {
+  cache = /* @__PURE__ */ new Map();
+  maxLen;
+  constructor(maxLen = 10) {
+    this.maxLen = maxLen;
+  }
+  set(key, value) {
+    this.cache.set(key, value);
+    if (this.cache.size > this.maxLen) {
+      const firstKey = this.cache.keys().next().value;
+      this.cache.delete(firstKey);
+    }
+  }
+  /**
+   * Update existing value fields if present and defined.
+   * Mirrors python BoundedDict.update_value behavior.
+   */
+  updateValue(key, fields) {
+    const value = this.cache.get(key);
+    if (!value) return value;
+    for (const [fieldName, fieldValue] of Object.entries(fields)) {
+      if (fieldValue === void 0) continue;
+      if (fieldName in value) {
+        value[String(fieldName)] = fieldValue;
+      }
+    }
+    return value;
+  }
+  /**
+   * Set a new value with factory when missing; otherwise update in place.
+   * Mirrors python BoundedDict.set_or_update behavior.
+   */
+  setOrUpdate(key, factory, fields) {
+    if (!this.cache.has(key)) {
+      this.set(key, factory());
+    }
+    const result = this.updateValue(key, fields);
+    if (!result) {
+      throw new Error("setOrUpdate invariant failed: entry should exist after set");
+    }
+    return result;
+  }
+  get(key) {
+    return this.cache.get(key);
+  }
+  has(key) {
+    return this.cache.has(key);
+  }
+  delete(key) {
+    return this.cache.delete(key);
+  }
+  /**
+   * Pop an entry if it satisfies the predicate.
+   * - No predicate: pop oldest (FIFO)
+   * - With predicate: search in reverse order and pop first match
+   */
+  pop(predicate) {
+    if (predicate === void 0) {
+      const first = this.cache.entries().next().value;
+      if (!first) return void 0;
+      const [key, value] = first;
+      this.cache.delete(key);
+      return value;
+    }
+    const keys = Array.from(this.cache.keys());
+    for (let i = keys.length - 1; i >= 0; i--) {
+      const key = keys[i];
+      const value = this.cache.get(key);
+      if (predicate(value)) {
+        this.cache.delete(key);
+        return value;
+      }
+    }
+    return void 0;
+  }
+  clear() {
+    this.cache.clear();
+  }
+  get size() {
+    return this.cache.size;
+  }
+  values() {
+    return this.cache.values();
+  }
+  keys() {
+    return this.cache.keys();
+  }
+  entries() {
+    return this.cache.entries();
+  }
+}
+function estimateProbability(probabilities, windowSizeInS = import_defaults.MIN_INTERRUPTION_DURATION_IN_S) {
+  const nTh = Math.ceil(windowSizeInS / import_defaults.FRAME_DURATION_IN_S);
+  if (probabilities.length < nTh) {
+    return 0;
+  }
+  const sorted = [...probabilities].sort((a, b) => b - a);
+  return sorted[nTh - 1];
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  BoundedCache,
+  estimateProbability
+});
+//# sourceMappingURL=utils.cjs.map

package/dist/inference/interruption/utils.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/inference/interruption/utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: 2026 LiveKit, Inc.\n//\n// SPDX-License-Identifier: Apache-2.0\nimport { FRAME_DURATION_IN_S, MIN_INTERRUPTION_DURATION_IN_S } from './defaults.js';\n\n/**\n * A bounded cache that automatically evicts the oldest entries when the cache exceeds max size.\n * Uses FIFO eviction strategy.\n */\nexport class BoundedCache<K, V extends object> {\n  private cache: Map<K, V> = new Map();\n  private readonly maxLen: number;\n\n  constructor(maxLen: number = 10) {\n    this.maxLen = maxLen;\n  }\n\n  set(key: K, value: V): void {\n    this.cache.set(key, value);\n    if (this.cache.size > this.maxLen) {\n      // Remove the oldest entry (first inserted)\n      const firstKey = this.cache.keys().next().value as K;\n      this.cache.delete(firstKey);\n    }\n  }\n\n  /**\n   * Update existing value fields if present and defined.\n   * Mirrors python BoundedDict.update_value behavior.\n   */\n  updateValue(key: K, fields: Partial<V>): V | undefined {\n    const value = this.cache.get(key);\n    if (!value) return value;\n\n    for (const [fieldName, fieldValue] of Object.entries(fields) as [keyof V, V[keyof V]][]) {\n      if (fieldValue === undefined) continue;\n      // Runtime field update parity with python's hasattr + setattr.\n      if (fieldName in (value as object)) {\n        (value as Record<string, unknown>)[String(fieldName)] = fieldValue;\n      }\n    }\n    return value;\n  }\n\n  /**\n   * Set a new value with factory when missing; otherwise update in place.\n   * Mirrors python BoundedDict.set_or_update behavior.\n   */\n  setOrUpdate(key: K, factory: () => V, fields: Partial<V>): V {\n    if (!this.cache.has(key)) {\n      this.set(key, factory());\n    }\n    const result = this.updateValue(key, fields);\n    if (!result) {\n      throw new Error('setOrUpdate invariant failed: entry should exist after set');\n    }\n    return result;\n  }\n\n  get(key: K): V | undefined {\n    return this.cache.get(key);\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  /**\n   * Pop an entry if it satisfies the predicate.\n   * - No predicate: pop oldest (FIFO)\n   * - With predicate: search in reverse order and pop first match\n   */\n  pop(predicate?: (value: V) => boolean): V | undefined {\n    if (predicate === undefined) {\n      const first = this.cache.entries().next().value as [K, V] | undefined;\n      if (!first) return undefined;\n      const [key, value] = first;\n      this.cache.delete(key);\n      return value;\n    }\n\n    const keys = Array.from(this.cache.keys());\n    for (let i = keys.length - 1; i >= 0; i--) {\n      const key = keys[i]!;\n      const value = this.cache.get(key)!;\n      if (predicate(value)) {\n        this.cache.delete(key);\n        return value;\n      }\n    }\n    return undefined;\n  }\n\n  clear(): void {\n    this.cache.clear();\n  }\n\n  get size(): number {\n    return this.cache.size;\n  }\n\n  values(): IterableIterator<V> {\n    return this.cache.values();\n  }\n\n  keys(): IterableIterator<K> {\n    return this.cache.keys();\n  }\n\n  entries(): IterableIterator<[K, V]> {\n    return this.cache.entries();\n  }\n}\n\n/**\n * Estimate probability by finding the n-th maximum value in the probabilities array.\n * The n-th position is determined by the window size (25ms per frame).\n * Returns 0 if there are insufficient probabilities.\n */\nexport function estimateProbability(\n  probabilities: number[],\n  windowSizeInS: number = MIN_INTERRUPTION_DURATION_IN_S,\n): number {\n  const nTh = Math.ceil(windowSizeInS / FRAME_DURATION_IN_S);\n  if (probabilities.length < nTh) {\n    return 0;\n  }\n\n  // Find the n-th maximum value by sorting in descending order\n  // Create a copy to avoid mutating the original array\n  const sorted = [...probabilities].sort((a, b) => b - a);\n  return sorted[nTh - 1]!;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,sBAAoE;AAM7D,MAAM,aAAkC;AAAA,EACrC,QAAmB,oBAAI,IAAI;AAAA,EAClB;AAAA,EAEjB,YAAY,SAAiB,IAAI;AAC/B,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC1B,SAAK,MAAM,IAAI,KAAK,KAAK;AACzB,QAAI,KAAK,MAAM,OAAO,KAAK,QAAQ;AAEjC,YAAM,WAAW,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC1C,WAAK,MAAM,OAAO,QAAQ;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,KAAQ,QAAmC;AACrD,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,CAAC,MAAO,QAAO;AAEnB,eAAW,CAAC,WAAW,UAAU,KAAK,OAAO,QAAQ,MAAM,GAA8B;AACvF,UAAI,eAAe,OAAW;AAE9B,UAAI,aAAc,OAAkB;AAClC,QAAC,MAAkC,OAAO,SAAS,CAAC,IAAI;AAAA,MAC1D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,KAAQ,SAAkB,QAAuB;AAC3D,QAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,WAAK,IAAI,KAAK,QAAQ,CAAC;AAAA,IACzB;AACA,UAAM,SAAS,KAAK,YAAY,KAAK,MAAM;AAC3C,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,4DAA4D;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAuB;AACzB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,OAAO,KAAiB;AACtB,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,WAAkD;AACpD,QAAI,cAAc,QAAW;AAC3B,YAAM,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK,EAAE;AAC1C,UAAI,CAAC,MAAO,QAAO;AACnB,YAAM,CAAC,KAAK,KAAK,IAAI;AACrB,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC;AACzC,aAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,UAAI,UAAU,KAAK,GAAG;AACpB,aAAK,MAAM,OAAO,GAAG;AACrB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,MAAM,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,SAA8B;AAC5B,WAAO,KAAK,MAAM,OAAO;AAAA,EAC3B;AAAA,EAEA,OAA4B;AAC1B,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,UAAoC;AAClC,WAAO,KAAK,MAAM,QAAQ;AAAA,EAC5B;AACF;AAOO,SAAS,oBACd,eACA,gBAAwB,gDAChB;AACR,QAAM,MAAM,KAAK,KAAK,gBAAgB,mCAAmB;AACzD,MAAI,cAAc,SAAS,KAAK;AAC9B,WAAO;AAAA,EACT;AAIA,QAAM,SAAS,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACtD,SAAO,OAAO,MAAM,CAAC;AACvB;","names":[]}

package/dist/inference/interruption/utils.d.cts

@@ -0,0 +1,41 @@
+/**
+ * A bounded cache that automatically evicts the oldest entries when the cache exceeds max size.
+ * Uses FIFO eviction strategy.
+ */
+export declare class BoundedCache<K, V extends object> {
+    private cache;
+    private readonly maxLen;
+    constructor(maxLen?: number);
+    set(key: K, value: V): void;
+    /**
+     * Update existing value fields if present and defined.
+     * Mirrors python BoundedDict.update_value behavior.
+     */
+    updateValue(key: K, fields: Partial<V>): V | undefined;
+    /**
+     * Set a new value with factory when missing; otherwise update in place.
+     * Mirrors python BoundedDict.set_or_update behavior.
+     */
+    setOrUpdate(key: K, factory: () => V, fields: Partial<V>): V;
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    /**
+     * Pop an entry if it satisfies the predicate.
+     * - No predicate: pop oldest (FIFO)
+     * - With predicate: search in reverse order and pop first match
+     */
+    pop(predicate?: (value: V) => boolean): V | undefined;
+    clear(): void;
+    get size(): number;
+    values(): IterableIterator<V>;
+    keys(): IterableIterator<K>;
+    entries(): IterableIterator<[K, V]>;
+}
+/**
+ * Estimate probability by finding the n-th maximum value in the probabilities array.
+ * The n-th position is determined by the window size (25ms per frame).
+ * Returns 0 if there are insufficient probabilities.
+ */
+export declare function estimateProbability(probabilities: number[], windowSizeInS?: number): number;
+//# sourceMappingURL=utils.d.ts.map

package/dist/inference/interruption/utils.d.ts

@@ -0,0 +1,41 @@
+/**
+ * A bounded cache that automatically evicts the oldest entries when the cache exceeds max size.
+ * Uses FIFO eviction strategy.
+ */
+export declare class BoundedCache<K, V extends object> {
+    private cache;
+    private readonly maxLen;
+    constructor(maxLen?: number);
+    set(key: K, value: V): void;
+    /**
+     * Update existing value fields if present and defined.
+     * Mirrors python BoundedDict.update_value behavior.
+     */
+    updateValue(key: K, fields: Partial<V>): V | undefined;
+    /**
+     * Set a new value with factory when missing; otherwise update in place.
+     * Mirrors python BoundedDict.set_or_update behavior.
+     */
+    setOrUpdate(key: K, factory: () => V, fields: Partial<V>): V;
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    /**
+     * Pop an entry if it satisfies the predicate.
+     * - No predicate: pop oldest (FIFO)
+     * - With predicate: search in reverse order and pop first match
+     */
+    pop(predicate?: (value: V) => boolean): V | undefined;
+    clear(): void;
+    get size(): number;
+    values(): IterableIterator<V>;
+    keys(): IterableIterator<K>;
+    entries(): IterableIterator<[K, V]>;
+}
+/**
+ * Estimate probability by finding the n-th maximum value in the probabilities array.
+ * The n-th position is determined by the window size (25ms per frame).
+ * Returns 0 if there are insufficient probabilities.
+ */
+export declare function estimateProbability(probabilities: number[], windowSizeInS?: number): number;
+//# sourceMappingURL=utils.d.ts.map

package/dist/inference/interruption/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/inference/interruption/utils.ts"],"names":[],"mappings":"AAKA;;;GAGG;AACH,qBAAa,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM;IAC3C,OAAO,CAAC,KAAK,CAAwB;IACrC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;gBAEpB,MAAM,GAAE,MAAW;IAI/B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAS3B;;;OAGG;IACH,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS;IActD;;;OAGG;IACH,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAW5D,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI1B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB;;;;OAIG;IACH,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS;IAqBrD,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI7B,IAAI,IAAI,gBAAgB,CAAC,CAAC,CAAC;IAI3B,OAAO,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAGpC;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,aAAa,EAAE,MAAM,EAAE,EACvB,aAAa,GAAE,MAAuC,GACrD,MAAM,CAUR"}

package/dist/inference/interruption/utils.js

@@ -0,0 +1,105 @@
+import { FRAME_DURATION_IN_S, MIN_INTERRUPTION_DURATION_IN_S } from "./defaults.js";
+class BoundedCache {
+  cache = /* @__PURE__ */ new Map();
+  maxLen;
+  constructor(maxLen = 10) {
+    this.maxLen = maxLen;
+  }
+  set(key, value) {
+    this.cache.set(key, value);
+    if (this.cache.size > this.maxLen) {
+      const firstKey = this.cache.keys().next().value;
+      this.cache.delete(firstKey);
+    }
+  }
+  /**
+   * Update existing value fields if present and defined.
+   * Mirrors python BoundedDict.update_value behavior.
+   */
+  updateValue(key, fields) {
+    const value = this.cache.get(key);
+    if (!value) return value;
+    for (const [fieldName, fieldValue] of Object.entries(fields)) {
+      if (fieldValue === void 0) continue;
+      if (fieldName in value) {
+        value[String(fieldName)] = fieldValue;
+      }
+    }
+    return value;
+  }
+  /**
+   * Set a new value with factory when missing; otherwise update in place.
+   * Mirrors python BoundedDict.set_or_update behavior.
+   */
+  setOrUpdate(key, factory, fields) {
+    if (!this.cache.has(key)) {
+      this.set(key, factory());
+    }
+    const result = this.updateValue(key, fields);
+    if (!result) {
+      throw new Error("setOrUpdate invariant failed: entry should exist after set");
+    }
+    return result;
+  }
+  get(key) {
+    return this.cache.get(key);
+  }
+  has(key) {
+    return this.cache.has(key);
+  }
+  delete(key) {
+    return this.cache.delete(key);
+  }
+  /**
+   * Pop an entry if it satisfies the predicate.
+   * - No predicate: pop oldest (FIFO)
+   * - With predicate: search in reverse order and pop first match
+   */
+  pop(predicate) {
+    if (predicate === void 0) {
+      const first = this.cache.entries().next().value;
+      if (!first) return void 0;
+      const [key, value] = first;
+      this.cache.delete(key);
+      return value;
+    }
+    const keys = Array.from(this.cache.keys());
+    for (let i = keys.length - 1; i >= 0; i--) {
+      const key = keys[i];
+      const value = this.cache.get(key);
+      if (predicate(value)) {
+        this.cache.delete(key);
+        return value;
+      }
+    }
+    return void 0;
+  }
+  clear() {
+    this.cache.clear();
+  }
+  get size() {
+    return this.cache.size;
+  }
+  values() {
+    return this.cache.values();
+  }
+  keys() {
+    return this.cache.keys();
+  }
+  entries() {
+    return this.cache.entries();
+  }
+}
+function estimateProbability(probabilities, windowSizeInS = MIN_INTERRUPTION_DURATION_IN_S) {
+  const nTh = Math.ceil(windowSizeInS / FRAME_DURATION_IN_S);
+  if (probabilities.length < nTh) {
+    return 0;
+  }
+  const sorted = [...probabilities].sort((a, b) => b - a);
+  return sorted[nTh - 1];
+}
+export {
+  BoundedCache,
+  estimateProbability
+};
+//# sourceMappingURL=utils.js.map

package/dist/inference/interruption/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/inference/interruption/utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: 2026 LiveKit, Inc.\n//\n// SPDX-License-Identifier: Apache-2.0\nimport { FRAME_DURATION_IN_S, MIN_INTERRUPTION_DURATION_IN_S } from './defaults.js';\n\n/**\n * A bounded cache that automatically evicts the oldest entries when the cache exceeds max size.\n * Uses FIFO eviction strategy.\n */\nexport class BoundedCache<K, V extends object> {\n  private cache: Map<K, V> = new Map();\n  private readonly maxLen: number;\n\n  constructor(maxLen: number = 10) {\n    this.maxLen = maxLen;\n  }\n\n  set(key: K, value: V): void {\n    this.cache.set(key, value);\n    if (this.cache.size > this.maxLen) {\n      // Remove the oldest entry (first inserted)\n      const firstKey = this.cache.keys().next().value as K;\n      this.cache.delete(firstKey);\n    }\n  }\n\n  /**\n   * Update existing value fields if present and defined.\n   * Mirrors python BoundedDict.update_value behavior.\n   */\n  updateValue(key: K, fields: Partial<V>): V | undefined {\n    const value = this.cache.get(key);\n    if (!value) return value;\n\n    for (const [fieldName, fieldValue] of Object.entries(fields) as [keyof V, V[keyof V]][]) {\n      if (fieldValue === undefined) continue;\n      // Runtime field update parity with python's hasattr + setattr.\n      if (fieldName in (value as object)) {\n        (value as Record<string, unknown>)[String(fieldName)] = fieldValue;\n      }\n    }\n    return value;\n  }\n\n  /**\n   * Set a new value with factory when missing; otherwise update in place.\n   * Mirrors python BoundedDict.set_or_update behavior.\n   */\n  setOrUpdate(key: K, factory: () => V, fields: Partial<V>): V {\n    if (!this.cache.has(key)) {\n      this.set(key, factory());\n    }\n    const result = this.updateValue(key, fields);\n    if (!result) {\n      throw new Error('setOrUpdate invariant failed: entry should exist after set');\n    }\n    return result;\n  }\n\n  get(key: K): V | undefined {\n    return this.cache.get(key);\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  /**\n   * Pop an entry if it satisfies the predicate.\n   * - No predicate: pop oldest (FIFO)\n   * - With predicate: search in reverse order and pop first match\n   */\n  pop(predicate?: (value: V) => boolean): V | undefined {\n    if (predicate === undefined) {\n      const first = this.cache.entries().next().value as [K, V] | undefined;\n      if (!first) return undefined;\n      const [key, value] = first;\n      this.cache.delete(key);\n      return value;\n    }\n\n    const keys = Array.from(this.cache.keys());\n    for (let i = keys.length - 1; i >= 0; i--) {\n      const key = keys[i]!;\n      const value = this.cache.get(key)!;\n      if (predicate(value)) {\n        this.cache.delete(key);\n        return value;\n      }\n    }\n    return undefined;\n  }\n\n  clear(): void {\n    this.cache.clear();\n  }\n\n  get size(): number {\n    return this.cache.size;\n  }\n\n  values(): IterableIterator<V> {\n    return this.cache.values();\n  }\n\n  keys(): IterableIterator<K> {\n    return this.cache.keys();\n  }\n\n  entries(): IterableIterator<[K, V]> {\n    return this.cache.entries();\n  }\n}\n\n/**\n * Estimate probability by finding the n-th maximum value in the probabilities array.\n * The n-th position is determined by the window size (25ms per frame).\n * Returns 0 if there are insufficient probabilities.\n */\nexport function estimateProbability(\n  probabilities: number[],\n  windowSizeInS: number = MIN_INTERRUPTION_DURATION_IN_S,\n): number {\n  const nTh = Math.ceil(windowSizeInS / FRAME_DURATION_IN_S);\n  if (probabilities.length < nTh) {\n    return 0;\n  }\n\n  // Find the n-th maximum value by sorting in descending order\n  // Create a copy to avoid mutating the original array\n  const sorted = [...probabilities].sort((a, b) => b - a);\n  return sorted[nTh - 1]!;\n}\n"],"mappings":"AAGA,SAAS,qBAAqB,sCAAsC;AAM7D,MAAM,aAAkC;AAAA,EACrC,QAAmB,oBAAI,IAAI;AAAA,EAClB;AAAA,EAEjB,YAAY,SAAiB,IAAI;AAC/B,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC1B,SAAK,MAAM,IAAI,KAAK,KAAK;AACzB,QAAI,KAAK,MAAM,OAAO,KAAK,QAAQ;AAEjC,YAAM,WAAW,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AAC1C,WAAK,MAAM,OAAO,QAAQ;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,KAAQ,QAAmC;AACrD,UAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,QAAI,CAAC,MAAO,QAAO;AAEnB,eAAW,CAAC,WAAW,UAAU,KAAK,OAAO,QAAQ,MAAM,GAA8B;AACvF,UAAI,eAAe,OAAW;AAE9B,UAAI,aAAc,OAAkB;AAClC,QAAC,MAAkC,OAAO,SAAS,CAAC,IAAI;AAAA,MAC1D;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,KAAQ,SAAkB,QAAuB;AAC3D,QAAI,CAAC,KAAK,MAAM,IAAI,GAAG,GAAG;AACxB,WAAK,IAAI,KAAK,QAAQ,CAAC;AAAA,IACzB;AACA,UAAM,SAAS,KAAK,YAAY,KAAK,MAAM;AAC3C,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,4DAA4D;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAuB;AACzB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA,EAEA,OAAO,KAAiB;AACtB,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,WAAkD;AACpD,QAAI,cAAc,QAAW;AAC3B,YAAM,QAAQ,KAAK,MAAM,QAAQ,EAAE,KAAK,EAAE;AAC1C,UAAI,CAAC,MAAO,QAAO;AACnB,YAAM,CAAC,KAAK,KAAK,IAAI;AACrB,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC;AACzC,aAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,QAAQ,KAAK,MAAM,IAAI,GAAG;AAChC,UAAI,UAAU,KAAK,GAAG;AACpB,aAAK,MAAM,OAAO,GAAG;AACrB,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,MAAM,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,SAA8B;AAC5B,WAAO,KAAK,MAAM,OAAO;AAAA,EAC3B;AAAA,EAEA,OAA4B;AAC1B,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,UAAoC;AAClC,WAAO,KAAK,MAAM,QAAQ;AAAA,EAC5B;AACF;AAOO,SAAS,oBACd,eACA,gBAAwB,gCAChB;AACR,QAAM,MAAM,KAAK,KAAK,gBAAgB,mBAAmB;AACzD,MAAI,cAAc,SAAS,KAAK;AAC9B,WAAO;AAAA,EACT;AAIA,QAAM,SAAS,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACtD,SAAO,OAAO,MAAM,CAAC;AACvB;","names":[]}

package/dist/inference/interruption/utils.test.cjs

@@ -0,0 +1,105 @@
+"use strict";
+var import_vitest = require("vitest");
+var import_utils = require("./utils.cjs");
+class Entry {
+  createdAt;
+  totalDurationInS = void 0;
+  predictionDurationInS = void 0;
+  note = void 0;
+  constructor(createdAt, note) {
+    this.createdAt = createdAt;
+    this.note = note;
+  }
+}
+(0, import_vitest.describe)("BoundedCache", () => {
+  (0, import_vitest.it)("evicts oldest entry when maxLen is exceeded", () => {
+    const cache = new import_utils.BoundedCache(2);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.set(3, new Entry(3));
+    (0, import_vitest.expect)(cache.size).toBe(2);
+    (0, import_vitest.expect)([...cache.keys()]).toEqual([2, 3]);
+    (0, import_vitest.expect)(cache.get(1)).toBeUndefined();
+    (0, import_vitest.expect)(cache.get(2).createdAt).toBe(2);
+    (0, import_vitest.expect)(cache.get(3).createdAt).toBe(3);
+  });
+  (0, import_vitest.it)("setOrUpdate creates a value via factory when key is missing", () => {
+    var _a;
+    const cache = new import_utils.BoundedCache(10);
+    const factory = import_vitest.vi.fn(() => new Entry(100));
+    const value = cache.setOrUpdate(1, factory, { predictionDurationInS: 0.42 });
+    (0, import_vitest.expect)(factory).toHaveBeenCalledTimes(1);
+    (0, import_vitest.expect)(value.createdAt).toBe(100);
+    (0, import_vitest.expect)(value.predictionDurationInS).toBe(0.42);
+    (0, import_vitest.expect)((_a = cache.get(1)) == null ? void 0 : _a.predictionDurationInS).toBe(0.42);
+  });
+  (0, import_vitest.it)("setOrUpdate updates existing value and does not call factory", () => {
+    const cache = new import_utils.BoundedCache(10);
+    cache.set(1, new Entry(1, "before"));
+    const factory = import_vitest.vi.fn(() => new Entry(999));
+    const value = cache.setOrUpdate(1, factory, { note: "after", totalDurationInS: 1.5 });
+    (0, import_vitest.expect)(factory).not.toHaveBeenCalled();
+    (0, import_vitest.expect)(value.createdAt).toBe(1);
+    (0, import_vitest.expect)(value.note).toBe("after");
+    (0, import_vitest.expect)(value.totalDurationInS).toBe(1.5);
+  });
+  (0, import_vitest.it)("updateValue returns undefined for missing key", () => {
+    const cache = new import_utils.BoundedCache(10);
+    const result = cache.updateValue(404, { note: "missing" });
+    (0, import_vitest.expect)(result).toBeUndefined();
+  });
+  (0, import_vitest.it)("updateValue ignores undefined fields", () => {
+    const cache = new import_utils.BoundedCache(10);
+    cache.set(1, new Entry(1, "keep"));
+    const result = cache.updateValue(1, {
+      note: void 0,
+      predictionDurationInS: 0.1
+    });
+    (0, import_vitest.expect)(result == null ? void 0 : result.createdAt).toBe(1);
+    (0, import_vitest.expect)(result == null ? void 0 : result.note).toBe("keep");
+    (0, import_vitest.expect)(result == null ? void 0 : result.predictionDurationInS).toBe(0.1);
+  });
+  (0, import_vitest.it)("pop without predicate removes the oldest entry (python parity)", () => {
+    const cache = new import_utils.BoundedCache(10);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.set(3, new Entry(3));
+    const popped = cache.pop();
+    (0, import_vitest.expect)(popped == null ? void 0 : popped.createdAt).toBe(1);
+    (0, import_vitest.expect)([...cache.keys()]).toEqual([2, 3]);
+  });
+  (0, import_vitest.it)("pop with predicate removes the most recent matching entry", () => {
+    const cache = new import_utils.BoundedCache(10);
+    const e1 = new Entry(1);
+    e1.totalDurationInS = 0;
+    const e2 = new Entry(2);
+    e2.totalDurationInS = 1;
+    const e3 = new Entry(3);
+    e3.totalDurationInS = 2;
+    cache.set(1, e1);
+    cache.set(2, e2);
+    cache.set(3, e3);
+    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 0);
+    (0, import_vitest.expect)(popped == null ? void 0 : popped.createdAt).toBe(3);
+    (0, import_vitest.expect)(popped == null ? void 0 : popped.totalDurationInS).toBe(2);
+    (0, import_vitest.expect)([...cache.keys()]).toEqual([1, 2]);
+  });
+  (0, import_vitest.it)("pop with predicate returns undefined when no match exists", () => {
+    const cache = new import_utils.BoundedCache(10);
+    const e1 = new Entry(1);
+    e1.totalDurationInS = 0;
+    cache.set(1, e1);
+    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 10);
+    (0, import_vitest.expect)(popped).toBeUndefined();
+    (0, import_vitest.expect)(cache.size).toBe(1);
+  });
+  (0, import_vitest.it)("clear removes all entries", () => {
+    const cache = new import_utils.BoundedCache(10);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.clear();
+    (0, import_vitest.expect)(cache.size).toBe(0);
+    (0, import_vitest.expect)([...cache.keys()]).toEqual([]);
+  });
+});
+//# sourceMappingURL=utils.test.cjs.map

package/dist/inference/interruption/utils.test.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/inference/interruption/utils.test.ts"],"sourcesContent":["// SPDX-FileCopyrightText: 2026 LiveKit, Inc.\n//\n// SPDX-License-Identifier: Apache-2.0\nimport { describe, expect, it, vi } from 'vitest';\nimport { BoundedCache } from './utils.js';\n\nclass Entry {\n  createdAt: number;\n  totalDurationInS: number | undefined = undefined;\n  predictionDurationInS: number | undefined = undefined;\n  note: string | undefined = undefined;\n\n  constructor(createdAt: number, note?: string) {\n    this.createdAt = createdAt;\n    this.note = note;\n  }\n}\n\ndescribe('BoundedCache', () => {\n  it('evicts oldest entry when maxLen is exceeded', () => {\n    const cache = new BoundedCache<number, Entry>(2);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n    cache.set(3, new Entry(3));\n\n    expect(cache.size).toBe(2);\n    expect([...cache.keys()]).toEqual([2, 3]);\n    expect(cache.get(1)).toBeUndefined();\n    expect(cache.get(2)!.createdAt).toBe(2);\n    expect(cache.get(3)!.createdAt).toBe(3);\n  });\n\n  it('setOrUpdate creates a value via factory when key is missing', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const factory = vi.fn(() => new Entry(100));\n\n    const value = cache.setOrUpdate(1, factory, { predictionDurationInS: 0.42 });\n\n    expect(factory).toHaveBeenCalledTimes(1);\n    expect(value.createdAt).toBe(100);\n    expect(value.predictionDurationInS).toBe(0.42);\n    expect(cache.get(1)?.predictionDurationInS).toBe(0.42);\n  });\n\n  it('setOrUpdate updates existing value and does not call factory', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1, 'before'));\n    const factory = vi.fn(() => new Entry(999));\n\n    const value = cache.setOrUpdate(1, factory, { note: 'after', totalDurationInS: 1.5 });\n\n    expect(factory).not.toHaveBeenCalled();\n    expect(value.createdAt).toBe(1);\n    expect(value.note).toBe('after');\n    expect(value.totalDurationInS).toBe(1.5);\n  });\n\n  it('updateValue returns undefined for missing key', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const result = cache.updateValue(404, { note: 'missing' });\n\n    expect(result).toBeUndefined();\n  });\n\n  it('updateValue ignores undefined fields', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1, 'keep'));\n\n    const result = cache.updateValue(1, {\n      note: undefined,\n      predictionDurationInS: 0.1,\n    });\n\n    expect(result?.createdAt).toBe(1);\n    expect(result?.note).toBe('keep');\n    expect(result?.predictionDurationInS).toBe(0.1);\n  });\n\n  it('pop without predicate removes the oldest entry (python parity)', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n    cache.set(3, new Entry(3));\n\n    const popped = cache.pop();\n\n    expect(popped?.createdAt).toBe(1);\n    expect([...cache.keys()]).toEqual([2, 3]);\n  });\n\n  it('pop with predicate removes the most recent matching entry', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const e1 = new Entry(1);\n    e1.totalDurationInS = 0;\n    const e2 = new Entry(2);\n    e2.totalDurationInS = 1;\n    const e3 = new Entry(3);\n    e3.totalDurationInS = 2;\n    cache.set(1, e1);\n    cache.set(2, e2);\n    cache.set(3, e3);\n\n    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 0);\n\n    expect(popped?.createdAt).toBe(3);\n    expect(popped?.totalDurationInS).toBe(2);\n    expect([...cache.keys()]).toEqual([1, 2]);\n  });\n\n  it('pop with predicate returns undefined when no match exists', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const e1 = new Entry(1);\n    e1.totalDurationInS = 0;\n    cache.set(1, e1);\n\n    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 10);\n\n    expect(popped).toBeUndefined();\n    expect(cache.size).toBe(1);\n  });\n\n  it('clear removes all entries', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n\n    cache.clear();\n\n    expect(cache.size).toBe(0);\n    expect([...cache.keys()]).toEqual([]);\n  });\n});\n"],"mappings":";AAGA,oBAAyC;AACzC,mBAA6B;AAE7B,MAAM,MAAM;AAAA,EACV;AAAA,EACA,mBAAuC;AAAA,EACvC,wBAA4C;AAAA,EAC5C,OAA2B;AAAA,EAE3B,YAAY,WAAmB,MAAe;AAC5C,SAAK,YAAY;AACjB,SAAK,OAAO;AAAA,EACd;AACF;AAAA,IAEA,wBAAS,gBAAgB,MAAM;AAC7B,wBAAG,+CAA+C,MAAM;AACtD,UAAM,QAAQ,IAAI,0BAA4B,CAAC;AAC/C,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,8BAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AACzB,8BAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AACxC,8BAAO,MAAM,IAAI,CAAC,CAAC,EAAE,cAAc;AACnC,8BAAO,MAAM,IAAI,CAAC,EAAG,SAAS,EAAE,KAAK,CAAC;AACtC,8BAAO,MAAM,IAAI,CAAC,EAAG,SAAS,EAAE,KAAK,CAAC;AAAA,EACxC,CAAC;AAED,wBAAG,+DAA+D,MAAM;AAhC1E;AAiCI,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,UAAU,iBAAG,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC;AAE1C,UAAM,QAAQ,MAAM,YAAY,GAAG,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAE3E,8BAAO,OAAO,EAAE,sBAAsB,CAAC;AACvC,8BAAO,MAAM,SAAS,EAAE,KAAK,GAAG;AAChC,8BAAO,MAAM,qBAAqB,EAAE,KAAK,IAAI;AAC7C,+BAAO,WAAM,IAAI,CAAC,MAAX,mBAAc,qBAAqB,EAAE,KAAK,IAAI;AAAA,EACvD,CAAC;AAED,wBAAG,gEAAgE,MAAM;AACvE,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,GAAG,QAAQ,CAAC;AACnC,UAAM,UAAU,iBAAG,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC;AAE1C,UAAM,QAAQ,MAAM,YAAY,GAAG,SAAS,EAAE,MAAM,SAAS,kBAAkB,IAAI,CAAC;AAEpF,8BAAO,OAAO,EAAE,IAAI,iBAAiB;AACrC,8BAAO,MAAM,SAAS,EAAE,KAAK,CAAC;AAC9B,8BAAO,MAAM,IAAI,EAAE,KAAK,OAAO;AAC/B,8BAAO,MAAM,gBAAgB,EAAE,KAAK,GAAG;AAAA,EACzC,CAAC;AAED,wBAAG,iDAAiD,MAAM;AACxD,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,SAAS,MAAM,YAAY,KAAK,EAAE,MAAM,UAAU,CAAC;AAEzD,8BAAO,MAAM,EAAE,cAAc;AAAA,EAC/B,CAAC;AAED,wBAAG,wCAAwC,MAAM;AAC/C,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,GAAG,MAAM,CAAC;AAEjC,UAAM,SAAS,MAAM,YAAY,GAAG;AAAA,MAClC,MAAM;AAAA,MACN,uBAAuB;AAAA,IACzB,CAAC;AAED,8BAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,8BAAO,iCAAQ,IAAI,EAAE,KAAK,MAAM;AAChC,8BAAO,iCAAQ,qBAAqB,EAAE,KAAK,GAAG;AAAA,EAChD,CAAC;AAED,wBAAG,kEAAkE,MAAM;AACzE,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,UAAM,SAAS,MAAM,IAAI;AAEzB,8BAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,8BAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAAA,EAC1C,CAAC;AAED,wBAAG,6DAA6D,MAAM;AACpE,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,IAAI,GAAG,EAAE;AACf,UAAM,IAAI,GAAG,EAAE;AACf,UAAM,IAAI,GAAG,EAAE;AAEf,UAAM,SAAS,MAAM,IAAI,CAAC,WAAW,MAAM,oBAAoB,KAAK,CAAC;AAErE,8BAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,8BAAO,iCAAQ,gBAAgB,EAAE,KAAK,CAAC;AACvC,8BAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAAA,EAC1C,CAAC;AAED,wBAAG,6DAA6D,MAAM;AACpE,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,IAAI,GAAG,EAAE;AAEf,UAAM,SAAS,MAAM,IAAI,CAAC,WAAW,MAAM,oBAAoB,KAAK,EAAE;AAEtE,8BAAO,MAAM,EAAE,cAAc;AAC7B,8BAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AAAA,EAC3B,CAAC;AAED,wBAAG,6BAA6B,MAAM;AACpC,UAAM,QAAQ,IAAI,0BAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,UAAM,MAAM;AAEZ,8BAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AACzB,8BAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EACtC,CAAC;AACH,CAAC;","names":[]}

package/dist/inference/interruption/utils.test.js

@@ -0,0 +1,104 @@
+import { describe, expect, it, vi } from "vitest";
+import { BoundedCache } from "./utils.js";
+class Entry {
+  createdAt;
+  totalDurationInS = void 0;
+  predictionDurationInS = void 0;
+  note = void 0;
+  constructor(createdAt, note) {
+    this.createdAt = createdAt;
+    this.note = note;
+  }
+}
+describe("BoundedCache", () => {
+  it("evicts oldest entry when maxLen is exceeded", () => {
+    const cache = new BoundedCache(2);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.set(3, new Entry(3));
+    expect(cache.size).toBe(2);
+    expect([...cache.keys()]).toEqual([2, 3]);
+    expect(cache.get(1)).toBeUndefined();
+    expect(cache.get(2).createdAt).toBe(2);
+    expect(cache.get(3).createdAt).toBe(3);
+  });
+  it("setOrUpdate creates a value via factory when key is missing", () => {
+    var _a;
+    const cache = new BoundedCache(10);
+    const factory = vi.fn(() => new Entry(100));
+    const value = cache.setOrUpdate(1, factory, { predictionDurationInS: 0.42 });
+    expect(factory).toHaveBeenCalledTimes(1);
+    expect(value.createdAt).toBe(100);
+    expect(value.predictionDurationInS).toBe(0.42);
+    expect((_a = cache.get(1)) == null ? void 0 : _a.predictionDurationInS).toBe(0.42);
+  });
+  it("setOrUpdate updates existing value and does not call factory", () => {
+    const cache = new BoundedCache(10);
+    cache.set(1, new Entry(1, "before"));
+    const factory = vi.fn(() => new Entry(999));
+    const value = cache.setOrUpdate(1, factory, { note: "after", totalDurationInS: 1.5 });
+    expect(factory).not.toHaveBeenCalled();
+    expect(value.createdAt).toBe(1);
+    expect(value.note).toBe("after");
+    expect(value.totalDurationInS).toBe(1.5);
+  });
+  it("updateValue returns undefined for missing key", () => {
+    const cache = new BoundedCache(10);
+    const result = cache.updateValue(404, { note: "missing" });
+    expect(result).toBeUndefined();
+  });
+  it("updateValue ignores undefined fields", () => {
+    const cache = new BoundedCache(10);
+    cache.set(1, new Entry(1, "keep"));
+    const result = cache.updateValue(1, {
+      note: void 0,
+      predictionDurationInS: 0.1
+    });
+    expect(result == null ? void 0 : result.createdAt).toBe(1);
+    expect(result == null ? void 0 : result.note).toBe("keep");
+    expect(result == null ? void 0 : result.predictionDurationInS).toBe(0.1);
+  });
+  it("pop without predicate removes the oldest entry (python parity)", () => {
+    const cache = new BoundedCache(10);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.set(3, new Entry(3));
+    const popped = cache.pop();
+    expect(popped == null ? void 0 : popped.createdAt).toBe(1);
+    expect([...cache.keys()]).toEqual([2, 3]);
+  });
+  it("pop with predicate removes the most recent matching entry", () => {
+    const cache = new BoundedCache(10);
+    const e1 = new Entry(1);
+    e1.totalDurationInS = 0;
+    const e2 = new Entry(2);
+    e2.totalDurationInS = 1;
+    const e3 = new Entry(3);
+    e3.totalDurationInS = 2;
+    cache.set(1, e1);
+    cache.set(2, e2);
+    cache.set(3, e3);
+    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 0);
+    expect(popped == null ? void 0 : popped.createdAt).toBe(3);
+    expect(popped == null ? void 0 : popped.totalDurationInS).toBe(2);
+    expect([...cache.keys()]).toEqual([1, 2]);
+  });
+  it("pop with predicate returns undefined when no match exists", () => {
+    const cache = new BoundedCache(10);
+    const e1 = new Entry(1);
+    e1.totalDurationInS = 0;
+    cache.set(1, e1);
+    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 10);
+    expect(popped).toBeUndefined();
+    expect(cache.size).toBe(1);
+  });
+  it("clear removes all entries", () => {
+    const cache = new BoundedCache(10);
+    cache.set(1, new Entry(1));
+    cache.set(2, new Entry(2));
+    cache.clear();
+    expect(cache.size).toBe(0);
+    expect([...cache.keys()]).toEqual([]);
+  });
+});
+//# sourceMappingURL=utils.test.js.map

package/dist/inference/interruption/utils.test.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/inference/interruption/utils.test.ts"],"sourcesContent":["// SPDX-FileCopyrightText: 2026 LiveKit, Inc.\n//\n// SPDX-License-Identifier: Apache-2.0\nimport { describe, expect, it, vi } from 'vitest';\nimport { BoundedCache } from './utils.js';\n\nclass Entry {\n  createdAt: number;\n  totalDurationInS: number | undefined = undefined;\n  predictionDurationInS: number | undefined = undefined;\n  note: string | undefined = undefined;\n\n  constructor(createdAt: number, note?: string) {\n    this.createdAt = createdAt;\n    this.note = note;\n  }\n}\n\ndescribe('BoundedCache', () => {\n  it('evicts oldest entry when maxLen is exceeded', () => {\n    const cache = new BoundedCache<number, Entry>(2);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n    cache.set(3, new Entry(3));\n\n    expect(cache.size).toBe(2);\n    expect([...cache.keys()]).toEqual([2, 3]);\n    expect(cache.get(1)).toBeUndefined();\n    expect(cache.get(2)!.createdAt).toBe(2);\n    expect(cache.get(3)!.createdAt).toBe(3);\n  });\n\n  it('setOrUpdate creates a value via factory when key is missing', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const factory = vi.fn(() => new Entry(100));\n\n    const value = cache.setOrUpdate(1, factory, { predictionDurationInS: 0.42 });\n\n    expect(factory).toHaveBeenCalledTimes(1);\n    expect(value.createdAt).toBe(100);\n    expect(value.predictionDurationInS).toBe(0.42);\n    expect(cache.get(1)?.predictionDurationInS).toBe(0.42);\n  });\n\n  it('setOrUpdate updates existing value and does not call factory', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1, 'before'));\n    const factory = vi.fn(() => new Entry(999));\n\n    const value = cache.setOrUpdate(1, factory, { note: 'after', totalDurationInS: 1.5 });\n\n    expect(factory).not.toHaveBeenCalled();\n    expect(value.createdAt).toBe(1);\n    expect(value.note).toBe('after');\n    expect(value.totalDurationInS).toBe(1.5);\n  });\n\n  it('updateValue returns undefined for missing key', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const result = cache.updateValue(404, { note: 'missing' });\n\n    expect(result).toBeUndefined();\n  });\n\n  it('updateValue ignores undefined fields', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1, 'keep'));\n\n    const result = cache.updateValue(1, {\n      note: undefined,\n      predictionDurationInS: 0.1,\n    });\n\n    expect(result?.createdAt).toBe(1);\n    expect(result?.note).toBe('keep');\n    expect(result?.predictionDurationInS).toBe(0.1);\n  });\n\n  it('pop without predicate removes the oldest entry (python parity)', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n    cache.set(3, new Entry(3));\n\n    const popped = cache.pop();\n\n    expect(popped?.createdAt).toBe(1);\n    expect([...cache.keys()]).toEqual([2, 3]);\n  });\n\n  it('pop with predicate removes the most recent matching entry', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const e1 = new Entry(1);\n    e1.totalDurationInS = 0;\n    const e2 = new Entry(2);\n    e2.totalDurationInS = 1;\n    const e3 = new Entry(3);\n    e3.totalDurationInS = 2;\n    cache.set(1, e1);\n    cache.set(2, e2);\n    cache.set(3, e3);\n\n    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 0);\n\n    expect(popped?.createdAt).toBe(3);\n    expect(popped?.totalDurationInS).toBe(2);\n    expect([...cache.keys()]).toEqual([1, 2]);\n  });\n\n  it('pop with predicate returns undefined when no match exists', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    const e1 = new Entry(1);\n    e1.totalDurationInS = 0;\n    cache.set(1, e1);\n\n    const popped = cache.pop((entry) => (entry.totalDurationInS ?? 0) > 10);\n\n    expect(popped).toBeUndefined();\n    expect(cache.size).toBe(1);\n  });\n\n  it('clear removes all entries', () => {\n    const cache = new BoundedCache<number, Entry>(10);\n    cache.set(1, new Entry(1));\n    cache.set(2, new Entry(2));\n\n    cache.clear();\n\n    expect(cache.size).toBe(0);\n    expect([...cache.keys()]).toEqual([]);\n  });\n});\n"],"mappings":"AAGA,SAAS,UAAU,QAAQ,IAAI,UAAU;AACzC,SAAS,oBAAoB;AAE7B,MAAM,MAAM;AAAA,EACV;AAAA,EACA,mBAAuC;AAAA,EACvC,wBAA4C;AAAA,EAC5C,OAA2B;AAAA,EAE3B,YAAY,WAAmB,MAAe;AAC5C,SAAK,YAAY;AACjB,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,gBAAgB,MAAM;AAC7B,KAAG,+CAA+C,MAAM;AACtD,UAAM,QAAQ,IAAI,aAA4B,CAAC;AAC/C,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,WAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AACzB,WAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AACxC,WAAO,MAAM,IAAI,CAAC,CAAC,EAAE,cAAc;AACnC,WAAO,MAAM,IAAI,CAAC,EAAG,SAAS,EAAE,KAAK,CAAC;AACtC,WAAO,MAAM,IAAI,CAAC,EAAG,SAAS,EAAE,KAAK,CAAC;AAAA,EACxC,CAAC;AAED,KAAG,+DAA+D,MAAM;AAhC1E;AAiCI,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,UAAU,GAAG,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC;AAE1C,UAAM,QAAQ,MAAM,YAAY,GAAG,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAE3E,WAAO,OAAO,EAAE,sBAAsB,CAAC;AACvC,WAAO,MAAM,SAAS,EAAE,KAAK,GAAG;AAChC,WAAO,MAAM,qBAAqB,EAAE,KAAK,IAAI;AAC7C,YAAO,WAAM,IAAI,CAAC,MAAX,mBAAc,qBAAqB,EAAE,KAAK,IAAI;AAAA,EACvD,CAAC;AAED,KAAG,gEAAgE,MAAM;AACvE,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,GAAG,QAAQ,CAAC;AACnC,UAAM,UAAU,GAAG,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC;AAE1C,UAAM,QAAQ,MAAM,YAAY,GAAG,SAAS,EAAE,MAAM,SAAS,kBAAkB,IAAI,CAAC;AAEpF,WAAO,OAAO,EAAE,IAAI,iBAAiB;AACrC,WAAO,MAAM,SAAS,EAAE,KAAK,CAAC;AAC9B,WAAO,MAAM,IAAI,EAAE,KAAK,OAAO;AAC/B,WAAO,MAAM,gBAAgB,EAAE,KAAK,GAAG;AAAA,EACzC,CAAC;AAED,KAAG,iDAAiD,MAAM;AACxD,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,SAAS,MAAM,YAAY,KAAK,EAAE,MAAM,UAAU,CAAC;AAEzD,WAAO,MAAM,EAAE,cAAc;AAAA,EAC/B,CAAC;AAED,KAAG,wCAAwC,MAAM;AAC/C,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,GAAG,MAAM,CAAC;AAEjC,UAAM,SAAS,MAAM,YAAY,GAAG;AAAA,MAClC,MAAM;AAAA,MACN,uBAAuB;AAAA,IACzB,CAAC;AAED,WAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,WAAO,iCAAQ,IAAI,EAAE,KAAK,MAAM;AAChC,WAAO,iCAAQ,qBAAqB,EAAE,KAAK,GAAG;AAAA,EAChD,CAAC;AAED,KAAG,kEAAkE,MAAM;AACzE,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,UAAM,SAAS,MAAM,IAAI;AAEzB,WAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,WAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAAA,EAC1C,CAAC;AAED,KAAG,6DAA6D,MAAM;AACpE,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,IAAI,GAAG,EAAE;AACf,UAAM,IAAI,GAAG,EAAE;AACf,UAAM,IAAI,GAAG,EAAE;AAEf,UAAM,SAAS,MAAM,IAAI,CAAC,WAAW,MAAM,oBAAoB,KAAK,CAAC;AAErE,WAAO,iCAAQ,SAAS,EAAE,KAAK,CAAC;AAChC,WAAO,iCAAQ,gBAAgB,EAAE,KAAK,CAAC;AACvC,WAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAAA,EAC1C,CAAC;AAED,KAAG,6DAA6D,MAAM;AACpE,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,KAAK,IAAI,MAAM,CAAC;AACtB,OAAG,mBAAmB;AACtB,UAAM,IAAI,GAAG,EAAE;AAEf,UAAM,SAAS,MAAM,IAAI,CAAC,WAAW,MAAM,oBAAoB,KAAK,EAAE;AAEtE,WAAO,MAAM,EAAE,cAAc;AAC7B,WAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AAAA,EAC3B,CAAC;AAED,KAAG,6BAA6B,MAAM;AACpC,UAAM,QAAQ,IAAI,aAA4B,EAAE;AAChD,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AACzB,UAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC;AAEzB,UAAM,MAAM;AAEZ,WAAO,MAAM,IAAI,EAAE,KAAK,CAAC;AACzB,WAAO,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EACtC,CAAC;AACH,CAAC;","names":[]}