@fluentui/react-utilities 9.9.0 → 9.9.2

package/lib/utils/isHTMLElement.js.map

@@ -1 +1 @@
-{"version":3,"names":["isHTMLElement","element","options","_typedElement_ownerDocument","typedElement","_options_constructorName","Boolean","ownerDocument","defaultView","constructorName"],"sources":["../../src/utils/isHTMLElement.ts"],"sourcesContent":["/**\n * Verifies if a given node is an HTMLElement,\n * this method works seamlessly with frames and elements from different documents\n *\n * This is preferred over simply using `instanceof`.\n * Since `instanceof` might be problematic while operating with [multiple realms](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms)\n *\n * @example\n * ```ts\n * isHTMLElement(event.target) && event.target.focus()\n * isHTMLElement(event.target, {constructorName: 'HTMLInputElement'}) && event.target.value // some value\n * ```\n *\n */\nexport function isHTMLElement<ConstructorName extends HTMLElementConstructorName = 'HTMLElement'>(\n  element?: unknown,\n  options?: {\n    /**\n     * Can be used to provide a custom constructor instead of `HTMLElement`,\n     * Like `HTMLInputElement` for example.\n     */\n    constructorName?: ConstructorName;\n  },\n): element is InstanceType<(typeof globalThis)[ConstructorName]> {\n  const typedElement = element as Node | null | undefined;\n  return Boolean(\n    typedElement?.ownerDocument?.defaultView &&\n      typedElement instanceof typedElement.ownerDocument.defaultView[options?.constructorName ?? 'HTMLElement'],\n  );\n}\n\n/**\n * @internal\n */\nexport type HTMLElementConstructorName =\n  | 'HTMLElement'\n  | 'HTMLAnchorElement'\n  | 'HTMLAreaElement'\n  | 'HTMLAudioElement'\n  | 'HTMLBaseElement'\n  | 'HTMLBodyElement'\n  | 'HTMLBRElement'\n  | 'HTMLButtonElement'\n  | 'HTMLCanvasElement'\n  | 'HTMLDataElement'\n  | 'HTMLDataListElement'\n  | 'HTMLDetailsElement'\n  | 'HTMLDialogElement'\n  | 'HTMLDivElement'\n  | 'HTMLDListElement'\n  | 'HTMLEmbedElement'\n  | 'HTMLFieldSetElement'\n  | 'HTMLFormElement'\n  | 'HTMLHeadingElement'\n  | 'HTMLHeadElement'\n  | 'HTMLHRElement'\n  | 'HTMLHtmlElement'\n  | 'HTMLIFrameElement'\n  | 'HTMLImageElement'\n  | 'HTMLInputElement'\n  | 'HTMLModElement'\n  | 'HTMLLabelElement'\n  | 'HTMLLegendElement'\n  | 'HTMLLIElement'\n  | 'HTMLLinkElement'\n  | 'HTMLMapElement'\n  | 'HTMLMetaElement'\n  | 'HTMLMeterElement'\n  | 'HTMLObjectElement'\n  | 'HTMLOListElement'\n  | 'HTMLOptGroupElement'\n  | 'HTMLOptionElement'\n  | 'HTMLOutputElement'\n  | 'HTMLParagraphElement'\n  | 'HTMLParamElement'\n  | 'HTMLPreElement'\n  | 'HTMLProgressElement'\n  | 'HTMLQuoteElement'\n  | 'HTMLSlotElement'\n  | 'HTMLScriptElement'\n  | 'HTMLSelectElement'\n  | 'HTMLSourceElement'\n  | 'HTMLSpanElement'\n  | 'HTMLStyleElement'\n  | 'HTMLTableElement'\n  | 'HTMLTableColElement'\n  | 'HTMLTableRowElement'\n  | 'HTMLTableSectionElement'\n  | 'HTMLTemplateElement'\n  | 'HTMLTextAreaElement'\n  | 'HTMLTimeElement'\n  | 'HTMLTitleElement'\n  | 'HTMLTrackElement'\n  | 'HTMLUListElement'\n  | 'HTMLVideoElement';\n"],"mappings":"AAAA;;;;;;;;;;;;;GAcA,OAAO,SAASA,cACdC,OAAiB,EACjBC,OAMC,EAC8D;MAG7DC,2BAAA;EAFF,MAAMC,YAAA,GAAeH,OAAA;MAG8CI,wBAAA;EAFnE,OAAOC,OAAA,CACL,CAAAF,YAAA,aAAAA,YAAA,wBAAAD,2BAAA,GAAAC,YAAA,CAAcG,aAAa,cAA3BJ,2BAAA,uBAAAA,2BAAA,CAA6BK,WAAF,KACzBJ,YAAA,YAAwBA,YAAA,CAAaG,aAAa,CAACC,WAAW,CAAC,CAAAH,wBAAA,GAAAH,OAAA,aAAAA,OAAA,uBAAAA,OAAA,CAASO,eAAe,cAAxBJ,wBAAA,cAAAA,wBAAA,GAA4B,aAAa,CAAC;AAE/G"}
+{"version":3,"sources":["isHTMLElement.ts"],"sourcesContent":["/**\n * Verifies if a given node is an HTMLElement,\n * this method works seamlessly with frames and elements from different documents\n *\n * This is preferred over simply using `instanceof`.\n * Since `instanceof` might be problematic while operating with [multiple realms](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/instanceof#instanceof_and_multiple_realms)\n *\n * @example\n * ```ts\n * isHTMLElement(event.target) && event.target.focus()\n * isHTMLElement(event.target, {constructorName: 'HTMLInputElement'}) && event.target.value // some value\n * ```\n *\n */\nexport function isHTMLElement<ConstructorName extends HTMLElementConstructorName = 'HTMLElement'>(\n  element?: unknown,\n  options?: {\n    /**\n     * Can be used to provide a custom constructor instead of `HTMLElement`,\n     * Like `HTMLInputElement` for example.\n     */\n    constructorName?: ConstructorName;\n  },\n): element is InstanceType<(typeof globalThis)[ConstructorName]> {\n  const typedElement = element as Node | null | undefined;\n  return Boolean(\n    typedElement?.ownerDocument?.defaultView &&\n      typedElement instanceof typedElement.ownerDocument.defaultView[options?.constructorName ?? 'HTMLElement'],\n  );\n}\n\n/**\n * @internal\n */\nexport type HTMLElementConstructorName =\n  | 'HTMLElement'\n  | 'HTMLAnchorElement'\n  | 'HTMLAreaElement'\n  | 'HTMLAudioElement'\n  | 'HTMLBaseElement'\n  | 'HTMLBodyElement'\n  | 'HTMLBRElement'\n  | 'HTMLButtonElement'\n  | 'HTMLCanvasElement'\n  | 'HTMLDataElement'\n  | 'HTMLDataListElement'\n  | 'HTMLDetailsElement'\n  // NOTE: dialog is not supported in safari 14, also it was removed from lib-dom starting typescript 4.4\n  // | 'HTMLDialogElement'\n  | 'HTMLDivElement'\n  | 'HTMLDListElement'\n  | 'HTMLEmbedElement'\n  | 'HTMLFieldSetElement'\n  | 'HTMLFormElement'\n  | 'HTMLHeadingElement'\n  | 'HTMLHeadElement'\n  | 'HTMLHRElement'\n  | 'HTMLHtmlElement'\n  | 'HTMLIFrameElement'\n  | 'HTMLImageElement'\n  | 'HTMLInputElement'\n  | 'HTMLModElement'\n  | 'HTMLLabelElement'\n  | 'HTMLLegendElement'\n  | 'HTMLLIElement'\n  | 'HTMLLinkElement'\n  | 'HTMLMapElement'\n  | 'HTMLMetaElement'\n  | 'HTMLMeterElement'\n  | 'HTMLObjectElement'\n  | 'HTMLOListElement'\n  | 'HTMLOptGroupElement'\n  | 'HTMLOptionElement'\n  | 'HTMLOutputElement'\n  | 'HTMLParagraphElement'\n  | 'HTMLParamElement'\n  | 'HTMLPreElement'\n  | 'HTMLProgressElement'\n  | 'HTMLQuoteElement'\n  | 'HTMLSlotElement'\n  | 'HTMLScriptElement'\n  | 'HTMLSelectElement'\n  | 'HTMLSourceElement'\n  | 'HTMLSpanElement'\n  | 'HTMLStyleElement'\n  | 'HTMLTableElement'\n  | 'HTMLTableColElement'\n  | 'HTMLTableRowElement'\n  | 'HTMLTableSectionElement'\n  | 'HTMLTemplateElement'\n  | 'HTMLTextAreaElement'\n  | 'HTMLTimeElement'\n  | 'HTMLTitleElement'\n  | 'HTMLTrackElement'\n  | 'HTMLUListElement'\n  | 'HTMLVideoElement';\n"],"names":["isHTMLElement","element","options","typedElement","Boolean","ownerDocument","defaultView","constructorName"],"mappings":"AAAA;;;;;;;;;;;;;CAaC,GACD,OAAO,SAASA,cACdC,OAAiB,EACjBC,OAMC,EAC8D;QAG7DC;IAFF,MAAMA,eAAeF;QAG8CC;IAFnE,OAAOE,QACLD,CAAAA,yBAAAA,0BAAAA,KAAAA,IAAAA,CAAAA,8BAAAA,aAAcE,aAAa,cAA3BF,yCAAAA,KAAAA,IAAAA,4BAA6BG,WAAF,AAAD,KACxBH,wBAAwBA,aAAaE,aAAa,CAACC,WAAW,CAACJ,CAAAA,2BAAAA,oBAAAA,qBAAAA,KAAAA,IAAAA,QAASK,eAAe,cAAxBL,sCAAAA,2BAA4B,aAAa,CAAC;AAE/G,CAAC"}

