@fluentui/priority-overflow 9.0.2 → 9.1.0

package/lib/priorityQueue.js

@@ -1,90 +1,89 @@
 /**
  * @param compare - comparison function for items
  * @returns Priority queue implemented with a min heap
- */export function createPriorityQueue(compare) {
-  const arr = [];
-  let size = 0;
-  const left = i => {
-    return 2 * i + 1;
-  };
-  const right = i => {
-    return 2 * i + 2;
-  };
-  const parent = i => {
-    return Math.floor((i - 1) / 2);
-  };
-  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
-  };
+ */ export function createPriorityQueue(compare) {
+    const arr = [];
+    let size = 0;
+    const left = (i)=>{
+        return 2 * i + 1;
+    };
+    const right = (i)=>{
+        return 2 * i + 2;
+    };
+    const parent = (i)=>{
+        return Math.floor((i - 1) / 2);
+    };
+    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
+    };
 }
-//# sourceMappingURL=priorityQueue.js.map

package/lib/priorityQueue.js.map

@@ -1 +1 @@
-{"version":3,"names":["createPriorityQueue","compare","arr","size","left","i","right","parent","Math","floor","swap","a","b","tmp","heapify","smallest","l","r","dequeue","Error","res","peek","enqueue","item","p","contains","index","indexOf","remove","clear","all","slice"],"sources":["../src/priorityQueue.ts"],"sourcesContent":["export type PriorityQueueCompareFn<T> = (a: T, b: T) => number;\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 * @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 left = (i: number) => {\n    return 2 * i + 1;\n  };\n\n  const right = (i: number) => {\n    return 2 * i + 2;\n  };\n\n  const parent = (i: number) => {\n    return Math.floor((i - 1) / 2);\n  };\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"],"mappings":"AAaA;;;GAIA,OAAO,SAASA,oBAAuBC,OAAkC,EAAoB;EAC3F,MAAMC,GAAA,GAAW,EAAE;EACnB,IAAIC,IAAA,GAAO;EAEX,MAAMC,IAAA,GAAQC,CAAA,IAAc;IAC1B,OAAO,IAAIA,CAAA,GAAI;EACjB;EAEA,MAAMC,KAAA,GAASD,CAAA,IAAc;IAC3B,OAAO,IAAIA,CAAA,GAAI;EACjB;EAEA,MAAME,MAAA,GAAUF,CAAA,IAAc;IAC5B,OAAOG,IAAA,CAAKC,KAAK,CAAC,CAACJ,CAAA,GAAI,KAAK;EAC9B;EAEA,MAAMK,IAAA,GAAOA,CAACC,CAAA,EAAWC,CAAA,KAAc;IACrC,MAAMC,GAAA,GAAMX,GAAG,CAACS,CAAA,CAAE;IAClBT,GAAG,CAACS,CAAA,CAAE,GAAGT,GAAG,CAACU,CAAA,CAAE;IACfV,GAAG,CAACU,CAAA,CAAE,GAAGC,GAAA;EACX;EAEA,MAAMC,OAAA,GAAWT,CAAA,IAAc;IAC7B,IAAIU,QAAA,GAAWV,CAAA;IACf,MAAMW,CAAA,GAAIZ,IAAA,CAAKC,CAAA;IACf,MAAMY,CAAA,GAAIX,KAAA,CAAMD,CAAA;IAEhB,IAAIW,CAAA,GAAIb,IAAA,IAAQF,OAAA,CAAQC,GAAG,CAACc,CAAA,CAAE,EAAEd,GAAG,CAACa,QAAA,CAAS,IAAI,GAAG;MAClDA,QAAA,GAAWC,CAAA;IACb;IAEA,IAAIC,CAAA,GAAId,IAAA,IAAQF,OAAA,CAAQC,GAAG,CAACe,CAAA,CAAE,EAAEf,GAAG,CAACa,QAAA,CAAS,IAAI,GAAG;MAClDA,QAAA,GAAWE,CAAA;IACb;IAEA,IAAIF,QAAA,KAAaV,CAAA,EAAG;MAClBK,IAAA,CAAKK,QAAA,EAAUV,CAAA;MACfS,OAAA,CAAQC,QAAA;IACV;EACF;EAEA,MAAMG,OAAA,GAAUA,CAAA,KAAM;IACpB,IAAIf,IAAA,KAAS,GAAG;MACd,MAAM,IAAIgB,KAAA,CAAM;IAClB;IAEA,MAAMC,GAAA,GAAMlB,GAAG,CAAC,EAAE;IAClBA,GAAG,CAAC,EAAE,GAAGA,GAAG,CAAC,EAAEC,IAAA,CAAK;IACpBW,OAAA,CAAQ;IAER,OAAOM,GAAA;EACT;EAEA,MAAMC,IAAA,GAAOA,CAAA,KAAM;IACjB,IAAIlB,IAAA,KAAS,GAAG;MACd,OAAO,IAAI;IACb;IAEA,OAAOD,GAAG,CAAC,EAAE;EACf;EAEA,MAAMoB,OAAA,GAAWC,IAAA,IAAY;IAC3BrB,GAAG,CAACC,IAAA,GAAO,GAAGoB,IAAA;IACd,IAAIlB,CAAA,GAAIF,IAAA,GAAO;IACf,IAAIqB,CAAA,GAAIjB,MAAA,CAAOF,CAAA;IACf,OAAOA,CAAA,GAAI,KAAKJ,OAAA,CAAQC,GAAG,CAACsB,CAAA,CAAE,EAAEtB,GAAG,CAACG,CAAA,CAAE,IAAI,GAAG;MAC3CK,IAAA,CAAKc,CAAA,EAAGnB,CAAA;MACRA,CAAA,GAAImB,CAAA;MACJA,CAAA,GAAIjB,MAAA,CAAOF,CAAA;IACb;EACF;EAEA,MAAMoB,QAAA,GAAYF,IAAA,IAAY;IAC5B,MAAMG,KAAA,GAAQxB,GAAA,CAAIyB,OAAO,CAACJ,IAAA;IAC1B,OAAOG,KAAA,IAAS,KAAKA,KAAA,GAAQvB,IAAA;EAC/B;EAEA,MAAMyB,MAAA,GAAUL,IAAA,IAAY;IAC1B,MAAMlB,CAAA,GAAIH,GAAA,CAAIyB,OAAO,CAACJ,IAAA;IAEtB,IAAIlB,CAAA,KAAM,CAAC,KAAKA,CAAA,IAAKF,IAAA,EAAM;MACzB;IACF;IAEAD,GAAG,CAACG,CAAA,CAAE,GAAGH,GAAG,CAAC,EAAEC,IAAA,CAAK;IACpBW,OAAA,CAAQT,CAAA;EACV;EAEA,MAAMwB,KAAA,GAAQA,CAAA,KAAM;IAClB1B,IAAA,GAAO;EACT;EAEA,MAAM2B,GAAA,GAAMA,CAAA,KAAM;IAChB,OAAO5B,GAAA,CAAI6B,KAAK,CAAC,GAAG5B,IAAA;EACtB;EAEA,OAAO;IACL2B,GAAA;IACAD,KAAA;IACAJ,QAAA;IACAP,OAAA;IACAI,OAAA;IACAD,IAAA;IACAO,MAAA;IACAzB,IAAA,EAAMA,CAAA,KAAMA;EACd;AACF"}
+{"version":3,"sources":["priorityQueue.ts"],"sourcesContent":["export type PriorityQueueCompareFn<T> = (a: T, b: T) => number;\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 * @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 left = (i: number) => {\n    return 2 * i + 1;\n  };\n\n  const right = (i: number) => {\n    return 2 * i + 2;\n  };\n\n  const parent = (i: number) => {\n    return Math.floor((i - 1) / 2);\n  };\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"],"names":["createPriorityQueue","compare","arr","size","left","i","right","parent","Math","floor","swap","a","b","tmp","heapify","smallest","l","r","dequeue","Error","res","peek","enqueue","item","p","contains","index","indexOf","remove","clear","all","slice"],"mappings":"AAaA;;;CAGC,GACD,OAAO,SAASA,oBAAuBC,OAAkC,EAAoB;IAC3F,MAAMC,MAAW,EAAE;IACnB,IAAIC,OAAO;IAEX,MAAMC,OAAO,CAACC,IAAc;QAC1B,OAAO,IAAIA,IAAI;IACjB;IAEA,MAAMC,QAAQ,CAACD,IAAc;QAC3B,OAAO,IAAIA,IAAI;IACjB;IAEA,MAAME,SAAS,CAACF,IAAc;QAC5B,OAAOG,KAAKC,KAAK,CAAC,AAACJ,CAAAA,IAAI,CAAA,IAAK;IAC9B;IAEA,MAAMK,OAAO,CAACC,GAAWC,IAAc;QACrC,MAAMC,MAAMX,GAAG,CAACS,EAAE;QAClBT,GAAG,CAACS,EAAE,GAAGT,GAAG,CAACU,EAAE;QACfV,GAAG,CAACU,EAAE,GAAGC;IACX;IAEA,MAAMC,UAAU,CAACT,IAAc;QAC7B,IAAIU,WAAWV;QACf,MAAMW,IAAIZ,KAAKC;QACf,MAAMY,IAAIX,MAAMD;QAEhB,IAAIW,IAAIb,QAAQF,QAAQC,GAAG,CAACc,EAAE,EAAEd,GAAG,CAACa,SAAS,IAAI,GAAG;YAClDA,WAAWC;QACb,CAAC;QAED,IAAIC,IAAId,QAAQF,QAAQC,GAAG,CAACe,EAAE,EAAEf,GAAG,CAACa,SAAS,IAAI,GAAG;YAClDA,WAAWE;QACb,CAAC;QAED,IAAIF,aAAaV,GAAG;YAClBK,KAAKK,UAAUV;YACfS,QAAQC;QACV,CAAC;IACH;IAEA,MAAMG,UAAU,IAAM;QACpB,IAAIf,SAAS,GAAG;YACd,MAAM,IAAIgB,MAAM,wBAAwB;QAC1C,CAAC;QAED,MAAMC,MAAMlB,GAAG,CAAC,EAAE;QAClBA,GAAG,CAAC,EAAE,GAAGA,GAAG,CAAC,EAAEC,KAAK;QACpBW,QAAQ;QAER,OAAOM;IACT;IAEA,MAAMC,OAAO,IAAM;QACjB,IAAIlB,SAAS,GAAG;YACd,OAAO,IAAI;QACb,CAAC;QAED,OAAOD,GAAG,CAAC,EAAE;IACf;IAEA,MAAMoB,UAAU,CAACC,OAAY;QAC3BrB,GAAG,CAACC,OAAO,GAAGoB;QACd,IAAIlB,IAAIF,OAAO;QACf,IAAIqB,IAAIjB,OAAOF;QACf,MAAOA,IAAI,KAAKJ,QAAQC,GAAG,CAACsB,EAAE,EAAEtB,GAAG,CAACG,EAAE,IAAI,EAAG;YAC3CK,KAAKc,GAAGnB;YACRA,IAAImB;YACJA,IAAIjB,OAAOF;QACb;IACF;IAEA,MAAMoB,WAAW,CAACF,OAAY;QAC5B,MAAMG,QAAQxB,IAAIyB,OAAO,CAACJ;QAC1B,OAAOG,SAAS,KAAKA,QAAQvB;IAC/B;IAEA,MAAMyB,SAAS,CAACL,OAAY;QAC1B,MAAMlB,IAAIH,IAAIyB,OAAO,CAACJ;QAEtB,IAAIlB,MAAM,CAAC,KAAKA,KAAKF,MAAM;YACzB;QACF,CAAC;QAEDD,GAAG,CAACG,EAAE,GAAGH,GAAG,CAAC,EAAEC,KAAK;QACpBW,QAAQT;IACV;IAEA,MAAMwB,QAAQ,IAAM;QAClB1B,OAAO;IACT;IAEA,MAAM2B,MAAM,IAAM;QAChB,OAAO5B,IAAI6B,KAAK,CAAC,GAAG5B;IACtB;IAEA,OAAO;QACL2B;QACAD;QACAJ;QACAP;QACAI;QACAD;QACAO;QACAzB,MAAM,IAAMA;IACd;AACF,CAAC"}

