@shopify/flash-list 2.0.0-alpha.9 → 2.0.0-rc.10

package/src/recyclerview/layout-managers/MasonryLayoutManager.ts

@@ -19,10 +19,13 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
   /** Current column index for sequential placement */
   private currentColumn = 0;
 
+  /** If there's a span change for masonry layout, we need to recompute all the widths */
+  private fullRelayoutRequired = false;
+
   constructor(params: LayoutParams, previousLayoutManager?: RVLayoutManager) {
     super(params, previousLayoutManager);
     this.boundedSize = params.windowSize.width;
-    this.optimizeItemArrangement = params.optimizeItemArrangement ?? false;
+    this.optimizeItemArrangement = params.optimizeItemArrangement;
     this.columnHeights = this.columnHeights ?? Array(this.maxColumns).fill(0);
   }
 
@@ -44,10 +47,7 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
         // console.log("-----> recomputeLayouts");
 
         // update all widths
-        for (let i = 0; i < this.layouts.length; i++) {
-          this.layouts[i].width = this.getWidth(i);
-          this.layouts[i].minHeight = undefined;
-        }
+        this.updateAllWidths();
         this.recomputeLayouts(0, this.layouts.length - 1);
         this.requiresRepaint = true;
       }
@@ -69,6 +69,13 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
       layout.isWidthMeasured = true;
       this.layouts[index] = layout;
     }
