vscroll 1.6.3 → 1.7.0

package/dist/esm2015/classes/buffer/cache.js

@@ -1,247 +1,247 @@
-import { DefaultSize } from './defaultSize';
-import { Direction } from '../../inputs/index';
-export class ItemCache {
-  constructor(item, saveData) {
-    this.$index = item.$index;
-    this.data = saveData ? item.data : null;
-    this.size = item.size;
-  }
-  changeIndex(value) {
-    this.$index = value;
-  }
-}
-export class Cache {
-  constructor({ itemSize, cacheData, cacheOnReload, sizeStrategy }, logger) {
-    this.itemSize = itemSize;
-    this.saveData = cacheData;
-    this.cacheOnReload = cacheOnReload;
-    this.sizeStrategy = sizeStrategy;
-    this.logger = logger;
-    this.items = new Map();
-    this.defaultSize = new DefaultSize(itemSize, sizeStrategy);
-    this.reset(true);
-  }
-  reset(force) {
-    force = force || !this.cacheOnReload;
-    if (force) {
-      this.minIndex = +Infinity;
-      this.maxIndex = -Infinity;
-      this.items.clear();
-    }
-    this.defaultSize.reset(force);
-  }
-  get size() {
-    return this.items.size;
-  }
-  get(index) {
-    return this.items.get(index);
-  }
-  getSizeByIndex(index) {
-    const item = this.get(index);
-    return item && item.size || this.defaultSize.get();
-  }
-  getDefaultSize() {
-    return this.defaultSize.get();
-  }
-  recalculateDefaultSize() {
-    if (this.defaultSize.recalculate(this.size)) {
-      this.logger.log(() => `default size has been updated: ${this.defaultSize.get()}`);
-      return true;
-    }
-    return false;
-  }
-  /**
-   * Adds item to Set by $index, replaces existed item if $index matches.
-   * Maintains min/max indexes and default item size.
-   *
-   * @param {Item<Data>} item A Buffer item to be cached, an objects with { $index, data, size } props.
-   *
-   * @returns {ItemCache<Data>} Cached item.
-   */
-  add(item) {
-    let itemCache = this.get(item.$index);
-    if (itemCache) { // adding item is already cached
-      if (this.saveData) {
-        itemCache.data = item.data;
-      }
-      if (itemCache.size !== item.size) {
-        if (itemCache.size) {
-          this.defaultSize.setExisted(itemCache.size, item.size);
-        }
-        else {
-          this.defaultSize.setNew(item.size);
-        }
-        itemCache.size = item.size;
-      }
-    }
-    else {
-      itemCache = new ItemCache(item, this.saveData);
-      this.items.set(item.$index, itemCache);
-      this.defaultSize.setNew(item.size);
-    }
-    if (item.$index < this.minIndex) {
-      this.minIndex = item.$index;
-    }
-    if (item.$index > this.maxIndex) {
-      this.maxIndex = item.$index;
-    }
-    return itemCache;
-  }
-  /**
-   * Inserts items to Set, shifts $indexes of items that remain.
-   * Replaces current Set with a new one with new regular $indexes.
-   * Maintains min/max indexes.
-   *
-   * @param {Data[]} toInsert List of non-indexed items to be inserted.
-   * @param {number} index The index before/after which the insertion is performed.
-   * @param {Direction} direction Determines the direction of insertion.
-   * @param {boolean} fixRight Defines indexes shifting strategy.
-   * If false, indexes that are greater than the inserted ones are increased.
-   * If true, indexes that are less than than the inserted ones are decreased.
-   */
-  insertItems(toInsert, index, direction, fixRight) {
-    const items = new Map();
-    const length = toInsert.length;
-    let min = Infinity, max = -Infinity;
-    const set = (item) => {
-      items.set(item.$index, item);
-      min = item.$index < min ? item.$index : min;
-      max = item.$index > max ? item.$index : max;
-    };
-    this.items.forEach(item => {
-      let shift = 0;
-      if (direction === Direction.backward) {
-        if (item.$index < index && fixRight) {
-          shift = -length;
-        }
-        else if (item.$index >= index && !fixRight) {
-          shift = length;
-        }
-      }
-      else if (direction === Direction.forward) {
-        if (item.$index <= index && fixRight) {
-          shift = -length;
-        }
-        else if (item.$index > index && !fixRight) {
-          shift = length;
-        }
-      }
-      if (shift) {
-        item.changeIndex(item.$index + shift);
-      }
-      set(item);
-    });
-    if (this.saveData) { // persist data with no sizes
-      toInsert.forEach((data, i) => {
-        const $index = index + i - (fixRight ? length : 0) + (direction === Direction.forward ? 1 : 0);
-        const item = new ItemCache({ $index, data }, this.saveData);
-        set(item);
-      });
-    }
-    this.items = items;
-    this.minIndex = min;
-    this.maxIndex = max;
-  }
-  /**
-   * Removes items from Set, shifts $indexes of items that remain.
-   * Replaces current Set with a new one with new regular $indexes.
-   * Maintains min/max indexes and default item size.
-   *
-   * @param {number[]} toRemove List of indexes to be removed.
-   * @param {boolean} fixRight Defines indexes shifting strategy.
-   * If false, indexes that are greater than the removed ones will be decreased.
-   * If true, indexes that are less than than the removed ones will be increased.
-   */
-  removeItems(toRemove, fixRight) {
-    const items = new Map();
-    let min = Infinity, max = -Infinity;
-    this.items.forEach(item => {
-      if (toRemove.some(index => index === item.$index)) {
-        if (item.size) {
-          this.defaultSize.setRemoved(item.size);
-        }
-        return;
-      }
-      const diff = fixRight
-        ? toRemove.reduce((acc, index) => acc + (item.$index < index ? 1 : 0), 0)
-        : toRemove.reduce((acc, index) => acc - (item.$index > index ? 1 : 0), 0);
-      item.changeIndex(item.$index + diff);
-      items.set(item.$index, item);
-      min = item.$index < min ? item.$index : min;
-      max = item.$index > max ? item.$index : max;
-    });
-    this.items = items;
-    this.minIndex = min;
-    this.maxIndex = max;
-  }
-  /**
-   * Destructively updates Set based on subset (before-after) changes.
-   * Replaces current Set with a new one with new regular $indexes.
-   * Maintains min/max indexes. Maintains default item size on remove only.
-   *
-   * @param {ItemUpdate[]} before Initial subset of items to be replaced by "after".
-   * Each element is an object with { $index, size, toRemove } props. Must be $index-incremental.
-   * Items to be removed must have toRemove flag: before[].toRemove = true.
-   * @param {Item<Data>[]} after Transformed subset that replaces "before". Must be $index-incremental.
-   * Must contain at least 1 $index from "before" or be empty.
-   * @param {boolean} fixRight This is to fix right indexes during subset collapsing. Acts only if "after" is empty.
-   */
-  updateSubset(before, after, fixRight) {
-    if (!this.size || !before.length) {
-      return;
-    }
-    const minB = before[0].$index, maxB = before[before.length - 1].$index;
-    let leftDiff, rightDiff;
-    if (after.length) {
-      const minA = after[0].$index, maxA = after[after.length - 1].$index;
-      leftDiff = minA - minB;
-      rightDiff = maxA - maxB;
-    }
-    else {
-      leftDiff = fixRight ? maxB - minB + 1 : 0;
-      rightDiff = fixRight ? 0 : minB - maxB - 1;
-    }
-    const items = new Map();
-    this.items.forEach(item => {
-      if (item.$index < minB) { // items to the left of the subset
-        item.changeIndex(item.$index + leftDiff);
-        items.set(item.$index, item);
-        return;
-      }
-      else if (item.$index > maxB) { // items to the right of the subset
-        item.changeIndex(item.$index + rightDiff);
-        items.set(item.$index, item);
-        return;
-      }
-    });
-    after.forEach(item => // subset items
-     items.set(item.$index, new ItemCache(item, this.saveData)));
-    before // to maintain default size on remove
-      .filter(item => item.toRemove)
-      .forEach(item => this.defaultSize.setRemoved(item.size));
-    this.minIndex += leftDiff;
-    this.maxIndex += rightDiff;
-    this.items = items;
-  }
-  /**
-   * Shifts all indexes by some value.
-   * Replaces current Set with a new one with new regular $indexes.
-   * Maintains min/max indexes.
-   *
-   * @param {number} delta A shift value.
-   */
-  shiftIndexes(delta) {
-    const items = new Map();
-    let min = Infinity, max = -Infinity;
-    this.items.forEach(item => {
-      item.changeIndex(item.$index + delta);
-      items.set(item.$index, item);
-      min = item.$index < min ? item.$index : min;
-      max = item.$index > max ? item.$index : max;
-    });
-    this.items = items;
-    this.minIndex = min;
-    this.maxIndex = max;
-  }
-}
+import { DefaultSize } from './defaultSize';
+import { Direction } from '../../inputs/index';
+export class ItemCache {
+  constructor(item, saveData) {
+    this.$index = item.$index;
+    this.data = saveData ? item.data : null;
+    this.size = item.size;
+  }
+  changeIndex(value) {
+    this.$index = value;
+  }
+}
+export class Cache {
+  constructor({ itemSize, cacheData, cacheOnReload, sizeStrategy }, logger) {
+    this.itemSize = itemSize;
+    this.saveData = cacheData;
+    this.cacheOnReload = cacheOnReload;
+    this.sizeStrategy = sizeStrategy;
+    this.logger = logger;
+    this.items = new Map();
+    this.defaultSize = new DefaultSize(itemSize, sizeStrategy);
+    this.reset(true);
+  }
+  reset(force) {
+    force = force || !this.cacheOnReload;
+    if (force) {
+      this.minIndex = +Infinity;
+      this.maxIndex = -Infinity;
+      this.items.clear();
+    }
+    this.defaultSize.reset(force);
+  }
+  get size() {
+    return this.items.size;
+  }
+  get(index) {
+    return this.items.get(index);
+  }
+  getSizeByIndex(index) {
+    const item = this.get(index);
+    return item && item.size || this.defaultSize.get();
+  }
+  getDefaultSize() {
+    return this.defaultSize.get();
+  }
+  recalculateDefaultSize() {
+    if (this.defaultSize.recalculate(this.size)) {
+      this.logger.log(() => `default size has been updated: ${this.defaultSize.get()}`);
+      return true;
+    }
+    return false;
+  }
+  /**
+   * Adds item to Set by $index, replaces existed item if $index matches.
+   * Maintains min/max indexes and default item size.
+   *
+   * @param {Item<Data>} item A Buffer item to be cached, an objects with { $index, data, size } props.
+   *
+   * @returns {ItemCache<Data>} Cached item.
+   */
+  add(item) {
+    let itemCache = this.get(item.$index);
+    if (itemCache) { // adding item is already cached
+      if (this.saveData) {
+        itemCache.data = item.data;
+      }
+      if (itemCache.size !== item.size) {
+        if (itemCache.size) {
+          this.defaultSize.setExisted(itemCache.size, item.size);
+        }
+        else {
+          this.defaultSize.setNew(item.size);
+        }
+        itemCache.size = item.size;
+      }
+    }
+    else {
+      itemCache = new ItemCache(item, this.saveData);
+      this.items.set(item.$index, itemCache);
+      this.defaultSize.setNew(item.size);
+    }
+    if (item.$index < this.minIndex) {
+      this.minIndex = item.$index;
+    }
+    if (item.$index > this.maxIndex) {
+      this.maxIndex = item.$index;
+    }
+    return itemCache;
+  }
+  /**
+   * Inserts items to Set, shifts $indexes of items that remain.
+   * Replaces current Set with a new one with new regular $indexes.
+   * Maintains min/max indexes.
+   *
+   * @param {Data[]} toInsert List of non-indexed items to be inserted.
+   * @param {number} index The index before/after which the insertion is performed.
+   * @param {Direction} direction Determines the direction of insertion.
+   * @param {boolean} fixRight Defines indexes shifting strategy.
+   * If false, indexes that are greater than the inserted ones are increased.
+   * If true, indexes that are less than than the inserted ones are decreased.
+   */
+  insertItems(toInsert, index, direction, fixRight) {
+    const items = new Map();
+    const length = toInsert.length;
+    let min = Infinity, max = -Infinity;
+    const set = (item) => {
+      items.set(item.$index, item);
+      min = item.$index < min ? item.$index : min;
+      max = item.$index > max ? item.$index : max;
+    };
+    this.items.forEach(item => {
+      let shift = 0;
+      if (direction === Direction.backward) {
+        if (item.$index < index && fixRight) {
+          shift = -length;
+        }
+        else if (item.$index >= index && !fixRight) {
+          shift = length;
+        }
+      }
+      else if (direction === Direction.forward) {
+        if (item.$index <= index && fixRight) {
+          shift = -length;
+        }
+        else if (item.$index > index && !fixRight) {
+          shift = length;
+        }
+      }
+      if (shift) {
+        item.changeIndex(item.$index + shift);
+      }
+      set(item);
+    });
+    if (this.saveData) { // persist data with no sizes
+      toInsert.forEach((data, i) => {
+        const $index = index + i - (fixRight ? length : 0) + (direction === Direction.forward ? 1 : 0);
+        const item = new ItemCache({ $index, data }, this.saveData);
+        set(item);
+      });
+    }
+    this.items = items;
+    this.minIndex = min;
+    this.maxIndex = max;
+  }
+  /**
+   * Removes items from Set, shifts $indexes of items that remain.
+   * Replaces current Set with a new one with new regular $indexes.
+   * Maintains min/max indexes and default item size.
+   *
+   * @param {number[]} toRemove List of indexes to be removed.
+   * @param {boolean} fixRight Defines indexes shifting strategy.
+   * If false, indexes that are greater than the removed ones will be decreased.
+   * If true, indexes that are less than than the removed ones will be increased.
+   */
+  removeItems(toRemove, fixRight) {
+    const items = new Map();
+    let min = Infinity, max = -Infinity;
+    this.items.forEach(item => {
+      if (toRemove.some(index => index === item.$index)) {
+        if (item.size) {
+          this.defaultSize.setRemoved(item.size);
+        }
+        return;
+      }
+      const diff = fixRight
+        ? toRemove.reduce((acc, index) => acc + (item.$index < index ? 1 : 0), 0)
+        : toRemove.reduce((acc, index) => acc - (item.$index > index ? 1 : 0), 0);
+      item.changeIndex(item.$index + diff);
+      items.set(item.$index, item);
+      min = item.$index < min ? item.$index : min;
+      max = item.$index > max ? item.$index : max;
+    });
+    this.items = items;
+    this.minIndex = min;
+    this.maxIndex = max;
+  }
+  /**
+   * Destructively updates Set based on subset (before-after) changes.
+   * Replaces current Set with a new one with new regular $indexes.
+   * Maintains min/max indexes. Maintains default item size on remove only.
+   *
+   * @param {ItemUpdate[]} before Initial subset of items to be replaced by "after".
+   * Each element is an object with { $index, size, toRemove } props. Must be $index-incremental.
+   * Items to be removed must have toRemove flag: before[].toRemove = true.
+   * @param {Item<Data>[]} after Transformed subset that replaces "before". Must be $index-incremental.
+   * Must contain at least 1 $index from "before" or be empty.
+   * @param {boolean} fixRight This is to fix right indexes during subset collapsing. Acts only if "after" is empty.
+   */
+  updateSubset(before, after, fixRight) {
+    if (!this.size || !before.length) {
+      return;
+    }
+    const minB = before[0].$index, maxB = before[before.length - 1].$index;
+    let leftDiff, rightDiff;
+    if (after.length) {
+      const minA = after[0].$index, maxA = after[after.length - 1].$index;
+      leftDiff = minA - minB;
+      rightDiff = maxA - maxB;
+    }
+    else {
+      leftDiff = fixRight ? maxB - minB + 1 : 0;
+      rightDiff = fixRight ? 0 : minB - maxB - 1;
+    }
+    const items = new Map();
+    this.items.forEach(item => {
+      if (item.$index < minB) { // items to the left of the subset
+        item.changeIndex(item.$index + leftDiff);
+        items.set(item.$index, item);
+        return;
+      }
+      else if (item.$index > maxB) { // items to the right of the subset
+        item.changeIndex(item.$index + rightDiff);
+        items.set(item.$index, item);
+        return;
+      }
+    });
+    after.forEach(item => // subset items
+     items.set(item.$index, new ItemCache(item, this.saveData)));
+    before // to maintain default size on remove
+      .filter(item => item.toRemove)
+      .forEach(item => this.defaultSize.setRemoved(item.size));
+    this.minIndex += leftDiff;
+    this.maxIndex += rightDiff;
+    this.items = items;
+  }
+  /**
+   * Shifts all indexes by some value.
+   * Replaces current Set with a new one with new regular $indexes.
+   * Maintains min/max indexes.
+   *
+   * @param {number} delta A shift value.
+   */
+  shiftIndexes(delta) {
+    const items = new Map();
+    let min = Infinity, max = -Infinity;
+    this.items.forEach(item => {
+      item.changeIndex(item.$index + delta);
+      items.set(item.$index, item);
+      min = item.$index < min ? item.$index : min;
+      max = item.$index > max ? item.$index : max;
+    });
+    this.items = items;
+    this.minIndex = min;
+    this.maxIndex = max;
+  }
+}
 //# sourceMappingURL=cache.js.map