package/lib/types.js

@@ -1,2 +1 @@
-export {};
-//# sourceMappingURL=types.js.map
+export { };

package/lib/types.js.map

@@ -1 +1 @@
-{"version":3,"names":[],"sources":["../src/types.ts"],"sourcesContent":["export type OverflowDirection = 'start' | 'end';\nexport type OverflowAxis = 'horizontal' | 'vertical';\nexport type OverflowGroupState = 'visible' | 'hidden' | 'overflow';\nexport interface OverflowItemEntry {\n  /**\n   * HTML element that will be disappear when overflowed\n   */\n  element: HTMLElement;\n  /**\n   * Lower priority items are invisible first when the container is overflowed\n   * @default 0\n   */\n  priority: number;\n  /**\n   * Specific id, used to track visibility and provide updates to consumers\n   */\n  id: string;\n\n  groupId?: string;\n}\n\n/**\n * signature similar to standard event listeners, but typed to handle the custom event\n */\nexport type OnUpdateOverflow = (data: OverflowEventPayload) => void;\n\nexport type OnUpdateItemVisibility = (data: OnUpdateItemVisibilityPayload) => void;\n\n/**\n * Payload of the custom DOM event for overflow updates\n */\nexport interface OverflowEventPayload {\n  visibleItems: OverflowItemEntry[];\n  invisibleItems: OverflowItemEntry[];\n  groupVisibility: Record<string, OverflowGroupState>;\n}\n\nexport interface OnUpdateItemVisibilityPayload {\n  item: OverflowItemEntry;\n  visible: boolean;\n}\n\nexport interface ObserveOptions {\n  /**\n   * Padding (in px) at the end of the container before overflow occurs\n   * Useful to account for extra elements (i.e. dropdown menu)\n   * or to account for any kinds of margins between items which are hard to measure with JS\n   * @default 10\n   */\n  padding?: number;\n  /**\n   * Direction where items are removed when overflow occurs\n   * @default end\n   */\n  overflowDirection?: OverflowDirection;\n\n  /**\n   * Horizontal or vertical overflow\n   * @default horizontal\n   */\n  overflowAxis?: OverflowAxis;\n\n  /**\n   * The minimum number of visible items\n   */\n  minimumVisible?: number;\n\n  /**\n   * Callback when item visibility is updated\n   */\n  onUpdateItemVisibility: OnUpdateItemVisibility;\n\n  /**\n   * Callback when item visibility is updated\n   */\n  onUpdateOverflow: OnUpdateOverflow;\n}\n\n/**\n * @internal\n */\nexport interface OverflowManager {\n  /**\n   * Starts observing the container and managing the overflow state\n   */\n  observe: (container: HTMLElement, options: ObserveOptions) => void;\n  /**\n   * Stops observing the container\n   */\n  disconnect: () => void;\n  /**\n   * Add overflow items\n   */\n  addItem: (items: OverflowItemEntry) => void;\n  /**\n   * Remove overflow item\n   */\n  removeItem: (itemId: string) => void;\n  /**\n   * Manually update the overflow, updates are batched and async\n   */\n  update: () => void;\n  /**\n   * Manually update the overflow sync\n   */\n  forceUpdate: () => void;\n\n  /**\n   * Adds an element that opens an overflow menu. This is used to calculate\n   * available space and check if additional items need to overflow\n   */\n  addOverflowMenu: (element: HTMLElement) => void;\n\n  /**\n   * Unsets the overflow menu element\n   */\n  removeOverflowMenu: () => void;\n}\n"],"mappings":"AAAA"}
+{"version":3,"sources":["types.ts"],"sourcesContent":["export type OverflowDirection = 'start' | 'end';\nexport type OverflowAxis = 'horizontal' | 'vertical';\nexport type OverflowGroupState = 'visible' | 'hidden' | 'overflow';\nexport interface OverflowItemEntry {\n  /**\n   * HTML element that will be disappear when overflowed\n   */\n  element: HTMLElement;\n  /**\n   * Lower priority items are invisible first when the container is overflowed\n   * @default 0\n   */\n  priority: number;\n  /**\n   * Specific id, used to track visibility and provide updates to consumers\n   */\n  id: string;\n\n  groupId?: string;\n}\n\nexport interface OverflowDividerEntry {\n  /**\n   * HTML element that will be disappear when overflowed\n   */\n  element: HTMLElement;\n\n  groupId: string;\n}\n\n/**\n * signature similar to standard event listeners, but typed to handle the custom event\n */\nexport type OnUpdateOverflow = (data: OverflowEventPayload) => void;\n\nexport type OnUpdateItemVisibility = (data: OnUpdateItemVisibilityPayload) => void;\n\n/**\n * Payload of the custom DOM event for overflow updates\n */\nexport interface OverflowEventPayload {\n  visibleItems: OverflowItemEntry[];\n  invisibleItems: OverflowItemEntry[];\n  groupVisibility: Record<string, OverflowGroupState>;\n}\n\nexport interface OnUpdateItemVisibilityPayload {\n  item: OverflowItemEntry;\n  visible: boolean;\n}\n\nexport interface ObserveOptions {\n  /**\n   * Padding (in px) at the end of the container before overflow occurs\n   * Useful to account for extra elements (i.e. dropdown menu)\n   * or to account for any kinds of margins between items which are hard to measure with JS\n   * @default 10\n   */\n  padding?: number;\n  /**\n   * Direction where items are removed when overflow occurs\n   * @default end\n   */\n  overflowDirection?: OverflowDirection;\n\n  /**\n   * Horizontal or vertical overflow\n   * @default horizontal\n   */\n  overflowAxis?: OverflowAxis;\n\n  /**\n   * The minimum number of visible items\n   */\n  minimumVisible?: number;\n\n  /**\n   * Callback when item visibility is updated\n   */\n  onUpdateItemVisibility: OnUpdateItemVisibility;\n\n  /**\n   * Callback when item visibility is updated\n   */\n  onUpdateOverflow: OnUpdateOverflow;\n}\n\n/**\n * @internal\n */\nexport interface OverflowManager {\n  /**\n   * Starts observing the container and managing the overflow state\n   */\n  observe: (container: HTMLElement, options: ObserveOptions) => void;\n  /**\n   * Stops observing the container\n   */\n  disconnect: () => void;\n  /**\n   * Add overflow items\n   */\n  addItem: (items: OverflowItemEntry) => void;\n  /**\n   * Remove overflow item\n   */\n  removeItem: (itemId: string) => void;\n  /**\n   * Manually update the overflow, updates are batched and async\n   */\n  update: () => void;\n  /**\n   * Manually update the overflow sync\n   */\n  forceUpdate: () => void;\n\n  /**\n   * Adds an element that opens an overflow menu. This is used to calculate\n   * available space and check if additional items need to overflow\n   */\n  addOverflowMenu: (element: HTMLElement) => void;\n\n  /**\n   * Add overflow divider\n   */\n  addDivider: (divider: OverflowDividerEntry) => void;\n\n  /**\n   * Remove overflow divider\n   */\n  removeDivider: (groupId: string) => void;\n\n  /**\n   * Unsets the overflow menu element\n   */\n  removeOverflowMenu: () => void;\n}\n"],"names":[],"mappings":"AAAA,WAwIC"}