+
+    // TODO: Can be optimized
+    if (this.fullRelayoutRequired) {
+      this.updateAllWidths();
+      this.fullRelayoutRequired = false;
+      return 0;
+    }
   }
 
   /**
@@ -87,6 +94,14 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
     layout.enforcedWidth = true;
   }
 
+  /**
+   * Handles span change for an item.
+   * @param index Index of the item
+   */
+  handleSpanChange(index: number) {
+    this.fullRelayoutRequired = true;
+  }
+
   /**
    * Returns the total size of the layout area.
    * @returns RVDimension containing width and height of the layout
@@ -124,7 +139,8 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
 
     for (let i = startIndex; i < itemCount; i++) {
       const layout = this.getLayout(i);
-      const span = this.getSpanSizeInfo(i).span ?? 1;
+      // Skip tracking span because we're not changing widths
+      const span = this.getSpan(i, true);
 
       if (this.optimizeItemArrangement) {
         if (span === 1) {
@@ -147,8 +163,14 @@ export class RVMasonryLayoutManagerImpl extends RVLayoutManager {
    * @returns Width of the item
    */
   private getWidth(index: number): number {
-    const span = this.getSpanSizeInfo(index).span ?? 1;
-    return (this.boundedSize / this.maxColumns) * span;
+    return (this.boundedSize / this.maxColumns) * this.getSpan(index);
+  }
+
+  private updateAllWidths() {
+    for (let i = 0; i < this.layouts.length; i++) {
+      this.layouts[i].width = this.getWidth(i);
+      this.layouts[i].minHeight = undefined;
+    }
   }
 
   /**

package/src/recyclerview/utils/measureLayout.web.ts

@@ -12,15 +12,13 @@ function getScrollOffsets(element: Element, stopAt: Element) {
   let scrollX = 0;
   let scrollY = 0;
   let currentElement: Element | null = element;
-  let depth = 0;
 
   // Only check up to 3 parent elements
-  while (currentElement && currentElement !== stopAt && depth < 3) {
+  while (currentElement && currentElement !== stopAt) {
     const htmlElement = currentElement as HTMLElement;
     scrollX += htmlElement.scrollLeft ?? 0;
     scrollY += htmlElement.scrollTop ?? 0;
     currentElement = currentElement.parentElement;
-    depth++;
   }
 
   return { scrollX, scrollY };

package/src/viewability/ViewToken.ts

@@ -1,5 +1,5 @@
-export default interface ViewToken {
-  item: any; // TODO: fix this type
+export default interface ViewToken<T> {
+  item: T;
   key: string;
   index: number | null;
   isViewable: boolean;

package/src/viewability/ViewabilityHelper.ts

@@ -89,8 +89,8 @@ class ViewabilityHelper {
       const timeoutId = setTimeout(() => {
         this.timers.delete(timeoutId);
         this.checkViewableIndicesChanges(newViewableIndices);
-        this.timers.add(timeoutId);
       }, minimumViewTime);
+      this.timers.add(timeoutId);
     } else {
       this.checkViewableIndicesChanges(newViewableIndices);
     }

package/src/viewability/ViewabilityManager.ts

@@ -22,17 +22,21 @@ export default class ViewabilityManager<T> {
       this.viewabilityHelpers.push(
         this.createViewabilityHelper(
           flashListRef.props.viewabilityConfig,
-          flashListRef.props.onViewableItemsChanged
+          (info) => {
+            flashListRef.props.onViewableItemsChanged?.(info);
+          }
         )
       );
     }
     (flashListRef.props.viewabilityConfigCallbackPairs ?? []).forEach(
-      (pair) => {
+      (pair, index) => {
         this.viewabilityHelpers.push(
-          this.createViewabilityHelper(
-            pair.viewabilityConfig,
-            pair.onViewableItemsChanged
-          )
+          this.createViewabilityHelper(pair.viewabilityConfig, (info) => {
+            const callback =
+              flashListRef.props.viewabilityConfigCallbackPairs?.[index]
+                ?.onViewableItemsChanged;
+            callback?.(info);
+          })
         );
       }
     );
@@ -102,15 +106,18 @@ export default class ViewabilityManager<T> {
   private createViewabilityHelper = (
     viewabilityConfig: ViewabilityConfig | null | undefined,
     onViewableItemsChanged:
-      | ((info: { viewableItems: ViewToken[]; changed: ViewToken[] }) => void)
+      | ((info: {
+          viewableItems: ViewToken<T>[];
+          changed: ViewToken<T>[];
+        }) => void)
       | null
       | undefined
   ) => {
-    const mapViewToken: (index: number, isViewable: boolean) => ViewToken = (
+    const mapViewToken: (index: number, isViewable: boolean) => ViewToken<T> = (
       index: number,
       isViewable: boolean
     ) => {
-      const item = this.flashListRef.props.data?.[index];
+      const item = this.flashListRef.props.data![index];
       const key =
         item === undefined || this.flashListRef.props.keyExtractor === undefined
           ? index.toString()

package/dist/__tests__/RecycleKeyManager.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=RecycleKeyManager.test.d.ts.map

package/dist/__tests__/RecycleKeyManager.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RecycleKeyManager.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/RecycleKeyManager.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/RecycleKeyManager.test.js

@@ -1,210 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var RecycleKeyManager_1 = require("../recyclerview/RecycleKeyManager");
-describe("RecycleKeyManagerImpl", function () {
-    var keyManager;
-    beforeEach(function () {
-        // Initialize a new manager before each test
-        keyManager = new RecycleKeyManager_1.RecycleKeyManagerImpl();
-    });
-    describe("constructor", function () {
-        it("should initialize with default maxItems", function () {
-            // Test default maxItems value (implicitly tested via other methods)
-            // We can potentially expose maxItems for testing or test its effect
-            expect(keyManager).toBeDefined(); // Basic check
-        });
-        it("should initialize with specified maxItems", function () {
-            var specificMaxItems = 10;
-            keyManager = new RecycleKeyManager_1.RecycleKeyManagerImpl(specificMaxItems);
-            // Test the effect of maxItems limit later in getKey tests
-            expect(keyManager).toBeDefined(); // Basic check
-        });
-    });
-    describe("getKey", function () {
-        it("should generate a new key for a new item type without stableId", function () {
-            var key = keyManager.getKey("typeA", "item1");
-            expect(key).toBeDefined();
-            expect(typeof key).toBe("string");
-            expect(keyManager.hasKeyInPool(key)).toBe(false);
-        });
-        it("should generate a different key for a different item type", function () {
-            var keyA = keyManager.getKey("typeA", "item1");
-            var keyB = keyManager.getKey("typeB", "item2");
-            expect(keyA).not.toEqual(keyB);
-            expect(keyManager.hasKeyInPool(keyA)).toBe(false);
-            expect(keyManager.hasKeyInPool(keyB)).toBe(false);
-        });
-        it("should generate sequential keys when pool is empty", function () {
-            var key1 = keyManager.getKey("typeA", "item1");
-            var key2 = keyManager.getKey("typeA", "item2");
-            expect(parseInt(key2, 10)).toBe(parseInt(key1, 10) + 1);
-        });
-        it("should return the existing key for a known stableId", function () {
-            var stableId = "stable1";
-            var key1 = keyManager.getKey("typeA", stableId);
-            var key2 = keyManager.getKey("typeA", stableId);
-            var key3 = keyManager.getKey("typeB", stableId); // Different type, same stableId
-            expect(key2).toEqual(key1);
-            expect(key3).toEqual(key1); // Should still return the key associated with the stableId
-            expect(keyManager.hasKeyInPool(key1)).toBe(false);
-        });
-        it("should reuse a key from the pool for the same item type", function () {
-            var key1 = keyManager.getKey("typeA", "item1");
-            keyManager.recycleKey(key1);
-            var key2 = keyManager.getKey("typeA", "item2");
-            expect(key2).toEqual(key1); // Should reuse the recycled key
-            expect(keyManager.hasKeyInPool(key1)).toBe(false);
-        });
-        it("should reuse the specified currentKey if it exists in the pool", function () {
-            var key1 = keyManager.getKey("typeA", "item1");
-            var key2 = keyManager.getKey("typeA", "item2");
-            keyManager.recycleKey(key1);
-            keyManager.recycleKey(key2);
-            var reusedKey = keyManager.getKey("typeA", "item3", key1);
-            expect(reusedKey).toEqual(key1);
-            expect(keyManager.hasKeyInPool(key1)).toBe(false);
-            // key2 should still be in the pool
-            expect(keyManager.hasKeyInPool(key2)).toBe(true);
-        });
-        it("should reuse any key from the pool if currentKey does not exist", function () {
-            var key1 = keyManager.getKey("typeA", "item1");
-            var key2 = keyManager.getKey("typeA", "item2");
-            keyManager.recycleKey(key1);
-            keyManager.recycleKey(key2);
-            var nonExistentKey = "nonExistentKey";
-            var reusedKey = keyManager.getKey("typeA", "item3", nonExistentKey);
-            // It should have reused either key1 or key2
-            expect([key1, key2]).toContain(reusedKey);
-            expect(keyManager.hasKeyInPool(reusedKey)).toBe(false);
-        });
-        it("should prioritize stableId over pool reuse", function () {
-            var stableId = "stable1";
-            var key1 = keyManager.getKey("typeA", stableId); // Assign key1 to stable1
-            var key2 = keyManager.getKey("typeA", "item2");
-            keyManager.recycleKey(key2); // Put key2 in the pool
-            // Request key for stable1 again
-            var key3 = keyManager.getKey("typeA", stableId);
-            expect(key3).toEqual(key1); // Should return key1 associated with stableId
-            expect(keyManager.hasKeyInPool(key1)).toBe(false);
-            // key2 should still be in the pool
-            expect(keyManager.hasKeyInPool(key2)).toBe(true);
-        });
-        it("should assign stableId to a reused key", function () {
-            var key1 = keyManager.getKey("typeA", "item1");
-            keyManager.recycleKey(key1);
-            var stableId = "stableReuse";
-            var reusedKey = keyManager.getKey("typeA", stableId); // Reuse key1 and assign stableId
-            expect(reusedKey).toEqual(key1);
-            // Verify stableId mapping
-            var keyForStableId = keyManager.getKey("typeA", stableId);
-            expect(keyForStableId).toEqual(key1);
-        });
-        it("should handle ensurePoolSize when maxItems is exceeded", function () {
-            var maxItems = 2;
-            keyManager = new RecycleKeyManager_1.RecycleKeyManagerImpl(maxItems);
-            var key1 = keyManager.getKey("typeA", "item1"); // Active: {key1}
-            var key2 = keyManager.getKey("typeA", "item2"); // Active: {key1, key2}
-            expect(keyManager.hasKeyInPool(key1)).toBe(false);
-            expect(keyManager.hasKeyInPool(key2)).toBe(false);
-            // This should trigger ensurePoolSize and recycle key1 (oldest)
-            var key3 = keyManager.getKey("typeA", "item3"); // Active: {key2, key3}
-            expect(keyManager.hasKeyInPool(key1)).toBe(true); // key1 should be recycled
-            expect(keyManager.hasKeyInPool(key2)).toBe(false);
-            expect(keyManager.hasKeyInPool(key3)).toBe(false);
-            // This should trigger ensurePoolSize and recycle key2
-            var key4 = keyManager.getKey("typeA", "item4"); // Active: {key3, key4}
-            expect(keyManager.hasKeyInPool(key2)).toBe(true); // key2 should be recycled
-            expect(keyManager.hasKeyInPool(key3)).toBe(false);
-            expect(keyManager.hasKeyInPool(key4)).toBe(false);
-        });
-    });
-    describe("recycleKey", function () {
-        it("should add the key back to the correct pool", function () {
-            var keyA = keyManager.getKey("typeA", "item1");
-            var keyB = keyManager.getKey("typeB", "item2");
-            expect(keyManager.hasKeyInPool(keyA)).toBe(false);
-            expect(keyManager.hasKeyInPool(keyB)).toBe(false);
-            keyManager.recycleKey(keyA);
-            expect(keyManager.hasKeyInPool(keyA)).toBe(true);
-            expect(keyManager.hasKeyInPool(keyB)).toBe(false); // keyB should remain active
-            // Verify reuse from correct pool
-            var reusedKeyA = keyManager.getKey("typeA", "item3");
-            expect(reusedKeyA).toEqual(keyA);
-        });
-        it("should do nothing if the key does not exist or is already recycled", function () {
-            var key = keyManager.getKey("typeA", "item1");
-            keyManager.recycleKey(key); // Recycle it once
-            // Get current state (how many keys active, how many in pool)
-            // We need internal access or specific methods to check pool size directly.
-            // Let's assume internal state is correct after first recycle.
-            keyManager.recycleKey(key); // Try recycling again
-            keyManager.recycleKey("nonExistentKey"); // Try recycling non-existent key
-            // Verify state hasn't changed unexpectedly
-            expect(keyManager.hasKeyInPool(key)).toBe(true); // Still in pool
-            var newKey = keyManager.getKey("typeA", "item2");
-            expect(newKey).toEqual(key); // Should still reuse the original key
-        });
-    });
-    describe("hasKeyInPool", function () {
-        it("should return false for an active key", function () {
-            var key = keyManager.getKey("typeA", "item1");
-            expect(keyManager.hasKeyInPool(key)).toBe(false);
-        });
-        it("should return true for a recycled key", function () {
-            var key = keyManager.getKey("typeA", "item1");
-            keyManager.recycleKey(key);
-            expect(keyManager.hasKeyInPool(key)).toBe(true);
-        });
-        it("should return true for a key that was never generated", function () {
-            expect(keyManager.hasKeyInPool("nonExistentKey")).toBe(true);
-        });
-    });
-    describe("clearPool", function () {
-        it("should clear all keys from all pools", function () {
-            var keyA1 = keyManager.getKey("typeA", "item1");
-            var keyA2 = keyManager.getKey("typeA", "item2");
-            var keyB1 = keyManager.getKey("typeB", "item3");
-            keyManager.recycleKey(keyA1);
-            keyManager.recycleKey(keyB1);
-            expect(keyManager.hasKeyInPool(keyA1)).toBe(true);
-            expect(keyManager.hasKeyInPool(keyA2)).toBe(false); // Still active
-            expect(keyManager.hasKeyInPool(keyB1)).toBe(true);
-            keyManager.clearPool();
-            expect(keyManager.hasKeyInPool(keyA1)).toBe(true); // Still not active
-            expect(keyManager.hasKeyInPool(keyB1)).toBe(true); // Still not active
-            expect(keyManager.hasKeyInPool(keyA2)).toBe(false); // Active keys remain
-            // Getting new keys should generate new ones, not reuse cleared ones
-            var newKeyA = keyManager.getKey("typeA", "item4");
-            var newKeyB = keyManager.getKey("typeB", "item5");
-            expect(newKeyA).not.toEqual(keyA1);
-            expect(newKeyB).not.toEqual(keyB1);
-            // Depending on implementation, newKeyA might be keyA1 if keyCounter wasn't reset
-            // Check if key reuse happens after clearPool -> it shouldn't reuse from the *pool*
-            var keyA3 = keyManager.getKey("typeA", "item5"); // Generate another A key
-            keyManager.recycleKey(keyA3); // Recycle it
-            keyManager.clearPool(); // Clear pools again
-            keyManager.getKey("typeA", "item6"); // Get a new key
-            expect(keyManager.hasKeyInPool(keyA3)).toBe(true); // keyA3 is not active
-            // keyA4 should be newly generated, not reused from the cleared pool
-            // Note: Due to sequential key generation, it *might* match a previous key numerically
-            // but the crucial part is it wasn't reused *from the pool*.
-        });
-        it("should not affect active keys or stableId mappings", function () {
-            var stableId = "stableClear";
-            var keyA = keyManager.getKey("typeA", stableId);
-            var keyB = keyManager.getKey("typeB", "item2");
-            keyManager.recycleKey(keyB); // Put keyB in pool
-            expect(keyManager.hasKeyInPool(keyA)).toBe(false);
-            expect(keyManager.hasKeyInPool(keyB)).toBe(true);
-            expect(keyManager.getKey("typeA", stableId)).toEqual(keyA); // Check stableId mapping
-            keyManager.clearPool();
-            expect(keyManager.hasKeyInPool(keyA)).toBe(false); // keyA still active
-            expect(keyManager.hasKeyInPool(keyB)).toBe(true); // keyB still considered "in pool" (i.e., not active)
-            expect(keyManager.getKey("typeA", stableId)).toEqual(keyA); // StableId mapping persists
-            // Trying to get a key of type B should generate a new one
-            var newKeyB = keyManager.getKey("typeB", "item3");
-            expect(newKeyB).not.toEqual(keyB); // Because pool was cleared
-        });
-    });
-});
-//# sourceMappingURL=RecycleKeyManager.test.js.map

package/dist/__tests__/RecycleKeyManager.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RecycleKeyManager.test.js","sourceRoot":"","sources":["../../src/__tests__/RecycleKeyManager.test.ts"],"names":[],"mappings":";;AAAA,uEAA0E;AAE1E,QAAQ,CAAC,uBAAuB,EAAE;IAChC,IAAI,UAAiC,CAAC;IAEtC,UAAU,CAAC;QACT,4CAA4C;QAC5C,UAAU,GAAG,IAAI,yCAAqB,EAAE,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE;QACtB,EAAE,CAAC,yCAAyC,EAAE;YAC5C,oEAAoE;YACpE,oEAAoE;YACpE,MAAM,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,cAAc;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE;YAC9C,IAAM,gBAAgB,GAAG,EAAE,CAAC;YAC5B,UAAU,GAAG,IAAI,yCAAqB,CAAC,gBAAgB,CAAC,CAAC;YACzD,0DAA0D;YAC1D,MAAM,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,cAAc;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE;QACjB,EAAE,CAAC,gEAAgE,EAAE;YACnE,IAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YAC1B,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE;YAC9D,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE;YACvD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qDAAqD,EAAE;YACxD,IAAM,QAAQ,GAAG,SAAS,CAAC;YAC3B,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAClD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAClD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,gCAAgC;YACnF,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,2DAA2D;YACvF,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE;YAC5D,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,gCAAgC;YAC5D,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gEAAgE,EAAE;YACnE,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC5B,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAE5B,IAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YAC5D,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,mCAAmC;YACnC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE;YACpE,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC5B,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAE5B,IAAM,cAAc,GAAG,gBAAgB,CAAC;YACxC,IAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;YAEtE,4CAA4C;YAC5C,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YAC1C,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE;YAC/C,IAAM,QAAQ,GAAG,SAAS,CAAC;YAC3B,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,yBAAyB;YAC5E,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,uBAAuB;YAEpD,gCAAgC;YAChC,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,8CAA8C;YAC1E,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,mCAAmC;YACnC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE;YAC3C,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAE5B,IAAM,QAAQ,GAAG,aAAa,CAAC;YAC/B,IAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,iCAAiC;YACzF,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAEhC,0BAA0B;YAC1B,IAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC5D,MAAM,CAAC,cAAc,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE;YAC3D,IAAM,QAAQ,GAAG,CAAC,CAAC;YACnB,UAAU,GAAG,IAAI,yCAAqB,CAAC,QAAQ,CAAC,CAAC;YAEjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,iBAAiB;YACnE,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,uBAAuB;YACzE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAElD,+DAA+D;YAC/D,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,uBAAuB;YAEzE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,0BAA0B;YAC5E,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAElD,sDAAsD;YACtD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,uBAAuB;YACzE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,0BAA0B;YAC5E,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE;QACrB,EAAE,CAAC,6CAA6C,EAAE;YAChD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAEjD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAElD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,4BAA4B;YAE/E,iCAAiC;YACjC,IAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACvD,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oEAAoE,EAAE;YACvE,IAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAChD,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB;YAE9C,6DAA6D;YAC7D,2EAA2E;YAC3E,8DAA8D;YAE9D,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,sBAAsB;YAClD,UAAU,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,iCAAiC;YAE1E,2CAA2C;YAC3C,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB;YACjE,IAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,sCAAsC;QACrE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE;QACvB,EAAE,CAAC,uCAAuC,EAAE;YAC1C,IAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAChD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE;YAC1C,IAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAChD,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE;YAC1D,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE;QACpB,EAAE,CAAC,sCAAsC,EAAE;YACzC,IAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAClD,IAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAClD,IAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAElD,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC7B,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAE7B,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe;YACnE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAElD,UAAU,CAAC,SAAS,EAAE,CAAC;YAEvB,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB;YACtE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB;YACtE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,qBAAqB;YAEzE,oEAAoE;YACpE,IAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpD,IAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAEpD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACnC,iFAAiF;YACjF,mFAAmF;YACnF,IAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,yBAAyB;YAC5E,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa;YAC3C,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,oBAAoB;YAC5C,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,gBAAgB;YACrD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,sBAAsB;YACzE,oEAAoE;YACpE,sFAAsF;YACtF,4DAA4D;QAC9D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE;YACvD,IAAM,QAAQ,GAAG,aAAa,CAAC;YAC/B,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAClD,IAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB;YAEhD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB;YAErF,UAAU,CAAC,SAAS,EAAE,CAAC;YAEvB,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,oBAAoB;YACvE,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,qDAAqD;YACvG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,4BAA4B;YAExF,0DAA0D;YAC1D,IAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,2BAA2B;QAChE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/recyclerview/RecycleKeyManager.d.ts

@@ -1,82 +0,0 @@
-export interface RecycleKeyManager {
-    /**
-     * Retrieves a unique key for an item type, maintaining a separate pool for each type.
-     * If a stableId is provided and exists, returns the associated key.
-     * Otherwise, generates a new key or reuses one from the pool.
-     * @param itemType - The type/category of the item (e.g., 'header', 'product', 'footer')
-     * @param stableId - Optional unique identifier for stable item tracking
-     * @param currentKey - Optional current key to maintain if it exists in the pool
-     * @returns A unique key for the item
-     */
-    getKey: (itemType: string, stableId: string, currentKey?: string) => string;
-    /**
-     * Recycles a key back into its item type's pool when the associated view is no longer visible.
-     * This allows the key to be reused for new items of the same type.
-     * @param key - The key to be recycled back into the pool
-     */
-    recycleKey: (key: string) => void;
-    /**
-     * Checks if a key is currently available in the recycling pool (not in use).
-     * @param key - The key to check
-     * @returns True if the key is available in the pool, false otherwise
-     */
-    hasKeyInPool: (key: string) => boolean;
-    /**
-     * Clears all recycled keys from the pool, resetting the recycling system.
-     * This is useful when the list needs to be completely reset.
-     */
-    clearPool: () => void;
-}
-export declare class RecycleKeyManagerImpl implements RecycleKeyManager {
-    private maxItems;
-    private keyPools;
-    private keyMap;
-    private stableIdMap;
-    private keyCounter;
-    /**
-     * Creates a new RecycleKeyManager with a specified maximum number of items.
-     * @param maxItems - Maximum number of unique keys that can be active simultaneously.
-     *                   Defaults to Number.MAX_SAFE_INTEGER if not specified.
-     */
-    constructor(maxItems?: number);
-    /**
-     * Gets a key for the specified item type, prioritizing stable ID associations.
-     * If a stable ID exists, returns its associated key. Otherwise, either reuses
-     * a key from the pool or generates a new one.
-     * @param itemType - The type/category of the item
-     * @param stableId - Optional unique identifier for stable item tracking
-     * @param currentKey - Optional current key to maintain if it exists in the pool
-     * @returns A unique key for the item
-     */
-    getKey(itemType: string, stableId: string, currentKey?: string): string;
-    /**
-     * Recycles a key by adding it back to its item type's pool and cleaning up
-     * associated mappings. This should be called when a view is no longer visible.
-     * @param key - The key to be recycled
-     */
-    recycleKey(key: string): void;
-    /**
-     * Checks if a key is currently available in the recycling pool.
-     * @param key - The key to check
-     * @returns True if the key is available in the pool, false otherwise
-     */
-    hasKeyInPool(key: string): boolean;
-    /**
-     * Clears all recycled keys from the pool, effectively resetting the recycling system.
-     * This operation does not affect currently active keys.
-     */
-    clearPool(): void;
-    /**
-     * Generates a unique sequential key using an internal counter.
-     * @returns A unique key as a string
-     */
-    private generateKey;
-    /**
-     * Ensures the total number of active keys doesn't exceed the maximum limit.
-     * If the limit is exceeded, recycles the oldest keys until within bounds.
-     * Note: This operation may impact performance when dealing with large lists.
-     * TODO: Check performance impact of this
-     */
-    private ensurePoolSize;
-}
-//# sourceMappingURL=RecycleKeyManager.d.ts.map