package/lib/utils/isInteractiveHTMLElement.js

@@ -2,21 +2,17 @@ import { isHTMLElement } from './isHTMLElement';
 /**
  * @internal
  * Checks that the element has default behaviour from user input on click or 'Enter'/'Space' keys
- */
-export function isInteractiveHTMLElement(element) {
-  if (!isHTMLElement(element)) {
-    return false;
-  }
-  const {
-    tagName
-  } = element;
-  switch (tagName) {
-    case 'BUTTON':
-    case 'A':
-    case 'INPUT':
-    case 'TEXTAREA':
-      return true;
-  }
-  return element.isContentEditable;
+ */ export function isInteractiveHTMLElement(element) {
+    if (!isHTMLElement(element)) {
+        return false;
+    }
+    const { tagName  } = element;
+    switch(tagName){
+        case 'BUTTON':
+        case 'A':
+        case 'INPUT':
+        case 'TEXTAREA':
+            return true;
+    }
+    return element.isContentEditable;
 }
-//# sourceMappingURL=isInteractiveHTMLElement.js.map

package/lib/utils/isInteractiveHTMLElement.js.map

@@ -1 +1 @@
-{"version":3,"names":["isHTMLElement","isInteractiveHTMLElement","element","tagName","isContentEditable"],"sources":["../../src/utils/isInteractiveHTMLElement.ts"],"sourcesContent":["import { isHTMLElement } from './isHTMLElement';\n\n/**\n * @internal\n * Checks that the element has default behaviour from user input on click or 'Enter'/'Space' keys\n */\nexport function isInteractiveHTMLElement(element: unknown) {\n  if (!isHTMLElement(element)) {\n    return false;\n  }\n\n  const { tagName } = element;\n  switch (tagName) {\n    case 'BUTTON':\n    case 'A':\n    case 'INPUT':\n    case 'TEXTAREA':\n      return true;\n  }\n\n  return element.isContentEditable;\n}\n"],"mappings":"AAAA,SAASA,aAAa,QAAQ;AAE9B;;;;AAIA,OAAO,SAASC,yBAAyBC,OAAgB,EAAE;EACzD,IAAI,CAACF,aAAA,CAAcE,OAAA,GAAU;IAC3B,OAAO,KAAK;EACd;EAEA,MAAM;IAAEC;EAAO,CAAE,GAAGD,OAAA;EACpB,QAAQC,OAAA;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;MACH,OAAO,IAAI;EAAA;EAGf,OAAOD,OAAA,CAAQE,iBAAiB;AAClC"}
+{"version":3,"sources":["isInteractiveHTMLElement.ts"],"sourcesContent":["import { isHTMLElement } from './isHTMLElement';\n\n/**\n * @internal\n * Checks that the element has default behaviour from user input on click or 'Enter'/'Space' keys\n */\nexport function isInteractiveHTMLElement(element: unknown) {\n  if (!isHTMLElement(element)) {\n    return false;\n  }\n\n  const { tagName } = element;\n  switch (tagName) {\n    case 'BUTTON':\n    case 'A':\n    case 'INPUT':\n    case 'TEXTAREA':\n      return true;\n  }\n\n  return element.isContentEditable;\n}\n"],"names":["isHTMLElement","isInteractiveHTMLElement","element","tagName","isContentEditable"],"mappings":"AAAA,SAASA,aAAa,QAAQ,kBAAkB;AAEhD;;;CAGC,GACD,OAAO,SAASC,yBAAyBC,OAAgB,EAAE;IACzD,IAAI,CAACF,cAAcE,UAAU;QAC3B,OAAO,KAAK;IACd,CAAC;IAED,MAAM,EAAEC,QAAO,EAAE,GAAGD;IACpB,OAAQC;QACN,KAAK;QACL,KAAK;QACL,KAAK;QACL,KAAK;YACH,OAAO,IAAI;IACf;IAEA,OAAOD,QAAQE,iBAAiB;AAClC,CAAC"}

package/lib/utils/mergeCallbacks.js

@@ -20,10 +20,9 @@
  * @param callback2 - The second callback to be called, or undefined
  *
  * @returns A function that that calls the provided functions in order
- */export function mergeCallbacks(callback1, callback2) {
-  return (...args) => {
-    callback1 === null || callback1 === void 0 ? void 0 : callback1(...args);
-    callback2 === null || callback2 === void 0 ? void 0 : callback2(...args);
-  };
+ */ export function mergeCallbacks(callback1, callback2) {
+    return (...args)=>{
+        callback1 === null || callback1 === void 0 ? void 0 : callback1(...args);
+        callback2 === null || callback2 === void 0 ? void 0 : callback2(...args);
+    };
 }
-//# sourceMappingURL=mergeCallbacks.js.map

package/lib/utils/mergeCallbacks.js.map

@@ -1 +1 @@
-{"version":3,"names":["mergeCallbacks","callback1","callback2","args"],"sources":["../../src/utils/mergeCallbacks.ts"],"sourcesContent":["/**\n * @internal\n * Combine two event callbacks into a single callback function that calls each one in order.\n *\n * Usage example:\n * ```ts\n * state.slot.onChange = mergeCallbacks(state.slot.onChange, ev => {\n *   // Handle onChange\n * });\n * ```\n *\n * The primary use is to avoid the need to capture an existing callback (`state.slot.onChange` in the example) to a\n * local variable before replacing with a new listener that calls the existing one. This helps avoid bugs like:\n * * Infinite recursion by calling the re-assigned state.slot.onChange if it's not captured to a local variable.\n * * Missing a call to the original onChange due to an early return or other conditional.\n *\n * If you need a callback that is stable between renders, wrap the result in {@link useEventCallback}.\n *\n * @param callback1 - The first callback to be called, or undefined\n * @param callback2 - The second callback to be called, or undefined\n *\n * @returns A function that that calls the provided functions in order\n */\nexport function mergeCallbacks<Args extends unknown[]>(\n  callback1: ((...args: Args) => void) | undefined,\n  callback2: ((...args: Args) => void) | undefined,\n) {\n  return (...args: Args) => {\n    callback1?.(...args);\n    callback2?.(...args);\n  };\n}\n"],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAuBA,OAAO,SAASA,eACdC,SAAgD,EAChDC,SAAgD,EAChD;EACA,OAAO,CAAC,GAAGC,IAAA,KAAe;IACxBF,SAAA,aAAAA,SAAA,uBAAAA,SAAA,IAAeE,IAAA;IACfD,SAAA,aAAAA,SAAA,uBAAAA,SAAA,IAAeC,IAAA;EACjB;AACF"}
+{"version":3,"sources":["mergeCallbacks.ts"],"sourcesContent":["/**\n * @internal\n * Combine two event callbacks into a single callback function that calls each one in order.\n *\n * Usage example:\n * ```ts\n * state.slot.onChange = mergeCallbacks(state.slot.onChange, ev => {\n *   // Handle onChange\n * });\n * ```\n *\n * The primary use is to avoid the need to capture an existing callback (`state.slot.onChange` in the example) to a\n * local variable before replacing with a new listener that calls the existing one. This helps avoid bugs like:\n * * Infinite recursion by calling the re-assigned state.slot.onChange if it's not captured to a local variable.\n * * Missing a call to the original onChange due to an early return or other conditional.\n *\n * If you need a callback that is stable between renders, wrap the result in {@link useEventCallback}.\n *\n * @param callback1 - The first callback to be called, or undefined\n * @param callback2 - The second callback to be called, or undefined\n *\n * @returns A function that that calls the provided functions in order\n */\nexport function mergeCallbacks<Args extends unknown[]>(\n  callback1: ((...args: Args) => void) | undefined,\n  callback2: ((...args: Args) => void) | undefined,\n) {\n  return (...args: Args) => {\n    callback1?.(...args);\n    callback2?.(...args);\n  };\n}\n"],"names":["mergeCallbacks","callback1","callback2","args"],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;CAsBC,GACD,OAAO,SAASA,eACdC,SAAgD,EAChDC,SAAgD,EAChD;IACA,OAAO,CAAC,GAAGC,OAAe;QACxBF,sBAAAA,uBAAAA,KAAAA,IAAAA,aAAeE;QACfD,sBAAAA,uBAAAA,KAAAA,IAAAA,aAAeC;IACjB;AACF,CAAC"}

package/lib/utils/omit.js

@@ -12,13 +12,12 @@
  * @param exclusions - The array of keys to exclude
  */ // eslint-disable-next-line @typescript-eslint/no-explicit-any
 export function omit(obj, exclusions) {
-  // eslint-disable-next-line @typescript-eslint/no-explicit-any
-  const result = {};
-  for (const key in obj) {
-    if (exclusions.indexOf(key) === -1 && obj.hasOwnProperty(key)) {
-      result[key] = obj[key];
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    const result = {};
+    for(const key in obj){
+        if (exclusions.indexOf(key) === -1 && obj.hasOwnProperty(key)) {
+            result[key] = obj[key];
+        }
     }
-  }
-  return result;
+    return result;
 }
-//# sourceMappingURL=omit.js.map

package/lib/utils/omit.js.map

@@ -1 +1 @@
-{"version":3,"names":["omit","obj","exclusions","result","key","indexOf","hasOwnProperty"],"sources":["../../src/utils/omit.ts"],"sourcesContent":["/**\n * Tiny helper to do the minimal amount of work in duplicating an object but omitting some\n * props. This ends up faster than using object ...rest or reduce to filter.\n *\n * This behaves very much like filteredAssign, but does not merge many objects together,\n * uses an exclusion object map, and avoids spreads all for optimal performance.\n *\n * See perf test for background:\n * https://jsperf.com/omit-vs-rest-vs-reduce/1\n *\n * @param obj - The object to clone\n * @param exclusions - The array of keys to exclude\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function omit<TObj extends Record<string, any>, Exclusions extends (keyof TObj)[]>(\n  obj: TObj,\n  exclusions: Exclusions,\n): Omit<TObj, Exclusions[number]> {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const result: Record<string, any> = {};\n\n  for (const key in obj) {\n    if (exclusions.indexOf(key) === -1 && obj.hasOwnProperty(key)) {\n      result[key] = obj[key];\n    }\n  }\n\n  return result as TObj;\n}\n"],"mappings":"AAAA;;;;;;;;;;;;GAAA,CAaA;AACA,OAAO,SAASA,KACdC,GAAS,EACTC,UAAsB,EACU;EAChC;EACA,MAAMC,MAAA,GAA8B,CAAC;EAErC,KAAK,MAAMC,GAAA,IAAOH,GAAA,EAAK;IACrB,IAAIC,UAAA,CAAWG,OAAO,CAACD,GAAA,MAAS,CAAC,KAAKH,GAAA,CAAIK,cAAc,CAACF,GAAA,GAAM;MAC7DD,MAAM,CAACC,GAAA,CAAI,GAAGH,GAAG,CAACG,GAAA,CAAI;IACxB;EACF;EAEA,OAAOD,MAAA;AACT"}
+{"version":3,"sources":["omit.ts"],"sourcesContent":["/**\n * Tiny helper to do the minimal amount of work in duplicating an object but omitting some\n * props. This ends up faster than using object ...rest or reduce to filter.\n *\n * This behaves very much like filteredAssign, but does not merge many objects together,\n * uses an exclusion object map, and avoids spreads all for optimal performance.\n *\n * See perf test for background:\n * https://jsperf.com/omit-vs-rest-vs-reduce/1\n *\n * @param obj - The object to clone\n * @param exclusions - The array of keys to exclude\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function omit<TObj extends Record<string, any>, Exclusions extends (keyof TObj)[]>(\n  obj: TObj,\n  exclusions: Exclusions,\n): Omit<TObj, Exclusions[number]> {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const result: Record<string, any> = {};\n\n  for (const key in obj) {\n    if (exclusions.indexOf(key) === -1 && obj.hasOwnProperty(key)) {\n      result[key] = obj[key];\n    }\n  }\n\n  return result as TObj;\n}\n"],"names":["omit","obj","exclusions","result","key","indexOf","hasOwnProperty"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GACD,8DAA8D;AAC9D,OAAO,SAASA,KACdC,GAAS,EACTC,UAAsB,EACU;IAChC,8DAA8D;IAC9D,MAAMC,SAA8B,CAAC;IAErC,IAAK,MAAMC,OAAOH,IAAK;QACrB,IAAIC,WAAWG,OAAO,CAACD,SAAS,CAAC,KAAKH,IAAIK,cAAc,CAACF,MAAM;YAC7DD,MAAM,CAACC,IAAI,GAAGH,GAAG,CAACG,IAAI;QACxB,CAAC;IACH;IAEA,OAAOD;AACT,CAAC"}

package/lib/utils/priorityQueue.js

@@ -1,93 +1,92 @@
 /**
  * @internal
  */ /**
-    * @internal
-    * @param compare - comparison function for items
-    * @returns Priority queue implemented with a min heap
-    */export function createPriorityQueue(compare) {
-  const arr = [];
-  let size = 0;
-  const swap = (a, b) => {
-    const tmp = arr[a];
-    arr[a] = arr[b];
-    arr[b] = tmp;
-  };
-  const heapify = i => {
-    let smallest = i;
-    const l = left(i);
-    const r = right(i);
-    if (l < size && compare(arr[l], arr[smallest]) < 0) {
-      smallest = l;
-    }
-    if (r < size && compare(arr[r], arr[smallest]) < 0) {
-      smallest = r;
-    }
-    if (smallest !== i) {
-      swap(smallest, i);
-      heapify(smallest);
-    }
-  };
-  const dequeue = () => {
-    if (size === 0) {
-      throw new Error('Priority queue empty');
-    }
-    const res = arr[0];
-    arr[0] = arr[--size];
-    heapify(0);
-    return res;
-  };
-  const peek = () => {
-    if (size === 0) {
-      return null;
-    }
-    return arr[0];
-  };
-  const enqueue = item => {
-    arr[size++] = item;
-    let i = size - 1;
-    let p = parent(i);
-    while (i > 0 && compare(arr[p], arr[i]) > 0) {
-      swap(p, i);
-      i = p;
-      p = parent(i);
-    }
-  };
-  const contains = item => {
-    const index = arr.indexOf(item);
-    return index >= 0 && index < size;
-  };
-  const remove = item => {
-    const i = arr.indexOf(item);
-    if (i === -1 || i >= size) {
-      return;
-    }
-    arr[i] = arr[--size];
-    heapify(i);
-  };
-  const clear = () => {
-    size = 0;
-  };
-  const all = () => {
-    return arr.slice(0, size);
-  };
-  return {
-    all,
-    clear,
-    contains,
-    dequeue,
-    enqueue,
-    peek,
-    remove,
-    size: () => size
-  };
+ * @internal
+ * @param compare - comparison function for items
+ * @returns Priority queue implemented with a min heap
+ */ export function createPriorityQueue(compare) {
+    const arr = [];
+    let size = 0;
+    const swap = (a, b)=>{
+        const tmp = arr[a];
+        arr[a] = arr[b];
+        arr[b] = tmp;
+    };
+    const heapify = (i)=>{
+        let smallest = i;
+        const l = left(i);
+        const r = right(i);
+        if (l < size && compare(arr[l], arr[smallest]) < 0) {
+            smallest = l;
+        }
+        if (r < size && compare(arr[r], arr[smallest]) < 0) {
+            smallest = r;
+        }
+        if (smallest !== i) {
+            swap(smallest, i);
+            heapify(smallest);
+        }
+    };
+    const dequeue = ()=>{
+        if (size === 0) {
+            throw new Error('Priority queue empty');
+        }
+        const res = arr[0];
+        arr[0] = arr[--size];
+        heapify(0);
+        return res;
+    };
+    const peek = ()=>{
+        if (size === 0) {
+            return null;
+        }
+        return arr[0];
+    };
+    const enqueue = (item)=>{
+        arr[size++] = item;
+        let i = size - 1;
+        let p = parent(i);
+        while(i > 0 && compare(arr[p], arr[i]) > 0){
+            swap(p, i);
+            i = p;
+            p = parent(i);
+        }
+    };
+    const contains = (item)=>{
+        const index = arr.indexOf(item);
+        return index >= 0 && index < size;
+    };
+    const remove = (item)=>{
+        const i = arr.indexOf(item);
+        if (i === -1 || i >= size) {
+            return;
+        }
+        arr[i] = arr[--size];
+        heapify(i);
+    };
+    const clear = ()=>{
+        size = 0;
+    };
+    const all = ()=>{
+        return arr.slice(0, size);
+    };
+    return {
+        all,
+        clear,
+        contains,
+        dequeue,
+        enqueue,
+        peek,
+        remove,
+        size: ()=>size
+    };
 }
-const left = i => {
-  return 2 * i + 1;
+const left = (i)=>{
+    return 2 * i + 1;
 };
-const right = i => {
-  return 2 * i + 2;
+const right = (i)=>{
+    return 2 * i + 2;
 };
-const parent = i => {
-  return Math.floor((i - 1) / 2);
+const parent = (i)=>{
+    return Math.floor((i - 1) / 2);
 };
-//# sourceMappingURL=priorityQueue.js.map

package/lib/utils/priorityQueue.js.map

@@ -1 +1 @@
-{"version":3,"names":["createPriorityQueue","compare","arr","size","swap","a","b","tmp","heapify","i","smallest","l","left","r","right","dequeue","Error","res","peek","enqueue","item","p","parent","contains","index","indexOf","remove","clear","all","slice","Math","floor"],"sources":["../../src/utils/priorityQueue.ts"],"sourcesContent":["/**\n * @internal\n */\nexport type PriorityQueueCompareFn<T> = (a: T, b: T) => number;\n\n/**\n * @internal\n */\nexport interface PriorityQueue<T> {\n  all: () => T[];\n  clear: () => void;\n  contains: (item: T) => boolean;\n  dequeue: () => T;\n  enqueue: (item: T) => void;\n  peek: () => T | null;\n  remove: (item: T) => void;\n  size: () => number;\n}\n\n/**\n * @internal\n * @param compare - comparison function for items\n * @returns Priority queue implemented with a min heap\n */\nexport function createPriorityQueue<T>(compare: PriorityQueueCompareFn<T>): PriorityQueue<T> {\n  const arr: T[] = [];\n  let size = 0;\n\n  const swap = (a: number, b: number) => {\n    const tmp = arr[a];\n    arr[a] = arr[b];\n    arr[b] = tmp;\n  };\n\n  const heapify = (i: number) => {\n    let smallest = i;\n    const l = left(i);\n    const r = right(i);\n\n    if (l < size && compare(arr[l], arr[smallest]) < 0) {\n      smallest = l;\n    }\n\n    if (r < size && compare(arr[r], arr[smallest]) < 0) {\n      smallest = r;\n    }\n\n    if (smallest !== i) {\n      swap(smallest, i);\n      heapify(smallest);\n    }\n  };\n\n  const dequeue = () => {\n    if (size === 0) {\n      throw new Error('Priority queue empty');\n    }\n\n    const res = arr[0];\n    arr[0] = arr[--size];\n    heapify(0);\n\n    return res;\n  };\n\n  const peek = () => {\n    if (size === 0) {\n      return null;\n    }\n\n    return arr[0];\n  };\n\n  const enqueue = (item: T) => {\n    arr[size++] = item;\n    let i = size - 1;\n    let p = parent(i);\n    while (i > 0 && compare(arr[p], arr[i]) > 0) {\n      swap(p, i);\n      i = p;\n      p = parent(i);\n    }\n  };\n\n  const contains = (item: T) => {\n    const index = arr.indexOf(item);\n    return index >= 0 && index < size;\n  };\n\n  const remove = (item: T) => {\n    const i = arr.indexOf(item);\n\n    if (i === -1 || i >= size) {\n      return;\n    }\n\n    arr[i] = arr[--size];\n    heapify(i);\n  };\n\n  const clear = () => {\n    size = 0;\n  };\n\n  const all = () => {\n    return arr.slice(0, size);\n  };\n\n  return {\n    all,\n    clear,\n    contains,\n    dequeue,\n    enqueue,\n    peek,\n    remove,\n    size: () => size,\n  };\n}\n\nconst left = (i: number) => {\n  return 2 * i + 1;\n};\n\nconst right = (i: number) => {\n  return 2 * i + 2;\n};\n\nconst parent = (i: number) => {\n  return Math.floor((i - 1) / 2);\n};\n"],"mappings":"AAAA;;GAAA,CAmBA;;;;MAKA,OAAO,SAASA,oBAAuBC,OAAkC,EAAoB;EAC3F,MAAMC,GAAA,GAAW,EAAE;EACnB,IAAIC,IAAA,GAAO;EAEX,MAAMC,IAAA,GAAOA,CAACC,CAAA,EAAWC,CAAA,KAAc;IACrC,MAAMC,GAAA,GAAML,GAAG,CAACG,CAAA,CAAE;IAClBH,GAAG,CAACG,CAAA,CAAE,GAAGH,GAAG,CAACI,CAAA,CAAE;IACfJ,GAAG,CAACI,CAAA,CAAE,GAAGC,GAAA;EACX;EAEA,MAAMC,OAAA,GAAWC,CAAA,IAAc;IAC7B,IAAIC,QAAA,GAAWD,CAAA;IACf,MAAME,CAAA,GAAIC,IAAA,CAAKH,CAAA;IACf,MAAMI,CAAA,GAAIC,KAAA,CAAML,CAAA;IAEhB,IAAIE,CAAA,GAAIR,IAAA,IAAQF,OAAA,CAAQC,GAAG,CAACS,CAAA,CAAE,EAAET,GAAG,CAACQ,QAAA,CAAS,IAAI,GAAG;MAClDA,QAAA,GAAWC,CAAA;IACb;IAEA,IAAIE,CAAA,GAAIV,IAAA,IAAQF,OAAA,CAAQC,GAAG,CAACW,CAAA,CAAE,EAAEX,GAAG,CAACQ,QAAA,CAAS,IAAI,GAAG;MAClDA,QAAA,GAAWG,CAAA;IACb;IAEA,IAAIH,QAAA,KAAaD,CAAA,EAAG;MAClBL,IAAA,CAAKM,QAAA,EAAUD,CAAA;MACfD,OAAA,CAAQE,QAAA;IACV;EACF;EAEA,MAAMK,OAAA,GAAUA,CAAA,KAAM;IACpB,IAAIZ,IAAA,KAAS,GAAG;MACd,MAAM,IAAIa,KAAA,CAAM;IAClB;IAEA,MAAMC,GAAA,GAAMf,GAAG,CAAC,EAAE;IAClBA,GAAG,CAAC,EAAE,GAAGA,GAAG,CAAC,EAAEC,IAAA,CAAK;IACpBK,OAAA,CAAQ;IAER,OAAOS,GAAA;EACT;EAEA,MAAMC,IAAA,GAAOA,CAAA,KAAM;IACjB,IAAIf,IAAA,KAAS,GAAG;MACd,OAAO,IAAI;IACb;IAEA,OAAOD,GAAG,CAAC,EAAE;EACf;EAEA,MAAMiB,OAAA,GAAWC,IAAA,IAAY;IAC3BlB,GAAG,CAACC,IAAA,GAAO,GAAGiB,IAAA;IACd,IAAIX,CAAA,GAAIN,IAAA,GAAO;IACf,IAAIkB,CAAA,GAAIC,MAAA,CAAOb,CAAA;IACf,OAAOA,CAAA,GAAI,KAAKR,OAAA,CAAQC,GAAG,CAACmB,CAAA,CAAE,EAAEnB,GAAG,CAACO,CAAA,CAAE,IAAI,GAAG;MAC3CL,IAAA,CAAKiB,CAAA,EAAGZ,CAAA;MACRA,CAAA,GAAIY,CAAA;MACJA,CAAA,GAAIC,MAAA,CAAOb,CAAA;IACb;EACF;EAEA,MAAMc,QAAA,GAAYH,IAAA,IAAY;IAC5B,MAAMI,KAAA,GAAQtB,GAAA,CAAIuB,OAAO,CAACL,IAAA;IAC1B,OAAOI,KAAA,IAAS,KAAKA,KAAA,GAAQrB,IAAA;EAC/B;EAEA,MAAMuB,MAAA,GAAUN,IAAA,IAAY;IAC1B,MAAMX,CAAA,GAAIP,GAAA,CAAIuB,OAAO,CAACL,IAAA;IAEtB,IAAIX,CAAA,KAAM,CAAC,KAAKA,CAAA,IAAKN,IAAA,EAAM;MACzB;IACF;IAEAD,GAAG,CAACO,CAAA,CAAE,GAAGP,GAAG,CAAC,EAAEC,IAAA,CAAK;IACpBK,OAAA,CAAQC,CAAA;EACV;EAEA,MAAMkB,KAAA,GAAQA,CAAA,KAAM;IAClBxB,IAAA,GAAO;EACT;EAEA,MAAMyB,GAAA,GAAMA,CAAA,KAAM;IAChB,OAAO1B,GAAA,CAAI2B,KAAK,CAAC,GAAG1B,IAAA;EACtB;EAEA,OAAO;IACLyB,GAAA;IACAD,KAAA;IACAJ,QAAA;IACAR,OAAA;IACAI,OAAA;IACAD,IAAA;IACAQ,MAAA;IACAvB,IAAA,EAAMA,CAAA,KAAMA;EACd;AACF;AAEA,MAAMS,IAAA,GAAQH,CAAA,IAAc;EAC1B,OAAO,IAAIA,CAAA,GAAI;AACjB;AAEA,MAAMK,KAAA,GAASL,CAAA,IAAc;EAC3B,OAAO,IAAIA,CAAA,GAAI;AACjB;AAEA,MAAMa,MAAA,GAAUb,CAAA,IAAc;EAC5B,OAAOqB,IAAA,CAAKC,KAAK,CAAC,CAACtB,CAAA,GAAI,KAAK;AAC9B"}
+{"version":3,"sources":["priorityQueue.ts"],"sourcesContent":["/**\n * @internal\n */\nexport type PriorityQueueCompareFn<T> = (a: T, b: T) => number;\n\n/**\n * @internal\n */\nexport interface PriorityQueue<T> {\n  all: () => T[];\n  clear: () => void;\n  contains: (item: T) => boolean;\n  dequeue: () => T;\n  enqueue: (item: T) => void;\n  peek: () => T | null;\n  remove: (item: T) => void;\n  size: () => number;\n}\n\n/**\n * @internal\n * @param compare - comparison function for items\n * @returns Priority queue implemented with a min heap\n */\nexport function createPriorityQueue<T>(compare: PriorityQueueCompareFn<T>): PriorityQueue<T> {\n  const arr: T[] = [];\n  let size = 0;\n\n  const swap = (a: number, b: number) => {\n    const tmp = arr[a];\n    arr[a] = arr[b];\n    arr[b] = tmp;\n  };\n\n  const heapify = (i: number) => {\n    let smallest = i;\n    const l = left(i);\n    const r = right(i);\n\n    if (l < size && compare(arr[l], arr[smallest]) < 0) {\n      smallest = l;\n    }\n\n    if (r < size && compare(arr[r], arr[smallest]) < 0) {\n      smallest = r;\n    }\n\n    if (smallest !== i) {\n      swap(smallest, i);\n      heapify(smallest);\n    }\n  };\n\n  const dequeue = () => {\n    if (size === 0) {\n      throw new Error('Priority queue empty');\n    }\n\n    const res = arr[0];\n    arr[0] = arr[--size];\n    heapify(0);\n\n    return res;\n  };\n\n  const peek = () => {\n    if (size === 0) {\n      return null;\n    }\n\n    return arr[0];\n  };\n\n  const enqueue = (item: T) => {\n    arr[size++] = item;\n    let i = size - 1;\n    let p = parent(i);\n    while (i > 0 && compare(arr[p], arr[i]) > 0) {\n      swap(p, i);\n      i = p;\n      p = parent(i);\n    }\n  };\n\n  const contains = (item: T) => {\n    const index = arr.indexOf(item);\n    return index >= 0 && index < size;\n  };\n\n  const remove = (item: T) => {\n    const i = arr.indexOf(item);\n\n    if (i === -1 || i >= size) {\n      return;\n    }\n\n    arr[i] = arr[--size];\n    heapify(i);\n  };\n\n  const clear = () => {\n    size = 0;\n  };\n\n  const all = () => {\n    return arr.slice(0, size);\n  };\n\n  return {\n    all,\n    clear,\n    contains,\n    dequeue,\n    enqueue,\n    peek,\n    remove,\n    size: () => size,\n  };\n}\n\nconst left = (i: number) => {\n  return 2 * i + 1;\n};\n\nconst right = (i: number) => {\n  return 2 * i + 2;\n};\n\nconst parent = (i: number) => {\n  return Math.floor((i - 1) / 2);\n};\n"],"names":["createPriorityQueue","compare","arr","size","swap","a","b","tmp","heapify","i","smallest","l","left","r","right","dequeue","Error","res","peek","enqueue","item","p","parent","contains","index","indexOf","remove","clear","all","slice","Math","floor"],"mappings":"AAAA;;CAEC,GAiBD;;;;CAIC,GACD,OAAO,SAASA,oBAAuBC,OAAkC,EAAoB;IAC3F,MAAMC,MAAW,EAAE;IACnB,IAAIC,OAAO;IAEX,MAAMC,OAAO,CAACC,GAAWC,IAAc;QACrC,MAAMC,MAAML,GAAG,CAACG,EAAE;QAClBH,GAAG,CAACG,EAAE,GAAGH,GAAG,CAACI,EAAE;QACfJ,GAAG,CAACI,EAAE,GAAGC;IACX;IAEA,MAAMC,UAAU,CAACC,IAAc;QAC7B,IAAIC,WAAWD;QACf,MAAME,IAAIC,KAAKH;QACf,MAAMI,IAAIC,MAAML;QAEhB,IAAIE,IAAIR,QAAQF,QAAQC,GAAG,CAACS,EAAE,EAAET,GAAG,CAACQ,SAAS,IAAI,GAAG;YAClDA,WAAWC;QACb,CAAC;QAED,IAAIE,IAAIV,QAAQF,QAAQC,GAAG,CAACW,EAAE,EAAEX,GAAG,CAACQ,SAAS,IAAI,GAAG;YAClDA,WAAWG;QACb,CAAC;QAED,IAAIH,aAAaD,GAAG;YAClBL,KAAKM,UAAUD;YACfD,QAAQE;QACV,CAAC;IACH;IAEA,MAAMK,UAAU,IAAM;QACpB,IAAIZ,SAAS,GAAG;YACd,MAAM,IAAIa,MAAM,wBAAwB;QAC1C,CAAC;QAED,MAAMC,MAAMf,GAAG,CAAC,EAAE;QAClBA,GAAG,CAAC,EAAE,GAAGA,GAAG,CAAC,EAAEC,KAAK;QACpBK,QAAQ;QAER,OAAOS;IACT;IAEA,MAAMC,OAAO,IAAM;QACjB,IAAIf,SAAS,GAAG;YACd,OAAO,IAAI;QACb,CAAC;QAED,OAAOD,GAAG,CAAC,EAAE;IACf;IAEA,MAAMiB,UAAU,CAACC,OAAY;QAC3BlB,GAAG,CAACC,OAAO,GAAGiB;QACd,IAAIX,IAAIN,OAAO;QACf,IAAIkB,IAAIC,OAAOb;QACf,MAAOA,IAAI,KAAKR,QAAQC,GAAG,CAACmB,EAAE,EAAEnB,GAAG,CAACO,EAAE,IAAI,EAAG;YAC3CL,KAAKiB,GAAGZ;YACRA,IAAIY;YACJA,IAAIC,OAAOb;QACb;IACF;IAEA,MAAMc,WAAW,CAACH,OAAY;QAC5B,MAAMI,QAAQtB,IAAIuB,OAAO,CAACL;QAC1B,OAAOI,SAAS,KAAKA,QAAQrB;IAC/B;IAEA,MAAMuB,SAAS,CAACN,OAAY;QAC1B,MAAMX,IAAIP,IAAIuB,OAAO,CAACL;QAEtB,IAAIX,MAAM,CAAC,KAAKA,KAAKN,MAAM;YACzB;QACF,CAAC;QAEDD,GAAG,CAACO,EAAE,GAAGP,GAAG,CAAC,EAAEC,KAAK;QACpBK,QAAQC;IACV;IAEA,MAAMkB,QAAQ,IAAM;QAClBxB,OAAO;IACT;IAEA,MAAMyB,MAAM,IAAM;QAChB,OAAO1B,IAAI2B,KAAK,CAAC,GAAG1B;IACtB;IAEA,OAAO;QACLyB;QACAD;QACAJ;QACAR;QACAI;QACAD;QACAQ;QACAvB,MAAM,IAAMA;IACd;AACF,CAAC;AAED,MAAMS,OAAO,CAACH,IAAc;IAC1B,OAAO,IAAIA,IAAI;AACjB;AAEA,MAAMK,QAAQ,CAACL,IAAc;IAC3B,OAAO,IAAIA,IAAI;AACjB;AAEA,MAAMa,SAAS,CAACb,IAAc;IAC5B,OAAOqB,KAAKC,KAAK,CAAC,AAACtB,CAAAA,IAAI,CAAA,IAAK;AAC9B"}