package/lib-commonjs/consts.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+function _export(target, all) {
+    for(var name in all)Object.defineProperty(target, name, {
+        enumerable: true,
+        get: all[name]
+    });
+}
+_export(exports, {
+    DATA_OVERFLOWING: ()=>DATA_OVERFLOWING,
+    DATA_OVERFLOW_GROUP: ()=>DATA_OVERFLOW_GROUP
+});
+const DATA_OVERFLOWING = 'data-overflowing';
+const DATA_OVERFLOW_GROUP = 'data-overflow-group';

package/lib-commonjs/consts.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["consts.js"],"sourcesContent":["export const DATA_OVERFLOWING = 'data-overflowing';\nexport const DATA_OVERFLOW_GROUP = 'data-overflow-group';\n"],"names":["DATA_OVERFLOWING","DATA_OVERFLOW_GROUP"],"mappings":";;;;;;;;;;;IAAaA,gBAAgB,MAAhBA;IACAC,mBAAmB,MAAnBA;;AADN,MAAMD,mBAAmB;AACzB,MAAMC,sBAAsB"}

package/lib-commonjs/debounce.js

@@ -24,6 +24,4 @@ function debounce(fn) {
             });
         }
     };
-} //# sourceMappingURL=debounce.js.map
-
-//# sourceMappingURL=debounce.js.map
+}