package/dist/recyclerview/RecycleKeyManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RecycleKeyManager.d.ts","sourceRoot":"","sources":["../../src/recyclerview/RecycleKeyManager.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,iBAAiB;IAChC;;;;;;;;OAQG;IACH,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;IAE5E;;;;OAIG;IACH,UAAU,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IAElC;;;;OAIG;IACH,YAAY,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC;IAEvC;;;OAGG;IACH,SAAS,EAAE,MAAM,IAAI,CAAC;CACvB;AAED,qBAAa,qBAAsB,YAAW,iBAAiB;IAE7D,OAAO,CAAC,QAAQ,CAAS;IAGzB,OAAO,CAAC,QAAQ,CAA2B;IAG3C,OAAO,CAAC,MAAM,CAAuD;IAGrE,OAAO,CAAC,WAAW,CAAsB;IAGzC,OAAO,CAAC,UAAU,CAAS;IAE3B;;;;OAIG;gBACS,QAAQ,GAAE,MAAgC;IAQtD;;;;;;;;OAQG;IACI,MAAM,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,UAAU,CAAC,EAAE,MAAM,GAClB,MAAM;IAsCT;;;;OAIG;IACI,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAwBpC;;;;OAIG;IACI,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzC;;;OAGG;IACI,SAAS;IAIhB;;;OAGG;IACH,OAAO,CAAC,WAAW;IAInB;;;;;OAKG;IACH,OAAO,CAAC,cAAc;CAWvB"}