package/dist/esm2015/classes/buffer/cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../../../src/classes/buffer/cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAI5C,OAAO,EAAgB,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAc7D,MAAM,OAAO,SAAS;IAMpB,YAAY,IAAuB,EAAE,QAAiB;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,WAAW,CAAC,KAAa;QACvB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AAED,MAAM,OAAO,KAAK;IAYhB,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAY,EAAE,MAAc;QACxF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,KAAc;QAClB,KAAK,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC;QACrC,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,CAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;SACpB;QACD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,cAAc,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;IACrD,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;IAChC,CAAC;IAED,sBAAsB;QACpB,IAAI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,kCAAkC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAClF,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,IAAgB;QAClB,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,SAAS,EAAE,EAAE,gCAAgC;YAC/C,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjB,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;aAC5B;YACD,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;gBAChC,IAAI,SAAS,CAAC,IAAI,EAAE;oBAClB,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;iBACxD;qBAAM;oBACL,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACpC;gBACD,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;aAC5B;SACF;aAAM;YACL,SAAS,GAAG,IAAI,SAAS,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACpC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7B;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,QAAgB,EAAE,KAAa,EAAE,SAAoB,EAAE,QAAiB;QAClF,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,IAAqB,EAAE,EAAE;YACpC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,SAAS,KAAK,SAAS,CAAC,QAAQ,EAAE;gBACpC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,QAAQ,EAAE;oBACnC,KAAK,GAAG,CAAC,MAAM,CAAC;iBACjB;qBAAM,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,EAAE;oBAC5C,KAAK,GAAG,MAAM,CAAC;iBAChB;aACF;iBAAM,IAAI,SAAS,KAAK,SAAS,CAAC,OAAO,EAAE;gBAC1C,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,QAAQ,EAAE;oBACpC,KAAK,GAAG,CAAC,MAAM,CAAC;iBACjB;qBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,QAAQ,EAAE;oBAC3C,KAAK,GAAG,MAAM,CAAC;iBAChB;aACF;YACD,IAAI,KAAK,EAAE;gBACT,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;aACvC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,QAAQ,EAAE,EAAE,6BAA6B;YAChD,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/F,MAAM,IAAI,GAAG,IAAI,SAAS,CAAO,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClE,GAAG,CAAC,IAAI,CAAC,CAAC;YACZ,CAAC,CAAC,CAAC;SACJ;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,QAAkB,EAAE,QAAiB;QAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE;gBACjD,IAAI,IAAI,CAAC,IAAI,EAAE;oBACb,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACxC;gBACD,OAAO;aACR;YACD,MAAM,IAAI,GAAG,QAAQ;gBACnB,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,YAAY,CAAC,MAAoB,EAAE,KAAmB,EAAE,QAAkB;QACxE,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAChC,OAAO;SACR;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACvE,IAAI,QAAgB,EAAE,SAAiB,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,EAAE;YAChB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YACpE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;YACvB,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC;SACzB;aAAM;YACL,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;SAC5C;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,EAAE,kCAAkC;gBAC1D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;gBACzC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC7B,OAAO;aACR;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,EAAE,mCAAmC;gBAClE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;gBAC1C,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC7B,OAAO;aACR;QACH,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe;SACnC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,SAAS,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CACjE,CAAC;QACF,MAAM,CAAC,qCAAqC;aACzC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;aAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,KAAa;QACxB,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YACtC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;CACF","sourcesContent":["import { DefaultSize } from './defaultSize';\r\nimport { Item } from '../item';\r\nimport { Settings } from '../settings';\r\nimport { Logger } from '../logger';\r\nimport { SizeStrategy, Direction } from '../../inputs/index';\r\n\r\ninterface ItemToCache<Data> {\r\n  $index: number;\r\n  data: Data;\r\n  size?: number;\r\n}\r\n\r\ninterface ItemUpdate {\r\n  $index: number;\r\n  size: number;\r\n  toRemove?: boolean;\r\n}\r\n\r\nexport class ItemCache<Data = unknown> {\r\n  $index: number;\r\n  data: Data | null;\r\n  size?: number;\r\n  position: number;\r\n\r\n  constructor(item: ItemToCache<Data>, saveData: boolean) {\r\n    this.$index = item.$index;\r\n    this.data = saveData ? item.data : null;\r\n    this.size = item.size;\r\n  }\r\n\r\n  changeIndex(value: number): void {\r\n    this.$index = value;\r\n  }\r\n}\r\n\r\nexport class Cache<Data = unknown> {\r\n  minIndex: number;\r\n  maxIndex: number;\r\n\r\n  readonly itemSize: number;\r\n  readonly saveData: boolean;\r\n  readonly cacheOnReload: boolean;\r\n  readonly sizeStrategy: SizeStrategy;\r\n  readonly logger: Logger;\r\n  private items: Map<number, ItemCache<Data>>;\r\n  private defaultSize: DefaultSize;\r\n\r\n  constructor({ itemSize, cacheData, cacheOnReload, sizeStrategy }: Settings, logger: Logger) {\r\n    this.itemSize = itemSize;\r\n    this.saveData = cacheData;\r\n    this.cacheOnReload = cacheOnReload;\r\n    this.sizeStrategy = sizeStrategy;\r\n    this.logger = logger;\r\n    this.items = new Map<number, ItemCache<Data>>();\r\n    this.defaultSize = new DefaultSize(itemSize, sizeStrategy);\r\n    this.reset(true);\r\n  }\r\n\r\n  reset(force: boolean): void {\r\n    force = force || !this.cacheOnReload;\r\n    if (force) {\r\n      this.minIndex = +Infinity;\r\n      this.maxIndex = -Infinity;\r\n      this.items.clear();\r\n    }\r\n    this.defaultSize.reset(force);\r\n  }\r\n\r\n  get size(): number {\r\n    return this.items.size;\r\n  }\r\n\r\n  get(index: number): ItemCache<Data> | undefined {\r\n    return this.items.get(index);\r\n  }\r\n\r\n  getSizeByIndex(index: number): number {\r\n    const item = this.get(index);\r\n    return item && item.size || this.defaultSize.get();\r\n  }\r\n\r\n  getDefaultSize(): number {\r\n    return this.defaultSize.get();\r\n  }\r\n\r\n  recalculateDefaultSize(): boolean {\r\n    if (this.defaultSize.recalculate(this.size)) {\r\n      this.logger.log(() => `default size has been updated: ${this.defaultSize.get()}`);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * Adds item to Set by $index, replaces existed item if $index matches.\r\n   * Maintains min/max indexes and default item size.\r\n   *\r\n   * @param {Item<Data>} item A Buffer item to be cached, an objects with { $index, data, size } props.\r\n   * \r\n   * @returns {ItemCache<Data>} Cached item.\r\n   */\r\n  add(item: Item<Data>): ItemCache<Data> {\r\n    let itemCache = this.get(item.$index);\r\n    if (itemCache) { // adding item is already cached\r\n      if (this.saveData) {\r\n        itemCache.data = item.data;\r\n      }\r\n      if (itemCache.size !== item.size) {\r\n        if (itemCache.size) {\r\n          this.defaultSize.setExisted(itemCache.size, item.size);\r\n        } else {\r\n          this.defaultSize.setNew(item.size);\r\n        }\r\n        itemCache.size = item.size;\r\n      }\r\n    } else {\r\n      itemCache = new ItemCache<Data>(item, this.saveData);\r\n      this.items.set(item.$index, itemCache);\r\n      this.defaultSize.setNew(item.size);\r\n    }\r\n    if (item.$index < this.minIndex) {\r\n      this.minIndex = item.$index;\r\n    }\r\n    if (item.$index > this.maxIndex) {\r\n      this.maxIndex = item.$index;\r\n    }\r\n    return itemCache;\r\n  }\r\n\r\n  /**\r\n   * Inserts items to Set, shifts $indexes of items that remain.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes.\r\n   *\r\n   * @param {Data[]} toInsert List of non-indexed items to be inserted.\r\n   * @param {number} index The index before/after which the insertion is performed.\r\n   * @param {Direction} direction Determines the direction of insertion.\r\n   * @param {boolean} fixRight Defines indexes shifting strategy.\r\n   * If false, indexes that are greater than the inserted ones are increased.\r\n   * If true, indexes that are less than than the inserted ones are decreased.\r\n   */\r\n  insertItems(toInsert: Data[], index: number, direction: Direction, fixRight: boolean): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    const length = toInsert.length;\r\n    let min = Infinity, max = -Infinity;\r\n    const set = (item: ItemCache<Data>) => {\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    };\r\n    this.items.forEach(item => {\r\n      let shift = 0;\r\n      if (direction === Direction.backward) {\r\n        if (item.$index < index && fixRight) {\r\n          shift = -length;\r\n        } else if (item.$index >= index && !fixRight) {\r\n          shift = length;\r\n        }\r\n      } else if (direction === Direction.forward) {\r\n        if (item.$index <= index && fixRight) {\r\n          shift = -length;\r\n        } else if (item.$index > index && !fixRight) {\r\n          shift = length;\r\n        }\r\n      }\r\n      if (shift) {\r\n        item.changeIndex(item.$index + shift);\r\n      }\r\n      set(item);\r\n    });\r\n    if (this.saveData) { // persist data with no sizes\r\n      toInsert.forEach((data, i) => {\r\n        const $index = index + i - (fixRight ? length : 0) + (direction === Direction.forward ? 1 : 0);\r\n        const item = new ItemCache<Data>({ $index, data }, this.saveData);\r\n        set(item);\r\n      });\r\n    }\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n\r\n  /**\r\n   * Removes items from Set, shifts $indexes of items that remain.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes and default item size.\r\n   *\r\n   * @param {number[]} toRemove List of indexes to be removed.\r\n   * @param {boolean} fixRight Defines indexes shifting strategy.\r\n   * If false, indexes that are greater than the removed ones will be decreased.\r\n   * If true, indexes that are less than than the removed ones will be increased.\r\n   */\r\n  removeItems(toRemove: number[], fixRight: boolean): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    let min = Infinity, max = -Infinity;\r\n    this.items.forEach(item => {\r\n      if (toRemove.some(index => index === item.$index)) {\r\n        if (item.size) {\r\n          this.defaultSize.setRemoved(item.size);\r\n        }\r\n        return;\r\n      }\r\n      const diff = fixRight\r\n        ? toRemove.reduce((acc, index) => acc + (item.$index < index ? 1 : 0), 0)\r\n        : toRemove.reduce((acc, index) => acc - (item.$index > index ? 1 : 0), 0);\r\n      item.changeIndex(item.$index + diff);\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    });\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n\r\n  /**\r\n   * Destructively updates Set based on subset (before-after) changes.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes. Maintains default item size on remove only.\r\n   *\r\n   * @param {ItemUpdate[]} before Initial subset of items to be replaced by \"after\".\r\n   * Each element is an object with { $index, size, toRemove } props. Must be $index-incremental.\r\n   * Items to be removed must have toRemove flag: before[].toRemove = true.\r\n   * @param {Item<Data>[]} after Transformed subset that replaces \"before\". Must be $index-incremental.\r\n   * Must contain at least 1 $index from \"before\" or be empty.\r\n   * @param {boolean} fixRight This is to fix right indexes during subset collapsing. Acts only if \"after\" is empty.\r\n   */\r\n  updateSubset(before: ItemUpdate[], after: Item<Data>[], fixRight?: boolean): void {\r\n    if (!this.size || !before.length) {\r\n      return;\r\n    }\r\n    const minB = before[0].$index, maxB = before[before.length - 1].$index;\r\n    let leftDiff: number, rightDiff: number;\r\n    if (after.length) {\r\n      const minA = after[0].$index, maxA = after[after.length - 1].$index;\r\n      leftDiff = minA - minB;\r\n      rightDiff = maxA - maxB;\r\n    } else {\r\n      leftDiff = fixRight ? maxB - minB + 1 : 0;\r\n      rightDiff = fixRight ? 0 : minB - maxB - 1;\r\n    }\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    this.items.forEach(item => {\r\n      if (item.$index < minB) { // items to the left of the subset\r\n        item.changeIndex(item.$index + leftDiff);\r\n        items.set(item.$index, item);\r\n        return;\r\n      } else if (item.$index > maxB) { // items to the right of the subset\r\n        item.changeIndex(item.$index + rightDiff);\r\n        items.set(item.$index, item);\r\n        return;\r\n      }\r\n    });\r\n    after.forEach(item => // subset items\r\n      items.set(item.$index, new ItemCache<Data>(item, this.saveData))\r\n    );\r\n    before // to maintain default size on remove\r\n      .filter(item => item.toRemove)\r\n      .forEach(item => this.defaultSize.setRemoved(item.size));\r\n    this.minIndex += leftDiff;\r\n    this.maxIndex += rightDiff;\r\n    this.items = items;\r\n  }\r\n\r\n  /**\r\n   * Shifts all indexes by some value.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes.\r\n   *\r\n   * @param {number} delta A shift value.\r\n   */\r\n  shiftIndexes(delta: number): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    let min = Infinity, max = -Infinity;\r\n    this.items.forEach(item => {\r\n      item.changeIndex(item.$index + delta);\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    });\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../../../src/classes/buffer/cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAI5C,OAAO,EAAgB,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAc7D,MAAM,OAAO,SAAS;IAMpB,YAAY,IAAuB,EAAE,QAAiB;QACpD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,WAAW,CAAC,KAAa;QACvB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AAED,MAAM,OAAO,KAAK;IAYhB,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY,EAAY,EAAE,MAAc;QACxF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,KAAc;QAClB,KAAK,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,CAAC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,cAAc,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;IACrD,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;IAChC,CAAC;IAED,sBAAsB;QACpB,IAAI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,kCAAkC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAClF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,IAAgB;QAClB,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,SAAS,EAAE,CAAC,CAAC,gCAAgC;YAC/C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC7B,CAAC;YACD,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;gBACjC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzD,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrC,CAAC;gBACD,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC7B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,IAAI,SAAS,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QAC9B,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QAC9B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,QAAgB,EAAE,KAAa,EAAE,SAAoB,EAAE,QAAiB;QAClF,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,IAAqB,EAAE,EAAE;YACpC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,SAAS,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACpC,KAAK,GAAG,CAAC,MAAM,CAAC;gBAClB,CAAC;qBAAM,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAC7C,KAAK,GAAG,MAAM,CAAC;gBACjB,CAAC;YACH,CAAC;iBAAM,IAAI,SAAS,KAAK,SAAS,CAAC,OAAO,EAAE,CAAC;gBAC3C,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACrC,KAAK,GAAG,CAAC,MAAM,CAAC;gBAClB,CAAC;qBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAC5C,KAAK,GAAG,MAAM,CAAC;gBACjB,CAAC;YACH,CAAC;YACD,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YACxC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,6BAA6B;YAChD,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/F,MAAM,IAAI,GAAG,IAAI,SAAS,CAAO,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClE,GAAG,CAAC,IAAI,CAAC,CAAC;YACZ,CAAC,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,QAAkB,EAAE,QAAiB;QAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACd,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzC,CAAC;gBACD,OAAO;YACT,CAAC;YACD,MAAM,IAAI,GAAG,QAAQ;gBACnB,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,YAAY,CAAC,MAAoB,EAAE,KAAmB,EAAE,QAAkB;QACxE,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjC,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACvE,IAAI,QAAgB,EAAE,SAAiB,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YACpE,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;YACvB,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,kCAAkC;gBAC1D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;gBACzC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC7B,OAAO;YACT,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,mCAAmC;gBAClE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;gBAC1C,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC7B,OAAO;YACT,CAAC;QACH,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe;SACnC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,SAAS,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CACjE,CAAC;QACF,MAAM,CAAC,qCAAqC;aACzC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;aAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,KAAa;QACxB,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;QACjD,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YACtC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7B,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtB,CAAC;CACF","sourcesContent":["import { DefaultSize } from './defaultSize';\r\nimport { Item } from '../item';\r\nimport { Settings } from '../settings';\r\nimport { Logger } from '../logger';\r\nimport { SizeStrategy, Direction } from '../../inputs/index';\r\n\r\ninterface ItemToCache<Data> {\r\n  $index: number;\r\n  data: Data;\r\n  size?: number;\r\n}\r\n\r\ninterface ItemUpdate {\r\n  $index: number;\r\n  size: number;\r\n  toRemove?: boolean;\r\n}\r\n\r\nexport class ItemCache<Data = unknown> {\r\n  $index: number;\r\n  data: Data | null;\r\n  size?: number;\r\n  position: number;\r\n\r\n  constructor(item: ItemToCache<Data>, saveData: boolean) {\r\n    this.$index = item.$index;\r\n    this.data = saveData ? item.data : null;\r\n    this.size = item.size;\r\n  }\r\n\r\n  changeIndex(value: number): void {\r\n    this.$index = value;\r\n  }\r\n}\r\n\r\nexport class Cache<Data = unknown> {\r\n  minIndex: number;\r\n  maxIndex: number;\r\n\r\n  readonly itemSize: number;\r\n  readonly saveData: boolean;\r\n  readonly cacheOnReload: boolean;\r\n  readonly sizeStrategy: SizeStrategy;\r\n  readonly logger: Logger;\r\n  private items: Map<number, ItemCache<Data>>;\r\n  private defaultSize: DefaultSize;\r\n\r\n  constructor({ itemSize, cacheData, cacheOnReload, sizeStrategy }: Settings, logger: Logger) {\r\n    this.itemSize = itemSize;\r\n    this.saveData = cacheData;\r\n    this.cacheOnReload = cacheOnReload;\r\n    this.sizeStrategy = sizeStrategy;\r\n    this.logger = logger;\r\n    this.items = new Map<number, ItemCache<Data>>();\r\n    this.defaultSize = new DefaultSize(itemSize, sizeStrategy);\r\n    this.reset(true);\r\n  }\r\n\r\n  reset(force: boolean): void {\r\n    force = force || !this.cacheOnReload;\r\n    if (force) {\r\n      this.minIndex = +Infinity;\r\n      this.maxIndex = -Infinity;\r\n      this.items.clear();\r\n    }\r\n    this.defaultSize.reset(force);\r\n  }\r\n\r\n  get size(): number {\r\n    return this.items.size;\r\n  }\r\n\r\n  get(index: number): ItemCache<Data> | undefined {\r\n    return this.items.get(index);\r\n  }\r\n\r\n  getSizeByIndex(index: number): number {\r\n    const item = this.get(index);\r\n    return item && item.size || this.defaultSize.get();\r\n  }\r\n\r\n  getDefaultSize(): number {\r\n    return this.defaultSize.get();\r\n  }\r\n\r\n  recalculateDefaultSize(): boolean {\r\n    if (this.defaultSize.recalculate(this.size)) {\r\n      this.logger.log(() => `default size has been updated: ${this.defaultSize.get()}`);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /**\r\n   * Adds item to Set by $index, replaces existed item if $index matches.\r\n   * Maintains min/max indexes and default item size.\r\n   *\r\n   * @param {Item<Data>} item A Buffer item to be cached, an objects with { $index, data, size } props.\r\n   * \r\n   * @returns {ItemCache<Data>} Cached item.\r\n   */\r\n  add(item: Item<Data>): ItemCache<Data> {\r\n    let itemCache = this.get(item.$index);\r\n    if (itemCache) { // adding item is already cached\r\n      if (this.saveData) {\r\n        itemCache.data = item.data;\r\n      }\r\n      if (itemCache.size !== item.size) {\r\n        if (itemCache.size) {\r\n          this.defaultSize.setExisted(itemCache.size, item.size);\r\n        } else {\r\n          this.defaultSize.setNew(item.size);\r\n        }\r\n        itemCache.size = item.size;\r\n      }\r\n    } else {\r\n      itemCache = new ItemCache<Data>(item, this.saveData);\r\n      this.items.set(item.$index, itemCache);\r\n      this.defaultSize.setNew(item.size);\r\n    }\r\n    if (item.$index < this.minIndex) {\r\n      this.minIndex = item.$index;\r\n    }\r\n    if (item.$index > this.maxIndex) {\r\n      this.maxIndex = item.$index;\r\n    }\r\n    return itemCache;\r\n  }\r\n\r\n  /**\r\n   * Inserts items to Set, shifts $indexes of items that remain.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes.\r\n   *\r\n   * @param {Data[]} toInsert List of non-indexed items to be inserted.\r\n   * @param {number} index The index before/after which the insertion is performed.\r\n   * @param {Direction} direction Determines the direction of insertion.\r\n   * @param {boolean} fixRight Defines indexes shifting strategy.\r\n   * If false, indexes that are greater than the inserted ones are increased.\r\n   * If true, indexes that are less than than the inserted ones are decreased.\r\n   */\r\n  insertItems(toInsert: Data[], index: number, direction: Direction, fixRight: boolean): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    const length = toInsert.length;\r\n    let min = Infinity, max = -Infinity;\r\n    const set = (item: ItemCache<Data>) => {\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    };\r\n    this.items.forEach(item => {\r\n      let shift = 0;\r\n      if (direction === Direction.backward) {\r\n        if (item.$index < index && fixRight) {\r\n          shift = -length;\r\n        } else if (item.$index >= index && !fixRight) {\r\n          shift = length;\r\n        }\r\n      } else if (direction === Direction.forward) {\r\n        if (item.$index <= index && fixRight) {\r\n          shift = -length;\r\n        } else if (item.$index > index && !fixRight) {\r\n          shift = length;\r\n        }\r\n      }\r\n      if (shift) {\r\n        item.changeIndex(item.$index + shift);\r\n      }\r\n      set(item);\r\n    });\r\n    if (this.saveData) { // persist data with no sizes\r\n      toInsert.forEach((data, i) => {\r\n        const $index = index + i - (fixRight ? length : 0) + (direction === Direction.forward ? 1 : 0);\r\n        const item = new ItemCache<Data>({ $index, data }, this.saveData);\r\n        set(item);\r\n      });\r\n    }\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n\r\n  /**\r\n   * Removes items from Set, shifts $indexes of items that remain.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes and default item size.\r\n   *\r\n   * @param {number[]} toRemove List of indexes to be removed.\r\n   * @param {boolean} fixRight Defines indexes shifting strategy.\r\n   * If false, indexes that are greater than the removed ones will be decreased.\r\n   * If true, indexes that are less than than the removed ones will be increased.\r\n   */\r\n  removeItems(toRemove: number[], fixRight: boolean): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    let min = Infinity, max = -Infinity;\r\n    this.items.forEach(item => {\r\n      if (toRemove.some(index => index === item.$index)) {\r\n        if (item.size) {\r\n          this.defaultSize.setRemoved(item.size);\r\n        }\r\n        return;\r\n      }\r\n      const diff = fixRight\r\n        ? toRemove.reduce((acc, index) => acc + (item.$index < index ? 1 : 0), 0)\r\n        : toRemove.reduce((acc, index) => acc - (item.$index > index ? 1 : 0), 0);\r\n      item.changeIndex(item.$index + diff);\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    });\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n\r\n  /**\r\n   * Destructively updates Set based on subset (before-after) changes.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes. Maintains default item size on remove only.\r\n   *\r\n   * @param {ItemUpdate[]} before Initial subset of items to be replaced by \"after\".\r\n   * Each element is an object with { $index, size, toRemove } props. Must be $index-incremental.\r\n   * Items to be removed must have toRemove flag: before[].toRemove = true.\r\n   * @param {Item<Data>[]} after Transformed subset that replaces \"before\". Must be $index-incremental.\r\n   * Must contain at least 1 $index from \"before\" or be empty.\r\n   * @param {boolean} fixRight This is to fix right indexes during subset collapsing. Acts only if \"after\" is empty.\r\n   */\r\n  updateSubset(before: ItemUpdate[], after: Item<Data>[], fixRight?: boolean): void {\r\n    if (!this.size || !before.length) {\r\n      return;\r\n    }\r\n    const minB = before[0].$index, maxB = before[before.length - 1].$index;\r\n    let leftDiff: number, rightDiff: number;\r\n    if (after.length) {\r\n      const minA = after[0].$index, maxA = after[after.length - 1].$index;\r\n      leftDiff = minA - minB;\r\n      rightDiff = maxA - maxB;\r\n    } else {\r\n      leftDiff = fixRight ? maxB - minB + 1 : 0;\r\n      rightDiff = fixRight ? 0 : minB - maxB - 1;\r\n    }\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    this.items.forEach(item => {\r\n      if (item.$index < minB) { // items to the left of the subset\r\n        item.changeIndex(item.$index + leftDiff);\r\n        items.set(item.$index, item);\r\n        return;\r\n      } else if (item.$index > maxB) { // items to the right of the subset\r\n        item.changeIndex(item.$index + rightDiff);\r\n        items.set(item.$index, item);\r\n        return;\r\n      }\r\n    });\r\n    after.forEach(item => // subset items\r\n      items.set(item.$index, new ItemCache<Data>(item, this.saveData))\r\n    );\r\n    before // to maintain default size on remove\r\n      .filter(item => item.toRemove)\r\n      .forEach(item => this.defaultSize.setRemoved(item.size));\r\n    this.minIndex += leftDiff;\r\n    this.maxIndex += rightDiff;\r\n    this.items = items;\r\n  }\r\n\r\n  /**\r\n   * Shifts all indexes by some value.\r\n   * Replaces current Set with a new one with new regular $indexes.\r\n   * Maintains min/max indexes.\r\n   *\r\n   * @param {number} delta A shift value.\r\n   */\r\n  shiftIndexes(delta: number): void {\r\n    const items = new Map<number, ItemCache<Data>>();\r\n    let min = Infinity, max = -Infinity;\r\n    this.items.forEach(item => {\r\n      item.changeIndex(item.$index + delta);\r\n      items.set(item.$index, item);\r\n      min = item.$index < min ? item.$index : min;\r\n      max = item.$index > max ? item.$index : max;\r\n    });\r\n    this.items = items;\r\n    this.minIndex = min;\r\n    this.maxIndex = max;\r\n  }\r\n}\r\n"]}