package/lib-commonjs/debounce.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../lib/debounce.js"],"sourcesContent":["/**\n * Microtask debouncer\n * https://developer.mozilla.org/en-US/docs/Web/API/HTML_DOM_API/Microtask_guide\n * @param fn - Function to debounce\n * @returns debounced function\n */export function debounce(fn) {\n  let pending;\n  return () => {\n    if (!pending) {\n      pending = true;\n      queueMicrotask(() => {\n        // Need to set pending to `false` before the debounced function is run.\n        // React can actually interrupt the function while it's running!\n        pending = false;\n        fn();\n      });\n    }\n  };\n}\n//# sourceMappingURL=debounce.js.map"],"names":["debounce","fn","pending","queueMicrotask"],"mappings":"AAAA;;;;;CAKC;;;;+BAAkBA;;aAAAA;;AAAT,SAASA,SAASC,EAAE,EAAE;IAC9B,IAAIC;IACJ,OAAO,IAAM;QACX,IAAI,CAACA,SAAS;YACZA,UAAU,IAAI;YACdC,eAAe,IAAM;gBACnB,uEAAuE;gBACvE,gEAAgE;gBAChED,UAAU,KAAK;gBACfD;YACF;QACF,CAAC;IACH;AACF,EACA,oCAAoC"}
+{"version":3,"sources":["debounce.js"],"sourcesContent":["/**\n * Microtask debouncer\n * https://developer.mozilla.org/en-US/docs/Web/API/HTML_DOM_API/Microtask_guide\n * @param fn - Function to debounce\n * @returns debounced function\n */ export function debounce(fn) {\n    let pending;\n    return ()=>{\n        if (!pending) {\n            pending = true;\n            queueMicrotask(()=>{\n                // Need to set pending to `false` before the debounced function is run.\n                // React can actually interrupt the function while it's running!\n                pending = false;\n                fn();\n            });\n        }\n    };\n}\n"],"names":["debounce","fn","pending","queueMicrotask"],"mappings":"AAAA;;;;;CAKC;;;;+BAAmBA;;aAAAA;;AAAT,SAASA,SAASC,EAAE,EAAE;IAC7B,IAAIC;IACJ,OAAO,IAAI;QACP,IAAI,CAACA,SAAS;YACVA,UAAU,IAAI;YACdC,eAAe,IAAI;gBACf,uEAAuE;gBACvE,gEAAgE;gBAChED,UAAU,KAAK;gBACfD;YACJ;QACJ,CAAC;IACL;AACJ"}

package/lib-commonjs/index.js

@@ -7,6 +7,3 @@ Object.defineProperty(exports, "createOverflowManager", {
     get: ()=>_overflowManager.createOverflowManager
 });
 const _overflowManager = require("./overflowManager");
- //# sourceMappingURL=index.js.map
-
-//# sourceMappingURL=index.js.map

package/lib-commonjs/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../lib/index.js"],"sourcesContent":["export { createOverflowManager } from './overflowManager';\n//# sourceMappingURL=index.js.map"],"names":["createOverflowManager"],"mappings":";;;;+BAASA;;aAAAA,sCAAqB;;iCAAQ;CACtC,iCAAiC"}
+{"version":3,"sources":["index.js"],"sourcesContent":["export { createOverflowManager } from './overflowManager';\n"],"names":["createOverflowManager"],"mappings":";;;;+BAASA;;aAAAA,sCAAqB;;iCAAQ"}

package/lib-commonjs/overflowManager.js

@@ -6,15 +6,18 @@ Object.defineProperty(exports, "createOverflowManager", {
     enumerable: true,
     get: ()=>createOverflowManager
 });
+const _consts = require("./consts");
 const _debounce = require("./debounce");
 const _priorityQueue = require("./priorityQueue");
+var _groups, _groupId;
 function createOverflowManager() {
     let container;
     let overflowMenu;
     // Set as true when resize observer is observing
     let observing = false;
     // If true, next update will dispatch to onUpdateOverflow even if queue top states don't change
-    let forceDispatch = false;
+    // Initially true to force dispatch on first mount
+    let forceDispatch = true;
     const options = {
         padding: 10,
         overflowAxis: 'horizontal',
@@ -24,13 +27,66 @@ function createOverflowManager() {
         onUpdateOverflow: ()=>undefined
     };
     const overflowItems = {};
-    const overflowGroups = {};
+    const overflowDividers = {};
     const resizeObserver = new ResizeObserver((entries)=>{
         if (!entries[0] || !container) {
             return;
         }
         update();
     });
+    const getNextItem = (queueToDequeue, queueToEnqueue)=>{
+        const nextItem = queueToDequeue.dequeue();
+        queueToEnqueue.enqueue(nextItem);
+        return overflowItems[nextItem];
+    };
+    const createGroupManager = ()=>{
+        const groupVisibility = {};
+        const groups = {};
+        function updateGroupVisibility(groupId) {
+            const group = groups[groupId];
+            if (group.invisibleItemIds.size && group.visibleItemIds.size) {
+                groupVisibility[groupId] = 'overflow';
+            } else if (group.visibleItemIds.size === 0) {
+                groupVisibility[groupId] = 'hidden';
+            } else {
+                groupVisibility[groupId] = 'visible';
+            }
+        }
+        function isGroupVisible(groupId) {
+            return groupVisibility[groupId] === 'visible' || groupVisibility[groupId] === 'overflow';
+        }
+        return {
+            groupVisibility: ()=>groupVisibility,
+            isSingleItemVisible (itemId, groupId) {
+                return isGroupVisible(groupId) && groups[groupId].visibleItemIds.has(itemId) && groups[groupId].visibleItemIds.size === 1;
+            },
+            addItem (itemId, groupId) {
+                var _;
+                (_ = (_groups = groups)[_groupId = groupId]) !== null && _ !== void 0 ? _ : _groups[_groupId] = {
+                    visibleItemIds: new Set(),
+                    invisibleItemIds: new Set()
+                };
+                groups[groupId].visibleItemIds.add(itemId);
+                updateGroupVisibility(groupId);
+            },
+            removeItem (itemId, groupId) {
+                groups[groupId].invisibleItemIds.delete(itemId);
+                groups[groupId].visibleItemIds.delete(itemId);
+                updateGroupVisibility(groupId);
+            },
+            showItem (itemId, groupId) {
+                groups[groupId].invisibleItemIds.delete(itemId);
+                groups[groupId].visibleItemIds.add(itemId);
+                updateGroupVisibility(groupId);
+            },
+            hideItem (itemId, groupId) {
+                groups[groupId].invisibleItemIds.add(itemId);
+                groups[groupId].visibleItemIds.delete(itemId);
+                updateGroupVisibility(groupId);
+            }
+        };
+    };
+    const groupManager = createGroupManager();
     const invisibleItemQueue = (0, _priorityQueue.createPriorityQueue)((a, b)=>{
         const itemA = overflowItems[a];
         const itemB = overflowItems[b];
@@ -60,32 +116,38 @@ function createOverflowManager() {
     const getOffsetSize = (el)=>{
         return options.overflowAxis === 'horizontal' ? el.offsetWidth : el.offsetHeight;
     };
-    const makeItemVisible = ()=>{
-        const nextVisible = invisibleItemQueue.dequeue();
-        visibleItemQueue.enqueue(nextVisible);
-        const item = overflowItems[nextVisible];
+    function computeSizeChange(entry) {
+        const dividerWidth = entry.groupId && groupManager.isSingleItemVisible(entry.id, entry.groupId) && overflowDividers[entry.groupId] ? getOffsetSize(overflowDividers[entry.groupId].element) : 0;
+        return getOffsetSize(entry.element) + dividerWidth;
+    }
+    const showItem = ()=>{
+        const item = getNextItem(invisibleItemQueue, visibleItemQueue);
         options.onUpdateItemVisibility({
             item,
             visible: true
         });
         if (item.groupId) {
-            overflowGroups[item.groupId].invisibleItemIds.delete(item.id);
-            overflowGroups[item.groupId].visibleItemIds.add(item.id);
+            groupManager.showItem(item.id, item.groupId);
+            if (groupManager.isSingleItemVisible(item.id, item.groupId)) {
+                var _overflowDividers_item_groupId;
+                (_overflowDividers_item_groupId = overflowDividers[item.groupId]) === null || _overflowDividers_item_groupId === void 0 ? void 0 : _overflowDividers_item_groupId.element.removeAttribute(_consts.DATA_OVERFLOWING);
+            }
         }
-        return getOffsetSize(item.element);
+        return computeSizeChange(item);
     };
-    const makeItemInvisible = ()=>{
-        const nextInvisible = visibleItemQueue.dequeue();
-        invisibleItemQueue.enqueue(nextInvisible);
-        const item = overflowItems[nextInvisible];
-        const width = getOffsetSize(item.element);
+    const hideItem = ()=>{
+        const item = getNextItem(visibleItemQueue, invisibleItemQueue);
+        const width = computeSizeChange(item);
         options.onUpdateItemVisibility({
             item,
             visible: false
         });
         if (item.groupId) {
-            overflowGroups[item.groupId].visibleItemIds.delete(item.id);
-            overflowGroups[item.groupId].invisibleItemIds.add(item.id);
+            if (groupManager.isSingleItemVisible(item.id, item.groupId)) {
+                var _overflowDividers_item_groupId;
+                (_overflowDividers_item_groupId = overflowDividers[item.groupId]) === null || _overflowDividers_item_groupId === void 0 ? void 0 : _overflowDividers_item_groupId.element.setAttribute(_consts.DATA_OVERFLOWING, '');
+            }
+            groupManager.hideItem(item.id, item.groupId);
         }
         return width;
     };
@@ -94,56 +156,32 @@ function createOverflowManager() {
         const invisibleItemIds = invisibleItemQueue.all();
         const visibleItems = visibleItemIds.map((itemId)=>overflowItems[itemId]);
         const invisibleItems = invisibleItemIds.map((itemId)=>overflowItems[itemId]);
-        const groupVisibility = {};
-        Object.entries(overflowGroups).forEach(([groupId, groupState])=>{
-            if (groupState.invisibleItemIds.size && groupState.visibleItemIds.size) {
-                groupVisibility[groupId] = 'overflow';
-            } else if (groupState.visibleItemIds.size === 0) {
-                groupVisibility[groupId] = 'hidden';
-            } else {
-                groupVisibility[groupId] = 'visible';
-            }
-        });
         options.onUpdateOverflow({
             visibleItems,
             invisibleItems,
-            groupVisibility
+            groupVisibility: groupManager.groupVisibility()
         });
     };
     const processOverflowItems = ()=>{
         if (!container) {
             return false;
         }
-        const availableSize = getOffsetSize(container) - options.padding;
-        const overflowMenuOffset = overflowMenu ? getOffsetSize(overflowMenu) : 0;
+        const totalDividersWidth = Object.values(overflowDividers).map((dvdr)=>dvdr.groupId ? getOffsetSize(dvdr.element) : 0).reduce((prev, current)=>prev + current, 0);
+        const availableSize = getOffsetSize(container) - options.padding - totalDividersWidth - (overflowMenu ? getOffsetSize(overflowMenu) : 0);
         // Snapshot of the visible/invisible state to compare for updates
         const visibleTop = visibleItemQueue.peek();
         const invisibleTop = invisibleItemQueue.peek();
-        const visibleItemIds = visibleItemQueue.all();
-        let currentWidth = visibleItemIds.reduce((sum, visibleItemId)=>{
-            const child = overflowItems[visibleItemId].element;
-            return sum + getOffsetSize(child);
-        }, 0);
+        let currentWidth = visibleItemQueue.all().map((id)=>overflowItems[id].element).map(getOffsetSize).reduce((prev, current)=>prev + current, 0);
         // Add items until available width is filled - can result in overflow
         while(currentWidth < availableSize && invisibleItemQueue.size() > 0){
-            currentWidth += makeItemVisible();
+            currentWidth += showItem();
         }
         // Remove items until there's no more overflow
-        while(currentWidth > availableSize && visibleItemQueue.size() > 0){
-            if (visibleItemQueue.size() <= options.minimumVisible) {
-                break;
-            }
-            currentWidth -= makeItemInvisible();
-        }
-        // make sure the overflow menu can fit
-        if (visibleItemQueue.size() > options.minimumVisible && invisibleItemQueue.size() > 0 && currentWidth + overflowMenuOffset > availableSize) {
-            makeItemInvisible();
+        while(currentWidth > availableSize && visibleItemQueue.size() > options.minimumVisible){
+            currentWidth -= hideItem();
         }
         // only update when the state of visible/invisible items has changed
-        if (visibleItemQueue.peek() !== visibleTop || invisibleItemQueue.peek() !== invisibleTop) {
-            return true;
-        }
-        return false;
+        return visibleItemQueue.peek() !== visibleTop || invisibleItemQueue.peek() !== invisibleTop;
     };
     const forceUpdate = ()=>{
         if (processOverflowItems() || forceDispatch) {
@@ -177,22 +215,34 @@ function createOverflowManager() {
             visibleItemQueue.enqueue(item.id);
         }
         if (item.groupId) {
-            if (!overflowGroups[item.groupId]) {
-                overflowGroups[item.groupId] = {
-                    visibleItemIds: new Set(),
-                    invisibleItemIds: new Set()
-                };
-            }
-            overflowGroups[item.groupId].visibleItemIds.add(item.id);
+            groupManager.addItem(item.id, item.groupId);
+            item.element.setAttribute(_consts.DATA_OVERFLOW_GROUP, item.groupId);
         }
         update();
     };
     const addOverflowMenu = (el)=>{
         overflowMenu = el;
     };
+    const addDivider = (divider)=>{
+        if (!divider.groupId || overflowDividers[divider.groupId]) {
+            return;
+        }
+        divider.element.setAttribute(_consts.DATA_OVERFLOW_GROUP, divider.groupId);
+        overflowDividers[divider.groupId] = divider;
+    };
     const removeOverflowMenu = ()=>{
         overflowMenu = undefined;
     };
+    const removeDivider = (groupId)=>{
+        if (!overflowDividers[groupId]) {
+            return;
+        }
+        const divider = overflowDividers[groupId];
+        if (divider.groupId) {
+            delete overflowDividers[groupId];
+            divider.element.removeAttribute(_consts.DATA_OVERFLOW_GROUP);
+        }
+    };
     const removeItem = (itemId)=>{
         if (!overflowItems[itemId]) {
             return;
@@ -201,8 +251,8 @@ function createOverflowManager() {
         visibleItemQueue.remove(itemId);
         invisibleItemQueue.remove(itemId);
         if (item.groupId) {
-            overflowGroups[item.groupId].visibleItemIds.delete(item.id);
-            overflowGroups[item.groupId].invisibleItemIds.delete(item.id);
+            groupManager.removeItem(item.id, item.groupId);
+            item.element.removeAttribute(_consts.DATA_OVERFLOW_GROUP);
         }
         delete overflowItems[itemId];
         update();
@@ -215,8 +265,8 @@ function createOverflowManager() {
         removeItem,
         update,
         addOverflowMenu,
-        removeOverflowMenu
+        removeOverflowMenu,
+        addDivider,
+        removeDivider
     };
-} //# sourceMappingURL=overflowManager.js.map
-
-//# sourceMappingURL=overflowManager.js.map
+}