package/dist/recyclerview/RecycleKeyManager.js

@@ -1,135 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.RecycleKeyManagerImpl = void 0;
-var tslib_1 = require("tslib");
-var RecycleKeyManagerImpl = /** @class */ (function () {
-    /**
-     * Creates a new RecycleKeyManager with a specified maximum number of items.
-     * @param maxItems - Maximum number of unique keys that can be active simultaneously.
-     *                   Defaults to Number.MAX_SAFE_INTEGER if not specified.
-     */
-    function RecycleKeyManagerImpl(maxItems) {
-        if (maxItems === void 0) { maxItems = Number.MAX_SAFE_INTEGER; }
-        this.maxItems = maxItems;
-        this.keyPools = new Map();
-        this.keyMap = new Map();
-        this.stableIdMap = new Map();
-        this.keyCounter = 0;
-    }
-    /**
-     * Gets a key for the specified item type, prioritizing stable ID associations.
-     * If a stable ID exists, returns its associated key. Otherwise, either reuses
-     * a key from the pool or generates a new one.
-     * @param itemType - The type/category of the item
-     * @param stableId - Optional unique identifier for stable item tracking
-     * @param currentKey - Optional current key to maintain if it exists in the pool
-     * @returns A unique key for the item
-     */
-    RecycleKeyManagerImpl.prototype.getKey = function (itemType, stableId, currentKey) {
-        // Return existing key if stableId is already mapped
-        if (stableId && this.stableIdMap.has(stableId)) {
-            return this.stableIdMap.get(stableId);
-        }
-        // Get or create the pool for this item type
-        var pool = this.keyPools.get(itemType);
-        if (!pool) {
-            pool = new Set();
-            this.keyPools.set(itemType, pool);
-        }
-        var key;
-        // Reuse existing key from pool if available
-        if (pool.size > 0) {
-            key =
-                currentKey && pool.has(currentKey)
-                    ? currentKey
-                    : pool.values().next().value;
-            pool.delete(key);
-        }
-        else {
-            // Generate new key if pool is empty
-            key = this.generateKey();
-        }
-        // Update mappings with new key information
-        this.keyMap.set(key, { itemType: itemType, stableId: stableId });
-        if (stableId) {
-            this.stableIdMap.set(stableId, key);
-        }
-        // Ensure we don't exceed the maximum number of active keys
-        this.ensurePoolSize();
-        return key;
-    };
-    /**
-     * Recycles a key by adding it back to its item type's pool and cleaning up
-     * associated mappings. This should be called when a view is no longer visible.
-     * @param key - The key to be recycled
-     */
-    RecycleKeyManagerImpl.prototype.recycleKey = function (key) {
-        var keyInfo = this.keyMap.get(key);
-        if (!keyInfo) {
-            return;
-        }
-        var itemType = keyInfo.itemType, stableId = keyInfo.stableId;
-        // Clean up stable ID mapping if it exists
-        if (stableId) {
-            this.stableIdMap.delete(stableId);
-        }
-        // Add key back to its type's pool
-        var pool = this.keyPools.get(itemType);
-        if (!pool) {
-            pool = new Set();
-            this.keyPools.set(itemType, pool);
-        }
-        pool.add(key);
-        this.keyMap.delete(key);
-    };
-    /**
-     * Checks if a key is currently available in the recycling pool.
-     * @param key - The key to check
-     * @returns True if the key is available in the pool, false otherwise
-     */
-    RecycleKeyManagerImpl.prototype.hasKeyInPool = function (key) {
-        return !this.keyMap.has(key);
-    };
-    /**
-     * Clears all recycled keys from the pool, effectively resetting the recycling system.
-     * This operation does not affect currently active keys.
-     */
-    RecycleKeyManagerImpl.prototype.clearPool = function () {
-        this.keyPools.clear();
-    };
-    /**
-     * Generates a unique sequential key using an internal counter.
-     * @returns A unique key as a string
-     */
-    RecycleKeyManagerImpl.prototype.generateKey = function () {
-        return (this.keyCounter++).toString();
-    };
-    /**
-     * Ensures the total number of active keys doesn't exceed the maximum limit.
-     * If the limit is exceeded, recycles the oldest keys until within bounds.
-     * Note: This operation may impact performance when dealing with large lists.
-     * TODO: Check performance impact of this
-     */
-    RecycleKeyManagerImpl.prototype.ensurePoolSize = function () {
-        var e_1, _a;
-        if (this.keyMap.size <= this.maxItems)
-            return;
-        var keysToRecycle = Array.from(this.keyMap.keys()).slice(0, this.keyMap.size - this.maxItems);
-        try {
-            for (var keysToRecycle_1 = tslib_1.__values(keysToRecycle), keysToRecycle_1_1 = keysToRecycle_1.next(); !keysToRecycle_1_1.done; keysToRecycle_1_1 = keysToRecycle_1.next()) {
-                var key = keysToRecycle_1_1.value;
-                this.recycleKey(key);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (keysToRecycle_1_1 && !keysToRecycle_1_1.done && (_a = keysToRecycle_1.return)) _a.call(keysToRecycle_1);
-            }
-            finally { if (e_1) throw e_1.error; }
-        }
-    };
-    return RecycleKeyManagerImpl;
-}());
-exports.RecycleKeyManagerImpl = RecycleKeyManagerImpl;
-//# sourceMappingURL=RecycleKeyManager.js.map

package/dist/recyclerview/RecycleKeyManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RecycleKeyManager.js","sourceRoot":"","sources":["../../src/recyclerview/RecycleKeyManager.ts"],"names":[],"mappings":";;;;AAiCA;IAgBE;;;;OAIG;IACH,+BAAY,QAA0C;QAA1C,yBAAA,EAAA,WAAmB,MAAM,CAAC,gBAAgB;QACpD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IAED;;;;;;;;OAQG;IACI,sCAAM,GAAb,UACE,QAAgB,EAChB,QAAgB,EAChB,UAAmB;QAEnB,oDAAoD;QACpD,IAAI,QAAQ,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACzC,CAAC;QAED,4CAA4C;QAC5C,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,GAAW,CAAC;QAChB,4CAA4C;QAC5C,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClB,GAAG;gBACD,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;oBAChC,CAAC,CAAC,UAAU;oBACZ,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,oCAAoC;YACpC,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC3B,CAAC;QAED,2CAA2C;QAC3C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,QAAQ,UAAA,EAAE,QAAQ,UAAA,EAAE,CAAC,CAAC;QAC7C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,2DAA2D;QAC3D,IAAI,CAAC,cAAc,EAAE,CAAC;QAEtB,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,0CAAU,GAAjB,UAAkB,GAAW;QAC3B,IAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAErC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QAEO,IAAA,QAAQ,GAAe,OAAO,SAAtB,EAAE,QAAQ,GAAK,OAAO,SAAZ,CAAa;QACvC,0CAA0C;QAC1C,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;QAED,kCAAkC;QAClC,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACI,4CAAY,GAAnB,UAAoB,GAAW;QAC7B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,yCAAS,GAAhB;QACE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,2CAAW,GAAnB;QACE,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;IACxC,CAAC;IAED;;;;;OAKG;IACK,8CAAc,GAAtB;;QACE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAE9C,IAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CACxD,CAAC,EACD,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CACjC,CAAC;;YACF,KAAkB,IAAA,kBAAA,iBAAA,aAAa,CAAA,4CAAA,uEAAE,CAAC;gBAA7B,IAAM,GAAG,0BAAA;gBACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;;;;;;;;;IACH,CAAC;IACH,4BAAC;AAAD,CAAC,AAvJD,IAuJC;AAvJY,sDAAqB"}